{"meta":{"query_hash":"2ecb0c628f68","filters":{"topic":"Optimization and Variational Analysis"},"cohort_total":732,"direct_labels_cover":1,"predictions_cover":732,"exported":732,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/2ecb0c628f68","api":"https://metacan.xera.ac/api/v1/cohort?topic=Optimization+and+Variational+Analysis"},"results":[{"id":"W13220323","doi":"10.1023/a:1017543626630","title":"Some Predictor-Corrector Algorithms for Multivalued Variational Inequalities","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Variational inequality; Monotonic function; Theory of computation; Convergence (economics); Predictor–corrector method; Operator (biology); Class (philosophy); Algorithm; Applied mathematics; Mathematical optimization; Mathematical analysis; Computer science; Artificial intelligence","score_opus":0.020403023285981526,"score_gpt":0.2790420760848995,"score_spread":0.25863905279891797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13220323","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058141122,0.00022665733,0.99789107,0.0012263451,0.00014038669,0.00023063464,0.000018578992,0.000035755904,0.00017244332],"genre_scores_gemma":[0.03873126,0.0007814919,0.9564806,0.00095330883,0.0013131287,0.00017306427,0.00008486626,0.0000202989,0.0014619655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883074,0.00016578821,0.0004987888,0.00016681523,0.00022484224,0.00011303825],"domain_scores_gemma":[0.99784684,0.0007565204,0.0004723478,0.00015749078,0.000664593,0.00010221429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012061356,0.000105892905,0.00017717823,0.00023137861,0.00026190362,0.00014023295,0.00029889878,0.000057976482,0.000060911672],"category_scores_gemma":[0.0002530084,0.00009212554,0.00009838033,0.00039847416,0.000038193426,0.0009293824,0.000038253755,0.000074011245,0.0000020747786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027007229,0.000080878366,0.00006491321,0.000004757222,0.000051984167,2.0997359e-7,0.000171247,0.32022783,0.000016946695,0.6766463,0.00011232865,0.0025956081],"study_design_scores_gemma":[0.0006899237,0.000053216452,0.00021787595,0.000008999216,0.00005176573,0.00003184336,0.000089411085,0.8105748,0.000039430408,0.18329921,0.0048263147,0.00011718031],"about_ca_topic_score_codex":0.0000010614854,"about_ca_topic_score_gemma":1.5434627e-7,"teacher_disagreement_score":0.49334708,"about_ca_system_score_codex":0.000033572273,"about_ca_system_score_gemma":0.000101346755,"threshold_uncertainty_score":0.37567705},"labels":[],"label_agreement":null},{"id":"W141986059","doi":"10.1023/a:1010917903065","title":"Stability in Linear Programming Models: An Index Set Approach","year":2001,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Theory of computation; Linear programming; Parametric programming; Mathematical optimization; Stability (learning theory); Applied mathematics; Parametric statistics; Set (abstract data type); Computer science; Algorithm; Statistics","score_opus":0.4544589079224721,"score_gpt":0.47320677683012763,"score_spread":0.018747868907655507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W141986059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08327162,0.000045817396,0.9107879,0.0034260014,0.0000145519125,0.00031251085,0.0000055857167,0.000033749802,0.0021022523],"genre_scores_gemma":[0.92572093,0.00007717767,0.07381324,0.00007772037,0.000023432944,0.00005734067,0.00004362043,0.0000044556155,0.00018209795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980196,0.00043871722,0.00031210936,0.0003302277,0.0006276844,0.00027167256],"domain_scores_gemma":[0.9980378,0.00006588512,0.000018703782,0.0004990317,0.0012754304,0.00010312568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025509147,0.00006803338,0.00012894961,0.0004624635,0.00019981907,0.00019300009,0.00059736974,0.000055652876,0.00005309318],"category_scores_gemma":[0.00018237179,0.00006236794,0.000041509273,0.0023904655,0.00006808184,0.0014204163,0.00015684767,0.00020429872,0.000007669876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010374975,0.0006481687,0.0037226938,0.000008220189,0.000012504073,0.0000015700535,0.0017850829,0.91288084,0.000037631908,0.076309495,0.000057882713,0.00452552],"study_design_scores_gemma":[0.00011450279,0.000057931415,0.0019543555,0.000003793553,5.89936e-7,0.0000010936058,0.0002934305,0.9957323,0.00009707004,0.0014165518,0.0002635378,0.0000648379],"about_ca_topic_score_codex":0.0009304816,"about_ca_topic_score_gemma":0.00049885124,"teacher_disagreement_score":0.8424493,"about_ca_system_score_codex":0.000020885489,"about_ca_system_score_gemma":0.00022598456,"threshold_uncertainty_score":0.2543291},"labels":[],"label_agreement":null},{"id":"W1484074384","doi":"10.3968/j.sms.1923845220130701.6138","title":"Fritz John Type Duality in Nondifferentiable Continuous Programming with Equality and Inequality Constraints","year":2013,"lang":"en","type":"article","venue":"Studies in mathematical sciences","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Duality (order theory); Convexity; Type (biology); Dual (grammatical number); Inequality; Strong duality; Karush–Kuhn–Tucker conditions; Nonlinear programming; Mathematical economics; Wolfe duality; Mathematical optimization; Applied mathematics; Algebra over a field; Nonlinear system; Weak duality; Pure mathematics; Optimization problem; Mathematical analysis; Philosophy","score_opus":0.07353048159592546,"score_gpt":0.3487043867992529,"score_spread":0.27517390520332746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484074384","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7727303,0.0002599489,0.21484429,0.003441525,0.00011045535,0.0007061553,0.0000017860326,0.00009219137,0.007813337],"genre_scores_gemma":[0.8952352,0.00001919023,0.10454575,0.000103287806,0.000006433631,0.00003243929,4.0922683e-7,0.0000015558933,0.000055735563],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984665,0.0001678281,0.000378301,0.00035243933,0.0003644627,0.00027046152],"domain_scores_gemma":[0.9990862,0.00046149988,0.0000981387,0.00015087036,0.00014465277,0.00005862299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016392216,0.000112522495,0.00031914416,0.000100069046,0.0001473221,0.0001962862,0.0002973326,0.000030846815,0.000082789455],"category_scores_gemma":[0.0005635846,0.00007107387,0.000018384382,0.0010833507,0.0008986727,0.00044682043,0.00024014465,0.00008542616,0.000012554449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045664874,0.0004369603,0.15057078,0.00021200006,0.000058301845,0.0000056391214,0.007546882,0.00020689605,0.000022793043,0.8329731,0.000048550122,0.007913486],"study_design_scores_gemma":[0.0013417318,0.000409098,0.15465651,0.00048179406,0.000031414675,0.000019913585,0.012918914,0.2363226,0.00007706637,0.5928324,0.00009594735,0.0008126287],"about_ca_topic_score_codex":0.00012578757,"about_ca_topic_score_gemma":0.00013466747,"teacher_disagreement_score":0.24014075,"about_ca_system_score_codex":0.000030514171,"about_ca_system_score_gemma":0.000042482872,"threshold_uncertainty_score":0.3311197},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Subderivative; Monotonic function; Monotone polygon; Banach space; Regular polygon; Closed set; Function (biology); Convex function","score_opus":0.02404510212620979,"score_gpt":0.2523662866681549,"score_spread":0.2283211845419451,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1507079114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085416496,0.0001225408,0.9112754,0.002449055,0.000089741276,0.00008910139,0.000023414426,0.0000895092,0.00044475024],"genre_scores_gemma":[0.9523749,0.0000383681,0.046519123,0.00047558986,0.00009755742,0.00000807528,0.00014619195,0.0000057912735,0.00033443116],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981987,0.00017621416,0.00033540843,0.00054498436,0.0005373553,0.00020732947],"domain_scores_gemma":[0.9987803,0.00009281419,0.0001700777,0.0002869219,0.00038552046,0.0002843613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006220152,0.00018469726,0.00036620582,0.0004148197,0.0002497796,0.0003300648,0.00025233155,0.000091318405,0.00007123709],"category_scores_gemma":[0.000111874666,0.00016446112,0.00014025539,0.0013632644,0.000045827182,0.00048044295,0.0002484603,0.00010014765,0.000016256301],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047290174,0.00019372116,0.070306286,0.000011795284,0.0023106388,0.000007851149,0.0013970986,0.018088948,0.00010486914,0.9053894,0.00046575378,0.0016763333],"study_design_scores_gemma":[0.00041734744,0.000025359926,0.16757505,0.0000015893044,0.0005774633,0.0000054819343,0.000031426458,0.812325,0.00003100932,0.018688306,0.00013342834,0.0001885327],"about_ca_topic_score_codex":0.00034990284,"about_ca_topic_score_gemma":0.00007419644,"teacher_disagreement_score":0.8867011,"about_ca_system_score_codex":0.000052555824,"about_ca_system_score_gemma":0.00010161553,"threshold_uncertainty_score":0.670653},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03689424208681979,"score_gpt":0.27897625143476223,"score_spread":0.24208200934794244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522131509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019378034,0.00016143834,0.9627993,0.0074706627,0.00033389454,0.00011165263,0.000031727646,0.00038411628,0.009329166],"genre_scores_gemma":[0.9610939,0.0001467465,0.025940824,0.0044636223,0.000472336,0.000020511588,0.0003514901,0.00001599603,0.0074945423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976192,0.00016408272,0.0004830027,0.0006829437,0.00075547886,0.0002952714],"domain_scores_gemma":[0.9984836,0.00014903166,0.00024329282,0.0007253382,0.000246653,0.0001520607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005244774,0.00019591628,0.00033636624,0.0011216699,0.0003388486,0.00022280203,0.00058140996,0.00007901366,0.0002444677],"category_scores_gemma":[0.00013342463,0.000174901,0.00035882206,0.005950622,0.000020000014,0.0004962513,0.00011055731,0.00012380074,0.00031615284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031302716,0.00013340342,0.0008311081,0.0000013822985,0.001370487,0.000014467192,0.00028405947,0.92455804,0.000028015256,0.06815595,0.0018816402,0.0027101175],"study_design_scores_gemma":[0.00052132935,0.0000575735,0.0067423508,0.0000034149366,0.00042818123,0.000002683039,0.000050668685,0.9853488,0.000023261235,0.0019592973,0.004621618,0.00024082756],"about_ca_topic_score_codex":0.00011286437,"about_ca_topic_score_gemma":0.000036482557,"teacher_disagreement_score":0.9417159,"about_ca_system_score_codex":0.000087885695,"about_ca_system_score_gemma":0.00005726123,"threshold_uncertainty_score":0.71322554},"labels":[],"label_agreement":null},{"id":"W1534940407","doi":"","title":"Compactly epi-Lipschitzian convex sets and functions in normed spaces","year":2000,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":51,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Simon Fraser University","funders":"","keywords":"Mathematics; Subspace topology; Codimension; Pure mathematics; Regular polygon; Convex analysis; Convex function; Boundary (topology); Convexity; Mathematical analysis; Convex optimization; Geometry","score_opus":0.009972924484827245,"score_gpt":0.22752086528444795,"score_spread":0.2175479407996207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1534940407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24887674,0.00009593796,0.5356473,0.037490126,0.00017457084,0.0002298475,0.00000929492,0.0003076449,0.1771686],"genre_scores_gemma":[0.9676752,0.000025282601,0.022585278,0.0011349448,0.000013538927,0.000003520337,0.000008836457,0.0000025128409,0.008550884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994463,0.00003402522,0.00012516351,0.00017603242,0.00011134325,0.00010714513],"domain_scores_gemma":[0.9996898,0.00005236936,0.000021335776,0.00013682702,0.00002858069,0.000071091825],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000089234076,0.00006261172,0.000096131356,0.00011587958,0.00007826371,0.0001358882,0.0001275503,0.000025233585,0.0017061663],"category_scores_gemma":[0.000009377918,0.00005282561,0.000022642875,0.00046483148,0.000019297288,0.00034773498,0.000024129222,0.000047206635,0.0001833269],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043522017,0.0007422484,0.27085766,0.000025587933,0.0002056533,0.00002352925,0.0043332954,0.112896316,0.0001364957,0.44241697,0.01616698,0.15215175],"study_design_scores_gemma":[0.00038936574,0.00002044113,0.14232695,0.0000037405339,0.000005615302,0.0000057944894,0.000052574684,0.84782505,0.000013681123,0.0012209078,0.008011248,0.000124635],"about_ca_topic_score_codex":0.0001854615,"about_ca_topic_score_gemma":0.00032001184,"teacher_disagreement_score":0.7349287,"about_ca_system_score_codex":0.000011973523,"about_ca_system_score_gemma":0.000026233341,"threshold_uncertainty_score":0.9992064},"labels":[],"label_agreement":null},{"id":"W1536462627","doi":"10.1007/978-1-4419-9569-8_2","title":"Self-Dual Smooth Approximations of Convex Functions via the Proximal Average","year":2011,"lang":"en","type":"book-chapter","venue":"Springer optimization and its applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Smoothing; Dual (grammatical number); Operator (biology); Mathematics; Regular polygon; Duality (order theory); Convex analysis; Norm (philosophy); Convex function; Pure mathematics; Convex optimization; Geometry; Statistics","score_opus":0.015098410703590193,"score_gpt":0.20542018880365076,"score_spread":0.19032177810006057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536462627","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[5.590653e-7,0.0003423848,0.86537814,0.0009873024,0.000074180374,0.00093109085,0.00005592488,0.00020770972,0.13202271],"genre_scores_gemma":[0.024603808,0.005307964,0.5932653,0.0013588594,0.0006220132,0.001762665,0.0011893176,0.0002383225,0.37165177],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998187,0.00003557864,0.00064710045,0.0005758667,0.00036577374,0.0001886487],"domain_scores_gemma":[0.9976837,0.000110466994,0.0006170004,0.000773326,0.0006893137,0.00012619855],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00023019094,0.00031962772,0.00033568547,0.00032581377,0.0005323392,0.00013997023,0.0005436583,0.00022813401,0.00066411326],"category_scores_gemma":[0.000018223831,0.0002693476,0.00015943704,0.00035879802,0.00009912614,0.0003937844,0.00025987352,0.00026423406,0.00010633627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021615076,0.00009260503,0.0000039178444,0.000046854428,0.00015856244,2.039872e-7,0.00031166515,0.02916658,0.0000080829395,0.9682533,0.00019716671,0.0017588622],"study_design_scores_gemma":[0.00027606872,0.000036085607,0.00003960736,0.000023355862,0.00024685942,0.000009654408,0.000010358057,0.8612865,0.00004587179,0.008950989,0.12865327,0.00042137722],"about_ca_topic_score_codex":0.0000059364465,"about_ca_topic_score_gemma":0.0000037997129,"teacher_disagreement_score":0.95930237,"about_ca_system_score_codex":0.000046581066,"about_ca_system_score_gemma":0.00016083015,"threshold_uncertainty_score":0.99997586},"labels":[],"label_agreement":null},{"id":"W1536879944","doi":"10.1090/s0002-9939-05-07719-1","title":"A new proximal point iteration that converges weakly but not in norm","year":2005,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Norm (philosophy); Mathematics; Applied mathematics; Pure mathematics","score_opus":0.011626525216818775,"score_gpt":0.23340903688562123,"score_spread":0.22178251166880245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1536879944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34353825,0.000018754772,0.5753274,0.07614694,0.000051890853,0.00054119364,0.0000032486273,0.00022730906,0.0041449945],"genre_scores_gemma":[0.6593993,0.000009482454,0.3387836,0.0012764186,0.00004387219,0.000010328769,2.3230244e-7,0.0000071013287,0.00046967826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887806,0.0000073866468,0.00030156507,0.00022221358,0.00041451334,0.00017625024],"domain_scores_gemma":[0.999269,0.000072198214,0.0003377424,0.00011939569,0.00013204636,0.00006961077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030966158,0.00011549978,0.00024929954,0.00003558219,0.00006875461,0.00011594178,0.00058283436,0.00002924857,0.000049626746],"category_scores_gemma":[0.00010400338,0.00007916975,0.00021178387,0.0006827651,0.000092334216,0.0005424587,0.0002080907,0.00011303977,0.000021555727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000369328,0.0005933654,0.0108366385,0.00019170625,0.00017982774,1.7071926e-7,0.015355634,0.0007923185,0.020281775,0.93101066,0.009456208,0.011264784],"study_design_scores_gemma":[0.00041228536,0.00006244514,0.012875936,0.00006712759,0.000035257726,0.0000074329064,0.000778276,0.9299324,0.023410339,0.031890023,0.00027115433,0.00025729643],"about_ca_topic_score_codex":0.000033046468,"about_ca_topic_score_gemma":0.00000157953,"teacher_disagreement_score":0.9291401,"about_ca_system_score_codex":0.00007656258,"about_ca_system_score_gemma":0.00005010392,"threshold_uncertainty_score":0.3228449},"labels":[],"label_agreement":null},{"id":"W1537475971","doi":"10.1090/s0002-9939-03-07229-0","title":"On the Bartle-Graves theorem","year":2003,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Monotone polygon; Bounded function; Discrete mathematics; Pure mathematics; Set (abstract data type); Banach space; Bounded inverse theorem; Mathematical analysis; Computer science; Bounded operator","score_opus":0.01088055647142384,"score_gpt":0.2292844841287153,"score_spread":0.21840392765729147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537475971","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1992133,0.000026590043,0.5534819,0.05608422,0.000112156966,0.0006812328,0.0000047600397,0.0002390323,0.19015686],"genre_scores_gemma":[0.918789,0.000008546696,0.07781232,0.002875007,0.0000134044485,0.000014024726,7.413763e-8,0.0000071896097,0.00048042682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990813,0.000020150623,0.00019113063,0.00016882132,0.00038978545,0.00014881167],"domain_scores_gemma":[0.9989845,0.00037596878,0.0002589712,0.00019198233,0.00014637466,0.000042179643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005648873,0.000098890276,0.00017281473,0.000012888505,0.00019181293,0.00008924847,0.00081301166,0.000017614646,0.00008313593],"category_scores_gemma":[0.00058872177,0.000046318746,0.00028765673,0.0007962224,0.00029222833,0.000092456445,0.00011805978,0.000110245994,0.000026402184],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.054051e-7,0.000053139178,0.00010647532,0.0000080007785,0.000036810514,7.3211925e-9,0.0005918018,0.00003242535,0.00027670182,0.9963405,0.0024666705,0.00008667776],"study_design_scores_gemma":[0.00007199453,0.000035584064,0.0004837132,0.00001966286,0.000023860193,0.00000249772,0.0006615284,0.05893603,0.0031215108,0.9361847,0.0003576222,0.000101292695],"about_ca_topic_score_codex":0.0000014401927,"about_ca_topic_score_gemma":2.7195306e-8,"teacher_disagreement_score":0.7195757,"about_ca_system_score_codex":0.000020670052,"about_ca_system_score_gemma":0.000020690451,"threshold_uncertainty_score":0.18888237},"labels":[],"label_agreement":null},{"id":"W1538512259","doi":"10.1007/978-1-4614-7621-4_2","title":"New Demiclosedness Principles for (Firmly) Nonexpansive Operators","year":2013,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Linear subspace; Affine transformation; Simple (philosophy); Mathematics; Convergence (economics); Fixed point; Nonlinear system; Pure mathematics; Key (lock); Algebra over a field; Discrete mathematics; Computer science; Mathematical analysis; Philosophy; Physics; Epistemology","score_opus":0.027853196358145507,"score_gpt":0.2528962727150555,"score_spread":0.22504307635690998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1538512259","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011606048,0.00007232325,0.93266845,0.00023980794,0.00024643657,0.00088660454,0.000088336936,0.0001161149,0.065670304],"genre_scores_gemma":[0.00005708798,0.00014292968,0.8107967,0.00013118105,0.0001585172,0.000071842645,0.00003420216,0.000077734454,0.18852983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972469,0.0000035973299,0.001082669,0.00068361056,0.0005914954,0.0003916948],"domain_scores_gemma":[0.99732614,0.00030236813,0.00076169136,0.0003441252,0.0010586343,0.00020704651],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038028142,0.0005117986,0.0007072564,0.00043453844,0.00012933036,0.00052157533,0.0011066744,0.00032065358,0.00023890179],"category_scores_gemma":[0.0004132939,0.0005018845,0.00013190112,0.00014836679,0.000047641137,0.00039146875,0.00036545662,0.00034353693,0.0001865228],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020699958,0.00003384739,0.000016299811,0.00039131133,0.00008950276,0.000002995879,0.001310029,0.0002295552,0.000014652317,0.9908482,0.004738658,0.0023228975],"study_design_scores_gemma":[0.00043405034,0.000053355318,0.000020574967,0.00036659927,0.00011898229,0.000005801963,0.000054259977,0.32862893,0.00007096627,0.63614064,0.033362273,0.00074359385],"about_ca_topic_score_codex":0.000016211772,"about_ca_topic_score_gemma":0.00001353409,"teacher_disagreement_score":0.35470757,"about_ca_system_score_codex":0.00020348783,"about_ca_system_score_gemma":0.00035146181,"threshold_uncertainty_score":0.9997433},"labels":[],"label_agreement":null},{"id":"W1543457007","doi":"10.1109/cdc.2002.1184427","title":"Error bounds for lower semicontinuous inequality systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Omega; Mathematics; Subderivative; Combinatorics; Function (biology); Discrete mathematics; Physics; Regular polygon; Geometry; Quantum mechanics; Convex optimization","score_opus":0.026615974713845813,"score_gpt":0.27231009790622623,"score_spread":0.24569412319238043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1543457007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007157945,0.00002635183,0.98461545,0.0004046998,0.00041300815,0.00011192358,0.0000033068022,0.00009135468,0.013618115],"genre_scores_gemma":[0.8898662,0.0000020501097,0.09372678,0.0007870093,0.000045021676,0.00003404131,0.000009792476,0.0000051803086,0.015523982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930185,0.000056247092,0.00018951047,0.00019514057,0.00013292555,0.00012432756],"domain_scores_gemma":[0.9994079,0.00007794507,0.000060736453,0.00023968228,0.00016272473,0.000051015682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003996872,0.00006391118,0.00010892736,0.00005028837,0.00008754311,0.00018859512,0.00020476093,0.000038680344,0.00007716383],"category_scores_gemma":[0.00009978856,0.00005208724,0.00006007754,0.00025225332,0.000006862065,0.00022477751,0.000019940306,0.000026466483,0.000034645604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012180293,0.000045565168,0.00034735553,0.000005769223,0.000020248264,2.894899e-7,0.000061699604,0.004202545,0.000035476864,0.99129146,0.0038871178,0.00010127127],"study_design_scores_gemma":[0.00036771188,0.00003595788,0.00017541453,0.000003109648,0.000011887761,0.000003818493,0.00004426253,0.9047075,0.00010506202,0.0031355924,0.09123781,0.00017187181],"about_ca_topic_score_codex":0.000028475712,"about_ca_topic_score_gemma":0.0000062997196,"teacher_disagreement_score":0.98815584,"about_ca_system_score_codex":0.00002217621,"about_ca_system_score_gemma":0.000049797072,"threshold_uncertainty_score":0.2124056},"labels":[],"label_agreement":null},{"id":"W1546940848","doi":"10.1090/s0002-9939-02-06528-0","title":"The composition of projections onto closed convex sets in Hilbert space is asymptotically regular","year":2002,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Hilbert space; Conjecture; Pure mathematics; Regular polygon; Composition (language); Monotone polygon; Convex set; Projection (relational algebra); Convex analysis; Fixed point; Space (punctuation); Discrete mathematics; Combinatorics; Mathematical analysis; Convex optimization; Computer science; Geometry; Algorithm","score_opus":0.01099603097893961,"score_gpt":0.23352552936967402,"score_spread":0.2225294983907344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1546940848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49232423,0.00013123284,0.23061901,0.24627419,0.00013756179,0.0018265567,0.000017619284,0.00023922314,0.028430361],"genre_scores_gemma":[0.9074768,0.00005351792,0.09129637,0.0007441464,0.000013387934,0.000019677615,3.1310793e-7,0.000007752451,0.00038807298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987698,0.000020235651,0.0003854608,0.00019609976,0.0004558646,0.00017253764],"domain_scores_gemma":[0.99880254,0.00022713466,0.00042861945,0.0001880664,0.0003082304,0.000045402452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038345953,0.00010516678,0.00026932938,0.00002797248,0.00016970575,0.000066938795,0.00064695254,0.000034644912,0.000026384443],"category_scores_gemma":[0.00014251922,0.000063778505,0.00025549816,0.0011333274,0.00037448175,0.00017445175,0.00017583594,0.00012645937,0.0000064241076],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012814815,0.00077020697,0.0036573117,0.00015100939,0.00023849173,7.612405e-8,0.009808108,0.00018439046,0.005886712,0.9683717,0.009665058,0.0012541251],"study_design_scores_gemma":[0.00028216167,0.00007873563,0.0061684656,0.000078240286,0.000054015953,0.000005582751,0.00078466383,0.93476903,0.0032504087,0.05414587,0.00023110922,0.00015172445],"about_ca_topic_score_codex":0.000025329071,"about_ca_topic_score_gemma":9.142735e-7,"teacher_disagreement_score":0.9345846,"about_ca_system_score_codex":0.00005995755,"about_ca_system_score_gemma":0.000019869478,"threshold_uncertainty_score":0.26008117},"labels":[],"label_agreement":null},{"id":"W155860288","doi":"10.1007/978-90-481-9577-0_2","title":"Non-Convex Duality","year":2004,"lang":"en","type":"book-chapter","venue":"Advances in mechanics and mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; Pacific Institute for the Mathematical Sciences","funders":"","keywords":"Duality (order theory); Convex analysis; Mathematics; Regular polygon; Strong duality; Convex optimization; Pure mathematics; Mathematical optimization; Optimization problem; Geometry","score_opus":0.0118499515853161,"score_gpt":0.24983806668914502,"score_spread":0.23798811510382892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W155860288","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.771493e-7,0.0007115788,0.8935787,0.00020831742,0.00014821123,0.00012486815,0.0000063638395,0.000032772197,0.105188385],"genre_scores_gemma":[0.0024106307,0.017495694,0.9179035,0.0007306902,0.000092614406,0.000020352372,0.00003133461,0.000050232837,0.06126499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892944,0.0000043143777,0.00037230947,0.00030940687,0.00025863148,0.00012591889],"domain_scores_gemma":[0.9991991,0.000061405706,0.00025031547,0.000353334,0.00008071785,0.00005514108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002420886,0.00019678935,0.00034897542,0.00013586832,0.000053450945,0.00006782978,0.00033105753,0.00014029043,0.00008226698],"category_scores_gemma":[0.000020602623,0.00018124229,0.000067901055,0.00007304259,0.000011391201,0.00029835603,0.0001842048,0.00015957947,0.000026252612],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.726372e-7,0.000019894109,2.693581e-7,0.000099578094,0.000012873677,0.0000045467173,0.00018081676,0.0007953895,8.9291314e-7,0.9971572,0.000010241527,0.0017178843],"study_design_scores_gemma":[0.00013248966,0.000015713422,3.1462358e-7,0.0001208292,0.000015950856,0.0000039130096,0.000008415779,0.16903877,0.0000063965454,0.8229091,0.0075717284,0.00017635847],"about_ca_topic_score_codex":0.0000016187274,"about_ca_topic_score_gemma":0.000013557808,"teacher_disagreement_score":0.17424813,"about_ca_system_score_codex":0.000049083057,"about_ca_system_score_gemma":0.00005945804,"threshold_uncertainty_score":0.7390846},"labels":[],"label_agreement":null},{"id":"W1576304249","doi":"","title":"On moving averages","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Moving average; Mathematics; Regular polygon; Convergence (economics); Banach space; Limit (mathematics); Point (geometry); Gauss; Applied mathematics; Mathematical analysis; Statistics; Geometry","score_opus":0.06037800784386878,"score_gpt":0.17844300450984063,"score_spread":0.11806499666597185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1576304249","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011469408,0.00001556737,0.97765243,0.00022900164,0.00039096322,0.000072685114,0.0000055781147,0.00016458613,0.009999785],"genre_scores_gemma":[0.9923116,0.00004454931,0.0030971768,0.00029689848,0.00007113044,3.0630525e-7,0.000017190561,0.000007525104,0.0041536135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989585,0.00008754025,0.000111697496,0.0005568154,0.00008916792,0.00019623527],"domain_scores_gemma":[0.9988297,0.00009870823,0.00015511611,0.0006855246,0.00010886911,0.00012208858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014860228,0.00017321075,0.00017331543,0.00024675258,0.00012972664,0.00011178267,0.00096146157,0.00014588653,0.00019486665],"category_scores_gemma":[0.00003016888,0.00018989618,0.00016626112,0.000437633,0.000020500443,0.00030976682,0.00090824265,0.00027334897,0.00032100372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002113231,0.000035830108,0.0004176026,0.00000563861,0.000036951966,0.000010501936,0.000045707886,0.47139734,0.0000012503656,0.52777,0.00017359656,0.00010346386],"study_design_scores_gemma":[0.00014026584,0.000008792593,0.0016357547,0.000020557072,0.00004213606,6.247378e-7,0.0000069745165,0.9360382,0.000017715292,0.061572205,0.0002734589,0.00024333],"about_ca_topic_score_codex":0.00004395281,"about_ca_topic_score_gemma":0.000004903191,"teacher_disagreement_score":0.9808422,"about_ca_system_score_codex":0.000120868855,"about_ca_system_score_gemma":0.00007456265,"threshold_uncertainty_score":0.7743741},"labels":[],"label_agreement":null},{"id":"W1578238299","doi":"10.1109/cdc.1997.657659","title":"Necessary optimality conditions for bilevel dynamic problems","year":2002,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Calmness; Bilevel optimization; Mathematical optimization; Constraint (computer-aided design); Bellman equation; Mathematics; Hierarchy; Optimal control; Upper and lower bounds; Sensitivity (control systems); Optimization problem; Computer science; Engineering","score_opus":0.03540269628240074,"score_gpt":0.27012131166855385,"score_spread":0.23471861538615313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1578238299","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000084099695,0.000015126122,0.9818399,0.009680198,0.00006180955,0.00014229317,0.000020144817,0.00013379926,0.008022661],"genre_scores_gemma":[0.5422666,0.000019189314,0.44372898,0.0016160083,0.000020191008,0.000087658584,0.000058107213,0.000005460712,0.012197804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993861,0.000017611303,0.00015610408,0.00020811599,0.00011508592,0.00011699324],"domain_scores_gemma":[0.99948984,0.00007247462,0.000048520793,0.00020962811,0.00012814696,0.000051381063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009841304,0.000062799096,0.00007966716,0.000078482975,0.00015281352,0.000103758175,0.00028312122,0.000028317587,0.0008581182],"category_scores_gemma":[0.000023231967,0.000053510652,0.00007039448,0.00035086783,0.000014830919,0.0004096851,0.00004503049,0.00002768908,0.00009979316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.800929e-7,0.00029108123,0.00029175228,0.000018823977,0.00007080756,5.34174e-7,0.00020821393,0.10730541,0.00014991267,0.8671501,0.020891927,0.0036206297],"study_design_scores_gemma":[0.00017503754,0.000015164802,0.0010650572,0.000001779381,0.0000072380753,0.000001532201,0.0000044123826,0.98382556,0.00001408906,0.012617923,0.0021881333,0.0000840435],"about_ca_topic_score_codex":0.000010379917,"about_ca_topic_score_gemma":0.000009652849,"teacher_disagreement_score":0.87652016,"about_ca_system_score_codex":0.000020445483,"about_ca_system_score_gemma":0.0000121485355,"threshold_uncertainty_score":0.93957925},"labels":[],"label_agreement":null},{"id":"W1600479821","doi":"10.1090/s0002-9939-07-08960-5","title":"Maximality of sums of two maximal monotone operators in general Banach space","year":2007,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Banach space; Transversality; Pure mathematics; Regular polygon; Function space; Space (punctuation); Approximation property; Discrete mathematics; Function (biology); Computer science","score_opus":0.01087434134665557,"score_gpt":0.2684613241348386,"score_spread":0.25758698278818304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600479821","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8341686,0.000007920061,0.163615,0.0009117651,0.000011333241,0.00012104269,0.0000024972442,0.0000142116305,0.0011476434],"genre_scores_gemma":[0.7437877,0.0000062070667,0.25605062,0.00009216857,0.000010429386,0.000002675633,2.1788256e-7,0.0000047365206,0.00004523429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985919,0.000011309427,0.00054933794,0.00020022891,0.00045268767,0.00019456555],"domain_scores_gemma":[0.9988161,0.000098087155,0.0005645868,0.00016208265,0.00030102913,0.000058129957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010312404,0.00011035312,0.00041823543,0.00005010908,0.00003653334,0.000019745828,0.0006979175,0.000029027362,0.00001736974],"category_scores_gemma":[0.00013912233,0.00007829824,0.0002703594,0.0014059764,0.000322965,0.00019265279,0.00028130904,0.00010518294,0.0000010422518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022614335,0.0004644487,0.09181672,0.00020768392,0.00012739914,1.4158603e-7,0.0030835045,0.0007857888,0.03141899,0.8713356,0.00018480138,0.00055228494],"study_design_scores_gemma":[0.00088259735,0.00015166627,0.0958983,0.000102131045,0.000085362655,0.000004558771,0.0020194927,0.67728853,0.13315149,0.09003258,0.00002278077,0.00036049043],"about_ca_topic_score_codex":0.00014362483,"about_ca_topic_score_gemma":0.0000016429539,"teacher_disagreement_score":0.78130305,"about_ca_system_score_codex":0.000048030113,"about_ca_system_score_gemma":0.000036130466,"threshold_uncertainty_score":0.31929094},"labels":[],"label_agreement":null},{"id":"W1604467579","doi":"10.1016/s1570-579x(01)80004-5","title":"Joint and Separate Convexity of the Bregman Distance","year":2001,"lang":"en","type":"book-chapter","venue":"Studies in computational mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":87,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; Okanagan University College","funders":"","keywords":"Bregman divergence; Convexity; Mathematics; Regular polygon; Convex function; Separable space; Applied mathematics; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.07660182010554445,"score_gpt":0.3053946421004872,"score_spread":0.22879282199494277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1604467579","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007496266,0.0014776292,0.85363865,0.0026659209,0.0003303774,0.00035908844,0.000038291702,0.000039403916,0.14137568],"genre_scores_gemma":[0.13718891,0.0033132348,0.6243968,0.0014769328,0.00025159746,0.000052937805,0.00005306775,0.00009112954,0.23317537],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99869,0.000022218186,0.0005419764,0.0002413231,0.00041260108,0.0000918462],"domain_scores_gemma":[0.99851805,0.00037130687,0.00048199558,0.00026349715,0.00034164538,0.00002350717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023280953,0.00018245142,0.00041831762,0.000104460974,0.00010462522,0.000028292938,0.00031652127,0.000062248655,0.00001813789],"category_scores_gemma":[0.000080998536,0.000133545,0.00009827321,0.0001391508,0.00026344316,0.00007868657,0.00039885714,0.00013337724,0.000006990102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.3737556e-7,0.000023499002,0.000033289412,0.00013854355,0.00012548028,0.0000019044892,0.00094174,0.023984939,1.292153e-7,0.97419107,0.00039141934,0.00016726673],"study_design_scores_gemma":[0.00013115731,0.000008981999,0.0002160139,0.00023982614,0.000026260623,0.0000087459475,0.0000356188,0.2550408,9.3536977e-7,0.74311846,0.0010503469,0.00012287633],"about_ca_topic_score_codex":0.0000014850957,"about_ca_topic_score_gemma":0.000013853404,"teacher_disagreement_score":0.23107262,"about_ca_system_score_codex":0.00006390126,"about_ca_system_score_gemma":0.000062975516,"threshold_uncertainty_score":0.5445807},"labels":[],"label_agreement":null},{"id":"W1623295174","doi":"10.1090/conm/513/10075","title":"Firmly nonexpansive and Kirszbraun-Valentine extensions: a constructive approach via monotone operator theory","year":2010,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Constructive; Monotone polygon; Operator (biology); Pure mathematics; Monotonic function; Algebra over a field; Discrete mathematics; Mathematical analysis; Computer science; Process (computing); Geometry","score_opus":0.012776673734472634,"score_gpt":0.24198891246244572,"score_spread":0.22921223872797308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1623295174","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049218368,0.00049193844,0.85667366,0.00045600758,0.00009020551,0.00095089077,0.00007687168,0.0004759965,0.1407352],"genre_scores_gemma":[0.0032047036,0.00020873522,0.935753,0.0010949211,0.00017829178,0.00021473232,0.00008332919,0.0003504783,0.058911826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965836,0.00022005556,0.000935689,0.0010599738,0.0007463988,0.0004543088],"domain_scores_gemma":[0.9960641,0.0007706287,0.0011756623,0.0013054241,0.00027530006,0.0004088436],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00076900347,0.0007678045,0.0016100851,0.00020615007,0.00024627155,0.00030795,0.0010138327,0.00042760448,0.0007003417],"category_scores_gemma":[0.00033016028,0.00062210235,0.000529539,0.0008297924,0.0012889561,0.00029939806,0.00066403224,0.0007148907,0.00013793261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000129665605,0.0016451965,0.000031655043,0.0013399159,0.0021153858,0.000019342986,0.0077493847,0.000014012814,0.00026515216,0.8975206,0.08614201,0.0031443497],"study_design_scores_gemma":[0.0016697065,0.0001944723,0.000026375305,0.0007228143,0.0005386367,0.0001967636,0.0044669397,0.77699345,0.00007475936,0.1985531,0.014162681,0.0024002723],"about_ca_topic_score_codex":0.000034792574,"about_ca_topic_score_gemma":0.0000013303526,"teacher_disagreement_score":0.77697945,"about_ca_system_score_codex":0.00004767045,"about_ca_system_score_gemma":0.00025814524,"threshold_uncertainty_score":0.99962306},"labels":[],"label_agreement":null},{"id":"W1636353766","doi":"10.1023/a:1011219303531","title":"A Cutting Plane Method for Solving Quasimonotone Variational Inequalities","year":2001,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Variational inequality; Monotonic function; Applied mathematics; Cutting-plane method; Mathematical optimization; Calculus (dental); Mathematical analysis; Integer programming","score_opus":0.023075093248227378,"score_gpt":0.3029777985616544,"score_spread":0.27990270531342704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1636353766","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000013291701,0.000074937314,0.99412227,0.0041246475,0.000045644214,0.0004931128,0.00003746161,0.00019647143,0.00089218974],"genre_scores_gemma":[0.012633239,0.000056560133,0.9842212,0.0013114037,0.00016678301,0.00048266884,0.00072775147,0.000014919619,0.00038544467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985799,0.0000650436,0.00045344618,0.00044415882,0.00026991928,0.00018750159],"domain_scores_gemma":[0.9979859,0.0009283459,0.00023635018,0.00019042933,0.0005445217,0.000114475646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004883821,0.00016086524,0.00018602361,0.0002517335,0.0005938934,0.00029628538,0.00027011055,0.00006875471,0.0000723268],"category_scores_gemma":[0.000099037425,0.00017245095,0.00007206984,0.000728833,0.000029486499,0.00053842086,0.000083159735,0.000067386805,0.000010539711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029155917,0.000040836534,0.00009400263,0.0000059995878,0.000021806407,1.0468806e-7,0.0000909454,0.55752033,0.0000053153663,0.4389097,0.00013093838,0.0031771031],"study_design_scores_gemma":[0.00047851,0.00001711237,0.00034882518,0.0000060668453,0.000022079823,0.000016744325,0.000046181765,0.9533887,0.000008306234,0.037691675,0.007783059,0.00019275871],"about_ca_topic_score_codex":0.000012487252,"about_ca_topic_score_gemma":0.0000026907455,"teacher_disagreement_score":0.40121806,"about_ca_system_score_codex":0.000043372154,"about_ca_system_score_gemma":0.00014105161,"threshold_uncertainty_score":0.70323455},"labels":[],"label_agreement":null},{"id":"W167913457","doi":"10.1016/j.cor.2004.06.004","title":"Special issue on game theory: Numerical methods and applications","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Dilemma; Game theory; Computer science; Interval (graph theory); Mathematical economics; Prisoner's dilemma; Ethical egoism; Management science; Operations research; Mathematical optimization; Mathematics; Psychology; Economics; Social psychology","score_opus":0.05229754288424358,"score_gpt":0.4358078793459811,"score_spread":0.3835103364617375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W167913457","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000021126549,0.000041653395,0.97250265,0.015644096,0.00010104272,0.00028303175,0.000002813808,0.00007130225,0.011332262],"genre_scores_gemma":[0.013062037,0.0000677713,0.9745147,0.0015145503,0.006739919,0.0001624406,0.000024113324,0.000012632564,0.0039017866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99785745,0.0007642581,0.00022475836,0.000465327,0.00043139327,0.00025679482],"domain_scores_gemma":[0.99836147,0.00058839604,0.000016855312,0.00049748213,0.0003672465,0.00016854107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013839514,0.000107186264,0.00014134648,0.00040631296,0.00060241146,0.0006382842,0.0006510543,0.00005389021,0.00032667213],"category_scores_gemma":[0.000110725145,0.00009664688,0.000047822086,0.0012669963,0.00009859371,0.00040155288,0.00031171556,0.0002622117,0.00054118026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030793738,0.00009653808,0.0000055003693,0.000001349504,0.000017494362,4.627435e-7,0.0003594287,0.104999766,0.000016802174,0.5440397,0.007212404,0.34324744],"study_design_scores_gemma":[0.00012415562,0.000038498467,0.00016929659,0.0000027343283,0.0000027838457,0.0000032317027,0.000017492473,0.6523681,0.00008728198,0.0014379919,0.34566787,0.00008057028],"about_ca_topic_score_codex":0.0000116218,"about_ca_topic_score_gemma":0.0000074910226,"teacher_disagreement_score":0.54736835,"about_ca_system_score_codex":0.00008379001,"about_ca_system_score_gemma":0.00011045627,"threshold_uncertainty_score":0.6955958},"labels":[],"label_agreement":null},{"id":"W1679530233","doi":"10.48550/arxiv.0805.4256","title":"Monotone Linear Relations: Maximality and Fitzpatrick Functions","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Monotonic function; Monotone polygon; Affine transformation; Linear operators; Skew; Regular polygon; Discrete mathematics; Graph; Operator (biology); Linear map; Pure mathematics; Combinatorics; Computer science; Mathematical analysis","score_opus":0.047621735571209564,"score_gpt":0.2623533702017976,"score_spread":0.21473163463058803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1679530233","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1312916,0.0003604342,0.8610035,0.004427281,0.00040856938,0.00021709116,0.00002974941,0.00025594962,0.0020058271],"genre_scores_gemma":[0.92330045,0.0012267529,0.0667627,0.00064439175,0.00028695667,0.00006791872,0.00021343527,0.00001965605,0.007477746],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99843746,0.00009667993,0.00039793807,0.0006395371,0.00025848584,0.00016991141],"domain_scores_gemma":[0.9985498,0.00010352427,0.0002354382,0.0007142251,0.00027826868,0.000118696546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019508321,0.00020446013,0.0002545647,0.00023639346,0.00033008304,0.00008323465,0.00041809463,0.00021532095,0.00010370159],"category_scores_gemma":[0.00014442648,0.00020427795,0.00014705607,0.0005630463,0.000051806,0.00031347826,0.00077705254,0.00040478405,0.00035979474],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008421579,0.00024521243,0.8704338,0.00003896301,0.0002789443,0.000014726163,0.00068145833,0.114082895,0.000014752737,0.009156052,0.0037352378,0.0013095073],"study_design_scores_gemma":[0.00022960025,0.00001779238,0.5106601,0.000017078732,0.00007034364,0.0000102869,0.000011667263,0.48066553,0.000015753709,0.0017618746,0.0062201736,0.00031976873],"about_ca_topic_score_codex":0.00017916429,"about_ca_topic_score_gemma":0.000010252518,"teacher_disagreement_score":0.7942408,"about_ca_system_score_codex":0.000066993496,"about_ca_system_score_gemma":0.0001666201,"threshold_uncertainty_score":0.83302134},"labels":[],"label_agreement":null},{"id":"W171925985","doi":"","title":"Identifying active constraints via partial smoothness and prox-regularity","year":2003,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":81,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Smoothness; Applied mathematics; Mathematics; Mathematical optimization; Nonlinear system; Set (abstract data type); Regular polygon; Computer science; Mathematical analysis; Physics; Geometry","score_opus":0.01927381520613384,"score_gpt":0.2558426490702251,"score_spread":0.23656883386409125,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W171925985","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032392163,0.000007577156,0.99100703,0.0003989565,0.00007950109,0.00006414101,7.027656e-7,0.000049950497,0.0051529314],"genre_scores_gemma":[0.9195842,0.0000024447495,0.079774424,0.0002211678,0.000010287415,0.000005184596,0.0000016572052,0.0000020487582,0.0003985715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993475,0.00006714942,0.000112501904,0.00021803996,0.00014804362,0.00010672864],"domain_scores_gemma":[0.99964553,0.000031801475,0.00004391837,0.00013182589,0.00008309367,0.000063812884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016799591,0.000062851934,0.000086635635,0.00005324401,0.000121765544,0.00014792432,0.0001188266,0.00003049451,0.00026063845],"category_scores_gemma":[0.000040020863,0.00005489153,0.000027724342,0.00025189001,0.000050365434,0.0004195546,0.00004629083,0.00004268865,0.000016609794],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000015540562,0.000055667268,0.0019177553,0.0000044009967,0.000034118657,0.00000240065,0.00035104968,0.0002250615,0.0003254526,0.9860816,0.000039551873,0.0109613845],"study_design_scores_gemma":[0.0014073814,0.00004268877,0.038750935,0.000014503027,0.00006467501,0.000059529288,0.00025735222,0.85193634,0.03307526,0.07201524,0.0017368247,0.00063924136],"about_ca_topic_score_codex":0.000014541591,"about_ca_topic_score_gemma":0.000008419497,"teacher_disagreement_score":0.916345,"about_ca_system_score_codex":0.000012779422,"about_ca_system_score_gemma":0.000039151117,"threshold_uncertainty_score":0.28538084},"labels":[],"label_agreement":null},{"id":"W1781547730","doi":"10.1090/s0002-9939-00-05914-1","title":"Lipschitz functions with maximal Clarke subdifferentials are generic","year":2000,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Simon Fraser University","keywords":"Subderivative; Lipschitz continuity; Mathematics; Banach space; Separable space; Pure mathematics; Unit sphere; Mathematical analysis; Regular polygon; Geometry","score_opus":0.010208183800926768,"score_gpt":0.20906691749565068,"score_spread":0.1988587336947239,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1781547730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7131726,0.00001864489,0.26869878,0.007976424,0.000027825467,0.0002564569,0.000008363823,0.00018715305,0.009653767],"genre_scores_gemma":[0.8129281,0.000025971864,0.18355685,0.0009300411,0.000055733937,0.000027703225,9.628405e-7,0.00001421388,0.0024604455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886656,0.000010284827,0.00024963656,0.00025140506,0.00042860597,0.00019350632],"domain_scores_gemma":[0.9991653,0.000052158277,0.00033494373,0.0001771632,0.00019244167,0.000077995515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016228943,0.00013423823,0.0002889939,0.000021921715,0.00019928331,0.00011226017,0.00064915686,0.00002716568,0.00031931163],"category_scores_gemma":[0.000032844593,0.00007932277,0.00026444322,0.0011064931,0.00023404461,0.00021888388,0.000117206546,0.00011558745,0.00003515756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003044125,0.005426303,0.08981207,0.0011004277,0.0039831,0.0000016922153,0.012672756,0.00731139,0.013412319,0.74930453,0.05706163,0.05960936],"study_design_scores_gemma":[0.0011280425,0.00039777733,0.13320988,0.00019510988,0.0005792612,0.000067346366,0.002140391,0.7915476,0.0026273935,0.0640789,0.0029572265,0.0010710608],"about_ca_topic_score_codex":0.0000075778767,"about_ca_topic_score_gemma":3.4297776e-7,"teacher_disagreement_score":0.7842362,"about_ca_system_score_codex":0.000029316674,"about_ca_system_score_gemma":0.000025070949,"threshold_uncertainty_score":0.34962386},"labels":[],"label_agreement":null},{"id":"W1790526778","doi":"10.5539/jmr.v7n2p69","title":"On the $O(1/k)$ Convergence Rate of He's Alternating Directions Method for a Kind of Structured Variational Inequality Problem","year":2015,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Civil Aviation Administration of China; National Natural Science Foundation of China","keywords":"Variational inequality; Mathematics; Monotone polygon; Rate of convergence; Simple (philosophy); Convergence (economics); Applied mathematics; Quadratic equation; Projection method; Projection (relational algebra); Regular polygon; Mathematical analysis; Mathematical optimization; Algorithm; Dykstra's projection algorithm; Geometry; Computer science","score_opus":0.2155331759715156,"score_gpt":0.4516851882781359,"score_spread":0.2361520123066203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1790526778","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008400556,0.000018465254,0.9872022,0.0038224075,0.00008717776,0.00017943412,0.000011328647,0.0000032469718,0.0002751845],"genre_scores_gemma":[0.2595016,0.000009706205,0.74028385,0.00003191519,0.000047554444,0.000007779138,9.568067e-7,0.0000047610856,0.000111902686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750715,0.00056891376,0.0007135949,0.000098175595,0.0009892507,0.00012291799],"domain_scores_gemma":[0.9917337,0.003696507,0.00081982376,0.00022430789,0.0034511136,0.00007458097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011564673,0.00006381483,0.00023289137,0.0002899237,0.00009670086,0.00005798037,0.0006593863,0.000034920264,0.000045845267],"category_scores_gemma":[0.0040700403,0.000039641818,0.0001150705,0.00070020655,0.00004049588,0.00017913924,0.000101024256,0.00019279303,0.000001271801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030053012,0.00026662476,0.00009666612,0.00009081734,0.00020838501,5.814439e-7,0.0030225865,0.05026957,0.0014698565,0.94299126,0.0010042465,0.0005493782],"study_design_scores_gemma":[0.0002728458,0.000121971716,0.0001501118,0.000040533978,0.000013072659,0.000005495768,0.00017807005,0.60052055,0.0024872299,0.39611712,0.00006234664,0.000030651685],"about_ca_topic_score_codex":0.00003412472,"about_ca_topic_score_gemma":0.000006213072,"teacher_disagreement_score":0.55025095,"about_ca_system_score_codex":0.000054969332,"about_ca_system_score_gemma":0.00037394578,"threshold_uncertainty_score":0.48725122},"labels":[],"label_agreement":null},{"id":"W1800456984","doi":"10.3968/j.sms.1923845220130602.2368","title":"A Class of Nondifferentiable Multiobjective Control Problems","year":2013,"lang":"en","type":"article","venue":"Studies in mathematical sciences","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Duality (order theory); Multiobjective programming; Class (philosophy); Mathematical optimization; Nonlinear system; Dual (grammatical number); Type (biology); Applied mathematics; Multi-objective optimization; Computer science; Pure mathematics; Artificial intelligence","score_opus":0.04296893434762639,"score_gpt":0.3148093127215567,"score_spread":0.2718403783739303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1800456984","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024468087,0.00021394082,0.9557881,0.002662172,0.0001205905,0.0004982954,0.0000013243761,0.000048228278,0.016199287],"genre_scores_gemma":[0.93567216,0.000017021322,0.06398799,0.00008893788,0.0000071354643,0.00006552165,9.460337e-8,0.0000012285531,0.00015988134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989607,0.00005879962,0.0002884256,0.00020554251,0.00031860883,0.00016794451],"domain_scores_gemma":[0.9991313,0.00044517365,0.00010050841,0.00011940978,0.00017388354,0.000029727631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046404536,0.0000732042,0.00023502069,0.00011861466,0.000100192716,0.00005394721,0.0004180238,0.000019899611,0.000111386566],"category_scores_gemma":[0.0003483189,0.000046282334,0.000044297147,0.0008054702,0.00035590056,0.0003712355,0.00012956688,0.00004074497,0.000041322928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.426534e-7,0.00030291692,0.0040709437,0.000102880964,0.000096215525,4.7094517e-7,0.0050900974,0.013485354,0.00027115367,0.97553957,0.00025024242,0.0007892035],"study_design_scores_gemma":[0.00020512752,0.000044074826,0.0018206356,0.000042651784,0.0000059691224,6.454044e-7,0.0006110302,0.73312885,0.00006862773,0.26399672,0.000008316091,0.00006733555],"about_ca_topic_score_codex":0.000024860483,"about_ca_topic_score_gemma":0.000008741698,"teacher_disagreement_score":0.9112041,"about_ca_system_score_codex":0.000022805245,"about_ca_system_score_gemma":0.000024146993,"threshold_uncertainty_score":0.18873388},"labels":[],"label_agreement":null},{"id":"W1813837202","doi":"10.1023/a:1015695629567","title":"Some Minimax Type Results Of Clarke's Generalized Directional Derivative And Point-Coderivative Of Multifunctions","year":2002,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Fixed-point theorem; Brouwer fixed-point theorem; Mean value theorem (divided differences); Pure mathematics; Kakutani fixed-point theorem; Picard–Lindelöf theorem; Discrete mathematics; Calculus (dental); Schauder fixed point theorem","score_opus":0.02852080150562485,"score_gpt":0.25389770903975245,"score_spread":0.2253769075341276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1813837202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14760421,0.0014240873,0.76544356,0.05467564,0.0018395919,0.0019355002,0.00036068767,0.0006270833,0.026089633],"genre_scores_gemma":[0.71668434,0.00023643437,0.278899,0.00031472585,0.000060011047,0.000017789866,0.000021019956,0.000016004533,0.003750688],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976675,0.00015520127,0.0007978632,0.00050418795,0.00062349054,0.00025174377],"domain_scores_gemma":[0.9977583,0.00055848033,0.0006356076,0.00043809536,0.0004782433,0.00013127108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007086544,0.00019174039,0.0004097113,0.00041163026,0.0002199555,0.00006441351,0.0005840761,0.00015532329,0.00019154273],"category_scores_gemma":[0.0012605694,0.00016560848,0.00012170225,0.0016881775,0.00027932733,0.000969779,0.00030946775,0.00022535151,0.000023136623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016142869,0.002268684,0.0011868827,0.00032471088,0.0013391349,0.0000037525397,0.021447089,0.0022063612,0.14587136,0.7530031,0.06871556,0.003471926],"study_design_scores_gemma":[0.0019784907,0.0001835698,0.005460423,0.00010446864,0.00015931127,0.000019224484,0.00020638568,0.9292809,0.02519845,0.033270955,0.003647338,0.00049051596],"about_ca_topic_score_codex":0.000009911545,"about_ca_topic_score_gemma":0.0000016315238,"teacher_disagreement_score":0.9270745,"about_ca_system_score_codex":0.000035023033,"about_ca_system_score_gemma":0.000049077167,"threshold_uncertainty_score":0.6753318},"labels":[],"label_agreement":null},{"id":"W1835280927","doi":"10.1090/s0002-9939-06-08323-7","title":"Maximality of sums of two maximal monotone operators","year":2006,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Banach space; Transversality; Pure mathematics; Regular polygon; Pseudo-monotone operator; Function space; Space (punctuation); Discrete mathematics; Function (biology); Finite-rank operator; Computer science","score_opus":0.008758250004021712,"score_gpt":0.24374301862269335,"score_spread":0.23498476861867162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1835280927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8168392,0.000010775095,0.17900394,0.0012854995,0.0000137351835,0.0001437448,0.000007145697,0.0000312836,0.002664647],"genre_scores_gemma":[0.7987946,0.0000038167727,0.20103917,0.00007168616,0.000012777361,0.0000048151273,3.5800656e-7,0.000004800036,0.00006795753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987503,0.000009837261,0.00048276287,0.00017753207,0.00044143613,0.00013811704],"domain_scores_gemma":[0.9986605,0.00007435987,0.00066791195,0.00016430559,0.00039719394,0.000035696707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003857508,0.00010293681,0.0003837405,0.000025320302,0.000052505904,0.000026713637,0.0007182527,0.000021929058,0.000023420182],"category_scores_gemma":[0.000076345015,0.00006935409,0.000344987,0.0009475581,0.00039025463,0.0001928638,0.0002699655,0.00006968347,0.0000017758592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007173183,0.00035167747,0.019568333,0.0001738822,0.000105967025,2.712887e-8,0.0006464644,0.00053418754,0.02479026,0.95304096,0.0005580177,0.00022303221],"study_design_scores_gemma":[0.0006194561,0.00012799636,0.026127007,0.000081077174,0.00014457028,0.000004706185,0.0007333772,0.5269966,0.1295262,0.3152915,0.000039319806,0.00030818133],"about_ca_topic_score_codex":0.00011930807,"about_ca_topic_score_gemma":2.9663465e-7,"teacher_disagreement_score":0.6377495,"about_ca_system_score_codex":0.000024257852,"about_ca_system_score_gemma":0.000031352414,"threshold_uncertainty_score":0.28281778},"labels":[],"label_agreement":null},{"id":"W1839619257","doi":"10.3968/j.ans.1715787020130601.2333","title":"A Resolvent Algorithm for System of General Mixed Variational Inequalities","year":2013,"lang":"en","type":"article","venue":"Advances in natural science/Advances in natural sciences","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Resolvent; Variational inequality; Hilbert space; Convergence (economics); Mathematics; Fixed point; Algorithm; Applied mathematics; Point (geometry); Mathematical analysis; Geometry","score_opus":0.009493030660982033,"score_gpt":0.288090973942611,"score_spread":0.278597943281629,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1839619257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.050532777,0.06679305,0.8506706,0.0044769547,0.015329655,0.0035444838,0.00008149141,0.00042291716,0.008148115],"genre_scores_gemma":[0.63324744,0.0003922628,0.3659054,0.00012052134,0.00009234203,0.0001138551,0.00000781629,0.0000044122467,0.000115935305],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952974,0.00016113439,0.0010091057,0.0010584969,0.0016307472,0.00084313663],"domain_scores_gemma":[0.9973535,0.0008300306,0.0006921853,0.00033447045,0.00066327536,0.0001265614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002625276,0.00029957178,0.00048881007,0.00111432,0.0005093057,0.00034125382,0.0026769023,0.00007708338,0.000018236859],"category_scores_gemma":[0.0007197573,0.00022332594,0.00014330672,0.0066618696,0.0011233571,0.011821511,0.00036543145,0.0002567711,0.0000048968964],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001282654,0.000101255966,0.0029883264,0.00006852938,0.000007558631,0.000002134297,0.00039396193,0.06393471,0.0010332848,0.6913566,0.000029159524,0.24007162],"study_design_scores_gemma":[0.00057262194,0.000097288364,0.00696493,0.00010104221,0.0000039730817,0.000007668258,0.0004790746,0.9584169,0.0010715801,0.030873489,0.0010520631,0.0003593937],"about_ca_topic_score_codex":0.00032266768,"about_ca_topic_score_gemma":0.00031527446,"teacher_disagreement_score":0.89448214,"about_ca_system_score_codex":0.00042137934,"about_ca_system_score_gemma":0.00046498267,"threshold_uncertainty_score":0.9106968},"labels":[],"label_agreement":null},{"id":"W1879146420","doi":"10.3968/j.sms.1923845220130701.6137","title":"Generalized Second-Order Duality for a Continuous Programming Problem with Support Functions","year":2013,"lang":"en","type":"article","venue":"Studies in mathematical sciences","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Duality (order theory); Mathematics; Strong duality; Dual (grammatical number); Weak duality; Nonlinear programming; Perturbation function; Duality gap; Order (exchange); Wolfe duality; Mathematical optimization; Applied mathematics; Nonlinear system; Algebra over a field; Pure mathematics; Optimization problem; Convex analysis; Convex optimization","score_opus":0.05684552066332549,"score_gpt":0.33480420064927074,"score_spread":0.27795867998594526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1879146420","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009302701,0.000052060026,0.9771365,0.0058693914,0.000080908874,0.0009298282,0.0000023629534,0.00010164974,0.006524603],"genre_scores_gemma":[0.08682636,0.000005294989,0.9095607,0.00033282355,0.000025928704,0.00076759385,0.0000018401364,0.0000037533896,0.0024757371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987129,0.0000475809,0.0003167795,0.0003345523,0.00030675085,0.00028143157],"domain_scores_gemma":[0.9990492,0.00032144107,0.000100872974,0.00014535173,0.0003301009,0.000053065392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084040867,0.000108457854,0.00025439553,0.000089615685,0.00032513915,0.00021709451,0.00033905846,0.00002362091,0.0002635646],"category_scores_gemma":[0.00023686267,0.00006505214,0.000045799752,0.001007029,0.00033926117,0.0004852411,0.00012463571,0.000044116918,0.00003162145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004558838,0.00035564697,0.0026360787,0.00017711168,0.00014940769,0.0000015965104,0.0047261394,0.0015966531,0.000019687912,0.98064995,0.0034321842,0.006251009],"study_design_scores_gemma":[0.0015466239,0.00077346276,0.0015832343,0.000118848555,0.0000669718,0.000025328422,0.006595277,0.39203295,0.000048094644,0.589304,0.007208027,0.0006972283],"about_ca_topic_score_codex":0.00001189088,"about_ca_topic_score_gemma":0.00006303707,"teacher_disagreement_score":0.39134598,"about_ca_system_score_codex":0.00002713982,"about_ca_system_score_gemma":0.00006891636,"threshold_uncertainty_score":0.28858477},"labels":[],"label_agreement":null},{"id":"W1901524206","doi":"10.1007/s10898-015-0373-5","title":"On Slater’s condition and finite convergence of the Douglas–Rachford algorithm for solving convex feasibility problems in Euclidean spaces","year":2015,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Convergence (economics); Euclidean geometry; Context (archaeology); Projection (relational algebra); Constraint (computer-aided design); Regular polygon; Mathematical optimization; Applied mathematics; Euclidean space; Algorithm; Convex optimization; Mathematical analysis; Geometry","score_opus":0.02642004899376784,"score_gpt":0.2788745590008693,"score_spread":0.2524545100071015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1901524206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008978668,0.000065372784,0.9890353,0.0011974245,0.00040686232,0.0002119276,0.000016301745,0.0000069666116,0.00008117582],"genre_scores_gemma":[0.7877489,0.000042371903,0.21192846,0.00020219819,0.000039693376,0.0000029064747,0.000006551817,0.0000037945665,0.000025184398],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988141,0.00009367245,0.0005087167,0.00014533178,0.00033305096,0.00010511425],"domain_scores_gemma":[0.99824905,0.00012390965,0.00069835444,0.00013699003,0.0007187323,0.00007298867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007663554,0.00009283222,0.00020657116,0.00007914358,0.000057546404,0.000090640104,0.00026493912,0.000056505727,0.00000704843],"category_scores_gemma":[0.0003879797,0.00006729158,0.000078485784,0.00052106817,0.000043252952,0.0006436966,0.000058268408,0.00007185358,4.6091478e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002077389,0.00007551655,0.014971572,0.000010466426,0.000019894225,4.463722e-7,0.00021545085,0.9762071,0.000004765933,0.007504723,0.00015529823,0.0008139932],"study_design_scores_gemma":[0.0010911865,0.00018768942,0.0046563926,0.000058153157,0.000021045824,0.00000910553,0.00004963264,0.9867103,0.000043174776,0.0070546186,0.000047255515,0.00007143908],"about_ca_topic_score_codex":0.00002217953,"about_ca_topic_score_gemma":0.000014653925,"teacher_disagreement_score":0.77877015,"about_ca_system_score_codex":0.00014018074,"about_ca_system_score_gemma":0.00015400867,"threshold_uncertainty_score":0.2744071},"labels":[],"label_agreement":null},{"id":"W1929806008","doi":"10.1007/s11590-015-0920-5","title":"On the order of the operators in the Douglas–Rachford algorithm","year":2015,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computational intelligence; Order (exchange); Computer science; Mathematics; Algorithm; Artificial intelligence; Economics","score_opus":0.015303671949726535,"score_gpt":0.21836981839208475,"score_spread":0.2030661464423582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1929806008","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087155536,0.0000070278907,0.91030586,0.08730723,0.00024404799,0.00017191996,0.0000020616098,0.000015589076,0.0010746995],"genre_scores_gemma":[0.35452142,0.00003230464,0.4857263,0.15841746,0.00026997784,0.00012673686,0.000041321236,0.000035318695,0.0008291625],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987572,0.0003031422,0.00021793177,0.00016231868,0.00044675052,0.000112662245],"domain_scores_gemma":[0.9990365,0.00017274477,0.00011998595,0.00048586787,0.00016040313,0.000024504878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060623337,0.00009085961,0.00008535181,0.00007895735,0.0001344651,0.00013644782,0.00097384915,0.000029327899,0.00004690794],"category_scores_gemma":[0.00018598056,0.000042043514,0.00005337752,0.0015762233,0.000051157513,0.00024117711,0.00008981628,0.00011238915,0.000011659394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013901482,0.00003123147,0.0001630549,5.0851605e-7,0.000008925209,3.2614346e-7,0.0009442056,0.95852816,0.0000028984516,0.033901066,0.0061410936,0.00027714318],"study_design_scores_gemma":[0.00022319757,0.00001137627,0.00028983012,0.0000053337103,0.0000065808485,0.0000013291823,0.000113241746,0.99771416,0.000028364222,0.00021282907,0.0013303685,0.000063362604],"about_ca_topic_score_codex":0.000040353723,"about_ca_topic_score_gemma":0.000005432504,"teacher_disagreement_score":0.4245796,"about_ca_system_score_codex":0.000033540415,"about_ca_system_score_gemma":0.000062869745,"threshold_uncertainty_score":0.18096702},"labels":[],"label_agreement":null},{"id":"W1933568734","doi":"10.1287/moor.2015.0759","title":"On the Range of the Douglas–Rachford Operator","year":2016,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Operator (biology); Subderivative; Range (aeronautics); Monotonic function; Simple (philosophy); Set (abstract data type); Regular polygon; Variational analysis; Pure mathematics; Displacement (psychology); Applied mathematics; Mathematical analysis; Convex optimization; Computer science; Geometry","score_opus":0.12008832773670826,"score_gpt":0.3791236926928256,"score_spread":0.25903536495611734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1933568734","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027760213,0.00012417429,0.8846294,0.06344912,0.00052956643,0.0021846495,0.00018603566,0.0000453637,0.021091472],"genre_scores_gemma":[0.93573934,0.000088653294,0.056817614,0.00017466089,0.00010929744,0.00028179726,0.000007681914,0.000023044931,0.0067579313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725753,0.00045990056,0.000540414,0.0002680694,0.001293476,0.00018058108],"domain_scores_gemma":[0.9953648,0.0010752089,0.00012458848,0.0018480539,0.0015459409,0.000041413205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023185886,0.00013622838,0.0002626134,0.00024886933,0.0004052259,0.00025913375,0.0028254946,0.00011230196,0.00029555082],"category_scores_gemma":[0.0015244787,0.000061748295,0.00019197018,0.00073855737,0.00021030939,0.000118821445,0.0018476164,0.0004451356,0.000058019563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016526637,0.00018971183,0.000019750782,0.00007056473,0.000069872214,1.4666549e-7,0.0012598499,0.024584707,0.00018883616,0.9714256,0.0021044551,0.000084832085],"study_design_scores_gemma":[0.00021377161,0.00004564101,0.00017683185,0.00038828352,0.000021667316,0.0000011071864,0.00012977955,0.89051956,0.0033033367,0.10475915,0.00029111412,0.00014975494],"about_ca_topic_score_codex":0.000040440907,"about_ca_topic_score_gemma":0.000027760761,"teacher_disagreement_score":0.90797913,"about_ca_system_score_codex":0.000056750174,"about_ca_system_score_gemma":0.000493694,"threshold_uncertainty_score":0.5250519},"labels":[],"label_agreement":null},{"id":"W1964255174","doi":"10.1007/s10474-006-0022-z","title":"Stability and convergence of modified Ishikawa iterative sequences with errors in Banach spaces","year":2006,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Banach space; Convergence (economics); Stability (learning theory); Pure mathematics; Applied mathematics; Mathematical analysis; Discrete mathematics; Computer science","score_opus":0.01637796966788663,"score_gpt":0.24349605356025486,"score_spread":0.22711808389236823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964255174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6434699,0.00010464639,0.3422812,0.008089654,0.00008232192,0.00043824615,0.000015962498,0.0000891573,0.005428849],"genre_scores_gemma":[0.9431144,0.000012235872,0.056538902,0.00007651263,0.000008961804,0.000015619717,0.0000050470107,0.0000055212226,0.00022279176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99786204,0.00014778672,0.0005337157,0.000554181,0.0006102319,0.0002920596],"domain_scores_gemma":[0.99874496,0.00027646282,0.00033722984,0.00037003405,0.00018156749,0.0000897397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010487981,0.00018140703,0.000345896,0.00027762173,0.00013979469,0.00016855967,0.00068747666,0.00010955647,0.00008617145],"category_scores_gemma":[0.00014327417,0.00013635086,0.00004982176,0.0016962878,0.0003317377,0.0011187667,0.00019539005,0.00022060849,0.0000044717326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031951633,0.00062916044,0.044590577,0.0002729206,0.00010275773,0.000007849435,0.008776523,0.0060553425,0.01355778,0.9250806,0.00066581904,0.00022871852],"study_design_scores_gemma":[0.0005847408,0.00008714939,0.028871156,0.00010237382,0.000048233032,0.000011985317,0.0005314022,0.91117775,0.012356195,0.04570933,0.00009093299,0.00042875027],"about_ca_topic_score_codex":0.00012824661,"about_ca_topic_score_gemma":0.000087340835,"teacher_disagreement_score":0.9051224,"about_ca_system_score_codex":0.000044796878,"about_ca_system_score_gemma":0.00011338051,"threshold_uncertainty_score":0.5560227},"labels":[],"label_agreement":null},{"id":"W1964469108","doi":"10.1016/j.camwa.2010.04.036","title":"Generalized bi-quasi-variational inequalities for quasi-pseudo-monotone type I operators on non-compact sets","year":2010,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Monotone polygon; Hausdorff space; Type (biology); Pure mathematics; Strongly monotone; Class (philosophy); Variational inequality; Regular polygon; Minimax; Hausdorff distance; Discrete mathematics; Mathematical analysis; Mathematical optimization","score_opus":0.021367925970362134,"score_gpt":0.28480611561643004,"score_spread":0.2634381896460679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964469108","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041703447,0.0000052409973,0.9911453,0.0028026684,0.00019459677,0.0009490317,0.00003882266,0.00019387531,0.0005001024],"genre_scores_gemma":[0.14233585,0.0000066828393,0.85574263,0.0008145378,0.00018560363,0.0004042265,0.00019774756,0.0000311172,0.00028158675],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831194,0.000040659423,0.0004905872,0.0004826772,0.00040043614,0.0002736877],"domain_scores_gemma":[0.9975469,0.0005646001,0.00030044818,0.00085716305,0.0005522023,0.00017866628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040515294,0.00027080183,0.00035446277,0.00026212132,0.00040494162,0.00036100694,0.00084320817,0.000096789656,0.000043274384],"category_scores_gemma":[0.00005395349,0.0002247649,0.00011197292,0.0008732969,0.000059483573,0.000286704,0.00007760252,0.00017218046,0.00009966442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010860237,0.00070660305,0.00009016049,0.000039964725,0.000116681935,3.6293903e-7,0.0008124593,0.012074064,0.0002709167,0.9830134,0.0016523995,0.0012121247],"study_design_scores_gemma":[0.00072713697,0.0001522081,0.000317245,0.000020510552,0.000045120654,0.000009170591,0.00003347291,0.9695548,0.00031627857,0.024096964,0.0043954435,0.00033167022],"about_ca_topic_score_codex":0.000016275555,"about_ca_topic_score_gemma":0.000011041302,"teacher_disagreement_score":0.9589164,"about_ca_system_score_codex":0.000046158024,"about_ca_system_score_gemma":0.00022164134,"threshold_uncertainty_score":0.91656464},"labels":[],"label_agreement":null},{"id":"W1966445912","doi":"10.4153/cmb-2014-013-8","title":"Orbits of Geometric Descent","year":2014,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Descent (aeronautics); Mathematics; Quasiconvex function; Descent direction; Pure mathematics; Gradient descent; Regular polygon; Geometry; Artificial intelligence; Geography; Computer science; Convex analysis; Convex optimization","score_opus":0.008012224670130576,"score_gpt":0.18979070527376046,"score_spread":0.1817784806036299,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1966445912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011161701,0.000012961548,0.96114105,0.00824883,0.000033545846,0.000055045446,0.0000019490878,0.000024128136,0.029366309],"genre_scores_gemma":[0.91306275,0.0000022173424,0.08429142,0.0011766094,0.0000241072,0.0000043494274,0.000002761445,0.0000053552935,0.0014304203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992572,0.000039808343,0.00020624192,0.00014216927,0.00018285199,0.00017171979],"domain_scores_gemma":[0.9991256,0.00015351197,0.00005342375,0.00026226713,0.00010965575,0.00029551922],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00029824727,0.00006435434,0.00014114493,0.00030924522,0.00004841324,0.00004262762,0.0003689588,0.000037900274,0.0046354104],"category_scores_gemma":[0.00054485793,0.00005673182,0.000054920794,0.000653255,0.000022028245,0.000028450218,0.000033841854,0.000044596636,0.0033332084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.8930552e-7,0.000029586516,0.00008528549,0.000021611673,0.000011784183,0.0000012474917,0.000048246064,0.00035406282,0.000006090661,0.9901351,0.006389609,0.0029171333],"study_design_scores_gemma":[0.00059277343,0.00010480117,0.0041610287,0.00007953882,0.00004712913,0.000021049009,0.000021699958,0.6519036,0.0006068286,0.107035846,0.23489136,0.00053435593],"about_ca_topic_score_codex":0.00031207866,"about_ca_topic_score_gemma":0.0001024841,"teacher_disagreement_score":0.9119466,"about_ca_system_score_codex":0.000042760224,"about_ca_system_score_gemma":0.00008185635,"threshold_uncertainty_score":0.99744284},"labels":[],"label_agreement":null},{"id":"W1968814555","doi":"10.1155/s0161171202112245","title":"Exponential inequalities for a class of operators","year":2002,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Class (philosophy); Inequality; Exponential function; Pure mathematics; Algebra over a field; Discrete mathematics; Mathematical analysis","score_opus":0.05283718846651574,"score_gpt":0.3037779479260906,"score_spread":0.25094075945957484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968814555","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023139272,0.000090894544,0.9716562,0.0034094162,0.00018537544,0.00006348004,0.0000049593264,0.0000069690063,0.0014434262],"genre_scores_gemma":[0.5497906,0.00006809791,0.44985777,0.00010389743,0.00006427089,0.0000027708675,2.3362608e-7,0.000002645806,0.00010967747],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998603,0.000018039284,0.0005920928,0.0000926152,0.0006046822,0.00008958461],"domain_scores_gemma":[0.998512,0.00046103765,0.0004172064,0.00007087371,0.0004791447,0.00005968694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008169705,0.00007164288,0.00021335225,0.000191126,0.000060281738,0.00016733303,0.0006688665,0.000026949816,0.00013072467],"category_scores_gemma":[0.00046768284,0.000048330963,0.00010701504,0.00015892384,0.00011870386,0.00041834262,0.00008846173,0.00003772289,0.0000022459622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016591596,0.00021337725,0.000022753693,0.000033477052,0.000064099106,0.0000011471503,0.0014421213,0.00024567422,0.00030387627,0.9959071,0.00022848166,0.001536192],"study_design_scores_gemma":[0.00042117084,0.00016586535,0.000015704312,0.00009985647,0.000025823563,0.00007350547,0.00052608846,0.7185803,0.0007789709,0.2786689,0.00055022194,0.000093565104],"about_ca_topic_score_codex":0.0000010834821,"about_ca_topic_score_gemma":3.854704e-7,"teacher_disagreement_score":0.7183347,"about_ca_system_score_codex":0.000011355222,"about_ca_system_score_gemma":0.000027063437,"threshold_uncertainty_score":0.19708796},"labels":[],"label_agreement":null},{"id":"W1969535442","doi":"10.1007/s10614-005-2519-x","title":"Dantzig—Wolfe Decomposition of Variational Inequalities","year":2005,"lang":"en","type":"article","venue":"Computational Economics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Convergence (economics); Variational inequality; Decomposition; Mathematical economics; Mathematics; Computer science; Economics","score_opus":0.015170454144522623,"score_gpt":0.2525010091423522,"score_spread":0.23733055499782957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969535442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012916763,0.000022120743,0.9812376,0.0035356353,0.00011399665,0.00005371867,0.00003024572,0.000047936184,0.0020420046],"genre_scores_gemma":[0.60088503,0.0000100598445,0.39810315,0.0006490725,0.00010166453,0.0000046831287,0.00013942405,0.000004444738,0.00010246621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904567,0.00005048233,0.00045433926,0.00021385598,0.00013310497,0.00010254452],"domain_scores_gemma":[0.9990262,0.000287828,0.00024151366,0.00015129932,0.00023886558,0.000054331173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002677161,0.00009312965,0.00015334041,0.00018566016,0.000090657595,0.00007831136,0.0003148591,0.000039711358,0.00014564153],"category_scores_gemma":[0.00002964037,0.00010531487,0.00008452447,0.00018588673,0.000027333805,0.0007099628,0.00008152551,0.00004469903,0.000070854425],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017182807,0.00003503848,0.00023318054,0.0000020170037,0.00002182873,4.9206175e-8,0.0000986693,0.5156107,0.00000439137,0.48207894,0.000111843765,0.0018016367],"study_design_scores_gemma":[0.0002533686,0.000013412646,0.0077488036,0.0000030813649,0.000006451177,0.000004474646,0.00000816699,0.923888,0.00006481734,0.06640555,0.0014975839,0.000106286556],"about_ca_topic_score_codex":0.000009165642,"about_ca_topic_score_gemma":0.000006809682,"teacher_disagreement_score":0.5879683,"about_ca_system_score_codex":0.00008693863,"about_ca_system_score_gemma":0.0001709331,"threshold_uncertainty_score":0.42946157},"labels":[],"label_agreement":null},{"id":"W1969722865","doi":"10.1016/j.na.2011.06.017","title":"The optimal value and optimal solutions of the proximal average of convex functions","year":2011,"lang":"en","type":"article","venue":"Nonlinear Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"National Science Foundation","keywords":"Mathematics; Value (mathematics); Regular polygon; Mathematical optimization; Statistics; Geometry","score_opus":0.020478752199918616,"score_gpt":0.22337304901270202,"score_spread":0.2028942968127834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969722865","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03219761,0.00009354556,0.96534026,0.0007205191,0.000067159504,0.00009762414,0.000040678067,0.000022018226,0.0014205747],"genre_scores_gemma":[0.9070738,0.000027472017,0.09140613,0.000058303613,0.000025637726,0.0000069945268,0.000009045037,0.0000044187304,0.001388231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888855,0.00011370011,0.0003488322,0.00020821072,0.00029369813,0.00014702737],"domain_scores_gemma":[0.9987719,0.00010383101,0.00023574529,0.00052788324,0.00031150633,0.00004914226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040052834,0.000092735354,0.00021139796,0.0001649986,0.00037298186,0.000039745348,0.00051908364,0.000044305612,0.00009462823],"category_scores_gemma":[0.000075352626,0.000055260458,0.00032543798,0.0018900459,0.00018254296,0.00016441794,0.00024531496,0.00009078356,0.0000041190965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066337154,0.0009046753,0.05933572,0.000029631394,0.0077832392,0.0000017583618,0.0044225142,0.5839715,0.0007626408,0.3395425,0.00028853797,0.0028909314],"study_design_scores_gemma":[0.000121568104,0.000026999554,0.022550032,0.0000020363166,0.0005821524,0.0000012837279,0.000083201354,0.97571236,0.00044980113,0.0001294764,0.00027610397,0.000064984204],"about_ca_topic_score_codex":0.00014612575,"about_ca_topic_score_gemma":0.00005146402,"teacher_disagreement_score":0.87487614,"about_ca_system_score_codex":0.000011887008,"about_ca_system_score_gemma":0.00008598092,"threshold_uncertainty_score":0.28687125},"labels":[],"label_agreement":null},{"id":"W1971365545","doi":"10.5539/jmr.v2n4p3","title":"Strong Convergence Theorem According to Hybrid Methods for Mapping Asymptotically Quasi-Nonexpansive Types","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Convergence (economics); Hilbert space; Pure mathematics; Applied mathematics; Mathematical analysis","score_opus":0.1038997225847134,"score_gpt":0.45670146542907836,"score_spread":0.35280174284436494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971365545","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038645838,0.000015813195,0.99107873,0.0036191328,0.00028212758,0.00018311187,0.0000016679002,0.000011578774,0.0009432275],"genre_scores_gemma":[0.195473,0.000010153777,0.8041687,0.000058657402,0.00014379267,0.000007026589,3.887063e-7,0.000008856249,0.00012941351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800384,0.00026027765,0.000553626,0.00016910382,0.000714975,0.0002981898],"domain_scores_gemma":[0.99413615,0.002648064,0.0002445652,0.0003114998,0.002442798,0.0002169453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009497025,0.00009323693,0.0002783556,0.00054998085,0.00020070805,0.00029917507,0.0011207729,0.00004571432,0.00006275755],"category_scores_gemma":[0.00458852,0.000072044146,0.00014370859,0.0006449821,0.000046292764,0.0003619011,0.00023934922,0.00043992218,0.000026786918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015675185,0.0003218259,0.0001431485,0.00009732867,0.0001943432,0.000007994472,0.0021800392,0.0025998591,0.022851912,0.9354254,0.00057010894,0.03559237],"study_design_scores_gemma":[0.00027903833,0.00018654278,0.000107256434,0.00006847836,0.000017870749,0.000058464924,0.00098547,0.85591644,0.005828912,0.13550681,0.000909656,0.00013506203],"about_ca_topic_score_codex":0.0000025508396,"about_ca_topic_score_gemma":0.0000015462033,"teacher_disagreement_score":0.8533166,"about_ca_system_score_codex":0.0000488897,"about_ca_system_score_gemma":0.00028233783,"threshold_uncertainty_score":0.54932183},"labels":[],"label_agreement":null},{"id":"W1972168423","doi":"10.3934/jimo.2008.4.125","title":"Canonical dual approach to solving 0-1 quadratic programming problems","year":2008,"lang":"en","type":"article","venue":"Journal of Industrial and Management Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Dual polyhedron; Duality gap; Dual (grammatical number); Duality (order theory); Convexity; Mathematics; Canonical transformation; Quadratic programming; Convex analysis; Strong duality; Canonical form; Mathematical optimization; Wolfe duality; Perturbation function; Minification; Linear programming; Transformation (genetics); Convex optimization; Regular polygon; Weak duality; Optimization problem; Combinatorics; Pure mathematics","score_opus":0.052705500801123906,"score_gpt":0.2373011241684848,"score_spread":0.1845956233673609,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972168423","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006941997,0.000031387957,0.9958247,0.001434345,0.00019456577,0.0002696392,3.3406585e-7,0.000024163966,0.0015266972],"genre_scores_gemma":[0.08390217,0.00027671666,0.91468555,0.000305786,0.00029304245,0.000014645616,0.0000069816438,0.000009356129,0.0005057539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986934,0.000068105765,0.0004961014,0.00018201744,0.0004068054,0.00015358385],"domain_scores_gemma":[0.99921256,0.00002677916,0.00030078087,0.000115092334,0.00020360856,0.00014119058],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046796107,0.00010722103,0.00019291238,0.00033446154,0.00019682672,0.00018013305,0.00022611058,0.000061196464,0.0000086795035],"category_scores_gemma":[0.00006505828,0.00008833646,0.000061916275,0.00075805065,0.00001943941,0.00062742614,0.00013152955,0.00012026857,0.0000014499776],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000148515,0.00016207212,0.0002856895,0.000011882151,0.00009476121,0.000010242164,0.00046505875,0.9753165,0.000002760181,0.014687128,0.0013779998,0.0075710164],"study_design_scores_gemma":[0.0015175131,0.00023015619,0.00025204266,0.00006426351,0.00008438945,0.00012934337,0.00011466654,0.99268806,0.000009788727,0.00012587455,0.0045721103,0.00021182133],"about_ca_topic_score_codex":0.000008232802,"about_ca_topic_score_gemma":8.215861e-7,"teacher_disagreement_score":0.08320798,"about_ca_system_score_codex":0.000049456867,"about_ca_system_score_gemma":0.00007254021,"threshold_uncertainty_score":0.36022565},"labels":[],"label_agreement":null},{"id":"W1972523802","doi":"10.1016/s0898-1221(02)00139-6","title":"A generalization of the rectangular bounding method for continuous location models","year":2002,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Bounding overwatch; Mathematics; Generalization; Mathematical optimization; Norm (philosophy); Upper and lower bounds; Function (biology); Value (mathematics); Facility location problem; Iterative method; Applied mathematics; Mathematical analysis; Computer science; Statistics","score_opus":0.024307672486922303,"score_gpt":0.2540813526602247,"score_spread":0.22977368017330238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972523802","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037290392,0.000057308644,0.99729407,0.0012250892,0.00003679532,0.0007672675,0.000004405649,0.00007132402,0.0005064657],"genre_scores_gemma":[0.04229101,0.000008394275,0.9568922,0.00019687501,0.00003294081,0.00032305208,0.000009521937,0.000011637168,0.00023435797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906665,0.00003953153,0.00031882446,0.00023126678,0.00022615257,0.00011759518],"domain_scores_gemma":[0.9984044,0.00019026698,0.00033939435,0.00058135926,0.00044525566,0.000039344446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021720752,0.0001062328,0.00017416877,0.000096070566,0.00023064871,0.00009533236,0.00058241875,0.00003788701,0.0000049345526],"category_scores_gemma":[0.000021407199,0.000077130084,0.00007395638,0.0010351804,0.00003060951,0.00020610023,0.00006892958,0.000039176146,0.000003184297],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.07827e-7,0.00011546002,0.000010696902,0.000048849943,0.00004148007,2.3720508e-8,0.0009922516,0.21731083,0.00009066605,0.77613986,0.0004107539,0.0048385314],"study_design_scores_gemma":[0.00019636693,0.000015255227,0.000015402951,0.000027805285,0.000047034042,0.000005240363,0.000023047223,0.9505971,0.0003109994,0.04788058,0.0007893932,0.00009178321],"about_ca_topic_score_codex":0.0000044776452,"about_ca_topic_score_gemma":0.0000022609331,"teacher_disagreement_score":0.73328626,"about_ca_system_score_codex":0.000037727546,"about_ca_system_score_gemma":0.00002962644,"threshold_uncertainty_score":0.31452736},"labels":[],"label_agreement":null},{"id":"W1972644511","doi":"10.5539/jmr.v2n3p188","title":"Optimality Condition of a Class of Arc Connected Function","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Arc (geometry); Function (biology); Class (philosophy); Property (philosophy); Convex function; Regular polygon; Set (abstract data type); Combinatorics; Pure mathematics; Mathematical analysis; Discrete mathematics; Geometry; Computer science","score_opus":0.07088817376222806,"score_gpt":0.38205802525939786,"score_spread":0.3111698514971698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972644511","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22060359,0.000013068926,0.7763754,0.0011361972,0.00013299489,0.000081825005,0.000004282982,0.0000062625286,0.0016463548],"genre_scores_gemma":[0.86344784,0.000011734794,0.13640557,0.000009363672,0.000037452945,9.828345e-7,0.0000013824571,0.0000032028504,0.000082445236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980217,0.00014540975,0.0006207554,0.000076201686,0.0010272489,0.000108638495],"domain_scores_gemma":[0.99567115,0.000627076,0.0005932677,0.00024665994,0.0027908657,0.000070990805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033477903,0.000049997965,0.00022514214,0.00046342803,0.000052133117,0.00004245809,0.00045227297,0.00006000922,0.00023602432],"category_scores_gemma":[0.0010378159,0.000038911003,0.000108511544,0.0006906916,0.00008730694,0.0002912917,0.00008095581,0.00033991874,0.000006499941],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046621855,0.001125401,0.0005496331,0.00024564555,0.00022117264,0.0000043518885,0.001148443,0.0036648705,0.11869924,0.87209654,0.0011094305,0.0010886512],"study_design_scores_gemma":[0.0010150477,0.0005627757,0.0065613766,0.00010822516,0.000051612475,0.00006104468,0.0004090018,0.831142,0.025167974,0.13437104,0.00043682568,0.00011306854],"about_ca_topic_score_codex":0.000007104254,"about_ca_topic_score_gemma":0.0000050315184,"teacher_disagreement_score":0.82747716,"about_ca_system_score_codex":0.000019823086,"about_ca_system_score_gemma":0.0001940768,"threshold_uncertainty_score":0.25843006},"labels":[],"label_agreement":null},{"id":"W1973799058","doi":"10.1007/s10957-007-9263-4","title":"New Branch-and-Cut Algorithm for Bilevel Linear Programming","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Transpose; Branch and bound; Mathematics; Branch and cut; Bilevel optimization; Linear programming; Algorithm; Integer programming; Theory of computation; Mathematical optimization; Branching (polymer chemistry); Set (abstract data type); Optimization problem; Computer science","score_opus":0.011174452599283177,"score_gpt":0.2768035725164913,"score_spread":0.2656291199172081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973799058","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012806449,0.00019295329,0.99868655,0.00073065807,0.000041270807,0.00020112171,0.00000256202,0.00002247166,0.00010962995],"genre_scores_gemma":[0.0037074701,0.00012967268,0.9952095,0.00025241353,0.00025154432,0.000011222172,0.0000075414996,0.000006835374,0.0004237791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923134,0.00003230238,0.0003671394,0.00013586675,0.0001283118,0.00010501214],"domain_scores_gemma":[0.9987677,0.00032285578,0.00031083275,0.00010973411,0.00034835923,0.00014053899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011187505,0.000078842684,0.00012879352,0.00018460673,0.00020251384,0.00010234961,0.00017801566,0.000047476726,0.000016232612],"category_scores_gemma":[0.000063100044,0.00006758897,0.000059363374,0.0004041691,0.000026505855,0.00040214675,0.000032815435,0.00006580708,8.87428e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011773158,0.00004369403,0.000022495733,0.000005261488,0.000039785784,2.2350609e-7,0.00015417524,0.0463891,0.000019164241,0.32467577,0.00005576589,0.6285828],"study_design_scores_gemma":[0.0011721499,0.0001228268,0.0002416863,0.000020231204,0.000112613176,0.000090788184,0.000107705106,0.9009352,0.000534338,0.07092709,0.02550657,0.00022883248],"about_ca_topic_score_codex":8.3433895e-7,"about_ca_topic_score_gemma":4.080606e-7,"teacher_disagreement_score":0.85454607,"about_ca_system_score_codex":0.000013365762,"about_ca_system_score_gemma":0.000067161665,"threshold_uncertainty_score":0.2756198},"labels":[],"label_agreement":null},{"id":"W1973823738","doi":"10.1137/070687542","title":"The Proximal Average: Basic Theory","year":2008,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":120,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Subderivative; Mathematics; Convex conjugate; Regular polygon; Convex function; Effective domain; Convex analysis; Proper convex function; Proximal Gradient Methods; Domain (mathematical analysis); Pure mathematics; Function (biology); Convex set; Convex optimization; Mathematical analysis; Geometry","score_opus":0.011268161642003643,"score_gpt":0.2191056682143998,"score_spread":0.20783750657239616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973823738","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025700874,0.00008321491,0.9896805,0.0043821787,0.0003750639,0.00008221142,6.1714434e-7,0.00006338313,0.00507581],"genre_scores_gemma":[0.64203596,0.0029757875,0.33510104,0.00463794,0.00092846283,0.000025141308,0.000020949637,0.000046216366,0.014228527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998568,0.00026465897,0.00030475826,0.00018196242,0.0004838953,0.00019671564],"domain_scores_gemma":[0.9988509,0.00020937277,0.00023259348,0.00027898356,0.00032471056,0.00010345366],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00071301,0.00011688012,0.000103553015,0.00014418237,0.0014094787,0.00033369774,0.00056112575,0.000046605775,0.00015226025],"category_scores_gemma":[0.0002108388,0.00007534911,0.00010826302,0.0005742218,0.000045736335,0.00063811353,0.000052536725,0.00022646165,0.00006462239],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018307635,0.000042429598,0.00007013089,5.6782216e-7,0.000025965708,0.000010279187,0.0001590616,0.8541345,0.0000031177449,0.142393,0.000911219,0.0022314058],"study_design_scores_gemma":[0.0003558687,0.00008065048,0.00052503083,0.0000071188733,0.000007649112,0.00019636053,0.000012313026,0.99132305,0.00005041585,0.004005594,0.0033172488,0.00011866986],"about_ca_topic_score_codex":5.000627e-7,"about_ca_topic_score_gemma":2.6431468e-7,"teacher_disagreement_score":0.65457946,"about_ca_system_score_codex":0.0000699767,"about_ca_system_score_gemma":0.00014551509,"threshold_uncertainty_score":0.99989057},"labels":[],"label_agreement":null},{"id":"W1974036004","doi":"10.1137/130924214","title":"Generalized Solutions for the Sum of Two Maximally Monotone Operators","year":2014,"lang":"en","type":"article","venue":"SIAM Journal on Control and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Monotone polygon; Duality (order theory); Set (abstract data type); Applied mathematics; Zero (linguistics); Explained sum of squares; Pure mathematics","score_opus":0.012766667621371207,"score_gpt":0.24188489450185688,"score_spread":0.22911822688048566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974036004","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021541369,0.00013797531,0.9913625,0.0077862097,0.00017900046,0.00016477109,0.000005088758,0.000016327826,0.00013270818],"genre_scores_gemma":[0.76772565,0.00046715068,0.22931293,0.0020580157,0.00024261123,0.000025498588,0.000008327225,0.000010478043,0.00014935984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990924,0.00012302694,0.00030458407,0.00013895649,0.00018786416,0.0001531965],"domain_scores_gemma":[0.9988951,0.00026073243,0.00022186898,0.000148752,0.00040272108,0.000070828835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076786475,0.000092452494,0.00016766162,0.00012927785,0.0004913116,0.00019436702,0.00023936869,0.00003275557,0.000021261736],"category_scores_gemma":[0.00014158634,0.000059762377,0.00009845038,0.00023607226,0.000028327913,0.00028586396,0.000026560121,0.0000738651,0.0000011770094],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024611725,0.000026343185,0.000051052306,0.0000014645585,0.000048045244,8.541674e-8,0.000035401667,0.7896387,0.0000544243,0.20800106,0.00010159034,0.002017215],"study_design_scores_gemma":[0.0023279586,0.000113157876,0.00028076427,0.0000067058068,0.000054096705,0.000006800984,0.0000055022006,0.9946564,0.000024296238,0.0015573843,0.0008929339,0.000074016905],"about_ca_topic_score_codex":0.0000067247415,"about_ca_topic_score_gemma":0.0000047427297,"teacher_disagreement_score":0.76751024,"about_ca_system_score_codex":0.000016620952,"about_ca_system_score_gemma":0.000049693575,"threshold_uncertainty_score":0.37788212},"labels":[],"label_agreement":null},{"id":"W1974057012","doi":"10.1016/j.jat.2010.01.001","title":"Klee sets and Chebyshev centers for the right Bregman distance","year":2010,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Okanagan University College; University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Legendre polynomials; Chebyshev filter; Uniqueness; Regular polygon; Function (biology); Convexity; Convex function; Applied mathematics; Combinatorics; Mathematical analysis; Geometry","score_opus":0.005626350884953647,"score_gpt":0.22919378018561892,"score_spread":0.22356742930066528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974057012","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025250404,0.00006493208,0.9912862,0.0053870296,0.00029930822,0.00008843468,0.0000026744267,0.000009775206,0.0003365757],"genre_scores_gemma":[0.85521746,0.000035792862,0.14357498,0.00072628265,0.00014856645,0.0000064445326,0.0000026553407,0.0000061374535,0.0002816778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993558,0.000050481663,0.00024975732,0.000085752356,0.00018226019,0.00007593531],"domain_scores_gemma":[0.99887466,0.00035097028,0.0003381736,0.00015417082,0.0002340187,0.00004801221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011264719,0.000061202045,0.00009722271,0.00007591611,0.00016464171,0.00014815669,0.00034606393,0.00002935107,0.000033837696],"category_scores_gemma":[0.00014087651,0.000036608737,0.00007856432,0.00014554308,0.000044656546,0.00048312615,0.000030416062,0.0001188632,0.0000017001876],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029546822,0.000034784884,0.000078573,0.000008620539,0.00005009616,4.2396823e-7,0.0005129024,0.00057906297,0.00036036264,0.9874782,0.00064155227,0.010225892],"study_design_scores_gemma":[0.0009043973,0.000056952198,0.0050008954,0.000017961242,0.00007028227,0.0000710323,0.000121108285,0.69323194,0.0010606545,0.28495502,0.014365492,0.0001442426],"about_ca_topic_score_codex":4.1265517e-7,"about_ca_topic_score_gemma":0.0000023335365,"teacher_disagreement_score":0.8526924,"about_ca_system_score_codex":0.000011161481,"about_ca_system_score_gemma":0.000031258118,"threshold_uncertainty_score":0.1492861},"labels":[],"label_agreement":null},{"id":"W1974609801","doi":"10.1080/09720502.2003.10700330","title":"Minmax programming : optimality and Wolfe type duality for a problem involving bectovex functions","year":2003,"lang":"en","type":"article","venue":"Journal of Interdisciplinary Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Manitoba","funders":"","keywords":"Minimax; Duality (order theory); Mathematics; Dual (grammatical number); Mathematical optimization; Variety (cybernetics); Type (biology); Strong duality; Optimization problem; Combinatorics","score_opus":0.028585697471061777,"score_gpt":0.3077139842222138,"score_spread":0.27912828675115203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974609801","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010543446,0.00013369779,0.9865816,0.001643459,0.00018489877,0.0001759333,0.000003308228,0.000021761434,0.0007118492],"genre_scores_gemma":[0.14813153,0.000011617679,0.851329,0.00004480844,0.000047242098,0.000007988484,0.0000015344807,0.000008831723,0.0004174357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871975,0.000062308754,0.0006400299,0.00014611756,0.00028249447,0.00014930154],"domain_scores_gemma":[0.99809504,0.00024359812,0.0005358581,0.0001851012,0.00083931943,0.00010107397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001436272,0.00011746434,0.0002651745,0.00015336728,0.00021790795,0.00018878642,0.00023665103,0.000047843343,0.000021089361],"category_scores_gemma":[0.0003750119,0.00009122134,0.00014012781,0.0003600536,0.000032106553,0.0005246963,0.0001889898,0.00012030269,0.0000018762752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015088648,0.0036355592,0.002706517,0.0016571438,0.0014755095,0.000036010475,0.03946251,0.016512936,0.00104279,0.907242,0.01331656,0.012761584],"study_design_scores_gemma":[0.0021247263,0.0018250621,0.0010075349,0.00061855745,0.00048057883,0.0010473407,0.0073117116,0.6321737,0.00048277288,0.34367132,0.008470425,0.00078625564],"about_ca_topic_score_codex":5.2338845e-7,"about_ca_topic_score_gemma":0.0000031292757,"teacher_disagreement_score":0.6156608,"about_ca_system_score_codex":0.000076032724,"about_ca_system_score_gemma":0.00012603549,"threshold_uncertainty_score":0.37198985},"labels":[],"label_agreement":null},{"id":"W1975320652","doi":"10.1007/s10288-005-0071-0","title":"Bilevel programming: A survey","year":2005,"lang":"en","type":"article","venue":"4OR","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":453,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Computer Research Institute of Montréal","funders":"","keywords":"Bilevel optimization; Class (philosophy); Simple (philosophy); Mathematical optimization; Computer science; Nonlinear programming; Quadratic programming; Quadratic equation; Linear programming; Nonlinear system; Mathematics; Optimization problem; Artificial intelligence; Epistemology","score_opus":0.03416886300847194,"score_gpt":0.2682684370357858,"score_spread":0.23409957402731385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975320652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00070863805,0.00002182892,0.9946747,0.0030959093,0.00004864489,0.000041048108,0.0000018303754,0.000090481466,0.0013169576],"genre_scores_gemma":[0.52682996,0.0000040067252,0.4685086,0.00083324325,0.00007459611,0.000008535329,0.000014123031,0.0000032628984,0.0037236456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995583,0.000030065492,0.000084501065,0.00012550098,0.00011744373,0.00008413508],"domain_scores_gemma":[0.99967104,0.000031654905,0.000027994092,0.00015189637,0.00007717928,0.00004020739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020080605,0.00003765842,0.000047357957,0.00004855373,0.000046368797,0.000090224836,0.00023122416,0.000016101114,0.0000948573],"category_scores_gemma":[0.000048668728,0.00003157074,0.000026717538,0.00037435186,0.0000057623224,0.00018637917,0.000044441662,0.000023365932,0.00025857176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005034245,0.0003750113,0.025723645,0.0000052294167,0.0000694852,0.0000022917475,0.000654463,0.011805348,0.00004936471,0.18878251,0.010637271,0.76189035],"study_design_scores_gemma":[0.00018742529,0.00001616099,0.099027246,0.0000017754273,0.0000038703697,0.0000018792446,0.0000020499288,0.7515683,0.00009215343,0.00032426455,0.14865129,0.00012355026],"about_ca_topic_score_codex":0.000033269287,"about_ca_topic_score_gemma":0.000051970215,"teacher_disagreement_score":0.7617668,"about_ca_system_score_codex":0.000012353665,"about_ca_system_score_gemma":0.000029248351,"threshold_uncertainty_score":0.33235028},"labels":[],"label_agreement":null},{"id":"W1975494147","doi":"10.1007/s10107-013-0674-8","title":"Maximally monotone linear subspace extensions of monotone subspaces: explicit constructions and characterizations","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Monotone polygon; Mathematics; Linear subspace; Subspace topology; Quadratic equation; Relation (database); Variational inequality; Pure mathematics; Discrete mathematics; Applied mathematics; Algebra over a field; Mathematical analysis; Computer science","score_opus":0.01226726134119255,"score_gpt":0.22808668258064463,"score_spread":0.21581942123945208,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975494147","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029926302,0.000020105417,0.96650076,0.002521521,0.000044458855,0.0004178472,0.0000028089903,0.00013900084,0.00042720957],"genre_scores_gemma":[0.37967336,0.000015920412,0.61992925,0.00006709719,0.000024949843,0.00010087009,0.000008159211,0.000009656377,0.00017073899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987745,0.000044490283,0.00042225796,0.0002935839,0.00024255186,0.00022256358],"domain_scores_gemma":[0.9988171,0.00016757399,0.00017946587,0.00035938664,0.00031403656,0.00016246278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015801113,0.0001462465,0.00028023464,0.00018126088,0.00018755368,0.0001724932,0.00024127823,0.000067423185,0.00017657982],"category_scores_gemma":[0.00017726193,0.00012682936,0.00007854076,0.0006820553,0.000104927836,0.00055063947,0.00016102762,0.00009736939,0.0000705492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000022557983,0.00038446963,0.000606396,0.00009158289,0.0000952392,0.00000195186,0.0013180055,0.0004021745,0.0032509996,0.97736907,0.000043149237,0.016434679],"study_design_scores_gemma":[0.00027835273,0.00005082192,0.002129181,0.00005509255,0.000052124902,0.00003257443,0.00031031726,0.971527,0.0004993407,0.024447974,0.00038228423,0.00023494917],"about_ca_topic_score_codex":0.000030614556,"about_ca_topic_score_gemma":0.0000024956355,"teacher_disagreement_score":0.9711248,"about_ca_system_score_codex":0.00001345784,"about_ca_system_score_gemma":0.000032375807,"threshold_uncertainty_score":0.5171951},"labels":[],"label_agreement":null},{"id":"W1975786171","doi":"10.1007/s10589-013-9627-7","title":"A smoothing augmented Lagrangian method for solving simple bilevel programs","year":2013,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Augmented Lagrangian method; Karush–Kuhn–Tucker conditions; Mathematical optimization; Smoothing; Mathematics; Bilevel optimization; Simple (philosophy); Lagrangian relaxation; Penalty method; Optimization problem; Limit point; Bounded function; Constraint (computer-aided design); Bellman equation","score_opus":0.018538081270305245,"score_gpt":0.28482506808871527,"score_spread":0.26628698681841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975786171","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001745904,0.000037115304,0.9943055,0.0038897411,0.000026267873,0.0011253735,0.000012366684,0.00022400952,0.00036218646],"genre_scores_gemma":[0.022605436,0.000010261174,0.9739094,0.0011752688,0.00006382598,0.0013452028,0.0006472269,0.000015157619,0.00022821587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987726,0.00003605639,0.0003589894,0.0004256126,0.00021447614,0.00019222799],"domain_scores_gemma":[0.9985567,0.00027516848,0.00017874611,0.00019916067,0.0006526631,0.0001375633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020431659,0.0001489928,0.00015666624,0.00019782272,0.00051211606,0.00050562667,0.0002814719,0.00006109089,0.00008706852],"category_scores_gemma":[0.000035484554,0.000147482,0.00007862408,0.00076089177,0.000030092677,0.00065010326,0.00008703266,0.000058632373,0.000022975393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.9274764e-7,0.00007211683,0.00006962502,0.000010789811,0.000029091263,3.125361e-8,0.000096930526,0.7628666,0.000017828654,0.19316481,0.00035883655,0.043312527],"study_design_scores_gemma":[0.0003991554,0.000018475268,0.0004268214,0.000005558653,0.000019017456,0.0000034050142,0.00003402575,0.9548444,0.000011398601,0.04056626,0.0034998942,0.00017155478],"about_ca_topic_score_codex":0.000030384028,"about_ca_topic_score_gemma":0.0000024614287,"teacher_disagreement_score":0.19197781,"about_ca_system_score_codex":0.000035309655,"about_ca_system_score_gemma":0.00007044007,"threshold_uncertainty_score":0.60141414},"labels":[],"label_agreement":null},{"id":"W1975952334","doi":"10.1007/pl00011384","title":"Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities","year":2000,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Monotonic function; Cutting-plane method; Variational inequality; Regular polygon; Plane (geometry); Set (abstract data type); Order (exchange); Applied mathematics; Inequality; Variational analysis; Mathematical optimization; Mathematical analysis; Geometry; Computer science","score_opus":0.0348545579723836,"score_gpt":0.34812445787049195,"score_spread":0.3132698998981084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975952334","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046749154,0.000015720345,0.996447,0.0012021889,0.000019941532,0.00033251048,0.0000066887883,0.000082297986,0.0014261185],"genre_scores_gemma":[0.13836113,0.0000010325942,0.8611262,0.00008682882,0.000038149556,0.00016614121,0.000016450073,0.000005558256,0.00019851133],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988359,0.00012762174,0.00045378858,0.00020235853,0.00020104965,0.0001792421],"domain_scores_gemma":[0.99693996,0.0024592737,0.00012560806,0.0002859066,0.00014400149,0.00004523187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019288547,0.00009257369,0.00019500995,0.000044501794,0.00025787216,0.00012325954,0.000357448,0.000040094917,0.00036212028],"category_scores_gemma":[0.0005474849,0.00006601508,0.00012257924,0.00030539706,0.00006771968,0.00016696512,0.000055834484,0.000069481444,0.000012073857],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024314122,0.000121476965,0.000028873936,0.00008338496,0.000046389716,7.002716e-8,0.0010061975,0.0016477874,0.000082306105,0.8935432,0.00001715732,0.10342076],"study_design_scores_gemma":[0.00013710692,0.000019423029,0.0001438089,0.00001724436,0.000032613054,0.000003893342,0.00009291872,0.7451814,0.0002870728,0.25186586,0.0021250586,0.00009360183],"about_ca_topic_score_codex":0.000007346613,"about_ca_topic_score_gemma":5.6450887e-7,"teacher_disagreement_score":0.7435336,"about_ca_system_score_codex":0.000018986018,"about_ca_system_score_gemma":0.000032754313,"threshold_uncertainty_score":0.3964963},"labels":[],"label_agreement":null},{"id":"W1976411320","doi":"10.4153/cmb-2011-049-2","title":"Constructions of Uniformly Convex Functions","year":2011,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Uniformly convex space; Regular polygon; Subderivative; Banach space; Convex function; Norm (philosophy); Smoothness; Pure mathematics; Convex analysis; Convex optimization; Mathematical analysis; Lp space; Banach manifold; Geometry","score_opus":0.019951392251417423,"score_gpt":0.1823096231776549,"score_spread":0.16235823092623747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976411320","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00071475265,0.000007518916,0.7597654,0.0027346537,0.00007503728,0.000072840805,0.000015125767,0.000041830976,0.23657283],"genre_scores_gemma":[0.79299617,0.0000024049334,0.20143582,0.00070310745,0.000020149633,0.000013292675,0.000007870336,0.000007299681,0.004813904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935746,0.00002376537,0.00022759564,0.00013015544,0.000110279696,0.00015072072],"domain_scores_gemma":[0.99920446,0.00005457928,0.000058222875,0.0002644507,0.0001468001,0.0002714968],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000118755204,0.00006650783,0.00012766743,0.00018345025,0.00009579929,0.000023241078,0.00026910746,0.000045047676,0.025022758],"category_scores_gemma":[0.00010622982,0.000061387895,0.00006468801,0.00033563204,0.00008015081,0.00005628177,0.000025525142,0.000056768797,0.0038573267],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.357905e-7,0.000023416616,0.00010529012,0.0000070106253,0.000022316552,0.000001927155,0.00021894438,0.000020774049,0.0000035746305,0.99562216,0.0035808438,0.0003933324],"study_design_scores_gemma":[0.0012349007,0.00021222829,0.0075715887,0.000115937735,0.00023320784,0.00023991952,0.0013622047,0.16596371,0.00074742385,0.5627823,0.2583574,0.0011791391],"about_ca_topic_score_codex":0.00096422137,"about_ca_topic_score_gemma":0.00038228146,"teacher_disagreement_score":0.7922814,"about_ca_system_score_codex":0.000033462267,"about_ca_system_score_gemma":0.0001921622,"threshold_uncertainty_score":0.99691826},"labels":[],"label_agreement":null},{"id":"W1976466746","doi":"10.1080/01630563.2010.505227","title":"Come Back to Lagrange. The<i>p</i>-Factor Analysis of Optimality Conditions","year":2010,"lang":"en","type":"article","venue":"Numerical Functional Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Memorial University of Newfoundland; Russian Foundation for Basic Research","keywords":"Lagrange multiplier; Mathematics; Degenerate energy levels; Banach space; Constraint algorithm; Operator (biology); Mathematical optimization; Optimization problem; Multiplier (economics); Applied mathematics; Point (geometry); Mathematical analysis; Geometry","score_opus":0.013000893672227119,"score_gpt":0.24728364774143735,"score_spread":0.23428275406921023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976466746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063777007,0.000011431968,0.98901427,0.0037706199,0.0001221014,0.00011343259,0.0000927011,0.000042021733,0.0004557363],"genre_scores_gemma":[0.8295813,0.000019574096,0.16825801,0.0011865833,0.000056369965,0.000022105029,0.0004856412,0.0000069246835,0.00038343572],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981692,0.00011594173,0.00051581755,0.0004832894,0.0005349674,0.0001807852],"domain_scores_gemma":[0.9981251,0.0003356875,0.0002452017,0.00048636095,0.00061129866,0.00019639678],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00031087967,0.00017529869,0.00047472882,0.000991401,0.00031379203,0.0001771998,0.00035261663,0.00009079911,0.0036100282],"category_scores_gemma":[0.00013646075,0.00012899806,0.00047530513,0.011093164,0.00007649929,0.0003680601,0.00012432848,0.00016122268,0.000026583975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010428164,0.00010807501,0.027219519,0.0000020196142,0.0025827948,1.8005774e-7,0.0000708683,0.9435933,0.00017360263,0.025870109,0.00013014114,0.0002389195],"study_design_scores_gemma":[0.00009981497,0.00001978321,0.24727404,6.6245815e-7,0.0019311255,6.018716e-7,0.00000866092,0.7500115,0.00003016628,0.00011125345,0.0003903337,0.000122059995],"about_ca_topic_score_codex":0.0001677261,"about_ca_topic_score_gemma":0.00014906198,"teacher_disagreement_score":0.8232036,"about_ca_system_score_codex":0.000016510952,"about_ca_system_score_gemma":0.000042553795,"threshold_uncertainty_score":0.9973008},"labels":[],"label_agreement":null},{"id":"W1976763955","doi":"10.5539/jmr.v6n1p65","title":"Some Iterative Numerical Methods for a Kind of System of Mixed Nonlinear Variational Inequalities","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Education of Guangdong Province; Natural Science Foundation of Guangdong Province","keywords":"Mathematics; Variational inequality; Banach space; Nonlinear system; Convergence (economics); Iterative method; Applied mathematics; Numerical analysis; Type (biology); Construct (python library); Space (punctuation); Mathematical analysis; Mathematical optimization; Computer science","score_opus":0.12889528561140146,"score_gpt":0.4532454054742502,"score_spread":0.32435011986284873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1976763955","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010860297,0.00004747712,0.9978752,0.00065501273,0.000092206166,0.000104774655,0.000009929301,0.00000411539,0.00012524982],"genre_scores_gemma":[0.07639592,0.0000071686413,0.9233326,0.00001025841,0.00014704966,0.0000052269256,0.0000022989475,0.000006007054,0.00009348681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970106,0.0008819534,0.00095162843,0.00009919864,0.0009131626,0.00014344712],"domain_scores_gemma":[0.9912385,0.004820305,0.00077120186,0.00020454045,0.0028897768,0.000075708806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010463352,0.000073235344,0.0004344125,0.0005103662,0.00007034169,0.000064349704,0.00057631155,0.00005267601,0.000012455556],"category_scores_gemma":[0.002273536,0.000054103908,0.00017788196,0.0005208067,0.00004835557,0.00029642764,0.00010941152,0.00015049179,0.0000018109125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018114397,0.00028080906,0.000022463884,0.00048410197,0.00015967149,3.6226402e-7,0.0019886366,0.0050911037,0.001313906,0.9896531,0.00010726673,0.00088046904],"study_design_scores_gemma":[0.00039364255,0.0002291267,0.000051486157,0.00012462494,0.000019413545,0.000009885907,0.0003330862,0.9463056,0.0035912946,0.0487004,0.00019307643,0.00004836969],"about_ca_topic_score_codex":0.0000047869185,"about_ca_topic_score_gemma":2.2855099e-7,"teacher_disagreement_score":0.9412145,"about_ca_system_score_codex":0.000054276297,"about_ca_system_score_gemma":0.00023719527,"threshold_uncertainty_score":0.36264098},"labels":[],"label_agreement":null},{"id":"W1977349335","doi":"10.1016/j.ejor.2005.11.006","title":"The prediction–correction approach to nonlinear complementarity problems","year":2006,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Victoria","keywords":"Logarithm; Complementarity (molecular biology); Nonlinear complementarity problem; Nonlinear system; Quadratic equation; Mixed complementarity problem; Mathematical optimization; Complementarity theory; Convergence (economics); Computer science; Applied mathematics; Mathematics; Algorithm","score_opus":0.0724075139099365,"score_gpt":0.3238441798358856,"score_spread":0.2514366659259491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977349335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010745376,0.000047669768,0.9561642,0.013301326,0.00038269343,0.0001830699,0.000006401642,0.000016810542,0.028823335],"genre_scores_gemma":[0.7546839,0.000048060276,0.2366179,0.0004508782,0.0018577573,0.000011784122,0.000056320558,0.000020744192,0.006252617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99685115,0.0009403596,0.00052843936,0.00017318435,0.0013072115,0.00019963036],"domain_scores_gemma":[0.997421,0.00022822605,0.00011071984,0.00019570086,0.0019368881,0.000107437634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054130713,0.00007180856,0.0000863274,0.00025816573,0.0008789114,0.00073830894,0.0008010575,0.000010715481,0.00003221141],"category_scores_gemma":[0.00025765522,0.000047961676,0.000070218004,0.0008856398,0.000048491693,0.0004635697,0.0001733864,0.00032240382,0.00007998329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040660823,0.0005307202,0.0016906523,0.0000048829384,0.00008116809,0.000008680544,0.0006251264,0.7025763,0.0005889887,0.13389046,0.15458165,0.005380705],"study_design_scores_gemma":[0.00046965643,0.00027459627,0.03218038,0.000015094183,0.00000595468,0.00007255427,0.000107433734,0.7635829,0.00011628788,0.000659089,0.20242009,0.00009598574],"about_ca_topic_score_codex":0.000033859884,"about_ca_topic_score_gemma":0.000013379767,"teacher_disagreement_score":0.7536094,"about_ca_system_score_codex":0.000109851535,"about_ca_system_score_gemma":0.00020332044,"threshold_uncertainty_score":0.711953},"labels":[],"label_agreement":null},{"id":"W1978632776","doi":"10.1016/j.cor.2013.05.012","title":"Master problem approximations in Dantzig–Wolfe decomposition of variational inequality problems with applications to two energy market models","year":2013,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Decomposition; Mathematical economics; Variational inequality; Mathematics; Mathematical optimization; Inequality; Applied mathematics; Mathematical analysis","score_opus":0.062463347888046,"score_gpt":0.33801531280820835,"score_spread":0.2755519649201623,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1978632776","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008455947,0.000014475332,0.9884014,0.0063801147,0.000022476626,0.0012939386,0.000018828974,0.00005720487,0.0029659735],"genre_scores_gemma":[0.43210608,0.000007786104,0.56538624,0.00023481315,0.00003782533,0.0017494434,0.00013551537,0.00001150121,0.00033077714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969694,0.0005221639,0.0006768444,0.0005942581,0.00086885603,0.00036846963],"domain_scores_gemma":[0.9969567,0.00027663627,0.000073980955,0.00065728737,0.0018459028,0.00018945712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010221554,0.00017046265,0.000245483,0.0010754223,0.00038080575,0.00053800264,0.0008696472,0.000061407496,0.00015114337],"category_scores_gemma":[0.000022424498,0.00015347438,0.000052739626,0.003325225,0.00007391247,0.0015962303,0.00036408586,0.00019648089,0.000044453467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043316586,0.0002623642,0.0001839866,0.000014293206,0.000024513,2.3643832e-7,0.0004928972,0.6362111,0.00022686324,0.36021715,0.0004904151,0.0018718102],"study_design_scores_gemma":[0.00047635913,0.000079671074,0.0020632034,0.000043039712,0.0000047826256,0.0000037998718,0.00003898495,0.98138624,0.00008547082,0.01536983,0.00027315837,0.00017544933],"about_ca_topic_score_codex":0.0013981331,"about_ca_topic_score_gemma":0.0006661895,"teacher_disagreement_score":0.43126047,"about_ca_system_score_codex":0.00017601349,"about_ca_system_score_gemma":0.00034980543,"threshold_uncertainty_score":0.6258504},"labels":[],"label_agreement":null},{"id":"W1979110618","doi":"10.1016/s0377-0427(99)00262-9","title":"Spaces and maps approximation and fixed points","year":2000,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Convexity; Topological space; Locally convex topological vector space; Property (philosophy); Fixed-point property; Topological vector space; Pure mathematics; Space (punctuation); Relation (database); Fixed point; Regular polygon; Topology (electrical circuits); Discrete mathematics; Fixed-point theorem; Mathematical analysis; Combinatorics; Geometry; Computer science","score_opus":0.009507699872111799,"score_gpt":0.2188693099942182,"score_spread":0.20936161012210638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979110618","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11008341,0.000115422394,0.8850049,0.0027843958,0.00001989959,0.00007465076,0.0000024225592,0.000015171794,0.0018997655],"genre_scores_gemma":[0.26210895,0.00009105046,0.7374237,0.00023191639,0.0000350401,0.0000011647717,0.0000029742628,0.000003729644,0.00010147909],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992804,0.000012120344,0.00030820418,0.0000943387,0.00024211871,0.00006284408],"domain_scores_gemma":[0.9994054,0.00016596471,0.00021194834,0.000046116515,0.0000980248,0.00007253436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025765065,0.00007937237,0.00016860037,0.00009779603,0.0000921961,0.0001812956,0.000084355685,0.000027771062,0.000028166298],"category_scores_gemma":[0.000013564207,0.00006245059,0.000022465456,0.00013357114,0.000034871653,0.00024568007,0.000031507097,0.000059659338,0.0000034157536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012033234,0.00011187138,0.00006384273,0.00007326929,0.00006931232,0.0000018088343,0.0018063384,0.025394563,0.000052260435,0.93725616,0.0002882561,0.03487027],"study_design_scores_gemma":[0.0005653935,0.000036134472,0.0021375497,0.000025163145,0.000028927483,0.00015568367,0.00009581483,0.5458752,0.000036078916,0.450492,0.0004493293,0.000102716534],"about_ca_topic_score_codex":3.3730106e-7,"about_ca_topic_score_gemma":1.5944752e-7,"teacher_disagreement_score":0.52048063,"about_ca_system_score_codex":0.0000062785357,"about_ca_system_score_gemma":0.000021693657,"threshold_uncertainty_score":0.25466612},"labels":[],"label_agreement":null},{"id":"W1979589904","doi":"10.1007/s10957-006-9140-6","title":"Generalized Motzkin Theorems of the Alternative and Vector Optimization Problems","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saskatchewan Polytechnic","funders":"","keywords":"Mathematics; Hausdorff space; Convexity; Saddle point; Lagrangian; Vector optimization; Applied mathematics; Mathematical optimization; Optimization problem; Pure mathematics","score_opus":0.006239397431636806,"score_gpt":0.21845180230667405,"score_spread":0.21221240487503723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979589904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007638886,0.0002701371,0.9970588,0.0010935678,0.000050155002,0.00021261293,0.0000057551892,0.000012528721,0.0005325485],"genre_scores_gemma":[0.64913565,0.00061339105,0.34925517,0.0002651886,0.00020659629,0.00003712733,0.000015627467,0.000016156979,0.00045509846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883735,0.00022748674,0.00048592009,0.0001487819,0.00021952954,0.00008093055],"domain_scores_gemma":[0.9983672,0.00018222384,0.0007459662,0.00019649617,0.00046296345,0.00004518796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006545285,0.00010147197,0.00017240051,0.00014452638,0.00020161811,0.000096037926,0.00032148763,0.000046446625,0.000034335786],"category_scores_gemma":[0.00005752726,0.00006970696,0.000072829214,0.00057626975,0.00011148679,0.00041420574,0.00007653796,0.000080798534,3.0654684e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000057476705,0.0000396329,0.000076548466,0.00000427872,0.000019217445,5.1814826e-8,0.000083123814,0.55890715,0.00007118012,0.44045043,0.000016357813,0.0003262717],"study_design_scores_gemma":[0.00053864444,0.000030197072,0.00048392388,0.000020627846,0.00006349542,0.000024754903,0.000035660854,0.9121485,0.00067193125,0.08553589,0.0003465615,0.00009981822],"about_ca_topic_score_codex":0.0000066272396,"about_ca_topic_score_gemma":8.4945856e-7,"teacher_disagreement_score":0.64837176,"about_ca_system_score_codex":0.00001831743,"about_ca_system_score_gemma":0.00004829,"threshold_uncertainty_score":0.28425673},"labels":[],"label_agreement":null},{"id":"W1981385009","doi":"10.1155/2010/580956","title":"Normal Structure and Common Fixed Point Properties for Semigroups of Nonexpansive Mappings in Banach Spaces","year":2010,"lang":"en","type":"article","venue":"Fixed Point Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Banach space; Fixed point; Semigroup; Regular polygon; Uniformly convex space; Pure mathematics; Fixed-point theorem; Differential geometry; Image (mathematics); Discrete mathematics; Mathematical analysis; Banach manifold; Lp space; Computer science; Geometry","score_opus":0.006107313924670814,"score_gpt":0.2168407403920712,"score_spread":0.2107334264674004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981385009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30580196,0.000111922665,0.6891102,0.0035619438,0.00004399324,0.0007797959,0.00009581803,0.000051524126,0.0004428445],"genre_scores_gemma":[0.9803714,0.000014078263,0.019039689,0.00023492654,0.000034571047,0.00012836426,0.000034177137,0.000005105066,0.0001376644],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993145,0.00005133532,0.00021753418,0.00022897136,0.00007716526,0.00011051106],"domain_scores_gemma":[0.9992946,0.00020016619,0.00011613996,0.00022831689,0.000108993874,0.000051798845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031318984,0.00009843241,0.00016151581,0.00011330747,0.00014990233,0.00006624224,0.00019990088,0.00006452101,0.000033726934],"category_scores_gemma":[0.000043285498,0.000081154176,0.000033869987,0.00025176644,0.0000933439,0.00025808084,0.00009052153,0.00011403427,0.0000011623578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028101758,0.000050218732,0.0010510314,0.000044738874,0.000024206338,1.0808307e-7,0.0019665337,0.00036535482,0.018710436,0.97406393,0.000056987818,0.0036383339],"study_design_scores_gemma":[0.0027190556,0.00022204759,0.04327905,0.00010392733,0.00014250539,0.000046892386,0.002741694,0.23574936,0.069843255,0.63253015,0.011602866,0.0010191819],"about_ca_topic_score_codex":0.000033800225,"about_ca_topic_score_gemma":0.00010396635,"teacher_disagreement_score":0.6745695,"about_ca_system_score_codex":0.000005786901,"about_ca_system_score_gemma":0.000024650366,"threshold_uncertainty_score":0.33093712},"labels":[],"label_agreement":null},{"id":"W1981469074","doi":"10.1109/cdc.2014.7039353","title":"On the relation between the Minimum Principle and Dynamic Programming for Hybrid systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Maximum principle; Bellman equation; Dynamic programming; Adjoint equation; Optimal control; Mathematics; Hamiltonian (control theory); Function (biology); Mathematical optimization; Boundary value problem; Hybrid system; Control theory (sociology); Key (lock); Applied mathematics; Computer science; Mathematical analysis; Control (management); Differential equation","score_opus":0.014811884335014023,"score_gpt":0.2488992018600398,"score_spread":0.2340873175250258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981469074","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008277053,0.000007320076,0.9839255,0.006720121,0.000054641896,0.00027758916,0.0000010702053,0.00004208534,0.0006946079],"genre_scores_gemma":[0.9873737,0.0000010729153,0.011461189,0.00022341963,0.000034259276,0.000040639487,0.000007470436,0.0000029248395,0.000855326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946964,0.00006602186,0.00012011414,0.0001389114,0.00012625016,0.00007909014],"domain_scores_gemma":[0.9989627,0.00068942,0.00006741353,0.00020305799,0.00005694313,0.000020475843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056667347,0.000049257607,0.000058495687,0.000028437344,0.0002506623,0.00021309587,0.00021306402,0.00001419503,0.0000026795142],"category_scores_gemma":[0.00011079734,0.000023783672,0.000029334336,0.00012517428,0.000013748327,0.00009979606,0.000043297125,0.00003399774,0.000007140077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.1160564e-7,0.00000671755,0.00065154297,0.0000042624606,0.000019063431,1.611224e-8,0.000067240304,0.005807581,0.0000025784673,0.9879899,0.00012473481,0.005325475],"study_design_scores_gemma":[0.00007539171,0.000027835727,0.0056609185,0.0000038787452,0.000010437601,5.116303e-7,0.000009412705,0.98514944,0.0000058878386,0.0038333114,0.0051830895,0.000039905328],"about_ca_topic_score_codex":0.000007900779,"about_ca_topic_score_gemma":0.0000027865717,"teacher_disagreement_score":0.98415655,"about_ca_system_score_codex":0.000012249873,"about_ca_system_score_gemma":0.000009204562,"threshold_uncertainty_score":0.20548885},"labels":[],"label_agreement":null},{"id":"W1982355939","doi":"10.1007/s10957-015-0716-x","title":"On the Existence of Minimizers of Proximity Functions for Split Feasibility Problems","year":2015,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Dual polyhedron; Mathematics; Regular polygon; Mathematical optimization; Inverse problem; Convex function; Point (geometry); Function (biology); Inverse; Applied mathematics; Mathematical analysis; Combinatorics; Geometry","score_opus":0.04676003462394457,"score_gpt":0.27819052789319826,"score_spread":0.2314304932692537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982355939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009976971,0.000057133788,0.99635524,0.001468336,0.000035700607,0.000411947,0.000014475101,0.0000074978016,0.0006519772],"genre_scores_gemma":[0.6962543,0.00005674344,0.3028487,0.00023932621,0.00006135881,0.000106924446,0.000012379757,0.000008493186,0.00041174222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989584,0.00015245363,0.0004902755,0.00012444235,0.00021055377,0.000063843996],"domain_scores_gemma":[0.99711925,0.0007037346,0.0007294807,0.00026023886,0.0011168682,0.000070455644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017512417,0.00007103504,0.000169368,0.000110644774,0.00011590683,0.000031055006,0.00031245942,0.00003582432,0.000017194936],"category_scores_gemma":[0.0004932031,0.000047646186,0.00009672609,0.00048525285,0.00010395071,0.00029310552,0.000033229444,0.00006310647,5.4478073e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048631868,0.00014612032,0.00006683292,0.00001248982,0.00002908366,1.4061604e-8,0.00020166335,0.385893,0.000021152146,0.613025,0.000114477414,0.00044152697],"study_design_scores_gemma":[0.0012857626,0.0004262111,0.00039556457,0.00005007438,0.00015437361,0.00001260459,0.00070952054,0.54443634,0.00067221903,0.45083487,0.0008667418,0.00015571153],"about_ca_topic_score_codex":8.5098907e-7,"about_ca_topic_score_gemma":3.0303633e-7,"teacher_disagreement_score":0.69525665,"about_ca_system_score_codex":0.000022373648,"about_ca_system_score_gemma":0.00013171423,"threshold_uncertainty_score":0.19429551},"labels":[],"label_agreement":null},{"id":"W1983155329","doi":"10.1080/02331930008844509","title":"A path-following cutting plane method for some monotone variational inequalities<sup>∗</sup>","year":2000,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Monotone polygon; Variational inequality; Cutting-plane method; Path (computing); Affine transformation; Operator (biology); Plane (geometry); Set (abstract data type); Strongly monotone; Regular polygon; Point (geometry); Combinatorics; Applied mathematics; Mathematical optimization; Pure mathematics; Geometry; Computer science","score_opus":0.016332408866664313,"score_gpt":0.2697094271933224,"score_spread":0.2533770183266581,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983155329","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021222318,0.00004574293,0.9961826,0.0018898713,0.00010334803,0.0002929868,0.000032308555,0.00020584279,0.0010350554],"genre_scores_gemma":[0.008666537,0.000040470055,0.98705065,0.0014091003,0.000223465,0.00010314079,0.00060511474,0.000022638747,0.0018788871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981502,0.00019086378,0.0004891624,0.00047738367,0.00040845003,0.00028389174],"domain_scores_gemma":[0.99889344,0.00037276093,0.00016293158,0.00030580562,0.00016752373,0.00009752572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008816509,0.00019066042,0.0002489052,0.00019999142,0.00037010145,0.00029912905,0.00037811347,0.00012732473,0.0005345462],"category_scores_gemma":[0.00018230724,0.00019807975,0.00017448113,0.00065216544,0.0000090144,0.0013251447,0.000047448702,0.000108024695,0.000036511636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011035673,0.00005487463,0.00007253194,0.000009027832,0.000062904895,0.0000011478813,0.0005674426,0.8974514,0.000007848715,0.0957851,0.0002140214,0.0057626497],"study_design_scores_gemma":[0.0006832656,0.00003296041,0.00004749241,0.00001681112,0.00004460232,0.0000042944453,0.000031678075,0.9934175,0.000039829145,0.004183027,0.0012615251,0.00023703619],"about_ca_topic_score_codex":0.00003949871,"about_ca_topic_score_gemma":4.960539e-7,"teacher_disagreement_score":0.09596606,"about_ca_system_score_codex":0.00008069853,"about_ca_system_score_gemma":0.000109248984,"threshold_uncertainty_score":0.8077458},"labels":[],"label_agreement":null},{"id":"W1986956864","doi":"10.1016/s0893-9659(00)00141-5","title":"Monotone mixed variational inequalities","year":2001,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Monotone polygon; Variational inequality; Convergence (economics); Simple (philosophy); Applied mathematics; Operator splitting; Inequality; Strongly monotone; Mathematical analysis; Geometry","score_opus":0.01832823554655299,"score_gpt":0.2228908448663974,"score_spread":0.2045626093198444,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986956864","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041092276,0.0000036222698,0.9805211,0.007239551,0.00007657317,0.00009937712,0.0000017427782,0.00014876427,0.007800049],"genre_scores_gemma":[0.23206647,0.000009600838,0.7616744,0.0056150462,0.0001015729,0.000059496477,0.000027908003,0.000013497769,0.00043203056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895567,0.000017838105,0.00029563814,0.00021048292,0.00034974178,0.00017066086],"domain_scores_gemma":[0.99922764,0.00020108616,0.00013415946,0.00033115438,0.000049841234,0.00005609798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030965247,0.00011928451,0.00015672747,0.00013354619,0.00011068883,0.00012797033,0.00041049885,0.00003509782,0.00012997577],"category_scores_gemma":[0.000030921536,0.00011206436,0.000057603804,0.00043186478,0.000020799605,0.00019502437,0.000093713374,0.00006162831,0.00022273356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001145491,0.0000683566,0.000030771884,0.000008713602,0.000040813975,0.0000018592012,0.0006924511,0.006624818,0.0022779482,0.9882612,0.0016578353,0.00033407402],"study_design_scores_gemma":[0.0006284499,0.0000092807095,0.0008852758,0.000010295494,0.00003935899,0.000017554143,0.00014802052,0.85667574,0.00088311004,0.13559815,0.0046463804,0.0004583907],"about_ca_topic_score_codex":0.0000067828296,"about_ca_topic_score_gemma":0.000001490064,"teacher_disagreement_score":0.85266304,"about_ca_system_score_codex":0.00003328572,"about_ca_system_score_gemma":0.000021531776,"threshold_uncertainty_score":0.45698518},"labels":[],"label_agreement":null},{"id":"W1987001847","doi":"10.1016/s0377-0427(00)00569-0","title":"Modified resolvent splitting algorithms for general mixed variational inequalities","year":2001,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Resolvent; Variational inequality; Applied mathematics; Inequality; Numerical analysis; Algorithm; Mathematical analysis; Algebra over a field; Calculus (dental); Pure mathematics","score_opus":0.04169531961294965,"score_gpt":0.27947208045288163,"score_spread":0.237776760839932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987001847","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009034255,0.00003675238,0.98868245,0.0014712883,0.00010543228,0.00010371321,0.0000066820135,0.000017703052,0.0005417172],"genre_scores_gemma":[0.08827131,0.000014693213,0.91096187,0.00027091557,0.00026460915,0.000008412472,0.000015844189,0.0000071959057,0.00018512899],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858415,0.000022068143,0.0006843952,0.000129855,0.00045293703,0.00012659235],"domain_scores_gemma":[0.99799675,0.00063582574,0.00073346944,0.00007827171,0.00047193165,0.00008373457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008038623,0.000115181836,0.00025415284,0.00017374195,0.00015679172,0.00015626558,0.0002264712,0.000042344473,0.000010980155],"category_scores_gemma":[0.00009590396,0.000096134034,0.00010309472,0.00022202748,0.000021942642,0.00022013253,0.000056672212,0.000075257754,0.0000017364208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009122416,0.000088044486,0.000009272848,0.00002041034,0.000058984257,8.598891e-7,0.00036462513,0.2987412,0.000029535484,0.69820774,0.00016661006,0.0023036078],"study_design_scores_gemma":[0.00048825756,0.000026134692,0.0003619342,0.000010969561,0.00002082064,0.000045719684,0.000058454014,0.6386859,0.000020207357,0.35987005,0.00033545517,0.00007612804],"about_ca_topic_score_codex":8.534814e-7,"about_ca_topic_score_gemma":2.4419504e-7,"teacher_disagreement_score":0.3399447,"about_ca_system_score_codex":0.000029436425,"about_ca_system_score_gemma":0.00009863923,"threshold_uncertainty_score":0.3920232},"labels":[],"label_agreement":null},{"id":"W1987426864","doi":"10.1007/s10957-008-9431-1","title":"Quasiconvex Minimization on a Locally Finite Union of Convex Sets","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Quasiconvex function; Mathematics; Theory of computation; Bilevel optimization; Banach space; Mathematical optimization; Subderivative; Convex optimization; Convex function; Regular polygon; Convex analysis; Finite set; Optimization problem; Pure mathematics; Mathematical analysis; Algorithm","score_opus":0.012378892796792258,"score_gpt":0.24132721737783436,"score_spread":0.2289483245810421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987426864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004822799,0.00008503615,0.99752426,0.0008518007,0.000045536137,0.0001362113,0.000005094323,0.000020106547,0.00084967463],"genre_scores_gemma":[0.81454664,0.0009784995,0.18323255,0.00073284126,0.00008988557,0.000018207353,0.000032045104,0.0000138172145,0.00035550035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866587,0.00024084072,0.0005722546,0.00015901787,0.00027525367,0.00008677996],"domain_scores_gemma":[0.99782664,0.00046713493,0.0007168088,0.0002237601,0.0006717106,0.000093976036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006241202,0.000108293614,0.00022068316,0.00032276308,0.00019467896,0.000034842924,0.00028840196,0.000067020505,0.00006314848],"category_scores_gemma":[0.00015247278,0.0000948753,0.0000849284,0.0007264034,0.00009318942,0.00044454017,0.000036254976,0.00009887408,0.0000046264995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029502255,0.00015189398,0.00012808402,0.00000732518,0.000037018373,9.3257086e-7,0.00027754824,0.6909942,0.000025015766,0.3055953,0.0000965917,0.0026565816],"study_design_scores_gemma":[0.0011751733,0.000278569,0.001057819,0.000048128775,0.00007198398,0.00009145896,0.00012166487,0.97590905,0.0008819993,0.018104302,0.0020359175,0.000223949],"about_ca_topic_score_codex":7.53542e-7,"about_ca_topic_score_gemma":1.2913394e-7,"teacher_disagreement_score":0.8142917,"about_ca_system_score_codex":0.000019834833,"about_ca_system_score_gemma":0.000116673844,"threshold_uncertainty_score":0.38689023},"labels":[],"label_agreement":null},{"id":"W1990258881","doi":"10.1007/s100120200047","title":"Some New Iterative Methods for General Mixed Variational Inequalities","year":2003,"lang":"en","type":"article","venue":"Southeast Asian Bulletin of Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Variational inequality; Mathematics; Monotonic function; Convergence (economics); Class (philosophy); Operator (biology); Applied mathematics; Mathematical optimization; Algebra over a field; Calculus (dental); Pure mathematics; Mathematical analysis; Computer science; Artificial intelligence","score_opus":0.03148324801082619,"score_gpt":0.3006162008021096,"score_spread":0.2691329527912834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990258881","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000037738508,0.000057088204,0.9908751,0.0054784045,0.00016303238,0.00018829752,0.000023373676,0.000045479403,0.0031314457],"genre_scores_gemma":[0.0021275724,0.0000023542448,0.992247,0.00021821007,0.00012202032,0.00002373535,0.000016674749,0.000014025681,0.0052284203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855405,0.00027135148,0.0005164751,0.00023114753,0.0002456351,0.00018132072],"domain_scores_gemma":[0.9984718,0.00045393428,0.00041535706,0.00030631636,0.00025562046,0.00009697856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011272313,0.00015580082,0.00030592823,0.00013481769,0.000104147606,0.00009717817,0.00034595028,0.00006693381,0.00037376347],"category_scores_gemma":[0.000938153,0.00013901315,0.00017294881,0.00021148677,0.000029847886,0.00008209367,0.000048306145,0.0000577067,0.00004316412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002115113,0.0000995875,0.000009091322,0.000037693568,0.000072912815,1.11216124e-7,0.0036000041,0.0008373322,0.00003614641,0.99313766,0.001433259,0.0007340816],"study_design_scores_gemma":[0.0008513063,0.00006384878,0.00006258007,0.000035170797,0.00006208501,0.000007831033,0.0014562845,0.23441002,0.00082270807,0.73699284,0.024928857,0.0003064702],"about_ca_topic_score_codex":0.0000070906876,"about_ca_topic_score_gemma":5.7289856e-7,"teacher_disagreement_score":0.25614482,"about_ca_system_score_codex":0.000020532112,"about_ca_system_score_gemma":0.00015043837,"threshold_uncertainty_score":0.56687915},"labels":[],"label_agreement":null},{"id":"W1990402864","doi":"10.1007/s10957-013-0493-3","title":"Enhanced Karush–Kuhn–Tucker Conditions for Mathematical Programs with Equilibrium Constraints","year":2013,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Normality; Mathematics; Constraint (computer-aided design); Mathematical optimization; Karush–Kuhn–Tucker conditions; Applied mathematics; Stationary point; Function (biology); Mathematical economics; Mathematical analysis; Algorithm; Statistics; Geometry","score_opus":0.008820990722988718,"score_gpt":0.24866347583770362,"score_spread":0.2398424851147149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990402864","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046067112,0.000023305596,0.9961281,0.0013906021,0.000019702626,0.00058883376,0.00000536814,0.000034915684,0.0013485452],"genre_scores_gemma":[0.4366439,0.00002277814,0.56195694,0.00035631997,0.000092545575,0.000389935,0.00003851616,0.0000125734605,0.00048648997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904114,0.00007017374,0.00041874713,0.00016379869,0.00017485625,0.00013131382],"domain_scores_gemma":[0.99815154,0.00031707453,0.00039294903,0.00018115604,0.0008228768,0.00013438896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004003766,0.000109936416,0.00018742082,0.00013375525,0.00017742165,0.00023914404,0.00025340586,0.000050628838,0.00032457392],"category_scores_gemma":[0.0000633646,0.000082083345,0.0000742694,0.0003845684,0.00015377656,0.0007666202,0.000029678431,0.00007545022,0.000014238343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000135739965,0.0001898344,0.000013997143,0.000016293157,0.00008664484,1.8860129e-7,0.00016744557,0.08910013,0.0002654822,0.90410334,0.000107804284,0.005935265],"study_design_scores_gemma":[0.0017102016,0.00031700276,0.00015471947,0.00007261635,0.00019808054,0.00013161181,0.0004630758,0.62780005,0.0011352621,0.3669078,0.0007490989,0.000360444],"about_ca_topic_score_codex":2.2590095e-7,"about_ca_topic_score_gemma":8.9713915e-8,"teacher_disagreement_score":0.5386999,"about_ca_system_score_codex":0.000016954556,"about_ca_system_score_gemma":0.00008295095,"threshold_uncertainty_score":0.3553857},"labels":[],"label_agreement":null},{"id":"W1990675706","doi":"10.5539/jmr.v3n4p55","title":"One Property of Bregman Projection onto Closed Convex Sets in Banach Spaces and Applications","year":2011,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Banach space; Bregman divergence; Regular polygon; Projection (relational algebra); Property (philosophy); Class (philosophy); Projection method; Convex analysis; Pure mathematics; Uniformly convex space; Convex optimization; Dykstra's projection algorithm; Mathematical optimization; Applied mathematics; Banach manifold; Algorithm; Lp space; Computer science; Geometry; Artificial intelligence","score_opus":0.1832710458181915,"score_gpt":0.3682072577706627,"score_spread":0.1849362119524712,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990675706","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053380728,0.00020541364,0.93280387,0.0024984307,0.00004035391,0.0007705198,0.0000028564439,0.000016397724,0.01028145],"genre_scores_gemma":[0.7778166,0.0001605038,0.22159755,0.000013730956,0.000026604383,0.000015101236,6.336417e-7,0.000005728688,0.00036357375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986591,0.000125927,0.0004159048,0.00009596378,0.00059119257,0.000111956004],"domain_scores_gemma":[0.9985738,0.00013931694,0.0002529489,0.00017187453,0.00080041407,0.00006168295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020402512,0.000047450365,0.00018576854,0.000513636,0.000057262157,0.0000560477,0.00033821719,0.000039034825,0.000033705495],"category_scores_gemma":[0.00013003442,0.000032445227,0.000032750777,0.00064502767,0.000054739965,0.00029062032,0.000087746994,0.00018059021,0.000004520649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014860272,0.010588273,0.018133465,0.0019567236,0.0006775297,0.000022966726,0.06447962,0.00094988395,0.009548274,0.82951474,0.0016779632,0.06230198],"study_design_scores_gemma":[0.0021333606,0.0009708764,0.04331959,0.0004636301,0.00006477334,0.0001118587,0.0037321562,0.8071447,0.0059816814,0.13443998,0.001292132,0.00034528144],"about_ca_topic_score_codex":0.00010941606,"about_ca_topic_score_gemma":0.00010267525,"teacher_disagreement_score":0.8061948,"about_ca_system_score_codex":0.000042212996,"about_ca_system_score_gemma":0.00014637332,"threshold_uncertainty_score":0.1323078},"labels":[],"label_agreement":null},{"id":"W1991326129","doi":"10.1006/jmaa.2000.6776","title":"Splitting Methods for Pseudomonotone Mixed Variational Inequalities","year":2000,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Variational inequality; Monotone polygon; Mathematics; Convergence (economics); Operator splitting; Simple (philosophy); Applied mathematics; Monotonic function; Mathematical analysis; Geometry","score_opus":0.023950984754422266,"score_gpt":0.340363617772442,"score_spread":0.31641263301801975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991326129","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041571265,0.00007789972,0.9964118,0.0024239183,0.000008066891,0.00010933099,0.0000057999587,0.000013891503,0.0005335672],"genre_scores_gemma":[0.027824445,0.00006203398,0.9711775,0.00017987724,0.00010673095,0.000052355463,0.000008403778,0.0000043649443,0.00058429973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998663,0.00012070711,0.0007386241,0.00016033422,0.00020724488,0.00011007427],"domain_scores_gemma":[0.99785453,0.0011274958,0.0003547068,0.00019470938,0.00035930314,0.00010922853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016948323,0.00009313776,0.0003765953,0.00027524793,0.00017698988,0.00015890884,0.00029485647,0.00004244476,0.00037188584],"category_scores_gemma":[0.00014703965,0.00007090751,0.0003205776,0.0010470123,0.000029585724,0.0002612608,0.000029107032,0.00006861216,0.000007877653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000047930166,0.0001738164,0.000058119742,0.000019519259,0.0007606493,1.3321572e-7,0.00019376578,0.0049026925,0.00008316091,0.8938425,0.000057093483,0.09990373],"study_design_scores_gemma":[0.00020893788,0.000021297132,0.00067159446,0.000005654029,0.0007239338,0.000010453443,0.000040498373,0.7036864,0.0001021645,0.29011536,0.0043197856,0.000093904055],"about_ca_topic_score_codex":0.0000021928672,"about_ca_topic_score_gemma":6.3015176e-7,"teacher_disagreement_score":0.6987837,"about_ca_system_score_codex":0.000016576707,"about_ca_system_score_gemma":0.00003873314,"threshold_uncertainty_score":0.40718892},"labels":[],"label_agreement":null},{"id":"W1991964874","doi":"10.1007/s10898-013-0037-2","title":"Abstract convexity of topical functions","year":2013,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Graduate University of Advanced Technology; Indian Council of Agricultural Research; Centre de Recherches Mathématiques","keywords":"Convexity; Mathematics; Subderivative; Characterization (materials science); Homogeneous; Set (abstract data type); Space (punctuation); Polarity (international relations); Pure mathematics; Convex function; Regular polygon; Applied mathematics; Combinatorics; Convex optimization; Geometry; Computer science","score_opus":0.01030778035003522,"score_gpt":0.23725384335320743,"score_spread":0.22694606300317222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991964874","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00587014,0.00002481616,0.98844415,0.0019249275,0.00024582428,0.00004528707,0.0000022472113,0.0000115781395,0.0034310443],"genre_scores_gemma":[0.7877443,0.000017725655,0.2119755,0.00013390894,0.000057626585,7.8997465e-7,0.0000026140474,0.000001714321,0.000065846354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905765,0.00003257303,0.00046018,0.00007911426,0.0002938487,0.00007661702],"domain_scores_gemma":[0.9984444,0.000032570664,0.00046443727,0.00012276294,0.0008560852,0.00007977015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014043515,0.00006153426,0.00014907256,0.00005906291,0.000044482054,0.000070784525,0.00026587705,0.000048771883,0.00043456463],"category_scores_gemma":[0.0001004859,0.000050348433,0.00011286238,0.00047977924,0.000022991608,0.0008522626,0.000035122786,0.000059271893,0.000018290055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000530762,0.00011789009,0.008614507,0.000004567128,0.000050169434,0.0000011014224,0.000033087024,0.96233076,0.00005442228,0.025627337,0.0015345564,0.0016263239],"study_design_scores_gemma":[0.00039257793,0.00008592939,0.12879722,0.000012938216,0.000026948715,0.000026374813,0.000036505488,0.8681374,0.000054556393,0.0021935473,0.00015624116,0.000079773396],"about_ca_topic_score_codex":0.000030608695,"about_ca_topic_score_gemma":0.0000020464452,"teacher_disagreement_score":0.7818741,"about_ca_system_score_codex":0.00007104201,"about_ca_system_score_gemma":0.00009833816,"threshold_uncertainty_score":0.4758178},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03807651040896165,"score_gpt":0.27754327977349247,"score_spread":0.23946676936453082,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993863961","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012105677,0.000011457116,0.9855393,0.00085257395,0.000025785774,0.00024452526,0.000015604885,0.00015717885,0.0010478697],"genre_scores_gemma":[0.78481793,0.0000028354314,0.214006,0.00019496569,0.000060689246,0.0000621134,0.00014690013,0.000010754196,0.00069781474],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980231,0.00009363777,0.00041280477,0.00053625804,0.0005719625,0.0003622555],"domain_scores_gemma":[0.9986338,0.00011219442,0.00019673725,0.00053392636,0.00032355924,0.00019979758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003881679,0.00020146373,0.00046607867,0.00031453828,0.00023218484,0.00016620562,0.00051005254,0.00006810703,0.00037315892],"category_scores_gemma":[0.0000741564,0.00015126173,0.00042734557,0.0023465056,0.00017746307,0.00037123382,0.0000784678,0.00008126671,0.000058816313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028575351,0.0027843066,0.050839633,0.00018637833,0.023202261,0.00016832257,0.006739204,0.22964084,0.00033500767,0.666859,0.0024079294,0.016551392],"study_design_scores_gemma":[0.00055979175,0.00010186883,0.0010270163,0.000006605601,0.00092749664,0.000020972779,0.00004553487,0.9951718,0.00013806703,0.0015278396,0.00022071874,0.00025233073],"about_ca_topic_score_codex":0.000017327646,"about_ca_topic_score_gemma":0.000010818367,"teacher_disagreement_score":0.77271223,"about_ca_system_score_codex":0.000038603273,"about_ca_system_score_gemma":0.00015480947,"threshold_uncertainty_score":0.6168274},"labels":[],"label_agreement":null},{"id":"W1994393126","doi":"10.1007/s10898-008-9296-8","title":"The non-existence of a regular exceptional family of elements. A necessary and sufficient condition. Applications to complementarity theory","year":2008,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Complementarity (molecular biology); Mathematics; Complementarity theory; Mathematical economics; Mathematical optimization","score_opus":0.014932456409318614,"score_gpt":0.2737755095552268,"score_spread":0.25884305314590816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994393126","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0138991065,0.000130293,0.9844063,0.0009394288,0.000058037956,0.00018097638,0.00003675918,0.0000054076545,0.00034369068],"genre_scores_gemma":[0.6767851,0.00021566616,0.32264638,0.00026950528,0.000030968586,0.000007757181,0.00001683969,0.0000028140028,0.000024950194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984058,0.00009672645,0.00072393555,0.00013342802,0.0005363083,0.000103769285],"domain_scores_gemma":[0.9978252,0.000104411876,0.00077828567,0.00018782984,0.001019817,0.00008447662],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006352578,0.00008599729,0.00018893326,0.00009148884,0.0002461409,0.000035308763,0.00041301252,0.000028436622,0.00002293016],"category_scores_gemma":[0.00005843176,0.00006658962,0.00008568092,0.0007766496,0.00011370464,0.00031908695,0.00010682991,0.000052581658,0.0000010298057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063370404,0.00028043706,0.0074422145,0.000012434114,0.000119858356,0.0000013450157,0.00026821962,0.7627856,0.00017327374,0.22676842,0.001001554,0.001083283],"study_design_scores_gemma":[0.0017076512,0.000535283,0.18201435,0.000069563146,0.00013659209,0.000115643954,0.0006582577,0.8003732,0.0001800864,0.012267939,0.0016789713,0.0002624535],"about_ca_topic_score_codex":0.000012691932,"about_ca_topic_score_gemma":0.0000035402352,"teacher_disagreement_score":0.662886,"about_ca_system_score_codex":0.0000854802,"about_ca_system_score_gemma":0.00015498862,"threshold_uncertainty_score":0.2715446},"labels":[],"label_agreement":null},{"id":"W1995445457","doi":"10.4236/ajor.2013.32026","title":"Generating Efficient Solutions in Bilevel Multi-Objective Programming Problems","year":2013,"lang":"en","type":"article","venue":"American Journal of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Bilevel optimization; Decision maker; Mathematical optimization; Construct (python library); Point (geometry); Multiobjective programming; Linear programming; Computer science; Mathematics; Optimization problem; Multi-objective optimization; Operations research","score_opus":0.07852591409686466,"score_gpt":0.3622887004825126,"score_spread":0.28376278638564795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995445457","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07623229,0.000061713465,0.91901124,0.004268632,0.000048648555,0.00029668034,9.899844e-7,0.000012185958,0.00006764951],"genre_scores_gemma":[0.636519,0.000014120316,0.3632484,0.00004747626,0.000037248094,0.00005039848,0.0000012080716,0.0000044557487,0.00007767313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978107,0.00050699257,0.000507896,0.00019792521,0.0006289182,0.00034753216],"domain_scores_gemma":[0.99724853,0.00016951667,0.00010042455,0.00019833115,0.0021465172,0.0001366898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017322678,0.00008158195,0.00018166655,0.0009329851,0.0004631665,0.00052982976,0.00051251036,0.000021170481,0.00005051732],"category_scores_gemma":[0.00046489638,0.0000657579,0.00006954264,0.0029348626,0.00015154661,0.00061568,0.00014617032,0.00037640508,0.000042063515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.852347e-7,0.00026391563,0.0005216578,0.0000015124641,0.000024107696,0.0000023648113,0.0017709935,0.9566311,0.0012757677,0.004664873,0.0000407101,0.034802012],"study_design_scores_gemma":[0.00024114762,0.0001758487,0.0040091486,0.00002088176,0.0000024763171,0.000018986315,0.0009045728,0.9943717,0.000049907623,0.00004107077,0.00008780283,0.00007644388],"about_ca_topic_score_codex":0.0013515824,"about_ca_topic_score_gemma":0.00023469319,"teacher_disagreement_score":0.5602867,"about_ca_system_score_codex":0.00025385027,"about_ca_system_score_gemma":0.00048892276,"threshold_uncertainty_score":0.51091605},"labels":[],"label_agreement":null},{"id":"W1995973195","doi":"10.1090/s0002-9939-03-07050-3","title":"Construction of best Bregman approximations in reflexive Banach spaces","year":2003,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Banach space; Bregman divergence; Countable set; Intersection (aeronautics); Reflexivity; Regular polygon; Uniformly convex space; Construct (python library); Projection (relational algebra); Pure mathematics; Space (punctuation); Point (geometry); Eberlein–Šmulian theorem; Applied mathematics; Computer science; Lp space; Sociology; Algorithm; Geometry; Geography","score_opus":0.013186265710581771,"score_gpt":0.2564702723575298,"score_spread":0.24328400664694802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1995973195","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43305176,0.000029192548,0.5238798,0.006416197,0.000055214943,0.00045594832,0.000005843321,0.0000698628,0.036036156],"genre_scores_gemma":[0.5253838,0.000011750699,0.4744424,0.000074214935,0.0000047489734,0.000007963782,1.9507922e-7,0.0000033881872,0.00007155416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991228,0.000014221466,0.00031223174,0.0001562949,0.00028010533,0.00011436243],"domain_scores_gemma":[0.9990825,0.00008579846,0.0004650101,0.00011467616,0.00021886236,0.0000331419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033220544,0.00007962195,0.00024165961,0.0000428813,0.00006277418,0.000033435335,0.00036849457,0.000024341289,0.000017815819],"category_scores_gemma":[0.00023084278,0.00005692997,0.00016586894,0.0013189476,0.00031872906,0.00021332875,0.00007955284,0.00008073255,0.0000027749284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011315232,0.00013083652,0.0036687935,0.000058226644,0.000032790613,8.987501e-9,0.0012188498,0.00012553601,0.0007789416,0.993568,0.00009356374,0.0003232961],"study_design_scores_gemma":[0.0004455684,0.000106693435,0.004381508,0.00014725747,0.00009102891,0.000014489134,0.007560224,0.27311456,0.010754833,0.7029464,0.00014369194,0.00029372802],"about_ca_topic_score_codex":0.000015215206,"about_ca_topic_score_gemma":4.6716352e-7,"teacher_disagreement_score":0.2906216,"about_ca_system_score_codex":0.000035834248,"about_ca_system_score_gemma":0.000033704357,"threshold_uncertainty_score":0.23215367},"labels":[],"label_agreement":null},{"id":"W1996145399","doi":"10.1016/s0362-546x(01)00130-4","title":"Convergence of approximants for demicontinuous pseudo-contractive maps in Hilbert spaces","year":2002,"lang":"en","type":"article","venue":"Nonlinear Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Convergence (economics); Mathematics; Hilbert space; Pure mathematics; Applied mathematics; Mathematical analysis; Economics","score_opus":0.01700689795710351,"score_gpt":0.2475920378782894,"score_spread":0.2305851399211859,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996145399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022974122,0.0001311325,0.9739194,0.001697142,0.00006324412,0.00018238268,0.000059115137,0.00003720049,0.0009362496],"genre_scores_gemma":[0.7984337,0.000078530604,0.19935764,0.00024753774,0.00004450597,0.000022717835,0.00004330531,0.000007211495,0.0017648027],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871486,0.00005877033,0.00041781287,0.0003668206,0.0002484617,0.0001932661],"domain_scores_gemma":[0.9988887,0.00019698298,0.000251049,0.00033152063,0.00027108987,0.000060704268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028347655,0.00012146286,0.00041178384,0.0005724335,0.00004950563,0.000047909383,0.0004396494,0.00006959563,0.00020399656],"category_scores_gemma":[0.00013567263,0.000113256334,0.00031227348,0.0024517637,0.000024048355,0.00031782608,0.00005225753,0.00007068294,0.000017817001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016811243,0.004163227,0.52454084,0.00017112524,0.010934782,0.000030218636,0.008328975,0.33573982,0.002871594,0.08158402,0.003353901,0.028113395],"study_design_scores_gemma":[0.00038093526,0.00002032679,0.0031576245,0.0000038945072,0.00025732347,6.045387e-7,0.00004088758,0.99446017,0.00057856156,0.00038687143,0.00058555097,0.0001272465],"about_ca_topic_score_codex":0.00015712545,"about_ca_topic_score_gemma":0.00025879935,"teacher_disagreement_score":0.77545965,"about_ca_system_score_codex":0.000030953983,"about_ca_system_score_gemma":0.00002025978,"threshold_uncertainty_score":0.4618459},"labels":[],"label_agreement":null},{"id":"W1996676734","doi":"10.1007/s10107-013-0633-4","title":"On solving simple bilevel programs with a nonconvex lower level program","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Mathematical optimization; Bilevel optimization; Limit point; Smoothing; Stationary point; Constraint (computer-aided design); Feasible region; Convex optimization; Sequence (biology); Limit (mathematics); Interior point method; Variational inequality; Optimization problem; Regular polygon; Bounded function; Simple (philosophy); Penalty method; Limit of a sequence","score_opus":0.03310765846871954,"score_gpt":0.26148453831081175,"score_spread":0.2283768798420922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996676734","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036449963,0.0000050940594,0.9892941,0.0015729897,0.000037928574,0.0013279594,6.809934e-7,0.00069373584,0.0034224854],"genre_scores_gemma":[0.40762717,3.37279e-7,0.5910476,0.00023086015,0.000031576143,0.0006431341,0.000009473716,0.000019830704,0.00039003094],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784106,0.000049261944,0.00040697452,0.0005136663,0.0006415988,0.00054741214],"domain_scores_gemma":[0.99859,0.00019688113,0.00015103362,0.0005431403,0.00027784103,0.00024109797],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00028513334,0.0002631092,0.00030214264,0.00013650807,0.00022079772,0.001041273,0.0005954218,0.00008565806,0.00036260107],"category_scores_gemma":[0.00013069944,0.00017848429,0.00013024856,0.00086096453,0.000084423846,0.0006002779,0.000162495,0.00018765671,0.00070850656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005617965,0.0015668026,0.00017559208,0.00007108576,0.00008406521,0.00001010861,0.00038262134,0.00020808242,0.000011009523,0.22458227,0.00021260949,0.7726901],"study_design_scores_gemma":[0.0005528395,0.0010182582,0.00043332423,0.0001413436,0.00004171127,0.000025902415,0.000092077724,0.87695247,0.000070977505,0.1176394,0.0024438703,0.0005878147],"about_ca_topic_score_codex":0.00002371658,"about_ca_topic_score_gemma":0.0000055364703,"teacher_disagreement_score":0.8767444,"about_ca_system_score_codex":0.000050880783,"about_ca_system_score_gemma":0.000058853675,"threshold_uncertainty_score":0.99999577},"labels":[],"label_agreement":null},{"id":"W1997539213","doi":"10.1007/s10957-006-9029-4","title":"Optimization Techniques for State-Constrained Control and Obstacle Problems","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Hamilton–Jacobi–Bellman equation; Minimax; Mathematical optimization; Reachability; Duality (order theory); Bellman equation; Mathematics; State (computer science); Variational inequality; Obstacle; Dynamic programming; Optimal control; Class (philosophy); Computer science; Law; Algorithm","score_opus":0.004767419257291239,"score_gpt":0.22288228959033604,"score_spread":0.2181148703330448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997539213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035964636,0.00023608572,0.9978185,0.0011063332,0.000019770147,0.00042942713,0.000015702297,0.00004743199,0.0002907591],"genre_scores_gemma":[0.118343055,0.00020370792,0.8806117,0.00030266386,0.000115459094,0.000114038616,0.00003076334,0.000012447046,0.0002661273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990372,0.0000894472,0.00047195924,0.00016813929,0.00012872588,0.00010455087],"domain_scores_gemma":[0.99846613,0.00030659855,0.000473954,0.00012389918,0.00056242966,0.00006698782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075884274,0.00010531512,0.00017682312,0.00020197449,0.00023544706,0.00019238614,0.00016730514,0.00005117183,0.0000141134815],"category_scores_gemma":[0.00005804148,0.00009258979,0.000056366665,0.00032998095,0.00006631997,0.00060424535,0.000021910198,0.000059730977,2.7092844e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015718631,0.000056056473,0.000043354758,0.000009602087,0.000026063433,1.1630309e-7,0.00003967537,0.73495865,0.00007069846,0.26052487,0.000044379856,0.0042107813],"study_design_scores_gemma":[0.0007997679,0.000074329706,0.00007849548,0.00001334716,0.000069493435,0.00003446565,0.000025168687,0.9345019,0.00020397591,0.06266241,0.0014052019,0.00013147097],"about_ca_topic_score_codex":0.0000016882794,"about_ca_topic_score_gemma":5.410595e-7,"teacher_disagreement_score":0.19954321,"about_ca_system_score_codex":0.000019051762,"about_ca_system_score_gemma":0.00005513498,"threshold_uncertainty_score":0.3775702},"labels":[],"label_agreement":null},{"id":"W1997852431","doi":"10.4153/cmb-2005-027-0","title":"Enlarged Inclusion of Subdifferentials","year":2005,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subderivative; Mathematics; Verifiable secret sharing; Inclusion (mineral); Lipschitz continuity; Pure mathematics; Domain (mathematical analysis); Mathematical analysis; Applied mathematics; Regular polygon; Geometry; Set (abstract data type); Convex optimization; Chemistry","score_opus":0.0077515912796213525,"score_gpt":0.2093240909267795,"score_spread":0.20157249964715815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997852431","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006467858,0.000044967335,0.92868054,0.043133594,0.000038299546,0.0001141391,0.000010144789,0.000045955905,0.021464486],"genre_scores_gemma":[0.9259413,0.0000033816978,0.071352266,0.0012290626,0.000035642308,0.000004214439,0.000007004402,0.0000047754984,0.0014223658],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991862,0.00004325377,0.00025462444,0.00014124202,0.00020890616,0.00016575123],"domain_scores_gemma":[0.9992708,0.00008425603,0.00006061926,0.00024366629,0.000090453505,0.00025019975],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00024955228,0.000071037386,0.00015237957,0.0001571461,0.00013075162,0.0000344774,0.0004061532,0.00004827623,0.014201452],"category_scores_gemma":[0.00016480769,0.00006225031,0.00006478013,0.00021694411,0.000021283404,0.000047907022,0.00016528828,0.000047908663,0.0022615872],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.570398e-7,0.00006569914,0.00003310163,0.000018460252,0.000020327307,0.00000229561,0.00057508564,0.00031840708,0.00015412553,0.9863866,0.007594048,0.004830905],"study_design_scores_gemma":[0.0008955514,0.000061389226,0.0013916643,0.00009338823,0.000061996536,0.000018086237,0.00003948436,0.54484165,0.0060831266,0.15180418,0.2940713,0.0006382073],"about_ca_topic_score_codex":0.00029660636,"about_ca_topic_score_gemma":0.0005039851,"teacher_disagreement_score":0.9194734,"about_ca_system_score_codex":0.00006300887,"about_ca_system_score_gemma":0.000103239574,"threshold_uncertainty_score":0.99851525},"labels":[],"label_agreement":null},{"id":"W1999366712","doi":"10.48550/arxiv.1207.4531","title":"Fixed point properties for semigroups of nonlinear mappings and amenability","year":2012,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Alberta","funders":"","keywords":"Mathematics; Semigroup; Pure mathematics; Regular polygon; Bicyclic semigroup; Fixed point; Banach space; Cancellative semigroup; Fixed-point theorem; Fixed-point property; Bounded function; Discrete mathematics; Mathematical analysis","score_opus":0.07588191026697999,"score_gpt":0.1810453869208517,"score_spread":0.10516347665387171,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1999366712","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102405764,0.000049786806,0.89654464,0.0003592348,0.000099126344,0.00026950202,0.000024117142,0.000055444463,0.00019240353],"genre_scores_gemma":[0.9732209,0.000048352515,0.025944991,0.00006680829,0.000036560927,0.0000016326164,0.000019045892,0.000005858046,0.00065586256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990436,0.000058258986,0.00018857696,0.0004957491,0.000060813752,0.00015303907],"domain_scores_gemma":[0.9988232,0.000067156754,0.0002343075,0.00047401962,0.00031483223,0.00008643443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028937752,0.00014905329,0.00026054177,0.0001377499,0.00007884518,0.000045510737,0.00048730744,0.00012324289,0.00001645259],"category_scores_gemma":[0.000058374062,0.0001455161,0.00014532241,0.00025796643,0.000077568664,0.0003029284,0.000758629,0.00012054365,0.00000327561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012258177,0.00054424943,0.018872157,0.0010526784,0.00055375416,0.0000041619205,0.0024385958,0.34948555,0.00048937503,0.62539274,0.0003067439,0.00073739345],"study_design_scores_gemma":[0.00026857207,0.000021961161,0.0015139492,0.000035886245,0.00008202324,5.5238763e-7,0.00006168296,0.9844257,0.0002846202,0.012846803,0.00026395253,0.00019426853],"about_ca_topic_score_codex":0.00009213569,"about_ca_topic_score_gemma":0.0000108136555,"teacher_disagreement_score":0.8708151,"about_ca_system_score_codex":0.000061621235,"about_ca_system_score_gemma":0.00008442377,"threshold_uncertainty_score":0.59339744},"labels":[],"label_agreement":null},{"id":"W2001792791","doi":"10.1006/jmaa.2000.7517","title":"Tangent Projection Equations and General Variational Inequalities","year":2001,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Variational inequality; Equivalence (formal languages); Tangent; Degenerate energy levels; Projection (relational algebra); Applied mathematics; Convergence (economics); Tangent cone; Class (philosophy); Projection method; Mathematical analysis; Pure mathematics; Mathematical optimization; Geometry; Dykstra's projection algorithm; Algorithm; Computer science","score_opus":0.025513493008604633,"score_gpt":0.28108171369613544,"score_spread":0.2555682206875308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2001792791","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002391617,0.000094108065,0.993377,0.0035173032,0.000009156479,0.00007565858,0.0000033095423,0.000013037203,0.0005188491],"genre_scores_gemma":[0.6241674,0.0004496427,0.37360445,0.00036754762,0.00027855262,0.000057390193,0.000017135975,0.0000068819363,0.001051031],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989051,0.000065270644,0.000506362,0.0001395772,0.00029919916,0.000084448635],"domain_scores_gemma":[0.99883837,0.0002710929,0.00031724497,0.00013870728,0.00033072958,0.00010384624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005796859,0.00008079915,0.00023475995,0.0004026974,0.00017462895,0.00017095952,0.00014745972,0.0000356263,0.00010505133],"category_scores_gemma":[0.00009265198,0.00006150387,0.00012556279,0.0012090532,0.000032965134,0.00032547596,0.000049787774,0.00007008199,0.0000050133513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000191294,0.00014519026,0.0010421507,0.00000801798,0.00042285508,5.9244366e-7,0.00022452157,0.0023314494,0.000058669204,0.9895234,0.000037417565,0.0062037976],"study_design_scores_gemma":[0.00018064443,0.000028259215,0.0066026235,0.0000055213727,0.0006490943,0.000043642518,0.000084537816,0.8417162,0.000016272237,0.14880908,0.0017590169,0.00010511259],"about_ca_topic_score_codex":0.000008438765,"about_ca_topic_score_gemma":0.0000059990093,"teacher_disagreement_score":0.84071434,"about_ca_system_score_codex":0.000021407544,"about_ca_system_score_gemma":0.000038617913,"threshold_uncertainty_score":0.25080553},"labels":[],"label_agreement":null},{"id":"W2002055553","doi":"10.1007/s10898-004-8318-4","title":"Optimality Conditions for D.C. Vector Optimization Problems Under Reverse Convex Constraints","year":2005,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Mathematical optimization; Regular polygon; Convex optimization; Geometry","score_opus":0.017203713330258077,"score_gpt":0.27941692351173286,"score_spread":0.2622132101814748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002055553","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000949565,0.00006688747,0.9864968,0.011674153,0.00037169893,0.0003123934,0.00006683251,0.000060328264,0.00085592724],"genre_scores_gemma":[0.18849382,0.00007922309,0.8097472,0.0012542868,0.00022810753,0.00001116406,0.0000794048,0.000010866965,0.00009591591],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798816,0.00011813467,0.00090533664,0.00027061522,0.00047386647,0.00024386264],"domain_scores_gemma":[0.9967311,0.000109911176,0.00097314426,0.0002381385,0.0017533523,0.00019436519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059430185,0.00019456404,0.00034121258,0.00015097931,0.00022656388,0.0002561419,0.0004765559,0.00013317086,0.00036246155],"category_scores_gemma":[0.00023886103,0.00018433125,0.00024792337,0.0008391667,0.00008777075,0.0018472087,0.000053265576,0.000109226996,0.000010347691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020406787,0.00016285162,0.000119577315,0.000009415449,0.00010180381,9.3549716e-7,0.000044296634,0.9118053,0.000015562091,0.085295886,0.0020626846,0.00036131055],"study_design_scores_gemma":[0.0014206494,0.000119971206,0.00040580338,0.000032263604,0.000101967016,0.000071091956,0.00003506188,0.99573886,0.000025689347,0.0010576678,0.0007926697,0.0001982826],"about_ca_topic_score_codex":0.0000045743873,"about_ca_topic_score_gemma":0.000004262524,"teacher_disagreement_score":0.18839885,"about_ca_system_score_codex":0.0004065582,"about_ca_system_score_gemma":0.00036596856,"threshold_uncertainty_score":0.75168097},"labels":[],"label_agreement":null},{"id":"W2002697501","doi":"10.5539/jmr.v2n1p8","title":"Equivalent Bilevel Programming Form for the Generalized Nash Equilibrium Problem","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Qufu Normal University","keywords":"Bilevel optimization; Nash equilibrium; Mathematics; Mathematical optimization; Decision maker; Mathematical economics; Solution concept; Optimization problem; Operations research","score_opus":0.130167867670998,"score_gpt":0.4046628710511655,"score_spread":0.2744950033801675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002697501","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041324035,0.0000583671,0.9834033,0.011390464,0.00021272773,0.00043533227,0.0000017848237,0.000014975801,0.00035063524],"genre_scores_gemma":[0.05975575,0.00003176338,0.9388052,0.00005414112,0.0002801172,0.000042389354,8.4520826e-7,0.000012387631,0.0010173596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776596,0.000066109285,0.00055391295,0.00012110763,0.0011763844,0.00031650855],"domain_scores_gemma":[0.9962842,0.0011671426,0.00032549602,0.00035937174,0.0017459563,0.000117841846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006216087,0.0000842749,0.00018931378,0.00028230983,0.00024763873,0.0005116546,0.0013670927,0.0000552528,0.00006186287],"category_scores_gemma":[0.00074055727,0.00004733538,0.00019773113,0.00057866296,0.00006311788,0.00038175512,0.0002650915,0.00040156435,0.000010434003],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026921409,0.0008539375,0.0000939858,0.00027484007,0.0003483389,0.000006971452,0.003542948,0.0025263068,0.016007092,0.92521733,0.0081503745,0.04295097],"study_design_scores_gemma":[0.0006974915,0.00018202703,0.00005967232,0.000039075752,0.000029864876,0.00007540556,0.00015916741,0.8563195,0.0014571126,0.12140016,0.019473037,0.000107512606],"about_ca_topic_score_codex":0.000005097582,"about_ca_topic_score_gemma":0.000008528493,"teacher_disagreement_score":0.85379314,"about_ca_system_score_codex":0.000038469032,"about_ca_system_score_gemma":0.00027829703,"threshold_uncertainty_score":0.4933897},"labels":[],"label_agreement":null},{"id":"W2005918757","doi":"10.5539/mas.v1n3p19","title":"Strong Cconvergence Theorems for Strictly Pseudocontractive Mappings by Viscosity Approximation Methods","year":2007,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Hilbert space; Applied mathematics; Viscosity; Mathematics; Iterative and incremental development; Computer science; Pure mathematics; Thermodynamics; Physics; Economics","score_opus":0.01620582314461294,"score_gpt":0.31645457942227667,"score_spread":0.30024875627766373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2005918757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006731879,0.000017153525,0.99195343,0.00033648007,0.0001420901,0.00046988417,0.000006946475,0.00012241754,0.006278423],"genre_scores_gemma":[0.55006075,0.0000020340187,0.44950783,0.00027009042,0.000022107273,0.00003452814,0.0000059093536,0.000004599887,0.000092154616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977775,0.000033111963,0.00034077727,0.0007516962,0.0006146551,0.0004822167],"domain_scores_gemma":[0.9985344,0.00029473778,0.0002555564,0.00042043897,0.00032088798,0.00017400025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036789745,0.00016563649,0.00018637929,0.00025679308,0.0006159413,0.0003319449,0.0012479518,0.00006125157,0.000013522828],"category_scores_gemma":[0.00011979524,0.00015280691,0.00007020587,0.0015302915,0.00019568937,0.0011072928,0.0001836164,0.00011275298,0.000011371948],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017668937,0.000092737384,0.000039609884,0.0000059449444,0.000015043792,1.7254261e-7,0.00093840214,0.003643014,0.26414928,0.6788295,0.00009437104,0.052174263],"study_design_scores_gemma":[0.00024659088,0.000016373351,0.00049971975,0.000001977734,0.000009116089,9.813193e-7,0.000067499954,0.9051224,0.053101413,0.040523592,0.00022461904,0.000185698],"about_ca_topic_score_codex":0.000018526202,"about_ca_topic_score_gemma":0.0000029620064,"teacher_disagreement_score":0.9014794,"about_ca_system_score_codex":0.00016328103,"about_ca_system_score_gemma":0.0001533146,"threshold_uncertainty_score":0.6231285},"labels":[],"label_agreement":null},{"id":"W2006024172","doi":"10.1051/cocv/2015023","title":"On the convexity of piecewise-defined functions","year":2015,"lang":"en","type":"preprint","venue":"ESAIM Control Optimisation and Calculus of Variations","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convexity; Piecewise; Regular polygon; Property (philosophy); Mathematics; Function (biology); Convex function; Verifiable secret sharing; Mathematical optimization; Convex optimization; Applied mathematics; Pure mathematics; Computer science; Mathematical analysis; Geometry; Economics","score_opus":0.02252944214491302,"score_gpt":0.24102018435403946,"score_spread":0.21849074220912645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006024172","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006159909,0.00010420809,0.9781928,0.016192133,0.00036825225,0.0004696904,0.0001977068,0.00007008199,0.0037891127],"genre_scores_gemma":[0.98687565,0.000040899584,0.011576271,0.0007077331,0.0000601855,0.00009387126,0.00011758497,0.000012308067,0.0005155096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978354,0.0003119747,0.000722431,0.0004112268,0.0005631264,0.00015583332],"domain_scores_gemma":[0.99625653,0.00080438564,0.0008288004,0.0007753726,0.0012138276,0.00012106891],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008537808,0.0002359128,0.00046689954,0.0002890679,0.00023393922,0.00012463494,0.0005422508,0.00021044818,0.00017322047],"category_scores_gemma":[0.00087225006,0.00018251929,0.00022385588,0.00047383117,0.00011095652,0.00017720685,0.00024569486,0.0002897171,0.000015460639],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020394426,0.00016181184,0.0000365941,0.000016779039,0.00024002767,1.6163318e-7,0.0005166283,0.20458607,0.000041738393,0.79222524,0.0015097499,0.00064478564],"study_design_scores_gemma":[0.00092165306,0.000072884795,0.0014315053,0.00002938007,0.00019495963,9.353756e-7,0.000050474795,0.9767699,0.00002622867,0.019998975,0.00033042085,0.00017267466],"about_ca_topic_score_codex":0.00018064743,"about_ca_topic_score_gemma":0.000019640072,"teacher_disagreement_score":0.98625964,"about_ca_system_score_codex":0.00006722024,"about_ca_system_score_gemma":0.00046897345,"threshold_uncertainty_score":0.7442921},"labels":[],"label_agreement":null},{"id":"W2007103412","doi":"10.1007/s10589-005-4612-4","title":"A Trust-Region Method for Nonlinear Bilevel Programming: Algorithm and Computational Experience","year":2005,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":160,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Bilevel optimization; Mathematics; Trust region; Quadratic equation; Nonlinear system; Constraint (computer-aided design); Mathematical optimization; Sequential quadratic programming; Nonlinear programming; Algorithm; Type (biology); Software; Quadratic programming; Applied mathematics; Computer science; Optimization problem; Geometry","score_opus":0.022696821766594384,"score_gpt":0.31365902099926707,"score_spread":0.2909621992326727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007103412","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015823181,0.00010946057,0.99362475,0.005200491,0.000026329137,0.0007257902,0.00003796552,0.00016838143,0.00009103909],"genre_scores_gemma":[0.003621142,0.000037448997,0.99361044,0.0012399263,0.0001532163,0.00063517026,0.00047964617,0.000015886772,0.00020714261],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848706,0.000047711972,0.00042605572,0.00057880266,0.00027002554,0.00019032141],"domain_scores_gemma":[0.99852943,0.00034380017,0.00020400608,0.00017528045,0.0005757013,0.0001717847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018830234,0.00019080768,0.000193475,0.00023227329,0.00054931204,0.00032307472,0.00024410305,0.00007802529,0.000017357894],"category_scores_gemma":[0.000034337263,0.00019612788,0.00006510773,0.0006579894,0.00008405258,0.0006057269,0.000101020836,0.000071904746,0.0000058100386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002282665,0.00008646874,0.000039722698,0.000006688962,0.000018550603,1.0500785e-7,0.00021417263,0.7109828,6.4903634e-7,0.10649911,0.00009124312,0.18205822],"study_design_scores_gemma":[0.0006589281,0.000028047707,0.00027132803,0.000005504466,0.000021743304,0.000032492957,0.000040983618,0.96478087,0.000006624455,0.009333102,0.024597123,0.00022326793],"about_ca_topic_score_codex":0.0000039140523,"about_ca_topic_score_gemma":8.2486196e-7,"teacher_disagreement_score":0.25379807,"about_ca_system_score_codex":0.000041465082,"about_ca_system_score_gemma":0.000101578386,"threshold_uncertainty_score":0.79978627},"labels":[],"label_agreement":null},{"id":"W2007277085","doi":"10.1007/s10107-007-0124-6","title":"Computing proximal points of nonconvex functions","year":2007,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":108,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Subgradient method; Proximal Gradient Methods; Bounded function; Lipschitz continuity; Mathematical optimization; Regular polygon; Function (biology); Convex optimization; Applied mathematics; Mathematical analysis; Geometry","score_opus":0.01754484837312971,"score_gpt":0.2718162145073227,"score_spread":0.254271366134193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007277085","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002055959,0.000008896502,0.9910071,0.00043914438,0.000048642803,0.0001253868,2.8289438e-7,0.00011856694,0.0061960462],"genre_scores_gemma":[0.47763425,9.451436e-8,0.5221674,0.00004836121,0.000025009273,0.000001730083,0.0000016400579,0.0000036134588,0.000117895754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890095,0.000022202441,0.00039865705,0.00017804331,0.00028923622,0.00021089516],"domain_scores_gemma":[0.9992036,0.00022376871,0.00013234392,0.00021054619,0.00014604825,0.00008368861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008525369,0.00008059157,0.00016037414,0.0001166377,0.000098391,0.00006831909,0.00026103292,0.000040254,0.00006631128],"category_scores_gemma":[0.00017313786,0.00006856425,0.00009043305,0.0006013745,0.000040415685,0.00017099196,0.00011901076,0.000077182274,0.000072217226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004280042,0.00043348852,0.0008444047,0.00009495413,0.00006885516,0.0000047347307,0.0009732347,0.00024507171,0.00013077751,0.8349398,0.000057774476,0.16220267],"study_design_scores_gemma":[0.00042626754,0.00010085513,0.0017551013,0.00006881882,0.0000494601,0.000024617531,0.00023523178,0.96551734,0.0009854437,0.029131014,0.0014489195,0.00025691165],"about_ca_topic_score_codex":0.0000026862656,"about_ca_topic_score_gemma":0.000001533628,"teacher_disagreement_score":0.9652723,"about_ca_system_score_codex":0.000019967894,"about_ca_system_score_gemma":0.000023462962,"threshold_uncertainty_score":0.2795969},"labels":[],"label_agreement":null},{"id":"W2007576447","doi":"10.1007/s10898-005-3835-3","title":"Variational Methods in Convex Analysis","year":2006,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Subderivative; Mathematics; Convex analysis; Proper convex function; Parallels; Variational analysis; Regular polygon; Convex set; Convex conjugate; Convex combination; Convex optimization; Mathematical optimization; Applied mathematics; Geometry","score_opus":0.008219625034438783,"score_gpt":0.30675417566594093,"score_spread":0.29853455063150214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007576447","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018350492,0.00008632988,0.99541456,0.0018116897,0.00017398849,0.00003841377,0.0000033910496,0.000016004089,0.0022721062],"genre_scores_gemma":[0.10924281,0.000015890622,0.8904071,0.00019295624,0.000066817265,9.629186e-7,0.000015616699,0.000002594706,0.00005526736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998287,0.00023715217,0.0007653728,0.00015986175,0.00042013856,0.00013048158],"domain_scores_gemma":[0.99841905,0.00009877286,0.00064419094,0.00015003659,0.00063030765,0.00005764115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008868584,0.000100770354,0.00030140116,0.00044659682,0.000050229755,0.00014955235,0.0003791091,0.000070038666,0.00013087822],"category_scores_gemma":[0.00009789326,0.000091504044,0.00021914943,0.00437513,0.0000140681595,0.0008344694,0.000044066976,0.00007968814,0.0000032079847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065696663,0.00009016,0.020280765,8.72846e-7,0.00012071564,0.0000040726372,0.000012607362,0.865949,0.0000053111094,0.112869024,0.00017593423,0.00048499383],"study_design_scores_gemma":[0.00042314295,0.000020725689,0.05356712,0.000003402035,0.00013542554,0.000018379205,0.0000051874517,0.9400091,0.00000918395,0.005566478,0.0001542706,0.00008756365],"about_ca_topic_score_codex":0.0000691993,"about_ca_topic_score_gemma":0.000026936765,"teacher_disagreement_score":0.10905931,"about_ca_system_score_codex":0.00024033696,"about_ca_system_score_gemma":0.0001607337,"threshold_uncertainty_score":0.37314266},"labels":[],"label_agreement":null},{"id":"W2008180924","doi":"10.1155/2012/508570","title":"Nonpivot and Implicit Projected Dynamical Systems on Hilbert Spaces","year":2012,"lang":"en","type":"article","venue":"Journal of Function Spaces and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Generalization; Hilbert space; Mathematics; Variational inequality; Pure mathematics; Relation (database); Dynamical systems theory; Hilbert manifold; Rigged Hilbert space; Space (punctuation); Topological space; Reproducing kernel Hilbert space; Mathematical analysis; Computer science","score_opus":0.011599830902415457,"score_gpt":0.24722690452492185,"score_spread":0.2356270736225064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008180924","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020030743,0.0005974564,0.973862,0.004137441,0.00017808845,0.00016756367,0.0000034780608,0.000027025768,0.0009962294],"genre_scores_gemma":[0.99370426,0.0002016439,0.0050734794,0.00020304805,0.0003480103,0.00002230698,0.000003112626,0.0000050055096,0.00043910943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99929786,0.00003571345,0.00023827254,0.00011784635,0.00019992697,0.00011038334],"domain_scores_gemma":[0.9991844,0.000093656985,0.00027591627,0.00012100409,0.00018589133,0.00013910132],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023762656,0.00008245809,0.0001432175,0.00017217983,0.00016254532,0.0002254771,0.000101516474,0.000044735214,0.000008814481],"category_scores_gemma":[0.000015575984,0.00006098272,0.00004184473,0.0003589541,0.000022256778,0.0004542376,0.000032944306,0.0000969061,0.0000071622844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045477336,0.00039832655,0.018493703,0.00003694943,0.00021237653,4.66769e-7,0.00046121838,0.0038961498,0.000954539,0.9580054,0.0028325163,0.014662833],"study_design_scores_gemma":[0.0018955112,0.00084271346,0.23791304,0.00009827771,0.00041066715,0.00050954754,0.0012814425,0.34436375,0.00014296857,0.0033113242,0.40851766,0.00071312103],"about_ca_topic_score_codex":0.000018307835,"about_ca_topic_score_gemma":0.0000026998287,"teacher_disagreement_score":0.9736735,"about_ca_system_score_codex":0.000023026341,"about_ca_system_score_gemma":0.00002428743,"threshold_uncertainty_score":0.24868031},"labels":[],"label_agreement":null},{"id":"W2008308027","doi":"10.5539/mas.v1n3p24","title":"A General Projection Method for the System of Relaxed Cocoercive Variational Inequalities in Hilbert Spaces","year":2007,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hilbert space; Convergence (economics); Projection (relational algebra); Variational inequality; Nonlinear system; Applied mathematics; Mathematics; Projection method; Mathematical optimization; Mathematical analysis; Algorithm; Dykstra's projection algorithm; Physics; Economics","score_opus":0.0279602727585332,"score_gpt":0.2946099063619948,"score_spread":0.2666496336034616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008308027","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089051126,0.000011443138,0.9962918,0.0006919462,0.000116127754,0.00037974212,0.0000036026238,0.000036551137,0.0015782329],"genre_scores_gemma":[0.60974365,9.082667e-7,0.38992664,0.00010856915,0.000031423304,0.0000562539,0.000001963115,0.000002635322,0.00012792494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998529,0.00004133602,0.00033268752,0.0003370638,0.00054687087,0.00021305376],"domain_scores_gemma":[0.99873585,0.0005306373,0.00019528548,0.0002445936,0.0002557149,0.00003791441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045703123,0.00008458494,0.00013980163,0.00030508556,0.00027789944,0.000114050265,0.0006233194,0.000037087713,0.0000024157528],"category_scores_gemma":[0.0000956226,0.0000611882,0.000043124448,0.0014606674,0.00008638565,0.00029758282,0.00010316927,0.000058268968,0.0000014783608],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017280863,0.000027206912,0.00013671166,0.000011913765,0.00000832194,1.1191009e-7,0.0026774115,0.06148315,0.010027591,0.92270625,0.000011559135,0.0028924798],"study_design_scores_gemma":[0.00023511474,0.000011892104,0.0036467046,0.0000056251574,0.0000071797226,0.0000017513414,0.00029191232,0.9865438,0.0018792409,0.0072389147,0.000061187624,0.00007668568],"about_ca_topic_score_codex":0.00024282471,"about_ca_topic_score_gemma":0.00010013437,"teacher_disagreement_score":0.92506063,"about_ca_system_score_codex":0.00014096899,"about_ca_system_score_gemma":0.00022775192,"threshold_uncertainty_score":0.24951823},"labels":[],"label_agreement":null},{"id":"W2009870300","doi":"10.1016/s0893-9659(00)00112-9","title":"A predictor-corrector algorithm for general variational inequalities","year":2001,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Predictor–corrector method; Monotonic function; Variational inequality; Convergence (economics); Operator (biology); Algorithm; Applied mathematics; Coercivity; Inequality; Mathematical analysis","score_opus":0.017368728908267766,"score_gpt":0.23305021100002257,"score_spread":0.2156814820917548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009870300","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000875059,0.0000039978177,0.9946781,0.0026904915,0.00017076742,0.00024287107,0.00001731309,0.00015056228,0.0011708483],"genre_scores_gemma":[0.0024923722,0.000004176353,0.9928279,0.0035566366,0.00028514265,0.00018231857,0.000068650166,0.000014203599,0.0005686323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988842,0.00001440155,0.0003190931,0.0002505376,0.00032316227,0.00020858171],"domain_scores_gemma":[0.99914163,0.00029304493,0.00014865809,0.00027010287,0.00008267768,0.00006389239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032219294,0.00013820287,0.00018083456,0.00012739169,0.00013078233,0.00015114193,0.000388672,0.00004355892,0.00007355242],"category_scores_gemma":[0.000032967375,0.00012849618,0.000089264926,0.00030302437,0.000019302868,0.00017818892,0.00006680777,0.000051330768,0.000038189093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002001284,0.00009790392,0.000015521091,0.000017360187,0.000085585365,9.688279e-7,0.00088585523,0.0039030681,0.0009489191,0.98453796,0.005305059,0.004199828],"study_design_scores_gemma":[0.00038668778,0.000008473718,0.00009356627,0.000004145036,0.00002338548,0.000005536084,0.000026747888,0.96285397,0.000099423974,0.033664934,0.0026634363,0.00016972354],"about_ca_topic_score_codex":0.000006568135,"about_ca_topic_score_gemma":0.0000010252829,"teacher_disagreement_score":0.9589509,"about_ca_system_score_codex":0.000047735506,"about_ca_system_score_gemma":0.00003679761,"threshold_uncertainty_score":0.5239922},"labels":[],"label_agreement":null},{"id":"W2010612323","doi":"10.1006/jath.2002.3728","title":"A Chebyshev Set and its Distance Function","year":2002,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Subderivative; Banach space; Differentiable function; Convex function; Norm (philosophy); Regular polygon; Convex set; Uniformly convex space; Mathematical analysis; Combinatorics; Pure mathematics; Lp space; Geometry; Banach manifold; Convex optimization; Law","score_opus":0.0165906134752839,"score_gpt":0.21487005064422302,"score_spread":0.19827943716893912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2010612323","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027565968,0.00049438165,0.9934984,0.0015366719,0.00011382932,0.00003591318,8.880291e-7,0.000016583072,0.0015467678],"genre_scores_gemma":[0.97987443,0.00011768264,0.018782502,0.0004027704,0.00008295532,0.0000015053671,0.0000011176267,0.000003739215,0.0007333019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992633,0.00009569193,0.0002664529,0.000086329695,0.00022417928,0.0000640561],"domain_scores_gemma":[0.9992298,0.000077022996,0.00032103056,0.00008827716,0.00022981674,0.000054037006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006041901,0.000058110767,0.000103352526,0.00013718198,0.000074860676,0.000092724804,0.00015881141,0.000028718392,0.00016671365],"category_scores_gemma":[0.00010293666,0.000046572728,0.000050197872,0.00028811517,0.000011344249,0.00087425,0.000024311328,0.00007664877,0.000019356043],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016794576,0.000052871736,0.00005105374,0.0000121475305,0.00004433207,0.0000014648975,0.00090535084,0.0019014557,0.00017613474,0.9853869,0.000709389,0.010742088],"study_design_scores_gemma":[0.00042897539,0.00007212304,0.0009189562,0.00001719395,0.000031968968,0.00004829778,0.00007813887,0.90081066,0.00023012,0.09480648,0.0024626593,0.00009446065],"about_ca_topic_score_codex":9.860537e-8,"about_ca_topic_score_gemma":1.13096796e-7,"teacher_disagreement_score":0.97711784,"about_ca_system_score_codex":0.00002181199,"about_ca_system_score_gemma":0.000010076212,"threshold_uncertainty_score":0.18991807},"labels":[],"label_agreement":null},{"id":"W2011866660","doi":"10.1007/s10107-009-0319-0","title":"Autoconjugate representers for linear monotone operators","year":2009,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Monotone polygon; Operator theory; Pseudo-monotone operator; Operator (biology); Subderivative; Pure mathematics; Linear operators; Representation (politics); Algebra over a field; Nonlinear system; Real line; Identity (music); Applied mathematics; Discrete mathematics; Finite-rank operator; Mathematical analysis; Regular polygon; Banach space; Convex optimization","score_opus":0.022907714099575118,"score_gpt":0.2994112209320299,"score_spread":0.2765035068324548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2011866660","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031963462,0.000008702901,0.99314135,0.0048146457,0.000030277879,0.00043752947,5.911884e-7,0.00021223021,0.001035041],"genre_scores_gemma":[0.15215792,9.78412e-7,0.8466295,0.0006000197,0.00005075582,0.00007926712,0.000005278,0.000006075928,0.00047019403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990416,0.000022166494,0.0002772685,0.0002619705,0.00018359881,0.00021336251],"domain_scores_gemma":[0.99936324,0.000090222566,0.00006114447,0.0002896993,0.00009734502,0.00009834134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003026967,0.00009858107,0.00016584268,0.00006894375,0.00012532063,0.00020852392,0.00034220418,0.000039596565,0.00002532796],"category_scores_gemma":[0.00019165996,0.00008033653,0.00011682684,0.00030438183,0.000016845026,0.00026602618,0.00004824641,0.000053061245,0.000050002276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005407208,0.00023991437,0.000018307475,0.000024298171,0.00003406232,0.0000024600001,0.00040633942,0.0016454821,0.00010272439,0.9177006,0.00020756884,0.07961282],"study_design_scores_gemma":[0.0002564667,0.00007754623,0.000030533483,0.000014408855,0.0000138778405,0.000003051227,0.000016248958,0.9439304,0.0003329575,0.051545747,0.0036576176,0.00012115402],"about_ca_topic_score_codex":0.0000010995063,"about_ca_topic_score_gemma":1.5565567e-7,"teacher_disagreement_score":0.9422849,"about_ca_system_score_codex":0.000018137254,"about_ca_system_score_gemma":0.000018133775,"threshold_uncertainty_score":0.32760286},"labels":[],"label_agreement":null},{"id":"W2013268819","doi":"10.1016/j.jmaa.2010.03.041","title":"On Chebyshev functions and Klee functions","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Chebyshev filter; Function (biology); Bounded function; Regular polygon; Lipschitz continuity; Convex function; Combinatorics; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.007966606054667107,"score_gpt":0.2388464646854859,"score_spread":0.23087985863081878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013268819","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009632873,0.000021800328,0.98398,0.0038869814,0.000023479659,0.00005788478,0.000004787592,0.000016350547,0.0023758342],"genre_scores_gemma":[0.9340657,0.00004154354,0.06405244,0.00027346192,0.00013325248,0.00002607822,0.0000056908275,0.000005545769,0.0013963027],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990699,0.000023615583,0.00040819793,0.00016750128,0.00024228281,0.000088444176],"domain_scores_gemma":[0.9987727,0.00030593888,0.00024221116,0.00026062742,0.00024822605,0.00017032558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036291717,0.00009038013,0.0002493131,0.00040972518,0.0002380202,0.00016852528,0.00019299902,0.00005025237,0.000260878],"category_scores_gemma":[0.00009487339,0.000064918735,0.00017743887,0.0011610308,0.0000571419,0.00020354705,0.000049626604,0.0002081083,0.000036528305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028027143,0.00033526326,0.00052955584,0.000008527899,0.0005944172,6.020323e-7,0.000074846,0.0010017257,0.0004749225,0.9867319,0.0004661879,0.009779287],"study_design_scores_gemma":[0.00087427924,0.00020981797,0.021654448,0.000021486178,0.0041074115,0.00017221978,0.0002752222,0.4608512,0.00021298288,0.49290252,0.018200746,0.0005176841],"about_ca_topic_score_codex":0.0000017675642,"about_ca_topic_score_gemma":0.000007810078,"teacher_disagreement_score":0.9244328,"about_ca_system_score_codex":0.0000072533708,"about_ca_system_score_gemma":0.000025881485,"threshold_uncertainty_score":0.2856431},"labels":[],"label_agreement":null},{"id":"W2016019828","doi":"10.1007/s101070100278","title":"On error bounds for lower semicontinuous functions","year":2002,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Banach space; Subderivative; Function (biology); Upper and lower bounds; Space (punctuation); Regular polygon; Normed vector space; Metric space; Pure mathematics; Convex function; Discrete mathematics; Mathematical analysis; Applied mathematics; Convex optimization; Geometry","score_opus":0.03133459075991703,"score_gpt":0.2601535055372161,"score_spread":0.2288189147772991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016019828","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031096675,0.000013066734,0.9897662,0.0020235318,0.000113687456,0.00021821783,0.0000014528293,0.0001997707,0.007353133],"genre_scores_gemma":[0.39654163,8.86072e-7,0.5901344,0.00071793515,0.000103322396,0.00019933807,0.0000075441258,0.00001740428,0.012277548],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911445,0.000016811953,0.00021724285,0.00023580312,0.0002023097,0.00021338367],"domain_scores_gemma":[0.99926764,0.00024244249,0.00005958642,0.00026321367,0.00008654607,0.00008056696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017556804,0.000098131284,0.000137634,0.00008012187,0.00019386329,0.00025473032,0.00024179363,0.000045496898,0.00040200632],"category_scores_gemma":[0.00023926226,0.00008072194,0.00013288815,0.0003162779,0.000022509943,0.00016828587,0.000042364292,0.00006471978,0.0004295624],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000035609166,0.00062919024,0.000007163751,0.00003124895,0.000047587648,0.0000019754273,0.0003979665,0.00056293054,0.000014019918,0.9212629,0.005222405,0.07181905],"study_design_scores_gemma":[0.00025082612,0.00012456927,0.000005229213,0.000017549872,0.000023638158,0.00000510567,0.00002254913,0.93292636,0.000013079974,0.045248564,0.021220783,0.00014173027],"about_ca_topic_score_codex":5.0709826e-7,"about_ca_topic_score_gemma":5.428962e-7,"teacher_disagreement_score":0.93236345,"about_ca_system_score_codex":0.000025929721,"about_ca_system_score_gemma":0.0000063894386,"threshold_uncertainty_score":0.5521299},"labels":[],"label_agreement":null},{"id":"W2016200490","doi":"10.1080/00036811.2014.930821","title":"Metric regularity of a positive order for generalized equations","year":2014,"lang":"en","type":"article","venue":"Applicable Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Windsor","keywords":"Mathematics; Metric (unit); Verifiable secret sharing; Regular polygon; Order (exchange); Applied mathematics; Mathematical analysis; Pure mathematics; Computer science; Set (abstract data type); Geometry","score_opus":0.011610759859799931,"score_gpt":0.25757018991662656,"score_spread":0.24595943005682663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016200490","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003918416,0.000022705333,0.99715424,0.00111478,0.000010244468,0.00013772778,0.000014174856,0.00003677635,0.0011175307],"genre_scores_gemma":[0.54572004,0.00000680164,0.452958,0.0003486674,0.000024267054,0.00007726998,0.0001119748,0.000004464596,0.0007485458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998912,0.000073575,0.0003035515,0.00032075457,0.00024851604,0.00014162302],"domain_scores_gemma":[0.9982499,0.00037978648,0.0001997998,0.00047821098,0.00063068344,0.000061606865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048211616,0.000090570116,0.00033235012,0.0006307749,0.00013535267,0.00006186424,0.00039502542,0.000048610465,0.000083495484],"category_scores_gemma":[0.00020012271,0.000083051855,0.00031215718,0.0076765763,0.000019475763,0.00016633178,0.00007020504,0.0000308091,0.000009778761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003784808,0.00009563298,0.00048693648,0.000005594434,0.0011010673,3.7780023e-8,0.000051792325,0.176612,0.00022077284,0.81854033,0.00018603545,0.0026960077],"study_design_scores_gemma":[0.00026902958,0.000019651272,0.0011421653,7.7114885e-7,0.0011245575,8.451873e-8,0.0000044700296,0.98289233,0.0007604214,0.012839128,0.00084881135,0.00009860402],"about_ca_topic_score_codex":0.0003284791,"about_ca_topic_score_gemma":0.000052976295,"teacher_disagreement_score":0.8062803,"about_ca_system_score_codex":0.000022604941,"about_ca_system_score_gemma":0.000034342305,"threshold_uncertainty_score":0.36883405},"labels":[],"label_agreement":null},{"id":"W2016711560","doi":"10.1007/s10957-005-6547-4","title":"Separable Augmented Lagrangian Algorithm with Multidimensional Scaling for Monotropic Programming","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Augmented Lagrangian method; Scaling; Mathematics; Separable space; Convergence (economics); Theory of computation; Mathematical optimization; Class (philosophy); Lagrangian; Regular polygon; Flow (mathematics); Applied mathematics; Lagrangian relaxation; Algorithm; Computer science; Mathematical analysis; Artificial intelligence; Geometry","score_opus":0.005935164888217662,"score_gpt":0.24406989569141335,"score_spread":0.2381347308031957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016711560","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013100903,0.00018514837,0.9982379,0.0010890883,0.000019503173,0.00024574078,0.00000378681,0.000026848002,0.000060987273],"genre_scores_gemma":[0.012241962,0.00007892178,0.9870348,0.00016522766,0.000135923,0.00005397145,0.000016859007,0.000007784485,0.0002645298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919915,0.00005463503,0.00033028913,0.00014656658,0.00016118064,0.00010819698],"domain_scores_gemma":[0.99880874,0.00014221332,0.00034189166,0.00011756658,0.0005006004,0.00008896641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047306693,0.00008870928,0.00013298963,0.00015061046,0.00027274457,0.00008294569,0.0001586801,0.000035416426,0.00002493426],"category_scores_gemma":[0.000024143035,0.00006926038,0.00006067919,0.0003853581,0.000026125017,0.0005384786,0.000021886402,0.00006321,0.0000014145854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024320481,0.00010879281,0.00002770527,0.0000049457612,0.000061466315,1.8999417e-7,0.00010841133,0.81333005,0.000024468343,0.1100016,0.000035327368,0.0762727],"study_design_scores_gemma":[0.00073767814,0.00005723916,0.000052426672,0.000013604961,0.00006457828,0.000030856376,0.000063482235,0.9859514,0.00018466993,0.0023169562,0.010423261,0.00010381837],"about_ca_topic_score_codex":3.700103e-7,"about_ca_topic_score_gemma":3.725757e-7,"teacher_disagreement_score":0.17262137,"about_ca_system_score_codex":0.000026696878,"about_ca_system_score_gemma":0.00005005788,"threshold_uncertainty_score":0.28243563},"labels":[],"label_agreement":null},{"id":"W2017658009","doi":"10.4153/cmb-2011-071-9","title":"Browder's Convergence for One-Parameter Nonexpansive Semigroups","year":2011,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Convergence (economics); Pure mathematics; Discrete mathematics; Topology (electrical circuits); Combinatorics","score_opus":0.04350702816519886,"score_gpt":0.2166739360407616,"score_spread":0.17316690787556274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017658009","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008146139,0.000013176958,0.9806327,0.0055275983,0.00008220459,0.00024778626,0.000015320493,0.000056682577,0.012609879],"genre_scores_gemma":[0.41287953,0.0000049336477,0.5763808,0.006153735,0.00006168001,0.00012591976,0.00001536393,0.0000204586,0.0043576197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998939,0.000031305335,0.0002546392,0.00029424214,0.00015673217,0.0003241226],"domain_scores_gemma":[0.99872285,0.00022306695,0.00006211866,0.00035059935,0.00019247629,0.00044890025],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00019896755,0.000120559765,0.00018661958,0.00013457627,0.00012350101,0.00007850774,0.00052971067,0.000077375706,0.011065538],"category_scores_gemma":[0.00035276677,0.00011672178,0.00010839499,0.0002218562,0.000043771775,0.00008658882,0.000039579812,0.00006785171,0.004469406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031352633,0.00006037636,0.000060777005,0.00003120933,0.000057297002,0.0000061105707,0.0009324062,0.000030139887,0.000014627624,0.9853267,0.012991648,0.00048557887],"study_design_scores_gemma":[0.0009732062,0.0002073109,0.0013392738,0.000102624566,0.00014343084,0.000035528752,0.00021188696,0.4172237,0.0014071522,0.49708793,0.08008197,0.0011859845],"about_ca_topic_score_codex":0.0007609808,"about_ca_topic_score_gemma":0.00043497418,"teacher_disagreement_score":0.48823875,"about_ca_system_score_codex":0.00006424912,"about_ca_system_score_gemma":0.00014981064,"threshold_uncertainty_score":0.9963057},"labels":[],"label_agreement":null},{"id":"W2018584428","doi":"10.1016/j.jmaa.2005.08.011","title":"A hybrid inexact Logarithmic–Quadratic Proximal method for nonlinear complementarity problems","year":2005,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Logarithm; Quadratic equation; Nonlinear complementarity problem; Nonlinear system; Applied mathematics; Complementarity theory; Variational inequality; Mixed complementarity problem; Convergence (economics); Complementarity (molecular biology); Regular polygon; Rate of convergence; Mathematical analysis; Mathematical optimization; Computer science; Geometry","score_opus":0.02312280543948074,"score_gpt":0.3147972115578671,"score_spread":0.29167440611838635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018584428","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030217035,0.000043335447,0.9917022,0.0075191814,0.000004689266,0.000260611,0.00002089598,0.000014433864,0.00013247566],"genre_scores_gemma":[0.039596193,0.000020092926,0.9597046,0.0003421191,0.00013849394,0.00006177802,0.000019599578,0.0000049210585,0.00011223941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985454,0.000053772645,0.00077413354,0.00019719676,0.00029153615,0.00013795393],"domain_scores_gemma":[0.99839205,0.0003443077,0.00048142578,0.00022388062,0.00042151118,0.00013683201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092655176,0.00011437622,0.00043062982,0.0003076673,0.00016921044,0.00017059725,0.0003627245,0.000027739388,0.0001060882],"category_scores_gemma":[0.00006042294,0.00008393102,0.0003240695,0.00070366863,0.00002752496,0.00030060022,0.00006738093,0.00010207846,0.0000072473395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015996164,0.0022832956,0.00047967499,0.00017433733,0.0035039678,0.0000012363884,0.00049284473,0.048358202,0.00036503663,0.8838339,0.0009042704,0.059587248],"study_design_scores_gemma":[0.00031291103,0.000046929214,0.00013907715,0.000007031981,0.000871861,0.000022165306,0.00001715721,0.93882966,0.00015463139,0.051256936,0.0082442025,0.00009744845],"about_ca_topic_score_codex":0.0000040587884,"about_ca_topic_score_gemma":0.000011208309,"teacher_disagreement_score":0.89047146,"about_ca_system_score_codex":0.00003350432,"about_ca_system_score_gemma":0.000050179973,"threshold_uncertainty_score":0.34226078},"labels":[],"label_agreement":null},{"id":"W2019666114","doi":"10.1109/cdc.2012.6426082","title":"Newton-Geodesic HMP algorithms for the optimization of hybrid systems and the geometric properties of hybrid value functions","year":2012,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Geodesic; Extension (predicate logic); Algorithm; Hybrid system; Hybrid algorithm (constraint satisfaction); Computer science; Mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.03161496066326607,"score_gpt":0.22642293252856982,"score_spread":0.19480797186530374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019666114","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063680165,0.0014556221,0.995377,0.0015663067,0.0002810016,0.00042274315,0.000009543891,0.00002624266,0.00022474752],"genre_scores_gemma":[0.95934236,0.00015120137,0.03869964,0.00011552658,0.00008220425,0.00007826757,0.000008200479,0.000006726206,0.0015158548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990582,0.00008882536,0.00032383835,0.00013476158,0.00025776064,0.00013661562],"domain_scores_gemma":[0.9987381,0.00036555255,0.00021111155,0.0002936792,0.00035270854,0.000038836653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083375233,0.0000878636,0.00018138078,0.00018296189,0.00021192296,0.0000844247,0.00030392932,0.000012188222,0.000014804118],"category_scores_gemma":[0.00016739802,0.00004264273,0.000090241745,0.0007601547,0.000095306576,0.0004193546,0.000087359076,0.00003635847,0.0000018706829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001244552,0.000053849137,0.00013730064,0.00002886349,0.00011841302,1.8744762e-8,0.00013433915,0.92714405,0.000013986045,0.070722334,0.00058434205,0.0010500337],"study_design_scores_gemma":[0.00042514745,0.00002149665,0.00012339231,0.0000076603565,0.00008900711,0.000008216254,0.00010968189,0.99780506,0.0008122125,0.00006859935,0.00046888416,0.000060637576],"about_ca_topic_score_codex":0.00021361145,"about_ca_topic_score_gemma":6.00186e-7,"teacher_disagreement_score":0.9587056,"about_ca_system_score_codex":0.000014757217,"about_ca_system_score_gemma":0.000043156837,"threshold_uncertainty_score":0.173892},"labels":[],"label_agreement":null},{"id":"W2021175697","doi":"10.1080/00036811.2010.541447","title":"A proximal augmented Lagrangian method for equilibrium problems","year":2011,"lang":"en","type":"article","venue":"Applicable Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Augmented Lagrangian method; Intersection (aeronautics); Sequence (biology); Banach space; Convergence (economics); Projection method; Applied mathematics; Projection (relational algebra); Solution set; Lagrangian; Set (abstract data type); Mathematical optimization; Dykstra's projection algorithm; Mathematical analysis; Algorithm; Computer science","score_opus":0.029627783584931948,"score_gpt":0.26859028397078505,"score_spread":0.2389625003858531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021175697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016871265,0.000028313667,0.9941422,0.0005365831,0.000017563047,0.00034760646,0.000010275958,0.0001642775,0.00458449],"genre_scores_gemma":[0.09170702,0.0000048227976,0.90525556,0.0005051428,0.000035849705,0.00041476195,0.00007240593,0.00001204396,0.0019924047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984883,0.000057829697,0.000340607,0.00055956986,0.00024957274,0.00030410802],"domain_scores_gemma":[0.9988062,0.00007586765,0.0001702315,0.0005802527,0.00024254473,0.00012493038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005256502,0.00015397924,0.00034169925,0.0004341672,0.00012472444,0.000115749936,0.0006891815,0.00006634036,0.0003015396],"category_scores_gemma":[0.000019315816,0.00013572318,0.00043817362,0.00366639,0.000016370237,0.00035254646,0.00013224878,0.000053919077,0.000048168167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007582779,0.0015135919,0.010248568,0.0001177186,0.012573191,0.0000052838727,0.0031272536,0.09459,0.0058331573,0.8370248,0.0034792498,0.031411372],"study_design_scores_gemma":[0.0002870152,0.000039154405,0.00079018314,0.0000016332938,0.00094828394,7.6382247e-7,0.000018695731,0.9850554,0.001247704,0.0069563775,0.0044629737,0.00019184632],"about_ca_topic_score_codex":0.00038817694,"about_ca_topic_score_gemma":0.00006549425,"teacher_disagreement_score":0.8904654,"about_ca_system_score_codex":0.00002918,"about_ca_system_score_gemma":0.000039142233,"threshold_uncertainty_score":0.5534631},"labels":[],"label_agreement":null},{"id":"W2021602139","doi":"10.5539/mas.v2n6p26","title":"Characterazitions and Applications of Semistrictly Prequasi-invex Functions","year":2008,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation Project of Chongqing, Chongqing Science and Technology Commission; Chongqing Science and Technology Commission","keywords":"Computer science","score_opus":0.012548558576000162,"score_gpt":0.21035195205125892,"score_spread":0.19780339347525877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021602139","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024259947,0.00002015692,0.9867635,0.00027810797,0.000020972868,0.00014677616,0.000010093079,0.00007394977,0.010260464],"genre_scores_gemma":[0.9642175,0.000027370023,0.035062276,0.00017200503,0.000023994757,0.000081207916,0.000007904682,0.0000031417487,0.00040458943],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988402,0.0000070563965,0.00020710853,0.00039074558,0.00039371572,0.00016114462],"domain_scores_gemma":[0.99912417,0.000046068635,0.000110563415,0.0004016137,0.00019912941,0.00011845819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018999509,0.00008230613,0.000111136746,0.00024077887,0.0006570256,0.0000650742,0.0005242368,0.000027808188,0.000019897783],"category_scores_gemma":[0.000015984186,0.00007938578,0.000030323637,0.0017185607,0.00033974714,0.00041958728,0.00015383605,0.000064415595,0.00002402158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003865209,0.000311223,0.0013175923,0.000015725116,0.000022425507,9.1651293e-7,0.0015705136,0.0045254165,0.13593246,0.833424,0.00015885152,0.02271703],"study_design_scores_gemma":[0.00022626553,0.000016326172,0.012873265,0.000003228964,0.000013125346,0.000024086068,0.00002517833,0.9683474,0.0026647523,0.014331107,0.0012812768,0.00019400811],"about_ca_topic_score_codex":0.000007340548,"about_ca_topic_score_gemma":0.0000012345598,"teacher_disagreement_score":0.96382195,"about_ca_system_score_codex":0.000028123744,"about_ca_system_score_gemma":0.00018686044,"threshold_uncertainty_score":0.50533766},"labels":[],"label_agreement":null},{"id":"W2022188885","doi":"10.1007/s10898-003-2687-y","title":"Full Nuclear Cones and a Relation Between Strong Optimization and Pareto Efficiency","year":2005,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Vector optimization; Hausdorff space; Cone (formal languages); Pareto principle; Regular polygon; Relation (database); Hausdorff distance; Locally convex topological vector space; Mathematical optimization; Convex optimization; Type (biology); Conic optimization; Optimization problem; Pareto efficiency; Convex analysis; Pure mathematics; Mathematical analysis; Algorithm; Geometry; Computer science; Multi-swarm optimization","score_opus":0.009020491527263932,"score_gpt":0.23627175372726295,"score_spread":0.22725126219999903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022188885","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008160594,0.00021044571,0.9873695,0.0035819842,0.000077398254,0.00008198175,0.0000047028097,0.00003375809,0.00047963308],"genre_scores_gemma":[0.5779853,0.00019463876,0.4215909,0.000100876736,0.00010650109,4.2524744e-7,0.0000067535207,0.000005226874,0.000009416993],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986804,0.000090284906,0.00053942826,0.00019918333,0.00035387004,0.00013683736],"domain_scores_gemma":[0.99870145,0.000056185614,0.00055554876,0.000118222735,0.00042978322,0.00013881504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003129992,0.00012990517,0.00022200203,0.00013606549,0.0001773001,0.00027142875,0.00019457769,0.00009080346,0.000029256626],"category_scores_gemma":[0.00011555574,0.00011880264,0.000053803422,0.00056367123,0.000039556588,0.0016656073,0.00007749069,0.00009152599,0.0000024192777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001635257,0.000031268486,0.004821468,0.000003992452,0.00003222751,0.0000010534769,0.00011483402,0.9734415,0.0000041472563,0.019135531,0.000047714813,0.0023499564],"study_design_scores_gemma":[0.00066362607,0.00016267477,0.0057089343,0.000017923661,0.00006522658,0.00006728581,0.000033731536,0.99282265,0.0000025246645,0.000155408,0.0001793685,0.00012065876],"about_ca_topic_score_codex":0.0000043387113,"about_ca_topic_score_gemma":0.000001920815,"teacher_disagreement_score":0.5698247,"about_ca_system_score_codex":0.00011946609,"about_ca_system_score_gemma":0.00006140542,"threshold_uncertainty_score":0.48446313},"labels":[],"label_agreement":null},{"id":"W2022771530","doi":"10.1016/j.jmaa.2005.05.075","title":"On the convergence of implicit iteration process with error for a finite family of asymptotically nonexpansive mappings","year":2005,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":72,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Banach space; Fixed point; Convergence (economics); Hilbert space; Pure mathematics; Weak convergence; Iterative and incremental development; Discrete mathematics; Applied mathematics; Mathematical analysis; Computer science","score_opus":0.01288656264371331,"score_gpt":0.26506920708399734,"score_spread":0.25218264444028404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022771530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020804208,0.000015962678,0.9747046,0.0041293097,0.0000020145583,0.00017289321,0.0000078134335,0.0000034091197,0.00015978624],"genre_scores_gemma":[0.90992016,0.000012572451,0.08970286,0.00026545452,0.000021686308,0.000037378988,0.0000023879627,0.0000029206878,0.000034603378],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988624,0.00002582151,0.0006020016,0.00012265885,0.0003132044,0.00007392064],"domain_scores_gemma":[0.99740624,0.000743889,0.0006491238,0.00019218844,0.00095326226,0.00005529712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039622863,0.00008047657,0.00031891302,0.00020020618,0.00008020077,0.000040125462,0.00028521565,0.000028695556,0.0000320137],"category_scores_gemma":[0.000114821014,0.00004466032,0.00016994821,0.0009939141,0.000059982598,0.00015205088,0.000019189885,0.000060304807,0.0000015820233],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026373218,0.00039999935,0.00015513791,0.00006669853,0.0007910386,1.067886e-7,0.0007886276,0.06414538,0.0009173725,0.93141705,0.000040841314,0.0012513965],"study_design_scores_gemma":[0.00028999176,0.00017174255,0.0013096312,0.000047132267,0.0007751799,0.0000040594578,0.00020759848,0.93952405,0.0013155172,0.05617798,0.00008804871,0.00008907037],"about_ca_topic_score_codex":8.845019e-7,"about_ca_topic_score_gemma":0.0000014361383,"teacher_disagreement_score":0.8891159,"about_ca_system_score_codex":0.000008926724,"about_ca_system_score_gemma":0.0000508853,"threshold_uncertainty_score":0.18211949},"labels":[],"label_agreement":null},{"id":"W2022849399","doi":"10.1016/j.na.2005.02.054","title":"Sensitivity in multiobjective optimization: The generalized envolvent theorem","year":2005,"lang":"en","type":"article","venue":"Nonlinear Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Sensitivity (control systems); Computation; Mathematics; Mathematical optimization; Set (abstract data type); Multi-objective optimization; Applied mathematics; Nonlinear system; Function (biology); Space (punctuation); Computer science; Algorithm; Physics; Engineering","score_opus":0.010249177568353187,"score_gpt":0.25180760905889704,"score_spread":0.24155843149054385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022849399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032331876,0.000048150992,0.98892325,0.0066588656,0.000031436408,0.00009316271,0.000008391848,0.000060481594,0.00094309595],"genre_scores_gemma":[0.56877136,0.000042531974,0.42870045,0.0013676456,0.00016033174,0.000012686674,0.000064572436,0.000006662687,0.0008737508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998528,0.00028996225,0.00030979788,0.00035906944,0.00033505008,0.00017814143],"domain_scores_gemma":[0.9989733,0.0001508522,0.00012484902,0.00048523184,0.0002105146,0.000055231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072910095,0.00013082054,0.00025017452,0.00041507228,0.00016229374,0.0001402699,0.00032190137,0.000053668453,0.0002642356],"category_scores_gemma":[0.000063524465,0.00009288343,0.00030025738,0.003586003,0.00003491817,0.00033247384,0.00010820221,0.0001154127,0.000039959697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040873088,0.00010052196,0.0029690699,5.691236e-7,0.00031062504,0.0000022998588,0.00036111998,0.9864156,0.000009874258,0.008335083,0.000025015606,0.0014660894],"study_design_scores_gemma":[0.0002656673,0.000004918623,0.004833238,0.000001182244,0.00017673269,0.0000012357829,0.000030008734,0.9935355,0.00012569931,0.00010265629,0.0008045758,0.000118550546],"about_ca_topic_score_codex":0.00021835485,"about_ca_topic_score_gemma":0.001834689,"teacher_disagreement_score":0.56553817,"about_ca_system_score_codex":0.00009168396,"about_ca_system_score_gemma":0.000050266004,"threshold_uncertainty_score":0.3787676},"labels":[],"label_agreement":null},{"id":"W2022954527","doi":"10.1007/s11590-006-0024-3","title":"Disjunctive cuts for continuous linear bilevel programming","year":2006,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Air Force Office of Scientific Research","keywords":"Bilevel optimization; Linear programming; Duality (order theory); Relaxation (psychology); Mathematical optimization; Computational intelligence; Computer science; Mathematics; Linear programming relaxation; Domain (mathematical analysis); Optimization problem; Artificial intelligence; Discrete mathematics","score_opus":0.007874505805032505,"score_gpt":0.21972093456933942,"score_spread":0.2118464287643069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022954527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00011890969,0.000010227636,0.99005353,0.00874201,0.00018037723,0.00031835667,0.000008104034,0.00018932989,0.00037914238],"genre_scores_gemma":[0.016263992,0.0000026324092,0.98003405,0.0022668708,0.00019240685,0.00009582654,0.00020682425,0.000015849388,0.00092156656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893713,0.000035927565,0.0002655485,0.00034015154,0.00020721124,0.00021403284],"domain_scores_gemma":[0.99925834,0.000082619656,0.00015794608,0.00021522611,0.00023974627,0.00004612519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001448446,0.000130638,0.00014679322,0.00015999812,0.0001980038,0.0001985422,0.00027333715,0.00004537308,0.00003122581],"category_scores_gemma":[0.00004810189,0.00012418295,0.000103751714,0.00056755927,0.000026518765,0.0005174412,0.000044732966,0.00004437486,0.000013182006],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005674904,0.00005409207,0.00028076587,0.0000041442345,0.000020571384,7.8256164e-7,0.000046967263,0.97854704,0.0000879849,0.016170876,0.0030691926,0.0017119342],"study_design_scores_gemma":[0.00044816968,0.000024481882,0.00019857455,0.0000049559526,0.000019363119,0.0000015707031,0.00000621181,0.9903423,0.00009727223,0.00016370657,0.008522673,0.00017068232],"about_ca_topic_score_codex":0.000030928022,"about_ca_topic_score_gemma":0.0000031481168,"teacher_disagreement_score":0.016145082,"about_ca_system_score_codex":0.00004682952,"about_ca_system_score_gemma":0.00003087759,"threshold_uncertainty_score":0.5064034},"labels":[],"label_agreement":null},{"id":"W2023890224","doi":"10.1090/s0002-9947-2014-06412-x","title":"Approximating functions on stratified sets","year":2014,"lang":"en","type":"article","venue":"Transactions of the American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Defense Science and Engineering Graduate; European Commission","keywords":"Mathematics; Bessel function; Class (philosophy); Domain (mathematical analysis); Matrix (chemical analysis); Pure mathematics; Applied mathematics; Mathematical analysis; Artificial intelligence; Computer science","score_opus":0.013961983878991087,"score_gpt":0.24633203650347243,"score_spread":0.23237005262448135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2023890224","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003311063,7.475838e-7,0.98994374,0.003013731,0.000051303363,0.00008311993,0.000005046113,0.00007295241,0.0035183167],"genre_scores_gemma":[0.75335306,0.0000015828083,0.24546129,0.00055799284,0.000012123527,0.000014271207,0.0000010795967,0.0000058469086,0.0005927824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905705,0.000084071464,0.00027451987,0.00016703834,0.00029644542,0.000120888086],"domain_scores_gemma":[0.998891,0.00032223048,0.00020615254,0.00046399853,0.00006735442,0.00004927755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027627856,0.00009041804,0.00019225683,0.000023325236,0.0002596123,0.000042967524,0.0004278954,0.00002143405,0.00008671643],"category_scores_gemma":[0.000052269774,0.000060597453,0.00033674916,0.0007164709,0.00014929757,0.00010796335,0.000015955839,0.00012508422,0.00003367492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000113496535,0.0012691284,0.000114859045,0.000118112315,0.0005019365,6.8996755e-8,0.0031607887,0.17985526,0.0017959836,0.7622007,0.0016926986,0.049279124],"study_design_scores_gemma":[0.00011155505,0.000058375936,0.0005004756,0.000013931962,0.000042572585,0.0000015711662,0.00019229754,0.9780193,0.0003313248,0.020504048,0.00013458551,0.00008998506],"about_ca_topic_score_codex":0.000012187968,"about_ca_topic_score_gemma":0.000001101415,"teacher_disagreement_score":0.798164,"about_ca_system_score_codex":0.00002329286,"about_ca_system_score_gemma":0.000024713765,"threshold_uncertainty_score":0.24710923},"labels":[],"label_agreement":null},{"id":"W2024162818","doi":"10.1016/j.camwa.2004.06.018","title":"The convergence property of ishikawa iteration schemes in noncompact subsets of hilbert spaces and its applications to complementarity theory","year":2004,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Hilbert space; Regular polygon; Pure mathematics; Fixed-point theorem; Complementarity (molecular biology); Convergence (economics); Discrete mathematics; Applied mathematics","score_opus":0.01740746232862509,"score_gpt":0.2656179367045386,"score_spread":0.2482104743759135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024162818","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058476455,0.00007679475,0.99047035,0.0022940796,0.0000114102995,0.0010670758,0.000012356359,0.00002834691,0.0001919191],"genre_scores_gemma":[0.6306527,0.000039699597,0.3688135,0.00010472943,0.000010434237,0.0003274156,0.000014528437,0.0000064888573,0.000030430683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988532,0.000040253435,0.00046012373,0.00025701654,0.00025076215,0.00013865743],"domain_scores_gemma":[0.9985462,0.0003354843,0.00028722527,0.00046093372,0.00029283424,0.000077361925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003727065,0.00012784087,0.00021646766,0.00013242103,0.0001870216,0.00009094285,0.0005773831,0.000026991342,0.000004905117],"category_scores_gemma":[0.000021665457,0.00008096925,0.000035490833,0.0009138296,0.00008110207,0.00021743156,0.00014090764,0.00006600598,0.0000069816792],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000061341316,0.00027557806,0.00041269168,0.00007342024,0.00004441995,1.0015565e-7,0.0017774794,0.01424683,0.00029988537,0.97999924,0.0000258546,0.0028383767],"study_design_scores_gemma":[0.0020713988,0.00025533856,0.00903949,0.00035874004,0.0001274158,0.000023419652,0.0008608716,0.8012641,0.010074078,0.1674518,0.0077077937,0.0007655586],"about_ca_topic_score_codex":0.000034334185,"about_ca_topic_score_gemma":0.000109861954,"teacher_disagreement_score":0.81254745,"about_ca_system_score_codex":0.000045129724,"about_ca_system_score_gemma":0.00010140655,"threshold_uncertainty_score":0.33018303},"labels":[],"label_agreement":null},{"id":"W2024351153","doi":"10.1007/s10898-014-0168-0","title":"Global minimization of the difference of strictly non-positive valued affine ICR functions","year":2014,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Graduate University of Advanced Technology; Centre de Recherches Mathématiques","keywords":"Mathematics; Affine transformation; Convexity; Subderivative; Class (philosophy); Pure mathematics; Convex function; Minification; Applied mathematics; Regular polygon; Mathematical optimization; Convex optimization; Geometry; Artificial intelligence; Computer science","score_opus":0.005639903238360897,"score_gpt":0.22042256933659607,"score_spread":0.21478266609823518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024351153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004120336,0.000023610939,0.9922458,0.0008624639,0.00042873205,0.00010106513,0.000032397467,0.000010138954,0.002175464],"genre_scores_gemma":[0.8552843,0.00002214525,0.14439568,0.00014835403,0.00006986319,9.269059e-7,0.000010144179,0.0000036499416,0.0000649576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811417,0.00019826961,0.00077705976,0.00015892922,0.0006271456,0.00012442276],"domain_scores_gemma":[0.9965278,0.000075120166,0.0014387856,0.00027376757,0.0016090996,0.00007544307],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003021338,0.00013311765,0.00030384646,0.00009510421,0.00010411401,0.000057273628,0.0006227642,0.000081711216,0.000032720283],"category_scores_gemma":[0.00037285316,0.000096499665,0.00021894342,0.0022040107,0.000054601645,0.0004441335,0.00011515673,0.000067593275,0.0000011551689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029518933,0.00016078613,0.013465378,0.000007387612,0.0000772028,2.0950624e-7,0.000046941517,0.9640701,0.000040744733,0.020284943,0.00024517655,0.0015716072],"study_design_scores_gemma":[0.00062540977,0.00015034601,0.13059431,0.000046816593,0.00011293437,0.000014053507,0.000017572971,0.8674857,0.00015052593,0.0007004412,0.000019327663,0.000082533435],"about_ca_topic_score_codex":0.00003496572,"about_ca_topic_score_gemma":0.000010612488,"teacher_disagreement_score":0.8511639,"about_ca_system_score_codex":0.00016718738,"about_ca_system_score_gemma":0.00022618475,"threshold_uncertainty_score":0.39351422},"labels":[],"label_agreement":null},{"id":"W2024983730","doi":"10.1007/s10898-006-9038-8","title":"Exact Penalty Functions for Constrained Minimization Problems via Regularized Gap Function for Variational Inequalities","year":2006,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Penalty method; Differentiable function; Variational inequality; Minification; Stationary point; Function (biology); Convex function; Mathematical optimization; Order (exchange); Applied mathematics; Space (punctuation); Regular polygon; Mathematical analysis; Computer science","score_opus":0.018048592877442118,"score_gpt":0.24717980431963135,"score_spread":0.22913121144218923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024983730","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000075232245,0.000059130598,0.99509805,0.002825447,0.000774248,0.00055202097,0.00010227885,0.00006584797,0.00044776892],"genre_scores_gemma":[0.11830759,0.000014436627,0.8792491,0.00033780243,0.00066570716,0.00006843125,0.00074955745,0.000017892971,0.0005894677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977074,0.00014287488,0.0011138207,0.0002841008,0.0005137158,0.00023806712],"domain_scores_gemma":[0.9954205,0.00028877505,0.0012937314,0.00018218502,0.00272086,0.00009393266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093538413,0.00020515418,0.00034126677,0.00023467549,0.00034226614,0.00030108436,0.00028528922,0.00014481459,0.00007542269],"category_scores_gemma":[0.00035415983,0.00019213549,0.00031956087,0.0008842042,0.000036092337,0.0014418181,0.00002896166,0.000070392365,0.0000022105041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014559305,0.00017009967,0.00034445565,0.000024896783,0.00010841282,2.3016865e-7,0.000024383771,0.8306722,0.000069108944,0.16528963,0.002624071,0.0005268933],"study_design_scores_gemma":[0.002474936,0.00030874508,0.00095222855,0.000022907983,0.00019344335,0.000030457597,0.000025103804,0.96223783,0.000014390387,0.031950522,0.0015903129,0.00019911458],"about_ca_topic_score_codex":0.000024523531,"about_ca_topic_score_gemma":0.000015687523,"teacher_disagreement_score":0.1333391,"about_ca_system_score_codex":0.00028882571,"about_ca_system_score_gemma":0.00038356395,"threshold_uncertainty_score":0.78350574},"labels":[],"label_agreement":null},{"id":"W2026465307","doi":"10.1016/s0898-1221(04)90016-8","title":"New fixed-point theorems for two maps and applications to problems on sets with convex sections and minimax inequalities","year":2004,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Minimax; Intersection (aeronautics); Fixed-point theorem; Fixed point; Regular polygon; Product (mathematics); Type (biology); Point (geometry); Pure mathematics; Applied mathematics; Discrete mathematics; Mathematical analysis; Mathematical optimization; Geometry","score_opus":0.01696568428794747,"score_gpt":0.25737294004860856,"score_spread":0.24040725576066108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026465307","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020795499,0.000025211444,0.9919682,0.004955141,0.000013582132,0.0019430587,0.000034507502,0.00016523484,0.0006870831],"genre_scores_gemma":[0.027621461,0.000011566108,0.9691629,0.0007674766,0.00006741749,0.0020996286,0.000050480925,0.00002349164,0.00019561146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881107,0.000014655855,0.00029552894,0.00047160784,0.00020894584,0.00019819089],"domain_scores_gemma":[0.9985648,0.0002942568,0.00016614514,0.00052505033,0.00021524391,0.0002345177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015450004,0.00020879101,0.00024145236,0.0002044431,0.00038528387,0.00029021912,0.00032143175,0.000037722995,0.000002876236],"category_scores_gemma":[0.000008342701,0.00016344976,0.00003363785,0.0006588732,0.0000730915,0.00019075342,0.00012251784,0.00007679653,0.000013800546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005495868,0.00013478288,0.000013885933,0.00006765712,0.00006384354,1.4076912e-7,0.0019763766,0.036740173,0.00001698655,0.9553869,0.00024842916,0.0053453273],"study_design_scores_gemma":[0.003477617,0.0007593099,0.00020089837,0.00026557373,0.00020122918,0.00012044825,0.0007355422,0.16925967,0.0004502645,0.81019235,0.0133894,0.0009477051],"about_ca_topic_score_codex":0.000022555048,"about_ca_topic_score_gemma":0.000042929474,"teacher_disagreement_score":0.14519455,"about_ca_system_score_codex":0.000048017926,"about_ca_system_score_gemma":0.00012217715,"threshold_uncertainty_score":0.66652876},"labels":[],"label_agreement":null},{"id":"W2026639046","doi":"10.1155/jia.2005.479","title":"Auxiliary principle and fuzzy variational-like inequalities","year":2005,"lang":"en","type":"article","venue":"Journal of Inequalities and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Variational inequality; Hilbert space; Fuzzy logic; Applied mathematics; Iterative method; Variational principle; Algebra over a field; Mathematical optimization; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.019221324019386768,"score_gpt":0.2734869372057076,"score_spread":0.25426561318632085,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026639046","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0065836036,0.0008880212,0.9800001,0.010833482,0.000053897347,0.00010221597,0.000019482964,0.000029171588,0.0014900257],"genre_scores_gemma":[0.77762944,0.0011847693,0.21534488,0.0027032571,0.0008164263,0.000042209893,0.000016729085,0.000011696536,0.002250621],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99893075,0.000057365032,0.00051898166,0.00013408478,0.00025234188,0.000106497806],"domain_scores_gemma":[0.998864,0.00021511187,0.00033682247,0.00015817973,0.0003196672,0.000106219784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042341073,0.00009340684,0.00017730687,0.00016843338,0.00018407077,0.00016536028,0.00021595329,0.000040430437,0.00003353535],"category_scores_gemma":[0.000039464147,0.0000787653,0.00005401193,0.00023944618,0.000040044455,0.0006537054,0.000095410585,0.00009357883,0.0000047215326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029256241,0.00005283031,0.0006672666,0.000014210591,0.000040427174,3.0080318e-7,0.0006957778,0.0015414141,0.000025632127,0.9904545,0.00041022038,0.0060944865],"study_design_scores_gemma":[0.0017325536,0.00019309376,0.020725753,0.000062113635,0.00013999455,0.00025056512,0.0025176767,0.13078962,0.00015930572,0.19971955,0.64302707,0.0006826881],"about_ca_topic_score_codex":0.000015278887,"about_ca_topic_score_gemma":0.0000075718867,"teacher_disagreement_score":0.79073495,"about_ca_system_score_codex":0.000027446866,"about_ca_system_score_gemma":0.00008951076,"threshold_uncertainty_score":0.32119557},"labels":[],"label_agreement":null},{"id":"W2027711030","doi":"10.1080/02331930008844513","title":"Dykstras algorithm with bregman projections: A convergence proof","year":2000,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Bregman divergence; Mathematics; Convergence (economics); Algorithm; Regular polygon; Constraint (computer-aided design); Legendre polynomials; Mathematical optimization; Applied mathematics; Mathematical analysis; Geometry","score_opus":0.005520435647381991,"score_gpt":0.2031312555329953,"score_spread":0.1976108198856133,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027711030","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000058519403,0.000017285927,0.99094075,0.001035756,0.000052040563,0.00020813494,0.0000033128822,0.00017454253,0.0075096614],"genre_scores_gemma":[0.013233187,0.000079410114,0.9782319,0.00035638904,0.000056369787,0.000062773346,0.00006899033,0.000012508858,0.0078984685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989882,0.000048159774,0.00019099751,0.00033738822,0.0002792161,0.00015601679],"domain_scores_gemma":[0.99934787,0.000020207272,0.00007356482,0.0002792613,0.00021224217,0.00006688603],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001014037,0.0001180695,0.00010594751,0.0001219103,0.0002072314,0.00017089711,0.00026825827,0.000047143305,0.0016826482],"category_scores_gemma":[0.000010989221,0.0001002264,0.00003652104,0.0011948976,0.000028031183,0.0008688186,0.000020001991,0.000061400606,0.00008604743],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000046311793,0.000076701996,0.00010449238,0.000002860814,0.000023555755,0.0000018554742,0.00015229215,0.9664524,0.0000017976375,0.0037969812,0.0002498002,0.029132586],"study_design_scores_gemma":[0.00027096964,0.00006198152,0.00016940593,0.000009380741,0.000015076428,0.000019025718,0.000011785588,0.9972625,0.000084476516,0.00013975042,0.0018054274,0.00015022252],"about_ca_topic_score_codex":0.000034133398,"about_ca_topic_score_gemma":0.000006983096,"teacher_disagreement_score":0.03081005,"about_ca_system_score_codex":0.000037813643,"about_ca_system_score_gemma":0.000094217015,"threshold_uncertainty_score":0.99922997},"labels":[],"label_agreement":null},{"id":"W2028182461","doi":"10.1007/s12597-009-0011-4","title":"Solving bilevel programming problems with multicriteria optimization techniques","year":2009,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Bilevel optimization; Mathematical optimization; Intersection (aeronautics); Relation (database); Class (philosophy); Multi-objective optimization; Computer science; Pareto principle; Pareto optimal; Optimization problem; Mathematics; Artificial intelligence; Data mining","score_opus":0.019440543819704812,"score_gpt":0.2741314883152999,"score_spread":0.25469094449559504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028182461","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012674747,0.000014301946,0.9957051,0.0022206926,0.000015103467,0.0002454625,6.331971e-7,0.00025595658,0.0014160031],"genre_scores_gemma":[0.15680875,0.000012241012,0.84258765,0.00018927486,0.000030631047,0.00002567925,0.000013039738,0.000005825792,0.00032691425],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989468,0.000048337453,0.00016121495,0.0002881035,0.000330175,0.0002253965],"domain_scores_gemma":[0.99929786,0.00002793001,0.00005584818,0.00025114953,0.00029488298,0.000072323106],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030320097,0.00009552807,0.00010164859,0.00018771354,0.0001780537,0.00040989782,0.00036124617,0.000039625196,0.00004470155],"category_scores_gemma":[0.000031195334,0.00007561543,0.000029498915,0.0008302846,0.000020020361,0.0005943053,0.00005861907,0.0000852823,0.000009294012],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002120812,0.0005310137,0.0013234406,0.000038137136,0.00005814437,0.000014626983,0.001831854,0.34412506,0.002999173,0.052440103,0.00026184466,0.5963554],"study_design_scores_gemma":[0.00015700236,0.00014358449,0.00071474724,0.000030920597,0.000005297062,0.0000072364705,0.000010952172,0.99664265,0.0009570934,0.00034659845,0.00084128906,0.00014260128],"about_ca_topic_score_codex":0.00002026144,"about_ca_topic_score_gemma":0.000002680067,"teacher_disagreement_score":0.6525176,"about_ca_system_score_codex":0.00003708431,"about_ca_system_score_gemma":0.00006887697,"threshold_uncertainty_score":0.39526543},"labels":[],"label_agreement":null},{"id":"W2029061302","doi":"10.1006/jmaa.2000.7014","title":"On Incomplete Lagrange Function and Saddle Point Optimality Criteria in Mathematical Programming","year":2000,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Saddle point; Fractional programming; Convexity; Class (philosophy); Nonlinear programming; Saddle; Mathematical optimization; Lagrange multiplier; Point (geometry); Function (biology); Nonlinear system; Applied mathematics; Computer science; Geometry","score_opus":0.015976920028083444,"score_gpt":0.27279366518885795,"score_spread":0.2568167451607745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029061302","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03271312,0.00004414893,0.96417516,0.002071657,0.0000036243637,0.00012502483,0.0000024296403,0.000014251322,0.0008505736],"genre_scores_gemma":[0.85461146,0.000051444225,0.14495438,0.00020186025,0.000038820344,0.000030878877,0.0000039389342,0.000004919709,0.00010227119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986821,0.00007510128,0.0006388063,0.0001997422,0.00028025414,0.00012401886],"domain_scores_gemma":[0.99908435,0.00026871465,0.0001978997,0.00020843068,0.00010857734,0.00013205255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007289945,0.000110560155,0.00038472842,0.00033147447,0.00010635948,0.00019128424,0.00018365942,0.000046422876,0.00060456287],"category_scores_gemma":[0.000046917936,0.000081299135,0.00015043032,0.0010846825,0.00004776576,0.00026489032,0.00003860407,0.00012435786,0.00002044531],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031254105,0.0011299512,0.0009897155,0.000077802026,0.000497092,0.0000027858691,0.00040356533,0.0021201374,0.000062438856,0.9370753,0.000052807685,0.05755712],"study_design_scores_gemma":[0.0004939381,0.00012316469,0.020258853,0.0000448717,0.0006056782,0.000033527245,0.00006935803,0.4645414,0.000012020241,0.51307184,0.00056428934,0.0001810305],"about_ca_topic_score_codex":0.0000042162137,"about_ca_topic_score_gemma":0.000004493016,"teacher_disagreement_score":0.82189834,"about_ca_system_score_codex":0.000020858242,"about_ca_system_score_gemma":0.00001353158,"threshold_uncertainty_score":0.6619539},"labels":[],"label_agreement":null},{"id":"W2029280767","doi":"10.1007/s10114-009-6144-9","title":"Globally proper saddle point in ic-cone-convexlike set-valued optimization problems","year":2009,"lang":"en","type":"article","venue":"Acta Mathematica Sinica English Series","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Health Sciences North","funders":"","keywords":"Saddle point; Cone (formal languages); Lagrange multiplier; Mathematics; Set (abstract data type); Property (philosophy); Point (geometry); Mathematical optimization; Saddle; Applied mathematics; Geometry; Computer science; Algorithm","score_opus":0.015761120738031837,"score_gpt":0.2359873094650463,"score_spread":0.22022618872701447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029280767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056085563,0.00012430569,0.8960195,0.026522176,0.000525895,0.001592499,0.000020406052,0.0012404019,0.068346225],"genre_scores_gemma":[0.582053,0.00007592723,0.41516107,0.0014004029,0.000095057934,0.000053366533,0.000045944667,0.000022649612,0.001092578],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976064,0.00014362203,0.0008030911,0.00054561725,0.00053263485,0.00036863075],"domain_scores_gemma":[0.998251,0.000114068316,0.0002843249,0.0007558339,0.0004658366,0.0001289137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007219151,0.00027464158,0.00044459343,0.00020495863,0.00014259292,0.00058739405,0.0009564346,0.00013562708,0.0002765169],"category_scores_gemma":[0.0008727167,0.00023517523,0.00012116073,0.001110843,0.00006202204,0.0025493146,0.00017808958,0.00016828501,0.000037390462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007275816,0.0014777791,0.00024249063,0.00020096144,0.00017943818,0.000019270225,0.025985545,0.1212154,0.00036875464,0.8438435,0.0050928295,0.0013012646],"study_design_scores_gemma":[0.001611118,0.00038583204,0.0010913532,0.00026429066,0.00007139348,0.000029399798,0.00077064335,0.9462161,0.00050078356,0.044557843,0.003552994,0.0009482176],"about_ca_topic_score_codex":0.000007364142,"about_ca_topic_score_gemma":0.000010892704,"teacher_disagreement_score":0.8250007,"about_ca_system_score_codex":0.000082145,"about_ca_system_score_gemma":0.00014982799,"threshold_uncertainty_score":0.9590168},"labels":[],"label_agreement":null},{"id":"W2031413912","doi":"10.1063/1.4890292","title":"Modulus of convexity for operator convex functions","year":2014,"lang":"en","type":"article","venue":"Journal of Mathematical Physics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"Army Research Office; Institut Périmètre de physique théorique; Industry Canada; National Science Foundation; Government of Canada; U.S. Department of Energy; Ministero dello Sviluppo Economico","keywords":"Convexity; Logarithmically convex function; Convex function; Operator (biology); Convex analysis; Upper and lower bounds; Subderivative; Regular polygon; Bregman divergence","score_opus":0.019625032678319953,"score_gpt":0.25312483188812684,"score_spread":0.2334997992098069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031413912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017061814,0.000005239784,0.9964003,0.0009428643,0.00012326123,0.000052738233,0.0000027355456,0.000007158169,0.0007595065],"genre_scores_gemma":[0.7153831,0.0000020281814,0.28390414,0.0002592575,0.00020111317,0.0000026613998,0.00000105776,0.0000054835195,0.00024113845],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917614,0.000037948867,0.00039577048,0.00006859525,0.00024757424,0.00007394926],"domain_scores_gemma":[0.99857646,0.00027532986,0.0003154249,0.00015734462,0.00060552923,0.000069886126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004206021,0.000060098246,0.0002604906,0.000038495873,0.00004543291,0.000035927023,0.00026745832,0.000026599266,0.000036697238],"category_scores_gemma":[0.00027877447,0.000044358007,0.0001759597,0.00018058607,0.00003076232,0.00025916327,0.000033116536,0.000062641906,0.000013564755],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006945009,0.0002606074,0.000027184858,0.000049812785,0.00007729531,1.3912445e-7,0.0001521332,0.005823867,0.00042691964,0.99003124,0.0012725953,0.0018712806],"study_design_scores_gemma":[0.0003568941,0.00010453429,0.000060936185,0.000016592045,0.000040929317,0.0000038186326,0.000012752892,0.7049529,0.0011997112,0.2927149,0.00048595716,0.000050049242],"about_ca_topic_score_codex":2.6002076e-7,"about_ca_topic_score_gemma":5.2206303e-8,"teacher_disagreement_score":0.7136769,"about_ca_system_score_codex":0.000012812536,"about_ca_system_score_gemma":0.00005410245,"threshold_uncertainty_score":0.1808867},"labels":[],"label_agreement":null},{"id":"W2033167349","doi":"10.1080/00036811.2013.835043","title":"Hybrid viscosity approach for hierarchical fixed-point problems","year":2013,"lang":"en","type":"article","venue":"Applicable Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Memorial University of Newfoundland","keywords":"Mathematics; Viscosity; Banach space; Convergence (economics); Fixed point; Countable set; Expansive; Applied mathematics; Mathematical optimization; Mathematical analysis; Pure mathematics","score_opus":0.010432812931906035,"score_gpt":0.2194269860856711,"score_spread":0.20899417315376506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033167349","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000854386,0.000024013527,0.9935302,0.0018707877,0.000012086516,0.0004937724,0.000009553101,0.00014008267,0.003065106],"genre_scores_gemma":[0.5464157,0.00001163149,0.45029762,0.0007965851,0.000056655615,0.0007712442,0.00019517695,0.000009714725,0.0014456956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823767,0.00005381439,0.00037287493,0.00066974823,0.00032975487,0.00033616772],"domain_scores_gemma":[0.9985913,0.00011864439,0.00014142101,0.0007034425,0.00026432495,0.00018088124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034844375,0.00017294478,0.00039629283,0.0003561095,0.00026657077,0.0003727186,0.00079057785,0.000054210577,0.0002865312],"category_scores_gemma":[0.000026808428,0.00014747636,0.00046564583,0.0019949512,0.000034496894,0.0005054962,0.00019477645,0.00010235444,0.00012334142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075362946,0.0008652746,0.0039642365,0.000060724316,0.0035968218,8.364363e-7,0.00022969856,0.706141,0.0006102697,0.25759047,0.01469367,0.012239456],"study_design_scores_gemma":[0.00019417972,0.000019913447,0.00096569397,8.829342e-7,0.00036335422,0.0000010794746,0.000008240606,0.9842821,0.00022060535,0.011972842,0.0017738616,0.0001972931],"about_ca_topic_score_codex":0.00036070557,"about_ca_topic_score_gemma":0.000007447682,"teacher_disagreement_score":0.5455613,"about_ca_system_score_codex":0.00004133079,"about_ca_system_score_gemma":0.00003509601,"threshold_uncertainty_score":0.60139114},"labels":[],"label_agreement":null},{"id":"W2034621220","doi":"10.5539/mas.v1n2p41","title":"Strongly Convergence Theorem of m-accretive Operators","year":2007,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Banach space; Mathematics; Sequence (biology); Convergence (economics); Zero (linguistics); Pure mathematics; Nonlinear system; Eberlein–Šmulian theorem; Discrete mathematics; Space (punctuation); Lp space; Computer science; Physics; Economics","score_opus":0.009741483386191387,"score_gpt":0.24242916104071766,"score_spread":0.23268767765452628,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034621220","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01790974,0.000009787797,0.96402156,0.000104494764,0.000093581504,0.000087452994,0.0000015959464,0.000049242997,0.017722556],"genre_scores_gemma":[0.9307472,0.000002482442,0.06899551,0.00014847385,0.000013543758,0.0000031081497,8.077357e-7,0.0000031143015,0.00008572057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837977,0.000011118271,0.00025195567,0.0004191437,0.00066106766,0.0002769752],"domain_scores_gemma":[0.9990329,0.000059269823,0.00012003767,0.000398026,0.00026391877,0.0001258194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012490138,0.000096152165,0.00012887285,0.00021499321,0.00020585183,0.00008699017,0.0012789937,0.000029005916,0.000052601397],"category_scores_gemma":[0.000039873845,0.00008268001,0.000037304253,0.0017101658,0.00036145328,0.0004312439,0.00024429898,0.0000647161,0.00002819039],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005982344,0.0000342306,0.00047800055,0.0000018228411,0.0000055523506,6.4888405e-7,0.0011097909,0.007981574,0.091194294,0.8955567,0.000009226715,0.0036221854],"study_design_scores_gemma":[0.00014119633,0.00001826494,0.005179418,0.0000027533752,0.0000039644497,0.0000010467102,0.000100136815,0.92602104,0.058650278,0.0096902605,0.000053421038,0.00013824932],"about_ca_topic_score_codex":0.000010527617,"about_ca_topic_score_gemma":0.0000040054188,"teacher_disagreement_score":0.91803944,"about_ca_system_score_codex":0.00005017012,"about_ca_system_score_gemma":0.00020583966,"threshold_uncertainty_score":0.3371593},"labels":[],"label_agreement":null},{"id":"W2036651327","doi":"10.1007/s10957-012-0228-x","title":"Second-Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Constraint (computer-aided design); Theory of computation; Mathematical optimization; Mathematics; Order (exchange); Mathematical economics; Independence (probability theory); Optimality criterion; Nonlinear system; Economics; Algorithm; Statistics","score_opus":0.014738101471121593,"score_gpt":0.275257527337355,"score_spread":0.2605194258662334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036651327","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000348876,0.000061721825,0.99694794,0.0006609176,0.000028220207,0.00036077012,0.000013790636,0.000030330399,0.0015474107],"genre_scores_gemma":[0.27507666,0.000013850575,0.72403204,0.00027157794,0.0001361445,0.00012963924,0.000041136853,0.000010532056,0.00028842333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990545,0.0000939298,0.00039697732,0.00012635828,0.00016510743,0.00016315735],"domain_scores_gemma":[0.9982993,0.00033266575,0.00038607928,0.00017682846,0.00063150155,0.00017361977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095152203,0.00010653112,0.00018442102,0.000118252334,0.00018226187,0.00013293806,0.00021668758,0.000051598094,0.00029416042],"category_scores_gemma":[0.0000730429,0.000081642735,0.00006844688,0.0004254134,0.00014761741,0.0009025504,0.00003279767,0.00007988274,0.0000039121064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020958201,0.000286607,0.00012905577,0.000021422873,0.00008772913,1.3888618e-7,0.00019838286,0.060185555,0.00003302483,0.9372852,0.000060687435,0.0016912534],"study_design_scores_gemma":[0.0037503866,0.000533447,0.00087073253,0.00010578517,0.00064494077,0.00080180704,0.0009849693,0.7326011,0.0007825374,0.24872762,0.009321503,0.00087519205],"about_ca_topic_score_codex":5.7136305e-8,"about_ca_topic_score_gemma":8.0310485e-8,"teacher_disagreement_score":0.68855757,"about_ca_system_score_codex":0.000018417677,"about_ca_system_score_gemma":0.00008428814,"threshold_uncertainty_score":0.3329294},"labels":[],"label_agreement":null},{"id":"W2038913104","doi":"10.1007/s11228-009-0108-1","title":"A Weak Maximum Principle for Optimal Control Problems with Nonsmooth Mixed Constraints","year":2009,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Pacific Institute for the Mathematical Sciences","keywords":"Convexity; Maximum principle; Mathematics; Optimal control; Independence (probability theory); Mathematical optimization; Applied mathematics; Control (management); Computer science; Statistics; Economics","score_opus":0.011726069260553655,"score_gpt":0.24494637455897195,"score_spread":0.23322030529841828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038913104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014920282,0.000038618004,0.9928398,0.004416832,0.000036035173,0.00034374252,0.00012424396,0.00009215874,0.000616555],"genre_scores_gemma":[0.7355213,0.000008393476,0.26284766,0.0008170232,0.000071490555,0.000052317053,0.000278334,0.0000075060334,0.00039596405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802774,0.00009927558,0.00043807554,0.00062145013,0.0005012275,0.0003122528],"domain_scores_gemma":[0.9985433,0.00018189511,0.00027825483,0.00030742868,0.0005079286,0.00018119832],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005700711,0.00023912448,0.00044766045,0.00047359196,0.00036620154,0.00030413747,0.00033843087,0.000088062705,0.00012788035],"category_scores_gemma":[0.00007290704,0.00019004307,0.00024435215,0.0016524357,0.00006354869,0.00045719778,0.00003603053,0.000091322916,0.000008224448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006622252,0.00019600218,0.0025032097,0.000009379315,0.0019549825,0.0000015933116,0.00026195307,0.31017232,0.00006830871,0.68225515,0.00013301737,0.0023778568],"study_design_scores_gemma":[0.00181559,0.00016845936,0.03385872,0.000007629719,0.0010121244,0.0000064939486,0.000024904575,0.9532218,0.0000100604475,0.008899468,0.00069152215,0.0002832207],"about_ca_topic_score_codex":0.000020531115,"about_ca_topic_score_gemma":0.00002293131,"teacher_disagreement_score":0.7340293,"about_ca_system_score_codex":0.000045735433,"about_ca_system_score_gemma":0.0001704891,"threshold_uncertainty_score":0.77497315},"labels":[],"label_agreement":null},{"id":"W203977640","doi":"","title":"A proximal-like algorithm for a class of nonconvex programming","year":2008,"lang":"en","type":"article","venue":"Pacific Journal of Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Bounded function; Sequence (biology); Mathematics; Function (biology); Solution set; Regular polygon; Algorithm; Convex function; Zero (linguistics); Homogeneous; Combinatorics; Class (philosophy); Set (abstract data type); Computer science; Mathematical analysis","score_opus":0.017334207570578554,"score_gpt":0.24073222663886226,"score_spread":0.22339801906828372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W203977640","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000079625155,0.000082842,0.99863845,0.00047320838,0.00021920656,0.00018071878,0.0000028357683,0.000019078743,0.0003040518],"genre_scores_gemma":[0.04978442,0.000113531336,0.9497397,0.000039757044,0.00008352426,0.000008563742,0.000009635871,0.000008960686,0.00021189475],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867326,0.000052876116,0.0006116623,0.00014594907,0.0003731974,0.00014305009],"domain_scores_gemma":[0.99761975,0.000083753745,0.0007885885,0.00015529456,0.0012728793,0.00007974776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004370049,0.00010103084,0.00025333842,0.00030822295,0.00011806026,0.000050178078,0.00031390853,0.000056930992,0.000018868048],"category_scores_gemma":[0.00008179318,0.00008760206,0.0001812366,0.0006902261,0.00003924131,0.0006598718,0.000029512687,0.000076035474,0.0000010899787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030070372,0.00038267742,0.00061221985,0.000030501214,0.0001802635,0.000009602017,0.0016634868,0.9366908,0.000076601325,0.003765488,0.0006990533,0.055859223],"study_design_scores_gemma":[0.00070354494,0.00019229372,0.00006973808,0.000019447984,0.000031689684,0.00008910112,0.00008775489,0.99689955,0.00018904432,0.00012683973,0.001497531,0.00009349837],"about_ca_topic_score_codex":0.0000013848932,"about_ca_topic_score_gemma":1.4892073e-7,"teacher_disagreement_score":0.060208704,"about_ca_system_score_codex":0.00004261669,"about_ca_system_score_gemma":0.00020237171,"threshold_uncertainty_score":0.3572308},"labels":[],"label_agreement":null},{"id":"W2040407117","doi":"10.1016/j.jmaa.2007.01.104","title":"A Sard theorem for tame set-valued mappings","year":2007,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Dalhousie University","keywords":"Mathematics; Set (abstract data type); Discrete mathematics; Pure mathematics; Computer science","score_opus":0.018157647450336357,"score_gpt":0.29053231221928566,"score_spread":0.2723746647689493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040407117","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008924196,0.000049183578,0.99623895,0.0020849092,0.000008649253,0.00011782321,0.0000038147805,0.000013659729,0.0005905977],"genre_scores_gemma":[0.2878761,0.00003019287,0.7111687,0.000349632,0.000136199,0.00002030783,0.0000058464384,0.000005919495,0.00040707042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987995,0.00002175278,0.0006223947,0.00014880727,0.00027482334,0.00013272246],"domain_scores_gemma":[0.99841,0.00039948116,0.00041654563,0.0002081234,0.00042007898,0.00014577163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014003431,0.00008758632,0.00032831775,0.00040717982,0.00015321013,0.00011671014,0.00033304194,0.000043090837,0.000056057757],"category_scores_gemma":[0.0000984186,0.000062423016,0.00034078016,0.001343287,0.000054250308,0.00017647044,0.00004545238,0.000071666436,0.000007339211],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000050838994,0.000121171666,0.000101227,0.000016068516,0.0005853194,5.2675927e-7,0.00022497603,0.0004413362,0.00011752961,0.99233234,0.00015146106,0.0059029325],"study_design_scores_gemma":[0.0004614484,0.00006100712,0.0017526152,0.000014706959,0.0015713075,0.000031397394,0.00026825964,0.39473638,0.00035472726,0.59281284,0.0077397865,0.00019552042],"about_ca_topic_score_codex":9.486203e-7,"about_ca_topic_score_gemma":0.00000155756,"teacher_disagreement_score":0.3995195,"about_ca_system_score_codex":0.000019458725,"about_ca_system_score_gemma":0.00002639853,"threshold_uncertainty_score":0.25455368},"labels":[],"label_agreement":null},{"id":"W2040926607","doi":"10.1007/s11117-012-0192-6","title":"Generalized positive sets and abstract monotonicity","year":2012,"lang":"en","type":"article","venue":"Positivity","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Centre de Recherches Mathématiques","keywords":"Monotonic function; Mathematics; Monotone polygon; Operator theory; Potential theory; Banach space; Pure mathematics; Duality (order theory); Regular polygon; Discrete mathematics; Subderivative; Relation (database); Mathematical analysis; Convex optimization; Computer science","score_opus":0.01486627257183556,"score_gpt":0.26197853309583813,"score_spread":0.24711226052400256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040926607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5212093,0.00016067125,0.46944606,0.002494834,0.00013037941,0.00011169419,0.000018312157,0.00010530952,0.0063234316],"genre_scores_gemma":[0.970288,0.000013476934,0.029015506,0.0005580067,0.000035380173,0.0000039992574,0.000008639429,0.0000028697802,0.0000741229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99939257,0.00006152349,0.00009175376,0.00015467015,0.00013177689,0.00016767815],"domain_scores_gemma":[0.99956053,0.00007792452,0.00005144269,0.00014063292,0.000053235424,0.000116248615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025046762,0.000076735814,0.00009985862,0.000047220346,0.00012239002,0.00008446425,0.000108131884,0.000034009045,0.000031505795],"category_scores_gemma":[0.000019801988,0.00007004294,0.00004020636,0.00015749049,0.000017103455,0.0007453911,0.00009684717,0.000055364584,0.00003007257],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027327196,0.00074892957,0.096852,0.000015411328,0.00024253997,0.000009541964,0.002807026,0.0013000633,0.006376331,0.8559266,0.0006349614,0.035059303],"study_design_scores_gemma":[0.00021176971,0.000010634223,0.89117944,0.0000031313882,0.000016698807,0.0000117700365,0.0000032167886,0.10415569,0.003064573,0.0010579617,0.00014211627,0.00014297423],"about_ca_topic_score_codex":0.00012859449,"about_ca_topic_score_gemma":0.0000064526303,"teacher_disagreement_score":0.8548686,"about_ca_system_score_codex":0.000025825246,"about_ca_system_score_gemma":0.000014902453,"threshold_uncertainty_score":0.28562683},"labels":[],"label_agreement":null},{"id":"W2041718604","doi":"10.1007/s10107-013-0667-7","title":"Enhanced Karush–Kuhn–Tucker condition and weaker constraint qualifications","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Subderivative; Mathematics; Lipschitz continuity; Karush–Kuhn–Tucker conditions; Constraint (computer-aided design); Bellman equation; Normality; Function (biology); Initial value problem; Value (mathematics); Applied mathematics; Mathematical economics; Mathematical optimization; Mathematical analysis; Convex optimization; Regular polygon","score_opus":0.01623019121794233,"score_gpt":0.2659731881360277,"score_spread":0.24974299691808538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041718604","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027740977,0.000014396979,0.98772025,0.003395696,0.000026089936,0.00029138077,0.0000010548059,0.000159017,0.0056180144],"genre_scores_gemma":[0.687752,0.0000025752727,0.3116451,0.00022306947,0.000018595792,0.000077095894,0.000010083292,0.0000051560155,0.00026633148],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900866,0.000047950412,0.000300354,0.00024849077,0.00021070015,0.00018384367],"domain_scores_gemma":[0.99923986,0.00017286051,0.00009098763,0.0002337009,0.00014020658,0.00012240572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021483388,0.00010316193,0.00014718514,0.000073616306,0.00015252703,0.000392761,0.00017553783,0.000050411665,0.00064456963],"category_scores_gemma":[0.00011899812,0.00008591607,0.00005030337,0.00028001235,0.000090360336,0.00042841095,0.00006996854,0.000074983414,0.00047034805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.178773e-7,0.00011294484,0.000019031395,0.000026008824,0.000028306265,4.1224766e-7,0.0006212454,0.000036987298,0.000515412,0.9337335,0.0001651011,0.06474071],"study_design_scores_gemma":[0.0005413409,0.00006027566,0.0012017151,0.00006425445,0.000054358276,0.000026741092,0.00060424936,0.68631756,0.0011818012,0.30670387,0.0027588536,0.0004850126],"about_ca_topic_score_codex":0.0000068706763,"about_ca_topic_score_gemma":8.0999445e-7,"teacher_disagreement_score":0.68628055,"about_ca_system_score_codex":0.000017446124,"about_ca_system_score_gemma":0.00001992428,"threshold_uncertainty_score":0.7057586},"labels":[],"label_agreement":null},{"id":"W2041901627","doi":"10.1007/s11228-013-0238-3","title":"Restricted Normal Cones and the Method of Alternating Projections: Applications","year":2013,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Canada Research Chairs; Deutsche Forschungsgemeinschaft; Pacific Institute for the Mathematical Sciences","keywords":"Linear subspace; Convexity; Convex cone; Regular polygon; Cone (formal languages); Generalization; Convex analysis; Mathematics; Simple (philosophy); Convex set; Property (philosophy); Dual cone and polar cone; Subderivative; Convergence (economics); Space (punctuation); Convex optimization; Combinatorics; Mathematical optimization; Pure mathematics; Computer science; Algorithm; Mathematical analysis; Geometry","score_opus":0.013328227314322936,"score_gpt":0.2756673167549808,"score_spread":0.26233908944065787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041901627","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015121907,0.00009553041,0.9939937,0.0034208177,0.000018769551,0.0002633742,0.000016171456,0.00003429202,0.0006451409],"genre_scores_gemma":[0.5849034,0.0000916184,0.41368812,0.0004091943,0.000080211015,0.00024623194,0.000090498754,0.000005552672,0.00048512156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986121,0.00024127601,0.00041159583,0.00029981407,0.00032110035,0.00011411812],"domain_scores_gemma":[0.99835664,0.00056331436,0.0003034632,0.0002400946,0.00047735852,0.000059135415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052890356,0.000109650515,0.00026040798,0.00039398792,0.00034748175,0.0001938145,0.00024923548,0.00004439166,0.00010237837],"category_scores_gemma":[0.00012673519,0.00007532786,0.00012430527,0.0023132581,0.00007563286,0.0004211674,0.00012622788,0.00007795506,0.000005606644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007082142,0.000044324373,0.0059897057,0.000008991067,0.0011865424,8.443744e-8,0.0005623116,0.021480119,0.00007645735,0.967068,0.000044764434,0.0035315799],"study_design_scores_gemma":[0.00047937364,0.00000834501,0.05867196,0.0000021420615,0.00048693307,0.000003359757,0.00007295345,0.9198974,0.0000151195745,0.02017957,0.00009530824,0.00008757144],"about_ca_topic_score_codex":0.0012437138,"about_ca_topic_score_gemma":0.000021939508,"teacher_disagreement_score":0.94688845,"about_ca_system_score_codex":0.000012485707,"about_ca_system_score_gemma":0.000050073522,"threshold_uncertainty_score":0.3071781},"labels":[],"label_agreement":null},{"id":"W2044323687","doi":"10.1016/j.amc.2005.09.008","title":"On strictly semi-monotone (semi-monotone) properties in nonsmooth functions","year":2005,"lang":"en","type":"article","venue":"Applied Mathematics and Computation","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thompson Rivers University","funders":"Natural Sciences and Engineering Research Council of Canada; Thompson Rivers University","keywords":"Monotone polygon; Mathematics; Differentiable function; Bernstein's theorem on monotone functions; Nonlinear complementarity problem; Nonlinear system; Monotonic function; Strongly monotone; Pure mathematics; Applied mathematics; Complementarity (molecular biology); Mathematical analysis; Mixed complementarity problem","score_opus":0.017427157522378292,"score_gpt":0.22797637115266958,"score_spread":0.21054921363029128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044323687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03589496,0.00002550004,0.9565361,0.00084808154,0.00003195055,0.00025917997,0.0000016776507,0.00009294992,0.0063095912],"genre_scores_gemma":[0.89991194,0.000020345078,0.09937427,0.00040554354,0.000031357573,0.00005772229,0.000014454064,0.000009431486,0.00017493824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989839,0.000013100712,0.00033803185,0.00027619622,0.0002409028,0.00014786927],"domain_scores_gemma":[0.999451,0.00011830519,0.00013323256,0.00017409831,0.000066608234,0.00005678676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017794708,0.00014133228,0.00018090308,0.00023471843,0.00013926375,0.00016347422,0.000152159,0.000055006298,0.000013601979],"category_scores_gemma":[0.000016413755,0.00012305302,0.000034093933,0.000487636,0.000020616908,0.00020362524,0.00006572085,0.00009532703,0.000071111994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007333758,0.00043911266,0.000028141401,0.00003006411,0.000025659047,6.151297e-7,0.0014845413,0.38803673,0.00041242174,0.58696425,0.00024378822,0.02232735],"study_design_scores_gemma":[0.00039325826,0.000030734052,0.00041466134,0.000021330397,0.000012472102,0.0000022184288,0.0000991109,0.97663784,0.00024263078,0.021771574,0.00021924246,0.00015489825],"about_ca_topic_score_codex":0.000009429776,"about_ca_topic_score_gemma":0.000012104249,"teacher_disagreement_score":0.864017,"about_ca_system_score_codex":0.000051456456,"about_ca_system_score_gemma":0.00003445195,"threshold_uncertainty_score":0.5017956},"labels":[],"label_agreement":null},{"id":"W2044347753","doi":"10.4153/cmb-2010-089-6","title":"Generalized Solution of the Photon Transport Problem","year":2010,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Semigroup; Generalized function; Cauchy problem; Operator (biology); Regular polygon; Mathematical analysis; Equicontinuity; Pure mathematics; Initial value problem","score_opus":0.00785125637808815,"score_gpt":0.19596950534388116,"score_spread":0.18811824896579302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044347753","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.084899314,0.000015187264,0.753423,0.097892866,0.00035804138,0.00065983535,0.00002772694,0.00009905387,0.06262499],"genre_scores_gemma":[0.8886185,0.0000010234526,0.10793398,0.00095842686,0.00002462123,0.000014865652,0.0000039989313,0.000005841869,0.0024386942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992993,0.00002704481,0.00021087707,0.00013327695,0.00017743811,0.00015209825],"domain_scores_gemma":[0.9993409,0.000032333068,0.00006154839,0.00031588232,0.00008732437,0.00016204224],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002293241,0.00006602422,0.000109526016,0.00006323846,0.00009702966,0.000024025228,0.00046530503,0.000057583984,0.004567992],"category_scores_gemma":[0.000059793772,0.00004600125,0.000090123955,0.00026010018,0.000048106096,0.000032538384,0.000019644822,0.00010449206,0.00036802058],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.9844507e-7,0.000025537274,0.0001303813,0.000015409803,0.000011688684,8.8761175e-7,0.00017161193,0.0001225982,0.000850623,0.996089,0.0023601432,0.00022156462],"study_design_scores_gemma":[0.0010398902,0.000039883103,0.0072855023,0.00007931751,0.000106177285,0.0000466489,0.000024900606,0.45976675,0.0060669794,0.29428935,0.23059626,0.00065833324],"about_ca_topic_score_codex":0.0012308622,"about_ca_topic_score_gemma":0.0030272221,"teacher_disagreement_score":0.8037192,"about_ca_system_score_codex":0.000021606793,"about_ca_system_score_gemma":0.00018564549,"threshold_uncertainty_score":0.99634194},"labels":[],"label_agreement":null},{"id":"W2044811379","doi":"10.1016/j.jat.2008.08.014","title":"Bregman distances and Chebyshev sets","year":2008,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Euclidean space; Hilbert space; Convex set; Chebyshev filter; Closed set; Point (geometry); Regular polygon; Monotone polygon; Set (abstract data type); Euclidean distance; Set function; Euclidean geometry; Subderivative; Bregman divergence; Mathematical analysis; Applied mathematics; Convex optimization; Geometry; Computer science","score_opus":0.011597911930306383,"score_gpt":0.22197759324622707,"score_spread":0.2103796813159207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2044811379","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02113818,0.00022027493,0.97544754,0.0013147396,0.00008163489,0.000027643182,6.001439e-7,0.000014576491,0.0017548326],"genre_scores_gemma":[0.8800286,0.00014610667,0.1192114,0.0003014269,0.000054751188,8.3577294e-7,0.0000011773811,0.0000031351842,0.00025254002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992804,0.0000876841,0.0002622274,0.00007712032,0.00023215,0.000060424307],"domain_scores_gemma":[0.999263,0.000090138055,0.0003075191,0.00009533743,0.00018841366,0.000055573713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005625725,0.00005459629,0.000114257804,0.00012894123,0.00011315622,0.000052179745,0.00020099734,0.000023361472,0.00003129136],"category_scores_gemma":[0.00007374006,0.000041664083,0.000051890693,0.00022056792,0.000040414885,0.00072106195,0.000028977365,0.00006487754,0.000004741714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025270598,0.00008625181,0.0007607734,0.000013181589,0.00006788787,0.000010872037,0.0026814304,0.0017627123,0.00015315747,0.9800167,0.0010094073,0.0134123275],"study_design_scores_gemma":[0.0015707044,0.00019272814,0.03236704,0.00005669377,0.00006283254,0.0010435471,0.000404129,0.36325124,0.0014971514,0.5945805,0.0045925565,0.0003809177],"about_ca_topic_score_codex":4.141835e-7,"about_ca_topic_score_gemma":2.4133288e-7,"teacher_disagreement_score":0.8588905,"about_ca_system_score_codex":0.000016546388,"about_ca_system_score_gemma":0.000042676034,"threshold_uncertainty_score":0.1699012},"labels":[],"label_agreement":null},{"id":"W2045050460","doi":"10.1007/s11228-010-0138-8","title":"Optimal Control of Non-convex Measure-driven Differential Inclusions","year":2010,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Differential inclusion; Measure (data warehouse); Mathematics; Extension (predicate logic); Regular polygon; Differential (mechanical device); Mathematical optimization; Optimal control; Control theory (sociology); Applied mathematics; Computer science; Control (management); Artificial intelligence; Data mining; Engineering; Geometry","score_opus":0.007822943143118505,"score_gpt":0.2389375222410473,"score_spread":0.2311145790979288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045050460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037843734,0.000011506136,0.96006787,0.0013662311,0.00014915974,0.000101130536,0.000082392304,0.000040942134,0.00033704189],"genre_scores_gemma":[0.9098931,0.0000061693677,0.08947879,0.0002017321,0.000113189555,0.000011942193,0.00012931827,0.000006397959,0.000159392],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998073,0.00011253316,0.0004972002,0.00044721624,0.0006694045,0.00020064769],"domain_scores_gemma":[0.9983957,0.00019166962,0.00030599308,0.00038407583,0.00055282714,0.00016978156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039965435,0.00018792141,0.00047552466,0.00060952787,0.00032727455,0.00012617654,0.00048440913,0.00012618076,0.0006372983],"category_scores_gemma":[0.00012902803,0.00016159339,0.00034184856,0.0016634008,0.00006735256,0.00034973843,0.00019234714,0.00019244257,0.000013642363],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006261838,0.0005166856,0.050507557,0.000017905983,0.0060399994,0.0000034064096,0.0014066574,0.21188192,0.018317387,0.7094956,0.00016601276,0.0015842628],"study_design_scores_gemma":[0.0007013447,0.000021988417,0.12302775,0.000002663034,0.00091508095,0.0000015769151,0.000011311754,0.8740381,0.000081506754,0.0009857609,0.00004881059,0.00016407389],"about_ca_topic_score_codex":0.0001322988,"about_ca_topic_score_gemma":0.000057272762,"teacher_disagreement_score":0.87204933,"about_ca_system_score_codex":0.00001657745,"about_ca_system_score_gemma":0.00011640692,"threshold_uncertainty_score":0.69779694},"labels":[],"label_agreement":null},{"id":"W2049720388","doi":"10.2316/journal.201.2012.4.201-2375","title":"SINGULAR WEAK OPTIMAL CONTROLS","year":2012,"lang":"en","type":"article","venue":"Control and Intelligent Systems","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Maxima and minima; Optimal control; Mathematics; Control (management); Mathematical optimization; Applied mathematics; Control theory (sociology); Mathematical economics; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.014523148422249745,"score_gpt":0.23431259314137115,"score_spread":0.2197894447191214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049720388","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077076955,0.004056767,0.9912042,0.0006236152,0.00063930394,0.0001880271,0.000002821825,0.00007592904,0.0024385534],"genre_scores_gemma":[0.9954019,0.000057865534,0.0027577174,0.00034210758,0.00028307806,0.000025453739,0.0000036570073,0.000005755492,0.0011224473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894726,0.000104091574,0.00029438367,0.0001885627,0.00020579355,0.0002598879],"domain_scores_gemma":[0.99926656,0.0001023803,0.00010705973,0.00021921154,0.000120406,0.00018436695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045646325,0.000120706165,0.00023692434,0.00009288198,0.00012041116,0.00023515159,0.00022298966,0.000053625034,0.000029810812],"category_scores_gemma":[0.00005023626,0.00009524477,0.00007581126,0.0001554142,0.000022116737,0.00046325315,0.00004296166,0.000057882986,0.000121709716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018378074,0.0001470389,0.0075862557,0.000023696091,0.00026817416,0.0000015055214,0.0005615663,0.0132220145,0.0007380567,0.9686115,0.0012323405,0.0075894673],"study_design_scores_gemma":[0.0004546305,0.000035954632,0.0011986083,0.000012927072,0.00003617083,0.000017331362,0.00007159145,0.9359119,0.000068661284,0.00008125505,0.061947852,0.00016312364],"about_ca_topic_score_codex":0.00003622387,"about_ca_topic_score_gemma":3.5833156e-7,"teacher_disagreement_score":0.9946312,"about_ca_system_score_codex":0.000024528379,"about_ca_system_score_gemma":0.000017079981,"threshold_uncertainty_score":0.38839692},"labels":[],"label_agreement":null},{"id":"W2049872721","doi":"10.1016/j.camwa.2003.10.005","title":"Nonsmooth nonconvex global optimization in a Banach space with a basis","year":2004,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Banach space; Mathematics; Descent (aeronautics); Monotonic function; Set (abstract data type); Space (punctuation); Compact space; Class (philosophy); Mathematical optimization; Applied mathematics; Basis (linear algebra); Optimization problem; Mathematical analysis; Computer science; Geometry","score_opus":0.006972570524313055,"score_gpt":0.22293061429468083,"score_spread":0.21595804377036779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049872721","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024159416,0.000016807437,0.99262035,0.0037842093,0.00001628198,0.00058745506,0.0000061579094,0.00018190591,0.0025452108],"genre_scores_gemma":[0.08228952,0.000011970142,0.91701907,0.00032345048,0.000023348626,0.0002552663,0.00002628361,0.000013966308,0.00003715662],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857813,0.000023262488,0.00032637018,0.00045720174,0.00036877554,0.00024622979],"domain_scores_gemma":[0.9986803,0.00007699873,0.00021613885,0.000675119,0.00021793615,0.00013353326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014100595,0.00021274848,0.00025624863,0.00019234163,0.00015681765,0.0002138161,0.00065432605,0.000057480007,0.000013096806],"category_scores_gemma":[0.0000081246535,0.00017162447,0.000048173286,0.002444206,0.00006154074,0.00037836476,0.00010334001,0.00009606417,0.00003832551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031436596,0.00027497613,0.00034784185,0.0000189683,0.00003228901,0.0000027600202,0.00034173435,0.69535714,8.516915e-7,0.30286175,0.000028133254,0.0007304116],"study_design_scores_gemma":[0.0011451415,0.00007076449,0.0007599638,0.00008037969,0.00003990716,0.000035223627,0.000072724906,0.9872279,0.000023764751,0.009954841,0.00029167236,0.00029769208],"about_ca_topic_score_codex":0.000042742882,"about_ca_topic_score_gemma":0.00010059782,"teacher_disagreement_score":0.2929069,"about_ca_system_score_codex":0.00022125774,"about_ca_system_score_gemma":0.00024747723,"threshold_uncertainty_score":0.69986427},"labels":[],"label_agreement":null},{"id":"W2050566041","doi":"10.1016/j.aml.2007.12.034","title":"An existence theorem for nonlinear complementarity problems","year":2008,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Nonlinear complementarity problem; Complementarity (molecular biology); Mixed complementarity problem; Bounded function; Nonlinear system; Operator (biology); Complementarity theory; Pure mathematics; Mathematical analysis; Applied mathematics","score_opus":0.03866968300313399,"score_gpt":0.2598319978385568,"score_spread":0.2211623148354228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050566041","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062448774,0.0000016846803,0.9900793,0.0021014737,0.000034086668,0.00034135822,0.000010155624,0.00012065031,0.0010664045],"genre_scores_gemma":[0.06252098,0.0000028671577,0.93388844,0.0033642587,0.000049196773,0.00008037698,0.000054621458,0.000010279684,0.000029004079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903184,0.000009945283,0.00026660197,0.0002632847,0.00024318286,0.00018512177],"domain_scores_gemma":[0.9992015,0.00011011319,0.00013050127,0.00042923933,0.0000615576,0.00006710049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000242361,0.00011773266,0.00016376658,0.0000649642,0.00024263572,0.00007254673,0.0005863899,0.000024663774,0.000026217735],"category_scores_gemma":[0.00000922669,0.000104816005,0.00006209339,0.00021669244,0.000049514452,0.00018536841,0.000059288905,0.000051346895,0.000028083396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023036862,0.00025601158,0.00003522211,0.000043940185,0.0000392178,0.0000010278718,0.002260963,0.00559278,0.00505922,0.98507375,0.0013277321,0.00030783095],"study_design_scores_gemma":[0.00050494075,0.000030790972,0.000075574884,0.0000065305057,0.000021054842,0.00000953592,0.000066276836,0.9595298,0.0012635608,0.03640983,0.0018276402,0.00025445226],"about_ca_topic_score_codex":0.0000054418038,"about_ca_topic_score_gemma":0.0000035014095,"teacher_disagreement_score":0.95393705,"about_ca_system_score_codex":0.000026206826,"about_ca_system_score_gemma":0.000022199776,"threshold_uncertainty_score":0.42742726},"labels":[],"label_agreement":null},{"id":"W2050784893","doi":"10.4153/cmb-2014-026-x","title":"Approximate Fixed Point Sequences of Nonlinear Semigroups in Metric Spaces","year":2014,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fixed point; Metric space; Sequence (biology); Nonlinear system; Discrete mathematics; Fixed-point theorem; Set (abstract data type); Metric (unit); Complete metric space; Pure mathematics; Combinatorics; Mathematical analysis; Computer science","score_opus":0.009326545991067458,"score_gpt":0.21209596822941176,"score_spread":0.2027694222383443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050784893","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017599903,0.00005819003,0.9373414,0.024600897,0.0000566401,0.00019648511,0.000011029992,0.000055447366,0.020080043],"genre_scores_gemma":[0.7486348,0.0000057379493,0.25004917,0.0007454871,0.000025555531,0.000010930118,0.000006973152,0.0000075174676,0.00051379454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989328,0.00008623851,0.00032357904,0.0002143748,0.00021458445,0.00022847384],"domain_scores_gemma":[0.9990625,0.00026523048,0.00009027383,0.00026810597,0.00008235405,0.00023157366],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00062160334,0.00009893921,0.00023882036,0.00042455553,0.0000417902,0.0000740672,0.00043740607,0.000058293364,0.0018717622],"category_scores_gemma":[0.0005518328,0.000085367246,0.00006156247,0.0007950341,0.000042520987,0.00006305921,0.000044065124,0.000079043624,0.0007112717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000020352718,0.0001037522,0.00045731518,0.00012481384,0.000025164702,0.000010505083,0.0006839146,0.0048179426,0.00009760936,0.9903694,0.0018437792,0.0014637827],"study_design_scores_gemma":[0.00024681722,0.000035359557,0.00039454966,0.000055967594,0.000011958292,0.0000072338053,0.000069992384,0.95797217,0.00035551205,0.033498663,0.0071411217,0.00021063864],"about_ca_topic_score_codex":0.0014086788,"about_ca_topic_score_gemma":0.00088370487,"teacher_disagreement_score":0.95687073,"about_ca_system_score_codex":0.000061483894,"about_ca_system_score_gemma":0.000111001806,"threshold_uncertainty_score":0.99904066},"labels":[],"label_agreement":null},{"id":"W2052532393","doi":"10.1017/s0004972709001063","title":"A NEW PROOF OF THE AMENABILITY OF<i>C</i>(<i>X</i>)","year":2010,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Constructive proof; Constructive; Pure mathematics; Space (punctuation); Discrete mathematics; Algebra over a field; Computer science","score_opus":0.012547923759760176,"score_gpt":0.23733533559214198,"score_spread":0.2247874118323818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052532393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07585005,0.000010097841,0.7217667,0.19497707,0.00048244136,0.0011448679,0.000029176676,0.00006354907,0.005676015],"genre_scores_gemma":[0.6622542,5.939391e-7,0.33078638,0.00027614777,0.000028609604,0.000004563475,2.8925913e-7,0.0000052499217,0.0066439784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882716,0.00006373571,0.0004200312,0.00015176614,0.00042029165,0.000117022624],"domain_scores_gemma":[0.9984951,0.00016410748,0.00033951682,0.0008027857,0.0001463235,0.000052139767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004420834,0.00008769987,0.00021579691,0.00000725066,0.000060344537,0.000016248185,0.0012316485,0.00007564905,0.00090427464],"category_scores_gemma":[0.00029243212,0.000046357953,0.00052284106,0.00034588136,0.00020867618,0.000025551166,0.00031432064,0.00017159781,0.0000073391534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064393826,0.00075420924,0.0032137432,0.00047683128,0.00024481417,5.224207e-8,0.0028059564,0.0015063265,0.012137456,0.851991,0.1258335,0.0010296989],"study_design_scores_gemma":[0.0015510191,0.00011440498,0.042611208,0.00030018756,0.0003852615,0.000014730073,0.0003159536,0.039453276,0.30716684,0.56572837,0.041758295,0.0006004183],"about_ca_topic_score_codex":0.000045418663,"about_ca_topic_score_gemma":0.0000015736731,"teacher_disagreement_score":0.58640414,"about_ca_system_score_codex":0.000009078978,"about_ca_system_score_gemma":0.00008311322,"threshold_uncertainty_score":0.9901173},"labels":[],"label_agreement":null},{"id":"W2052741439","doi":"10.1007/s10898-008-9395-6","title":"Towards global bilevel dynamic optimization","year":2009,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"National Science Foundation","keywords":"Bilevel optimization; Mathematical optimization; Mathematics; Optimization problem; Global optimization","score_opus":0.007580607459892368,"score_gpt":0.2645765146161052,"score_spread":0.25699590715621284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052741439","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012872762,0.00014450283,0.98703367,0.0086899195,0.00047570272,0.0000938985,0.000013304819,0.00007340112,0.0033468776],"genre_scores_gemma":[0.21847181,0.00017726867,0.77995276,0.0012480784,0.00009040917,7.040827e-7,0.000019314828,0.000004472652,0.000035205332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978532,0.000111553054,0.00079962215,0.0002548994,0.0007410596,0.00023962872],"domain_scores_gemma":[0.9975339,0.0000178409,0.0008063226,0.0002723089,0.0011723414,0.00019725566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003926555,0.00020340715,0.00031754022,0.00013035387,0.00013872248,0.0003299634,0.00075377146,0.00012741474,0.00009481274],"category_scores_gemma":[0.00019903929,0.0001805842,0.0002225894,0.0020423997,0.000022401713,0.0017158402,0.00006157891,0.00010274733,0.000009618542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023489458,0.00014070768,0.0002753218,0.0000020442953,0.000043071403,0.000008896985,0.000020296035,0.95683813,0.0000027690776,0.030624704,0.000523298,0.011497258],"study_design_scores_gemma":[0.0007006032,0.00020978424,0.0052229734,0.000021115158,0.000055715704,0.0001384913,0.000009465789,0.9882883,0.000004672071,0.0050217737,0.00014299378,0.000184148],"about_ca_topic_score_codex":0.0000069294138,"about_ca_topic_score_gemma":0.0000024731035,"teacher_disagreement_score":0.21834308,"about_ca_system_score_codex":0.0006320207,"about_ca_system_score_gemma":0.00038097106,"threshold_uncertainty_score":0.736401},"labels":[],"label_agreement":null},{"id":"W2055388930","doi":"10.1016/j.ejor.2004.07.076","title":"A smoothing heuristic for a bilevel pricing problem","year":2005,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal; Université de Sherbrooke","funders":"","keywords":"Mathematical optimization; Bilevel optimization; Smoothing; Computer science; Heuristic; Point (geometry); Class (philosophy); Set (abstract data type); Scale (ratio); Algorithm; Mathematics; Optimization problem; Artificial intelligence","score_opus":0.10081635464685444,"score_gpt":0.3689721968451751,"score_spread":0.26815584219832067,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055388930","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009302385,0.00009036635,0.9791988,0.014682652,0.000056061686,0.00012783252,0.0000023576433,0.00001118829,0.0049004667],"genre_scores_gemma":[0.4765346,0.000017361313,0.52136457,0.00037538155,0.0005025078,0.0000030526105,0.0000028642162,0.000010032708,0.0011896405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976926,0.0005275437,0.00050417625,0.000167908,0.0008985965,0.00020920034],"domain_scores_gemma":[0.9974472,0.00045608322,0.00014416542,0.00013935505,0.0016861268,0.00012708512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0062330794,0.00007189397,0.00011856626,0.0004356606,0.00037553554,0.00047977973,0.0007085747,0.000012418469,0.000075641256],"category_scores_gemma":[0.0008058017,0.000057205583,0.00009311961,0.00054042676,0.000029420737,0.00079210236,0.00012348156,0.0002512416,0.000055034907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008431906,0.00041287302,0.00023067708,0.000036011563,0.00017470322,0.0000589607,0.0036972067,0.37599254,0.0031990241,0.5133144,0.024179906,0.078619316],"study_design_scores_gemma":[0.0012075666,0.00039752788,0.0022158718,0.0000800608,0.000011098578,0.00011153845,0.000058459504,0.9098478,0.00033062816,0.0024958279,0.08307256,0.00017105513],"about_ca_topic_score_codex":0.000001525241,"about_ca_topic_score_gemma":0.0000011025704,"teacher_disagreement_score":0.53385526,"about_ca_system_score_codex":0.00009447014,"about_ca_system_score_gemma":0.00036849335,"threshold_uncertainty_score":0.46265268},"labels":[],"label_agreement":null},{"id":"W2057794519","doi":"10.1109/tac.2007.904451","title":"On the Hybrid Optimal Control Problem: Theory and Algorithms","year":2007,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":345,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Controllability; Optimal control; Bounded function; Hamiltonian (control theory); Mathematical optimization; Convergence (economics); Hamiltonian system; Maximum principle; Variational principle; Control theory (sociology); Computer science; Applied mathematics; Control (management)","score_opus":0.006890618028156842,"score_gpt":0.2236150882270187,"score_spread":0.21672447019886185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057794519","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015911884,0.00001729983,0.99197125,0.0049538747,0.00017958716,0.00046744838,0.000017491917,0.00023317503,0.00056869275],"genre_scores_gemma":[0.9819999,0.0000050670637,0.013978039,0.0034660602,0.000026368467,0.00006689169,6.575763e-7,0.000011117998,0.00044590756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841696,0.00027017965,0.00036026852,0.00030996735,0.0003790198,0.00026361557],"domain_scores_gemma":[0.9966677,0.0026087041,0.00012256377,0.00038893922,0.00009968311,0.000112419235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017422186,0.00018325742,0.0002337984,0.00020109641,0.000391352,0.00017957996,0.00035080707,0.00004616543,0.00026593084],"category_scores_gemma":[0.000036403508,0.00012369112,0.00013593314,0.00031755058,0.000066309185,0.00020721211,0.0000015211064,0.00016081276,0.00008836105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002106877,0.0007659719,0.0000079912115,0.000023499859,0.0008547765,0.000026842336,0.00093049736,0.31997076,0.00038188483,0.38035667,0.00044928797,0.29602113],"study_design_scores_gemma":[0.0016288237,0.00012950278,0.00019870128,0.000016991553,0.0000893892,0.0000184786,0.000027780468,0.99211735,0.0003826057,0.005147069,0.000090366746,0.00015295947],"about_ca_topic_score_codex":0.000009343193,"about_ca_topic_score_gemma":0.0000058902106,"teacher_disagreement_score":0.9804087,"about_ca_system_score_codex":0.00004615068,"about_ca_system_score_gemma":0.000049522503,"threshold_uncertainty_score":0.50439775},"labels":[],"label_agreement":null},{"id":"W2057989617","doi":"10.1016/s0895-7177(02)00110-3","title":"A fixed-point theorem and applications to problems on sets with convex sections and to Nash equilibria","year":2002,"lang":"en","type":"article","venue":"Mathematical and Computer Modelling","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Kakutani fixed-point theorem; Fixed-point theorem; Mathematics; Intersection (aeronautics); Brouwer fixed-point theorem; Danskin's theorem; Intersection theorem; Regular polygon; Fixed point; Nash equilibrium; Point (geometry); Pure mathematics; Schauder fixed point theorem; Mathematical economics; Mathematical analysis","score_opus":0.028362369285422174,"score_gpt":0.22147387498799273,"score_spread":0.19311150570257055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057989617","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0084147,0.000020185142,0.98759407,0.002862264,0.000009757062,0.00030909,0.0000021204735,0.00007342501,0.0007144052],"genre_scores_gemma":[0.38337323,0.000014890886,0.61484075,0.0013911312,0.000050362883,0.000094771094,0.0000015132248,0.000010111357,0.00022327853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991575,0.000022251501,0.000172973,0.00035555742,0.00015035173,0.00014136384],"domain_scores_gemma":[0.99939626,0.00012149483,0.000030432366,0.00019207603,0.000059640206,0.00020011529],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001139582,0.000120954224,0.00016646058,0.00010259338,0.00017246016,0.00027242408,0.000121744786,0.000029476105,0.000016084561],"category_scores_gemma":[0.0000029041726,0.000089711975,0.000018458562,0.00028095208,0.000026674506,0.00013477742,0.00015022392,0.00006253774,0.000029445915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028509614,0.00009114917,0.000013648788,0.000037429207,0.000025302756,7.0604983e-7,0.0018338183,0.23609978,0.000007821053,0.75634897,0.00007644579,0.0054620807],"study_design_scores_gemma":[0.00013000732,0.000106776955,0.000013713586,0.00004628928,0.000010968146,0.00002058634,0.000010571312,0.94882935,0.000008923102,0.050396495,0.00030077784,0.0001255219],"about_ca_topic_score_codex":0.000002308704,"about_ca_topic_score_gemma":0.0000010146106,"teacher_disagreement_score":0.7127296,"about_ca_system_score_codex":0.000008134515,"about_ca_system_score_gemma":0.000004302492,"threshold_uncertainty_score":0.36583483},"labels":[],"label_agreement":null},{"id":"W2058111582","doi":"10.1109/cdc.2013.6760474","title":"The Hybrid Minimum Principle in the presence of switching costs","year":2013,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Optimal control; Hybrid system; Hamiltonian (control theory); Control theory (sociology); Key (lock); Hybrid automaton; Mathematical optimization; State (computer science); Computer science; Process (computing); Control (management); Cost control; Mathematics; Algorithm","score_opus":0.010578432542674161,"score_gpt":0.24584622475903617,"score_spread":0.23526779221636202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058111582","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061098497,0.000033327568,0.90399873,0.01915057,0.00008523505,0.00024596998,3.458459e-7,0.00002499703,0.015362307],"genre_scores_gemma":[0.9904748,0.000009673577,0.008402583,0.0004508501,0.000009388436,0.000013914439,4.0418072e-7,0.0000010145627,0.0006373341],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993927,0.00007499678,0.00014975278,0.000095281444,0.00020267653,0.00008462992],"domain_scores_gemma":[0.99916804,0.00039807346,0.00005555874,0.00028612756,0.00007715236,0.00001503178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036946364,0.00003586787,0.000045095632,0.00002955221,0.00008805635,0.00013732827,0.000756197,0.000007313108,0.00003863098],"category_scores_gemma":[0.00010608098,0.000016733267,0.00002715643,0.00029117154,0.000012314304,0.00025997215,0.000106071006,0.00004259779,0.00003115726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014617822,0.0000811081,0.005611248,0.0000030730873,0.00001777527,8.41125e-7,0.0011326214,0.007860027,0.00030732353,0.96810955,0.0029655178,0.0139094405],"study_design_scores_gemma":[0.00006143508,0.0000068615664,0.018085267,0.0000025520567,0.0000012272833,0.0000012408996,0.00007622617,0.97702265,0.00020364537,0.0034807785,0.0010255511,0.0000325552],"about_ca_topic_score_codex":0.0002529482,"about_ca_topic_score_gemma":0.00005760557,"teacher_disagreement_score":0.96916264,"about_ca_system_score_codex":0.000008770963,"about_ca_system_score_gemma":0.000023654824,"threshold_uncertainty_score":0.14052148},"labels":[],"label_agreement":null},{"id":"W2059019115","doi":"10.1016/j.na.2008.07.041","title":"Fixed point properties for semigroup of nonexpansive mappings on Fréchet spaces","year":2008,"lang":"en","type":"article","venue":"Nonlinear Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Semigroup; Mathematics; Fixed point; Pure mathematics; Property (philosophy); Fréchet space; Point (geometry); Discrete mathematics; Mathematical analysis; Functional analysis; Interpolation space; Geometry; Philosophy","score_opus":0.030610714910699083,"score_gpt":0.24085735797965216,"score_spread":0.21024664306895308,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059019115","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064250305,0.00005525736,0.93195546,0.0028616376,0.000043055185,0.00015948081,0.000043010525,0.00007007621,0.0005617269],"genre_scores_gemma":[0.76322436,0.0000478365,0.23229125,0.0007406264,0.00008899242,0.000026989781,0.00009053009,0.000010284011,0.0034791173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987644,0.000044755365,0.00034009878,0.0003426293,0.0003488109,0.00015929963],"domain_scores_gemma":[0.99873596,0.00010062468,0.00021292244,0.00039680794,0.000489018,0.000064685926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018446057,0.00013543568,0.00038267724,0.0005177869,0.00015108491,0.000043479227,0.00037977123,0.000057828503,0.000065713364],"category_scores_gemma":[0.000111568545,0.0001075664,0.00045444566,0.0018095563,0.000047610243,0.00021990245,0.00006245235,0.00005855701,0.000019104826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031294595,0.002338883,0.026350252,0.0002167929,0.015115804,0.000023363586,0.01927276,0.8777409,0.012943283,0.035840943,0.006784658,0.003059416],"study_design_scores_gemma":[0.00028647797,0.00008573888,0.0013158716,0.000008580918,0.0003096506,0.0000012972589,0.000111270376,0.98923033,0.006874376,0.00009232693,0.0015241739,0.00015992112],"about_ca_topic_score_codex":0.00010974287,"about_ca_topic_score_gemma":0.000037655707,"teacher_disagreement_score":0.6996642,"about_ca_system_score_codex":0.000026876634,"about_ca_system_score_gemma":0.00006269494,"threshold_uncertainty_score":0.43864304},"labels":[],"label_agreement":null},{"id":"W2059083091","doi":"10.1007/s10957-014-0659-7","title":"On the Finite Convergence of a Projected Cutter Method","year":2014,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Subgradient method; Convergence (economics); Regular polygon; Mathematics; Projection (relational algebra); Point (geometry); Limiting; Set (abstract data type); Mathematical optimization; Fixed point; Variational inequality; Applied mathematics; Finite set; Computer science; Algorithm; Mathematical analysis; Geometry; Engineering; Economics","score_opus":0.008663999138381527,"score_gpt":0.2577945133223376,"score_spread":0.24913051418395607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059083091","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00008161038,0.000016461656,0.99650985,0.002314543,0.000025464436,0.00010457274,0.000001618847,0.0000090618805,0.0009368178],"genre_scores_gemma":[0.42977598,0.000111643894,0.56742114,0.002149906,0.000094536656,0.000035001744,0.000005003418,0.000008492951,0.00039830143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990074,0.00034830385,0.0003254216,0.000098851,0.00016498985,0.00005501986],"domain_scores_gemma":[0.9975241,0.0013854995,0.00045664722,0.00020143641,0.0003937973,0.000038516428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013310807,0.00006258313,0.00011952488,0.00012846793,0.000126403,0.000045378485,0.00031263687,0.000028643313,0.00010307439],"category_scores_gemma":[0.00032057916,0.00003970405,0.000057597063,0.00052822614,0.000040182436,0.00018568875,0.000032571686,0.00007954361,0.0000029938426],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008062085,0.00003282923,0.00001382817,0.0000023501825,0.000019017429,3.0617002e-8,0.000104525585,0.3623118,0.000031467378,0.63599646,0.000072543895,0.0014070692],"study_design_scores_gemma":[0.00019094127,0.000059032503,0.00010828334,0.000012019543,0.000033591252,0.0000075635426,0.000035989437,0.90544343,0.00056580856,0.09218461,0.0012988223,0.00005993611],"about_ca_topic_score_codex":4.5689302e-7,"about_ca_topic_score_gemma":7.0509046e-8,"teacher_disagreement_score":0.54381186,"about_ca_system_score_codex":0.000006431329,"about_ca_system_score_gemma":0.00003529787,"threshold_uncertainty_score":0.16190842},"labels":[],"label_agreement":null},{"id":"W2059147749","doi":"10.1007/s11590-008-0083-8","title":"Regular exceptional family of elements with respect to isotone projection cones in Hilbert spaces and complementarity problems","year":2008,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Hilbert space; Complementarity (molecular biology); Cone (formal languages); Pure mathematics; Rigged Hilbert space; Projection (relational algebra); Mathematical analysis; Reproducing kernel Hilbert space; Algorithm","score_opus":0.0203606626991976,"score_gpt":0.23197117013080876,"score_spread":0.21161050743161117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059147749","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10995353,0.000009545336,0.8808051,0.008644335,0.000032054697,0.00036984,0.0000056404283,0.000032215357,0.00014776296],"genre_scores_gemma":[0.3500615,0.000049140148,0.64704245,0.0025428962,0.000024688932,0.000056904883,0.00008188216,0.0000105209865,0.00013000115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876577,0.00007692979,0.00033674217,0.0003212546,0.00035967014,0.00013962199],"domain_scores_gemma":[0.9994389,0.000029439003,0.00016653129,0.00016680667,0.00014628703,0.000052065076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020167403,0.000115462775,0.00016804859,0.00035689335,0.00012313641,0.00005198137,0.00015364829,0.000025399655,0.00004562771],"category_scores_gemma":[0.000015791044,0.000106863445,0.00002297724,0.0008899721,0.000054552936,0.0004722243,0.00006492041,0.000049809565,0.000002170765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029794786,0.000093134484,0.051331002,0.0000116320025,0.00003309427,0.0000020991265,0.0008889363,0.94337314,0.0009981034,0.002437071,0.0006971532,0.00010483983],"study_design_scores_gemma":[0.0014071497,0.00016050591,0.105630085,0.000044626195,0.000014829452,0.000015110717,0.00007952589,0.8912841,0.00023424937,0.000053958716,0.0008141309,0.0002617241],"about_ca_topic_score_codex":0.00027626735,"about_ca_topic_score_gemma":0.00010123315,"teacher_disagreement_score":0.24010797,"about_ca_system_score_codex":0.00006258069,"about_ca_system_score_gemma":0.00004391021,"threshold_uncertainty_score":0.43577647},"labels":[],"label_agreement":null},{"id":"W2059189829","doi":"10.1137/090759690","title":"A Note on the Paper by Eckstein and Svaiter on “General Projective Splitting Methods for Sums of Maximal Monotone Operators”","year":2009,"lang":"en","type":"article","venue":"SIAM Journal on Control and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Hilbert space; Pure mathematics; Zero (linguistics); Space (punctuation); Discrete mathematics; Combinatorics; Computer science","score_opus":0.009259546406006148,"score_gpt":0.2864467351643812,"score_spread":0.27718718875837506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059189829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002136453,0.00009355206,0.9857833,0.011312597,0.00006724667,0.0003146128,0.0000081910985,0.000012669299,0.00027140533],"genre_scores_gemma":[0.53035545,0.00018515313,0.459759,0.009222536,0.00018543222,0.00002425481,0.000009665054,0.000013254791,0.0002452468],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988434,0.0002682593,0.0003165771,0.00023755313,0.00018621302,0.00014799676],"domain_scores_gemma":[0.9989489,0.00036875982,0.00024127297,0.0001225112,0.00024650476,0.00007210342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008496347,0.00014339738,0.00022039076,0.00013249437,0.00029512373,0.00024164453,0.00014305678,0.00006180807,0.000012572358],"category_scores_gemma":[0.0001930324,0.000089338595,0.00007697945,0.00021093815,0.000022040758,0.0003233488,0.000013983228,0.00014209203,4.5934428e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005455543,0.00018229283,0.00006620854,0.000005748345,0.000114753806,0.0000011776619,0.00060831796,0.8353104,0.0036467463,0.10006549,0.0003346677,0.05911867],"study_design_scores_gemma":[0.001538466,0.00075297244,0.00041768048,0.000026685766,0.000031063733,0.0000061889464,0.00001533244,0.99477243,0.0007327876,0.0012349942,0.0003606826,0.000110688554],"about_ca_topic_score_codex":0.0000024181297,"about_ca_topic_score_gemma":3.6593482e-7,"teacher_disagreement_score":0.528219,"about_ca_system_score_codex":0.000030284818,"about_ca_system_score_gemma":0.000036030575,"threshold_uncertainty_score":0.36431223},"labels":[],"label_agreement":null},{"id":"W2059414464","doi":"10.1007/s11117-007-2141-3","title":"Generalized bi-quasi-variational inequalities for quasi-pseudo-monotone type I operators on compact sets","year":2008,"lang":"en","type":"article","venue":"Positivity","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Monotone polygon; Hausdorff space; Type (biology); Pure mathematics; Class (philosophy); Operator theory; Variational inequality; Compact space; Minimax; Regular polygon; Hausdorff distance; Discrete mathematics; Mathematical analysis; Mathematical optimization; Computer science","score_opus":0.045511635467265235,"score_gpt":0.2981626255774477,"score_spread":0.2526509901101825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059414464","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09882581,0.00002671182,0.89559144,0.0040157423,0.00031196725,0.00025131786,0.000090645175,0.00014805475,0.0007383152],"genre_scores_gemma":[0.9520894,0.000015591742,0.045404375,0.0015486014,0.0001278263,0.000019521967,0.00013709425,0.000011428605,0.0006461416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853164,0.0002539265,0.0002679719,0.00035645204,0.00036471276,0.00022531989],"domain_scores_gemma":[0.99876165,0.00038430275,0.000119534154,0.0002940717,0.00032850282,0.00011191024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041367323,0.00017034326,0.00026331382,0.000160759,0.0004139375,0.00011668021,0.00029043815,0.00006780342,0.00006857355],"category_scores_gemma":[0.00016299063,0.00015622888,0.00012696708,0.0005024616,0.000034858593,0.0004421554,0.0000504632,0.00008085376,0.000065753564],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010187215,0.00087996013,0.0058552986,0.000012182438,0.0001627092,0.0000073198944,0.0010940231,0.021063475,0.00061457214,0.9660805,0.0036650654,0.00046306],"study_design_scores_gemma":[0.0009350273,0.00028113395,0.037270244,0.000009541511,0.000022494092,0.000013913369,0.00000898859,0.9555397,0.0012561065,0.0033532125,0.0009873505,0.0003222766],"about_ca_topic_score_codex":0.0002289434,"about_ca_topic_score_gemma":0.000016926417,"teacher_disagreement_score":0.96272725,"about_ca_system_score_codex":0.0000857408,"about_ca_system_score_gemma":0.00017615233,"threshold_uncertainty_score":0.6370829},"labels":[],"label_agreement":null},{"id":"W205960364","doi":"10.1007/978-3-319-48311-5","title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","year":2017,"lang":"en","type":"book","venue":"CMS books in mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3471,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Monotone polygon; Hilbert space; Regular polygon; Pure mathematics; Operator (biology); Convex analysis; Algebra over a field; Convex optimization; Geometry","score_opus":0.014952365416201752,"score_gpt":0.25445409338388675,"score_spread":0.23950172796768499,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W205960364","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016688101,0.00062180014,0.5540542,0.00075958687,0.00012470968,0.00045898958,0.000019117748,0.000072077455,0.44372264],"genre_scores_gemma":[0.0029559475,0.00030843265,0.090403594,0.0003325676,0.0000582774,0.000045472712,0.00004461976,0.00003605637,0.905815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840504,0.00007554037,0.0005452674,0.00046093712,0.00031880764,0.00019443638],"domain_scores_gemma":[0.9981877,0.00029984664,0.00041474632,0.0009212414,0.00009754568,0.000078875084],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008428974,0.0002783034,0.0007977776,0.0008803697,0.00009762472,0.000458026,0.0008945454,0.00023602,0.00008603192],"category_scores_gemma":[0.00014183905,0.0002498158,0.00014650848,0.00025719454,0.00010970993,0.00025617276,0.00033394582,0.0002597594,0.000031606545],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024208625,0.00007476984,0.00047655695,0.00010057475,0.00041313982,0.0000231228,0.0022043856,0.0009800391,0.0000018259607,0.9941682,0.0008183704,0.00073656323],"study_design_scores_gemma":[0.0004223295,0.000017559385,0.00041729675,0.0002355805,0.0003844953,0.0000055614546,0.00004942856,0.5303082,0.000015751983,0.4621848,0.0054116915,0.0005473395],"about_ca_topic_score_codex":0.000016902892,"about_ca_topic_score_gemma":0.00013254727,"teacher_disagreement_score":0.53198344,"about_ca_system_score_codex":0.0001161248,"about_ca_system_score_gemma":0.00022265648,"threshold_uncertainty_score":0.9999954},"labels":[],"label_agreement":null},{"id":"W2060336998","doi":"10.1016/j.na.2007.08.059","title":"An explicit example of a maximal 3-cyclically monotone operator with bizarre properties","year":2007,"lang":"en","type":"article","venue":"Nonlinear Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Operator (biology); Pure mathematics; Combinatorics; Discrete mathematics; Genetics; Biology; Geometry","score_opus":0.01973346162009835,"score_gpt":0.2530343861930565,"score_spread":0.23330092457295817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060336998","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27489236,0.000021556583,0.7245313,0.00024621442,0.0000089800305,0.00006381955,0.000007209958,0.000058885395,0.00016970729],"genre_scores_gemma":[0.7516339,0.000005542887,0.24774992,0.00027400078,0.000045793575,0.0000055729115,0.00003060616,0.0000081008675,0.00024658872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984176,0.000054636905,0.000411391,0.0004286339,0.000468099,0.00021962635],"domain_scores_gemma":[0.9985412,0.000036479047,0.0001521571,0.00065435655,0.00045949122,0.00015631606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004530076,0.00014859265,0.0003587248,0.00054718007,0.00010738992,0.00010880148,0.0005742036,0.00005936163,0.000117789365],"category_scores_gemma":[0.000021477787,0.00010595356,0.00017548114,0.0033845943,0.00003782849,0.00059798267,0.00006802412,0.00007765455,0.000013288097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045973575,0.0034063105,0.1919457,0.00007144322,0.008503818,0.000058200927,0.004925878,0.6657445,0.04344237,0.06472181,0.000058609578,0.01666167],"study_design_scores_gemma":[0.00026435714,0.00012978296,0.009731841,0.0000045403044,0.0003773197,0.000001837776,0.00008764242,0.9816374,0.0070404666,0.00002062141,0.0005124757,0.00019171818],"about_ca_topic_score_codex":0.00087500433,"about_ca_topic_score_gemma":0.00062450115,"teacher_disagreement_score":0.47678134,"about_ca_system_score_codex":0.000024182862,"about_ca_system_score_gemma":0.00007769962,"threshold_uncertainty_score":0.43206605},"labels":[],"label_agreement":null},{"id":"W2060488904","doi":"10.5539/jmr.v2n3p47","title":"A Generalized Mixed Variational Inclusion Involving (H(·, ·), ?)-Monotone Operators in Banach Spaces","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Monotone polygon; Lipschitz continuity; Resolvent; Pseudo-monotone operator; Operator (biology); Strongly monotone; Banach space; Class (philosophy); Convergence (economics); Pure mathematics; Resolvent formalism; Discrete mathematics; Hilbert space; Applied mathematics; Finite-rank operator; Operator space; Computer science","score_opus":0.051446100493335416,"score_gpt":0.36004061549165645,"score_spread":0.308594514998321,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060488904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.528577,0.00013291683,0.4598026,0.010159087,0.00040229363,0.00019610861,0.0000018302211,0.000017628345,0.0007104902],"genre_scores_gemma":[0.58599466,0.00007053705,0.41356885,0.00005882063,0.00012554433,0.000004529464,0.0000014844787,0.000008112517,0.00016749573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99703777,0.00028755012,0.00068308366,0.00015769328,0.0015913195,0.00024256474],"domain_scores_gemma":[0.9974242,0.00064864516,0.00028694174,0.0002815559,0.0012132409,0.00014541246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067036455,0.000096995835,0.00026547932,0.001110132,0.0003111433,0.00033649954,0.0010554738,0.000093914474,0.00018575466],"category_scores_gemma":[0.0014383089,0.00007554076,0.00009326006,0.0013739914,0.000043532807,0.00065349287,0.00081857474,0.000688806,0.000018833734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015662334,0.000904575,0.0019323995,0.0000514943,0.000083680636,0.000043342265,0.006828459,0.012584579,0.031180745,0.944315,0.0013458226,0.00071419525],"study_design_scores_gemma":[0.0007347436,0.000057488982,0.0018779688,0.000047677146,0.0000065681443,0.000038138875,0.0001909716,0.93012995,0.0013048374,0.06485943,0.0006398586,0.000112352245],"about_ca_topic_score_codex":0.000046339926,"about_ca_topic_score_gemma":0.000114328315,"teacher_disagreement_score":0.9175454,"about_ca_system_score_codex":0.00009572392,"about_ca_system_score_gemma":0.00043539825,"threshold_uncertainty_score":0.32448727},"labels":[],"label_agreement":null},{"id":"W2061087907","doi":"10.1016/j.jmaa.2004.07.003","title":"Pareto optimization in topological vector spaces","year":2004,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Vector optimization; Pareto principle; Topological space; Multi-objective optimization; Locally convex topological vector space; Topological vector space; Mathematical optimization; Topology (electrical circuits); Applied mathematics; Pure mathematics; Optimization problem; Combinatorics; Multi-swarm optimization","score_opus":0.012914814255424557,"score_gpt":0.2628661898337035,"score_spread":0.24995137557827896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061087907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028801623,0.000063475505,0.991101,0.0055366713,0.0000056811346,0.000058196565,9.225857e-7,0.000009772607,0.00034406246],"genre_scores_gemma":[0.68734413,0.00008697285,0.31238103,0.00011533316,0.00003331929,0.000010439865,0.0000020124698,0.000002006235,0.000024786834],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990452,0.000032842156,0.00047361373,0.00013383634,0.0002253168,0.000089193054],"domain_scores_gemma":[0.99924827,0.00011047043,0.000245509,0.00014857124,0.00015510964,0.000092062786],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033662733,0.00007312472,0.00028075135,0.00036341127,0.00006464196,0.00011911811,0.00024237344,0.000042989916,0.000081529295],"category_scores_gemma":[0.0000680257,0.000051891668,0.00014459487,0.00164645,0.000034007076,0.00023373931,0.000043881875,0.000084919804,0.000006132579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016090526,0.00022234282,0.0006488223,0.0000054232764,0.00013384316,0.0000018471619,0.00011227376,0.3703736,0.000016458695,0.62788945,0.0000040867117,0.000590235],"study_design_scores_gemma":[0.00065100956,0.00007581111,0.00963948,0.000023100973,0.000564793,0.000034890003,0.0001655478,0.681122,0.00011779287,0.30714387,0.00025510366,0.00020664005],"about_ca_topic_score_codex":0.0000051254815,"about_ca_topic_score_gemma":0.00000816682,"teacher_disagreement_score":0.6844639,"about_ca_system_score_codex":0.00003299276,"about_ca_system_score_gemma":0.000034113134,"threshold_uncertainty_score":0.21160808},"labels":[],"label_agreement":null},{"id":"W2061220204","doi":"10.1287/moor.1060.0219","title":"Constraint Qualifications and KKT Conditions for Bilevel Programming Problems","year":2006,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Constraint (computer-aided design); Mathematics; Bilevel optimization; Mathematical optimization; Constraint programming; Constraint logic programming; Constraint satisfaction; Binary constraint; Set (abstract data type); Nonlinear programming; Sequence (biology); Optimization problem; Nonlinear system; Computer science; Stochastic programming","score_opus":0.12425927530381481,"score_gpt":0.40282507766078063,"score_spread":0.2785658023569658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061220204","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002049018,0.000031352527,0.99203753,0.003865556,0.000013066706,0.00071095664,0.000056984336,0.000037484737,0.0011980445],"genre_scores_gemma":[0.3960365,0.000008124637,0.6028906,0.000010319607,0.000018673181,0.00024141425,0.000111724454,0.0000058241703,0.000676788],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885297,0.000062128594,0.00038653647,0.00019550034,0.00033272168,0.00017016963],"domain_scores_gemma":[0.99811596,0.00042202527,0.000044446,0.0002932636,0.0010760465,0.000048286118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000994016,0.0000671629,0.00012706756,0.00032343954,0.0004964239,0.00029951672,0.00027336826,0.00003889916,0.00003256092],"category_scores_gemma":[0.00024855323,0.000060121038,0.000044381883,0.0006714138,0.00016663267,0.00026132492,0.0000739058,0.000070291884,0.000008030986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.4832053e-7,0.00025991027,0.00002635687,0.000056505072,0.000017061284,7.8141895e-8,0.00050012453,0.021394188,0.0025399572,0.97452474,0.0002726225,0.00040818643],"study_design_scores_gemma":[0.00021017806,0.00004020341,0.00013643326,0.000023880064,0.000009507292,0.000004055077,0.00026239737,0.9375185,0.0005604354,0.060133956,0.0010172471,0.00008326025],"about_ca_topic_score_codex":0.000079806065,"about_ca_topic_score_gemma":0.00007961901,"teacher_disagreement_score":0.9161243,"about_ca_system_score_codex":0.00002333473,"about_ca_system_score_gemma":0.00015140371,"threshold_uncertainty_score":0.38181415},"labels":[],"label_agreement":null},{"id":"W2061686387","doi":"10.1016/s0166-8641(00)00101-2","title":"Erratum to “Continuous functions which take a somewhere dense set of values on every open set” [Topology and its Applications 103 (2000) 95–110]","year":2000,"lang":"en","type":"erratum","venue":"Topology and its Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Prince Edward Island","funders":"","keywords":"Mathematics; Set (abstract data type); Open set; Topology (electrical circuits); Discrete mathematics; Pure mathematics; Combinatorics; Computer science; Programming language","score_opus":0.020469614902351798,"score_gpt":0.28711553944824336,"score_spread":0.2666459245458916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061686387","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00159418,0.024652462,0.5159529,0.15243158,0.006641967,0.016340043,0.0063031395,0.0012060854,0.27487767],"genre_scores_gemma":[0.07307683,0.0118140755,0.012935688,0.008814023,0.0024300516,0.010016494,0.0049697533,0.0001780378,0.875765],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99689996,0.00024466708,0.0007788249,0.00132829,0.00027379443,0.00047445053],"domain_scores_gemma":[0.9970702,0.00037767435,0.00046082243,0.0010761004,0.00069433433,0.0003208921],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003604054,0.00047268232,0.0008241971,0.0005390539,0.0009370324,0.00020056173,0.0014256267,0.00068667176,0.00073498965],"category_scores_gemma":[0.00010828849,0.00047596171,0.000101110345,0.001659061,0.00017173207,0.0003471443,0.000616143,0.00068274623,0.00044080906],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005200763,0.0004368253,0.0000448193,0.00010376862,0.00042310954,0.0000022399468,0.0008876583,0.0009925932,0.000064425425,0.36440647,0.62626475,0.006321367],"study_design_scores_gemma":[0.000504713,0.0003709968,0.00084617856,0.000049865615,0.00033962567,0.00007291742,0.00020783122,0.009698421,0.000035898658,0.01769665,0.96947086,0.00070607103],"about_ca_topic_score_codex":0.00015781702,"about_ca_topic_score_gemma":0.00039878997,"teacher_disagreement_score":0.60088736,"about_ca_system_score_codex":0.000077844394,"about_ca_system_score_gemma":0.0006870345,"threshold_uncertainty_score":0.9997692},"labels":[],"label_agreement":null},{"id":"W2061774045","doi":"10.5539/mas.v2n2p71","title":"The -Core of a -person Stochastic Cooperative Game","year":2008,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Core (optical fiber); Mathematical economics; Computer science; Game theory; Mathematics; Telecommunications","score_opus":0.035342546702784104,"score_gpt":0.2413490101697014,"score_spread":0.20600646346691728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061774045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060194046,0.00002434196,0.98969537,0.00044686883,0.000047272395,0.000096114694,9.983312e-7,0.000033313077,0.0036363283],"genre_scores_gemma":[0.98809516,0.0000046362916,0.011321467,0.00017108141,0.000011453668,0.000013701465,4.736572e-7,0.0000023637317,0.00037964399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998809,0.000010276914,0.00013776499,0.0002924507,0.0005633509,0.00018719665],"domain_scores_gemma":[0.99918145,0.00009113547,0.00008841936,0.00035257265,0.00022043491,0.00006601552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033025994,0.00007385587,0.00009684974,0.00008565771,0.0006378111,0.000077609286,0.0010294665,0.000016529411,0.0000061105607],"category_scores_gemma":[0.000059326612,0.000048547758,0.000030418229,0.001215851,0.0005259498,0.00022676442,0.00011214548,0.000060078302,0.000021893517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009002565,0.00005687475,0.00004369781,0.0000015645496,0.0000122373585,0.0000010419203,0.0072703734,0.22811145,0.044285495,0.7159031,0.00010598615,0.004199203],"study_design_scores_gemma":[0.00010441797,0.000012793217,0.0008504034,0.0000014676167,0.000002230812,0.000003862216,0.0000436666,0.9953861,0.0009753494,0.002528854,0.000025145393,0.00006571265],"about_ca_topic_score_codex":0.000009248085,"about_ca_topic_score_gemma":0.0000041556764,"teacher_disagreement_score":0.98207575,"about_ca_system_score_codex":0.000033419823,"about_ca_system_score_gemma":0.00025765327,"threshold_uncertainty_score":0.49055916},"labels":[],"label_agreement":null},{"id":"W2062059813","doi":"10.1287/moor.26.2.248.10558","title":"A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces","year":2001,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":418,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College","funders":"","keywords":"Mathematics; Hilbert space; Monotone polygon; Simple (philosophy); Convergence (economics); Applied mathematics; Class (philosophy); Weak convergence; Mathematical optimization; Pure mathematics; Computer science","score_opus":0.1493640761500596,"score_gpt":0.4924049965811565,"score_spread":0.3430409204310969,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2062059813","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069128056,0.000019293226,0.9848978,0.005593639,0.000032079257,0.0006022069,0.0000047411845,0.000018646635,0.0019188168],"genre_scores_gemma":[0.09992158,0.000025022264,0.89612377,0.0000350927,0.00001682844,0.00023389801,0.000006448874,0.000007781133,0.0036295864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984607,0.00016973751,0.00041883945,0.0002588659,0.0004342692,0.00025756663],"domain_scores_gemma":[0.99811333,0.00054706493,0.00003576003,0.00045989215,0.000751495,0.00009246525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024454694,0.00008316593,0.0002028203,0.0005672827,0.00019172944,0.00019165661,0.000671907,0.00004360499,0.00013394404],"category_scores_gemma":[0.0011509877,0.00007495198,0.000055151228,0.0017609393,0.00004127878,0.0003228112,0.00023465444,0.00010201448,0.000038092116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005602806,0.00032853466,0.0003783358,0.000040534527,0.000025077557,6.6201824e-7,0.0019233327,0.15412103,0.0029857561,0.8392646,0.00022406448,0.0007024742],"study_design_scores_gemma":[0.00019537665,0.00005577598,0.00027044513,0.000023272449,0.0000032594612,0.0000018734263,0.00020974148,0.9907671,0.0026322568,0.0037078136,0.0020497877,0.00008329142],"about_ca_topic_score_codex":0.00010383886,"about_ca_topic_score_gemma":0.00021769505,"teacher_disagreement_score":0.8366461,"about_ca_system_score_codex":0.00006947727,"about_ca_system_score_gemma":0.00018432087,"threshold_uncertainty_score":0.30564532},"labels":[],"label_agreement":null},{"id":"W2065416951","doi":"10.1007/s00013-014-0652-2","title":"On the local convergence of the Douglas–Rachford algorithm","year":2014,"lang":"en","type":"article","venue":"Archiv der Mathematik","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Mathematics; Convergence (economics); Regular polygon; Scheme (mathematics); Point (geometry); Fixed point; Mathematical optimization; Algorithm; Mathematical analysis; Geometry","score_opus":0.007544935065508547,"score_gpt":0.19683159591061405,"score_spread":0.1892866608451055,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065416951","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087679544,0.0000049383866,0.9868986,0.0044153742,0.00012788358,0.000080180675,0.0000015267369,0.000024411616,0.0075703147],"genre_scores_gemma":[0.9169945,0.000003815516,0.0800507,0.0017899397,0.000039351686,0.000012497692,0.0000014263265,0.00000671185,0.0011010526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913746,0.000121999336,0.00018458546,0.00014694914,0.00030291957,0.00010609189],"domain_scores_gemma":[0.9987048,0.00053766766,0.000118506265,0.0005596336,0.00005092105,0.000028470482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031369104,0.00007688534,0.00010042521,0.000033222288,0.00014146516,0.000035521924,0.0008682311,0.000016042222,0.00010253217],"category_scores_gemma":[0.00009869677,0.000037806414,0.000097096905,0.00028073322,0.0000817538,0.00007933327,0.0001825102,0.00007903434,0.00008555102],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.768995e-7,0.000035848807,0.00003223892,0.0000047315743,0.000019463185,7.352713e-8,0.00064990995,0.0026716583,0.000011676681,0.98873717,0.00088980625,0.006946825],"study_design_scores_gemma":[0.00006519412,0.000012394364,0.0008179405,0.000012113967,0.0000073100164,0.0000021547164,0.00001682581,0.78459334,0.0004264765,0.2131729,0.0008259784,0.00004734239],"about_ca_topic_score_codex":0.000009377213,"about_ca_topic_score_gemma":0.0000032121077,"teacher_disagreement_score":0.9161177,"about_ca_system_score_codex":0.0000064940823,"about_ca_system_score_gemma":0.000024467161,"threshold_uncertainty_score":0.16134039},"labels":[],"label_agreement":null},{"id":"W2066059515","doi":"10.9734/bjmcs/2014/9194","title":"On the Closedness of the Convex Hull in a Locally Convex Space","year":2014,"lang":"en","type":"article","venue":"British Journal of Mathematics & Computer Science","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Convex hull; Mathematics; Subderivative; Convex set; Regular polygon; Hull; Convex analysis; Convex combination; Convex polytope; Space (punctuation); Proper convex function; Pure mathematics; Combinatorics; Mathematical analysis; Convex optimization; Geometry; Computer science; Geology","score_opus":0.009142060306848634,"score_gpt":0.21269800047489637,"score_spread":0.20355594016804773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066059515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069391035,0.000024478953,0.92703605,0.002779355,0.00030729073,0.00009472007,7.007246e-7,0.000007309697,0.00035904034],"genre_scores_gemma":[0.8843725,0.000010176692,0.11459437,0.0009338392,0.000046820685,0.0000010743322,4.2447393e-8,0.0000041961657,0.000036985697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977918,0.00016586069,0.0006004064,0.00018970402,0.0010584288,0.00019378823],"domain_scores_gemma":[0.9976411,0.00057782844,0.000700148,0.0003735256,0.00062973314,0.0000776525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003140839,0.00009904123,0.00027767758,0.00016747344,0.00019016498,0.00037966706,0.0027661535,0.00003097562,0.000016515787],"category_scores_gemma":[0.0005430819,0.00006469224,0.00012819648,0.0013749815,0.00033154007,0.00038146635,0.00034924308,0.00022820281,0.000006247481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040479777,0.00050118606,0.00034944832,0.000045370107,0.000032163134,0.000020700863,0.0039039261,0.06200071,0.00024554852,0.9189815,0.00091319106,0.013002242],"study_design_scores_gemma":[0.00032882596,0.000075373224,0.004871452,0.00036631874,0.000007660237,0.00025204069,0.000044229728,0.96274793,0.0003933607,0.030750493,0.00006999055,0.000092335846],"about_ca_topic_score_codex":0.000012405723,"about_ca_topic_score_gemma":0.000008582758,"teacher_disagreement_score":0.9007472,"about_ca_system_score_codex":0.000041391864,"about_ca_system_score_gemma":0.0002608232,"threshold_uncertainty_score":0.5140248},"labels":[],"label_agreement":null},{"id":"W2066559849","doi":"10.1007/s10957-011-9971-7","title":"Existence and Uniqueness of Solutions for Homogeneous Cone Complementarity Problems","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nonlinear complementarity problem; Uniqueness; Complementarity (molecular biology); Homogeneous; Complementarity theory; Mixed complementarity problem; Mathematics; Monotone polygon; Nonlinear system; Homogeneous function; Cone (formal languages); Mathematical analysis; Applied mathematics; Mathematical optimization; Geometry; Physics; Algorithm; Combinatorics","score_opus":0.03145824916363664,"score_gpt":0.2753879869377373,"score_spread":0.24392973777410065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066559849","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005875546,0.00054878456,0.9979921,0.0004652208,0.000027694532,0.00022407468,0.00001707009,0.000009141985,0.00012834281],"genre_scores_gemma":[0.48660722,0.00044758085,0.5125562,0.0001676159,0.00007198834,0.0000533465,0.000019731031,0.000005823325,0.00007047642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992456,0.000088181536,0.00036309546,0.00008702224,0.000103357466,0.00011274327],"domain_scores_gemma":[0.9986784,0.00027071152,0.0004096125,0.000118553646,0.0004340701,0.0000886656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010668417,0.000065505,0.00014597124,0.00011513209,0.00024077648,0.000039407973,0.00015903683,0.00002995578,0.000017787019],"category_scores_gemma":[0.00004727908,0.000058132173,0.000044770968,0.00026178738,0.00007346833,0.00044849984,0.000057195743,0.000042116084,2.1027836e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009292889,0.00012602088,0.00030940413,0.000021610074,0.000041729698,2.5217524e-8,0.00026374016,0.08275919,0.00012399409,0.9143582,0.000019990215,0.0019668287],"study_design_scores_gemma":[0.0022233555,0.00030257768,0.0030729356,0.00007544311,0.00045190824,0.00022127251,0.00071151805,0.70806825,0.0018217526,0.2726297,0.009925745,0.00049551047],"about_ca_topic_score_codex":0.000001931888,"about_ca_topic_score_gemma":7.279993e-7,"teacher_disagreement_score":0.64172846,"about_ca_system_score_codex":0.000014258168,"about_ca_system_score_gemma":0.000040755713,"threshold_uncertainty_score":0.23705612},"labels":[],"label_agreement":null},{"id":"W2067877923","doi":"10.1007/s11075-005-9010-6","title":"Extrapolation algorithm for affine-convex feasibility problems","year":2005,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":84,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Mathematics; Subgradient method; Linear subspace; Theory of computation; Hilbert space; Affine transformation; Countable set; Algorithm; Mathematical optimization; Regular polygon; Convex optimization; Applied mathematics; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.02880830279725132,"score_gpt":0.27998542352186695,"score_spread":0.2511771207246156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2067877923","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000032498698,0.00006159984,0.99321926,0.005350889,0.00017174492,0.0003540905,0.000015924503,0.00023111422,0.00056285673],"genre_scores_gemma":[0.024952644,0.00000930301,0.97253287,0.0007924158,0.0004192393,0.00008165993,0.000053629858,0.000012263834,0.0011459737],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99841917,0.000053540913,0.00037259277,0.0005173286,0.00034784607,0.0002894968],"domain_scores_gemma":[0.998977,0.00012648028,0.00012657662,0.0003504736,0.0002683872,0.00015109191],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003174885,0.00016349275,0.00022762505,0.00010475637,0.00018200174,0.00015310023,0.00045218258,0.00008541828,0.00016687831],"category_scores_gemma":[0.000055951674,0.00014573665,0.00017421793,0.00069753354,0.00002567539,0.0006677893,0.000073279014,0.000100303325,0.000097716525],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030695319,0.00030556624,0.00019040323,0.0000060263606,0.00003743724,3.8332917e-7,0.00017194422,0.01291383,0.000054664288,0.011901525,0.00076079514,0.9736543],"study_design_scores_gemma":[0.000506713,0.00006394319,0.0012411121,0.000002726933,0.000013416523,0.0000036284998,0.0000040249506,0.97278833,0.00014077674,0.0029378077,0.022102838,0.00019469987],"about_ca_topic_score_codex":0.000022744141,"about_ca_topic_score_gemma":0.000002451447,"teacher_disagreement_score":0.97345966,"about_ca_system_score_codex":0.00010724288,"about_ca_system_score_gemma":0.00006990253,"threshold_uncertainty_score":0.5942968},"labels":[],"label_agreement":null},{"id":"W2068813150","doi":"10.1016/j.jfa.2012.03.023","title":"The Brezis–Browder Theorem in a general Banach space","year":2012,"lang":"en","type":"article","venue":"Journal of Functional Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Banach space; Characterization (materials science); Eberlein–Šmulian theorem; Monotone polygon; Pure mathematics; Monotonic function; Space (punctuation); Reflexive space; Discrete mathematics; Interpolation space; Lp space; Mathematical analysis; Functional analysis","score_opus":0.010981326267192977,"score_gpt":0.2281762266531999,"score_spread":0.21719490038600692,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068813150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013878284,0.00071942434,0.97348386,0.010098409,0.00043480526,0.000029373672,0.000001250668,0.000010473145,0.0013441204],"genre_scores_gemma":[0.98342985,0.000099817174,0.01358949,0.00048919773,0.0005080962,0.0000022918107,0.0000040851687,0.000004590965,0.0018725673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982427,0.00019004852,0.0005283317,0.00012227778,0.0006814774,0.00023519932],"domain_scores_gemma":[0.99851483,0.00031576253,0.00040640807,0.00021932347,0.000410113,0.00013355368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015793017,0.00010716371,0.00024930644,0.0006608086,0.00020428505,0.00015328436,0.00042552903,0.000043604294,0.00020776807],"category_scores_gemma":[0.00013781305,0.00006539051,0.00048268138,0.002987801,0.00003126652,0.0008203562,0.00006777148,0.00018761585,0.00002123882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045145625,0.00023668846,0.13409102,0.0000019081247,0.0023330958,0.000005036137,0.0003189205,0.42292017,0.00011496758,0.43373317,0.0030132958,0.0031865966],"study_design_scores_gemma":[0.00040591953,0.000030725736,0.47685456,0.0000039039683,0.00061609957,0.000035127207,0.00009821363,0.50760067,0.000052538624,0.004583182,0.009550411,0.00016867087],"about_ca_topic_score_codex":0.00003210012,"about_ca_topic_score_gemma":0.000038701575,"teacher_disagreement_score":0.96955156,"about_ca_system_score_codex":0.00010726214,"about_ca_system_score_gemma":0.00009124225,"threshold_uncertainty_score":0.26665476},"labels":[],"label_agreement":null},{"id":"W2070231539","doi":"10.4153/cmb-2003-051-5","title":"Subdifferentials Whose Graphs Are Not Norm × Weak* Closed","year":2003,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Simon Fraser University; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Subderivative; Norm (philosophy); Separable space; Hilbert space; Pure mathematics; Bounded function; Regular polygon; Convex set; Graph; Combinatorics; Mathematical analysis; Convex optimization","score_opus":0.01423443779205974,"score_gpt":0.20788607750743848,"score_spread":0.19365163971537874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2070231539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012193946,0.00008156153,0.8211507,0.048295915,0.00035743133,0.00049851846,0.000042401774,0.00024659553,0.11713291],"genre_scores_gemma":[0.9496318,0.000009126694,0.03844946,0.0042065834,0.000032341246,0.00002822323,0.0000111406425,0.000018960885,0.0076123443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985461,0.000114842835,0.00032934998,0.00032999067,0.00029538132,0.00038433593],"domain_scores_gemma":[0.9985343,0.00015570421,0.00009743738,0.00046048893,0.0001371261,0.00061490474],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00032994905,0.00016508727,0.0002608509,0.000245393,0.00019247082,0.00023472839,0.0004865737,0.0000941243,0.01422717],"category_scores_gemma":[0.00047877574,0.00014943368,0.0001365166,0.00045963554,0.000041305182,0.000067491266,0.00003090394,0.00011407416,0.007441972],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.353085e-7,0.000046750738,0.00011036083,0.000015093709,0.000026713542,0.000011567177,0.000094063835,0.00004726049,0.000016221988,0.98909515,0.01035054,0.00018554843],"study_design_scores_gemma":[0.0017259944,0.00008582009,0.007858616,0.00015830486,0.00015569893,0.0000807589,0.00026131782,0.0666331,0.0015568887,0.47976273,0.43994865,0.0017721239],"about_ca_topic_score_codex":0.00029800393,"about_ca_topic_score_gemma":0.0008721203,"teacher_disagreement_score":0.9374379,"about_ca_system_score_codex":0.0000917434,"about_ca_system_score_gemma":0.0001764275,"threshold_uncertainty_score":0.99333084},"labels":[],"label_agreement":null},{"id":"W2071622090","doi":"10.1007/s10107-013-0659-7","title":"Near equality, near convexity, sums of maximally monotone operators, and averages of firmly nonexpansive mappings","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Convexity; Monotone polygon; Resolvent; Regular polygon; Range (aeronautics); Convex function; Domain (mathematical analysis); Fixed point; Pure mathematics; Mathematical analysis; Discrete mathematics; Geometry","score_opus":0.016483421616309665,"score_gpt":0.2484942944968706,"score_spread":0.23201087288056094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071622090","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13504025,0.000041017596,0.86249983,0.0013345081,0.000019663643,0.00039923016,0.0000023527004,0.000057816644,0.0006053001],"genre_scores_gemma":[0.6151399,0.0000051730094,0.38467798,0.0000825048,0.0000062181525,0.000020998812,0.0000028361198,0.0000060009684,0.000058375233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986265,0.00006640919,0.0005208768,0.00024404658,0.0003481568,0.00019404791],"domain_scores_gemma":[0.99888146,0.00018486744,0.00020215756,0.0002816377,0.00034065885,0.00010919409],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038096495,0.00013089564,0.0003582769,0.000065182845,0.000101357684,0.00030823442,0.0003353414,0.00006614176,0.00015015653],"category_scores_gemma":[0.00016772228,0.00010918073,0.00008146072,0.0003919008,0.00020469494,0.00040123917,0.00030517933,0.00008280576,0.000037755908],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010272117,0.0007240983,0.004412416,0.0011269138,0.00032445468,0.0000047212743,0.0110130785,0.00089461694,0.0019123605,0.9309715,0.0001377499,0.048467793],"study_design_scores_gemma":[0.00040706815,0.00012794876,0.0014069908,0.00009127191,0.00003557017,0.000007409731,0.00018614443,0.96520257,0.0015754062,0.030445032,0.00029123423,0.00022333986],"about_ca_topic_score_codex":0.00014392081,"about_ca_topic_score_gemma":0.0000016061763,"teacher_disagreement_score":0.96430796,"about_ca_system_score_codex":0.000011253896,"about_ca_system_score_gemma":0.000047426332,"threshold_uncertainty_score":0.4452261},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"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","score_opus":0.02388549093823213,"score_gpt":0.28009547210425434,"score_spread":0.2562099811660222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072061258","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039206557,0.000020354491,0.9878234,0.0040264344,0.000048235517,0.00030608263,0.00006271142,0.00014835663,0.0036437565],"genre_scores_gemma":[0.6619746,0.0000034674385,0.33207467,0.00200167,0.00014272566,0.000075927484,0.00052052696,0.000016198781,0.0031901824],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969645,0.00014610149,0.0007911512,0.0010506914,0.00064592384,0.00040163044],"domain_scores_gemma":[0.99787724,0.00015909638,0.00017653024,0.0009095011,0.0006176878,0.00025991615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008767326,0.00025326066,0.0006347863,0.0008971939,0.000282198,0.00034499908,0.00074792246,0.00012332239,0.000024187499],"category_scores_gemma":[0.00028848677,0.00021624255,0.00063793437,0.005359294,0.00003697014,0.0003663008,0.00017685817,0.00010209395,0.00007171665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007040715,0.0003476179,0.00046592727,0.000006911488,0.0011662182,0.0000025897825,0.00016943266,0.70260376,0.00020301204,0.2868812,0.0076704305,0.0004124896],"study_design_scores_gemma":[0.0006432233,0.00004505303,0.0034857152,0.0000026643745,0.0010467746,0.0000011666345,0.000025478694,0.99058133,0.00011572093,0.0012439734,0.002509837,0.0002990505],"about_ca_topic_score_codex":0.00038518527,"about_ca_topic_score_gemma":0.000041567582,"teacher_disagreement_score":0.658054,"about_ca_system_score_codex":0.00008825455,"about_ca_system_score_gemma":0.000083278675,"threshold_uncertainty_score":0.8818115},"labels":[],"label_agreement":null},{"id":"W2072310184","doi":"10.1287/opre.1090.0803","title":"Subproblem Approximation in Dantzig-Wolfe Decomposition of Variational Inequality Models with an Application to a Multicommodity Economic Equilibrium Model","year":2010,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Variational inequality; Parameterized complexity; Mathematics; Mathematical optimization; Mathematical economics; Inverse; Convergence (economics); Applied mathematics; Economics; Combinatorics","score_opus":0.06283831369694398,"score_gpt":0.3800135655064066,"score_spread":0.3171752518094626,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072310184","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21677877,8.359076e-7,0.7805046,0.0018089452,0.000019480047,0.00049549586,0.00003255911,0.000028599277,0.00033074318],"genre_scores_gemma":[0.61390156,9.744957e-7,0.38564828,0.000031825162,0.000020906264,0.00019241119,0.00017671112,0.000006012588,0.0000213349],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99804884,0.00026088467,0.0004596932,0.00047578,0.00052898994,0.0002258137],"domain_scores_gemma":[0.9982728,0.00010784243,0.000054667515,0.0006536943,0.00077210285,0.00013889805],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018656561,0.000108771186,0.00016728841,0.0005924799,0.00020961517,0.0002553435,0.0005955331,0.00008394614,0.000028535802],"category_scores_gemma":[0.00005645163,0.000103430284,0.000029182234,0.0009121812,0.00004864838,0.0020335934,0.0001580575,0.00026252697,0.000023469513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017530407,0.0001941905,0.0002242831,0.000005015584,0.0000049907176,6.992055e-8,0.00046192994,0.64514446,0.011534437,0.34209183,0.000006487298,0.00031479154],"study_design_scores_gemma":[0.00034604192,0.00006671787,0.002153692,0.0000052789073,0.0000030152646,0.0000011251373,0.000021283686,0.9846834,0.0013856731,0.011210106,0.0000042666475,0.00011941891],"about_ca_topic_score_codex":0.001141649,"about_ca_topic_score_gemma":0.0051087956,"teacher_disagreement_score":0.39712277,"about_ca_system_score_codex":0.00014969705,"about_ca_system_score_gemma":0.00049040513,"threshold_uncertainty_score":0.42177644},"labels":[],"label_agreement":null},{"id":"W2073044751","doi":"10.1137/s1052623499360616","title":"Erratum: Weak Sharp Solutions of Variational Inequalities","year":2000,"lang":"en","type":"erratum","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":82,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Line (geometry); Simple (philosophy); Statement (logic); Inequality; Variational inequality; Calculus (dental); Combinatorics; Mathematical economics; Pure mathematics; Applied mathematics; Mathematical analysis; Geometry; Philosophy; Epistemology","score_opus":0.024560821207066683,"score_gpt":0.251635378998436,"score_spread":0.22707455779136934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073044751","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.0617898e-7,0.00043168807,0.8913356,0.0033831054,0.007744553,0.00014006752,0.00010059495,0.00008897868,0.09677508],"genre_scores_gemma":[0.0011803709,0.009602811,0.47148192,0.0025492997,0.00636116,0.000056111872,0.0048564486,0.0001818862,0.50373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958643,0.00048729914,0.0013039156,0.0005048802,0.0014275443,0.00041209435],"domain_scores_gemma":[0.9964255,0.00019632376,0.0014325987,0.0005702755,0.0011661397,0.00020914117],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009810932,0.00042468772,0.00062181125,0.0012552661,0.0005749611,0.000530473,0.0011573795,0.0005165956,0.0025475442],"category_scores_gemma":[0.0003012588,0.00040353014,0.00042654836,0.001364224,0.000061457635,0.001090083,0.0001311448,0.0010353754,0.000074952295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011952894,0.0001296217,0.0000024475023,0.00001715342,0.00013305568,0.0000023946254,0.000125735,0.573627,6.1265195e-7,0.09200415,0.33354944,0.0003964244],"study_design_scores_gemma":[0.00045136033,0.00014911144,0.000081599945,0.00022006215,0.000100754085,0.000048498936,0.000023676948,0.92794794,0.0000016118425,0.006447991,0.06410864,0.00041878107],"about_ca_topic_score_codex":0.000015799309,"about_ca_topic_score_gemma":0.0000044679064,"teacher_disagreement_score":0.41985372,"about_ca_system_score_codex":0.00025561708,"about_ca_system_score_gemma":0.0012423685,"threshold_uncertainty_score":0.99984163},"labels":[],"label_agreement":null},{"id":"W2073464705","doi":"10.1080/0233193021000015659","title":"Convex Parametric Programming in Abstract Spaces","year":2002,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Banach space; Parametric statistics; Saddle point; Convex analysis; Mathematical optimization; Stability (learning theory); Metric space; Regular polygon; Measure (data warehouse); Subderivative; Space (punctuation); Applied mathematics; Convex optimization; Pure mathematics; Computer science","score_opus":0.022203960841922544,"score_gpt":0.23140203226561656,"score_spread":0.209198071423694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2073464705","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004928199,0.00007932951,0.992656,0.0015640382,0.00008061729,0.00011378466,4.6766206e-7,0.00010508025,0.0049078567],"genre_scores_gemma":[0.5749199,0.00009930737,0.42424414,0.00016083244,0.00002208425,0.000014176895,0.000012521656,0.0000057815037,0.0005213159],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991715,0.00002852962,0.00021184438,0.00023215209,0.00020695837,0.00014903797],"domain_scores_gemma":[0.9995268,0.000057289184,0.00010113556,0.00018163206,0.00008563239,0.000047507223],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000150803,0.000081982485,0.000105452644,0.00037610525,0.00006453986,0.00025212177,0.00022916026,0.000050976,0.00047696292],"category_scores_gemma":[0.000096159405,0.00008078184,0.000036100428,0.0019576128,0.000011774741,0.0006474976,0.000034991448,0.00006330962,0.00007408631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.5310727e-7,0.0000843782,0.0024768445,0.0000029920734,0.0000056504227,0.0000022146335,0.00014291146,0.97824013,0.0000014309747,0.0072659045,0.0001289166,0.011648067],"study_design_scores_gemma":[0.00019677285,0.000011847534,0.0020431024,0.0000052424557,0.0000033856331,0.0000014544275,0.000012059578,0.99662435,0.000011841977,0.00008283749,0.0009077421,0.00009934512],"about_ca_topic_score_codex":0.000024042733,"about_ca_topic_score_gemma":0.0000050735953,"teacher_disagreement_score":0.574427,"about_ca_system_score_codex":0.00003965083,"about_ca_system_score_gemma":0.000010570432,"threshold_uncertainty_score":0.52224094},"labels":[],"label_agreement":null},{"id":"W2074972460","doi":"10.1287/trsc.34.3.289.12299","title":"A Bilevel Model and Solution Algorithm for a Freight Tariff-Setting Problem","year":2000,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":88,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Tariff; Bilevel optimization; Mathematical optimization; Heuristic; Revenue; Schedule; Integer programming; Set (abstract data type); Integer (computer science); Computer science; Branch and bound; Class (philosophy); Operations research; Mathematics; Economics; Optimization problem; Finance","score_opus":0.01632194362349718,"score_gpt":0.24908545337920993,"score_spread":0.23276350975571275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074972460","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003970245,0.000012955446,0.99418956,0.0010925417,0.00002331286,0.00019429874,0.000023719169,0.00007753307,0.0004158081],"genre_scores_gemma":[0.21154596,0.00001361163,0.7875404,0.0002826334,0.000012144202,0.00003644361,0.000019788216,0.000003314641,0.0005457382],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987829,0.000009013092,0.00023626411,0.00041205893,0.00035679367,0.00020300843],"domain_scores_gemma":[0.99943554,0.000032269345,0.0000701681,0.00014416814,0.00022541812,0.00009242503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047645642,0.00008492692,0.0000888025,0.00015402654,0.00042109712,0.00016452404,0.00031592243,0.000029563935,0.00003855748],"category_scores_gemma":[0.000008370637,0.00007802624,0.000038079237,0.00088534865,0.00009287857,0.0013369534,0.000004886396,0.00003954342,0.0000061796222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064284,0.000083350475,0.0003318261,0.000016352451,0.000012276261,8.18315e-7,0.003712406,0.2330069,0.002074028,0.17372084,0.00010207413,0.5869327],"study_design_scores_gemma":[0.00025591138,0.000016779279,0.004993312,0.0000058624873,0.00000961164,9.570915e-7,0.000007074272,0.9832517,0.00019303431,0.010941572,0.0002153065,0.00010891369],"about_ca_topic_score_codex":0.0000326405,"about_ca_topic_score_gemma":0.00002356322,"teacher_disagreement_score":0.75024474,"about_ca_system_score_codex":0.000024199917,"about_ca_system_score_gemma":0.00018012093,"threshold_uncertainty_score":0.3238781},"labels":[],"label_agreement":null},{"id":"W2076015235","doi":"10.1007/s11784-008-0074-5","title":"Equilibria for set-valued maps on nonsmooth domains","year":2008,"lang":"en","type":"article","venue":"Journal of Fixed Point Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Retract; Tangent; Tangent cone; Cone (formal languages); Pure mathematics; Simple (philosophy); Class (philosophy); Euler characteristic; Set (abstract data type); Graph; Property (philosophy); Discrete mathematics; Geometry","score_opus":0.017865556290833945,"score_gpt":0.266114284074423,"score_spread":0.24824872778358906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076015235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029632929,0.000051592717,0.99285764,0.0024862124,0.000046160752,0.00015670898,0.000016845068,0.000018309518,0.0014032448],"genre_scores_gemma":[0.7718021,0.00020950094,0.222277,0.0028073553,0.00058899407,0.0000943617,0.000025568792,0.000019070625,0.0021759972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992308,0.00008717106,0.00030476964,0.00013089685,0.00014780689,0.00009853065],"domain_scores_gemma":[0.9988387,0.00042372503,0.00025994872,0.0001980666,0.00018161608,0.00009789145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000682682,0.00007897461,0.00014701307,0.00014285935,0.00027602207,0.00004508923,0.00028831762,0.000035533245,0.000027352402],"category_scores_gemma":[0.000069275484,0.00006222664,0.000116503405,0.00026134093,0.000047088855,0.00024566418,0.000033819182,0.000084192245,0.000011108814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004322138,0.000076773424,0.000020729849,0.0000035545777,0.000045113546,0.0000010326139,0.00022068659,0.0007561084,0.00032301465,0.9949024,0.0018412288,0.0017661556],"study_design_scores_gemma":[0.002116875,0.0003949298,0.0015362416,0.00003190275,0.000111022644,0.00030834455,0.00013730508,0.031983912,0.0015527118,0.88880605,0.07269084,0.00032987373],"about_ca_topic_score_codex":3.9606985e-7,"about_ca_topic_score_gemma":2.4149296e-7,"teacher_disagreement_score":0.77058065,"about_ca_system_score_codex":0.00001886611,"about_ca_system_score_gemma":0.00006879954,"threshold_uncertainty_score":0.25375286},"labels":[],"label_agreement":null},{"id":"W2078351087","doi":"10.1016/s0377-0427(99)00263-0","title":"A noncompact generalized quasi-variational inequality","year":2000,"lang":"en","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Inequality; Variational inequality; Mathematical analysis; Applied mathematics; Calculus (dental); Pure mathematics","score_opus":0.018879160079492883,"score_gpt":0.2648793006866893,"score_spread":0.2460001406071964,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078351087","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029540159,0.000033451728,0.9661765,0.0015627426,0.000040841427,0.000058633716,0.000004094211,0.000020778074,0.0025628102],"genre_scores_gemma":[0.30342305,0.000020105092,0.69585115,0.00046759075,0.00010062607,0.0000016934448,0.000006883567,0.000004869116,0.00012402439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853724,0.00003236589,0.00065613387,0.00012161599,0.00054714555,0.000105469],"domain_scores_gemma":[0.99884206,0.00028526384,0.00040267344,0.000101818856,0.00025725213,0.0001109187],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005120454,0.0001173144,0.00028620838,0.00013312812,0.00011297467,0.00014944917,0.0002640202,0.00004042148,0.00031083802],"category_scores_gemma":[0.000025900705,0.00009302606,0.000095941396,0.00031011715,0.000026646389,0.00028220928,0.000031760075,0.00010166781,0.00002404645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013612351,0.00028729893,0.000028106253,0.000016837,0.00008304704,0.0000017688412,0.00059469516,0.24951905,0.000027944518,0.74176353,0.00034196713,0.007322131],"study_design_scores_gemma":[0.00074845424,0.000041741663,0.001912576,0.000012332639,0.000026878086,0.00008126598,0.000021144402,0.678852,0.000019257273,0.31741244,0.0007542426,0.000117681106],"about_ca_topic_score_codex":0.0000013815115,"about_ca_topic_score_gemma":2.7922133e-7,"teacher_disagreement_score":0.42933294,"about_ca_system_score_codex":0.000025863417,"about_ca_system_score_gemma":0.00011604001,"threshold_uncertainty_score":0.37934923},"labels":[],"label_agreement":null},{"id":"W2079646161","doi":"10.1007/s10898-007-9270-x","title":"An inexact proximal point method for solving generalized fractional programs","year":2008,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Mathematical optimization; Regularization (linguistics); Rate of convergence; Parametric statistics; Convergence (economics); Applied mathematics; Regular polygon; Term (time); Computer science; Key (lock)","score_opus":0.023416166599430736,"score_gpt":0.3095328237218821,"score_spread":0.2861166571224514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079646161","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006374249,0.000045275894,0.9968643,0.0018066284,0.0002733381,0.00017838457,0.000004844409,0.000045318895,0.00014447358],"genre_scores_gemma":[0.06506451,0.000034796674,0.9341482,0.0004072505,0.0002654012,0.000008079323,0.000031874803,0.0000074595464,0.000032450647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984364,0.00010520756,0.00058903923,0.0002069566,0.00048530515,0.00017712053],"domain_scores_gemma":[0.9976349,0.000051246327,0.0006855362,0.00016626193,0.0013082932,0.00015378883],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060552463,0.00013237316,0.0002488598,0.00011927309,0.00023782565,0.00017289509,0.00040656672,0.00007815122,0.00004231677],"category_scores_gemma":[0.00014821581,0.0001135684,0.00020649095,0.0006772949,0.000018252835,0.0019565136,0.00003240617,0.00008497088,0.0000015704949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006221611,0.00025017466,0.0013156687,0.0000037462112,0.000072327544,0.00000497626,0.0000748912,0.974984,0.00004575258,0.020080298,0.00044138872,0.0026645472],"study_design_scores_gemma":[0.00095487834,0.00029400646,0.001049513,0.000009058302,0.00003887266,0.0002951099,0.000012375086,0.9953681,0.000042646505,0.0013929497,0.00041301583,0.00012946338],"about_ca_topic_score_codex":0.000013999675,"about_ca_topic_score_gemma":0.0000025237414,"teacher_disagreement_score":0.06442709,"about_ca_system_score_codex":0.00019119873,"about_ca_system_score_gemma":0.00030928227,"threshold_uncertainty_score":0.4631185},"labels":[],"label_agreement":null},{"id":"W2079711316","doi":"10.1006/jmaa.2000.7042","title":"New Approximation Schemes for General Variational Inequalities","year":2000,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":832,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Variational inequality; Convergence (economics); Class (philosophy); Applied mathematics; Inequality; Calculus (dental); Mathematical analysis; Computer science; Artificial intelligence","score_opus":0.017698355234172458,"score_gpt":0.273454718719427,"score_spread":0.25575636348525455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079711316","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052936573,0.000057608606,0.9958903,0.0028442245,0.0000059773765,0.000103351085,0.000006167869,0.000013665797,0.0005492938],"genre_scores_gemma":[0.021506358,0.000058259724,0.9755428,0.000215345,0.0002346345,0.00003332805,0.000019928571,0.0000043790137,0.0023849804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888164,0.000035483838,0.0005757927,0.0001375848,0.00027758337,0.00009193427],"domain_scores_gemma":[0.99891174,0.00025610562,0.00027531383,0.00016061246,0.00027644433,0.00011981081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050061336,0.000084859814,0.0002784885,0.0002506439,0.00012816892,0.00016763854,0.00024935073,0.00003946111,0.0006055541],"category_scores_gemma":[0.000051273328,0.00006503707,0.00024513356,0.0008630607,0.00001628736,0.00034410763,0.00001915431,0.000051617975,0.000010927663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036469148,0.0000845297,0.000057362853,0.000011990258,0.00041521463,7.018843e-8,0.0001151736,0.0034472928,0.000027788006,0.9533161,0.00024579666,0.042275056],"study_design_scores_gemma":[0.00025048715,0.000021230922,0.000618275,0.0000044627345,0.0005158057,0.000007025564,0.000015729083,0.6355156,0.00006484007,0.35230017,0.010596245,0.00009018173],"about_ca_topic_score_codex":0.0000034830164,"about_ca_topic_score_gemma":9.834914e-7,"teacher_disagreement_score":0.6320683,"about_ca_system_score_codex":0.000015993344,"about_ca_system_score_gemma":0.00006473399,"threshold_uncertainty_score":0.66303927},"labels":[],"label_agreement":null},{"id":"W2080360501","doi":"10.1006/jmaa.2001.7518","title":"On Mixed Duality in Mathematical Programming","year":2001,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Dual polyhedron; Mathematics; Duality (order theory); Fractional programming; Class (philosophy); Strong duality; Dual (grammatical number); Type (biology); Nonlinear programming; Applied mathematics; Pure mathematics; Nonlinear system; Algebra over a field; Calculus (dental); Mathematical optimization; Optimization problem; Computer science; Artificial intelligence","score_opus":0.018170838937328147,"score_gpt":0.28771847302022563,"score_spread":0.2695476340828975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080360501","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009722507,0.000024053328,0.98625344,0.0027175169,0.000004922611,0.00009157523,7.4400697e-7,0.000012595369,0.0011726333],"genre_scores_gemma":[0.8081389,0.000051192495,0.19135584,0.00018200949,0.000043951695,0.000030731982,0.000002356588,0.0000047199446,0.00019032093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985559,0.000069249225,0.0007096706,0.00016827986,0.00036738467,0.00012953949],"domain_scores_gemma":[0.9987398,0.00041511035,0.00030232206,0.00024971468,0.00016251621,0.00013055393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000834087,0.0000974127,0.0003874318,0.00047399316,0.00007638672,0.00013337468,0.00029989122,0.000044867877,0.0001364891],"category_scores_gemma":[0.00013836383,0.00006935829,0.00021990351,0.0020290283,0.000034922097,0.0001834509,0.000051442323,0.0001300026,0.000026474167],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041079147,0.00068340957,0.0007262342,0.000015553136,0.00023573691,0.0000049617042,0.00012358042,0.0020893395,0.00001108958,0.9825579,0.000026814409,0.01352127],"study_design_scores_gemma":[0.00039581605,0.00006175338,0.006302144,0.000034905668,0.00048746754,0.000055202123,0.000100933175,0.32277444,0.00003690037,0.6683453,0.0012311727,0.00017401566],"about_ca_topic_score_codex":0.0000015488231,"about_ca_topic_score_gemma":0.0000043704795,"teacher_disagreement_score":0.7984164,"about_ca_system_score_codex":0.000025908703,"about_ca_system_score_gemma":0.000022494674,"threshold_uncertainty_score":0.2828349},"labels":[],"label_agreement":null},{"id":"W2081084362","doi":"10.1007/s10589-014-9654-z","title":"Solving semi-infinite programs by smoothing projected gradient method","year":2014,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Smoothing; Mathematical optimization; Optimization problem; Lagrange multiplier; Applied mathematics; Function (biology)","score_opus":0.011142577973631333,"score_gpt":0.26006185511953944,"score_spread":0.2489192771459081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081084362","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025118114,0.000052529867,0.99479544,0.0022808516,0.00003698109,0.00042381827,0.000008163273,0.0003240428,0.002053027],"genre_scores_gemma":[0.055037096,0.000027717319,0.9423826,0.0011746779,0.00007028649,0.00027998706,0.00071431976,0.00001723908,0.000296119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984158,0.00013136887,0.00040127794,0.00052279525,0.00032902436,0.00019973355],"domain_scores_gemma":[0.9986891,0.0002619094,0.00022870234,0.00025371724,0.0004126696,0.00015386901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036492004,0.00017837375,0.00018145851,0.00020496766,0.000560808,0.00042349115,0.0003301938,0.00007172618,0.000030231715],"category_scores_gemma":[0.0000498255,0.00018047934,0.00006199076,0.0011126903,0.00004413265,0.00047090868,0.00011637274,0.000107659886,0.00001715471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.9414215e-7,0.000082660554,0.00014177951,0.000007677889,0.000021073376,5.3613935e-8,0.00013243238,0.75092155,0.000012924945,0.22622702,0.00031433685,0.022137629],"study_design_scores_gemma":[0.00032106752,0.000022795839,0.00021763469,0.000008967264,0.000019690684,0.00000681077,0.000015996318,0.9797599,0.00001691693,0.0076466203,0.011752547,0.00021106236],"about_ca_topic_score_codex":0.000012537338,"about_ca_topic_score_gemma":0.0000013950324,"teacher_disagreement_score":0.22883837,"about_ca_system_score_codex":0.000040116043,"about_ca_system_score_gemma":0.000060814113,"threshold_uncertainty_score":0.7359734},"labels":[],"label_agreement":null},{"id":"W2082249535","doi":"10.1016/j.automatica.2011.01.037","title":"A simple proof of the Pontryagin maximum principle on manifolds","year":2011,"lang":"en","type":"article","venue":"Automatica","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Pontryagin's minimum principle; Maximum principle; Mathematics; Simple (philosophy); Manifold (fluid mechanics); Optimal control; Control theory (sociology); Pure mathematics; Applied mathematics; Mathematical analysis; Calculus (dental); Control (management); Mathematical optimization; Computer science; Engineering","score_opus":0.020923139986389616,"score_gpt":0.24132800114512676,"score_spread":0.22040486115873714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082249535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03147105,0.000011259114,0.88084334,0.0031124845,0.00020837662,0.00044528503,0.000006924458,0.00024348132,0.0836578],"genre_scores_gemma":[0.9669441,3.453958e-7,0.032138396,0.00040933376,0.000008152096,0.000009155738,9.440915e-7,0.0000036985512,0.00048586857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930924,0.000046370325,0.00018529315,0.0001300727,0.00022940576,0.00009962793],"domain_scores_gemma":[0.99929535,0.000035397246,0.00010828822,0.0004702773,0.000059938968,0.0000307248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013358705,0.00006189429,0.00009266515,0.000048853657,0.00006384237,0.00002129327,0.0005624346,0.000024548046,0.00023193806],"category_scores_gemma":[0.00004922752,0.000039307677,0.0000666206,0.0003554548,0.000018410066,0.00010637789,0.00013752207,0.00003742115,0.000041936375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000313518,0.0002572537,0.0017956635,0.000017691875,0.000052270763,0.0000014314572,0.0011362002,0.0008941781,0.00005777114,0.9923736,0.00070851325,0.0027023123],"study_design_scores_gemma":[0.00019975193,0.00006044533,0.075320944,0.0000152143975,0.000019792846,0.0000027578956,0.000011133133,0.86336714,0.005525164,0.054312397,0.0010616337,0.00010364944],"about_ca_topic_score_codex":0.000020572405,"about_ca_topic_score_gemma":0.0000061347114,"teacher_disagreement_score":0.9380612,"about_ca_system_score_codex":0.000013727006,"about_ca_system_score_gemma":0.000043498716,"threshold_uncertainty_score":0.2539559},"labels":[],"label_agreement":null},{"id":"W2082889410","doi":"10.1023/b:jota.0000025708.31430.22","title":"Reflection-Projection Method for Convex Feasibility Problems with an Obtuse Cone","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Orthant; Projection (relational algebra); Intersection (aeronautics); Cone (formal languages); Convex cone; Regular polygon; Conic optimization; Convex set; Reflection (computer programming); Convex optimization; Euclidean space; Dual cone and polar cone; Theory of computation; Set (abstract data type); Combinatorics; Algorithm; Computer science; Geometry","score_opus":0.026833206224986323,"score_gpt":0.32686238087547764,"score_spread":0.30002917465049134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082889410","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018816483,0.000039108178,0.9980183,0.0010707715,0.000034519202,0.00045511484,0.0000045074203,0.000041032537,0.00014844452],"genre_scores_gemma":[0.035402387,0.00006283633,0.96394044,0.0002867928,0.00009641999,0.00008788935,0.00001902476,0.000009411841,0.0000948087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989966,0.00014959523,0.00037553426,0.00022139806,0.00016263041,0.00009424558],"domain_scores_gemma":[0.99822956,0.00016994363,0.00046512712,0.00021171037,0.00081978727,0.000103865714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012438688,0.00010056698,0.00017317107,0.00018872143,0.00031664612,0.00014503826,0.00020003784,0.000054618547,0.000014376511],"category_scores_gemma":[0.0000619592,0.00007912706,0.000057253936,0.0005692032,0.000040804258,0.00094041385,0.000016938739,0.000088564324,6.98491e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006711007,0.00015009496,0.00002191587,0.000008489362,0.00003579494,9.8461584e-8,0.00015799863,0.6170569,0.0000962688,0.38038567,0.00000426952,0.002015417],"study_design_scores_gemma":[0.0030839175,0.0009192694,0.00024019876,0.000030669056,0.00019162387,0.00018986994,0.00025205614,0.71930593,0.0012365518,0.2724516,0.0018059426,0.00029237702],"about_ca_topic_score_codex":0.0000035430794,"about_ca_topic_score_gemma":0.000003890134,"teacher_disagreement_score":0.10793404,"about_ca_system_score_codex":0.00006175531,"about_ca_system_score_gemma":0.0001509804,"threshold_uncertainty_score":0.32267076},"labels":[],"label_agreement":null},{"id":"W2083058198","doi":"10.1049/iet-cta.2010.0390","title":"ℋ <sub>2</sub> filtering for non-linear singularly perturbed systems","year":2011,"lang":"en","type":"article","venue":"IET Control Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Linear system; Control theory (sociology); Bilinear interpolation; Kalman filter; Filtering problem; Applied mathematics; Linear control systems; Mathematical optimization; Computer science; Mathematical analysis; Extended Kalman filter; Control (management); Statistics","score_opus":0.013701845862651931,"score_gpt":0.22387583564809255,"score_spread":0.2101739897854406,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083058198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010493046,0.00007813341,0.99737495,0.0001956226,0.00005164988,0.00047680014,0.000025163672,0.00008002423,0.00066837325],"genre_scores_gemma":[0.9846508,0.000014456475,0.0139829805,0.00040334996,0.00013206934,0.0006574552,0.000013691505,0.000008103139,0.000137114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928594,0.000059537477,0.00019000492,0.00025589316,0.00007611972,0.00013248382],"domain_scores_gemma":[0.9991445,0.00026092603,0.00009224358,0.0002811413,0.0001469505,0.00007427201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043290693,0.00009533958,0.00014013954,0.00006553885,0.00026714563,0.00010045045,0.00025728936,0.000045307865,0.0000053914187],"category_scores_gemma":[0.000033321514,0.00008519915,0.00006631987,0.00017579677,0.000032173146,0.0002203886,0.00003216449,0.00004410713,0.000016525888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022826955,0.000054832086,0.000019267623,0.0000126338655,0.000060581726,2.130951e-7,0.0002930775,0.0010934694,0.010026396,0.98316646,0.0000331565,0.005217102],"study_design_scores_gemma":[0.0010812792,0.00006440795,0.00040628487,0.0000135566315,0.00009432761,0.0000072417724,0.00007777879,0.9271234,0.0035457998,0.06363786,0.0036846795,0.00026338312],"about_ca_topic_score_codex":0.000003582874,"about_ca_topic_score_gemma":7.4568584e-7,"teacher_disagreement_score":0.98360145,"about_ca_system_score_codex":0.000009397433,"about_ca_system_score_gemma":0.000022933635,"threshold_uncertainty_score":0.34743205},"labels":[],"label_agreement":null},{"id":"W2085656345","doi":"10.1017/s144678870003620x","title":"Extremal characterizations of reflexive spaces","year":2007,"lang":"en","type":"article","venue":"Journal of the Australian Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Banach space; Uniformly convex space; Reflexive space; Pure mathematics; Reflexivity; Norm (philosophy); Differentiable function; Regular polygon; Locally convex topological vector space; Property (philosophy); Space (punctuation); Banach manifold; Lp space; Interpolation space; Functional analysis; Topological space; Geometry","score_opus":0.03252822657389972,"score_gpt":0.30085362118168213,"score_spread":0.26832539460778243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085656345","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0339331,0.000006446299,0.95381474,0.011469717,0.00013893028,0.00005568652,0.0000023846546,0.000009779078,0.0005692307],"genre_scores_gemma":[0.7331792,0.000008022993,0.26452166,0.00027591127,0.00011040574,3.1093487e-7,4.6039287e-7,0.0000047368612,0.0018993017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99881905,0.00003800746,0.0005285341,0.0000697858,0.00041941027,0.00012521965],"domain_scores_gemma":[0.99868643,0.00014643259,0.00060821994,0.00020913496,0.00027087654,0.00007891487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008809955,0.000071308044,0.00018843918,0.000034342353,0.00008250547,0.00005655904,0.00061852566,0.000054436296,0.00015376983],"category_scores_gemma":[0.00010753431,0.00004223565,0.00041274042,0.00049009436,0.00006625062,0.0002849088,0.000083705316,0.00013832652,0.0000071770137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019309584,0.00077939196,0.0041005663,0.0001311036,0.0006564113,0.000006243633,0.007507845,0.0025266472,0.017617289,0.9558152,0.009372804,0.0014671782],"study_design_scores_gemma":[0.003340027,0.00056398415,0.2768492,0.00097584375,0.0010320651,0.0006256693,0.004067168,0.16870312,0.056147568,0.47499323,0.011439851,0.0012622873],"about_ca_topic_score_codex":7.768399e-7,"about_ca_topic_score_gemma":2.7293737e-7,"teacher_disagreement_score":0.6992461,"about_ca_system_score_codex":0.00003908292,"about_ca_system_score_gemma":0.000054730015,"threshold_uncertainty_score":0.17223199},"labels":[],"label_agreement":null},{"id":"W2087914194","doi":"10.1007/s10898-005-3839-z","title":"Lower Semicontinuous Regularization for Vector-Valued Mappings","year":2006,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":27,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"Conseil Régional du Limousin","keywords":"Mathematics; Regularization (linguistics); Scalar (mathematics); Limit (mathematics); Pure mathematics; Lattice (music); Vector space; Upper and lower bounds; Mathematical analysis; Geometry; Computer science","score_opus":0.0055216888782681165,"score_gpt":0.22232140390186328,"score_spread":0.21679971502359516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2087914194","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037466033,0.00007878839,0.99517107,0.0025387597,0.0006022094,0.00013064375,0.0000071156605,0.000041560186,0.0010552217],"genre_scores_gemma":[0.19192389,0.000015837406,0.80671436,0.00035760607,0.0003924569,0.0000037097882,0.000038926526,0.000009673505,0.00054353714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986271,0.000053568376,0.0006082081,0.00017345783,0.0003784595,0.00015918892],"domain_scores_gemma":[0.9977833,0.000034262826,0.0007417147,0.00016065425,0.0012175811,0.00006247523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036538317,0.00012157196,0.000216739,0.00011999869,0.00012677528,0.00021453248,0.00036621816,0.00008771919,0.00002485294],"category_scores_gemma":[0.00013650593,0.000111921305,0.00018677603,0.0008592805,0.000023579863,0.0009251776,0.000035652098,0.00005235696,0.0000029645216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025448246,0.000084671046,0.00029368247,0.0000044884146,0.00003137966,0.0000019148558,0.000015513799,0.82466805,0.0000759305,0.1709114,0.003618781,0.0002687237],"study_design_scores_gemma":[0.00085710635,0.00010971266,0.0014464427,0.000019867646,0.000054420234,0.000036238573,0.000007024312,0.9887062,0.00007990486,0.006913331,0.0016334627,0.00013629663],"about_ca_topic_score_codex":0.0000101710175,"about_ca_topic_score_gemma":0.000002550941,"teacher_disagreement_score":0.19154923,"about_ca_system_score_codex":0.000198576,"about_ca_system_score_gemma":0.00013569545,"threshold_uncertainty_score":0.45640182},"labels":[],"label_agreement":null},{"id":"W2088396524","doi":"10.1080/02331930902968365","title":"Characterization of subdual latticial cones in Hilbert spaces by the isotonicity of the metric projection","year":2010,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Cone (formal languages); Projection (relational algebra); Hilbert space; Dual cone and polar cone; Combinatorics; Regular polygon; Pure mathematics; Geometry","score_opus":0.006904141839578624,"score_gpt":0.21835937324312724,"score_spread":0.2114552314035486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088396524","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20828058,0.00000724222,0.78761506,0.0029626053,0.00037073714,0.00031270232,0.000010969365,0.000020200268,0.00041990133],"genre_scores_gemma":[0.98983127,0.000019665516,0.009791965,0.00009772651,0.000028481418,0.000011859528,0.000036370486,0.0000048380807,0.00017781166],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909276,0.000111603615,0.0002970975,0.00015205044,0.0002650491,0.00008145339],"domain_scores_gemma":[0.9990849,0.0000749563,0.00035005863,0.0002393479,0.00023671103,0.000014016194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032941904,0.00007340759,0.00011888997,0.0001606558,0.000089672125,0.000051233743,0.00034537519,0.00006693724,0.00004301154],"category_scores_gemma":[0.00016837275,0.000047004458,0.00004935818,0.0018675928,0.00005313835,0.0003776393,0.000068534726,0.00009777242,8.4471884e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003865693,0.00058795733,0.055519097,0.000037274353,0.00007078317,1.3602872e-7,0.0024096605,0.74804926,0.09420329,0.094649814,0.0001881949,0.0042458903],"study_design_scores_gemma":[0.00019409528,0.00001566323,0.02711766,0.0000053325475,0.000014583268,9.397307e-7,0.000014683957,0.9606031,0.011760604,0.00008594952,0.00012796506,0.000059435533],"about_ca_topic_score_codex":0.00017495693,"about_ca_topic_score_gemma":0.000108349144,"teacher_disagreement_score":0.7815507,"about_ca_system_score_codex":0.000016428365,"about_ca_system_score_gemma":0.000068692614,"threshold_uncertainty_score":0.19167861},"labels":[],"label_agreement":null},{"id":"W2088855121","doi":"10.1007/s10898-004-2692-9","title":"Global Stability Results for the Weak Vector Variational Inequality","year":2005,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":103,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Variational inequality; Stability (learning theory); Euclidean space; Applied mathematics; Euclidean geometry; Inequality; Solution set; Set (abstract data type); Vector optimization; Mathematical analysis; Vector space; Space (punctuation); Mathematical optimization; Pure mathematics; Optimization problem; Geometry","score_opus":0.023149396058827276,"score_gpt":0.2857274072162192,"score_spread":0.26257801115739193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088855121","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016568237,0.0000948843,0.9704823,0.02758462,0.0004438075,0.00016749963,0.0001294728,0.000027614837,0.0009041344],"genre_scores_gemma":[0.4213256,0.000036445777,0.57738733,0.00068535923,0.0005026707,0.000005075303,0.000025079862,0.0000033641898,0.000029050683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979175,0.00019759394,0.0008848284,0.00021204608,0.0006152854,0.00017276606],"domain_scores_gemma":[0.9968565,0.00039608896,0.0008469599,0.00029054857,0.0015043302,0.000105543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019611411,0.00012956721,0.00020595998,0.00003462048,0.00022246203,0.00023487178,0.00066492753,0.00007576338,0.000045447992],"category_scores_gemma":[0.0013486659,0.00009101034,0.0002178757,0.0009510891,0.000029904635,0.0010432453,0.00007664057,0.00007039268,0.0000042881397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015699146,0.00012281052,0.001222339,0.0000026446355,0.00007481151,2.0382848e-7,0.000040689818,0.8899126,9.1164327e-7,0.10473624,0.0024277796,0.0013019863],"study_design_scores_gemma":[0.0011420491,0.00008069861,0.022872405,0.0000056859935,0.000058547317,0.000016879965,0.000017243998,0.9704631,0.000004866311,0.0018717194,0.0033668212,0.00009998012],"about_ca_topic_score_codex":0.000017441309,"about_ca_topic_score_gemma":0.000039458333,"teacher_disagreement_score":0.42115992,"about_ca_system_score_codex":0.0005568539,"about_ca_system_score_gemma":0.00037802002,"threshold_uncertainty_score":0.3711294},"labels":[],"label_agreement":null},{"id":"W2091051467","doi":"10.1016/j.camwa.2004.03.003","title":"An intersection theorem formultivalued maps and applications","year":2004,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Intersection (aeronautics); Compactness theorem; Intersection theorem; Compact space; Minimax; Danskin's theorem; Brouwer fixed-point theorem; Arzelà–Ascoli theorem; Pure mathematics; Minimax theorem; Discrete mathematics; Kakutani fixed-point theorem; Fixed-point theorem; Schauder fixed point theorem; Mathematical economics","score_opus":0.008443613690726642,"score_gpt":0.2395887953311655,"score_spread":0.23114518164043887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091051467","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003115365,0.000016813608,0.99650306,0.00071781187,0.000017321103,0.00069195434,0.000006388733,0.00029635965,0.0014387805],"genre_scores_gemma":[0.22286129,0.000012740859,0.7761405,0.00023847053,0.00006241924,0.00058958563,0.000049597355,0.000014496394,0.000030912175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895024,0.000019228613,0.00026712954,0.00039601632,0.00020556232,0.00016179397],"domain_scores_gemma":[0.99872917,0.00007751776,0.00016939221,0.000689703,0.00018407329,0.00015017012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014695345,0.00016129647,0.00016324865,0.00017503835,0.00032878885,0.00026140915,0.00053736713,0.000048047918,0.0000044161184],"category_scores_gemma":[0.0000041189664,0.00013508707,0.000041429696,0.00069310865,0.0000747509,0.0004956952,0.00009183381,0.00008886307,0.000037008827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014996724,0.00025947602,0.000021892261,0.000020293513,0.00003347019,2.3116147e-7,0.00063101714,0.009904679,0.00007337858,0.9781652,0.000016910342,0.010871949],"study_design_scores_gemma":[0.0010223597,0.00013099257,0.0004019566,0.000042410917,0.00007365489,0.00007755124,0.00042943444,0.5035578,0.00039722733,0.4902639,0.003157881,0.00044479073],"about_ca_topic_score_codex":0.000010361543,"about_ca_topic_score_gemma":0.000010121519,"teacher_disagreement_score":0.49365315,"about_ca_system_score_codex":0.00009360187,"about_ca_system_score_gemma":0.00006038691,"threshold_uncertainty_score":0.55086905},"labels":[],"label_agreement":null},{"id":"W2091859835","doi":"10.1137/060658357","title":"Asplund Decomposition of Monotone Operators","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Remainder; Mathematics; Indecomposable module; Monotone polygon; Subderivative; Monotonic function; Operator (biology); Strongly monotone; Pure mathematics; Nonlinear system; Discrete mathematics; Algebra over a field; Mathematical analysis; Regular polygon; Arithmetic; Convex optimization","score_opus":0.008174040744057377,"score_gpt":0.2733736201165596,"score_spread":0.2651995793725022,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091859835","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021815149,0.000026884105,0.99429786,0.00069847645,0.00043414027,0.00006709505,0.0000010428411,0.000034216013,0.0022587974],"genre_scores_gemma":[0.41067648,0.00006125954,0.5885304,0.00041729573,0.00016476781,9.628225e-7,0.000012579549,0.000008589976,0.00012765556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987545,0.00006791914,0.00046465136,0.00016219073,0.00039859177,0.00015212473],"domain_scores_gemma":[0.998872,0.000069325084,0.00032202966,0.00017762884,0.00044051945,0.0001184934],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000712196,0.0001027135,0.00014539505,0.00042238575,0.00018034964,0.0001340511,0.0003008358,0.000061966704,0.00013343715],"category_scores_gemma":[0.00005530229,0.00009162569,0.0000914526,0.0007495683,0.000016704917,0.00065914716,0.000032487394,0.00012610713,0.000013484572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019938878,0.000099247365,0.0001466518,0.0000021034023,0.000028262528,0.0000042206175,0.00010515353,0.9589229,0.00014643637,0.038720403,0.00012753226,0.0016771202],"study_design_scores_gemma":[0.00042657313,0.00013804797,0.0007545285,0.000020990281,0.000013965673,0.00003292054,0.000015917316,0.9957033,0.001892611,0.00066136743,0.0002273002,0.000112527705],"about_ca_topic_score_codex":0.0000024408243,"about_ca_topic_score_gemma":8.748035e-7,"teacher_disagreement_score":0.40849498,"about_ca_system_score_codex":0.000082870494,"about_ca_system_score_gemma":0.000062022795,"threshold_uncertainty_score":0.37363872},"labels":[],"label_agreement":null},{"id":"W2095371903","doi":"10.1006/jmaa.2000.7298","title":"Three-Step Iterative Algorithms for Multivalued Quasi Variational Inclusions","year":2001,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":111,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Variational inequality; Resolvent; Algorithm; Iterative method; Applied mathematics; Mathematical analysis","score_opus":0.025618373823815647,"score_gpt":0.30633453171580266,"score_spread":0.280716157891987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095371903","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014095541,0.00005539908,0.9943961,0.0048156804,0.000013130742,0.00018651909,0.000013603732,0.000015279173,0.00036332157],"genre_scores_gemma":[0.06514511,0.00006600439,0.933998,0.00026982214,0.00018871078,0.00008363117,0.000020494774,0.000006597739,0.00022163698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985777,0.00003961172,0.00068015326,0.00020452,0.0003699227,0.00012810282],"domain_scores_gemma":[0.9977859,0.0006307977,0.00046950902,0.00022299027,0.00073521666,0.00015558499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006198185,0.00011805562,0.00038512703,0.0004052427,0.00032868862,0.00016340846,0.00035960565,0.000053649233,0.00012522952],"category_scores_gemma":[0.00013813475,0.00008624142,0.00035130154,0.0015166987,0.000037034326,0.00030668787,0.00009227989,0.00009208043,0.000008286655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008735014,0.00068554253,0.0004883266,0.00001209126,0.0011643225,0.0000011400739,0.00027139808,0.0045948597,0.00005773607,0.9768123,0.00018396595,0.015719583],"study_design_scores_gemma":[0.000305488,0.00004111796,0.0014303748,0.0000066314738,0.00057906704,0.000016591854,0.000031013482,0.8124399,0.000010371788,0.18292473,0.002123439,0.00009127414],"about_ca_topic_score_codex":0.0000051120123,"about_ca_topic_score_gemma":0.000011889441,"teacher_disagreement_score":0.80784506,"about_ca_system_score_codex":0.000031662254,"about_ca_system_score_gemma":0.000057296147,"threshold_uncertainty_score":0.35168234},"labels":[],"label_agreement":null},{"id":"W2095534080","doi":"10.1016/s0893-9659(01)00096-9","title":"Iterative methods for generalized variational inequalities","year":2002,"lang":"en","type":"article","venue":"Applied Mathematics Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Variational inequality; Monotonic function; Convergence (economics); Operator (biology); Class (philosophy); Applied mathematics; Iterative method; Mathematical optimization; Mathematical analysis","score_opus":0.04875417506054929,"score_gpt":0.3060053008492711,"score_spread":0.2572511257887218,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095534080","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007496658,0.000013698268,0.98956937,0.007278241,0.00008088204,0.00022458172,0.0000059897657,0.00010000365,0.0026522812],"genre_scores_gemma":[0.0020067836,0.000004493138,0.9913534,0.0059156585,0.000078407065,0.00017944953,0.000021811133,0.000010986195,0.00042902114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990381,0.000048345555,0.00032640944,0.00023466138,0.00018636986,0.00016612321],"domain_scores_gemma":[0.9987417,0.0006934334,0.00016451358,0.00026868714,0.00008418072,0.000047512673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051296677,0.00013098189,0.00020263137,0.00012385489,0.00014605101,0.00018133124,0.00034482245,0.000037508813,0.00017308243],"category_scores_gemma":[0.00008125726,0.00011774433,0.00009199961,0.00028510098,0.000020263662,0.00018545553,0.000060811268,0.000046947018,0.000046334077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.031343e-7,0.00005635595,7.93945e-7,0.00002247706,0.000066869514,1.351031e-7,0.002303265,0.0036426256,0.0039322036,0.9843305,0.0040357006,0.0016081755],"study_design_scores_gemma":[0.00037170466,0.0000058950964,0.0000052676723,0.0000030905055,0.000027917351,0.0000014205389,0.000025499214,0.92336637,0.0008295005,0.07248332,0.0027204223,0.00015958487],"about_ca_topic_score_codex":0.0000014620921,"about_ca_topic_score_gemma":2.938833e-7,"teacher_disagreement_score":0.91972375,"about_ca_system_score_codex":0.000032527263,"about_ca_system_score_gemma":0.000008621194,"threshold_uncertainty_score":0.48014745},"labels":[],"label_agreement":null},{"id":"W2096596625","doi":"10.48550/arxiv.1307.2712","title":"On cluster points of alternating projections","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Intersection (aeronautics); Combinatorics; Euclidean space; Regular polygon; Euclidean geometry; Cluster (spacecraft); Point (geometry); Geometry; Computer science","score_opus":0.06039888949447531,"score_gpt":0.19277730269254365,"score_spread":0.13237841319806834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096596625","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07095177,0.0000021923333,0.9215936,0.00031544516,0.00025488582,0.00016106611,0.0000071315385,0.000077161334,0.0066367737],"genre_scores_gemma":[0.9884369,0.000015464773,0.008422661,0.00017888371,0.00003126204,9.055584e-7,0.000011860935,0.0000064464484,0.0028956144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990186,0.000090126225,0.00017251784,0.00050292147,0.00009317175,0.0001226271],"domain_scores_gemma":[0.9987306,0.000099273624,0.00028905107,0.00055994815,0.0002612469,0.00005987174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012358531,0.00013753473,0.00017889171,0.00034310247,0.00008494013,0.00006825648,0.0007870843,0.00010633684,0.00011897759],"category_scores_gemma":[0.000048724265,0.00014502706,0.00015914727,0.0004956608,0.000027540726,0.00024322611,0.0007295422,0.00021387161,0.000110214656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025959214,0.00005259708,0.0003928826,0.0000117199825,0.000055977907,0.0000025109507,0.00006737922,0.5516715,0.0000023657535,0.44747147,0.00021008679,0.0000589081],"study_design_scores_gemma":[0.00018974779,0.000020723772,0.00057534775,0.000036457994,0.000029227553,5.4918036e-7,0.00001189067,0.9342378,0.000037515387,0.06468487,0.0000400959,0.00013582852],"about_ca_topic_score_codex":0.00023689595,"about_ca_topic_score_gemma":0.00001335361,"teacher_disagreement_score":0.9174851,"about_ca_system_score_codex":0.000083383115,"about_ca_system_score_gemma":0.00008718423,"threshold_uncertainty_score":0.5914032},"labels":[],"label_agreement":null},{"id":"W2096624591","doi":"10.1090/s0002-9939-02-06761-8","title":"A characterization of quasiconvex vector-valued functions","year":2002,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Quasiconvex function; Characterization (materials science); Mathematics; Regular polygon; Banach space; Cone (formal languages); Pure mathematics; Convex cone; Scalar (mathematics); Euclidean space; Space (punctuation); Mathematical analysis; Geometry; Subderivative; Convex optimization; Physics; Computer science; Algorithm","score_opus":0.014963326202238605,"score_gpt":0.22082380287450168,"score_spread":0.20586047667226307,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096624591","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42584786,0.000008708049,0.5633098,0.006529102,0.000056089953,0.0002317346,0.000008511089,0.000104275874,0.0039039347],"genre_scores_gemma":[0.94701624,0.000013056197,0.051914085,0.0003333437,0.000025581943,0.00001175038,8.117063e-7,0.0000067074625,0.00067839713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909693,0.000008169662,0.00029558616,0.00015448028,0.00033365667,0.000111194226],"domain_scores_gemma":[0.9989795,0.000047428784,0.00051845436,0.00013713982,0.00027619433,0.000041260544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016667377,0.00008368073,0.00024030861,0.000026611118,0.00008654711,0.000035670793,0.00047467256,0.000022317008,0.00010789138],"category_scores_gemma":[0.000112826114,0.00005804359,0.0002627848,0.0011002442,0.00017827509,0.00023024222,0.00013310475,0.00006664931,0.00001577017],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007673873,0.0008538165,0.0028713297,0.0002454693,0.0003234928,2.982861e-8,0.006690012,0.000053152497,0.17391217,0.81076646,0.002371666,0.0019047225],"study_design_scores_gemma":[0.00021622547,0.00010129469,0.011124458,0.00004757986,0.0000894281,0.000003368281,0.00038681063,0.96720487,0.009764004,0.01069916,0.0001837243,0.00017909128],"about_ca_topic_score_codex":0.00000384454,"about_ca_topic_score_gemma":3.4925975e-8,"teacher_disagreement_score":0.9671517,"about_ca_system_score_codex":0.000022298971,"about_ca_system_score_gemma":0.000009296757,"threshold_uncertainty_score":0.23669489},"labels":[],"label_agreement":null},{"id":"W2096911290","doi":"10.1007/s10898-015-0397-x","title":"A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces","year":2015,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Amparo à Pesquisa do Estado de Goiás; University of British Columbia; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior","keywords":"Mathematics; Variational inequality; Hilbert space; Subgradient method; Monotone polygon; Hyperplane; Monotonic function; Sequence (biology); Projection (relational algebra); Solution set; Strongly monotone; Projection method; Applied mathematics; Pure mathematics; Set (abstract data type); Dykstra's projection algorithm; Mathematical analysis; Mathematical optimization; Algorithm; Combinatorics","score_opus":0.028997157491633094,"score_gpt":0.2842935387154878,"score_spread":0.2552963812238547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096911290","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024431283,0.00009245656,0.99535406,0.0031598788,0.00052216556,0.00011691424,0.000008296826,0.000022400138,0.00047952047],"genre_scores_gemma":[0.022153242,0.000023311708,0.9771685,0.0002816504,0.00024675447,0.000006363859,0.00001961024,0.0000056738572,0.00009489719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984125,0.00014541003,0.00066003046,0.00016157531,0.0004729331,0.00014756393],"domain_scores_gemma":[0.9978264,0.00012210762,0.00064882013,0.000102443904,0.0012016683,0.00009858887],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014472397,0.00010836432,0.00021577817,0.00021247532,0.000066005996,0.00021515499,0.00026497955,0.00007915498,0.000008622966],"category_scores_gemma":[0.00065236754,0.000099661534,0.00010173531,0.0010138036,0.000012578096,0.0014078724,0.000045585144,0.000076721946,0.000001885445],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022657638,0.00008094408,0.0020659675,0.0000038939847,0.00003318535,0.0000018584801,0.00029595278,0.9287182,9.308051e-7,0.06286894,0.0005789515,0.0053284965],"study_design_scores_gemma":[0.0010988284,0.000120846875,0.0008317699,0.000022717226,0.000020470265,0.000038403985,0.00016934087,0.99030304,0.0000046002483,0.006720719,0.0005634314,0.00010583305],"about_ca_topic_score_codex":0.00006393412,"about_ca_topic_score_gemma":0.000014586639,"teacher_disagreement_score":0.061584815,"about_ca_system_score_codex":0.00043673514,"about_ca_system_score_gemma":0.00041293874,"threshold_uncertainty_score":0.40640795},"labels":[],"label_agreement":null},{"id":"W2100185599","doi":"10.1007/978-1-4757-3561-1_6","title":"A Bilevel Programming Approach to Optimal Price Setting","year":2002,"lang":"en","type":"book-chapter","venue":"Advances in computational management science","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Bilevel optimization; Class (philosophy); Computer science; Mathematical optimization; Operations research; Mathematical economics; Economics; Artificial intelligence; Mathematics; Algorithm; Optimization problem","score_opus":0.017043778524424222,"score_gpt":0.26373669772899744,"score_spread":0.2466929192045732,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100185599","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.537951e-7,0.000121099394,0.64642423,0.00045033125,0.00013734907,0.00039748338,0.0000030752085,0.00008597012,0.3523796],"genre_scores_gemma":[0.0031712751,0.00010352744,0.9552818,0.0007002292,0.000055869492,0.00007162145,0.000025237696,0.00001801286,0.040572412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960402,0.000019109233,0.00056282454,0.0013105699,0.0016148717,0.00045239562],"domain_scores_gemma":[0.99866766,0.00012864913,0.00031423804,0.0004434047,0.0002788014,0.00016724852],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007767769,0.00032331023,0.00027960422,0.001430926,0.0003490905,0.00047696443,0.001974737,0.00005885851,0.00003966662],"category_scores_gemma":[0.000043494772,0.00033391075,0.000090145404,0.0015397159,0.00017117137,0.0017299112,0.00093786704,0.00020167453,0.00014137158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.0488027e-7,0.000034116067,0.000007974225,0.00002317204,0.000008805033,0.0000045838156,0.000103620914,0.47820222,6.7823926e-8,0.487823,0.000043596334,0.033747938],"study_design_scores_gemma":[0.00018735307,0.00002898034,0.00024057306,0.00010485649,0.000012321165,0.0000066182424,0.00001827799,0.8851127,4.0766665e-7,0.047933094,0.065914206,0.00044062265],"about_ca_topic_score_codex":0.0000011529626,"about_ca_topic_score_gemma":6.4645275e-7,"teacher_disagreement_score":0.4398899,"about_ca_system_score_codex":0.0003088612,"about_ca_system_score_gemma":0.00008279002,"threshold_uncertainty_score":0.9999113},"labels":[],"label_agreement":null},{"id":"W2101393121","doi":"10.1007/s11228-011-0187-7","title":"Firmly Nonexpansive Mappings and Maximally Monotone Operators: Correspondence and Duality","year":2011,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; Okanagan College","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Iterated function; Monotone polygon; Mathematics; Duality (order theory); Fixed point; Dual (grammatical number); Convergence (economics); Pure mathematics; Monotonic function; Discrete mathematics; Mathematical analysis","score_opus":0.02664853637802502,"score_gpt":0.2432763106379922,"score_spread":0.21662777425996718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101393121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0874484,0.00021566778,0.9097159,0.0015311603,0.0000581932,0.00014638406,0.00005990237,0.00007519651,0.00074921513],"genre_scores_gemma":[0.89300394,0.00018673427,0.10514503,0.0010529745,0.000043167962,0.00001936101,0.00007050265,0.000007499956,0.00047077565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981659,0.00017158536,0.0003988314,0.0006620529,0.00039460108,0.00020701521],"domain_scores_gemma":[0.9988082,0.00014527711,0.00019429658,0.00027545702,0.0003716066,0.00020517014],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060897064,0.0002121489,0.00036474003,0.00050725654,0.00034894168,0.00027594727,0.00024545784,0.00009401995,0.00023495089],"category_scores_gemma":[0.00011997768,0.00019110058,0.0000984983,0.0015943422,0.00009187498,0.00078646874,0.00024688238,0.00010686571,0.000012215571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084273044,0.00019282657,0.08419247,0.000029671453,0.0024705215,0.000015541049,0.009564553,0.0018750149,0.000272323,0.8987916,0.00015383723,0.0023573681],"study_design_scores_gemma":[0.00036169525,0.00004016254,0.31270966,0.0000063900857,0.000462024,0.000008999268,0.00011749274,0.67766654,0.000027321108,0.008240182,0.0001119677,0.0002475735],"about_ca_topic_score_codex":0.0006240391,"about_ca_topic_score_gemma":0.000051862455,"teacher_disagreement_score":0.89055145,"about_ca_system_score_codex":0.000024203917,"about_ca_system_score_gemma":0.000077185,"threshold_uncertainty_score":0.77928555},"labels":[],"label_agreement":null},{"id":"W2101879572","doi":"10.1155/2011/305856","title":"A Penalization‐Gradient Algorithm for Variational Inequalities","year":2011,"lang":"en","type":"article","venue":"International Journal of Mathematics and Mathematical Sciences","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Variational inequality; Lipschitz continuity; Monotone polygon; Strongly monotone; Hilbert space; Operator (biology); Convergence (economics); Convex function; Monotonic function; Applied mathematics; Function (biology); Fixed point; Regular polygon; Pure mathematics; Discrete mathematics; Mathematical analysis","score_opus":0.060434319948709375,"score_gpt":0.300444247864233,"score_spread":0.24000992791552364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101879572","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054687646,0.000043100783,0.996006,0.0010939175,0.00024417884,0.000084252286,0.000007428187,0.000014439485,0.0019598242],"genre_scores_gemma":[0.025440851,0.000042165135,0.97406334,0.00021574911,0.00009923698,0.000008049482,0.0000015018336,0.0000043659597,0.00012473075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983752,0.000029385566,0.00063040375,0.00014181864,0.0006951872,0.00012802662],"domain_scores_gemma":[0.9980829,0.00048333575,0.0004911469,0.000084372645,0.00076470093,0.000093578994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015726201,0.00010202853,0.00020673733,0.0002541001,0.00011937565,0.0002307976,0.00080326217,0.000034807006,0.0001525247],"category_scores_gemma":[0.00046675332,0.000071914,0.00011385572,0.00020750918,0.00010755462,0.0006200066,0.000110659406,0.000047517387,0.000004242928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017636075,0.0002950391,0.000027194379,0.0000131949755,0.00008409219,0.0000021852811,0.0023157268,0.00006858736,0.000015256982,0.99139816,0.00010090821,0.005677866],"study_design_scores_gemma":[0.00022439694,0.0001013411,0.00005243214,0.000035722805,0.000019857789,0.00008777298,0.00024656358,0.48281804,0.000074806456,0.5159951,0.00027056583,0.000073399875],"about_ca_topic_score_codex":0.0000038895528,"about_ca_topic_score_gemma":7.2639926e-7,"teacher_disagreement_score":0.48274946,"about_ca_system_score_codex":0.000024584371,"about_ca_system_score_gemma":0.00010078824,"threshold_uncertainty_score":0.29325676},"labels":[],"label_agreement":null},{"id":"W2109154566","doi":"10.1016/j.jat.2006.01.003","title":"A strongly convergent reflection method for finding the projection onto the intersection of two closed convex sets in a Hilbert space","year":2006,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Intersection (aeronautics); Hilbert space; Projection (relational algebra); Regular polygon; Sequence (biology); Space (punctuation); Hilbert manifold; Projection method; Reflection (computer programming); Convex set; Convex analysis; Mathematical analysis; Convex combination; Dykstra's projection algorithm; Pure mathematics; Combinatorics; Convex optimization; Geometry; Mathematical optimization; Algorithm","score_opus":0.020540581436903682,"score_gpt":0.31526273283164136,"score_spread":0.2947221513947377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109154566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01495931,0.000028775567,0.9811473,0.0027017787,0.00033861047,0.00033605308,0.0000012606305,0.000011116759,0.0004758297],"genre_scores_gemma":[0.8787819,0.0000046502573,0.12073973,0.00010778834,0.00012312272,0.000025215913,0.000004335013,0.0000065616987,0.00020670787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834526,0.00053896627,0.000593157,0.00012493446,0.00029367034,0.00010402669],"domain_scores_gemma":[0.9979571,0.00048135532,0.0009736548,0.0001522924,0.00041780822,0.000017777586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035131346,0.00009044157,0.00017520937,0.00024234029,0.00013613861,0.000077929566,0.000262887,0.000042940035,0.000014698804],"category_scores_gemma":[0.00016592556,0.000054602104,0.00015837987,0.0006129574,0.00002702382,0.00049580674,0.000026672844,0.00014613578,7.975412e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025917141,0.00016935839,0.00034952126,0.000026569442,0.00010090657,3.1359198e-7,0.0032631168,0.10484981,0.0036879226,0.87983274,0.0004639832,0.0069966093],"study_design_scores_gemma":[0.0009860926,0.00012762485,0.0019464775,0.000032000164,0.0000519829,0.000028187396,0.000698498,0.88403565,0.004885803,0.10685402,0.0002840632,0.00006960211],"about_ca_topic_score_codex":0.00010851155,"about_ca_topic_score_gemma":0.00011667904,"teacher_disagreement_score":0.8638226,"about_ca_system_score_codex":0.00021358315,"about_ca_system_score_gemma":0.000110340654,"threshold_uncertainty_score":0.22266093},"labels":[],"label_agreement":null},{"id":"W2111288576","doi":"10.1080/09720510.2002.10701055","title":"Generalized<i>b</i>-invex vector valued functions","year":2002,"lang":"en","type":"article","venue":"Journal of Statistics and Management Systems","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Virginia Agricultural Experiment Station, Virginia Polytechnic Institute and State University","keywords":"Vector (molecular biology); Mathematics; Pure mathematics; Biology; Recombinant DNA","score_opus":0.02195350918094778,"score_gpt":0.22433460889976145,"score_spread":0.20238109971881368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111288576","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007706041,0.00037729894,0.9961758,0.00062826346,0.00064175384,0.00006595245,0.000013668204,0.000010997806,0.0020091885],"genre_scores_gemma":[0.32392427,0.0042711203,0.63740206,0.0008841024,0.0005306795,0.000013732608,0.000011089769,0.000020425212,0.032942493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910045,0.000049926482,0.00035612317,0.000098459765,0.00030469775,0.000090337955],"domain_scores_gemma":[0.99930376,0.00003091843,0.00028245847,0.00011777842,0.00018299608,0.000082089595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023288999,0.00007003964,0.00014891544,0.00017732092,0.000102273276,0.00022839071,0.00017081654,0.000016806516,0.000059730446],"category_scores_gemma":[0.0000129088085,0.00005679098,0.000037144215,0.00020501656,0.000011037515,0.0001966885,0.000047018966,0.00004504121,0.000019136773],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016294259,0.00005331175,0.00011313205,0.00004807384,0.00019770606,0.00002863946,0.00009548708,0.00698833,0.000007467935,0.91421735,0.07633241,0.0019164723],"study_design_scores_gemma":[0.0005166034,0.00006872971,0.0009880107,0.00002387042,0.00009864472,0.000034430388,0.000053309937,0.93681556,9.217903e-7,0.0011017654,0.06019803,0.00010011009],"about_ca_topic_score_codex":0.00000968395,"about_ca_topic_score_gemma":0.0000010793307,"teacher_disagreement_score":0.9298272,"about_ca_system_score_codex":0.000023010778,"about_ca_system_score_gemma":0.0000051176435,"threshold_uncertainty_score":0.23158689},"labels":[],"label_agreement":null},{"id":"W2111651852","doi":"10.4153/cjm-2005-037-5","title":"Cone-Monotone Functions: Differentiability and Continuity","year":2005,"lang":"en","type":"article","venue":"Canadian Journal of Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Differentiable function; Monotone polygon; Banach space; Separable space; Pure mathematics; Cone (formal languages); Metric space; Uniform continuity; Complement (music); Mathematical analysis; Regular polygon; Convex function; Property (philosophy); Geometry","score_opus":0.011864767567780796,"score_gpt":0.21636217445610006,"score_spread":0.20449740688831927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111651852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09370111,0.00015864972,0.9016444,0.003434328,0.000107372616,0.00004899706,0.000004897661,0.000007820878,0.00089242286],"genre_scores_gemma":[0.9220024,0.000009916033,0.07741444,0.00018391132,0.000056532986,6.2013424e-7,6.388092e-7,0.000002774943,0.00032881318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99936455,0.000027657685,0.00031530132,0.000070803675,0.00011836074,0.000103305094],"domain_scores_gemma":[0.99904275,0.00008515692,0.00018588739,0.0001449725,0.00024938438,0.00029184105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003498853,0.00005986614,0.00015174299,0.00014845493,0.000095827425,0.0001355701,0.00020557844,0.000030212237,0.00010388358],"category_scores_gemma":[0.00018813858,0.00005012009,0.000054410575,0.00015380925,0.00003888193,0.0002939531,0.000014699038,0.000080696744,0.000012930492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005234376,0.00041997634,0.040598024,0.000119178905,0.00047483135,0.000032832293,0.008763647,0.005388218,0.0001607704,0.8952137,0.008406713,0.040416826],"study_design_scores_gemma":[0.001990527,0.00019179634,0.07812646,0.00013443461,0.00027368107,0.000555718,0.000956471,0.8130768,0.0003633838,0.058714736,0.04495459,0.0006614071],"about_ca_topic_score_codex":0.00009714649,"about_ca_topic_score_gemma":0.0031030118,"teacher_disagreement_score":0.83649904,"about_ca_system_score_codex":0.00005869885,"about_ca_system_score_gemma":0.00026002116,"threshold_uncertainty_score":0.20438378},"labels":[],"label_agreement":null},{"id":"W2112679824","doi":"10.48550/arxiv.1108.2578","title":"Monotone operators and \"bigger conjugate\" functions","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Monotone polygon; Conjecture; Mathematics; Construct (python library); Operator (biology); Convolution (computer science); Skew; Pure mathematics; Function (biology); State (computer science); Algebra over a field; Mathematical economics; Discrete mathematics; Computer science; Algorithm; Artificial intelligence","score_opus":0.06424274385538217,"score_gpt":0.17015691415190812,"score_spread":0.10591417029652594,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112679824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045720413,0.000032154225,0.9462956,0.00019110226,0.00030895078,0.00012255376,0.000013195258,0.0001538066,0.0071621803],"genre_scores_gemma":[0.9922476,0.00015011553,0.0021294935,0.00019733525,0.0000351374,9.666443e-7,0.00002321168,0.000008175236,0.0052080043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988724,0.00007512249,0.00013879196,0.0007048143,0.000054919205,0.00015393154],"domain_scores_gemma":[0.99893445,0.00003253928,0.0001213837,0.0005708783,0.00019261488,0.00014811302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011293622,0.00018307588,0.00020492508,0.00024709824,0.00018609282,0.000121886354,0.0005682622,0.00016112157,0.0001879122],"category_scores_gemma":[0.000015078411,0.0001991864,0.00010795059,0.0004767116,0.0000639037,0.0003606402,0.00095663546,0.00022853324,0.00013878956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008475646,0.00007501363,0.003903457,0.000011540674,0.00017758354,0.000028534057,0.00019544832,0.17555834,0.000011171941,0.81949323,0.00038829443,0.00014891766],"study_design_scores_gemma":[0.0003576215,0.000025579797,0.0031201078,0.0000185455,0.0001364409,0.0000025137774,0.000048545695,0.96726733,0.00005913341,0.027725358,0.00083451974,0.0004042956],"about_ca_topic_score_codex":0.00021759268,"about_ca_topic_score_gemma":0.000027694912,"teacher_disagreement_score":0.9465271,"about_ca_system_score_codex":0.000056466633,"about_ca_system_score_gemma":0.00011495991,"threshold_uncertainty_score":0.81225854},"labels":[],"label_agreement":null},{"id":"W2112696","doi":"10.1007/978-1-4757-6871-8_12","title":"Computing Fixed Points by Averaging","year":2002,"lang":"en","type":"book-chapter","venue":"Applied optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Fixed point; Mathematics; Class (philosophy); Trajectory; Image (mathematics); Point (geometry); Computation; Current (fluid); Fixed-point iteration; Applied mathematics; Algorithm; Mathematical analysis; Computer science; Geometry; Artificial intelligence; Physics","score_opus":0.010242999848171765,"score_gpt":0.1913218275499503,"score_spread":0.18107882770177855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112696","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.398947e-8,0.00004597664,0.62014765,0.0004413817,0.000102067905,0.0001472011,0.000007806769,0.00020750763,0.37890032],"genre_scores_gemma":[0.00226193,0.00031343708,0.7040411,0.0024805015,0.00025526612,0.0000130565395,0.0012732856,0.000112805785,0.28924862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799687,0.000017801724,0.0005160175,0.00070926006,0.0005138362,0.00024623185],"domain_scores_gemma":[0.9986119,0.00008609865,0.00048080357,0.00052154803,0.00018774634,0.00011187935],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017453873,0.00036680241,0.0003677075,0.00028521646,0.00026904597,0.00031124224,0.0006163806,0.00027885428,0.0012966646],"category_scores_gemma":[0.000012933605,0.00040692353,0.00012879359,0.00020405259,0.000029251354,0.00024832686,0.00023105454,0.00025129734,0.00036940226],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001364439,0.000016664946,0.0000012184863,0.000008015272,0.000062374245,0.0000012622734,0.000088381574,0.5501533,0.0000037320654,0.43678015,0.009535285,0.0033482262],"study_design_scores_gemma":[0.00030132523,0.0000084484345,0.0000012749301,0.000026627456,0.000045170174,0.0000027081428,0.0000015798968,0.97402674,0.00001928649,0.0035130053,0.021617182,0.00043667314],"about_ca_topic_score_codex":0.0000029832613,"about_ca_topic_score_gemma":2.4583053e-7,"teacher_disagreement_score":0.43326715,"about_ca_system_score_codex":0.000124472,"about_ca_system_score_gemma":0.00003828415,"threshold_uncertainty_score":0.99983823},"labels":[],"label_agreement":null},{"id":"W2113598913","doi":"10.1186/1029-242x-2013-343","title":"Topological aspects of circular metric spaces and some observations on the KKM property towards quasi-equilibrium problems","year":2013,"lang":"en","type":"article","venue":"Journal of Inequalities and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of the Higher Education Commission; King Mongkut's University of Technology Thonburi; University of Alberta; Higher Education Research Promotion","keywords":"Mathematics; Metric space; Property (philosophy); Metric (unit); Topology (electrical circuits); Topological space; Point (geometry); Pure mathematics; Combinatorics; Geometry","score_opus":0.05634685208413428,"score_gpt":0.2565596029638458,"score_spread":0.2002127508797115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113598913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26151186,0.001750442,0.6109045,0.12172425,0.000088143286,0.0009044863,0.000020824027,0.000043446475,0.0030520326],"genre_scores_gemma":[0.99254215,0.00029142943,0.0061597205,0.0006269438,0.00008348637,0.000049609826,0.0000017730948,0.0000032487742,0.00024161336],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910885,0.00007556731,0.00038185896,0.00010974313,0.00023800247,0.00008597941],"domain_scores_gemma":[0.998842,0.00023273611,0.00032758547,0.00016762441,0.00036753272,0.000062513245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003208216,0.000075410164,0.00017319004,0.00013133843,0.00012243465,0.00016204768,0.00025965864,0.000033499724,0.00003466737],"category_scores_gemma":[0.00011194772,0.000037212605,0.000059936607,0.0004634014,0.000073701856,0.00041122842,0.00006931476,0.000089905916,0.000002062125],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.63705e-7,0.00010897116,0.00040682094,0.00002105023,0.00004021615,1.3467503e-7,0.00032564296,0.0006818807,0.00033675352,0.99612993,0.00022463365,0.0017231256],"study_design_scores_gemma":[0.00088556914,0.0010035358,0.08677489,0.00010984075,0.00015137081,0.0000701872,0.004236742,0.13662833,0.0010374153,0.74392235,0.024674902,0.00050483696],"about_ca_topic_score_codex":0.00011091477,"about_ca_topic_score_gemma":0.0000020540201,"teacher_disagreement_score":0.7310303,"about_ca_system_score_codex":0.000013408527,"about_ca_system_score_gemma":0.000064558255,"threshold_uncertainty_score":0.15626295},"labels":[],"label_agreement":null},{"id":"W2115871049","doi":"10.1007/s10107-002-0365-3","title":"Multiobjective optimization problem with variational inequality constraints","year":2003,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":59,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Variational inequality; Mathematical optimization; Inequality; Numerical analysis; Multi-objective optimization; Variational analysis; Applied mathematics; Mathematical economics; Mathematical analysis","score_opus":0.017092485251245033,"score_gpt":0.25091536161086175,"score_spread":0.2338228763596167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2115871049","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000052044736,0.0000041412986,0.98727316,0.00037526994,0.000019483869,0.00031182548,0.0000012658128,0.00016771727,0.011795067],"genre_scores_gemma":[0.19128582,4.3358267e-7,0.80844337,0.00009510443,0.000010645071,0.000059786846,0.000009816519,0.0000072596545,0.00008776924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985921,0.00014121497,0.00032163918,0.00031832262,0.00040687295,0.0002198775],"domain_scores_gemma":[0.9990397,0.00019590443,0.00014783241,0.00022477996,0.00028964825,0.00010210294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005964764,0.00013729636,0.00017716373,0.000090919,0.00017383002,0.00024915405,0.00019693267,0.000055522672,0.00031776226],"category_scores_gemma":[0.00029938656,0.00010638653,0.0000536718,0.0006519866,0.00007438933,0.00044056794,0.000036762227,0.00009593,0.000040769508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024795647,0.00023807271,0.00020007024,0.000022853306,0.00004921115,0.0000018977939,0.00044571565,0.067821376,0.0000028888114,0.9259078,0.0000055260084,0.0053021368],"study_design_scores_gemma":[0.00058179547,0.000062088235,0.00013470503,0.00002803252,0.000029589653,0.000028428994,0.0000919036,0.94999754,0.00005806883,0.048512045,0.0002376217,0.00023819198],"about_ca_topic_score_codex":0.0000024959352,"about_ca_topic_score_gemma":0.0000010557414,"teacher_disagreement_score":0.88217616,"about_ca_system_score_codex":0.000054460856,"about_ca_system_score_gemma":0.000105561616,"threshold_uncertainty_score":0.43383166},"labels":[],"label_agreement":null},{"id":"W2118402430","doi":"10.1109/cdc.1994.411006","title":"Necessary conditions for bilevel dynamic optimization problems","year":2002,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Bilevel optimization; Mathematical optimization; Constraint (computer-aided design); Optimization problem; Variable (mathematics); Bellman equation; Mathematics; Hierarchy; Upper and lower bounds; Optimal control; Control variable; Perturbation (astronomy); Function (biology); Computer science","score_opus":0.024780464741567334,"score_gpt":0.24886507388446538,"score_spread":0.22408460914289804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118402430","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000010046045,0.000017690427,0.98648924,0.0076680314,0.00008107854,0.0001783652,0.000012604889,0.00016262027,0.005380348],"genre_scores_gemma":[0.15588364,0.000049787486,0.83115476,0.0015401125,0.000025571633,0.00011019825,0.00013605661,0.000008828638,0.011091009],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999366,0.000016719168,0.00016893072,0.0002104332,0.000121911005,0.00011602625],"domain_scores_gemma":[0.9994724,0.00006488236,0.00006124896,0.00018702974,0.00016617215,0.000048279893],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000071785624,0.00006981571,0.00007767477,0.0001300983,0.00017246022,0.00012450284,0.00025263077,0.000034596236,0.0009928823],"category_scores_gemma":[0.000027393275,0.00006185229,0.000060146096,0.0004781252,0.000011904085,0.00054353167,0.000034882363,0.000025374715,0.000062350206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.2605256e-7,0.000065644796,0.000026138718,0.000004522184,0.000017022116,1.0638598e-7,0.00006299674,0.8836641,0.000020603386,0.110710025,0.004526984,0.0009016435],"study_design_scores_gemma":[0.0002223073,0.000017783448,0.00011112282,0.0000026434886,0.000008889,0.0000016595595,0.000005161089,0.9940369,0.00001008565,0.004337392,0.0011518479,0.00009420357],"about_ca_topic_score_codex":0.0000046366863,"about_ca_topic_score_gemma":0.0000053937592,"teacher_disagreement_score":0.1558736,"about_ca_system_score_codex":0.000023490269,"about_ca_system_score_gemma":0.000012257762,"threshold_uncertainty_score":0.99992037},"labels":[],"label_agreement":null},{"id":"W2119553628","doi":"10.1287/moor.2014.0672","title":"Clarke Subgradients for Directionally Lipschitzian Stratifiable Functions","year":2014,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Subderivative; Mathematics; Dimension (graph theory); Simple (philosophy); Pure mathematics; Limiting; Argument (complex analysis); Regular polygon; Geometry; Convex optimization","score_opus":0.07019848095179337,"score_gpt":0.35941221556697756,"score_spread":0.2892137346151842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119553628","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035285975,0.0000099539875,0.9847341,0.0019390782,0.0000863886,0.00032441432,0.000018407343,0.00004227708,0.009316771],"genre_scores_gemma":[0.47069886,0.0000061770584,0.51907533,0.00003340109,0.00007108659,0.0001832673,0.000055110715,0.000010873217,0.009865887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998528,0.00011917634,0.00035537226,0.00023632993,0.0005528713,0.00020826774],"domain_scores_gemma":[0.9975843,0.00048461423,0.00003873319,0.00046198326,0.0013468002,0.000083592364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016435483,0.0000796865,0.000151887,0.0003885549,0.00060703076,0.00026528497,0.00049236475,0.00005025536,0.00012875779],"category_scores_gemma":[0.0008134853,0.000071802584,0.00008539883,0.00092270394,0.000056380333,0.0003753401,0.0000892052,0.00011149665,0.000060117814],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000021623637,0.00034417427,0.00006621899,0.00004016588,0.000045184614,5.0169188e-8,0.00035750726,0.05794239,0.0013172308,0.9372753,0.001980282,0.0006293136],"study_design_scores_gemma":[0.00020419066,0.00008720906,0.00032963307,0.000013607299,0.000008272561,0.000001413662,0.00006935455,0.9806073,0.00063098554,0.014957861,0.0030116923,0.00007850491],"about_ca_topic_score_codex":0.00004248595,"about_ca_topic_score_gemma":0.00015808648,"teacher_disagreement_score":0.9226649,"about_ca_system_score_codex":0.00003471698,"about_ca_system_score_gemma":0.00015271398,"threshold_uncertainty_score":0.46688512},"labels":[],"label_agreement":null},{"id":"W2119717293","doi":"10.1016/j.jmaa.2010.04.029","title":"Examples of discontinuous maximal monotone linear operators and the solution to a recent problem posed by B.F. Svaiter","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monotone polygon; Skew; Strongly monotone; Domain (mathematical analysis); Monotonic function; Discrete mathematics; Operator (biology); Pseudo-monotone operator; Linear operators; Linear map; Pure mathematics; Combinatorics; Mathematical analysis; Finite-rank operator; Banach space; Operator space","score_opus":0.008207935201321504,"score_gpt":0.2436386498827819,"score_spread":0.23543071468146037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119717293","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026020925,0.00005526783,0.96375346,0.00987562,0.0000052928394,0.00016289002,0.0000069900366,0.0000049665327,0.00011458142],"genre_scores_gemma":[0.690623,0.00014996194,0.3087664,0.00023892042,0.000052502903,0.000037485595,0.0000047966664,0.0000046101154,0.00012236477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894917,0.000050064962,0.0005439891,0.00013538628,0.00023766959,0.00008369919],"domain_scores_gemma":[0.9988844,0.00018139038,0.0003067784,0.00019874521,0.00031650398,0.00011222365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007173241,0.00007984393,0.00032538857,0.00016708595,0.00011721273,0.00010815519,0.00025400342,0.000033712102,0.000053044307],"category_scores_gemma":[0.000072899704,0.000044770368,0.00012481501,0.00086328096,0.00008588384,0.00014394276,0.00008436365,0.000110548484,0.000002590163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006653961,0.0010562234,0.001192699,0.000053899515,0.0018882932,7.230025e-7,0.0022735922,0.0018236745,0.021686504,0.9353751,0.00071306265,0.033869702],"study_design_scores_gemma":[0.0022701314,0.00017919237,0.0054523484,0.000039642877,0.0030229592,0.000057978912,0.00031581573,0.86396915,0.0034930457,0.10937237,0.011381695,0.0004456964],"about_ca_topic_score_codex":0.000011180006,"about_ca_topic_score_gemma":0.000010883789,"teacher_disagreement_score":0.8621454,"about_ca_system_score_codex":0.00000552269,"about_ca_system_score_gemma":0.000020116187,"threshold_uncertainty_score":0.18256827},"labels":[],"label_agreement":null},{"id":"W2120001232","doi":"10.1007/s11228-009-0110-7","title":"An Answer to S. Simons’ Question on the Maximal Monotonicity of the Sum of a Maximal Monotone Linear Operator and a Normal Cone Operator","year":2009,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Mathematics; Monotonic function; Pseudo-monotone operator; Monotone polygon; Operator (biology); Discrete mathematics; Combinatorics; Finite-rank operator; Linear map; Pure mathematics; Banach space; Mathematical analysis","score_opus":0.01171228963208809,"score_gpt":0.2598769770426923,"score_spread":0.2481646874106042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120001232","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6615722,0.000050279472,0.32835773,0.009382484,0.00004521619,0.000309939,0.0001344125,0.000026276784,0.000121428704],"genre_scores_gemma":[0.97889453,0.000019168987,0.019308643,0.0016170044,0.00004915623,0.000012199241,0.00003765494,0.000004846463,0.0000568004],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998104,0.00031311275,0.00047112213,0.00041164595,0.0005333465,0.00016682522],"domain_scores_gemma":[0.99861294,0.00012512611,0.00022045484,0.00044528412,0.00046984863,0.00012635055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079612574,0.00018053285,0.00035436673,0.0002787528,0.00029683163,0.000117236305,0.0004473227,0.000077417935,0.00006778758],"category_scores_gemma":[0.00014164555,0.00011313999,0.00015783306,0.0018403835,0.00006599176,0.0003560198,0.00010280523,0.000119597935,0.0000025428865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016080176,0.0005126421,0.018226571,0.0000086340815,0.0008787373,9.874452e-7,0.0015237464,0.27415958,0.0035658455,0.69976336,0.000060894803,0.001138232],"study_design_scores_gemma":[0.00028634164,0.00016337342,0.22006409,0.0000090108715,0.0002845199,0.0000010061755,0.00004110874,0.7769478,0.0010072791,0.001038356,0.00003151986,0.00012562324],"about_ca_topic_score_codex":0.000280787,"about_ca_topic_score_gemma":0.00004861848,"teacher_disagreement_score":0.698725,"about_ca_system_score_codex":0.000028076207,"about_ca_system_score_gemma":0.0001111563,"threshold_uncertainty_score":0.46137148},"labels":[],"label_agreement":null},{"id":"W2120257557","doi":"10.1287/moor.1100.0480","title":"Necessary Optimality Conditions for Multiobjective Bilevel Programs","year":2011,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Bilevel optimization; Mathematical optimization; Mathematics; Constraint (computer-aided design); Complementarity (molecular biology); Optimization problem; Upper and lower bounds; Multi-objective optimization; Set (abstract data type); Computer science","score_opus":0.3096603620746675,"score_gpt":0.4282102137386596,"score_spread":0.11854985166399207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120257557","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034729003,0.0000090849935,0.990769,0.0004788826,0.00002881854,0.0007229717,0.00003840495,0.000045484157,0.0044344086],"genre_scores_gemma":[0.41245726,0.0000041365624,0.58667505,0.00001199605,0.00001129829,0.00030571522,0.000035439847,0.0000054189964,0.0004936795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987373,0.00009747177,0.00034139343,0.00022277879,0.0004053655,0.00019572269],"domain_scores_gemma":[0.99738806,0.00023587588,0.000043399068,0.0004310451,0.0018319482,0.00006968027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011006518,0.00007683793,0.00015204294,0.00030092185,0.0003938577,0.00013002139,0.0005649809,0.000048935202,0.0001360177],"category_scores_gemma":[0.00041858788,0.000066526714,0.00008395935,0.0008562493,0.00011949913,0.00048711122,0.00014443492,0.00009610371,0.00003061391],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003301877,0.0010777505,0.000091262526,0.000054736516,0.00007008826,3.8149997e-7,0.00484194,0.006439011,0.00042972522,0.98615456,0.00021877211,0.00061850174],"study_design_scores_gemma":[0.00023850489,0.00010755477,0.0005903392,0.000017717974,0.000010224141,0.0000017202957,0.00047802867,0.9565175,0.0022426292,0.039670773,0.00003803557,0.00008694041],"about_ca_topic_score_codex":0.00010626179,"about_ca_topic_score_gemma":0.00004607679,"teacher_disagreement_score":0.95007855,"about_ca_system_score_codex":0.000034999543,"about_ca_system_score_gemma":0.00018562989,"threshold_uncertainty_score":0.3029275},"labels":[],"label_agreement":null},{"id":"W2122615076","doi":"10.1090/s0002-9939-06-08770-3","title":"Fenchel duality, Fitzpatrick functions and the extension of firmly nonexpansive mappings","year":2006,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Extension (predicate logic); Duality (order theory); Mathematics; Pure mathematics; Computer science","score_opus":0.007859103356037676,"score_gpt":0.22022123093779086,"score_spread":0.21236212758175319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122615076","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4690146,0.00011330008,0.47108003,0.050907675,0.000061016763,0.00061874086,0.00001239723,0.00010807134,0.008084132],"genre_scores_gemma":[0.9291348,0.00002645782,0.06955181,0.0006580942,0.000032233238,0.000013311563,5.822574e-7,0.000005743066,0.00057694985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894685,0.000015074375,0.00034488778,0.00019135712,0.00037972533,0.00012210406],"domain_scores_gemma":[0.9985615,0.00028048118,0.00054797897,0.0001555274,0.00042434657,0.000030140987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000491034,0.00009839147,0.0002934961,0.000023318544,0.00017456981,0.000054562992,0.00042803315,0.00002511237,0.00000920524],"category_scores_gemma":[0.00020439202,0.000052719683,0.00027375377,0.00093059835,0.00064135005,0.00015653252,0.00033404763,0.00009162584,0.0000027894841],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018958222,0.00024619733,0.002842568,0.00016346616,0.00014801508,4.1110795e-8,0.0030737584,0.00025877304,0.0031393287,0.9803455,0.009067002,0.0006963918],"study_design_scores_gemma":[0.0009288824,0.00007064748,0.03290816,0.00007769677,0.00023931672,0.00001554476,0.0029415274,0.5835473,0.0013294352,0.37749135,0.00020029885,0.0002498181],"about_ca_topic_score_codex":0.000112878704,"about_ca_topic_score_gemma":3.4892994e-7,"teacher_disagreement_score":0.60285413,"about_ca_system_score_codex":0.000017222756,"about_ca_system_score_gemma":0.000019908,"threshold_uncertainty_score":0.23630808},"labels":[],"label_agreement":null},{"id":"W2124145662","doi":"10.1007/bf02842058","title":"Exceptional family of elements and the solvability of complementarity problems in uniformly smooth and uniformly convex Banach spaces","year":2005,"lang":"en","type":"article","venue":"Journal of Zhejiang University Science","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Banach space; Uniformly convex space; Complementarity (molecular biology); Regular polygon; Pure mathematics; Nonlinear complementarity problem; Reflexive space; Hilbert space; Lp space; Eberlein–Šmulian theorem; Interpolation space; Mathematical analysis; Mixed complementarity problem; Nonlinear system; Functional analysis; Geometry","score_opus":0.011199482382034566,"score_gpt":0.21487347134081022,"score_spread":0.20367398895877567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124145662","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9350445,0.00005560226,0.060917426,0.0032743455,0.000033358625,0.000106531465,0.000008272607,0.0000029311218,0.0005569917],"genre_scores_gemma":[0.97039145,0.00007799927,0.029402962,0.00008941103,0.0000066805696,4.3883606e-8,4.7417274e-7,7.41365e-7,0.000030218987],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99885607,0.00007926397,0.00032478882,0.00013055012,0.0004965063,0.000112810434],"domain_scores_gemma":[0.99884033,0.000109947745,0.0004629118,0.00011673801,0.00040280633,0.00006724184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002020093,0.000060620336,0.00018733912,0.0003109935,0.00014500116,0.000043359807,0.0005582937,0.000017899856,0.000015657002],"category_scores_gemma":[0.0000496141,0.000044943477,0.000042951204,0.00082960894,0.0006826063,0.0012122588,0.00020677535,0.00009175871,2.1693698e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016732846,0.00048718217,0.635647,0.000071604765,0.0001066469,0.000003892937,0.007891493,0.028864393,0.0033363095,0.31633502,0.00015118907,0.006937943],"study_design_scores_gemma":[0.002681287,0.00013466584,0.7466278,0.000040930405,0.0000317433,0.000008656621,0.0019375542,0.24475041,0.00011631543,0.0026488947,0.00091756537,0.000104146035],"about_ca_topic_score_codex":0.0002457892,"about_ca_topic_score_gemma":0.00023374979,"teacher_disagreement_score":0.31368613,"about_ca_system_score_codex":0.000089816676,"about_ca_system_score_gemma":0.00024260876,"threshold_uncertainty_score":0.25150913},"labels":[],"label_agreement":null},{"id":"W2124659975","doi":"10.1007/s10479-007-0176-2","title":"An overview of bilevel optimization","year":2007,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1430,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université de Montréal","funders":"","keywords":"Bilevel optimization; Theory of computation; Mathematical optimization; Simple (philosophy); Computer science; Connection (principal bundle); Focus (optics); Mathematical economics; Optimization problem; Mathematics; Algorithm","score_opus":0.4883983889418265,"score_gpt":0.5434584453478315,"score_spread":0.055060056406004976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124659975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002560046,0.00022528147,0.9928588,0.0024750687,0.00002429137,0.00011925361,0.000007702633,0.000016705195,0.0017128197],"genre_scores_gemma":[0.7460229,0.0005586738,0.25293645,0.00015914626,0.000028714852,0.0000058686537,0.000033421886,0.0000049150435,0.000249912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984534,0.00018050552,0.00036938683,0.00018762898,0.00062915,0.00017993744],"domain_scores_gemma":[0.99667394,0.00012892763,0.000039562598,0.0004434092,0.0026258288,0.00008834497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027461175,0.0000534294,0.00012080224,0.0005853513,0.00016192821,0.000078233286,0.00054899475,0.000044450782,0.00018333456],"category_scores_gemma":[0.0002446724,0.000048491762,0.00005165728,0.0019697275,0.00006233132,0.00077130576,0.00008446159,0.00007972075,0.000010906192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040321943,0.0001965255,0.0001558569,0.000009480978,0.00001657831,4.361599e-7,0.00026364514,0.6956886,0.0007331767,0.2987503,0.00020944349,0.003971916],"study_design_scores_gemma":[0.000089697176,0.000111324945,0.0030927868,0.000012302784,0.0000018646513,6.9261245e-7,0.000045124914,0.9853575,0.010311236,0.0006793385,0.00024149923,0.00005660742],"about_ca_topic_score_codex":0.00018810411,"about_ca_topic_score_gemma":0.00006541425,"teacher_disagreement_score":0.74346286,"about_ca_system_score_codex":0.000008941021,"about_ca_system_score_gemma":0.000169296,"threshold_uncertainty_score":0.20073849},"labels":[],"label_agreement":null},{"id":"W2126642927","doi":"10.1051/ro:2005003","title":"Un problème d'approximation matricielle : quelle est la matrice bistochastique la plus proche d'une matrice donnée ?","year":2005,"lang":"fr","type":"article","venue":"RAIRO - Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Physics; Humanities; Philosophy","score_opus":0.048200964470930446,"score_gpt":0.34690826325165497,"score_spread":0.29870729878072455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126642927","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007458543,0.0016183022,0.83378154,0.13460843,0.00017167068,0.0013952133,0.000055026107,0.00018919988,0.027434781],"genre_scores_gemma":[0.36090726,0.0014330976,0.4702552,0.00047948185,0.001073827,0.00081149774,0.000272233,0.00010480461,0.16466261],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9928258,0.0023419068,0.0010039095,0.0010702852,0.001817674,0.00094041193],"domain_scores_gemma":[0.99485147,0.001217703,0.00014265688,0.0009291278,0.002450293,0.00040872564],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.004644881,0.00041814108,0.0004396815,0.0013151739,0.0020308674,0.0024436417,0.001348462,0.0004985532,0.0010925422],"category_scores_gemma":[0.0010604037,0.00042354726,0.00021493435,0.008781879,0.00037595816,0.0023499636,0.00066499296,0.0011987654,0.0019593767],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022075925,0.00065468694,0.000010490663,0.000115107105,0.000070345566,0.000013299383,0.0034034564,0.46933585,0.00027139258,0.5120638,0.0056447196,0.008394748],"study_design_scores_gemma":[0.0008968474,0.00010528562,0.00030614782,0.0000742336,0.000057382058,0.000105659965,0.0003233469,0.9065656,0.00046960026,0.0013498086,0.08932034,0.00042576832],"about_ca_topic_score_codex":0.0020727452,"about_ca_topic_score_gemma":0.00069414725,"teacher_disagreement_score":0.510714,"about_ca_system_score_codex":0.0007852337,"about_ca_system_score_gemma":0.0023700153,"threshold_uncertainty_score":0.99982166},"labels":[],"label_agreement":null},{"id":"W2128808131","doi":"10.1137/060675794","title":"Primal-Dual Symmetric Intrinsic Methods for Finding Antiderivatives of Cyclically Monotone Operators","year":2007,"lang":"en","type":"article","venue":"SIAM Journal on Control and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Monotone polygon; Operator (biology); Subderivative; Dual (grammatical number); Combinatorics; Graph; Pure mathematics; Discrete mathematics; Regular polygon; Convex optimization","score_opus":0.015367876671003823,"score_gpt":0.31557494244765805,"score_spread":0.30020706577665424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128808131","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015983044,0.00017966084,0.99596316,0.0016612149,0.00015900661,0.0002030915,0.0000030631918,0.00002324751,0.00020926676],"genre_scores_gemma":[0.3368362,0.00015073018,0.6623707,0.00050875405,0.000087467306,0.0000036148153,0.0000042165398,0.0000073656656,0.00003102118],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866164,0.0001503303,0.0005584847,0.00022110676,0.00021327252,0.00019515211],"domain_scores_gemma":[0.9980624,0.0007615831,0.0004114316,0.000115964285,0.000521678,0.00012699547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017198029,0.00013330663,0.00029299397,0.0006205442,0.0002448631,0.00017171934,0.0001831276,0.00007312049,0.000013389776],"category_scores_gemma":[0.000660633,0.00010776515,0.00010521408,0.0009052139,0.000029811714,0.00065716833,0.000032624514,0.00012433504,5.527279e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015772053,0.00012757309,0.00069112715,0.000011844299,0.00015165718,0.0000022214008,0.00018138367,0.7803036,0.0011947814,0.13897614,0.000026772472,0.07817519],"study_design_scores_gemma":[0.0019356731,0.00029263485,0.0042438665,0.000020591582,0.000043017484,0.00001725398,0.00002228717,0.9909676,0.0011054071,0.0008955734,0.00031394116,0.00014215868],"about_ca_topic_score_codex":0.0000017463934,"about_ca_topic_score_gemma":4.2965007e-7,"teacher_disagreement_score":0.33523786,"about_ca_system_score_codex":0.00003960478,"about_ca_system_score_gemma":0.00006155069,"threshold_uncertainty_score":0.4394535},"labels":[],"label_agreement":null},{"id":"W2131083242","doi":"10.1017/s0305004103007448","title":"A Kolmogorov-type inequality","year":2004,"lang":"en","type":"article","venue":"Mathematical Proceedings of the Cambridge Philosophical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Type (biology); Inequality; Mathematics; Mathematical analysis; Biology","score_opus":0.02496696355232967,"score_gpt":0.25068587610255527,"score_spread":0.2257189125502256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131083242","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16821787,0.0000552044,0.50163215,0.28818092,0.0003123581,0.00079896086,0.000014109722,0.00050826,0.040280167],"genre_scores_gemma":[0.92844063,0.0000063211037,0.06996756,0.0013691762,0.00010322146,0.00000795401,8.918447e-7,0.0000095402,0.000094720264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983397,0.000010670242,0.000459327,0.00031514643,0.000652594,0.00022253515],"domain_scores_gemma":[0.9988931,0.00008005641,0.00022228176,0.00025337277,0.00042857332,0.00012261927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057860836,0.0001612003,0.00029388518,0.000023010929,0.00018026534,0.00009665793,0.0011112407,0.00011909957,0.000017515662],"category_scores_gemma":[0.00038982485,0.00010474294,0.0004289958,0.001006611,0.00016924147,0.00033912188,0.00052711,0.00024358345,0.000037123835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031658108,0.00020521658,0.00011973224,0.00008267424,0.000047415648,7.546599e-8,0.00021643334,0.00014665099,0.0010148693,0.9977597,0.0003732508,0.000030786483],"study_design_scores_gemma":[0.00042500242,0.00004657026,0.0010810726,0.000058633144,0.00004300951,0.000009975612,0.000025265608,0.040211238,0.0024806987,0.95536274,0.00007311272,0.00018265597],"about_ca_topic_score_codex":0.0000039445413,"about_ca_topic_score_gemma":4.9171636e-8,"teacher_disagreement_score":0.76022273,"about_ca_system_score_codex":0.00008778851,"about_ca_system_score_gemma":0.000057784284,"threshold_uncertainty_score":0.4271293},"labels":[],"label_agreement":null},{"id":"W2131096322","doi":"10.48550/arxiv.1305.4296","title":"The Method of Alternating Relaxed Projections for two nonconvex sets","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convergence (economics); Constraint (computer-aided design); Projection (relational algebra); Set (abstract data type); Mathematical optimization; Mathematics; Order (exchange); Local convergence; Projection method; Computer science; Algorithm; Dykstra's projection algorithm; Iterative method; Geometry","score_opus":0.08478204715207371,"score_gpt":0.2505383421827856,"score_spread":0.16575629503071188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131096322","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027586385,0.000009193502,0.99463075,0.0004500373,0.00035100957,0.0003650964,0.000013463831,0.00006660255,0.0013551839],"genre_scores_gemma":[0.7771219,0.000052137475,0.21782927,0.00007646945,0.00006529744,0.000009003651,0.000020252422,0.00001199494,0.004813666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988784,0.00015836331,0.00022626188,0.00049433886,0.00008253271,0.00016007229],"domain_scores_gemma":[0.99783975,0.00051680725,0.00044411674,0.0006190595,0.0005238121,0.00005647747],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045805145,0.00013972807,0.00019745651,0.0001685957,0.00030351963,0.00011820327,0.0011075373,0.00008958439,0.000016349708],"category_scores_gemma":[0.0001044439,0.00012096615,0.00024010178,0.0005171379,0.00003919188,0.00022939088,0.00068018085,0.00019227856,0.0000122645015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003878307,0.000023940607,0.00022130007,0.000014322455,0.00012870654,8.9519716e-7,0.000106752675,0.4961835,0.000015169908,0.50250214,0.00016107538,0.00063830893],"study_design_scores_gemma":[0.0002662824,0.000015612857,0.00015362134,0.000015832415,0.00006858303,9.1289405e-7,0.00004368831,0.93441606,0.000108206565,0.06441883,0.0003669639,0.00012539298],"about_ca_topic_score_codex":0.0004184973,"about_ca_topic_score_gemma":0.00005891576,"teacher_disagreement_score":0.7768015,"about_ca_system_score_codex":0.00008281576,"about_ca_system_score_gemma":0.00017588105,"threshold_uncertainty_score":0.49328566},"labels":[],"label_agreement":null},{"id":"W2132628835","doi":"10.1007/s11228-013-0239-2","title":"Restricted Normal Cones and the Method of Alternating Projections: Theory","year":2013,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Canada Research Chairs; Deutsche Forschungsgemeinschaft; Pacific Institute for the Mathematical Sciences","keywords":"Underpinning; Constraint (computer-aided design); Convergence (economics); Cone (formal languages); Mathematics; Computer science; Calculus (dental); Mathematical optimization; Applied mathematics; Algorithm; Engineering; Geometry; Economics","score_opus":0.01273990833924538,"score_gpt":0.2688874153341057,"score_spread":0.25614750699486033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132628835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043336567,0.000109013905,0.99187,0.0026932342,0.000035305293,0.00015905985,0.000011990161,0.000031527343,0.00075624423],"genre_scores_gemma":[0.72534007,0.00008507958,0.27321172,0.0004958594,0.00006899524,0.000057955167,0.000052804,0.000005428963,0.0006821043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834317,0.0005085691,0.0003996228,0.00028751607,0.0003409288,0.00012021484],"domain_scores_gemma":[0.99808794,0.00092161633,0.00029674533,0.00021496667,0.00042351245,0.000055198616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010032877,0.00011529633,0.00028030726,0.0004015681,0.00030003887,0.00019565538,0.00024048066,0.000045875204,0.00017315429],"category_scores_gemma":[0.00031010082,0.00007500362,0.00013772598,0.0018739993,0.00008264329,0.00046760062,0.00013636022,0.00008271798,0.0000043018526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013736988,0.00002759604,0.003399885,0.000005732394,0.0012216575,1.5451447e-7,0.0008181248,0.015221953,0.0000515343,0.9768947,0.000031905696,0.0023130658],"study_design_scores_gemma":[0.00054848584,0.000011307618,0.05897048,0.00000301996,0.00053488434,0.0000037439654,0.000112612,0.8864787,0.000018282712,0.053205322,0.000025467782,0.00008769928],"about_ca_topic_score_codex":0.00096427446,"about_ca_topic_score_gemma":0.00001549972,"teacher_disagreement_score":0.9236893,"about_ca_system_score_codex":0.000011435699,"about_ca_system_score_gemma":0.000048994407,"threshold_uncertainty_score":0.30585587},"labels":[],"label_agreement":null},{"id":"W2135539578","doi":"10.48550/arxiv.0810.3905","title":"General Resolvents for Monotone Operators: Characterization and Extension","year":2008,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Extension (predicate logic); Monotone polygon; Characterization (materials science); Mathematics; Pure mathematics; Mathematical economics; Algebra over a field; Computer science; Physics; Programming language; Geometry","score_opus":0.04426577178499384,"score_gpt":0.27164078118425783,"score_spread":0.22737500939926397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135539578","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4362115,0.000042456166,0.56219,0.00095172966,0.00027638557,0.00022718514,0.000017839435,0.00006217499,0.000020730135],"genre_scores_gemma":[0.91030735,0.0016964948,0.08156959,0.0019277767,0.0005878131,0.0001767057,0.0012315338,0.000036391175,0.0024663387],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986536,0.000053487758,0.00031351036,0.0006295535,0.00018822448,0.00016163803],"domain_scores_gemma":[0.998918,0.000026348473,0.00019959788,0.0004707227,0.00029629312,0.000089018045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001445617,0.00018940038,0.00024994972,0.00015262132,0.00020234552,0.00013598445,0.00035188755,0.00016618082,0.000010319845],"category_scores_gemma":[0.00005715834,0.0001817973,0.00009779316,0.0001885214,0.000021825848,0.0003039521,0.0005420789,0.00013189075,0.000016571],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019998748,0.0014138178,0.7295393,0.00053798227,0.0012128793,0.000062008745,0.0051417476,0.095241286,0.083326906,0.044500213,0.004910538,0.033913363],"study_design_scores_gemma":[0.00033876876,0.00002769236,0.27977294,0.000036517074,0.000028875364,0.000004157402,0.0000019864167,0.71528256,0.0010316313,0.00022875046,0.0029737817,0.00027233595],"about_ca_topic_score_codex":0.000025621179,"about_ca_topic_score_gemma":0.0000014986849,"teacher_disagreement_score":0.62004125,"about_ca_system_score_codex":0.000038831495,"about_ca_system_score_gemma":0.00008473047,"threshold_uncertainty_score":0.74134785},"labels":[],"label_agreement":null},{"id":"W2138849538","doi":"10.1016/j.jmaa.2004.10.032","title":"Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints","year":2005,"lang":"en","type":"article","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":246,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Constraint (computer-aided design); Mathematics; Mathematical optimization; Convexity; Complementarity (molecular biology); Mathematical economics; Piecewise; Economics; Mathematical analysis","score_opus":0.016095099081690066,"score_gpt":0.27933667387836386,"score_spread":0.2632415747966738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2138849538","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009963255,0.000047774447,0.98437494,0.0048631947,0.0000025145537,0.00023844234,0.000011928321,0.000018189021,0.00047974006],"genre_scores_gemma":[0.60195416,0.00001341342,0.3977118,0.00012573201,0.000047085516,0.00005902213,0.000010207581,0.0000043256878,0.00007424883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875075,0.000031861102,0.00058562605,0.00020269513,0.00028577796,0.00014326851],"domain_scores_gemma":[0.9985436,0.00032003448,0.00035009696,0.00020750135,0.00038022184,0.00019854086],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005345753,0.000117328935,0.000392351,0.00021831036,0.00014571272,0.00022097093,0.0002240909,0.000042969903,0.000087679255],"category_scores_gemma":[0.00004313823,0.00007856986,0.00017344482,0.00075659587,0.00019381312,0.00029768542,0.000054923406,0.00008338752,0.0000045586457],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008034048,0.00089883746,0.00043701293,0.0000686223,0.00088027626,8.560335e-7,0.00026337276,0.0041581164,0.00008494984,0.9845343,0.000055936864,0.008609642],"study_design_scores_gemma":[0.00064163713,0.00015140438,0.0014033573,0.000036047244,0.0018293641,0.00012777654,0.00023456741,0.91121227,0.00010681031,0.08335738,0.0006837953,0.00021560761],"about_ca_topic_score_codex":4.0262023e-7,"about_ca_topic_score_gemma":0.0000014337297,"teacher_disagreement_score":0.9070541,"about_ca_system_score_codex":0.000017103996,"about_ca_system_score_gemma":0.000046881847,"threshold_uncertainty_score":0.32039857},"labels":[],"label_agreement":null},{"id":"W2141360295","doi":"10.1007/s00199-008-0420-2","title":"Optimal partition of a large labor force into working pairs","year":2008,"lang":"en","type":"article","venue":"Economic Theory","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Uniqueness; Productivity; Wage; Workforce; Computer science; Extension (predicate logic); Partition (number theory); Pairing; Economics; Linear programming; Mathematical economics; Microeconomics; Labour economics; Mathematics; Mathematical optimization; Economic growth","score_opus":0.01032401099161992,"score_gpt":0.21982805127152028,"score_spread":0.20950404027990036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141360295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19458804,0.00006446472,0.8024508,0.0004820251,0.00014316187,0.000043908905,0.0000033068259,0.00009028991,0.0021340307],"genre_scores_gemma":[0.9704397,0.000019421874,0.02865769,0.00024724996,0.00005050784,0.0000051071706,0.000005482509,0.0000054398533,0.00056945323],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99946475,0.000059520586,0.00018320532,0.00015225627,0.000041989188,0.00009830776],"domain_scores_gemma":[0.99956983,0.00008208806,0.000105734434,0.0001860395,0.000022538867,0.00003376585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032278284,0.000054582564,0.0001031655,0.00007425783,0.00007880458,0.000016643453,0.00022123796,0.00002665684,0.00019205023],"category_scores_gemma":[0.000018463841,0.00005502411,0.00006224637,0.00009826894,0.000025290197,0.00024222684,0.00006789579,0.000032778313,0.000070168826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009278545,0.000029817582,0.0023518654,0.000002440332,0.000032254015,0.0000010254497,0.0013460817,0.05207053,0.000037105612,0.9432387,0.00023152225,0.0006493987],"study_design_scores_gemma":[0.00069104147,0.000044060886,0.009536433,0.000014658086,0.00001662504,0.000007294277,0.0001760754,0.9188471,0.001536846,0.06405019,0.0048329323,0.0002467621],"about_ca_topic_score_codex":0.0000067933024,"about_ca_topic_score_gemma":0.0000059213407,"teacher_disagreement_score":0.8791885,"about_ca_system_score_codex":0.000039253075,"about_ca_system_score_gemma":0.00005293642,"threshold_uncertainty_score":0.2243818},"labels":[],"label_agreement":null},{"id":"W2141832437","doi":"10.1090/conm/568/11273","title":"On the Maximal Monotonicity of the Sum of a Maximal Monotone Linear Relation and the Subdifferential Operator of a Sublinear Function","year":2012,"lang":"en","type":"other","venue":"Contemporary mathematics - American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Monotonic function; Sublinear function; Monotone polygon; Subderivative; Operator (biology); Function (biology); Relation (database); Pure mathematics; Mathematical analysis; Discrete mathematics; Combinatorics; Regular polygon; Geometry","score_opus":0.020676825043126002,"score_gpt":0.23790764241115842,"score_spread":0.2172308173680324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141832437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0071020904,0.00034746525,0.9636206,0.002484901,0.000133623,0.0017649995,0.000102161925,0.00008317055,0.02436096],"genre_scores_gemma":[0.9247567,0.00010935975,0.06641281,0.00036875013,0.00012253819,0.00010629519,0.000021560707,0.00015672202,0.007945251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99741805,0.00033691418,0.0009788887,0.00029713794,0.0007697287,0.00019925502],"domain_scores_gemma":[0.9956116,0.0011698738,0.0019478811,0.0010099487,0.00019007624,0.00007061107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001144983,0.00033352282,0.0009851271,0.000073369745,0.00012767855,0.000043979257,0.0008839418,0.00017352123,0.00029071353],"category_scores_gemma":[0.0003472524,0.0001606408,0.0006109097,0.00070477295,0.0012854306,0.00009843822,0.000387788,0.000334244,0.000008824676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060328402,0.0005441148,0.0001340975,0.0004895995,0.00068298687,9.6932034e-8,0.0025262367,0.000059628182,0.00008410858,0.9901463,0.0051719667,0.000100538135],"study_design_scores_gemma":[0.0019411644,0.00023737864,0.00064689387,0.0006145152,0.0006366382,0.000004972189,0.0010002425,0.912511,0.0005517456,0.08053783,0.0008224535,0.00049517676],"about_ca_topic_score_codex":0.00007354854,"about_ca_topic_score_gemma":0.0000018628075,"teacher_disagreement_score":0.91765463,"about_ca_system_score_codex":0.000026822156,"about_ca_system_score_gemma":0.00014365384,"threshold_uncertainty_score":0.6550742},"labels":[],"label_agreement":null},{"id":"W2145764229","doi":"10.1155/fpta/2006/96737","title":"On the orbits of \"Equation missing\" -closure points of ultimately nonexpansive mappings","year":2006,"lang":"en","type":"article","venue":"Fixed Point Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Mathematics; Image (mathematics); Closure (psychology); Commutative property; Semigroup; Orbit (dynamics); Pure mathematics; Mathematical analysis; Computer science; Computer vision","score_opus":0.01016170656215075,"score_gpt":0.22169475868178107,"score_spread":0.2115330521196303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145764229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007653945,0.000031241463,0.983799,0.0037581285,0.000013132541,0.00022204182,0.00002208575,0.000027811246,0.004472617],"genre_scores_gemma":[0.9876103,0.0000075969488,0.011633323,0.00034611524,0.000025156813,0.000051449984,0.000033194246,0.000004458949,0.00028844344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992312,0.00011660486,0.00026104882,0.00016898781,0.0001480968,0.00007403651],"domain_scores_gemma":[0.9986306,0.0006315481,0.00023319526,0.00028725772,0.00019399673,0.00002342398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048517555,0.00007726434,0.00011440738,0.00008246223,0.00015116016,0.000028629862,0.00023120781,0.00003617091,0.00007846458],"category_scores_gemma":[0.00007514622,0.000055851902,0.000054398264,0.00042420547,0.000072762305,0.0001133475,0.00003992679,0.000051529758,0.000017639846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075475955,0.00007523223,0.000041967138,0.0000087297385,0.000015860396,5.0002775e-8,0.00021408006,0.001293654,0.001492624,0.9953538,0.000245081,0.0012513524],"study_design_scores_gemma":[0.00026496474,0.000031337495,0.0050615296,0.00003151818,0.00003253257,0.0000023848427,0.0000958914,0.03725505,0.015240907,0.9408462,0.0010181387,0.00011957045],"about_ca_topic_score_codex":0.000014521963,"about_ca_topic_score_gemma":0.0000010460642,"teacher_disagreement_score":0.9799563,"about_ca_system_score_codex":0.000008011093,"about_ca_system_score_gemma":0.000025481511,"threshold_uncertainty_score":0.22775745},"labels":[],"label_agreement":null},{"id":"W2146559036","doi":"10.1186/s13663-015-0329-y","title":"Topological fixed point theory and applications to variational inequalities","year":2015,"lang":"en","type":"article","venue":"Fixed Point Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"King Abdulaziz University","keywords":"Algorithm; Artificial intelligence; Computer science","score_opus":0.027005105996212274,"score_gpt":0.2798906349390198,"score_spread":0.2528855289428075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146559036","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042492326,0.00012793673,0.9873945,0.005772194,0.00003649999,0.0005522649,0.00006769349,0.00017331332,0.0054506683],"genre_scores_gemma":[0.8506257,0.00008383798,0.12989633,0.009221548,0.0006752196,0.003200188,0.000330714,0.000032091626,0.005934359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816036,0.0005171376,0.00036772745,0.0005092826,0.000233655,0.00021180656],"domain_scores_gemma":[0.9976422,0.0011666723,0.00012446808,0.00048375173,0.00025558207,0.00032728136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022828754,0.00018141474,0.00021079784,0.00017496309,0.0004169883,0.00020661294,0.0004087524,0.000093428345,0.00019556588],"category_scores_gemma":[0.00029779997,0.00015912975,0.000057510057,0.0006016248,0.00012763022,0.00034241012,0.00030580483,0.0001264964,0.00014707942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026668993,0.00009086321,0.00007748457,0.0000059577396,0.000032984408,2.41934e-7,0.000884557,0.00060071895,0.00005583466,0.99229366,0.00047504998,0.0054559913],"study_design_scores_gemma":[0.00033188902,0.000047804737,0.0013345815,0.000005330462,0.000036126035,0.00001528377,0.00068214384,0.005016186,0.00009353128,0.95195955,0.04022245,0.0002551199],"about_ca_topic_score_codex":0.000011157923,"about_ca_topic_score_gemma":0.000004276202,"teacher_disagreement_score":0.85749817,"about_ca_system_score_codex":0.000040268802,"about_ca_system_score_gemma":0.00009195996,"threshold_uncertainty_score":0.64891225},"labels":[],"label_agreement":null},{"id":"W2152831483","doi":"10.1007/s11590-011-0383-2","title":"Every maximally monotone operator of Fitzpatrick–Phelps type is actually of dense type","year":2011,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Pseudo-monotone operator; Mathematics; Type (biology); Monotonic function; Monotone polygon; Banach space; Operator (biology); Pure mathematics; Space (punctuation); Discrete mathematics; Finite-rank operator; Operator space; Computer science; Mathematical analysis","score_opus":0.023883726949208324,"score_gpt":0.2162120690726145,"score_spread":0.1923283421234062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152831483","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014361829,0.000041199502,0.9833597,0.0008925631,0.00019455554,0.00012340354,0.00000686057,0.000046958892,0.00097292644],"genre_scores_gemma":[0.40595648,0.00014654834,0.59069496,0.0028860343,0.000026884922,0.000003325913,0.000021930007,0.000015970843,0.00024782447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881035,0.00006481739,0.00043016163,0.000262568,0.00029398472,0.00013813384],"domain_scores_gemma":[0.99857134,0.0000403886,0.0002937645,0.00038688636,0.00064311264,0.000064527616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016040103,0.00012946586,0.00022334805,0.00028143314,0.000052116902,0.000031890435,0.0004454163,0.00006493965,0.0008656502],"category_scores_gemma":[0.00008803404,0.00012494464,0.000081330036,0.0013261128,0.000040264367,0.0004800637,0.000096107746,0.000055349396,0.00003552831],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104821076,0.00025107202,0.0032623622,0.000041473057,0.00022196824,0.0000058356145,0.0035303454,0.9777937,0.004516626,0.0053213774,0.004332548,0.00061787094],"study_design_scores_gemma":[0.0005399269,0.00014469103,0.0023187434,0.000024180705,0.00007220033,0.000004338248,0.0000372097,0.9869082,0.009317121,0.00005045104,0.00029425693,0.00028869722],"about_ca_topic_score_codex":0.000044038545,"about_ca_topic_score_gemma":9.758194e-7,"teacher_disagreement_score":0.3926647,"about_ca_system_score_codex":0.000025650046,"about_ca_system_score_gemma":0.0001071414,"threshold_uncertainty_score":0.94782627},"labels":[],"label_agreement":null},{"id":"W2155583876","doi":"10.1142/s0219199701000524","title":"ESSENTIAL SMOOTHNESS, ESSENTIAL STRICT CONVEXITY, AND LEGENDRE FUNCTIONS IN BANACH SPACES","year":2001,"lang":"en","type":"article","venue":"Communications in Contemporary Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":301,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of Guelph","funders":"","keywords":"Mathematics; Convexity; Banach space; Smoothness; Pure mathematics; Duality (order theory); Subderivative; Mathematical analysis; Mathematical proof; Legendre polynomials; Uniformly convex space; Regular polygon; Banach manifold; Convex optimization; Lp space; Geometry","score_opus":0.07173092289625761,"score_gpt":0.3143689845143521,"score_spread":0.24263806161809448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155583876","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023101604,0.0019780213,0.9301585,0.014632251,0.00017298508,0.00049573556,0.000016279082,0.0001645582,0.029280094],"genre_scores_gemma":[0.94663954,0.0005319111,0.051975843,0.000107287415,0.000020011263,0.000045468834,0.00005850192,0.000010414517,0.0006110367],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985355,0.00024089376,0.00057637383,0.00026388842,0.00022147912,0.00016186784],"domain_scores_gemma":[0.9977597,0.00049574964,0.00020320232,0.0013543795,0.0001226646,0.00006429672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006397457,0.00015038629,0.0002664179,0.00045723352,0.00020761197,0.000235808,0.0011957632,0.00008520323,0.000046952864],"category_scores_gemma":[0.00013786755,0.0001561839,0.000054274406,0.0014119186,0.00013929646,0.0007674869,0.00068842754,0.00022779767,0.000022487247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015179084,0.0019365756,0.07699711,0.00008667525,0.000105894425,0.00002282672,0.004740777,0.0023404462,0.00009559825,0.9101884,0.0019412058,0.0015293163],"study_design_scores_gemma":[0.0010132749,0.000023378323,0.007942854,0.00008625133,0.00002091099,0.000025525143,0.0012313495,0.963943,0.000028672632,0.019778172,0.005565752,0.00034084002],"about_ca_topic_score_codex":0.00020989712,"about_ca_topic_score_gemma":0.0005624987,"teacher_disagreement_score":0.96160257,"about_ca_system_score_codex":0.000047149937,"about_ca_system_score_gemma":0.00016317127,"threshold_uncertainty_score":0.6368995},"labels":[],"label_agreement":null},{"id":"W2157245517","doi":"10.1017/s0004972700035322","title":"Lipschitz functions with maximal Clarke subdifferentials are staunch","year":2005,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subderivative; Mathematics; Lipschitz continuity; Banach space; Expansive; Separable space; Pure mathematics; Space (punctuation); Mathematical analysis; Regular polygon; Geometry; Computer science","score_opus":0.01726263267140209,"score_gpt":0.22546308369471718,"score_spread":0.20820045102331508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157245517","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019746846,0.000011335128,0.83050853,0.14581046,0.00007867859,0.00031665323,0.000023830291,0.00013529294,0.003368372],"genre_scores_gemma":[0.64754224,0.0000042642114,0.31170455,0.0011089039,0.000120911354,0.000021146856,0.0000046602922,0.000015410596,0.03947793],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987102,0.00007301718,0.00031894978,0.00023237447,0.00045642065,0.00020905092],"domain_scores_gemma":[0.9989592,0.0001041976,0.00022533345,0.00049320044,0.00013085952,0.00008720412],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002755975,0.00013984942,0.0002248011,0.000017382094,0.00018969503,0.00009634252,0.0006470491,0.00007935011,0.0026474104],"category_scores_gemma":[0.000051787218,0.000083317085,0.00031659013,0.00029531357,0.0001075617,0.00005991241,0.00016398018,0.0001562765,0.00023371003],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003744436,0.002166644,0.004622655,0.0003556907,0.0011326846,0.0000014967873,0.0022504667,0.020190075,0.0005818832,0.41920874,0.5477286,0.0017236162],"study_design_scores_gemma":[0.0056116446,0.00043621182,0.11811056,0.00083185366,0.0013656692,0.0001372437,0.002408635,0.25516316,0.010304225,0.049760856,0.55323696,0.0026329644],"about_ca_topic_score_codex":0.0000077361265,"about_ca_topic_score_gemma":0.0000020975845,"teacher_disagreement_score":0.6277954,"about_ca_system_score_codex":0.00003847964,"about_ca_system_score_gemma":0.000030781037,"threshold_uncertainty_score":0.9982643},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02566835373587489,"score_gpt":0.280487716216663,"score_spread":0.2548193624807881,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158961014","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013133175,0.000063431944,0.98455733,0.0009075369,0.00009953692,0.00019038055,0.00007874453,0.00011670401,0.0008531361],"genre_scores_gemma":[0.8459004,0.000031458938,0.1398644,0.00088531285,0.000117128206,0.0001353004,0.000463707,0.000018634873,0.012583614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982015,0.00012847094,0.00042310072,0.000631934,0.00035200143,0.0002629813],"domain_scores_gemma":[0.99824494,0.00013433927,0.00017908182,0.0005597894,0.0007394298,0.00014241293],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00025406,0.00019427609,0.000412074,0.0006359826,0.0006099291,0.00012191551,0.00042810952,0.0000745019,0.0010220446],"category_scores_gemma":[0.00010093949,0.00017697357,0.000429719,0.0045711165,0.00007324131,0.00058273185,0.00010730062,0.00008887299,0.00009770306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014311694,0.0008069602,0.030389132,0.000026734457,0.02088135,0.00004059851,0.008085277,0.8279464,0.0015530455,0.076219305,0.032401126,0.0015069552],"study_design_scores_gemma":[0.0005655585,0.000046965844,0.0076100794,9.1631773e-7,0.00072586164,0.0000058688593,0.00015440297,0.9877443,0.00030006067,0.00067124725,0.0019126436,0.000262131],"about_ca_topic_score_codex":0.00016000246,"about_ca_topic_score_gemma":0.00010868213,"teacher_disagreement_score":0.84469295,"about_ca_system_score_codex":0.000052309984,"about_ca_system_score_gemma":0.00011355859,"threshold_uncertainty_score":0.99989116},"labels":[],"label_agreement":null},{"id":"W2159075008","doi":"10.5539/mas.v3n11p11","title":"Remarks on New Properties of Preinvex Functions","year":2009,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation Project of Chongqing, Chongqing Science and Technology Commission; Chongqing Science and Technology Commission","keywords":"Function (biology); Point (geometry); Regular polygon; Convex function; Type (biology); Mathematics; Applied mathematics; Pure mathematics; Geometry; Geology","score_opus":0.021226584451079823,"score_gpt":0.21861688158049028,"score_spread":0.19739029712941045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159075008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016444826,0.000014552748,0.96788085,0.0018315533,0.000049197086,0.00008698512,3.4344575e-7,0.000068291825,0.028423773],"genre_scores_gemma":[0.96783966,0.0000021164321,0.03002274,0.0007938162,0.00002215665,0.0000030005713,5.2674045e-7,0.0000017508564,0.0013142595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877876,0.000008259666,0.00016405358,0.00034436496,0.0005433847,0.00016115727],"domain_scores_gemma":[0.99929917,0.0000106004545,0.0000770074,0.0004086155,0.000105177794,0.00009943143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024893568,0.00007668049,0.00009866151,0.00019438192,0.00020199794,0.00011022477,0.00073409255,0.000022982249,0.000016840002],"category_scores_gemma":[0.000031807274,0.000060188126,0.000033960685,0.0012477918,0.000088925655,0.00032238974,0.000067248184,0.00005729376,0.0000390142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001587894,0.00014843479,0.000021012675,0.0000031953907,0.000006900933,2.7011825e-7,0.0011087209,0.091090046,0.34696975,0.5025892,0.0006331226,0.05741342],"study_design_scores_gemma":[0.00012334173,0.000041722655,0.0012183056,0.0000075621524,0.0000039151737,6.661074e-7,0.000010117133,0.9647561,0.018562619,0.015040334,0.00014087337,0.00009446317],"about_ca_topic_score_codex":0.000007820485,"about_ca_topic_score_gemma":0.0000015088534,"teacher_disagreement_score":0.96619517,"about_ca_system_score_codex":0.000032933378,"about_ca_system_score_gemma":0.00023361572,"threshold_uncertainty_score":0.24544007},"labels":[],"label_agreement":null},{"id":"W2159874655","doi":"10.1007/s10107-013-0735-z","title":"First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints","year":2013,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":70,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Complementarity (molecular biology); Cone (formal languages); Second-order cone programming; Stationary point; Complementarity theory; Positive-definite matrix; Limiting; Mathematical optimization; Applied mathematics; Semidefinite programming; Mathematical analysis; Algorithm; Regular polygon; Convex optimization; Geometry; Nonlinear system","score_opus":0.036952661457493305,"score_gpt":0.2794488674892481,"score_spread":0.24249620603175476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159874655","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010500383,0.0000044216017,0.99082726,0.0038927773,0.000021079959,0.0017397831,0.00001373743,0.00030063576,0.0021502615],"genre_scores_gemma":[0.2175397,4.9698514e-7,0.7808929,0.00025812435,0.000022105509,0.0010346492,0.0000959617,0.00001572165,0.0001403155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796456,0.000051438976,0.0005969612,0.00045000506,0.00044124582,0.00049578183],"domain_scores_gemma":[0.998005,0.0005742438,0.00018886333,0.0004391156,0.00054859347,0.0002442092],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040235705,0.0002454861,0.00040358794,0.00008417424,0.0004147176,0.00069793506,0.00045758678,0.00007653503,0.0014428132],"category_scores_gemma":[0.00022146935,0.00018611753,0.00013133713,0.00056587806,0.0003279886,0.00051652803,0.00014423423,0.00013597759,0.0002964019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000042297647,0.00089721807,0.00032018824,0.0002625781,0.00016284584,0.0000022325428,0.00041948567,0.0002507406,0.0000103831135,0.98994625,0.00022751022,0.00749632],"study_design_scores_gemma":[0.0010420589,0.00020876773,0.00026379892,0.00012633586,0.000100441895,0.00004298867,0.00026848656,0.76777554,0.000022381617,0.22833699,0.0014087779,0.0004034571],"about_ca_topic_score_codex":0.000018751882,"about_ca_topic_score_gemma":0.0000129720065,"teacher_disagreement_score":0.7675248,"about_ca_system_score_codex":0.00005253444,"about_ca_system_score_gemma":0.00006512881,"threshold_uncertainty_score":0.99947},"labels":[],"label_agreement":null},{"id":"W2161827144","doi":"10.1287/trsc.1030.0039","title":"A New Look at the Multiclass Network Equilibrium Problem","year":2004,"lang":"en","type":"article","venue":"Transportation Science","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Institut national de recherche en informatique et en automatique (INRIA)","keywords":"Variational inequality; Solver; Convergence (economics); Mathematical optimization; Class (philosophy); Operator (biology); Property (philosophy); Computer science; Flow network; Mathematical economics; Mathematics; Economics; Artificial intelligence","score_opus":0.012934888887719436,"score_gpt":0.24490170712119966,"score_spread":0.23196681823348023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161827144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0101610245,0.000033392622,0.9797601,0.008475451,0.000193752,0.0001543797,0.0000018623099,0.000106690335,0.001113358],"genre_scores_gemma":[0.6681787,0.00000673422,0.32793117,0.0012018363,0.00006761957,0.0000111665895,0.0000102751055,0.000005286811,0.0025872088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984169,0.000015815505,0.00024703817,0.00037868356,0.0006698693,0.00027168915],"domain_scores_gemma":[0.9991842,0.000042187163,0.000108915854,0.0003443669,0.00017822544,0.00014213723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048817016,0.00009232674,0.000083881,0.000071895985,0.00039700302,0.00020563122,0.0009003798,0.000023268536,0.00010863749],"category_scores_gemma":[0.000014475894,0.00006493592,0.000059109203,0.0022949765,0.00014296423,0.0010270478,0.00002669944,0.000059580143,0.00012017462],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036423312,0.000017277716,0.0014930608,0.0000020533812,0.000005970418,0.0000017938636,0.0015091536,0.7769707,0.0014510525,0.21695544,0.00039283585,0.0011970601],"study_design_scores_gemma":[0.0029968766,0.00014525378,0.22011074,0.000060859413,0.00008786916,0.000016472197,0.00014484065,0.65666336,0.012124121,0.09334252,0.0133383935,0.00096866494],"about_ca_topic_score_codex":0.00013228618,"about_ca_topic_score_gemma":0.0003650838,"teacher_disagreement_score":0.6580177,"about_ca_system_score_codex":0.00008766103,"about_ca_system_score_gemma":0.0004974808,"threshold_uncertainty_score":0.30534664},"labels":[],"label_agreement":null},{"id":"W2163580726","doi":"10.1007/s10957-005-4713-3","title":"Sensitivity of Pareto Solutions in Multiobjective Optimization","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Sensitivity (control systems); Mathematical optimization; Mathematics; Pareto principle; Theory of computation; Multi-objective optimization; Scalar (mathematics); Applied mathematics; Nonlinear system; Computation; Pareto interpolation; Algorithm","score_opus":0.009415201946547677,"score_gpt":0.2469129794044059,"score_spread":0.23749777745785822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163580726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025173186,0.00013784732,0.9979078,0.0010195154,0.000023360795,0.00015339478,0.0000056749077,0.00001559835,0.00048505043],"genre_scores_gemma":[0.6017431,0.00026499984,0.397719,0.00012974485,0.000066985056,0.000013757127,0.0000087999215,0.000005641467,0.000047976544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865925,0.00034096633,0.00055609486,0.0001517828,0.00018423275,0.000107675],"domain_scores_gemma":[0.9982502,0.0004085672,0.00052694813,0.00017134144,0.0005747545,0.00006817678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001585526,0.00009289933,0.00020099008,0.00038458488,0.000130122,0.000045600475,0.00016288507,0.00006000838,0.000036902617],"category_scores_gemma":[0.00019042593,0.00008815455,0.00007104057,0.0008470086,0.000060278533,0.0008547716,0.00005324182,0.00010665041,0.0000014475092],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014123393,0.0001515585,0.00017846267,0.0000037782734,0.0000217334,3.114259e-7,0.00024858437,0.83996266,0.000054594333,0.1541699,0.000011732433,0.005182567],"study_design_scores_gemma":[0.0003468607,0.000023695751,0.0007079138,0.000015490494,0.000029320388,0.00002352419,0.00012025402,0.9952952,0.00025846867,0.0029269725,0.00016200569,0.00009026524],"about_ca_topic_score_codex":0.000003712592,"about_ca_topic_score_gemma":0.000006388471,"teacher_disagreement_score":0.6014914,"about_ca_system_score_codex":0.000053996682,"about_ca_system_score_gemma":0.00008822396,"threshold_uncertainty_score":0.3594838},"labels":[],"label_agreement":null},{"id":"W2168767912","doi":"10.1016/j.jmaa.2014.06.075","title":"Linear and strong convergence of algorithms involving averaged nonexpansive operators","year":2014,"lang":"en","type":"preprint","venue":"Journal of Mathematical Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Pacific Institute for the Mathematical Sciences","keywords":"Convergence (economics); Mathematics; Regular polygon; Fixed point; Algorithm; Applied mathematics; Point (geometry); Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.01576999128123911,"score_gpt":0.2737858369604403,"score_spread":0.25801584567920116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168767912","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007913582,0.00027572727,0.99085385,0.0007349924,0.000018319983,0.00011520865,0.000011726514,0.000008070444,0.0000685112],"genre_scores_gemma":[0.6969243,0.0006319004,0.30216604,0.00008094235,0.000101759026,0.000018064145,0.000010581916,0.000007035148,0.000059317634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817526,0.00009492206,0.000957928,0.0002727388,0.00039453284,0.0001046097],"domain_scores_gemma":[0.99740696,0.0002984758,0.0010133516,0.00035770342,0.0007578595,0.00016562229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070038653,0.00016623862,0.0007695487,0.00044348254,0.00010925228,0.00012782471,0.000462666,0.0001103011,0.000055498105],"category_scores_gemma":[0.00010506881,0.00012805797,0.00030303313,0.00071417,0.00008340023,0.00015231819,0.00037383876,0.00027714545,0.0000024568826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011529183,0.0009060537,0.0036097558,0.0009017216,0.008811999,0.0000053665544,0.0025292512,0.24171704,0.0005434513,0.72919196,0.00014454218,0.011627339],"study_design_scores_gemma":[0.00013671779,0.000024094643,0.0009329352,0.00005704503,0.0012539055,0.00000679591,0.000081610684,0.97202134,0.00016174758,0.025127305,0.000056416477,0.00014009628],"about_ca_topic_score_codex":0.000009945448,"about_ca_topic_score_gemma":0.0000023299838,"teacher_disagreement_score":0.7303043,"about_ca_system_score_codex":0.000019706458,"about_ca_system_score_gemma":0.00008760727,"threshold_uncertainty_score":0.52220523},"labels":[],"label_agreement":null},{"id":"W2169757944","doi":"10.3968/j.sms.1923845220120402.1994","title":"Halpern-type Iterations for Strong Relatively Nonexpansive Multi-valued Mappings in Banach Spaces","year":2012,"lang":"en","type":"article","venue":"Studies in mathematical sciences","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sequence (biology); Banach space; Mathematics; Fixed point; Convergence (economics); Type (biology); Duality (order theory); Iterative method; Applied mathematics; Discrete mathematics; Pure mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.20291137637101161,"score_gpt":0.41976843772912575,"score_spread":0.21685706135811414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2169757944","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015179187,0.00051761616,0.9781025,0.002829226,0.0002700746,0.00038108346,0.000002639168,0.00004023674,0.0026774106],"genre_scores_gemma":[0.55692446,0.000029805362,0.44259948,0.0001124128,0.000027932212,0.000048699705,8.848403e-7,0.0000024602261,0.00025387612],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986727,0.00008327212,0.00033845077,0.00027123056,0.00030042607,0.00033392198],"domain_scores_gemma":[0.99900764,0.0005599428,0.00009645514,0.00012161514,0.00015898763,0.000055344393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012764019,0.00011485541,0.00024361834,0.00022619485,0.0003036075,0.000099250785,0.00038439615,0.000035405257,0.000027376671],"category_scores_gemma":[0.0013573115,0.00008394371,0.00004834987,0.0013499185,0.00037217533,0.0009112632,0.00016303576,0.00007166288,0.000019533261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001853921,0.0001780087,0.0049494486,0.000029288522,0.000027212069,4.6170464e-7,0.020491995,0.0030020713,0.000028502704,0.9710136,0.00016371833,0.000113807815],"study_design_scores_gemma":[0.000318688,0.00005242755,0.0043299794,0.00007807003,0.000010738265,0.0000014593921,0.00683845,0.9469198,0.000031894382,0.041142855,0.000101818325,0.00017382565],"about_ca_topic_score_codex":0.000010945599,"about_ca_topic_score_gemma":0.000041527495,"teacher_disagreement_score":0.94391775,"about_ca_system_score_codex":0.00007341231,"about_ca_system_score_gemma":0.000042327985,"threshold_uncertainty_score":0.3423125},"labels":[],"label_agreement":null},{"id":"W2181811163","doi":"","title":"An elementary approach to linear programming duality with application to capacity constrained transport","year":2014,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Duality (order theory); Duality gap; Strong duality; Mathematics; Perturbation function; Linear programming; Mathematical optimization; Weak duality; Dual (grammatical number); Dimension (graph theory); Relation (database); Quadratic programming; Applied mathematics; Optimization problem; Computer science; Pure mathematics; Convex analysis","score_opus":0.015024060487658858,"score_gpt":0.24598866510192188,"score_spread":0.23096460461426302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181811163","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01192189,1.3807603e-7,0.9833679,0.001520728,0.000009283525,0.0003578674,0.000003271606,0.0001620326,0.0026568763],"genre_scores_gemma":[0.49144587,3.759925e-8,0.5072137,0.0011998656,0.000021334887,0.000044745488,0.000038285798,0.0000024562826,0.000033706256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989733,0.000046314683,0.0001852072,0.0003904683,0.00025748348,0.00014721414],"domain_scores_gemma":[0.99923414,0.000013383929,0.000040384915,0.00036219004,0.00014277344,0.0002071318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041917313,0.00009274363,0.00011444229,0.00008073018,0.0000990293,0.000054079657,0.0003216392,0.00002381439,0.00001546282],"category_scores_gemma":[0.0000059739223,0.00007353174,0.000026656757,0.0006360605,0.000015207026,0.00024849555,0.000017518938,0.000039908176,0.000016578158],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028018232,0.00089538586,0.018121725,0.000024169369,0.00007453962,2.782568e-7,0.002096866,0.21979584,0.00082587055,0.69882363,0.000079219644,0.05923448],"study_design_scores_gemma":[0.00023748429,0.00015078679,0.009222377,0.0000020218536,0.000015478261,0.0000019067531,0.000070100534,0.9855149,0.00037990822,0.00015435235,0.004051278,0.00019942535],"about_ca_topic_score_codex":0.00023213668,"about_ca_topic_score_gemma":0.00012505431,"teacher_disagreement_score":0.76571906,"about_ca_system_score_codex":0.00002164456,"about_ca_system_score_gemma":0.000027332353,"threshold_uncertainty_score":0.2998537},"labels":[],"label_agreement":null},{"id":"W2181874083","doi":"","title":"A Dykstra-like algorithm for two monotone operators","year":2007,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Hilbert space; Monotone polygon; Intersection (aeronautics); Extension (predicate logic); Regular polygon; Operator (biology); Resolvent; Duality (order theory); Discrete mathematics; Algorithm; Combinatorics; Pure mathematics; Computer science","score_opus":0.01212399620389896,"score_gpt":0.2779850368416671,"score_spread":0.2658610406377681,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2181874083","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012190126,0.000008496237,0.99520314,0.0006925976,0.00014606373,0.00010240808,0.0000021279902,0.00009416797,0.0036290726],"genre_scores_gemma":[0.043848347,0.0000020421735,0.9502232,0.0017362682,0.00007365561,0.000010164612,0.000009297186,0.0000044066496,0.004092599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993502,0.000008062809,0.00015863577,0.00019472829,0.00013699489,0.00015139232],"domain_scores_gemma":[0.99952346,0.000060286042,0.000030692943,0.00016670222,0.00014108523,0.00007778362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030496577,0.00006397504,0.000077849654,0.000096956785,0.00009343891,0.000097305405,0.00026140368,0.000023225788,0.00008716818],"category_scores_gemma":[0.000009573447,0.00005341155,0.00006189578,0.00040108626,0.000007907978,0.00025662416,0.00004131385,0.00002617769,0.000038355076],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000030065128,0.00014150781,0.000243151,0.0000025480376,0.00007954365,0.0000038088738,0.0002481986,0.0059021856,0.00021536835,0.6957377,0.0027790864,0.29464388],"study_design_scores_gemma":[0.00034461237,0.000019229281,0.00028853538,7.501153e-7,0.000005570675,0.0000014283241,0.00001505694,0.9903136,0.0012055465,0.0009139705,0.006799144,0.00009255904],"about_ca_topic_score_codex":0.0000348549,"about_ca_topic_score_gemma":0.00002216353,"teacher_disagreement_score":0.9844114,"about_ca_system_score_codex":0.000020075817,"about_ca_system_score_gemma":0.000032415257,"threshold_uncertainty_score":0.21780598},"labels":[],"label_agreement":null},{"id":"W2186428975","doi":"10.2298/fil1613411p","title":"Convex sets in proximal relator spaces","year":2016,"lang":"en","type":"article","venue":"Filomat","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; Türkiye Bilimsel ve Teknolojik Araştırma Kurumu","keywords":"Mathematics; Regular polygon; Normed vector space; Space (punctuation); Convex set; Combinatorics; Pure mathematics; Basis (linear algebra); Geometry; Convex optimization","score_opus":0.010858144655775044,"score_gpt":0.2303135840249992,"score_spread":0.21945543936922418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2186428975","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12591958,0.000069188754,0.8006151,0.054231115,0.0004701322,0.00026976404,0.000015660613,0.0003766574,0.01803282],"genre_scores_gemma":[0.9672204,0.000007646211,0.030408887,0.00032653115,0.00002066947,0.000008909521,0.0000018273071,0.0000033058013,0.0020018108],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994762,0.000028333941,0.00010866914,0.00015880332,0.00012911153,0.0000988743],"domain_scores_gemma":[0.999672,0.00005173175,0.00004030884,0.00016504267,0.00003413599,0.000036777812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009949137,0.000048519716,0.00007231279,0.00008311219,0.000027269703,0.00004664708,0.00020791883,0.000028807723,0.00033904336],"category_scores_gemma":[0.000044797147,0.000031023326,0.000025633613,0.00025679023,0.000011231464,0.00034320026,0.000063452906,0.000022250844,0.0003883284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001103958,0.00013992617,0.08455831,0.000011720996,0.000040072766,0.000023966442,0.00079925905,0.00036605404,0.0010315021,0.89183325,0.008915791,0.012269106],"study_design_scores_gemma":[0.002670867,0.00011985988,0.36534065,0.00011385073,0.000016037337,0.000023516688,0.000036570596,0.5489316,0.0031913687,0.04203074,0.036793724,0.00073118217],"about_ca_topic_score_codex":0.0000059035524,"about_ca_topic_score_gemma":0.000006417831,"teacher_disagreement_score":0.8498025,"about_ca_system_score_codex":0.00002308571,"about_ca_system_score_gemma":0.000028030532,"threshold_uncertainty_score":0.49913055},"labels":[],"label_agreement":null},{"id":"W2188090572","doi":"10.1007/bfb0006694","title":"Differentiability of Min Max and saddle points under relaxed assumptions","year":2005,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Infimum and supremum; Differentiable function; Saddle point; Mathematics; Saddle; Pure mathematics; Object (grammar); Sensitivity (control systems); Mathematical economics; Mathematical analysis; Applied mathematics; Mathematical optimization; Computer science; Geometry; Engineering; Artificial intelligence","score_opus":0.012624331407793532,"score_gpt":0.23118967777895952,"score_spread":0.21856534637116598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188090572","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003523283,0.00031772812,0.97573,0.0062886537,0.000088438996,0.00019444698,0.0000312498,0.000024961591,0.016972192],"genre_scores_gemma":[0.9793698,0.0003250068,0.017506065,0.0020088123,0.00003845911,0.000007127664,0.000024486491,0.000003473551,0.0007167686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987826,0.000031418407,0.00049373624,0.00021396465,0.00035758188,0.00012072008],"domain_scores_gemma":[0.9989207,0.00037898714,0.0003265238,0.00016780088,0.0001541304,0.000051854095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004764206,0.00015422404,0.00027703118,0.0003999244,0.00014375662,0.00020182415,0.00025351817,0.00015259943,0.00011223425],"category_scores_gemma":[0.00015445278,0.000118242926,0.000057663223,0.00017253474,0.00022398049,0.0015680847,0.0000802486,0.00014154997,0.000006100327],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001598177,0.000029361627,0.0018739721,0.000058190297,0.00006320957,1.8062264e-7,0.0009777173,0.026244594,0.000021784153,0.8646198,0.0000359739,0.106059216],"study_design_scores_gemma":[0.001050957,0.00009817025,0.021581197,0.000080526916,0.00005037611,0.000006572755,0.000011701586,0.8000868,0.000020446605,0.17004575,0.0066053336,0.0003621979],"about_ca_topic_score_codex":0.000024167393,"about_ca_topic_score_gemma":0.00008878511,"teacher_disagreement_score":0.9790175,"about_ca_system_score_codex":0.000027755072,"about_ca_system_score_gemma":0.00007772336,"threshold_uncertainty_score":0.48218066},"labels":[],"label_agreement":null},{"id":"W2201892009","doi":"10.48550/arxiv.1507.05585","title":"On Fejér monotone sequences and nonexpansive mappings","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Monotonic function; Convergence (economics); Fixed point; Mathematics; Applied mathematics; Pure mathematics; Mathematical analysis; Economics","score_opus":0.07337773091000413,"score_gpt":0.18824835577238916,"score_spread":0.11487062486238503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2201892009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071807496,0.000032005595,0.92219955,0.00075753964,0.0002047916,0.00015321333,0.0000140043585,0.00013455833,0.004696826],"genre_scores_gemma":[0.9940805,0.000116331,0.0031793732,0.00036158043,0.00003290516,7.245063e-7,0.000019975063,0.0000063858374,0.0022022184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874043,0.00008342158,0.00013010991,0.0007755134,0.000109848275,0.00016067146],"domain_scores_gemma":[0.99875957,0.00007862519,0.00018835554,0.00050371676,0.00030735208,0.00016239246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017502347,0.00019785695,0.00023540338,0.00028240273,0.0001162433,0.0001540843,0.00072682695,0.00015642117,0.000028299566],"category_scores_gemma":[0.000043529235,0.00020971347,0.00008809099,0.0005039907,0.00006961893,0.0003049866,0.0008220075,0.00024077336,0.00007397846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008447376,0.000030295138,0.000309606,0.00001057902,0.00006944899,0.000043484913,0.00022589588,0.4746534,0.0000045071524,0.52416503,0.00040140792,0.00007790068],"study_design_scores_gemma":[0.00022789318,0.0000328554,0.00040189145,0.000028514296,0.000038977567,0.0000016743031,0.000055594748,0.8220073,0.00001484829,0.17678519,0.00016840572,0.00023687161],"about_ca_topic_score_codex":0.00018830181,"about_ca_topic_score_gemma":0.00001572124,"teacher_disagreement_score":0.92227304,"about_ca_system_score_codex":0.00012483899,"about_ca_system_score_gemma":0.00018064368,"threshold_uncertainty_score":0.85518676},"labels":[],"label_agreement":null},{"id":"W2217630407","doi":"10.1007/s10107-016-0980-z","title":"Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Subderivative; Convex analysis; Monotone polygon; Regular polygon; Proper convex function; Convex set; Convex optimization; Convex function; Convex combination; Effective domain; Combinatorics; Pure mathematics; Geometry","score_opus":0.04564266979921341,"score_gpt":0.25120328878195913,"score_spread":0.20556061898274572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2217630407","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042483967,0.00005917698,0.95549184,0.0015182453,0.000027310258,0.00019456522,0.00000486466,0.000052625204,0.00016740436],"genre_scores_gemma":[0.91214865,0.000007866597,0.08711274,0.000020080868,0.000010840694,0.00002325904,0.0000012377101,0.0000056404774,0.00066968956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906003,0.000051919316,0.00036621874,0.00016589023,0.00022687827,0.00012903017],"domain_scores_gemma":[0.9991729,0.00025621624,0.00014956342,0.00020331859,0.00015767367,0.000060288872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024443935,0.00009073742,0.00028723682,0.00008131672,0.00005652287,0.000052522948,0.00017192807,0.00004112697,0.00021215151],"category_scores_gemma":[0.00027418238,0.000046798945,0.000060040955,0.00023097462,0.00015436036,0.0001984869,0.00009840774,0.00002863315,0.000011949314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013993155,0.0012877635,0.002379827,0.001490005,0.00061981624,0.0000052347305,0.004682979,0.000029444891,0.02370952,0.61690646,0.00023597325,0.34851304],"study_design_scores_gemma":[0.015754042,0.003770322,0.013665954,0.0041328403,0.0016145974,0.00017316923,0.0023959663,0.5869286,0.15650263,0.20479329,0.007225667,0.0030429428],"about_ca_topic_score_codex":0.0000057863704,"about_ca_topic_score_gemma":0.0000041120497,"teacher_disagreement_score":0.86966467,"about_ca_system_score_codex":0.000008500752,"about_ca_system_score_gemma":0.000030044683,"threshold_uncertainty_score":0.23229103},"labels":[],"label_agreement":null},{"id":"W2226209104","doi":"10.1007/s40306-015-0165-5","title":"Outer-Inner Approximation Projection Methods for Multivalued Variational Inequalities","year":2016,"lang":"en","type":"article","venue":"Acta Mathematica Vietnamica","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Ryerson University; National Foundation for Science and Technology Development","keywords":"Variational inequality; Mathematics; Lipschitz continuity; Projection (relational algebra); Convergence (economics); Domain (mathematical analysis); Regular polygon; Extension (predicate logic); Applied mathematics; Projection method; Nonlinear system; Mathematical optimization; Mathematical analysis; Dykstra's projection algorithm; Algorithm; Computer science; Geometry","score_opus":0.040615122994426496,"score_gpt":0.33600438104361136,"score_spread":0.29538925804918487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2226209104","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012660542,0.000005193641,0.9879772,0.009900905,0.00016957312,0.00047844875,0.000015160966,0.00020340079,0.0011234961],"genre_scores_gemma":[0.052122932,0.0000058926785,0.9452476,0.00023608365,0.000083193714,0.00030084912,0.000026385986,0.000016017828,0.0019610308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837047,0.00025576152,0.0005025621,0.00038306144,0.00026891995,0.00021925227],"domain_scores_gemma":[0.99777323,0.0010873604,0.00029572233,0.00042830178,0.00035284684,0.00006253855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013440176,0.00017011492,0.00024998747,0.00020163639,0.0001888621,0.00014263047,0.00043617902,0.00008580938,0.000112945396],"category_scores_gemma":[0.0011597617,0.00011158189,0.00014898184,0.00036701572,0.000036577087,0.0009780307,0.00010449759,0.000043341053,0.000041185678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010934565,0.00015826846,0.000010532491,0.000065338354,0.00009803504,1.0045258e-7,0.0014340727,0.000043878845,0.0077858423,0.9671018,0.0005416562,0.022749532],"study_design_scores_gemma":[0.0004956278,0.00003304798,0.00009768861,0.00003285497,0.00003104238,0.0000047061994,0.000042714022,0.790212,0.0008980091,0.20631318,0.0016555446,0.00018362296],"about_ca_topic_score_codex":0.000003435805,"about_ca_topic_score_gemma":8.8346025e-7,"teacher_disagreement_score":0.7901681,"about_ca_system_score_codex":0.000102922444,"about_ca_system_score_gemma":0.000077110846,"threshold_uncertainty_score":0.45501775},"labels":[],"label_agreement":null},{"id":"W2229522952","doi":"","title":"On Proximal Split Feasibility Problems Incursion in the Nonconvex Case","year":2013,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Regular polygon; Minification; Inverse problem; Inverse; Mathematical optimization; Phase retrieval; Convex function; Applied mathematics; Algorithm; Combinatorics; Mathematical analysis; Geometry","score_opus":0.13704850166491162,"score_gpt":0.3950957609426357,"score_spread":0.2580472592777241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2229522952","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.75942904,0.000047739413,0.21292609,0.022823768,0.00008755525,0.00096423377,0.0000010861675,0.000012057827,0.0037084213],"genre_scores_gemma":[0.9510573,0.000010876998,0.048638694,0.0000992592,0.000039904637,0.000012690328,2.5432044e-7,0.0000040040545,0.00013698576],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99757034,0.0004187604,0.00048240292,0.00011878717,0.0012149625,0.0001947465],"domain_scores_gemma":[0.9975095,0.00102353,0.00019849338,0.00035457863,0.0008373338,0.00007659861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006330633,0.00006697731,0.00015424362,0.00037631326,0.00013000488,0.00032489802,0.0008264659,0.000042713058,0.000119739954],"category_scores_gemma":[0.0007580869,0.000036738573,0.00007597382,0.0008526573,0.000043739114,0.00043369114,0.00011861399,0.0004861626,0.00008569702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036911875,0.008562887,0.003841874,0.000543372,0.00012838181,0.0012349886,0.034523487,0.017750176,0.0006735603,0.90924555,0.015259441,0.008199379],"study_design_scores_gemma":[0.0005352124,0.00038448616,0.0021844166,0.00010462578,0.000005290943,0.000962193,0.0010570824,0.8038103,0.00006321636,0.19072361,0.00008495993,0.00008459025],"about_ca_topic_score_codex":0.00003980954,"about_ca_topic_score_gemma":0.000012117044,"teacher_disagreement_score":0.78606015,"about_ca_system_score_codex":0.000103156424,"about_ca_system_score_gemma":0.00013166007,"threshold_uncertainty_score":0.3132999},"labels":[],"label_agreement":null},{"id":"W2233629697","doi":"10.1007/s11784-015-0278-4","title":"On a result of Pazy concerning the asymptotic behaviour of nonexpansive mappings","year":2015,"lang":"en","type":"preprint","venue":"Journal of Fixed Point Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Trichotomy (philosophy); Iterated function; Credence; Conjecture; Fixed point; Mathematics; Mathematical economics; Pure mathematics; Applied mathematics; Mathematical analysis; Philosophy; Statistics; Epistemology","score_opus":0.020793369027523233,"score_gpt":0.26951654747078796,"score_spread":0.24872317844326472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2233629697","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0147824595,0.00031062408,0.9806995,0.0026067228,0.000095918316,0.0002765929,0.000051082323,0.000010188982,0.0011669244],"genre_scores_gemma":[0.9902475,0.00011966112,0.009093818,0.00022967857,0.000098876946,0.000023205037,0.000010564816,0.000007160976,0.0001695184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839896,0.0002741374,0.0007319666,0.00017725994,0.00033382906,0.00008387668],"domain_scores_gemma":[0.9959491,0.0007237061,0.0017651668,0.00042287252,0.0010599515,0.00007919012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00187003,0.00012948608,0.00035123705,0.00019602096,0.00009398874,0.000052726227,0.0007118284,0.00009465682,0.000019152483],"category_scores_gemma":[0.00023647785,0.00008832562,0.00018257137,0.00027635205,0.0001218349,0.00010818151,0.00025710207,0.00037829176,0.0000022812442],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006215011,0.0001490902,0.00007946247,0.000037158,0.0002070879,0.0000010225875,0.002464266,0.03690092,0.00025836533,0.95726305,0.0005155999,0.002061797],"study_design_scores_gemma":[0.0012108361,0.00032888658,0.0030352832,0.00057531236,0.0005923354,0.00006594925,0.0014606678,0.024351986,0.0019473999,0.96495533,0.001111628,0.0003643749],"about_ca_topic_score_codex":0.000008618924,"about_ca_topic_score_gemma":7.3646015e-7,"teacher_disagreement_score":0.97546506,"about_ca_system_score_codex":0.00003287331,"about_ca_system_score_gemma":0.00024685738,"threshold_uncertainty_score":0.36018145},"labels":[],"label_agreement":null},{"id":"W2244768816","doi":"10.35834/mjms/1449161367","title":"Intersection Theorems for Closed Convex Sets and Applications","year":2015,"lang":"en","type":"preprint","venue":"Missouri Journal of Mathematical Sciences","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Brock University","funders":"","keywords":"Mathematics; Kakutani fixed-point theorem; Fixed-point theorem; Brouwer fixed-point theorem; Danskin's theorem; Fixed-point property; Minimax theorem; Intersection (aeronautics); Intersection theorem; Krein–Milman theorem; Convex analysis; Pure mathematics; Lemma (botany); Closed graph theorem; Discrete mathematics; Banach space; Picard–Lindelöf theorem; Regular polygon; Minimax; Schauder fixed point theorem; Convex optimization; Mathematical economics","score_opus":0.050908251911195544,"score_gpt":0.3249398287832382,"score_spread":0.27403157687204266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2244768816","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017872856,0.00021364364,0.99190027,0.0036011534,0.00016474034,0.00023878903,0.0000059789054,0.000018972145,0.002069181],"genre_scores_gemma":[0.40489277,0.00006581746,0.5940917,0.0002922966,0.0003622296,0.000043108343,0.0000040302457,0.000009853042,0.00023819617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984579,0.00008127857,0.0005487784,0.00025014475,0.0005170926,0.00014480861],"domain_scores_gemma":[0.9979929,0.00039913692,0.0006643874,0.00017561433,0.00058796065,0.00018000288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025608728,0.00013335708,0.0003445896,0.00022657125,0.00016773603,0.00042480568,0.0008816225,0.00010025123,0.00003117025],"category_scores_gemma":[0.00036441165,0.00009168295,0.0001536146,0.0002768191,0.00018785213,0.00024941086,0.00028482373,0.00018618428,0.0000043272767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018044077,0.0003005467,0.000072218485,0.0002431786,0.00018186805,0.000002309627,0.0029863971,0.011981269,0.00008277023,0.96699494,0.0022286589,0.014907801],"study_design_scores_gemma":[0.000176621,0.0000858511,0.0000254838,0.00006942555,0.000047669375,0.000044194636,0.00011577361,0.32279193,0.000035529487,0.6752152,0.0012909936,0.00010130831],"about_ca_topic_score_codex":0.0000017809803,"about_ca_topic_score_gemma":7.322096e-7,"teacher_disagreement_score":0.4031055,"about_ca_system_score_codex":0.000048264625,"about_ca_system_score_gemma":0.00024819863,"threshold_uncertainty_score":0.4096411},"labels":[],"label_agreement":null},{"id":"W2273955361","doi":"10.48550/arxiv.1602.05626","title":"On Douglas-Rachford operators that fail to be proximal mappings","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan College; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Iterated function; Monotone polygon; Mathematics; Operator (biology); Context (archaeology); Regular polygon; Class (philosophy); Monotonic function; Pure mathematics; Zero (linguistics); Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.07092091823650802,"score_gpt":0.18766764870385907,"score_spread":0.11674673046735105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273955361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03599984,0.0000039803526,0.95254856,0.0035497753,0.0005438234,0.00029188264,0.000027995307,0.00021679507,0.0068173455],"genre_scores_gemma":[0.9847848,0.000021762724,0.003809533,0.001830029,0.000088260575,0.000002646919,0.00001960883,0.000015635713,0.0094277235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981181,0.00010173387,0.00017453778,0.0011158042,0.0001854593,0.00030439033],"domain_scores_gemma":[0.99828684,0.00009059955,0.00017902901,0.0009600136,0.00023610512,0.00024742528],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00020198514,0.0003016187,0.0002925172,0.0004893587,0.00020000545,0.00024794316,0.0016962243,0.0002035647,0.00018483732],"category_scores_gemma":[0.000047191257,0.00027579063,0.00022159981,0.000745611,0.000039113227,0.000453454,0.0016104571,0.000267605,0.00035375063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026448795,0.00006306323,0.0010484713,0.0000144191945,0.00011056957,0.000040918854,0.000295737,0.18433477,0.000010061101,0.81195855,0.0019303794,0.00016658143],"study_design_scores_gemma":[0.0010921017,0.0001665248,0.0017261544,0.00018113041,0.00012111133,0.0000028448162,0.00012249876,0.8995124,0.0003160912,0.08051202,0.014891605,0.0013554883],"about_ca_topic_score_codex":0.000053843953,"about_ca_topic_score_gemma":0.000019340909,"teacher_disagreement_score":0.94878495,"about_ca_system_score_codex":0.0002341642,"about_ca_system_score_gemma":0.00018127589,"threshold_uncertainty_score":0.9999694},"labels":[],"label_agreement":null},{"id":"W2292185393","doi":"10.1109/cdc.2015.7402603","title":"On the minimum principle and dynamic programming for hybrid systems with low dimensional switching manifolds","year":2015,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hybrid system; Class (philosophy); Codimension; Dynamic programming; Control theory (sociology); Optimal control; Mathematics; Control (management); Computer science; Mathematical optimization; Pure mathematics; Topology (electrical circuits); Combinatorics; Artificial intelligence","score_opus":0.013780784963048569,"score_gpt":0.24008096319755487,"score_spread":0.2263001782345063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2292185393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041779257,0.000016752845,0.9554157,0.0020906653,0.00007641177,0.000284652,0.0000012407955,0.00005863473,0.00027668232],"genre_scores_gemma":[0.94282335,4.3352983e-7,0.05591664,0.0003158556,0.000016357324,0.000041298605,0.0000057268794,0.0000051751263,0.0008751394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992888,0.000027498321,0.000116035386,0.00020778326,0.00024222773,0.000117634125],"domain_scores_gemma":[0.9993976,0.00016151468,0.00006239881,0.00017378331,0.00013517273,0.00006955124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033490037,0.00007802368,0.00008338548,0.000047930844,0.00014181557,0.00024369873,0.00017678905,0.0000134554075,0.0000025679847],"category_scores_gemma":[0.000035793324,0.00004167194,0.000022821901,0.00013458756,0.0000092512455,0.00016345626,0.000064164604,0.000034707664,0.000005368214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028469596,0.00009453545,0.0003495122,0.000020033109,0.00007975761,0.0000035933551,0.00024071726,0.09642029,0.000022074008,0.9007264,0.00046496541,0.0015496726],"study_design_scores_gemma":[0.00026236317,0.00008834558,0.00012473376,0.000015288508,0.000008483727,0.000013396403,0.000039861294,0.9978789,0.000012804282,0.00095173507,0.000527399,0.00007668157],"about_ca_topic_score_codex":0.000018729732,"about_ca_topic_score_gemma":0.000011972677,"teacher_disagreement_score":0.9014586,"about_ca_system_score_codex":0.000027370295,"about_ca_system_score_gemma":0.000054345997,"threshold_uncertainty_score":0.23499925},"labels":[],"label_agreement":null},{"id":"W2320499430","doi":"10.1080/02331934.2016.1149711","title":"Semicontinuity and convergence for vector optimization problems with approximate equilibrium constraints","year":2016,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Convergence (economics); Constraint (computer-aided design); Vector optimization; Mathematical optimization; Variational inequality; Solution set; Set (abstract data type); Optimization problem; Feasible region; Applied mathematics; Function (biology); Computer science; Multi-swarm optimization","score_opus":0.010400511503371195,"score_gpt":0.21135661900868197,"score_spread":0.20095610750531076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2320499430","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019308901,0.000020144886,0.9963373,0.002362436,0.000089672205,0.0004696255,0.000023497721,0.0001600196,0.000344221],"genre_scores_gemma":[0.1706966,0.000068709865,0.82837576,0.0001509508,0.000037625858,0.00008851647,0.000053317104,0.00001747773,0.00051106006],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988075,0.00004813326,0.00026482582,0.00045935955,0.00020020458,0.00021999051],"domain_scores_gemma":[0.9989081,0.000113151014,0.00021252397,0.00024842928,0.00041826785,0.00009953217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023712525,0.00016077323,0.00017426875,0.00011353919,0.00012335616,0.00017083717,0.00022587224,0.000072045674,0.0001343961],"category_scores_gemma":[0.000094527255,0.000111380476,0.000036869224,0.00038870604,0.00010191117,0.001062732,0.00006959604,0.00002998527,0.000003288246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019396766,0.000037952283,0.00055551296,0.000023541128,0.000034779365,3.2887624e-7,0.00012397538,0.968576,0.00041451392,0.02764052,0.00008157429,0.0024918723],"study_design_scores_gemma":[0.00095319585,0.00007483282,0.00012084843,0.000040369316,0.00002523831,0.000007674332,0.000007353867,0.9977189,0.0004787382,0.00027413547,0.000095665964,0.00020306218],"about_ca_topic_score_codex":0.000003387,"about_ca_topic_score_gemma":0.0000022549084,"teacher_disagreement_score":0.17050351,"about_ca_system_score_codex":0.000042326148,"about_ca_system_score_gemma":0.00007577748,"threshold_uncertainty_score":0.4541964},"labels":[],"label_agreement":null},{"id":"W2329618967","doi":"10.4153/cmb-2001-037-5","title":"On Locating Isometric <i>𝓁</i><sup>(<i>n</i>)</sup><sub>1</sub>","year":2001,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Isometric exercise; Hypercube; Normed vector space; Metric space; Metric (unit); Combinatorics; Space (punctuation); Discrete mathematics; Computer science","score_opus":0.010245525611732972,"score_gpt":0.20132221929004268,"score_spread":0.1910766936783097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2329618967","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029881129,0.00006492786,0.87884074,0.03118829,0.00008693513,0.00029937254,0.000010495673,0.00023218582,0.059395906],"genre_scores_gemma":[0.965241,0.000025032792,0.022116136,0.010964333,0.000114881484,0.00003417296,0.000015735895,0.000029002686,0.001459696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981098,0.00008385052,0.00039490638,0.00044534059,0.0004346306,0.00053147145],"domain_scores_gemma":[0.9980022,0.00048196354,0.000087480184,0.0005522169,0.00015904976,0.00071708835],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00043059673,0.0002095679,0.00026047716,0.0006841348,0.0002716562,0.00027012613,0.000694162,0.000106810156,0.0030387247],"category_scores_gemma":[0.0009072471,0.00019757297,0.0001265002,0.0019310148,0.00004236336,0.0001013111,0.00006867363,0.00019748545,0.021450518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040912923,0.0001571098,0.00008336425,0.000032135253,0.00005708585,0.000097969176,0.00033626333,0.023805566,0.00004116003,0.9248705,0.037071917,0.013442832],"study_design_scores_gemma":[0.00049034087,0.000089490524,0.00016179703,0.000084166946,0.000032505355,0.000080359874,0.000061128456,0.89812595,0.00031097693,0.058264036,0.041689236,0.000610034],"about_ca_topic_score_codex":0.00022837386,"about_ca_topic_score_gemma":0.00010671342,"teacher_disagreement_score":0.9353599,"about_ca_system_score_codex":0.00019931971,"about_ca_system_score_gemma":0.00021211254,"threshold_uncertainty_score":0.99787265},"labels":[],"label_agreement":null},{"id":"W2334135185","doi":"10.3934/dcds.2015.35.4455","title":"Optimal control of differential inclusions on manifolds","year":2015,"lang":"en","type":"article","venue":"Discrete and Continuous Dynamical Systems","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Differential inclusion; Mathematics; Optimal control; Dynamical systems theory; Hamiltonian system; Metric (unit); Hamiltonian (control theory); Applied mathematics; Euler's formula; Mathematical optimization; Mathematical analysis; Physics","score_opus":0.008518846006722945,"score_gpt":0.2259003894822431,"score_spread":0.21738154347552016,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2334135185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09871633,0.00006966126,0.89872634,0.0005592259,0.00021614457,0.00014808704,0.000025238976,0.000050248527,0.0014886986],"genre_scores_gemma":[0.99831456,0.0000041789685,0.0010499809,0.000069676535,0.000055059805,0.000011015271,0.000017258693,0.000005374861,0.0004729105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988808,0.00011134725,0.00029602155,0.00023861552,0.00032526243,0.00014793749],"domain_scores_gemma":[0.9992846,0.0000686531,0.00012475096,0.000218669,0.00013819528,0.00016510104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015902784,0.000113926326,0.00029104075,0.00007881349,0.00007283731,0.0001104834,0.0002729598,0.00006644012,0.0000061002966],"category_scores_gemma":[0.000036721252,0.00008539622,0.00007531541,0.00015875141,0.000033399094,0.00012062048,0.00012720261,0.00006457075,0.0000055100318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008283537,0.00020051481,0.0048893853,0.000023533908,0.0001840771,0.000011187276,0.0005467386,0.026903566,0.00041903576,0.96508324,0.00026560028,0.0013903026],"study_design_scores_gemma":[0.0008712041,0.00016008185,0.0021598546,0.000020546408,0.000027946615,0.0000057305288,0.0000863914,0.9961141,0.0000069456605,0.00020923038,0.00022092252,0.00011709614],"about_ca_topic_score_codex":0.00014312014,"about_ca_topic_score_gemma":0.0000044821845,"teacher_disagreement_score":0.9692105,"about_ca_system_score_codex":0.000022354254,"about_ca_system_score_gemma":0.000021390466,"threshold_uncertainty_score":0.34823567},"labels":[],"label_agreement":null},{"id":"W2339481321","doi":"","title":"On the minimum principle and dynamic programming for hybrid systems with low dimensional switching manifolds","year":2015,"lang":"en","type":"article","venue":"Les Cahiers du GERAD","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Hybrid system; Class (philosophy); Mathematics; Codimension; Dynamic programming; Optimal control; Control theory (sociology); Control (management); Pure mathematics; Mathematical optimization; Topology (electrical circuits); Computer science; Combinatorics; Artificial intelligence","score_opus":0.009110286341357101,"score_gpt":0.21681046664830453,"score_spread":0.20770018030694742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2339481321","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21543981,0.000048876464,0.7814871,0.0024800356,0.00011912192,0.0002800628,0.000003000556,0.00005831909,0.00008365058],"genre_scores_gemma":[0.94444346,0.0000018057184,0.05463688,0.0003902275,0.000037197275,0.000052095522,0.000011333935,0.000009001225,0.00041801887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99915195,0.000048346665,0.00013532271,0.00024797965,0.00026409078,0.00015233496],"domain_scores_gemma":[0.9992999,0.00020545842,0.00009204693,0.0001950609,0.00012182479,0.00008574847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034594335,0.000105867155,0.00011255882,0.00006644347,0.0002969034,0.00025398933,0.00021045105,0.0000305923,0.0000011644503],"category_scores_gemma":[0.000057576643,0.00006526009,0.000035157846,0.0001573559,0.000032431093,0.00016046196,0.000043659595,0.00008153808,0.00000336495],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038991064,0.0000684955,0.00042551698,0.000026181791,0.000095248804,0.000010328787,0.0010150269,0.033905383,0.000027410373,0.9618963,0.00031857667,0.0021725364],"study_design_scores_gemma":[0.0003966242,0.000099227276,0.0002248696,0.000021200749,0.000016280663,0.000030809595,0.00009371537,0.99475646,0.000013556349,0.002932943,0.0012939769,0.00012036514],"about_ca_topic_score_codex":0.000018846971,"about_ca_topic_score_gemma":0.000007753942,"teacher_disagreement_score":0.9608511,"about_ca_system_score_codex":0.00006913046,"about_ca_system_score_gemma":0.000054568965,"threshold_uncertainty_score":0.2661229},"labels":[],"label_agreement":null},{"id":"W2342322571","doi":"10.9734/bjast/2016/24007","title":"Isac’s Cones","year":2016,"lang":"en","type":"article","venue":"British Journal of Applied Science & Technology","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Environmental science","score_opus":0.005926224623885585,"score_gpt":0.21440945406951223,"score_spread":0.20848322944562664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342322571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017953193,0.00011670103,0.9681385,0.00892725,0.00022858454,0.000048268903,0.0000013209261,0.000093000635,0.00449317],"genre_scores_gemma":[0.9363721,0.00012659703,0.06307197,0.00027291494,0.000034797587,0.000002099111,5.139676e-8,0.000002958024,0.000116519186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987146,0.000008538837,0.00034410763,0.00023464546,0.00045864173,0.00023946221],"domain_scores_gemma":[0.9988466,0.0000419912,0.00030200148,0.00021511501,0.0005031158,0.0000911943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007567147,0.0000663316,0.00017198462,0.0008857045,0.00023099394,0.00016633487,0.0017604477,0.00006457722,0.000060177998],"category_scores_gemma":[0.00018167922,0.000052527645,0.00005053417,0.002575125,0.0005886727,0.0006626763,0.00021716897,0.00011231175,0.0000382621],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004161538,0.000060167655,0.00021468902,0.0000010691073,0.000015092689,0.00005097162,0.00004266635,0.00013986546,0.04103173,0.6761011,0.0006085102,0.28173],"study_design_scores_gemma":[0.004740269,0.0005874945,0.013733497,0.00032155812,0.000072923736,0.011748913,0.0004571959,0.016205087,0.137075,0.752913,0.060877018,0.0012680226],"about_ca_topic_score_codex":0.0000023530838,"about_ca_topic_score_gemma":0.0000029271418,"teacher_disagreement_score":0.9184189,"about_ca_system_score_codex":0.000066432156,"about_ca_system_score_gemma":0.00027197337,"threshold_uncertainty_score":0.32713792},"labels":[],"label_agreement":null},{"id":"W2350882924","doi":"","title":"Three-Step Iterative Algorithm for System of Variational Inclusions with (H,φ)-η Monotone Operators","year":2013,"lang":"en","type":"article","venue":"Journal of Biomathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Iterated function; Monotone polygon; Mathematics; Convergence (economics); Banach space; Pseudo-monotone operator; Sequence (biology); Resolvent; Iterative method; Operator (biology); Algorithm; Applied mathematics; Pure mathematics; Discrete mathematics; Mathematical analysis; Finite-rank operator","score_opus":0.01181955916718797,"score_gpt":0.2398714150498291,"score_spread":0.22805185588264112,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2350882924","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019668718,0.000027080125,0.9969455,0.0006220289,0.000084200845,0.00023471101,0.000013208472,0.000012741034,0.000093636205],"genre_scores_gemma":[0.08447427,0.000002859384,0.9153596,0.00004656049,0.000062135274,0.000013344561,0.0000030055467,0.0000069661655,0.000031235017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986507,0.0000307794,0.00067900406,0.000097674325,0.00044015792,0.000101625024],"domain_scores_gemma":[0.99705064,0.00024704137,0.0008564223,0.00017213431,0.0015894223,0.00008433228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038606467,0.000107223226,0.00031344476,0.0002389487,0.00012082653,0.00010599745,0.0003907564,0.000046500605,0.000025266752],"category_scores_gemma":[0.000053786942,0.00006881863,0.000121146564,0.00047662156,0.000024884048,0.0005479676,0.00007227061,0.00004703417,0.0000052893192],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002479557,0.0012967112,0.0004179347,0.0003894298,0.0018431817,0.000011124826,0.0059509566,0.016898066,0.0022831934,0.9484823,0.002793325,0.019609008],"study_design_scores_gemma":[0.0005543967,0.0001858667,0.00023276632,0.000112060305,0.000057900786,0.00005925505,0.00017608695,0.9932527,0.00059448153,0.0046536583,0.000034847988,0.00008599825],"about_ca_topic_score_codex":0.000009393066,"about_ca_topic_score_gemma":0.000002294089,"teacher_disagreement_score":0.9763546,"about_ca_system_score_codex":0.00005954886,"about_ca_system_score_gemma":0.0001629053,"threshold_uncertainty_score":0.28063422},"labels":[],"label_agreement":null},{"id":"W2353079230","doi":"","title":"Ishikawa Iteration Process with Errors for Approximate Solutions to Equatoins of Lipschitz Strongly Accretive Operators","year":2002,"lang":"en","type":"article","venue":"Acta Analysis Functionalis Applicata","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Lipschitz continuity; Banach space; Mathematics; Convergence (economics); Iterative and incremental development; Operator (biology); Applied mathematics; Iterative method; Fixed point; Hilbert space; Rate of convergence; Pure mathematics; Mathematical analysis; Mathematical optimization; Computer science; Chemistry; Economics","score_opus":0.028929742263564356,"score_gpt":0.2552736842122281,"score_spread":0.22634394194866378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2353079230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064601465,0.00002500358,0.987841,0.0043954575,0.000027709602,0.0005016057,0.00019312932,0.00008764625,0.00046827656],"genre_scores_gemma":[0.9444377,0.0000078473695,0.05350501,0.00042075696,0.00006936174,0.00054087094,0.00058275333,0.000016144333,0.0004195919],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977742,0.000055270117,0.0005157406,0.0007505728,0.0005979981,0.00030625137],"domain_scores_gemma":[0.99769866,0.00014901158,0.00031535252,0.0007268672,0.00093135424,0.00017874397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033614936,0.00023516054,0.0004137544,0.0006706794,0.00038519083,0.00021153342,0.00072632293,0.00007734867,0.00038392693],"category_scores_gemma":[0.000078335725,0.00019937365,0.00026267552,0.004932052,0.000046942965,0.00082592637,0.00011863713,0.0000900841,0.000027006996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010240108,0.0008909382,0.005071914,0.00004898649,0.0041618682,6.1075775e-7,0.0015975742,0.7396305,0.0010877044,0.2396027,0.0062636724,0.0015411093],"study_design_scores_gemma":[0.00039698734,0.00012469142,0.0012451179,0.000007688152,0.00080634037,0.0000016454857,0.00014480582,0.993902,0.00050272176,0.00036710934,0.0022019881,0.00029889436],"about_ca_topic_score_codex":0.00005263403,"about_ca_topic_score_gemma":0.00011906904,"teacher_disagreement_score":0.9379775,"about_ca_system_score_codex":0.000070818154,"about_ca_system_score_gemma":0.000071592985,"threshold_uncertainty_score":0.81302214},"labels":[],"label_agreement":null},{"id":"W2371009812","doi":"","title":"Optimality conditions for generalized quasi-differentiable optimization problems with inequality constraints","year":2006,"lang":"en","type":"article","venue":"Dalian Ligong Daxue xuebao","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Differentiable function; Mathematics; Mathematical optimization; Bilevel optimization; Constraint (computer-aided design); Lemma (botany); Optimization problem; Class (philosophy); Set (abstract data type); Homogeneous; Computer science; Pure mathematics","score_opus":0.016523859259947298,"score_gpt":0.24692230963243111,"score_spread":0.23039845037248383,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2371009812","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034120185,0.000020075231,0.9919092,0.0017848716,0.000113732356,0.00058528717,0.00026731935,0.00025679154,0.001650727],"genre_scores_gemma":[0.49188012,0.0000058359055,0.5023886,0.00040653808,0.00014331903,0.00024075183,0.0023596853,0.00002536025,0.0025497768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979736,0.00014419178,0.0005432831,0.0006020025,0.00035889627,0.00037802474],"domain_scores_gemma":[0.9984133,0.00010648778,0.00031118328,0.00055635703,0.0004850005,0.00012762318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004127196,0.0002510168,0.0003372727,0.00018890116,0.0004270626,0.0004783719,0.00048435133,0.00010698653,0.00026528406],"category_scores_gemma":[0.000045785222,0.00022269643,0.00013463003,0.0007650102,0.0001249797,0.00084911217,0.000070646245,0.00009412499,0.000019934114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000140001575,0.00032918644,0.0016852058,0.000050295912,0.00008211607,0.0000015261559,0.00008668236,0.6581609,0.00013474608,0.33673224,0.0026387677,0.00008429499],"study_design_scores_gemma":[0.0016274974,0.00009985668,0.0021299704,0.000032767573,0.0000947535,0.000008902699,0.000019338444,0.98760414,0.0005050341,0.005800536,0.0016616131,0.0004156149],"about_ca_topic_score_codex":0.00035689952,"about_ca_topic_score_gemma":0.00009750003,"teacher_disagreement_score":0.48952058,"about_ca_system_score_codex":0.00007990123,"about_ca_system_score_gemma":0.00015310924,"threshold_uncertainty_score":0.9081297},"labels":[],"label_agreement":null},{"id":"W2378726186","doi":"","title":"A Character Inequality of the 2-Uniformly Convex Banach Space","year":2012,"lang":"en","type":"article","venue":"Neimenggu Shi-da xuebao. Zhexue shehui kexue hanwen ban","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Agribrands Purina (Canada)","funders":"","keywords":"Uniformly convex space; Mathematics; Banach space; Approximation property; Convex combination; Reflexive space; Pure mathematics; Convex analysis; Character (mathematics); Banach manifold; Subderivative; Regular polygon; Infinite-dimensional vector function; Convex set; Convex optimization; Lp space; Interpolation space; Functional analysis; Geometry","score_opus":0.02115581220359344,"score_gpt":0.24327031808036528,"score_spread":0.22211450587677184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2378726186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37686518,0.0014207312,0.4902142,0.05130365,0.007269024,0.0027419047,0.0002543089,0.0010264199,0.06890457],"genre_scores_gemma":[0.9868238,0.000018734518,0.008463027,0.0016187452,0.00039652133,0.000037578284,0.00003513784,0.000030984666,0.0025755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9965491,0.00044951207,0.00077995105,0.000559679,0.0009395578,0.0007221922],"domain_scores_gemma":[0.99692565,0.00024007574,0.0005964709,0.0015363197,0.00038081105,0.00032066653],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012996759,0.0003920195,0.00054661673,0.00024874377,0.00035720534,0.00026035932,0.0016581581,0.00021462177,0.0005327711],"category_scores_gemma":[0.00022024514,0.0002933244,0.00034349554,0.0016370164,0.00014026013,0.0017620095,0.0006168814,0.00041308426,0.00019813284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057513073,0.0010388276,0.115639195,0.00013196123,0.0005901206,0.000003819177,0.006552737,0.0015111436,0.003967689,0.8607812,0.004769725,0.0049560503],"study_design_scores_gemma":[0.0041306387,0.00031219076,0.57559794,0.00019455691,0.0005705881,0.000045604716,0.00058351475,0.18523067,0.035713516,0.0049892957,0.18990573,0.0027257397],"about_ca_topic_score_codex":0.00029508953,"about_ca_topic_score_gemma":0.000064087675,"teacher_disagreement_score":0.8557919,"about_ca_system_score_codex":0.000119512115,"about_ca_system_score_gemma":0.00022425124,"threshold_uncertainty_score":0.9999519},"labels":[],"label_agreement":null},{"id":"W2393392126","doi":"","title":"Convergence Analysis of General Decomposition Algorithm for Solving General Constrained Variational Inequality Problems","year":2006,"lang":"en","type":"article","venue":"Mathematica Applicata","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Variational inequality; Augmented Lagrangian method; Mathematics; Convergence (economics); Duality (order theory); Lagrangian; Decomposition; Lagrangian relaxation; Applied mathematics; Mathematical optimization; Decomposition method (queueing theory); Pure mathematics; Discrete mathematics","score_opus":0.017098137990259794,"score_gpt":0.2776029922702029,"score_spread":0.26050485427994313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2393392126","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021101062,0.000011435444,0.9963478,0.00045358413,0.000027042164,0.00035845398,0.00017084694,0.00007229773,0.00044847024],"genre_scores_gemma":[0.12862125,0.0000021755636,0.8702098,0.00010057516,0.00006610847,0.00017941286,0.00064056384,0.0000074562545,0.0001726382],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834466,0.000035941604,0.00068866834,0.0003909035,0.00034777957,0.00019205548],"domain_scores_gemma":[0.9985702,0.00022335481,0.00038873206,0.0004444466,0.00031652948,0.000056710996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005373848,0.00014463351,0.00038151292,0.0002530385,0.00012832638,0.00008878181,0.0004907799,0.00006211229,0.00012870453],"category_scores_gemma":[0.000023003611,0.00013656788,0.00022930687,0.0012479326,0.000046483987,0.00021163055,0.000098507335,0.00004094355,0.000008509439],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001780421,0.00026989696,0.0002105821,0.000040407165,0.0004108701,1.7864035e-7,0.000097424745,0.042647127,0.0039790226,0.9506414,0.00026794992,0.0014333451],"study_design_scores_gemma":[0.0002549922,0.000013079916,0.0014938489,0.000004670325,0.00029473155,0.0000014974607,0.0000034379,0.9401429,0.0012570624,0.056328703,0.000059277932,0.00014574884],"about_ca_topic_score_codex":0.00009278432,"about_ca_topic_score_gemma":0.000009530196,"teacher_disagreement_score":0.8974958,"about_ca_system_score_codex":0.000039263607,"about_ca_system_score_gemma":0.000058267706,"threshold_uncertainty_score":0.5569076},"labels":[],"label_agreement":null},{"id":"W2394216847","doi":"","title":"Some Characterizations of Locally Lipschitz Pseudolinear Functions","year":2005,"lang":"en","type":"article","venue":"Mathematica Applicata","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Lipschitz continuity; Mathematics; Banach space; Function (biology); Mathematical optimization; Pure mathematics; Applied mathematics","score_opus":0.0129487692122405,"score_gpt":0.23377768942493893,"score_spread":0.22082892021269843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2394216847","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00082067697,0.000020032645,0.9910675,0.0056445464,0.000023137249,0.000152487,0.000019203586,0.0001267727,0.0021256297],"genre_scores_gemma":[0.37242103,0.000043061595,0.622217,0.0011373773,0.0003746837,0.00014475443,0.00010089259,0.000023208311,0.0035379617],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901,0.000018342535,0.00037467657,0.00023347583,0.00023188886,0.00013161269],"domain_scores_gemma":[0.9989159,0.00007385468,0.00015904948,0.0006585818,0.00011488438,0.000077742996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015068421,0.00009959724,0.00017996968,0.000120166245,0.00009920922,0.000061449726,0.00058695854,0.00004190635,0.00021026556],"category_scores_gemma":[0.00003676203,0.00008874057,0.00008072853,0.00055864133,0.00003337019,0.00038806457,0.00015096342,0.000059198406,0.00071594736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014022582,0.0003202968,0.000022436718,0.000023474351,0.000040220268,1.3921928e-7,0.00019490728,0.0018325904,0.002011211,0.9909326,0.0012003431,0.0034203941],"study_design_scores_gemma":[0.00023790437,0.000018731776,0.00035220504,0.000015209742,0.00003944799,0.0000081828875,0.000014582912,0.9686829,0.0020429129,0.016870812,0.011533614,0.00018351994],"about_ca_topic_score_codex":0.0000018902551,"about_ca_topic_score_gemma":9.430481e-7,"teacher_disagreement_score":0.9740618,"about_ca_system_score_codex":0.0000151459135,"about_ca_system_score_gemma":0.000043701257,"threshold_uncertainty_score":0.9202293},"labels":[],"label_agreement":null},{"id":"W24073905","doi":"10.1007/978-1-4757-3141-5_9","title":"Conditions (S)+ and (S) + 1 : Applications to Complementarity Theory","year":2000,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Complementarity (molecular biology); Mathematical economics; Compact space; Mathematics; Mixed complementarity problem; Complementarity theory; Pure mathematics; Mathematical optimization; Physics; Quantum mechanics","score_opus":0.01832681258036193,"score_gpt":0.2653044174696567,"score_spread":0.2469776048892948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W24073905","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.6242366e-7,0.00031701144,0.79932374,0.002228815,0.000023076504,0.0013820408,0.00032886045,0.00018918444,0.19620691],"genre_scores_gemma":[0.0059098057,0.012693947,0.41090068,0.019904125,0.001035062,0.006594256,0.007401279,0.0002768382,0.535284],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980231,0.00004110595,0.000554452,0.0008622087,0.0003016347,0.00021747974],"domain_scores_gemma":[0.99820584,0.0002076113,0.00024654364,0.00061703613,0.0003598419,0.00036310998],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021010062,0.0003616682,0.00036260282,0.0004429907,0.00072408805,0.00030366628,0.00048211575,0.0002209987,0.002839924],"category_scores_gemma":[0.0000104338,0.00039565135,0.00008696976,0.00032552076,0.000088480585,0.0003548007,0.00024026392,0.00021901651,0.000310549],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026674193,0.000040388506,0.0000024284193,0.000016595954,0.00007103618,2.3643855e-7,0.0000903167,0.01627267,0.000002960714,0.97215,0.0007617166,0.010588952],"study_design_scores_gemma":[0.0003884148,0.000040543513,0.000038571812,0.000028996588,0.00017664659,0.000013942261,0.000020667818,0.14353941,0.0000102701815,0.109829664,0.7452609,0.000652004],"about_ca_topic_score_codex":0.0000056044614,"about_ca_topic_score_gemma":0.0000114574605,"teacher_disagreement_score":0.86232036,"about_ca_system_score_codex":0.0000681451,"about_ca_system_score_gemma":0.00012121415,"threshold_uncertainty_score":0.99984956},"labels":[],"label_agreement":null},{"id":"W2495379199","doi":"10.6000/1927-5129.2016.12.45","title":"Generalized Higher Order (φ, η, ω, π, ρ, θ, m)-Invexities in Parametric Optimality Conditions for Discrete Minmax Fractional Programming","year":2016,"lang":"en","type":"article","venue":"Journal of Basic & Applied Sciences","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Minimax; Mathematics; Parametric statistics; Order (exchange); Fractional programming; Mathematical optimization; Range (aeronautics); Applied mathematics; Set (abstract data type); Parametric programming; Nonlinear programming; Computer science; Nonlinear system; Statistics","score_opus":0.03681482225351161,"score_gpt":0.3067474715409079,"score_spread":0.2699326492873963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2495379199","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027667189,0.00006576331,0.9600781,0.010609052,0.00039573383,0.00019361536,0.000010291293,0.000022780006,0.0009574681],"genre_scores_gemma":[0.7188921,0.000016112646,0.2802932,0.00035081827,0.00012728357,0.00003205369,0.0000016823506,0.0000036274057,0.00028310882],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982731,0.000058649985,0.0005495277,0.00025586516,0.0006169706,0.00024591835],"domain_scores_gemma":[0.99842703,0.00052232004,0.00050049037,0.00012661268,0.00032730805,0.000096216776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012726616,0.00011546367,0.00024599396,0.0005745195,0.0002641438,0.0002265559,0.0005922956,0.000048961898,0.00016109961],"category_scores_gemma":[0.00014608023,0.0000711188,0.00012443424,0.0017304781,0.00022104237,0.00091695756,0.00005331788,0.000080135185,0.0000052565356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049054393,0.00023032798,0.0038437457,0.0000119696,0.00008469396,0.000003319316,0.00021467589,0.029065631,0.001490592,0.95433635,0.0014969718,0.009172697],"study_design_scores_gemma":[0.012599169,0.0012536146,0.080724694,0.00026432818,0.0002648557,0.00011638266,0.0010268894,0.3247281,0.0038511176,0.4971686,0.07602325,0.0019789992],"about_ca_topic_score_codex":0.000010778384,"about_ca_topic_score_gemma":0.000007541966,"teacher_disagreement_score":0.69122493,"about_ca_system_score_codex":0.0000796094,"about_ca_system_score_gemma":0.0003058589,"threshold_uncertainty_score":0.29001403},"labels":[],"label_agreement":null},{"id":"W2506594826","doi":"10.1017/cbo9780511810183.010","title":"Classification of PDEs and problem types","year":2010,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Content (measure theory); Computer science; Information retrieval; Mathematics; Mathematical analysis","score_opus":0.01924526546360714,"score_gpt":0.19215174589539216,"score_spread":0.17290648043178503,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2506594826","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000024684325,0.000030842355,0.06387543,0.000071809845,0.00004496635,0.00010696967,0.00002910242,0.000047404832,0.9357688],"genre_scores_gemma":[0.0028654726,0.00006334495,0.014951338,0.00002247314,0.000023640381,2.3462995e-7,0.000021327323,0.0000075022676,0.98204464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99938595,0.000014756462,0.00011937687,0.00026234912,0.00014952093,0.00006802623],"domain_scores_gemma":[0.99917233,0.00003664384,0.0002156144,0.00029304693,0.00022429462,0.000058057012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006386503,0.00011709689,0.0001694242,0.00015280579,0.00008305108,0.00003739028,0.00035686383,0.00017009448,0.0000032142643],"category_scores_gemma":[0.0000046303153,0.00012690733,0.00006451761,0.000012057425,0.000097097436,0.000115302624,0.00020085655,0.00015179766,0.000002953737],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041015164,0.000004483702,0.000005607223,0.000023800274,0.000050109018,0.0000022618397,0.000030046192,0.000007750237,0.00020799138,0.99821204,0.0005031311,0.0009486531],"study_design_scores_gemma":[0.00039597356,0.00004320366,0.0005380654,0.00007446158,0.00022561698,0.0000067167543,0.000008216434,0.020178754,0.00058749504,0.00049087475,0.9770331,0.00041751724],"about_ca_topic_score_codex":0.000029527173,"about_ca_topic_score_gemma":0.000002201708,"teacher_disagreement_score":0.9977212,"about_ca_system_score_codex":0.000021222399,"about_ca_system_score_gemma":0.000062145955,"threshold_uncertainty_score":0.51751304},"labels":[],"label_agreement":null},{"id":"W2520297704","doi":"10.1109/tac.2017.2667043","title":"On the Relation Between the Minimum Principle and Dynamic Programming for Classical and Hybrid Control Systems","year":2017,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hybrid system; Optimal control; Dynamic programming; Control theory (sociology); State (computer science); Bellman equation; Relation (database); Maximum principle; Function (biology)","score_opus":0.014884883991991145,"score_gpt":0.25936579393652676,"score_spread":0.2444809099445356,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520297704","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013483618,0.000017178283,0.96817356,0.016886786,0.00018079457,0.0011069758,0.00003101249,0.00008477208,0.000035291912],"genre_scores_gemma":[0.9976706,0.0000036675262,0.0015327409,0.0002353706,0.000028346014,0.00031928337,0.0000013167008,0.000008440328,0.00020021753],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893624,0.00013966093,0.00027812846,0.0002523292,0.00023088792,0.0001627421],"domain_scores_gemma":[0.99732935,0.0018044261,0.0002287598,0.00049701764,0.00007815171,0.000062300314],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.000583081,0.00013219226,0.00021320218,0.000067376204,0.001356127,0.00069935014,0.0003428956,0.00004631008,0.0000047514027],"category_scores_gemma":[0.00008605425,0.00007742283,0.00008949585,0.000062911975,0.00009283438,0.00023174747,0.0000027047065,0.00011276692,0.0000059923273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024603336,0.00064348127,0.0008827127,0.00023051983,0.0025283468,0.0000060758484,0.0014627298,0.19697253,0.00030377586,0.25512114,0.00028202136,0.5413206],"study_design_scores_gemma":[0.0013674198,0.0001132007,0.006890861,0.00002902842,0.00015814774,0.0000042027064,0.000013277261,0.99032164,0.000008839114,0.00077756896,0.00022332241,0.00009250707],"about_ca_topic_score_codex":0.000010799526,"about_ca_topic_score_gemma":0.000011539824,"teacher_disagreement_score":0.984187,"about_ca_system_score_codex":0.00003688191,"about_ca_system_score_gemma":0.000035619396,"threshold_uncertainty_score":0.999944},"labels":[],"label_agreement":null},{"id":"W2525170832","doi":"","title":"The Hölder continuity of vector-valued function associated with second-order cone","year":2012,"lang":"en","type":"article","venue":"Pacific Journal of Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Cone (formal languages); Mathematics; Order (exchange); Hölder condition; Function (biology); Mathematical analysis; Pure mathematics; Algorithm; Economics","score_opus":0.009868538411799632,"score_gpt":0.214786270255724,"score_spread":0.20491773184392437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525170832","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001960429,0.00021293988,0.9949232,0.00048791978,0.00038317844,0.000079855614,0.000002186636,0.000016807997,0.0019335141],"genre_scores_gemma":[0.96367913,0.000036071855,0.035579327,0.000047291785,0.00007563508,0.0000018122013,0.000010187906,0.0000080443915,0.00056246493],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856716,0.00020844016,0.00049121265,0.00009365466,0.00046379986,0.00017575387],"domain_scores_gemma":[0.99701065,0.00020359328,0.001018819,0.00017721599,0.0015056933,0.00008405664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011836109,0.00010331098,0.0002084743,0.00013212331,0.00017730612,0.00010284064,0.00024154762,0.000058411213,0.00013840145],"category_scores_gemma":[0.00028770053,0.00006582906,0.00008108311,0.00083913,0.000050193725,0.00091930915,0.00002706069,0.00012531996,0.0000026824587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018557951,0.0005021249,0.017746663,0.000012105434,0.0008702671,0.0000012570937,0.0018912955,0.9146325,0.00036674927,0.060387637,0.0017696483,0.001634175],"study_design_scores_gemma":[0.001894817,0.00032508158,0.033527464,0.000054197335,0.00023030367,0.00003225006,0.00042729027,0.96112037,0.00037574198,0.00033454766,0.0014302208,0.00024769918],"about_ca_topic_score_codex":0.0000017127899,"about_ca_topic_score_gemma":0.000003227775,"teacher_disagreement_score":0.96171874,"about_ca_system_score_codex":0.00005764352,"about_ca_system_score_gemma":0.0001057964,"threshold_uncertainty_score":0.2684431},"labels":[],"label_agreement":null},{"id":"W2551042608","doi":"10.1007/s11784-016-0377-x","title":"Nonlinear common fixed point properties of semitopological semigroups in uniformly convex spaces","year":2016,"lang":"en","type":"article","venue":"Journal of Fixed Point Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Banach space; Uniformly convex space; Regular polygon; Pure mathematics; Fixed point; Semigroup; Fixed-point property; Discrete mathematics; Fixed-point theorem; Mathematical analysis; Banach manifold; Lp space","score_opus":0.011973003817722067,"score_gpt":0.23729113974426064,"score_spread":0.22531813592653857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2551042608","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18427637,0.00037177195,0.80200905,0.012394288,0.00005028808,0.00021271921,0.000013593407,0.00002403895,0.00064790394],"genre_scores_gemma":[0.98838377,0.00020766258,0.010915426,0.0002392722,0.00006371142,0.00001066967,0.0000012583519,0.000003774584,0.00017446898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889606,0.00018039523,0.0005210909,0.00013019786,0.00016401913,0.00010822307],"domain_scores_gemma":[0.99879086,0.0003329974,0.0004035396,0.00019399374,0.00020025558,0.000078356425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010040865,0.00009255677,0.00025460447,0.0001742248,0.000076481374,0.000038621234,0.0003430285,0.000059023714,0.000056461166],"category_scores_gemma":[0.00010295575,0.000052847055,0.00008487148,0.00031353318,0.00012926185,0.00037759275,0.000084554966,0.00011046377,0.0000053912727],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010996146,0.0003481325,0.0024726186,0.000024751262,0.0000721403,0.000002956172,0.00072823954,0.00031925412,0.01949418,0.9650088,0.00013728953,0.011281655],"study_design_scores_gemma":[0.0070372997,0.0012893578,0.026727697,0.0010658876,0.0002798027,0.0005379131,0.0037396478,0.03392304,0.1708257,0.7338766,0.019395247,0.0013018202],"about_ca_topic_score_codex":0.0000053257636,"about_ca_topic_score_gemma":0.000005748,"teacher_disagreement_score":0.80410737,"about_ca_system_score_codex":0.00002541222,"about_ca_system_score_gemma":0.000057427023,"threshold_uncertainty_score":0.21550404},"labels":[],"label_agreement":null},{"id":"W2552240618","doi":"","title":"Maximal Monotonicity via Convex Analysis","year":2006,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":107,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Subderivative; Combinatorics; Mathematics; Convex set; Monotone polygon; Monotonic function; Regular polygon; Convex function; Domain (mathematical analysis); Banach space; Function (biology); Discrete mathematics; Mathematical analysis; Geometry; Convex optimization","score_opus":0.005486635744944309,"score_gpt":0.2075682200849598,"score_spread":0.20208158434001547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2552240618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015325758,0.000008413068,0.9744021,0.0016537093,0.000026095193,0.000027419841,9.1975124e-7,0.000118478754,0.02223025],"genre_scores_gemma":[0.8572789,0.0000012573254,0.13893674,0.00046822533,0.000019292622,0.0000030441956,0.00001581177,0.0000017250003,0.0032750447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927545,0.00002631322,0.00016847621,0.0002223537,0.00019303447,0.00011439451],"domain_scores_gemma":[0.999524,0.000027086575,0.000052799525,0.00025730126,0.00010036468,0.000038431794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000107335116,0.00006552023,0.00012935167,0.0002138855,0.00007699807,0.00011277289,0.00030058352,0.00002844725,0.0006454955],"category_scores_gemma":[0.000003356087,0.000055489636,0.00014597189,0.0016504546,0.000011429895,0.00025463587,0.0000671141,0.00003106465,0.0001321715],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000167221,0.00011282771,0.022304429,9.060698e-7,0.0002908939,0.0000027252065,0.00002484783,0.17044489,0.000080041136,0.80405194,0.0011737172,0.0015110944],"study_design_scores_gemma":[0.000080012156,0.000004237415,0.037045103,1.1982897e-7,0.00006746417,8.498848e-7,0.0000011795739,0.9570762,0.00024317967,0.0046068043,0.00079500163,0.00007987768],"about_ca_topic_score_codex":0.0006613559,"about_ca_topic_score_gemma":0.00012345366,"teacher_disagreement_score":0.85574627,"about_ca_system_score_codex":0.000020480482,"about_ca_system_score_gemma":0.000018081182,"threshold_uncertainty_score":0.7067723},"labels":[],"label_agreement":null},{"id":"W2570642804","doi":"10.1007/978-3-540-74208-1_12","title":"Integrality Gaps of Semidefinite Programs for Vertex Cover and Relations to ℓ1 Embeddability of Negative Type Metrics","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Vertex cover; Cover (algebra); Vertex (graph theory); Mathematics; Combinatorics; Type (biology); Discrete mathematics; Engineering; Geology; Time complexity; Graph","score_opus":0.03931546203792397,"score_gpt":0.29705768397094146,"score_spread":0.2577422219330175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2570642804","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020839437,0.00008609455,0.9974946,0.00035571487,0.00028176614,0.00046017568,0.000019864983,0.000024705514,0.0010687165],"genre_scores_gemma":[0.17156884,0.000013486182,0.8277739,0.00035018925,0.00002965303,0.000004934869,0.000013540921,0.000008925951,0.0002365281],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978995,0.00003083735,0.0005799896,0.0006967101,0.00057227723,0.00022071373],"domain_scores_gemma":[0.9962469,0.0013874092,0.00036421965,0.0005571132,0.001332455,0.0001119325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012064837,0.0002196506,0.00044316525,0.0008641855,0.00009151401,0.000090912545,0.0007982064,0.00017642014,0.00001769781],"category_scores_gemma":[0.001021354,0.00019118343,0.00011207877,0.002069281,0.0003587725,0.00027852046,0.00041875144,0.0002189521,0.0000041924786],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007196899,0.00020510876,0.003793201,0.0001918231,0.00010741012,0.000002101624,0.0032094906,0.1964501,0.00007124413,0.2528278,0.000061665196,0.5430081],"study_design_scores_gemma":[0.00024472625,0.00029982795,0.0015591816,0.00015963642,0.000031489766,0.00000241684,6.1020586e-7,0.84835154,0.00059193344,0.14792576,0.00054060423,0.00029230537],"about_ca_topic_score_codex":0.00004925164,"about_ca_topic_score_gemma":0.000051884374,"teacher_disagreement_score":0.6519014,"about_ca_system_score_codex":0.00013235291,"about_ca_system_score_gemma":0.00032498728,"threshold_uncertainty_score":0.7796234},"labels":[],"label_agreement":null},{"id":"W2575486826","doi":"10.1007/s10107-017-1112-0","title":"Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs","year":2017,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Lipschitz continuity; Mathematics; Karush–Kuhn–Tucker conditions; Function (biology); Separable space; Constraint (computer-aided design); Normality; Applied mathematics; Term (time); Mathematical optimization; Continuous function (set theory); Nonlinear system; Mathematical analysis; Statistics","score_opus":0.037064566557147266,"score_gpt":0.3220293890959318,"score_spread":0.2849648225387845,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575486826","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027354772,0.000007887846,0.9932369,0.0020673827,0.000045745204,0.0005638533,0.0000044895264,0.00011448785,0.0012237782],"genre_scores_gemma":[0.32331783,0.000002773653,0.67611754,0.000076091026,0.000060962873,0.00015034949,0.00005228874,0.0000098018,0.0002123286],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989108,0.000025121448,0.00029261305,0.00032681736,0.000217435,0.00022720742],"domain_scores_gemma":[0.9988748,0.00011855765,0.00021642173,0.00048809886,0.00017502235,0.00012712533],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00046017318,0.00013079886,0.00020774848,0.000057025652,0.0008432907,0.0012437687,0.00047666155,0.00006362491,0.00002594557],"category_scores_gemma":[0.00033685833,0.000112031164,0.00009288675,0.00011395662,0.00010438911,0.0007429668,0.00019028853,0.00006830731,0.000016131455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012051344,0.0008643256,0.0026734874,0.0004346509,0.00014960393,0.0000049865052,0.00063872006,0.0003373358,0.000052047177,0.80785525,0.00014525726,0.1868323],"study_design_scores_gemma":[0.0004102519,0.00006435812,0.0016962969,0.000048993756,0.000045395103,0.00000779467,0.00003151821,0.9653103,0.000043776807,0.030967819,0.0011958656,0.00017763703],"about_ca_topic_score_codex":0.000009014977,"about_ca_topic_score_gemma":0.0000037488685,"teacher_disagreement_score":0.964973,"about_ca_system_score_codex":0.00001538628,"about_ca_system_score_gemma":0.000032717744,"threshold_uncertainty_score":0.99979305},"labels":[],"label_agreement":null},{"id":"W2582597102","doi":"10.5539/jmr.v9n1p84","title":"A Viscosity Approximation Method for the Split Feasibility Problems in Hilbert Space","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hilbert space; Lambda; Viscosity; Sequence (biology); Space (punctuation); Alpha (finance); Combinatorics; Mathematical analysis; Physics; Statistics; Thermodynamics; Quantum mechanics; Chemistry","score_opus":0.21991190936472432,"score_gpt":0.46817365555200524,"score_spread":0.24826174618728092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2582597102","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013976953,0.00003794844,0.97558254,0.021992333,0.000054391763,0.00038648577,0.0000010546909,0.0000037082355,0.0005438328],"genre_scores_gemma":[0.14005913,0.000041716765,0.85929793,0.000030775587,0.000069223395,0.000019161826,3.593186e-7,0.000005697338,0.0004759961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981823,0.0002210967,0.00044408956,0.0001347437,0.00083128,0.00018647796],"domain_scores_gemma":[0.9962262,0.0015427609,0.0005054637,0.0006504034,0.0010129649,0.00006224235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013858755,0.000065001565,0.00020239274,0.00021688157,0.0004699386,0.0006326293,0.001516509,0.000044400636,0.000013954246],"category_scores_gemma":[0.003017506,0.00003935731,0.00012125124,0.00026209452,0.000052367024,0.0005751237,0.00024773713,0.00028360754,0.0000050046556],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047234553,0.0016973923,0.0042337338,0.0005611441,0.00021768505,0.0000054769334,0.008185415,0.041088622,0.00083010097,0.92980987,0.0027073347,0.010616001],"study_design_scores_gemma":[0.00036540866,0.000048991904,0.0049398113,0.000046726745,0.000008771137,0.000010494103,0.00010239499,0.8742144,0.00015047741,0.1197778,0.00029301507,0.00004169262],"about_ca_topic_score_codex":0.000045879577,"about_ca_topic_score_gemma":0.000055469965,"teacher_disagreement_score":0.83312577,"about_ca_system_score_codex":0.00011866526,"about_ca_system_score_gemma":0.00017029307,"threshold_uncertainty_score":0.6100459},"labels":[],"label_agreement":null},{"id":"W2592535213","doi":"10.1137/15m1016989","title":"The Douglas--Rachford Algorithm for Two (Not Necessarily Intersecting) Affine Subspaces","year":2016,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Iterated function; Linear subspace; Monotone polygon; Affine transformation; Sequence (biology); Regular polygon; Convergence (economics); Algorithm; Cone (formal languages); Conic optimization; Pure mathematics; Convex optimization; Subderivative; Mathematical analysis; Geometry","score_opus":0.013184622947765672,"score_gpt":0.264885286470722,"score_spread":0.25170066352295634,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592535213","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000699514,0.000045124565,0.97958106,0.018211687,0.0012317229,0.00015472827,0.0000057230736,0.00007306489,0.0006269203],"genre_scores_gemma":[0.06159885,0.00077931565,0.92643476,0.001872786,0.0016678441,0.000049194045,0.000017179087,0.0000458983,0.0075341896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998463,0.00013124672,0.00043396326,0.00027282862,0.0004149039,0.00028406645],"domain_scores_gemma":[0.9979326,0.00061334134,0.0004592057,0.00028359052,0.00059393636,0.00011732753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089341396,0.00016834211,0.000164015,0.00020496831,0.00086148566,0.0007324054,0.00066874723,0.000054703964,0.000078878475],"category_scores_gemma":[0.00030166475,0.00009120685,0.00017045859,0.0004741368,0.000037506863,0.00094889343,0.00007464571,0.00012965845,0.000020047935],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006112196,0.00007617923,0.000045272143,0.0000021098438,0.000114374205,0.000002370149,0.00019961865,0.7031754,0.00006337049,0.038414527,0.0024031384,0.2554425],"study_design_scores_gemma":[0.001202559,0.00017592635,0.000044654917,0.000031675623,0.000020837602,0.000028565044,0.000041123265,0.9874426,0.00030018127,0.0012450716,0.009307173,0.00015962348],"about_ca_topic_score_codex":0.0000036293015,"about_ca_topic_score_gemma":0.0000071332174,"teacher_disagreement_score":0.2842672,"about_ca_system_score_codex":0.00012345944,"about_ca_system_score_gemma":0.00009686388,"threshold_uncertainty_score":0.70626026},"labels":[],"label_agreement":null},{"id":"W2593829505","doi":"10.1016/j.jat.2012.05.008","title":"Attouch–Théra duality revisited: Paramonotonicity and operator splitting","year":2012,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":45,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Canada Research Chairs; Deutsche Forschungsgemeinschaft","keywords":"Mathematics; Duality (order theory); Monotone polygon; Hilbert space; Operator (biology); Intersection (aeronautics); Projection (relational algebra); Pure mathematics; Combinatorics; Applied mathematics; Discrete mathematics; Algorithm","score_opus":0.012640666684809638,"score_gpt":0.2530446148449361,"score_spread":0.24040394816012647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593829505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06824346,0.00039255113,0.9292504,0.000957687,0.00011747064,0.000066800436,0.0000012459079,0.000019877936,0.0009504754],"genre_scores_gemma":[0.85280883,0.000051649844,0.14635675,0.0005252872,0.00017265535,0.0000015259502,0.0000017191444,0.0000043304467,0.0000772673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871546,0.0003119805,0.00046942837,0.00009870398,0.0002712765,0.00013314694],"domain_scores_gemma":[0.99872726,0.00020188092,0.00049936253,0.00016236224,0.0002787509,0.00013036077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032996503,0.00008411923,0.00018761445,0.00013249,0.00012094547,0.0001481053,0.00022503067,0.00004447205,0.000054072774],"category_scores_gemma":[0.0003254058,0.000065789616,0.000077802164,0.00029359412,0.000026087291,0.001537655,0.00007214955,0.000126735,0.000009744213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018877383,0.00012194195,0.0046515767,0.000025322564,0.0000705738,8.5836393e-7,0.0015281293,0.00077286636,0.00027173987,0.98350036,0.00021162504,0.008826099],"study_design_scores_gemma":[0.0027851267,0.0002429703,0.10646781,0.00022186087,0.00032792907,0.0004705035,0.0012179572,0.6701162,0.007123676,0.20133989,0.0086862575,0.000999833],"about_ca_topic_score_codex":8.704551e-7,"about_ca_topic_score_gemma":5.5999948e-8,"teacher_disagreement_score":0.7845653,"about_ca_system_score_codex":0.000039257502,"about_ca_system_score_gemma":0.000039986688,"threshold_uncertainty_score":0.26828226},"labels":[],"label_agreement":null},{"id":"W2594136212","doi":"10.1007/978-3-319-48311-5_16","title":"Subdifferentiability of Convex Functions","year":2017,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Subderivative; Mathematics; Convex conjugate; Convex function; Effective domain; Separable space; Operator (biology); Pure mathematics; Convex analysis; Regular polygon; Domain (mathematical analysis); Mathematical analysis; Convex optimization; Geometry","score_opus":0.03506710262759384,"score_gpt":0.25158508930238854,"score_spread":0.21651798667479472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2594136212","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00001279924,0.00003650727,0.40924194,0.00012397903,0.00015717962,0.00013985913,0.000016574279,0.000034990448,0.5902362],"genre_scores_gemma":[0.009061261,0.000035038698,0.049929213,0.00003893197,0.000051481355,0.000011143277,0.0000311593,0.000025502668,0.9408163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987545,0.000012964429,0.0005370986,0.00027334836,0.00031265206,0.000109419714],"domain_scores_gemma":[0.99790585,0.0001232241,0.000577763,0.0011388202,0.00020673896,0.00004759839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027102,0.00018760024,0.00046778683,0.00020322368,0.000079091515,0.0000787167,0.0007630655,0.00017807276,0.0003490589],"category_scores_gemma":[0.00009800493,0.0001735571,0.00018362666,0.00002144299,0.00010824407,0.00012146822,0.00022297319,0.0001809383,0.00007536715],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.7190075e-7,0.000050900322,0.000056478522,0.00012086135,0.000052723106,0.0000013617181,0.00022691124,0.00009007631,0.0000042090664,0.99861723,0.0002925538,0.00048601194],"study_design_scores_gemma":[0.00021546529,0.00002360748,0.00018857192,0.00021475724,0.000087452885,0.0000029668474,0.000008296475,0.11720543,0.000026305686,0.87310976,0.008619705,0.00029765183],"about_ca_topic_score_codex":0.0000040395335,"about_ca_topic_score_gemma":0.00001564412,"teacher_disagreement_score":0.3593127,"about_ca_system_score_codex":0.000049395367,"about_ca_system_score_gemma":0.00010448785,"threshold_uncertainty_score":0.7077453},"labels":[],"label_agreement":null},{"id":"W2596712598","doi":"","title":"An extension of michael's selection theorem","year":2011,"lang":"en","type":"article","venue":"Acta Mathematica Vietnamica","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Extension (predicate logic); Mathematical economics; Selection (genetic algorithm); Mathematics; Calculus (dental); Computer science; Economics; Artificial intelligence","score_opus":0.022020696496426094,"score_gpt":0.24525403450721453,"score_spread":0.22323333801078843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596712598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024260495,0.0000068769928,0.96892273,0.000335815,0.000048118272,0.000106966356,0.0000013032982,0.0001230825,0.0061946223],"genre_scores_gemma":[0.71806467,0.0000062466006,0.2817355,0.00008438909,0.000009604978,0.000004467806,0.0000028858028,0.0000060676944,0.00008616198],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908435,0.00006670904,0.00028160602,0.00023727877,0.00020722601,0.0001228192],"domain_scores_gemma":[0.99906176,0.00004279659,0.00017600284,0.00047063667,0.00018620223,0.00006261754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028725612,0.00009732426,0.00017344524,0.00012404927,0.00007241772,0.00002943266,0.00048383093,0.000049432758,0.00031245546],"category_scores_gemma":[0.000057596244,0.00007873664,0.000072435345,0.00043907049,0.000030276276,0.00050420547,0.000063521205,0.000051528426,0.00003906173],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009649345,0.0005277162,0.00013052397,0.000030207046,0.000051295217,7.986122e-7,0.0036358035,0.00006777141,0.02019822,0.9733465,0.00014968863,0.0018518437],"study_design_scores_gemma":[0.00015004484,0.00011075891,0.002612911,0.00002256339,0.000035332763,0.000014697678,0.00007534387,0.87295914,0.006462733,0.11734978,0.00005211063,0.00015455952],"about_ca_topic_score_codex":0.0000088379165,"about_ca_topic_score_gemma":0.0000026188713,"teacher_disagreement_score":0.87289137,"about_ca_system_score_codex":0.000014908365,"about_ca_system_score_gemma":0.00002800082,"threshold_uncertainty_score":0.3421168},"labels":[],"label_agreement":null},{"id":"W2607696564","doi":"10.1090/crmp/055/13","title":"On a family of outer functions","year":2012,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Computer science","score_opus":0.018964791432463518,"score_gpt":0.21960107134637222,"score_spread":0.2006362799139087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2607696564","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022035973,0.0003711572,0.46749923,0.0013233601,0.0002736904,0.00013105168,0.00001527553,0.0001265293,0.5302377],"genre_scores_gemma":[0.970523,0.00013950557,0.007973455,0.0036362146,0.0010334314,0.00002658774,0.000082588616,0.00008739273,0.016497819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986355,0.0000027827239,0.00031316845,0.00041836957,0.00043441643,0.00019578479],"domain_scores_gemma":[0.99868333,0.00010806697,0.00035023873,0.00020838028,0.00055419264,0.000095772215],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00012038844,0.00029881002,0.00034641993,0.0003802545,0.000114273724,0.00011149431,0.0004494239,0.00030808066,0.00029138871],"category_scores_gemma":[0.00009735822,0.00024930364,0.00023879473,0.00016841869,0.000037751368,0.0002479644,0.0001118579,0.00031258832,0.00019327679],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064646224,0.000025969328,0.000020502583,0.00002797078,0.00010602137,3.769396e-7,0.00028202237,0.0002889757,0.00015940962,0.9906162,0.0004714115,0.007994699],"study_design_scores_gemma":[0.00032722845,0.00021737299,0.0002596828,0.00021802285,0.00033139548,0.000012444134,0.0000054429765,0.009843347,0.000688203,0.90152866,0.085768804,0.0007993956],"about_ca_topic_score_codex":0.000004378312,"about_ca_topic_score_gemma":9.4252243e-7,"teacher_disagreement_score":0.97050095,"about_ca_system_score_codex":0.00004985558,"about_ca_system_score_gemma":0.00006347864,"threshold_uncertainty_score":0.99999595},"labels":[],"label_agreement":null},{"id":"W2609456416","doi":"10.1090/crmp/055/17","title":"Orlicz capacity of balls","year":2012,"lang":"en","type":"book-chapter","venue":"CRM proceedings & lecture notes","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Western University","funders":"","keywords":"Mathematics","score_opus":0.02277875756370644,"score_gpt":0.21693652229019947,"score_spread":0.19415776472649304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2609456416","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005084681,0.00061774196,0.41477185,0.0017111738,0.00022759048,0.000191766,0.000017763296,0.00017399956,0.58223724],"genre_scores_gemma":[0.9715217,0.00020545309,0.022059692,0.0011901044,0.0008690383,0.000011522854,0.00003788929,0.00006483756,0.0040397597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847287,0.0000035122696,0.0003728923,0.0004336825,0.00048138353,0.00023566498],"domain_scores_gemma":[0.9983177,0.000088986184,0.0004985498,0.00021388498,0.0007570677,0.0001238185],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00019919325,0.0003251514,0.00044773193,0.00028334872,0.00009992488,0.00011924747,0.0006894979,0.00037713224,0.00046139592],"category_scores_gemma":[0.00014894283,0.00028093293,0.00023607952,0.00018058287,0.000060878046,0.00035929176,0.00017072735,0.0003259793,0.000079047764],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002458943,0.000017192357,0.00009485271,0.00005967897,0.00009880038,2.299799e-7,0.00047968904,0.000087420296,0.00037468,0.99447435,0.000092591894,0.0042180247],"study_design_scores_gemma":[0.00024193313,0.00007563248,0.0003099693,0.00017320267,0.00027214983,0.000018823197,0.000002465566,0.008656728,0.0052599614,0.9289184,0.055263843,0.0008068756],"about_ca_topic_score_codex":0.000011816733,"about_ca_topic_score_gemma":0.0000032608077,"teacher_disagreement_score":0.97147083,"about_ca_system_score_codex":0.000057108526,"about_ca_system_score_gemma":0.00007289728,"threshold_uncertainty_score":0.9999643},"labels":[],"label_agreement":null},{"id":"W2616442567","doi":"10.22436/jnsa.010.05.41","title":"More general viscosity implicit midpoint rule for nonexpansive mapping with applications","year":2017,"lang":"en","type":"article","venue":"The Journal of Nonlinear Sciences and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai Normal University; York University","keywords":"Midpoint; Midpoint method; Mathematics; Viscosity; Applied mathematics; Geometry; Thermodynamics; Physics","score_opus":0.025275382019978403,"score_gpt":0.30465744447290205,"score_spread":0.27938206245292363,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2616442567","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007777269,0.00007879292,0.97815305,0.013426467,0.000016436928,0.00028724593,0.000013126397,0.000008616661,0.00023900783],"genre_scores_gemma":[0.17264433,0.00023483227,0.825449,0.0008123043,0.0005038181,0.00010595541,0.000004077631,0.0000068904355,0.00023878351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992514,0.000017814602,0.00023070941,0.00015175955,0.00022358709,0.00012471221],"domain_scores_gemma":[0.99855506,0.00010719185,0.00051552546,0.00036172534,0.00038390947,0.0000765647],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005806078,0.000077470286,0.00012744595,0.00007872091,0.0019432169,0.00036115787,0.0011574199,0.000020243988,0.0000025075308],"category_scores_gemma":[0.00001703998,0.000044743836,0.000054879943,0.00025675783,0.00026357034,0.0004511823,0.00012192774,0.00007303972,0.0000019055896],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062516374,0.0007088879,0.005964632,0.0000692824,0.00039698358,0.0000016586059,0.0032140485,0.076616965,0.008050854,0.7802454,0.00093100045,0.123737775],"study_design_scores_gemma":[0.00093336334,0.00025056885,0.02788527,0.000035875593,0.00015769603,0.00017697124,0.00080577994,0.90944153,0.001030982,0.022935249,0.035999548,0.00034719158],"about_ca_topic_score_codex":0.000027899552,"about_ca_topic_score_gemma":0.000009638856,"teacher_disagreement_score":0.8328245,"about_ca_system_score_codex":0.000012636081,"about_ca_system_score_gemma":0.000121819685,"threshold_uncertainty_score":0.9993561},"labels":[],"label_agreement":null},{"id":"W2617461187","doi":"10.1007/s11228-017-0415-x","title":"Subgradient Projectors: Extensions, Theory, and Characterizations","year":2017,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subgradient method; Mathematics; Projector; Convex optimization; Convex analysis; Projection (relational algebra); Regular polygon; Mathematical optimization; Computer science; Algorithm; Geometry; Computer vision","score_opus":0.018262609816990207,"score_gpt":0.27462198711813957,"score_spread":0.2563593773011494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617461187","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022116538,0.00009755457,0.9713371,0.005402929,0.00011512296,0.00014342932,0.00006666565,0.00008084283,0.0006398495],"genre_scores_gemma":[0.9711706,0.00012771868,0.026886096,0.00050113077,0.0000947389,0.000020944692,0.00020015916,0.00000728601,0.0009913357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99847376,0.00018332558,0.0003035975,0.0005194387,0.0003374907,0.00018236444],"domain_scores_gemma":[0.9985065,0.00016463094,0.0003171831,0.0005842076,0.00027786277,0.00014962011],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00077430933,0.00016791715,0.00028471943,0.00043870686,0.0013820543,0.00084984186,0.00040643875,0.0000673435,0.00012842692],"category_scores_gemma":[0.00036923512,0.0001417712,0.00013604984,0.00061949994,0.000082642386,0.0008264251,0.00026636972,0.00008040104,0.000011689456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008216679,0.00005283204,0.023884092,0.0000042923302,0.00074312027,0.0000016901653,0.00051821285,0.0005865344,0.00008255192,0.972867,0.0000461125,0.0012053153],"study_design_scores_gemma":[0.00021467399,0.000013285833,0.4991601,0.0000046728696,0.00049527147,0.000002991693,0.00001956849,0.48312142,0.000008139312,0.016441463,0.00035840517,0.00016000497],"about_ca_topic_score_codex":0.000119828605,"about_ca_topic_score_gemma":0.000029361148,"teacher_disagreement_score":0.95642555,"about_ca_system_score_codex":0.000022384571,"about_ca_system_score_gemma":0.000063386404,"threshold_uncertainty_score":0.999918},"labels":[],"label_agreement":null},{"id":"W2625022480","doi":"10.1186/s13660-018-1666-2","title":"Analytic center cutting plane methods for variational inequalities over convex bodies","year":2018,"lang":"en","type":"article","venue":"Journal of Inequalities and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saskatchewan Polytechnic","funders":"","keywords":"Mathematics; Cutting-plane method; Bounded function; Center (category theory); Regular polygon; Variational inequality; Plane (geometry); Computation; Iterative method; Mathematical analysis; Applied mathematics; Geometry; Mathematical optimization; Algorithm","score_opus":0.04076082436382051,"score_gpt":0.3637464286722749,"score_spread":0.3229856043084544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625022480","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048721104,0.00016921964,0.9963475,0.0022052827,0.00010662308,0.0001100692,0.000043843946,0.000018062525,0.0005122173],"genre_scores_gemma":[0.17932454,0.0001586198,0.81588024,0.0020044842,0.0014059151,0.00006462711,0.000041569474,0.000013601324,0.0011063797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876475,0.000120895784,0.00062788685,0.00015292078,0.00019106876,0.00014249852],"domain_scores_gemma":[0.9976867,0.0008256682,0.0004888998,0.00016046311,0.00075624103,0.00008206979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010258446,0.00010630533,0.00025106443,0.00020698078,0.00026775702,0.00019283239,0.0002712467,0.000044095326,0.00007577285],"category_scores_gemma":[0.00017732327,0.00008734505,0.00010804604,0.0002057495,0.000068920344,0.0004254818,0.00006955384,0.00007157744,0.0000026193868],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013131549,0.00006815418,0.0012798028,0.000036340643,0.00016678026,1.5739354e-7,0.0016277386,0.00018410837,0.00011513411,0.9874618,0.0013121021,0.007734771],"study_design_scores_gemma":[0.0020975822,0.00039976704,0.0046525826,0.000084285246,0.00021935962,0.000085862535,0.0033590212,0.45700485,0.00078303117,0.26264796,0.26808602,0.0005796855],"about_ca_topic_score_codex":0.000019222765,"about_ca_topic_score_gemma":0.0000045618117,"teacher_disagreement_score":0.7248138,"about_ca_system_score_codex":0.000029372184,"about_ca_system_score_gemma":0.00008785215,"threshold_uncertainty_score":0.35618278},"labels":[],"label_agreement":null},{"id":"W27022379","doi":"10.1007/978-1-4419-9467-7_5","title":"Fejér Monotonicity and Fixed Point Iterations","year":2011,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Monotonic function; Monotone polygon; Sequence (biology); Fixed point; Convergence (economics); Mathematics; Point (geometry); Set (abstract data type); Discrete mathematics; Applied mathematics; Pure mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.030335640036014525,"score_gpt":0.23027412019499807,"score_spread":0.19993848015898355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W27022379","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000060664947,0.0000841498,0.4672955,0.0002516009,0.00006105584,0.00017578469,0.000007622937,0.000059112313,0.53205913],"genre_scores_gemma":[0.0017547039,0.00020367625,0.4097312,0.0004356737,0.000060097427,0.000027916893,0.000026893433,0.000041761523,0.58771807],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886245,0.000013651243,0.00046528975,0.00031732392,0.00021000775,0.00013125566],"domain_scores_gemma":[0.99896455,0.00009377466,0.0002487393,0.0005131708,0.00010913518,0.00007062493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002172113,0.0002221676,0.00033272087,0.0002523888,0.0000855304,0.00015707225,0.00038343252,0.0001721555,0.00025094338],"category_scores_gemma":[0.00003980666,0.00020885031,0.00009105829,0.000048796763,0.000048819093,0.00019708651,0.00022863304,0.00020370628,0.000084271145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.1572476e-7,0.000025533827,0.0000051232346,0.000034630168,0.000030336607,0.0000041593908,0.0011336621,0.000082694525,0.0000020921748,0.997928,0.00029933927,0.00045390014],"study_design_scores_gemma":[0.00015278114,0.000017889928,0.00002372493,0.00012317156,0.000037815098,0.000008138758,0.0000065412246,0.17991026,0.000013948913,0.8136091,0.00581806,0.00027855145],"about_ca_topic_score_codex":0.00000491056,"about_ca_topic_score_gemma":0.000018515011,"teacher_disagreement_score":0.1843189,"about_ca_system_score_codex":0.000051672425,"about_ca_system_score_gemma":0.00006367517,"threshold_uncertainty_score":0.85166687},"labels":[],"label_agreement":null},{"id":"W2737402057","doi":"10.5539/jmr.v9n4p168","title":"Minimum Principle-Type Necessary Optimality Conditions in Scalar and Vector Optimization. An Account","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Vector optimization; Scalar (mathematics); Mathematical optimization; Type (biology); Constraint (computer-aided design); Optimization problem; Set (abstract data type); Applied mathematics; Computer science; Multi-swarm optimization","score_opus":0.11352377926393192,"score_gpt":0.4367268470153174,"score_spread":0.32320306775138546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2737402057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32180297,0.00013914033,0.66608614,0.009296135,0.00025112162,0.00031545793,0.000010352201,0.000022287837,0.002076367],"genre_scores_gemma":[0.6904666,0.00013141512,0.3091416,0.00002989584,0.00006953406,0.0000027956557,0.000003176396,0.0000075663966,0.00014739235],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818003,0.00017514455,0.00048389268,0.00015882029,0.0008077523,0.0001943495],"domain_scores_gemma":[0.9973915,0.00030581735,0.00039193177,0.0005331806,0.0012177535,0.0001597858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031877784,0.00008123448,0.00022557238,0.00042675744,0.00044253928,0.0008151107,0.0010788713,0.00006398541,0.0000889057],"category_scores_gemma":[0.0011231108,0.00006705454,0.00004612136,0.00033100857,0.00011556918,0.0015887382,0.00030954706,0.00029653625,0.0000074230597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072274146,0.0034635686,0.017814608,0.00037974896,0.0002839947,0.00023913373,0.004903665,0.57450193,0.0012772861,0.39486963,0.0014928165,0.00070131803],"study_design_scores_gemma":[0.00041276723,0.00010584454,0.015516111,0.000068578156,0.0000088008355,0.000047710935,0.00014114648,0.97530675,0.00006945713,0.008161996,0.000078196616,0.000082648134],"about_ca_topic_score_codex":0.000015130881,"about_ca_topic_score_gemma":0.000007778764,"teacher_disagreement_score":0.4008048,"about_ca_system_score_codex":0.00006997701,"about_ca_system_score_gemma":0.00025472642,"threshold_uncertainty_score":0.78601307},"labels":[],"label_agreement":null},{"id":"W2743669250","doi":"10.33993/jnaat382-909","title":"An iterative method for approximating fixed points of Presić nonexpansive mappings","year":2009,"lang":"en","type":"article","venue":"Journal of Numerical Analysis and Approximation Theory","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Mathematics; Fixed point; Fixed-point theorem; Banach space; Integer (computer science); Convergence (economics); Discrete mathematics; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.010583797091525208,"score_gpt":0.2916500684332838,"score_spread":0.2810662713417586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2743669250","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024713387,0.000052470314,0.99585164,0.0013882025,0.000015110066,0.000106716754,0.0000054299426,0.000012180265,0.0000969065],"genre_scores_gemma":[0.38344097,0.000007246385,0.6161345,0.00033813674,0.000034995843,0.0000026957928,0.0000086408345,0.000002778447,0.000029996287],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980309,0.00039701696,0.000879628,0.00022292606,0.00034270366,0.0001268402],"domain_scores_gemma":[0.9971429,0.0004406927,0.0012962578,0.00018881897,0.0008144501,0.00011684042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018846389,0.00013381391,0.00058171526,0.0005360225,0.000119442,0.00013368276,0.00032877253,0.000054246553,0.000028589793],"category_scores_gemma":[0.0003060864,0.00009961151,0.00035917605,0.0013282588,0.000025581587,0.00086540094,0.00002416989,0.00009499268,3.7848554e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020275808,0.00090429623,0.0005292124,0.000057587906,0.0023071317,0.0000019025439,0.0075098216,0.07723247,0.008023647,0.78623855,0.00008887264,0.116903774],"study_design_scores_gemma":[0.00039271303,0.00027691358,0.0021791866,0.000014056115,0.00046573457,0.000006142358,0.0002923292,0.90938014,0.0015319301,0.08532347,0.000026495447,0.00011090286],"about_ca_topic_score_codex":0.0000024475037,"about_ca_topic_score_gemma":1.58956e-7,"teacher_disagreement_score":0.83214766,"about_ca_system_score_codex":0.000020793423,"about_ca_system_score_gemma":0.000036242032,"threshold_uncertainty_score":0.40620396},"labels":[],"label_agreement":null},{"id":"W2750261735","doi":"10.1007/s00205-018-01348-3","title":"Free Discontinuities in Optimal Transport","year":2019,"lang":"en","type":"article","venue":"Archive for Rational Mechanics and Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Classification of discontinuities; Measure (data warehouse); Gravitational singularity; Bilinear interpolation; Parameterized complexity; Domain (mathematical analysis); Affine transformation; Regular polygon; Function (biology); Convex function","score_opus":0.006879463375502824,"score_gpt":0.213022735789556,"score_spread":0.20614327241405317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2750261735","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008230497,0.000021529448,0.9897513,0.0014221508,0.000032559663,0.00011930778,0.00015274652,0.000014700622,0.00025524426],"genre_scores_gemma":[0.8592625,0.000019388539,0.139492,0.00020953239,0.000019457519,0.000030905976,0.00033821294,0.0000042838624,0.00062370324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991777,0.000022727636,0.00022026668,0.00028365204,0.0001762103,0.00011946741],"domain_scores_gemma":[0.9995256,0.00010677601,0.00006656802,0.00019502021,0.00006264349,0.00004340474],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019925903,0.000085358435,0.00019703359,0.000377048,0.000066199544,0.00006116481,0.00025715044,0.000022808968,0.00006728905],"category_scores_gemma":[0.000019271249,0.00007737982,0.00017083282,0.00059554924,0.000005681394,0.00028183963,0.0000538191,0.0000413774,0.000002764161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006735965,0.000026549234,0.003216404,0.0000041645385,0.0001975094,3.6475942e-7,0.00028718883,0.054861896,0.00007675664,0.9410918,0.000017869885,0.0002127776],"study_design_scores_gemma":[0.00031434803,0.000028349197,0.0060211434,0.0000027198553,0.00009180092,3.3817963e-7,0.00005080662,0.8731798,0.000017914854,0.119987294,0.00021071405,0.00009477859],"about_ca_topic_score_codex":0.000032014803,"about_ca_topic_score_gemma":0.00032087517,"teacher_disagreement_score":0.851032,"about_ca_system_score_codex":0.000010766316,"about_ca_system_score_gemma":0.000037111524,"threshold_uncertainty_score":0.31554574},"labels":[],"label_agreement":null},{"id":"W275043376","doi":"","title":"Smoothing SQP methods for solving nonsmooth and nonconvex constrained optimization problems","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Sequential quadratic programming; Mathematics; Smoothing; Mathematical optimization; Sequence (biology); Penalty method; Convergence (economics); Limit point; Quadratic programming","score_opus":0.046416611311379675,"score_gpt":0.21489704128906642,"score_spread":0.16848042997768675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W275043376","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046655093,0.000008509761,0.99752414,0.0003694817,0.000079268924,0.00015231903,0.0000014237746,0.00010755318,0.0012907452],"genre_scores_gemma":[0.50901127,0.000014701179,0.49033728,0.00020652368,0.000020507998,8.76823e-7,0.0000052892838,0.0000058711325,0.00039766327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999129,0.000102785394,0.00013995329,0.00042030195,0.00003935509,0.00016859305],"domain_scores_gemma":[0.9990192,0.00035010857,0.00012991545,0.00022731231,0.00017684123,0.00009661352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005794931,0.00011142678,0.00015343644,0.00016823741,0.00025634203,0.00012728777,0.0002940594,0.00006405291,0.000026932208],"category_scores_gemma":[0.00013517958,0.00011974595,0.00006730209,0.0005222068,0.00005182148,0.0006173557,0.0001080334,0.000059875296,0.0000032392522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028210886,0.000013883443,0.0002901021,0.000009778227,0.000021013726,3.8782488e-7,0.0001024509,0.61282974,0.0000587101,0.38478068,0.000011965589,0.0018784883],"study_design_scores_gemma":[0.00055115,0.00003587057,0.00008294101,0.000010338903,0.000036222507,0.0000015841505,0.000026944923,0.9859271,0.0000629159,0.012571394,0.00054113386,0.00015237085],"about_ca_topic_score_codex":0.00001975844,"about_ca_topic_score_gemma":0.0000055910123,"teacher_disagreement_score":0.50854474,"about_ca_system_score_codex":0.000034262568,"about_ca_system_score_gemma":0.000044789736,"threshold_uncertainty_score":0.4883098},"labels":[],"label_agreement":null},{"id":"W2752265761","doi":"","title":"Disjunctive Cuts for Continuous Linear Bilevel Programming","year":2006,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Bilevel optimization; Linear programming; Duality (order theory); Mathematics; Relaxation (psychology); Mathematical optimization; Domain (mathematical analysis); Linear programming relaxation; Computer science; Optimization problem; Discrete mathematics","score_opus":0.009667093480283412,"score_gpt":0.2307124682172781,"score_spread":0.22104537473699468,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2752265761","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013377012,0.00016614562,0.99156916,0.00486531,0.00010697671,0.00073925743,0.0000309019,0.0007553396,0.0004291928],"genre_scores_gemma":[0.22591943,0.000011130498,0.76919997,0.001069541,0.00020287116,0.00064535125,0.000074159674,0.000028864346,0.0028486762],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815583,0.00006456398,0.00043041675,0.00050537585,0.00031791185,0.0005258708],"domain_scores_gemma":[0.99855006,0.0001545648,0.00023735492,0.00055522687,0.00035482107,0.00014799865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004409435,0.00024416047,0.00029735698,0.00035157244,0.00031078546,0.00031890732,0.00065526535,0.00015283216,0.000012452425],"category_scores_gemma":[0.0001401799,0.00022986069,0.00023280442,0.00086127897,0.000041686715,0.0005442614,0.00016699114,0.00014433045,0.00001419167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006556513,0.00069944223,0.016128425,0.000030828665,0.00012328844,0.000017693064,0.00020609147,0.068066776,0.0012733915,0.84128976,0.0067287544,0.06536998],"study_design_scores_gemma":[0.0005081807,0.00011796812,0.0086565185,0.000013319209,0.000033528508,0.000016022641,0.000017716962,0.96271265,0.0014852105,0.010330517,0.015771445,0.00033693435],"about_ca_topic_score_codex":0.003118443,"about_ca_topic_score_gemma":0.00076783815,"teacher_disagreement_score":0.89464587,"about_ca_system_score_codex":0.0001971817,"about_ca_system_score_gemma":0.00016999613,"threshold_uncertainty_score":0.9373447},"labels":[],"label_agreement":null},{"id":"W2753323787","doi":"10.1007/s11590-017-1185-y","title":"Error bounds for strongly monotone and Lipschitz continuous variational inequalities","year":2017,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Lipschitz continuity; Variational inequality; Monotone polygon; Computational intelligence; Mathematics; Applied mathematics; Strongly monotone; Inequality; Pure mathematics; Mathematical optimization; Mathematical analysis; Computer science; Geometry; Artificial intelligence","score_opus":0.02108588286250277,"score_gpt":0.26382439312384726,"score_spread":0.2427385102613445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2753323787","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00093877676,0.000012976444,0.9750841,0.022973489,0.0002329028,0.00019771792,0.000030112767,0.000075269,0.0004545995],"genre_scores_gemma":[0.20279908,0.000018653003,0.79256433,0.0029752809,0.00021602471,0.000086876425,0.00018462692,0.000018462717,0.0011366686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989445,0.000055484914,0.0002666302,0.00033201373,0.00021996866,0.00018136465],"domain_scores_gemma":[0.99887305,0.00013401377,0.00031600744,0.00041433139,0.00018630053,0.00007628991],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00034097742,0.00013576659,0.00017565952,0.00012600196,0.00082212145,0.0010775777,0.0004533251,0.000058605903,0.00005462862],"category_scores_gemma":[0.0002416733,0.00013780946,0.000057951744,0.00008424801,0.000067495035,0.0012027437,0.00011719833,0.000057732243,0.0000045981874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011953975,0.000031510895,0.0013151116,0.000008859265,0.00006215255,6.384339e-7,0.00029854916,0.7897018,0.00007031491,0.20655625,0.0014017134,0.0005411467],"study_design_scores_gemma":[0.0006992703,0.000022383565,0.0031205912,0.0000056094,0.000022645416,0.0000021138803,0.00001951642,0.9935927,0.000017302968,0.00049891236,0.0018226827,0.00017630418],"about_ca_topic_score_codex":0.000043433036,"about_ca_topic_score_gemma":0.000005398631,"teacher_disagreement_score":0.20605734,"about_ca_system_score_codex":0.000029938146,"about_ca_system_score_gemma":0.000047339392,"threshold_uncertainty_score":0.9999594},"labels":[],"label_agreement":null},{"id":"W2767633365","doi":"10.5539/jmr.v9n6p124","title":"Optimal Control of Evolution Macro-Hybrid Mixed Variational Inclusions","year":2017,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Duality (order theory); Banach space; Optimal control; Applied mathematics; Dual (grammatical number); Nonlinear system; Mathematical analysis; Mathematical optimization; Pure mathematics","score_opus":0.060346169303242304,"score_gpt":0.37362322364931616,"score_spread":0.31327705434607384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767633365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009161814,0.000037888447,0.9854428,0.0045688623,0.0001421667,0.00008197383,0.000009691814,0.0000050261015,0.0005497402],"genre_scores_gemma":[0.7227681,0.000016552412,0.2769466,0.00001123691,0.00008955355,0.0000016742796,7.9590137e-7,0.0000043408113,0.00016110195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973855,0.0001674226,0.0006203575,0.00010994166,0.00153115,0.00018562736],"domain_scores_gemma":[0.995415,0.0006999736,0.00089587836,0.0004845916,0.0023857125,0.000118859185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004214634,0.00007387613,0.00026297622,0.00045836292,0.0005233418,0.0002615463,0.0014992581,0.000044771376,0.00010926044],"category_scores_gemma":[0.0025327532,0.00005859787,0.00015542113,0.00021606033,0.00008395244,0.00060925836,0.00039567717,0.00027421932,0.00002051317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034915178,0.0009554492,0.0009029052,0.000078734935,0.0003232483,0.0000267756,0.0006965071,0.06757091,0.0038888599,0.92213464,0.002871718,0.00051534595],"study_design_scores_gemma":[0.00076329074,0.00009887375,0.006153259,0.00005821777,0.000022814615,0.000053926724,0.000040319395,0.9603407,0.000502969,0.031698495,0.00020371206,0.00006346951],"about_ca_topic_score_codex":0.00001566838,"about_ca_topic_score_gemma":0.000002076759,"teacher_disagreement_score":0.89276975,"about_ca_system_score_codex":0.000106747175,"about_ca_system_score_gemma":0.00044786197,"threshold_uncertainty_score":0.4025175},"labels":[],"label_agreement":null},{"id":"W2782300932","doi":"10.1007/s00039-018-0467-6","title":"Sharp Finiteness Principles For Lipschitz Selections","year":2018,"lang":"en","type":"preprint","venue":"Geometric and Functional Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Air Force Office of Scientific Research; Banff International Research Station for Mathematical Innovation and Discovery; United States-Israel Binational Science Foundation; American Institute of Mathematics; National Science Foundation","keywords":"Lipschitz continuity; Mathematics; Integer (computer science); Banach space; Dimension (graph theory); Regular polygon; Space (punctuation); Metric space; Constant (computer programming); Metric (unit); Set (abstract data type); Combinatorics; Selection (genetic algorithm); Pure mathematics; Discrete mathematics; Geometry; Computer science","score_opus":0.049185317069635616,"score_gpt":0.25468670500952456,"score_spread":0.20550138793988895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782300932","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092612987,0.00085836253,0.9942283,0.0018084582,0.0006894871,0.00018830475,0.00021309945,0.0001890448,0.00089882716],"genre_scores_gemma":[0.65402883,0.0010507801,0.2994678,0.0013070686,0.0027935882,0.000786154,0.0042626746,0.00006463096,0.03623847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975469,0.000051052117,0.0005362018,0.0010857652,0.0005073096,0.00027274317],"domain_scores_gemma":[0.9976667,0.00041038325,0.0002862768,0.00050818146,0.0009655309,0.00016290769],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006044438,0.00030565006,0.0005265243,0.0049455194,0.00046433948,0.0007018583,0.00042796155,0.00025657687,0.00035011917],"category_scores_gemma":[0.0002915163,0.0002699014,0.00075151067,0.010938295,0.000055788532,0.00021642278,0.0007518854,0.00025104854,0.00007363285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042803546,0.0003597615,0.015545521,0.00026422218,0.019096289,0.0000025753382,0.00016460121,0.7634347,0.0000046835526,0.178621,0.014073566,0.008390274],"study_design_scores_gemma":[0.00015286262,0.000040430215,0.032382336,0.000010306184,0.0028988563,0.000003218609,0.0000076218325,0.9350361,0.000006316348,0.013476923,0.015632741,0.0003522946],"about_ca_topic_score_codex":0.00008000992,"about_ca_topic_score_gemma":0.00003911962,"teacher_disagreement_score":0.6947605,"about_ca_system_score_codex":0.00008462464,"about_ca_system_score_gemma":0.00022075251,"threshold_uncertainty_score":0.9999753},"labels":[],"label_agreement":null},{"id":"W2782956634","doi":"10.23952/jnva.2.2018.2.08","title":"Effective strong convergence of the proximal point algorithm in CAT(0) spaces","year":2018,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Algorithm; Point (geometry); Computer science; Mathematics; Geometry; Economics","score_opus":0.006675803127993107,"score_gpt":0.24825042276946033,"score_spread":0.24157461964146723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2782956634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04583259,0.00004812426,0.95130634,0.0024846273,0.00013460401,0.00007598742,0.000015025202,0.0000036105043,0.00009905779],"genre_scores_gemma":[0.8183594,0.000020124846,0.18126911,0.000108084656,0.00017846587,0.0000014452675,0.000003080843,0.000002526965,0.000057802183],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986638,0.00015269403,0.0004871891,0.00014882164,0.0004494325,0.00009806653],"domain_scores_gemma":[0.9982796,0.00017254462,0.0005645932,0.00014641474,0.00078295654,0.000053927222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073264656,0.00008797657,0.00028318958,0.0004372375,0.00008640347,0.000055597277,0.00034568988,0.000040646322,0.00007334673],"category_scores_gemma":[0.0001483433,0.000057131612,0.0002271174,0.0019719065,0.00006642939,0.0003830292,0.000097394295,0.00009191655,0.0000016025841],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019108877,0.0016150724,0.6246665,0.00005041999,0.008838043,0.000016874672,0.006749113,0.15851298,0.0016607547,0.17342366,0.00023238231,0.024043115],"study_design_scores_gemma":[0.00027302332,0.00006643385,0.22955878,0.000008666458,0.00022999063,0.00000621646,0.00003616685,0.7684763,0.00021391078,0.0010297956,0.000047467678,0.000053239608],"about_ca_topic_score_codex":0.00009744553,"about_ca_topic_score_gemma":0.00006672137,"teacher_disagreement_score":0.77252674,"about_ca_system_score_codex":0.00004489319,"about_ca_system_score_gemma":0.00015965084,"threshold_uncertainty_score":0.23297596},"labels":[],"label_agreement":null},{"id":"W2789886496","doi":"10.22436/jnsa.009.12.28","title":"A three step iterative algorithm for common solutions of quasi-variational inclusions and fixed point problems of pseudocontractions","year":2016,"lang":"en","type":"article","venue":"The Journal of Nonlinear Sciences and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"York University","keywords":"Mathematics; Fixed point; Applied mathematics; Iterative method; Algorithm; Point (geometry); Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.025786067035733395,"score_gpt":0.2856625224521075,"score_spread":0.2598764554163741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2789886496","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008622929,0.00017096841,0.98833525,0.01024201,0.000023719444,0.0002349918,0.00008494379,0.0000043379177,0.00004150221],"genre_scores_gemma":[0.23176803,0.00040662146,0.7675302,0.00010500147,0.00011021314,0.00003472369,0.0000030252727,0.0000037682726,0.000038402966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909425,0.000048238126,0.0004290543,0.00010512076,0.00023093673,0.0000923972],"domain_scores_gemma":[0.9979359,0.00079491356,0.0005545906,0.00012990627,0.00053051236,0.000054197862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010068786,0.000063173975,0.00015912461,0.00013820422,0.0005261063,0.000036623464,0.0003430661,0.000024577135,0.000007639289],"category_scores_gemma":[0.000053312546,0.00003385627,0.000059683738,0.00047402768,0.00026672182,0.00039102955,0.000114133225,0.000048943413,3.225383e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018089895,0.00084490003,0.0007785268,0.000025411415,0.00019381782,1.1487167e-7,0.0014646907,0.0044622133,0.006295585,0.78133434,0.00028924653,0.20429307],"study_design_scores_gemma":[0.0005247595,0.00026687403,0.0031285128,0.00004738577,0.000072739575,0.00003395301,0.00015259907,0.9508886,0.00017878684,0.043629657,0.0010012503,0.00007488242],"about_ca_topic_score_codex":0.00004134455,"about_ca_topic_score_gemma":0.00007730103,"teacher_disagreement_score":0.9464264,"about_ca_system_score_codex":0.000012067984,"about_ca_system_score_gemma":0.00014976785,"threshold_uncertainty_score":0.4046437},"labels":[],"label_agreement":null},{"id":"W2791345573","doi":"10.1051/proc/201965027","title":"A policy iteration algorithm for nonzero-sum stochastic impulse games","year":2019,"lang":"en","type":"article","venue":"ESAIM Proceedings and Surveys","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Convergence (economics); Impulse (physics); Range (aeronautics); Nash equilibrium; Heuristic; Iterative method; Numerical analysis","score_opus":0.008423342142523993,"score_gpt":0.24212942055546613,"score_spread":0.23370607841294214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791345573","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007330894,0.000021778085,0.9904513,0.0012569836,0.00010925754,0.00022937375,0.000011289113,0.00006531024,0.000523857],"genre_scores_gemma":[0.8828573,0.000015803553,0.11269019,0.00059835654,0.00022688432,0.000047303747,0.000034907986,0.000014343676,0.0035149134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991153,0.000019180829,0.00018271345,0.0003255264,0.000171971,0.00018534923],"domain_scores_gemma":[0.9993293,0.000078356024,0.000092509545,0.00008072886,0.0003377362,0.00008136184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007834553,0.0001148419,0.00015771255,0.00019473326,0.000121845565,0.00039913823,0.00018449202,0.00005089848,0.000018319826],"category_scores_gemma":[0.00008875629,0.0001010304,0.00005519562,0.00046063596,0.000012827052,0.00062801345,0.0000718947,0.000049140188,0.000019522777],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014212511,0.00020115178,0.008373948,0.00010863021,0.00016290027,6.5880903e-7,0.00324713,0.0018457475,0.0010248116,0.5323664,0.0015030005,0.4511514],"study_design_scores_gemma":[0.00043297838,0.000085672174,0.008797565,0.000009767974,0.0000073476335,0.0000044369544,0.000029869789,0.98632884,0.00004781951,0.0037582004,0.0003450209,0.00015246823],"about_ca_topic_score_codex":0.000038313305,"about_ca_topic_score_gemma":0.0000026427833,"teacher_disagreement_score":0.9844831,"about_ca_system_score_codex":0.000023228637,"about_ca_system_score_gemma":0.000053502477,"threshold_uncertainty_score":0.41199002},"labels":[],"label_agreement":null},{"id":"W2791483774","doi":"10.5539/jmr.v10n2p66","title":"Convergence Theorems of Modified Proximal Algorithms for Asymptotical Quasi-nonexpansive Mappings in CAT(0) Spaces","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Mathematics; Iterated function; Convergence (economics); Fixed point; Sequence (biology); Regular polygon; Iterated function system; Convex function; Function (biology); Applied mathematics; Pure mathematics; Discrete mathematics; Mathematical analysis; Geometry; Attractor","score_opus":0.11551712241086473,"score_gpt":0.4016638612185469,"score_spread":0.28614673880768215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791483774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03856741,0.000023177083,0.95836353,0.002334914,0.000091881055,0.00020849779,0.000002827024,0.000004914388,0.00040286506],"genre_scores_gemma":[0.61517704,0.000027786396,0.38449535,0.000022090877,0.00010112349,0.0000069320768,4.457436e-7,0.0000064023234,0.00016283843],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977387,0.00015297311,0.0006668976,0.00014929478,0.0010326992,0.0002594421],"domain_scores_gemma":[0.9956515,0.00094166887,0.00035293263,0.00022916197,0.0027217658,0.00010299811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041367775,0.00008437029,0.0003064832,0.0005762626,0.00008385723,0.00010138274,0.0008199856,0.000068051384,0.000039789913],"category_scores_gemma":[0.0012845178,0.00006339219,0.00011092501,0.00080163305,0.00020514317,0.0003129358,0.00013853404,0.00018041626,0.000009073839],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000708902,0.0011584028,0.00027384484,0.00021892285,0.00013624465,0.000009888419,0.01070614,0.0015664846,0.003995278,0.98034984,0.0005345624,0.0009794956],"study_design_scores_gemma":[0.00050438807,0.0004762245,0.00021413859,0.00009610381,0.000007938724,0.000017954395,0.00075343205,0.9029089,0.0034010427,0.091505215,0.000045137593,0.000069483096],"about_ca_topic_score_codex":0.000015537607,"about_ca_topic_score_gemma":0.000005926213,"teacher_disagreement_score":0.90134245,"about_ca_system_score_codex":0.000067235,"about_ca_system_score_gemma":0.00033974616,"threshold_uncertainty_score":0.25850585},"labels":[],"label_agreement":null},{"id":"W2794838505","doi":"10.5539/jmr.v10n3p42","title":"A Classroom Note on Twice Continuously Differentiable Strictly Convex and Strongly Quasiconvex Functions","year":2018,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quasiconvex function; Mathematics; Differentiable function; Convex function; Regular polygon; Pseudoconvex function; Pure mathematics; Subderivative; Convex analysis; Proper convex function; Combinatorics; Convex optimization; Geometry","score_opus":0.061530130704331866,"score_gpt":0.3568426556130193,"score_spread":0.2953125249086874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2794838505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052089732,0.00004497053,0.9403144,0.0029525117,0.00016454954,0.000117152806,0.0000037405966,0.000018427521,0.004294516],"genre_scores_gemma":[0.9147953,0.000054551354,0.08143506,0.00012552502,0.0002991852,0.0000036006272,0.0000011799722,0.0000129969085,0.0032726345],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99777514,0.00018023475,0.00048188187,0.00017212384,0.0011262629,0.00026437646],"domain_scores_gemma":[0.99676657,0.0008117241,0.00029523196,0.00030386887,0.0016390207,0.00018359987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017174375,0.000103422346,0.00026734453,0.0005747267,0.00028174516,0.00040427851,0.0005462579,0.00006602011,0.00018730892],"category_scores_gemma":[0.00053029065,0.00007759229,0.00008577018,0.0006904975,0.000121894496,0.0003547075,0.00016143959,0.00040079147,0.00011279038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022590926,0.004163714,0.0026512302,0.00028602008,0.0010282398,0.00006859816,0.00996855,0.0012719128,0.006903839,0.8977052,0.064173885,0.011552911],"study_design_scores_gemma":[0.0017512281,0.0023781531,0.0030207748,0.00017541483,0.000069177186,0.00009849654,0.0011339674,0.956264,0.0008172293,0.025544852,0.008487412,0.00025929135],"about_ca_topic_score_codex":0.000010335762,"about_ca_topic_score_gemma":0.000008013557,"teacher_disagreement_score":0.9549921,"about_ca_system_score_codex":0.00006800368,"about_ca_system_score_gemma":0.00018696238,"threshold_uncertainty_score":0.3898467},"labels":[],"label_agreement":null},{"id":"W2798508703","doi":"10.1007/s10898-019-00744-7","title":"The Douglas–Rachford algorithm for a hyperplane and a doubleton","year":2019,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Hyperplane; Regular polygon; Characterization (materials science); Simple (philosophy); Set (abstract data type); Focus (optics); Convex set","score_opus":0.004747195214022939,"score_gpt":0.22935964236106712,"score_spread":0.22461244714704418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2798508703","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038083998,0.00021728888,0.99531054,0.002948105,0.000508202,0.00012696045,0.0000048251636,0.000011131886,0.0004921282],"genre_scores_gemma":[0.015905155,0.00033433625,0.9827884,0.00041724465,0.00017048893,0.0000031238167,0.0000066757516,0.0000050406975,0.0003695683],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918926,0.00003379675,0.00031392105,0.00010748496,0.00024317049,0.00011234815],"domain_scores_gemma":[0.99890316,0.0001083917,0.00035236543,0.00012430406,0.00045019423,0.00006156156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038803968,0.000074872165,0.0001361873,0.000039420887,0.0001353513,0.0002722264,0.00028739165,0.00004148394,0.000009783865],"category_scores_gemma":[0.000049976996,0.000049072096,0.0000790601,0.00033228938,0.00001407642,0.0005402968,0.000046588004,0.0000498259,0.0000032527155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005183656,0.000054595857,0.0012519764,0.0000060929465,0.000108297056,0.0000013882352,0.00005977291,0.8785232,0.0000057145453,0.060253885,0.0013184943,0.058364782],"study_design_scores_gemma":[0.00078319135,0.00013202301,0.00042297613,0.00000811257,0.00002473686,0.00006410588,0.00001941345,0.98959446,0.0000041168537,0.0010198485,0.007864469,0.00006253671],"about_ca_topic_score_codex":0.000004607781,"about_ca_topic_score_gemma":0.0000018636715,"teacher_disagreement_score":0.1110713,"about_ca_system_score_codex":0.000060900384,"about_ca_system_score_gemma":0.00008318665,"threshold_uncertainty_score":0.26250857},"labels":[],"label_agreement":null},{"id":"W2804739477","doi":"10.23952/jnva.2.2018.2.02","title":"Intriguing maximally monotone operators derived from nonsunny nonexpansive retractions","year":2018,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Pure mathematics; Geometry","score_opus":0.011212089743483637,"score_gpt":0.2559941382388168,"score_spread":0.24478204849533314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2804739477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07009833,0.000068462534,0.92605364,0.003265479,0.00019106377,0.00003932183,0.00003710296,0.00001726552,0.00022932386],"genre_scores_gemma":[0.6399966,0.000116339615,0.35852486,0.00056285673,0.0006810571,0.0000013492656,0.000040390343,0.0000062043473,0.000070325834],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821544,0.00011847357,0.0007066856,0.0002714441,0.0005383302,0.00014960156],"domain_scores_gemma":[0.99695295,0.00026745035,0.00059252547,0.0002173838,0.0017910639,0.00017863775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004788286,0.00015119063,0.00039985488,0.0008871782,0.00030660498,0.00027385296,0.00038098762,0.00009140598,0.00041530264],"category_scores_gemma":[0.00026476214,0.00012663739,0.00030110488,0.0022403235,0.00005436832,0.0009023393,0.000094408264,0.00019456793,0.000024244662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010207127,0.00453571,0.26406065,0.000040708404,0.08314531,0.0002706533,0.017833829,0.33527583,0.035963777,0.22032198,0.0029290367,0.034601808],"study_design_scores_gemma":[0.00052266597,0.000099791665,0.1109065,0.000008918984,0.0011396243,0.00001775849,0.000072399045,0.8842143,0.00040761897,0.0015800253,0.000848452,0.00018194718],"about_ca_topic_score_codex":0.00016272312,"about_ca_topic_score_gemma":0.00007435636,"teacher_disagreement_score":0.56989825,"about_ca_system_score_codex":0.00006063557,"about_ca_system_score_gemma":0.00021803576,"threshold_uncertainty_score":0.51641226},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"},{"model":"gpt","categories":[],"domain":null,"study_design":"theoretical_or_conceptual","genre":"other","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W2806450235","doi":"10.1007/s10898-019-00750-9","title":"On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems","year":2019,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Thales (Canada)","funders":"","keywords":"Minimum-cost flow problem; Flow network; Extension (predicate logic); Pareto principle; Flow (mathematics); Pareto optimal; Function (biology); Nash equilibrium","score_opus":0.008113083000218386,"score_gpt":0.23630392138608317,"score_spread":0.2281908383858648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806450235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028469717,0.000018493618,0.96984327,0.0006395391,0.00022689407,0.0006503021,0.000012160994,0.000024641893,0.00011495515],"genre_scores_gemma":[0.76374763,0.0000056309254,0.23595403,0.00018905711,0.00002336938,0.000018140772,0.000026631014,0.0000087972185,0.000026715887],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980901,0.0000870465,0.00067483063,0.00030399903,0.0006442906,0.00019973677],"domain_scores_gemma":[0.9984277,0.00004773348,0.00056469324,0.00021500542,0.0006091765,0.0001356768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045903167,0.00016928717,0.00028310248,0.00025202538,0.00005639229,0.00017313396,0.00034189277,0.00007942542,0.0000149172165],"category_scores_gemma":[0.000033345128,0.00013994152,0.00006940699,0.0013760858,0.000008374767,0.00047208898,0.000014339414,0.000112082475,0.00003703768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102251455,0.00021113282,0.0055811782,0.000015273325,0.00002848169,0.0000039675065,0.00026092224,0.9901222,0.000037955542,0.0033505387,0.000038988863,0.00024711585],"study_design_scores_gemma":[0.0013860431,0.0002505406,0.0073721292,0.00014246601,0.00002154399,0.00001441921,0.000059471167,0.9905083,0.000011634308,0.000012109207,0.000058023346,0.00016332824],"about_ca_topic_score_codex":0.000027095284,"about_ca_topic_score_gemma":0.000027235381,"teacher_disagreement_score":0.7352779,"about_ca_system_score_codex":0.00039416927,"about_ca_system_score_gemma":0.00012344816,"threshold_uncertainty_score":0.57066494},"labels":[],"label_agreement":null},{"id":"W2807597574","doi":"10.48550/arxiv.1805.11165","title":"On the asymptotic behaviour of the Aragon Artacho-Campoy algorithm","year":2018,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Hilbert space; Mathematics; Intersection (aeronautics); Resolvent; Interpretation (philosophy); Monotone polygon; Projection (relational algebra); Generalization; Regular polygon; Operator (biology); Algorithm; Pure mathematics; Discrete mathematics; Applied mathematics; Computer science; Mathematical analysis","score_opus":0.045110220921181325,"score_gpt":0.17726481072772618,"score_spread":0.13215458980654485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2807597574","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061013553,0.000005716808,0.93475395,0.00086481654,0.00054497336,0.000217411,0.000022127791,0.000056032084,0.0025214087],"genre_scores_gemma":[0.99554217,0.000016462134,0.0016302554,0.00031377687,0.00005220678,7.4464054e-7,0.000007632868,0.000007676686,0.0024290995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987325,0.00022128294,0.00017798279,0.00054066384,0.00016945024,0.00015813779],"domain_scores_gemma":[0.99788797,0.00016969653,0.00034566454,0.0012828597,0.00025699864,0.000056815537],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027046184,0.00018366192,0.00018949529,0.00013650204,0.00022650986,0.000079995174,0.0021073949,0.00013906846,0.00013326413],"category_scores_gemma":[0.000053411484,0.00012390755,0.00029360593,0.0007466643,0.00012336098,0.000116761184,0.0011420264,0.00032197929,0.00007986636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005174567,0.00013696392,0.002604908,0.000007538766,0.00012789808,0.0000067667174,0.0001556359,0.30039936,0.0000030007625,0.69557655,0.00079804903,0.00017815681],"study_design_scores_gemma":[0.0001441467,0.000026694592,0.008596624,0.000039985607,0.00010547498,8.7612625e-7,0.00002047891,0.93132687,0.00010057994,0.059403446,0.0000693761,0.00016546415],"about_ca_topic_score_codex":0.00008419568,"about_ca_topic_score_gemma":0.0000140242355,"teacher_disagreement_score":0.9345286,"about_ca_system_score_codex":0.00008807146,"about_ca_system_score_gemma":0.00014635867,"threshold_uncertainty_score":0.5052803},"labels":[],"label_agreement":null},{"id":"W2884567774","doi":"10.3233/jifs-169765","title":"Intelligent optimization algorithm for global convergence of non-convex functions based on improved fuzzy algorithm","year":2018,"lang":"en","type":"article","venue":"Journal of Intelligent & Fuzzy Systems","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Convergence (economics); Algorithm; Computer science; Regular polygon; Fuzzy logic; Convex optimization; Optimization algorithm; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.016581804715073797,"score_gpt":0.2694172946451927,"score_spread":0.2528354899301189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2884567774","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004996871,0.00014656999,0.9936904,0.00037127477,0.0043462585,0.0004954653,0.00006554361,0.000033431454,0.0008011316],"genre_scores_gemma":[0.18524711,0.00013986237,0.81174827,0.0004903094,0.0014607707,0.000047757065,0.000048015998,0.000034612458,0.0007833088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967302,0.00015336796,0.0016074316,0.00039220252,0.00079196127,0.0003248035],"domain_scores_gemma":[0.9938875,0.00023058057,0.0015451292,0.00048029367,0.00359962,0.00025688647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011546551,0.00028865086,0.00060588884,0.0004616997,0.00019723277,0.00019754328,0.0008850938,0.00015362889,0.00007309794],"category_scores_gemma":[0.00016224952,0.00024148964,0.00047370844,0.001190353,0.00009201864,0.00047421822,0.00007436041,0.00015740308,0.00003616671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012495035,0.00078453135,0.00031635785,0.00008968546,0.0005561834,0.0000060470816,0.00033562275,0.8949423,0.00014135495,0.0056851385,0.00306153,0.09395634],"study_design_scores_gemma":[0.0005188476,0.0013005775,0.00006372317,0.00014322587,0.000098146666,0.000029222692,0.00021241496,0.99371034,0.001589471,0.00023354877,0.0018726436,0.00022782986],"about_ca_topic_score_codex":0.00006781498,"about_ca_topic_score_gemma":0.0000043930854,"teacher_disagreement_score":0.18519713,"about_ca_system_score_codex":0.0003306562,"about_ca_system_score_gemma":0.00043236258,"threshold_uncertainty_score":0.9847662},"labels":[],"label_agreement":null},{"id":"W2891945093","doi":"10.1016/j.jat.2019.02.001","title":"On sums and convex combinations of projectors onto convex sets","year":2019,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Mathematics; Convex analysis; Regular polygon; Subderivative; Projector; Proper convex function; Minkowski addition; Convex set; Linear subspace; Convex combination; Minkowski space; Conic optimization; Convex body; Convex cone; Convex polytope; Combinatorics; Absolutely convex set; Mixed volume; Pure mathematics; Convex optimization; Geometry; Computer science; Artificial intelligence","score_opus":0.006233310039672455,"score_gpt":0.22725215694223075,"score_spread":0.2210188469025583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2891945093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20804627,0.000073719864,0.784541,0.0014966228,0.00031161154,0.00023783356,0.000004194032,0.00001945628,0.0052693007],"genre_scores_gemma":[0.9847692,0.000017847326,0.0145822,0.00023768518,0.000011953224,0.000001484329,0.0000033607034,0.000004018345,0.00037222813],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998939,0.00015540932,0.00039726516,0.00010197694,0.00033751616,0.0000688322],"domain_scores_gemma":[0.9983479,0.00032238042,0.00059153594,0.0001526551,0.0005358447,0.000049682727],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009119423,0.000074176576,0.00020703702,0.00029185592,0.000042744367,0.00005369441,0.00022529016,0.000041300045,0.00011397729],"category_scores_gemma":[0.00016679992,0.00005843076,0.00006618027,0.00034519212,0.00003223858,0.0005116248,0.00003316889,0.00009338689,0.000016555648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025331237,0.00018019356,0.0006168832,0.000020582025,0.000058776794,3.8183632e-7,0.00090621586,0.0015773249,0.00023260726,0.9948386,0.0002070223,0.0013360634],"study_design_scores_gemma":[0.0038756628,0.0007575644,0.014415608,0.00014035687,0.00008136267,0.000043764645,0.0006431565,0.5561963,0.0036976438,0.41935402,0.0005033428,0.0002912435],"about_ca_topic_score_codex":0.0000015586473,"about_ca_topic_score_gemma":3.341611e-7,"teacher_disagreement_score":0.77672297,"about_ca_system_score_codex":0.000030552394,"about_ca_system_score_gemma":0.00007781743,"threshold_uncertainty_score":0.23827372},"labels":[],"label_agreement":null},{"id":"W2897250567","doi":"10.4153/s0008439520000314","title":"Kirszbraun’s Theorem via an Explicit Formula","year":2020,"lang":"en","type":"preprint","venue":"Canadian Mathematical Bulletin","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche","keywords":"Nabla symbol; Extension (predicate logic); Lipschitz continuity; Combinatorics; Mathematics; Regular polygon; Function (biology); Convex function; Physics; Pure mathematics; Geometry; Quantum mechanics; Omega; Computer science","score_opus":0.024149738732316166,"score_gpt":0.23862499752084698,"score_spread":0.21447525878853083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897250567","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00018462923,0.000023994666,0.9219439,0.05490406,0.00013382228,0.00029950042,0.00003611267,0.00018829924,0.022285689],"genre_scores_gemma":[0.64440113,0.000015736428,0.33449185,0.017360365,0.00047714333,0.00017403474,0.00030680897,0.00008517047,0.0026877765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997773,0.00012609261,0.00049484003,0.0007561288,0.00040692565,0.00044299188],"domain_scores_gemma":[0.9971647,0.00012833957,0.00016186362,0.0010405736,0.00017195725,0.001332529],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00035027214,0.00032973793,0.00046924452,0.00025229965,0.00016873384,0.0005288063,0.0017822334,0.0002921365,0.010832984],"category_scores_gemma":[0.0002537153,0.00031110458,0.0002269977,0.00029439057,0.000036710004,0.00009538933,0.00050685817,0.00046673432,0.009288573],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000014217557,0.00004052303,0.000004234418,0.00007563189,0.000055944223,0.000032940086,0.0006115757,0.0011171598,0.000005755161,0.98913974,0.0076640677,0.0012510289],"study_design_scores_gemma":[0.00009980043,0.000021151784,0.000034726578,0.00004344098,0.000033956458,0.00000927206,0.000020915675,0.5118841,0.000020847881,0.46762094,0.019832978,0.00037789592],"about_ca_topic_score_codex":0.0012374568,"about_ca_topic_score_gemma":0.0006719595,"teacher_disagreement_score":0.6442165,"about_ca_system_score_codex":0.00021090815,"about_ca_system_score_gemma":0.00052418106,"threshold_uncertainty_score":0.9999341},"labels":[],"label_agreement":null},{"id":"W2898479565","doi":"10.1007/s10957-018-1414-2","title":"Variational Analysis on the Signed Distance Functions","year":2018,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Signed distance function; Mathematics; Set function; Subderivative; Hausdorff distance; Complement (music); Function (biology); Boundary (topology); Distance transform; Minkowski distance; Closed set; Theory of computation; Level set (data structures); Set (abstract data type); Discrete mathematics; Mathematical analysis; Algorithm; Regular polygon; Euclidean distance; Convex optimization; Artificial intelligence; Geometry; Computer science","score_opus":0.007556437567237859,"score_gpt":0.23437614908123358,"score_spread":0.22681971151399571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898479565","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000049837352,0.000034475026,0.9927546,0.004346107,0.00005658723,0.00010269877,0.0000077559425,0.000021078537,0.0026269066],"genre_scores_gemma":[0.8679792,0.00007041513,0.12740362,0.002298294,0.0005241694,0.000052774594,0.00002766344,0.0000101547275,0.001633701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988964,0.00021523742,0.00036978157,0.00016578515,0.00026566454,0.00008712027],"domain_scores_gemma":[0.9978318,0.0006719394,0.00043084146,0.00028816116,0.0007049372,0.00007229552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010438095,0.000090288704,0.00014183566,0.00030404262,0.00057412044,0.0001750286,0.00037615938,0.000037549034,0.00041675352],"category_scores_gemma":[0.00015247808,0.000060675116,0.0001219632,0.0020163062,0.000101772086,0.00035681698,0.00003748866,0.000092307084,0.000018563507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014466952,0.00005702708,0.000060920156,5.714648e-7,0.00019829898,9.560179e-8,0.00009220304,0.29019946,0.0000067179058,0.70843124,0.00023003841,0.00070900115],"study_design_scores_gemma":[0.00028686976,0.00011136482,0.0013261257,0.000006326698,0.00045867462,0.0000104368455,0.0001330851,0.92116606,0.00006621836,0.06842804,0.007853699,0.00015311605],"about_ca_topic_score_codex":5.286088e-7,"about_ca_topic_score_gemma":9.594714e-7,"teacher_disagreement_score":0.8679294,"about_ca_system_score_codex":0.000025468804,"about_ca_system_score_gemma":0.00006206848,"threshold_uncertainty_score":0.4563159},"labels":[],"label_agreement":null},{"id":"W2900537105","doi":"10.1186/s13660-018-1899-0","title":"General iterative methods for systems of variational inequalities with the constraints of generalized mixed equilibria and fixed point problem of pseudocontractions","year":2018,"lang":"en","type":"article","venue":"Journal of Inequalities and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Shanghai Municipal Education Commission; Ministry of Education of the People's Republic of China","keywords":"Mathematics; Variational inequality; Fixed point; Hilbert space; Convergence (economics); Iterative method; Applied mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.029482844268344483,"score_gpt":0.3232790715053863,"score_spread":0.29379622723704185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900537105","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015524777,0.00020024975,0.9822906,0.0014134829,0.00003470063,0.0003124204,0.000115008464,0.000004355111,0.00010436873],"genre_scores_gemma":[0.49931562,0.000047011967,0.50025225,0.00006064442,0.00012889932,0.00006762024,0.000009591033,0.00000480234,0.00011357964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985319,0.0002698287,0.0008106126,0.00011323687,0.00018750966,0.000086937514],"domain_scores_gemma":[0.9959573,0.00095839135,0.0012535114,0.0001457083,0.0016379822,0.00004707536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011468083,0.00009488728,0.00035721413,0.00014133053,0.0001335296,0.000059488055,0.00018583862,0.000037625483,0.000013154446],"category_scores_gemma":[0.000068805515,0.000060176546,0.000075727614,0.00026486165,0.00029897568,0.00028569944,0.00004172989,0.000052953474,5.030426e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037638976,0.00006377473,0.00015148928,0.00007787702,0.00026036406,3.397817e-8,0.0020095313,0.0016107303,0.006391737,0.987943,0.00012381296,0.0013300356],"study_design_scores_gemma":[0.00550163,0.0018220993,0.004978713,0.00033886704,0.0007411416,0.00019277695,0.013530982,0.8302794,0.017057387,0.11927233,0.0056930734,0.00059156725],"about_ca_topic_score_codex":0.000069094094,"about_ca_topic_score_gemma":0.000008681256,"teacher_disagreement_score":0.86867064,"about_ca_system_score_codex":0.000012228778,"about_ca_system_score_gemma":0.00016236497,"threshold_uncertainty_score":0.24539283},"labels":[],"label_agreement":null},{"id":"W2901980993","doi":"10.1186/s13660-018-1905-6","title":"Strong convergence theorem for split monotone variational inclusion with constraints of variational inequalities and fixed point problems","year":2018,"lang":"en","type":"article","venue":"Journal of Inequalities and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Mathematics; Variational inequality; Monotone polygon; Fixed point; Fixed-point theorem; Convergence (economics); Strongly monotone; Applied mathematics; Inequality; Mathematical analysis; Pure mathematics; Geometry","score_opus":0.020582687835420752,"score_gpt":0.2624299837121199,"score_spread":0.24184729587669915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901980993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005640458,0.00009373642,0.99138594,0.002258345,0.000036506928,0.00025446096,0.00010045912,0.000010499778,0.00021959357],"genre_scores_gemma":[0.8491839,0.00006893906,0.15021165,0.00019332342,0.0001800905,0.000046135916,0.000023981762,0.000006085882,0.0000859055],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986399,0.00007559315,0.0006537958,0.00017266575,0.00033798604,0.00012006361],"domain_scores_gemma":[0.9973255,0.000511757,0.00072146347,0.00014250063,0.0012137673,0.000085014755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008695365,0.00011553052,0.00024632222,0.00016240295,0.0003441019,0.000079400386,0.00022893025,0.000047344645,0.00006984891],"category_scores_gemma":[0.000085886815,0.00008903494,0.00005229612,0.00025093596,0.00023789502,0.0004543985,0.00016394939,0.00006755146,5.1852146e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030378875,0.00007008231,0.0007792035,0.000046547386,0.00008863362,9.852289e-8,0.0021242276,0.0010336235,0.00023018151,0.9941222,0.000045810193,0.0014289769],"study_design_scores_gemma":[0.0030537888,0.0010384301,0.010951038,0.00020097302,0.00018779079,0.00009902328,0.0034589204,0.4231764,0.0010514765,0.5523361,0.0039295834,0.00051645096],"about_ca_topic_score_codex":0.000031359155,"about_ca_topic_score_gemma":0.0000093017525,"teacher_disagreement_score":0.8435434,"about_ca_system_score_codex":0.00002757256,"about_ca_system_score_gemma":0.00021093899,"threshold_uncertainty_score":0.36307395},"labels":[],"label_agreement":null},{"id":"W2902394491","doi":"10.1017/s0004972718001077","title":"AMENABLE SEMIGROUPS OF NONLINEAR OPERATORS IN UNIFORMLY CONVEX BANACH SPACES","year":2018,"lang":"en","type":"article","venue":"Bulletin of the Australian Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Banach space; Uniformly convex space; Regular polygon; Pure mathematics; Fixed point; Bounded function; Discrete mathematics; Mathematical analysis; Banach manifold; Lp space; Geometry","score_opus":0.015353171525484606,"score_gpt":0.24763544377100385,"score_spread":0.23228227224551926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2902394491","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45192987,0.00004402298,0.37594908,0.15091203,0.00041718213,0.0013248881,0.00005920729,0.00018398931,0.019179732],"genre_scores_gemma":[0.68093675,0.0000067076307,0.31149417,0.00058354496,0.000047443347,0.000005565964,0.0000019250829,0.000008483146,0.0069154096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988764,0.00006064062,0.00039914867,0.00017230297,0.00031800586,0.00017352383],"domain_scores_gemma":[0.99912405,0.000104561106,0.0001777157,0.00038528853,0.00015660506,0.00005180525],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00052519934,0.00010160858,0.00024846365,0.000024463268,0.0000662262,0.00003928695,0.0007323513,0.00007762706,0.0011173743],"category_scores_gemma":[0.00010438302,0.00006771902,0.0002016503,0.0005051381,0.00021598874,0.000051587816,0.00019990082,0.00009862034,0.00007084708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018446633,0.0014728247,0.011541108,0.0006558619,0.00043621103,0.0000012715589,0.010335551,0.005024339,0.002282636,0.8191038,0.14884156,0.00028638938],"study_design_scores_gemma":[0.002652106,0.00040103766,0.0118702715,0.00070704345,0.0001891158,0.000015524854,0.0034534344,0.7905742,0.06040379,0.051637385,0.07704195,0.001054174],"about_ca_topic_score_codex":0.00008208764,"about_ca_topic_score_gemma":0.000002863153,"teacher_disagreement_score":0.7855498,"about_ca_system_score_codex":0.000028107894,"about_ca_system_score_gemma":0.000042322787,"threshold_uncertainty_score":0.99979573},"labels":[],"label_agreement":null},{"id":"W2903446088","doi":"10.2478/aupcsm-2018-0007","title":"Fixed point properties for semigroups of nonexpansive mappings on convex sets in dual Banach spaces","year":2018,"lang":"en","type":"article","venue":"Annales Universitatis Paedagogicae Cracoviensis Studia Mathematica","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Banach space; Regular polygon; Dual (grammatical number); Fixed point; Norm (philosophy); Fixed-point property; Pure mathematics; Uniformly convex space; Discrete mathematics; Mathematical analysis; Lp space; Banach manifold; Geometry","score_opus":0.05165598083043365,"score_gpt":0.27883970136513414,"score_spread":0.22718372053470048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2903446088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43204093,0.00030815566,0.5182627,0.026282249,0.00029756004,0.0024381701,0.00015233058,0.00028553398,0.019932417],"genre_scores_gemma":[0.9226216,0.000059469723,0.07611565,0.0005566886,0.000025701724,0.000021791888,0.0000128204765,0.0000121941675,0.0005740628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982288,0.00012383834,0.00045054857,0.00048339742,0.00040318578,0.0003102357],"domain_scores_gemma":[0.9977256,0.00062063255,0.00034576727,0.00038235838,0.00083470164,0.00009091316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003976621,0.00023898589,0.00053131545,0.00045602905,0.00023236134,0.00007074901,0.00038233132,0.00007776026,0.000087110915],"category_scores_gemma":[0.00037533892,0.00019915924,0.00017198092,0.0008582688,0.00020584278,0.00048531772,0.00019841758,0.00008289093,0.00006811377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030097782,0.001613735,0.0009981061,0.0006102289,0.0010552157,0.000074341755,0.118921235,0.001820475,0.0036405236,0.84968615,0.018834004,0.0024450207],"study_design_scores_gemma":[0.011799385,0.00787499,0.024518209,0.0027080092,0.0009886705,0.00008639872,0.13107975,0.7289568,0.017877935,0.057400316,0.012456364,0.004253127],"about_ca_topic_score_codex":0.00002633199,"about_ca_topic_score_gemma":0.00005105608,"teacher_disagreement_score":0.7922858,"about_ca_system_score_codex":0.0000664506,"about_ca_system_score_gemma":0.00011960952,"threshold_uncertainty_score":0.8121478},"labels":[],"label_agreement":null},{"id":"W2905432291","doi":"10.23952/jnva.3.2019.1.05","title":"Minimax theorems in a fully non-convex setting","year":2019,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per l'Analisi Matematica, la Probabilità e le loro Applicazioni; Università di Catania; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Minimax; Regular polygon; Mathematics; Convex analysis; Minimax theorem; Convex optimization; Mathematical optimization; Calculus (dental); Medicine; Geometry","score_opus":0.004080229341513309,"score_gpt":0.22582916805641945,"score_spread":0.22174893871490614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2905432291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13359483,0.000098964876,0.85987455,0.0050445856,0.00015712656,0.00007767697,0.000009692539,0.000010479897,0.0011321058],"genre_scores_gemma":[0.84347236,0.000039191353,0.15554261,0.0004829476,0.00013708898,9.179181e-7,0.000015240727,0.00000468348,0.0003049673],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844885,0.00008969801,0.00064599194,0.00020749796,0.0004691758,0.00013877582],"domain_scores_gemma":[0.99857986,0.00025792155,0.0004903573,0.00016135676,0.00042119707,0.000089317306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010522212,0.00011346933,0.00039470728,0.000990212,0.000053670617,0.00014019568,0.00033191414,0.000060110186,0.00023764525],"category_scores_gemma":[0.0000943644,0.00009092533,0.00027488812,0.001956822,0.000013302011,0.00058804953,0.000073416464,0.00015837082,0.000019110637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010992873,0.00063700974,0.5517497,0.000036942347,0.004143048,0.000041017556,0.0023303933,0.32832587,0.0008487132,0.10397874,0.00019121789,0.007607411],"study_design_scores_gemma":[0.00051472127,0.000043112977,0.15437526,0.000009091425,0.0002000663,0.000012982813,0.000046290494,0.8422424,0.000018303987,0.0022120737,0.0002249845,0.00010070994],"about_ca_topic_score_codex":0.000027427031,"about_ca_topic_score_gemma":0.000014385157,"teacher_disagreement_score":0.70987755,"about_ca_system_score_codex":0.000040186496,"about_ca_system_score_gemma":0.00015318712,"threshold_uncertainty_score":0.3707827},"labels":[],"label_agreement":null},{"id":"W2909953005","doi":"","title":"Subdifferential Representation of Convex Functions: Refinements and Applications.","year":2005,"lang":"en","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Subderivative; Representation (politics); Regular polygon; Mathematics; Convex analysis; Pure mathematics; Computer science; Convex optimization; Geometry; Political science","score_opus":0.014508346251092303,"score_gpt":0.2384111472071543,"score_spread":0.22390280095606202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2909953005","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004347921,0.0004580724,0.97607464,0.0066247927,0.00010295745,0.00039584213,0.00004289061,0.00014610002,0.011806777],"genre_scores_gemma":[0.7046402,0.0012892545,0.28113538,0.00017667658,0.00007581457,0.00028960203,0.0012219233,0.000032212116,0.011138936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99633783,0.0016052824,0.00064976217,0.0007617327,0.0004681762,0.00017719164],"domain_scores_gemma":[0.99483657,0.0005753039,0.0007271489,0.0015984043,0.002140432,0.0001221263],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014831119,0.0002302109,0.0003527508,0.00031998384,0.0002468278,0.00033064722,0.0009786931,0.00018717673,0.00016626873],"category_scores_gemma":[0.00034592368,0.0002505629,0.00015881367,0.00064558693,0.00013054072,0.00025945314,0.0012542235,0.0002722507,0.000022264707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014445502,0.0011455377,0.007001373,0.00024170948,0.0003916632,8.719751e-7,0.0039990223,0.0024049634,0.0013323673,0.7791672,0.0014094121,0.20289148],"study_design_scores_gemma":[0.00194461,0.0000014246001,0.033257175,0.0008171865,0.00032471571,0.000012500559,0.00015495194,0.88959324,0.023136703,0.027903615,0.02173624,0.00111766],"about_ca_topic_score_codex":0.00041429704,"about_ca_topic_score_gemma":0.00022289033,"teacher_disagreement_score":0.88718826,"about_ca_system_score_codex":0.000060308852,"about_ca_system_score_gemma":0.00017253791,"threshold_uncertainty_score":0.99999464},"labels":[],"label_agreement":null},{"id":"W2913893999","doi":"10.1007/978-3-030-25939-6_3","title":"Numerical Explorations of Feasibility Algorithms for Finding Points in the Intersection of Finite Sets","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kelowna General Hospital; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Intersection (aeronautics); Constraint (computer-aided design); Algorithm; Convergence (economics); Projection (relational algebra); Point (geometry); Euclidean geometry; Mathematics; Set (abstract data type); Regular polygon; Hilbert space; Constellation; Mathematical optimization; Computer science; Pure mathematics","score_opus":0.09623378331770137,"score_gpt":0.3146707892107584,"score_spread":0.21843700589305703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913893999","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000016809587,0.0000056499275,0.9642974,0.00067757384,0.00012576785,0.00031672243,0.000026464622,0.0000110989495,0.0345225],"genre_scores_gemma":[0.5071082,0.000034504345,0.40215242,0.0008414179,0.00011134945,0.00006396132,0.00042167053,0.000036588594,0.089229874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990101,0.000035737252,0.00041652375,0.00023659124,0.00023211722,0.00006893231],"domain_scores_gemma":[0.9987115,0.0004239673,0.0002907449,0.00033711453,0.0002212445,0.000015422906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040067235,0.000103834915,0.00023327951,0.00017662709,0.00003085074,0.000025576284,0.00036419474,0.00008898161,0.00011464451],"category_scores_gemma":[0.00008306829,0.00007594902,0.00017474592,0.00014872575,0.000020295274,0.00020442915,0.000052670144,0.00009165081,0.000010213225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010301903,0.000074893134,0.00016233693,0.0000390445,0.00005433164,1.9275294e-7,0.0010840277,0.011729867,0.000003928854,0.9844682,0.00027498105,0.0020978604],"study_design_scores_gemma":[0.0002830195,0.0001050906,0.00052592205,0.000046305446,0.00002715142,9.2483276e-7,0.000057599496,0.94692534,0.000035012683,0.05132056,0.0005484795,0.00012459297],"about_ca_topic_score_codex":0.000024524876,"about_ca_topic_score_gemma":0.000026496447,"teacher_disagreement_score":0.93519545,"about_ca_system_score_codex":0.000050314462,"about_ca_system_score_gemma":0.00009564213,"threshold_uncertainty_score":0.30971113},"labels":[],"label_agreement":null},{"id":"W2924275034","doi":"10.1007/s10589-019-00088-8","title":"A parameterized Douglas–Rachford algorithm","year":2019,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Parameterized complexity; Norm (philosophy); Algorithm; Operator norm; Applied mathematics; Pure mathematics; Hilbert space","score_opus":0.0062931027341781515,"score_gpt":0.2275084460021012,"score_spread":0.22121534326792305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924275034","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000068887064,0.000056304714,0.9953239,0.0014684984,0.000083257255,0.00042151046,0.000013171698,0.00019190685,0.0023725803],"genre_scores_gemma":[0.02239282,0.000050322928,0.9748064,0.0012533445,0.000066510285,0.00015518907,0.00031040036,0.000012054812,0.0009529357],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882543,0.00004512038,0.00030512968,0.00041573265,0.00026486118,0.00014370153],"domain_scores_gemma":[0.99902904,0.00015727818,0.00014741761,0.00027685866,0.00027820142,0.000111200185],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012885706,0.00013815824,0.00016333534,0.00019048188,0.0002069554,0.0002597481,0.00030055942,0.000057650846,0.0002344244],"category_scores_gemma":[0.000011167188,0.00013935544,0.00006254332,0.00081578223,0.00003331118,0.0005184157,0.00011532872,0.00007503864,0.0001867019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011815903,0.000049988976,0.0001160023,0.0000043462246,0.00002056874,1.2820567e-7,0.00004178436,0.79046863,0.0000037026564,0.19555363,0.000095337935,0.013644695],"study_design_scores_gemma":[0.00048420622,0.00001803446,0.00053195434,0.0000037071222,0.000010654375,0.00000847581,0.00001420422,0.9794991,0.0000051202137,0.010198543,0.009057274,0.00016872516],"about_ca_topic_score_codex":0.0000037258508,"about_ca_topic_score_gemma":2.1687306e-7,"teacher_disagreement_score":0.18903047,"about_ca_system_score_codex":0.000027281118,"about_ca_system_score_gemma":0.000069513444,"threshold_uncertainty_score":0.56827503},"labels":[],"label_agreement":null},{"id":"W2928101450","doi":"10.1016/j.matpur.2020.05.004","title":"Variational problems involving unequal dimensional optimal transport","year":2020,"lang":"fr","type":"article","venue":"Journal de Mathématiques Pures et Appliquées","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Mathematics; Mathematical optimization; Space (punctuation); Convergence (economics); Cournot competition; Minification; Term (time); Applied mathematics; Computer science; Mathematical economics","score_opus":0.03404120112142599,"score_gpt":0.26940751671695834,"score_spread":0.23536631559553234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2928101450","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053388085,0.0030029663,0.8450452,0.14453045,0.00043434248,0.00024842593,0.00005966907,0.0001535195,0.0011866074],"genre_scores_gemma":[0.25391224,0.0020936907,0.7173927,0.021648485,0.002110317,0.000054204855,0.00012225236,0.000091771966,0.0025743474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99583894,0.00054217695,0.0012060782,0.00056786934,0.0012163573,0.00062855665],"domain_scores_gemma":[0.9972387,0.00034184832,0.00071918376,0.00022471299,0.00073652016,0.0007390641],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015805784,0.00045391268,0.00055841706,0.00021531456,0.0004866086,0.0010368439,0.0008839755,0.00030915914,0.0013485899],"category_scores_gemma":[0.00020503967,0.00044105845,0.00042696297,0.00081195426,0.00010843378,0.001958068,0.00020878814,0.0010554194,0.0001373003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034334647,0.00021537155,0.00055285933,0.0001324317,0.00023528193,0.0001037502,0.008090658,0.52333343,0.000309378,0.457744,0.008742035,0.00050642877],"study_design_scores_gemma":[0.0006271339,0.00022268167,0.00418767,0.00020192143,0.00015641851,0.00038372728,0.000107302905,0.93784523,0.00011743588,0.028789166,0.0268448,0.00051650964],"about_ca_topic_score_codex":0.00008552417,"about_ca_topic_score_gemma":0.00002724182,"teacher_disagreement_score":0.42895484,"about_ca_system_score_codex":0.00021016707,"about_ca_system_score_gemma":0.0013565414,"threshold_uncertainty_score":0.99983096},"labels":[],"label_agreement":null},{"id":"W2949531900","doi":"10.48550/arxiv.1611.07891","title":"New constraint qualifications for mathematical programs with equilibrium constraints via variational analysis","year":2016,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Calmness; Karush–Kuhn–Tucker conditions; Verifiable secret sharing; Constraint (computer-aided design); Metric (unit); Mathematics; Variational analysis; Applied mathematics; Mathematical optimization; Parametric statistics; Set (abstract data type); Computer science; Engineering; Geometry; Statistics","score_opus":0.0708776549774647,"score_gpt":0.21404275404536027,"score_spread":0.14316509906789557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2949531900","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021791676,0.0000036864972,0.99475986,0.0014303414,0.000083419895,0.0005435123,0.000107864085,0.00020675689,0.0026466567],"genre_scores_gemma":[0.7573379,0.000003549372,0.24004667,0.00008234331,0.00007754889,0.0000064582555,0.00029819453,0.000014374117,0.0021329403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790925,0.00011498995,0.00038631767,0.0010651083,0.00020525015,0.00031911224],"domain_scores_gemma":[0.99736804,0.00034251498,0.00048272125,0.0009152964,0.0005886757,0.00030273793],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033688536,0.00031025268,0.00048298517,0.00051471585,0.00014904652,0.0002451171,0.0011042418,0.00022637672,0.00061986427],"category_scores_gemma":[0.00004564346,0.00026978058,0.00046415944,0.001438234,0.00020548556,0.00034259123,0.00037950676,0.00017478495,0.00005763393],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016178665,0.00011922977,0.00065350544,0.000022676104,0.001541804,0.000005815231,0.00008284557,0.18013062,0.000007679568,0.81641495,0.000078912235,0.00092579477],"study_design_scores_gemma":[0.0005182645,0.00003333073,0.0002498701,0.000027748283,0.0009419887,0.0000032918344,0.000021581865,0.7571015,0.000007987362,0.24069259,0.00008540574,0.0003164638],"about_ca_topic_score_codex":0.000022778686,"about_ca_topic_score_gemma":0.00001709537,"teacher_disagreement_score":0.75712,"about_ca_system_score_codex":0.00016156827,"about_ca_system_score_gemma":0.0007939267,"threshold_uncertainty_score":0.99997544},"labels":[],"label_agreement":null},{"id":"W2950102140","doi":"10.48550/arxiv.1306.1771","title":"Generalized solutions for the sum of two maximally monotone operators","year":2013,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Monotone polygon; Mathematics; Duality (order theory); Set (abstract data type); Applied mathematics; Zero (linguistics); Explained sum of squares; Solution set; Mathematical optimization; Pure mathematics; Computer science","score_opus":0.08257993935635236,"score_gpt":0.2090745173838175,"score_spread":0.12649457802746514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950102140","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014102412,0.00004409651,0.9840041,0.00077746325,0.0002465097,0.0003900871,0.000033068973,0.000059014998,0.00034328806],"genre_scores_gemma":[0.9768186,0.00020458702,0.020694332,0.00017127334,0.000049990747,0.000007409632,0.000032638378,0.000009206978,0.0020119704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99893457,0.00008546312,0.00020693032,0.00048036603,0.000078451805,0.00021424801],"domain_scores_gemma":[0.9983069,0.00014343267,0.00023762928,0.00075044436,0.00048946036,0.00007217615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002500695,0.00016282973,0.0002345233,0.00019078735,0.00027127034,0.000104497165,0.0013577291,0.000099971716,0.00008990985],"category_scores_gemma":[0.000031023465,0.00013893546,0.0002817591,0.0005601099,0.000070752656,0.00024454063,0.0010232505,0.00014254558,0.000023890874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031363622,0.000026709082,0.00012652745,0.000005917011,0.00010225137,6.067355e-7,0.000035138615,0.50213146,0.000015201554,0.4972687,0.00024275093,0.000041565985],"study_design_scores_gemma":[0.0004460904,0.000012447709,0.00035321614,0.000008267953,0.00012810327,3.3635953e-7,0.000015882712,0.9637173,0.0000507189,0.034676407,0.00043398232,0.00015724429],"about_ca_topic_score_codex":0.00068272685,"about_ca_topic_score_gemma":0.00007161469,"teacher_disagreement_score":0.9633097,"about_ca_system_score_codex":0.00007040291,"about_ca_system_score_gemma":0.00020337125,"threshold_uncertainty_score":0.56656235},"labels":[],"label_agreement":null},{"id":"W2951241939","doi":"10.1007/s11228-019-00519-y","title":"New Sharp Necessary Optimality Conditions for Mathematical Programs with Equilibrium Constraints","year":2019,"lang":"en","type":"preprint","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Complementarity (molecular biology); Constraint (computer-aided design); Mathematical optimization; Parametric statistics; Mathematics; Mixed complementarity problem; Mathematical economics; Cone (formal languages); Applied mathematics; Computer science; Algorithm; Nonlinear system; Geometry; Physics","score_opus":0.03173994879061303,"score_gpt":0.2952924408431884,"score_spread":0.26355249205257536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951241939","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007640519,0.00005806144,0.99223137,0.0040867617,0.00011831599,0.0007726715,0.00064779306,0.00015865697,0.001162309],"genre_scores_gemma":[0.27497754,0.00001390336,0.7139883,0.00053801393,0.000251114,0.00021393785,0.007902237,0.000030337245,0.0020846121],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966732,0.0001566173,0.0007618765,0.001206605,0.0008208211,0.0003808565],"domain_scores_gemma":[0.99719507,0.0003795064,0.00061208697,0.0007717768,0.00072274654,0.00031880045],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006837631,0.00045681986,0.00093082327,0.0005905632,0.00023354848,0.0008785038,0.00077450124,0.0003095193,0.0007465668],"category_scores_gemma":[0.00009981715,0.00038430275,0.00058594113,0.001418732,0.00011512402,0.00048416966,0.00055494485,0.00030623036,0.000034431305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032718457,0.00020432656,0.002741152,0.00015739194,0.0057102097,0.0000021923433,0.00034263486,0.24386524,0.000008001147,0.74556184,0.0006188382,0.0007554806],"study_design_scores_gemma":[0.0007145864,0.00006164526,0.0059162886,0.00005309049,0.0028413227,0.000006090369,0.000028289849,0.90029675,0.0000042195716,0.08949441,0.00010962586,0.0004736768],"about_ca_topic_score_codex":0.0001110652,"about_ca_topic_score_gemma":0.000017591352,"teacher_disagreement_score":0.65643156,"about_ca_system_score_codex":0.00008458614,"about_ca_system_score_gemma":0.0008381266,"threshold_uncertainty_score":0.9998609},"labels":[],"label_agreement":null},{"id":"W2951449423","doi":"10.1109/allerton.2018.8636076","title":"On Convergence of Heuristics Based on Douglas-Rachford Splitting and ADMM to Minimize Convex Functions over Nonconvex Sets","year":2018,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Thales (Canada)","funders":"","keywords":"Heuristics; Heuristic; Mathematical optimization; Convergence (economics); Regular polygon; Mathematics; Operator (biology); Convex function; Convex optimization; Minification; Set (abstract data type); Computer science","score_opus":0.018565854444783238,"score_gpt":0.27287973274364824,"score_spread":0.254313878298865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951449423","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005554374,0.0000072522903,0.98507756,0.0016287742,0.0013402561,0.00028835368,0.00007151588,0.0000991603,0.00593275],"genre_scores_gemma":[0.7082852,0.000021055486,0.2822364,0.006109758,0.00020227439,0.00004512885,0.00011224905,0.000026708285,0.0029611925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977063,0.000109560526,0.00057358656,0.00082128047,0.00056692545,0.0002223383],"domain_scores_gemma":[0.9974779,0.00062510505,0.00037056924,0.0007959949,0.00051553483,0.0002149343],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039984987,0.00030490107,0.0004410021,0.0003935041,0.0001418145,0.00015956775,0.0005548326,0.00020166728,0.0010449662],"category_scores_gemma":[0.00037090632,0.00027721754,0.0001532644,0.0004636927,0.00006972029,0.00009620134,0.0006217015,0.00025537756,0.00013035613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004876983,0.0015709831,0.022938196,0.00074205064,0.0006820714,0.000019489407,0.0013920199,0.7645698,0.000098178156,0.15035231,0.052847244,0.0042999205],"study_design_scores_gemma":[0.00039870836,0.00017271485,0.0065795965,0.00010888591,0.00005291086,5.9191075e-7,0.000014429416,0.99023485,0.00017796457,0.0011095476,0.00084183115,0.00030798072],"about_ca_topic_score_codex":0.000089856076,"about_ca_topic_score_gemma":0.000010511583,"teacher_disagreement_score":0.70284116,"about_ca_system_score_codex":0.00006230557,"about_ca_system_score_gemma":0.00024053777,"threshold_uncertainty_score":0.999968},"labels":[],"label_agreement":null},{"id":"W2951864039","doi":"10.48550/arxiv.1003.5866","title":"Self-dual Smooth Approximations of Convex Functions via the Proximal Average","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Smoothing; Dual (grammatical number); Operator (biology); Duality (order theory); Regular polygon; Convex analysis; Mathematics; Norm (philosophy); Simple (philosophy); Convex combination; Convex function; Convex optimization; Combinatorics; Geometry","score_opus":0.03315825564277842,"score_gpt":0.1727245020863354,"score_spread":0.139566246443557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951864039","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009281827,0.000008119511,0.9852921,0.0005993704,0.00038525683,0.00030728735,0.00003266067,0.00018714965,0.0039062533],"genre_scores_gemma":[0.98305124,0.000022243505,0.014800595,0.00010000617,0.00006915279,0.0000030902474,0.000058194943,0.000009789282,0.0018856835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998685,0.00014002826,0.00025260006,0.00058987935,0.00014886256,0.00018361359],"domain_scores_gemma":[0.99791425,0.0001347252,0.00038456655,0.001047218,0.00042724758,0.000091998896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027150518,0.00020522396,0.0002489833,0.00025651243,0.0003115481,0.00010871345,0.0011333541,0.00022421037,0.00015601414],"category_scores_gemma":[0.00003389154,0.00018134867,0.00025239759,0.00091769284,0.00011013477,0.0003281945,0.00091693824,0.0005740427,0.00006673613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000059706626,0.00020678564,0.00062303944,0.00003718016,0.00020757226,0.000006855917,0.00035937433,0.41329166,0.00003106903,0.5849511,0.00016535158,0.00011401601],"study_design_scores_gemma":[0.00022080951,0.000017381402,0.0010676284,0.00000789453,0.00014128957,0.0000024106153,0.000033227396,0.9782968,0.000040491806,0.019000806,0.0009751285,0.00019612207],"about_ca_topic_score_codex":0.00008228034,"about_ca_topic_score_gemma":0.00004323184,"teacher_disagreement_score":0.9737694,"about_ca_system_score_codex":0.00006671955,"about_ca_system_score_gemma":0.0002857249,"threshold_uncertainty_score":0.7395184},"labels":[],"label_agreement":null},{"id":"W2952043232","doi":"10.48550/arxiv.1403.7135","title":"On subgradient projectors","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subgradient method; Mathematics; Computer science; Mathematical optimization","score_opus":0.05283505477446836,"score_gpt":0.17491551126170124,"score_spread":0.12208045648723288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952043232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029859418,0.0000045052197,0.9631956,0.0002632692,0.0004023348,0.00013524246,0.0000051595534,0.0001887863,0.0059456546],"genre_scores_gemma":[0.99488646,0.000019941577,0.0019500353,0.00029694446,0.000048875132,6.7404005e-7,0.000024663976,0.000008131982,0.0027642949],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866927,0.00011757569,0.00013372912,0.0007920198,0.00010294906,0.00018444099],"domain_scores_gemma":[0.9986483,0.00008705739,0.00018374145,0.0008214071,0.00014514849,0.0001143469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016212107,0.00019665698,0.00020895197,0.0003395316,0.00011726782,0.000111719324,0.0011047052,0.00014477495,0.00006858823],"category_scores_gemma":[0.000038209462,0.0002040491,0.00020187386,0.0005781364,0.000030118963,0.00013228932,0.00066505803,0.0002585614,0.0002189224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034793782,0.000039245955,0.0003114864,0.000006920742,0.000034800258,0.000009602774,0.000040266965,0.4678722,4.2791663e-7,0.5312835,0.0003467655,0.00005130244],"study_design_scores_gemma":[0.00017232013,0.000033493645,0.00078038045,0.000020429456,0.000035170622,4.1995074e-7,0.0000038860585,0.9375249,0.000012240922,0.06050261,0.0006804228,0.00023373074],"about_ca_topic_score_codex":0.0000736343,"about_ca_topic_score_gemma":0.000016140622,"teacher_disagreement_score":0.96502703,"about_ca_system_score_codex":0.00014788628,"about_ca_system_score_gemma":0.000110593806,"threshold_uncertainty_score":0.83208805},"labels":[],"label_agreement":null},{"id":"W2952736162","doi":"10.48550/arxiv.math/0301269","title":"Minimal vectors in arbitrary Banach spaces","year":2003,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Banach space; Mathematics; Banach manifold; Eberlein–Šmulian theorem; Pure mathematics; Lp space","score_opus":0.034632486663102244,"score_gpt":0.2592000586745312,"score_spread":0.22456757201142896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952736162","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8820915,0.00046768543,0.09809673,0.0056377826,0.0011575513,0.00025036102,0.000010134642,0.00019054301,0.012097718],"genre_scores_gemma":[0.9680416,0.000093446986,0.02936416,0.001021848,0.000107481574,0.000026691318,0.000044222834,0.000015062501,0.0012854999],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9982976,0.00014199385,0.00036258475,0.0006595521,0.0002909761,0.0002473407],"domain_scores_gemma":[0.9989531,0.00007509804,0.00018664169,0.00060217956,0.00008904235,0.0000939374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002751273,0.00023001185,0.00030932724,0.0003332775,0.00006399194,0.00016002098,0.00083268405,0.00020086944,0.00018426069],"category_scores_gemma":[0.00007928512,0.00022699784,0.00015878839,0.00066552265,0.000028053471,0.00024476717,0.00048253877,0.00042383999,0.00015888181],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004745109,0.0001905859,0.9556104,0.000041297404,0.00010877005,0.00003550452,0.0006037907,0.022849286,0.000040691604,0.019006817,0.0012964084,0.00021173093],"study_design_scores_gemma":[0.0003402293,0.0000269518,0.858055,0.00006460035,0.00003777978,0.000003827903,0.000034496818,0.13430242,0.00023359372,0.0031950215,0.0030963079,0.0006097655],"about_ca_topic_score_codex":0.00016430017,"about_ca_topic_score_gemma":0.000050593513,"teacher_disagreement_score":0.11145313,"about_ca_system_score_codex":0.000081872975,"about_ca_system_score_gemma":0.00023918076,"threshold_uncertainty_score":0.9256703},"labels":[],"label_agreement":null},{"id":"W2953901288","doi":"","title":"Positive versus Completely Positive Bilinear Maps","year":2019,"lang":"en","type":"article","venue":"MacEwan University Student Research Proceedings","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"MacEwan University","funders":"","keywords":"Mathematics","score_opus":0.07116264136710995,"score_gpt":0.34355472478148114,"score_spread":0.27239208341437116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2953901288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51510674,0.000037252503,0.0184699,0.020161256,0.0005027292,0.0021023876,0.00010047517,0.0005016513,0.4430176],"genre_scores_gemma":[0.98162043,0.000029765191,0.0062461994,0.0001466593,0.0000592643,0.0000015334197,0.000029460616,0.000010369608,0.0118563175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99739355,0.00009031394,0.00013527945,0.0006152595,0.0012981185,0.00046750484],"domain_scores_gemma":[0.9977327,0.00024065962,0.00007446487,0.00020359439,0.0015454446,0.00020314481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073618663,0.00014665278,0.00019340313,0.0006140506,0.0005209758,0.0003638647,0.0014255196,0.00007084293,0.00017262236],"category_scores_gemma":[0.000061458,0.00015338202,0.0001052436,0.0019374267,0.0001041862,0.00085933466,0.0012207786,0.00036392492,0.000650364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044036753,0.00046330164,0.023286091,0.00003152654,0.00042602821,0.00005365894,0.007223687,0.0003166842,0.0014287054,0.95832926,0.0072014397,0.00079924456],"study_design_scores_gemma":[0.022292845,0.0063599613,0.51402396,0.00032506068,0.00022740095,0.0000372437,0.056010664,0.23637186,0.00493577,0.0036658875,0.1526778,0.0030715172],"about_ca_topic_score_codex":0.00016792226,"about_ca_topic_score_gemma":0.00001546459,"teacher_disagreement_score":0.9546634,"about_ca_system_score_codex":0.00042404162,"about_ca_system_score_gemma":0.0001322076,"threshold_uncertainty_score":0.835933},"labels":[],"label_agreement":null},{"id":"W2955163350","doi":"10.1016/j.orl.2019.06.006","title":"Idealness and 2-resistant sets","year":2019,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Hypercube; Unit cube; Combinatorics; Ideal (ethics); Cardinality (data modeling); Mathematics; Cube (algebra); Set (abstract data type); Regular polygon; Convex hull; Unit (ring theory); Discrete mathematics; Computer science; Geometry","score_opus":0.03179020033189318,"score_gpt":0.3315998570981613,"score_spread":0.29980965676626814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2955163350","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4440578,0.00005986665,0.4298738,0.12154017,0.00014292811,0.000415145,0.0000071713152,0.00008290065,0.0038202284],"genre_scores_gemma":[0.9712714,0.000017838725,0.025423339,0.0018409198,0.000023308066,0.000025015228,0.000014469949,0.000004923041,0.0013787888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988456,0.00017065805,0.00011524556,0.00025880238,0.00042545085,0.00018427675],"domain_scores_gemma":[0.9993135,0.00009429544,0.0000074796185,0.00031767008,0.0001911986,0.00007587661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005875091,0.00005283585,0.000069919704,0.00024004815,0.0003018297,0.00053584186,0.00032237853,0.00002054981,0.00017519202],"category_scores_gemma":[0.00006151169,0.000045942874,0.000020347861,0.0006764206,0.00003837349,0.00054417347,0.00016297688,0.00011629999,0.0003086544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072996418,0.00006155406,0.0017660272,0.000016423324,0.000050272327,0.000009014592,0.0007716898,0.11684619,0.046041705,0.82473934,0.0070210085,0.0026694704],"study_design_scores_gemma":[0.00025537622,0.000029273559,0.0075999764,0.0000065933255,0.0000020912491,0.000003019621,0.000049124203,0.9853701,0.00039334103,0.0003409564,0.0058309957,0.00011917939],"about_ca_topic_score_codex":0.00016550143,"about_ca_topic_score_gemma":0.000057504625,"teacher_disagreement_score":0.8685239,"about_ca_system_score_codex":0.00003604736,"about_ca_system_score_gemma":0.0000632781,"threshold_uncertainty_score":0.5167135},"labels":[],"label_agreement":null},{"id":"W2959383315","doi":"10.23952/jnva.4.2020.2.02","title":"A stand-alone analysis of quasidensity","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Environmental science","score_opus":0.02007659111243199,"score_gpt":0.2562633243400708,"score_spread":0.23618673322763883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2959383315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021571191,0.00017582512,0.97166103,0.006396712,0.000028797404,0.000025549936,0.000047524813,0.000009934059,0.000083411636],"genre_scores_gemma":[0.83779705,0.00012634812,0.16129088,0.00059802923,0.0001167095,3.3499376e-7,0.00003273246,0.0000034744046,0.000034416797],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798304,0.00012412434,0.00086484815,0.00021969987,0.00070198305,0.00010627666],"domain_scores_gemma":[0.99743986,0.00025330335,0.00091163896,0.00016436582,0.0010274533,0.00020338937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006122643,0.00012123041,0.00077450956,0.0012085685,0.00007952933,0.00008545665,0.0003520693,0.000056659705,0.00018411242],"category_scores_gemma":[0.00027130518,0.00009940206,0.0007640297,0.0072868266,0.000027989996,0.00044172473,0.00008876815,0.00012315153,0.0000022580257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013736045,0.00042589146,0.115330935,0.000027462005,0.055286378,0.000020841431,0.0025612386,0.7756493,0.0004697971,0.04873027,0.00021170425,0.0011488325],"study_design_scores_gemma":[0.00031786083,0.00007146291,0.11336973,0.0000024465674,0.008676781,0.0000026374594,0.000039439037,0.87685287,0.000038752718,0.00033930875,0.00019655848,0.000092151495],"about_ca_topic_score_codex":0.00003805996,"about_ca_topic_score_gemma":0.000017078037,"teacher_disagreement_score":0.8162259,"about_ca_system_score_codex":0.000023825283,"about_ca_system_score_gemma":0.00015955957,"threshold_uncertainty_score":0.40534985},"labels":[],"label_agreement":null},{"id":"W2959965689","doi":"10.18280/rces.050202","title":"Optimality conditions and duality for nondifferentiable multiobjective programming","year":2018,"lang":"en","type":"article","venue":"Review of Computer Engineering Studies","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Education Department of Shaanxi Province; Natural Science Foundation of Shaanxi Province","keywords":"Duality (order theory); Multiobjective programming; Mathematical optimization; Multi-objective optimization; Mathematics; Mathematical economics; Computer science; Combinatorics","score_opus":0.02445725591111988,"score_gpt":0.3324852334323528,"score_spread":0.30802797752123295,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2959965689","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041424215,0.008402965,0.9903028,0.00038566047,0.00014642271,0.00026501407,0.000006977149,0.00006379851,0.000012091174],"genre_scores_gemma":[0.06048919,0.004698055,0.93432856,0.00023307322,0.00012760032,0.000087397595,0.000010513384,0.000005998542,0.000019590756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933136,0.00002276564,0.00025093442,0.00018971512,0.00009837985,0.00010682525],"domain_scores_gemma":[0.9990614,0.00016158482,0.000096361924,0.00015612127,0.00049564627,0.000028894625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027291526,0.00009626411,0.00030402956,0.00005710729,0.00009010044,0.000025939105,0.0001285622,0.000014562973,0.0000023882615],"category_scores_gemma":[0.000090468784,0.000081655824,0.000076299286,0.00024185778,0.00004197183,0.00015592853,0.00013168412,0.000026938376,0.0000010636721],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011985275,0.00065797707,0.0024216906,0.057175703,0.005233147,0.0000022826925,0.004858866,0.025730776,0.00017369381,0.8106672,0.006716654,0.08634999],"study_design_scores_gemma":[0.00031970497,0.0001402074,0.007943099,0.0024062728,0.00012767491,0.0000040983914,0.000009748092,0.9820236,0.00023049969,0.00038999904,0.006173837,0.00023127242],"about_ca_topic_score_codex":0.0000018202066,"about_ca_topic_score_gemma":4.9162435e-7,"teacher_disagreement_score":0.9562928,"about_ca_system_score_codex":0.000016673797,"about_ca_system_score_gemma":0.000012108793,"threshold_uncertainty_score":0.33298278},"labels":[],"label_agreement":null},{"id":"W2960401279","doi":"10.1090/proc/14709","title":"On Lau’s conjecture span style=color:redThis article has been retracted/span","year":2019,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Semigroup; Regular polygon; Conjecture; Banach space; Norm (philosophy); Dual (grammatical number); Pure mathematics; Property (philosophy); Discrete mathematics; Fixed point; Mathematical analysis","score_opus":0.009513498557116444,"score_gpt":0.22412191275156523,"score_spread":0.2146084141944488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2960401279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9323658,0.0000068336376,0.03374385,0.023153778,0.000069188274,0.0004353196,0.000007418993,0.00018277815,0.0100350855],"genre_scores_gemma":[0.94781893,0.0000046342466,0.049375404,0.0019320631,0.00003403868,0.00000981277,8.859831e-7,0.000012832129,0.00081138447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846864,0.000014602543,0.00031743114,0.00033197715,0.000612395,0.00025492915],"domain_scores_gemma":[0.9987292,0.0002216472,0.00046196743,0.00026249705,0.00022628761,0.00009839301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037616587,0.00016218926,0.00036115272,0.000031857464,0.00015673017,0.00017971174,0.0009027601,0.0000647684,0.00023168814],"category_scores_gemma":[0.00023663609,0.00010667243,0.000340794,0.0010167927,0.00023468582,0.00026022835,0.00026345265,0.00025942008,0.00014103997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030834955,0.00067864574,0.007802116,0.00018461251,0.00037446545,2.1820998e-7,0.006707852,0.0012225802,0.010444812,0.9542792,0.017130105,0.0011445442],"study_design_scores_gemma":[0.000635495,0.00037556328,0.020469699,0.00011466638,0.000113697555,0.000008935613,0.0011289408,0.8549865,0.007193264,0.11358408,0.0009233714,0.00046577593],"about_ca_topic_score_codex":0.000014157308,"about_ca_topic_score_gemma":3.1246137e-7,"teacher_disagreement_score":0.85376394,"about_ca_system_score_codex":0.00006989112,"about_ca_system_score_gemma":0.000042671192,"threshold_uncertainty_score":0.43499753},"labels":[],"label_agreement":null},{"id":"W2962704982","doi":"10.48550/arxiv.1402.5460","title":"Linear and strong convergence of algorithms involving averaged\\n nonexpansive operators","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":92,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Convergence (economics); Regular polygon; Fixed point; Applied mathematics; Algorithm; Point (geometry); Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.03462281631610042,"score_gpt":0.17320153875284247,"score_spread":0.13857872243674205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962704982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12056653,0.000009534456,0.8788888,0.000060589893,0.000060424474,0.000034984325,0.0000016948277,0.000028367112,0.00034907562],"genre_scores_gemma":[0.9906794,0.000046690056,0.008823207,0.00009159857,0.000017629325,9.490053e-8,0.0000022652384,0.0000031555364,0.0003360054],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993696,0.000069825845,0.000106473606,0.00028881544,0.000058870057,0.00010642039],"domain_scores_gemma":[0.99935555,0.00007390127,0.000082899845,0.00022040488,0.0001866017,0.00008062996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014165891,0.00007932316,0.00012361283,0.00011379014,0.00010386801,0.000024340687,0.00030415683,0.0000368265,0.000035805297],"category_scores_gemma":[0.00004019028,0.000084310384,0.000041630276,0.00053495663,0.000047989663,0.00045714466,0.00014962921,0.000058723628,0.000013464378],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000036446472,0.000029762998,0.013325001,0.000008642073,0.000040373412,0.000005649577,0.00026618212,0.25494832,0.00018076874,0.73091006,0.000021831082,0.0002597936],"study_design_scores_gemma":[0.00024145772,0.000030041994,0.002373456,0.0000066960793,0.000015284828,7.0894913e-7,0.00007101291,0.9953365,0.00038028625,0.001382838,0.00006460781,0.000097124255],"about_ca_topic_score_codex":0.00007297273,"about_ca_topic_score_gemma":0.000010065513,"teacher_disagreement_score":0.87011284,"about_ca_system_score_codex":0.000020431931,"about_ca_system_score_gemma":0.000035909612,"threshold_uncertainty_score":0.3438078},"labels":[],"label_agreement":null},{"id":"W2962957542","doi":"10.1007/s10107-016-1076-5","title":"On Douglas–Rachford operators that fail to be proximal mappings","year":2016,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Applied mathematics; Calculus (dental); Algebra over a field; Discrete mathematics; Pure mathematics; Medicine","score_opus":0.031589104429154816,"score_gpt":0.26139512255558955,"score_spread":0.22980601812643475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2962957542","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00402372,0.0000028728089,0.975769,0.017097497,0.00007418639,0.0003012892,0.0000011978913,0.00022950051,0.0025007366],"genre_scores_gemma":[0.5055436,9.3668535e-7,0.49007067,0.0020257514,0.000062456886,0.0001261002,0.0000017912998,0.00001667459,0.0021520194],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985345,0.000041008534,0.00025826955,0.00037496997,0.0004708241,0.00032044918],"domain_scores_gemma":[0.9990464,0.00021892502,0.000064225525,0.00038003788,0.00009059315,0.00019981423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037188936,0.00015517208,0.00019552466,0.00013688741,0.00014437857,0.00033399733,0.00053675094,0.000054214077,0.0002297293],"category_scores_gemma":[0.00031811662,0.00009330992,0.000098290475,0.00047279653,0.000030477304,0.0003758789,0.00021056102,0.00006595891,0.00058657845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058602186,0.00014811837,0.00007786941,0.00002196802,0.000030518117,0.000004238634,0.0008780597,0.00005072656,0.00009149356,0.9241803,0.0005610126,0.07394983],"study_design_scores_gemma":[0.0038668097,0.0016511437,0.0008314552,0.0010516709,0.00015615315,0.0000686794,0.0008108297,0.35195643,0.008173712,0.34821647,0.2799614,0.0032552404],"about_ca_topic_score_codex":0.0000022656866,"about_ca_topic_score_gemma":0.0000012133361,"teacher_disagreement_score":0.57596385,"about_ca_system_score_codex":0.000054372827,"about_ca_system_score_gemma":0.00002663729,"threshold_uncertainty_score":0.7539475},"labels":[],"label_agreement":null},{"id":"W2963283644","doi":"10.1007/s10013-013-0049-8","title":"The Method of Alternating Relaxed Projections for Two Nonconvex Sets","year":2013,"lang":"en","type":"article","venue":"Vietnam Journal of Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Convergence (economics); Projection (relational algebra); Constraint (computer-aided design); Set (abstract data type); Mathematical optimization; Order (exchange); Projection method; Algorithm; Dykstra's projection algorithm; Computer science; Geometry","score_opus":0.026774011674776353,"score_gpt":0.3279347272557826,"score_spread":0.30116071558100627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963283644","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012007148,0.00003939762,0.9954248,0.002607239,0.00017393296,0.00016819638,0.0000011890962,0.000008412988,0.00037611625],"genre_scores_gemma":[0.02242212,0.000024341392,0.97712964,0.00006610159,0.000058361024,0.000011399317,3.0054875e-7,0.0000061988003,0.000281561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988265,0.00006588639,0.00064357906,0.0000672412,0.00029512335,0.000101653735],"domain_scores_gemma":[0.99711686,0.00078379485,0.0009608551,0.00019465022,0.00089868065,0.000045130375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012524213,0.000069064605,0.00019099556,0.000103576436,0.00016955957,0.0001173052,0.0005123454,0.00002229839,0.000018090024],"category_scores_gemma":[0.00048059947,0.000041471932,0.00017330538,0.00029300305,0.000016811951,0.00032294856,0.000053429423,0.00008671809,0.0000057913066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012298801,0.00094020966,0.0004502631,0.0002967094,0.0012504703,0.0000026439507,0.011008112,0.07416841,0.0060396837,0.8165736,0.008638393,0.080619186],"study_design_scores_gemma":[0.0003402358,0.00006777254,0.000049555143,0.00003914496,0.00004288042,0.000055342272,0.000334299,0.9563183,0.0007621214,0.041533858,0.00040208787,0.000054390563],"about_ca_topic_score_codex":0.0000051919005,"about_ca_topic_score_gemma":0.0000022241206,"teacher_disagreement_score":0.88214993,"about_ca_system_score_codex":0.000021985528,"about_ca_system_score_gemma":0.00008047524,"threshold_uncertainty_score":0.16911763},"labels":[],"label_agreement":null},{"id":"W2963290245","doi":"10.1016/j.orl.2018.10.003","title":"On the asymptotic behaviour of the Aragón Artacho–Campoy algorithm","year":2018,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Saudi Arabian Cultural Bureau; Natural Sciences and Engineering Research Council of Canada; Saudi Arabia Cultural Bureau in London","keywords":"Hilbert space; Mathematics; Resolvent; Monotone polygon; Intersection (aeronautics); Generalization; Projection (relational algebra); Interpretation (philosophy); Algorithm; Regular polygon; Operator (biology); Pure mathematics; Discrete mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.039232365579928506,"score_gpt":0.3265307217875624,"score_spread":0.2872983562076339,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963290245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07805872,0.000007503732,0.72979707,0.18952988,0.00024500937,0.00041530878,0.0000122869915,0.000030484209,0.0019037542],"genre_scores_gemma":[0.9772897,0.0000039137485,0.016464127,0.004746348,0.00012500708,0.00004783448,0.000005137401,0.0000064116684,0.0013115214],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816304,0.00046695996,0.00017432957,0.00021714353,0.00077750714,0.00020100457],"domain_scores_gemma":[0.99848163,0.0002593632,0.00002378603,0.00071207096,0.00047818816,0.000044970355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009331749,0.000067860965,0.0000688465,0.00015556125,0.00091305247,0.0002872247,0.0010656294,0.000026021744,0.000259179],"category_scores_gemma":[0.00029759257,0.00003706061,0.00006997783,0.001274153,0.0002489287,0.00021753514,0.00020129432,0.00022610197,0.00018984952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052657506,0.00032557422,0.0010149941,0.0000033272559,0.000111271314,0.0000028666004,0.0020743597,0.09066581,0.006901285,0.8385921,0.055799622,0.004503498],"study_design_scores_gemma":[0.00013218525,0.00006009763,0.0072122808,0.00001314481,0.0000063218386,0.0000020104526,0.000044712553,0.9880514,0.0030138316,0.000553323,0.00083140854,0.00007928469],"about_ca_topic_score_codex":0.00014244486,"about_ca_topic_score_gemma":0.000070189104,"teacher_disagreement_score":0.89923096,"about_ca_system_score_codex":0.00004904591,"about_ca_system_score_gemma":0.000109967004,"threshold_uncertainty_score":0.70225537},"labels":[],"label_agreement":null},{"id":"W2963317235","doi":"10.1287/moor.2020.1099","title":"A Study of Convex Convex-Composite Functions via Infimal Convolution with Applications","year":2021,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Subderivative; Mathematics; Conic optimization; Convex analysis; Proper convex function; Convolution (computer science); Convex optimization; Convex function; Convexity; Applied mathematics; Mathematical optimization; Pure mathematics; Regular polygon; Mathematical analysis; Computer science; Geometry","score_opus":0.07620344229829072,"score_gpt":0.3650246803921398,"score_spread":0.2888212380938491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963317235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07043,0.00007652317,0.92633617,0.0004939771,0.00004417198,0.0016116556,0.000033459706,0.000047181788,0.0009268826],"genre_scores_gemma":[0.80494636,0.000023219174,0.19355047,0.000010287896,0.0000279869,0.00077416596,0.00017498506,0.000016612097,0.00047590592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965804,0.00036421718,0.0009123788,0.0005572098,0.0013538122,0.00023195484],"domain_scores_gemma":[0.99304885,0.00032831027,0.00023569856,0.0014751878,0.0048061856,0.00010577763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010741573,0.00021203101,0.0005877429,0.0008163424,0.00042268424,0.0003719041,0.0010255211,0.00015139539,0.00013671754],"category_scores_gemma":[0.000116154464,0.00019059808,0.00011681337,0.0018859949,0.00019553976,0.00030565777,0.0010615204,0.00056908873,0.000023456898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018238137,0.009233672,0.0012349302,0.00079887576,0.0012583989,0.0000069115877,0.019135404,0.8416525,0.0031562506,0.12293104,0.00014768542,0.00042609443],"study_design_scores_gemma":[0.000633835,0.00029053402,0.00089177385,0.00014354585,0.0001339513,0.0000114512895,0.0047494057,0.9907799,0.0009057995,0.0011815277,0.000031855125,0.0002464521],"about_ca_topic_score_codex":0.00038432883,"about_ca_topic_score_gemma":0.0002753478,"teacher_disagreement_score":0.7345164,"about_ca_system_score_codex":0.00009742075,"about_ca_system_score_gemma":0.0008338919,"threshold_uncertainty_score":0.7772364},"labels":[],"label_agreement":null},{"id":"W2963452913","doi":"10.1016/j.jfa.2012.07.013","title":"Fixed point properties for semigroups of nonlinear mappings and amenability","year":2012,"lang":"en","type":"article","venue":"Journal of Functional Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Alberta","funders":"","keywords":"Mathematics; Semigroup; Pure mathematics; Bicyclic semigroup; Banach space; Regular polygon; Fixed point; Cancellative semigroup; Fixed-point property; Fixed-point theorem; Bounded function; Discrete mathematics; Special classes of semigroups; Mathematical analysis","score_opus":0.02591067202407278,"score_gpt":0.22699803573024943,"score_spread":0.20108736370617664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963452913","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067039385,0.00031796182,0.92984635,0.0025768126,0.000109995344,0.000049287977,0.0000074858744,0.0000070976607,0.000045635526],"genre_scores_gemma":[0.9073008,0.000028554783,0.09203438,0.00020404668,0.00018838877,0.0000032236662,0.00000733197,0.0000030599938,0.00023026901],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987711,0.000054823726,0.0005540149,0.00012135671,0.00037596803,0.00012275571],"domain_scores_gemma":[0.99814516,0.00014777534,0.0005288856,0.00013791326,0.0009308106,0.00010947407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009954529,0.00008805869,0.0003350393,0.00044742975,0.00008369614,0.00004206529,0.00016179445,0.00003763905,0.00007068692],"category_scores_gemma":[0.00021941868,0.00006241053,0.00040634457,0.0009289756,0.00003852858,0.00072689686,0.000050648894,0.00006928004,0.0000011625906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008112735,0.0029910826,0.5221271,0.0003451829,0.02255789,0.000002100611,0.004763282,0.33221936,0.020189714,0.08004254,0.004716802,0.009233707],"study_design_scores_gemma":[0.0008055519,0.00019789943,0.15528852,0.000017833296,0.0020801874,0.00002890026,0.00025848972,0.8345831,0.0016979101,0.0020161192,0.0027972013,0.00022828163],"about_ca_topic_score_codex":0.000013296617,"about_ca_topic_score_gemma":0.0000028836732,"teacher_disagreement_score":0.84026134,"about_ca_system_score_codex":0.000041538846,"about_ca_system_score_gemma":0.000060512968,"threshold_uncertainty_score":0.25450277},"labels":[],"label_agreement":null},{"id":"W2963803091","doi":"10.1137/16m1082172","title":"The Resolvent Order: A Unification of the Orders by Zarantonello, by Loewner, and by Moreau","year":2017,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Division of Mathematical Sciences; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs; Pacific Institute for the Mathematical Sciences","keywords":"Mathematics; Resolvent; Regular polygon; Quotient; Convex function; Binary relation; Convex set; Connection (principal bundle); Pure mathematics; Bijection; Order (exchange); Combinatorics; Discrete mathematics; Convex optimization","score_opus":0.006123639609745902,"score_gpt":0.22927559750428694,"score_spread":0.22315195789454104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963803091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063347345,0.00049802125,0.9703787,0.02705865,0.0002516169,0.00015058901,0.000013588919,0.000016446127,0.0009989017],"genre_scores_gemma":[0.9205207,0.015809175,0.051666927,0.0021715667,0.00016125743,0.000027149707,0.0001131378,0.00005643658,0.009473608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868,0.00015370046,0.00035388794,0.00020399815,0.0004569475,0.00015145254],"domain_scores_gemma":[0.9981046,0.00008897091,0.00080489524,0.00055392814,0.00037129168,0.000076354416],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00054575293,0.0001223274,0.00012579592,0.000050370432,0.0015827068,0.0006937506,0.000929357,0.000061736995,0.000019188054],"category_scores_gemma":[0.0002527603,0.000072409384,0.0000648562,0.00027016932,0.00012797874,0.0005109535,0.00009704738,0.00016577574,0.0000020009634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006128811,0.00027841554,0.0008186886,0.000009101497,0.00015494152,6.582888e-7,0.00039179364,0.8310421,0.0012081178,0.0391082,0.11529179,0.011634871],"study_design_scores_gemma":[0.0005603001,0.00006205747,0.00036089413,0.000022866861,0.000026571091,0.000007998578,0.000033281205,0.9822543,0.0006295678,0.00054435775,0.015376789,0.000120996985],"about_ca_topic_score_codex":0.00004184159,"about_ca_topic_score_gemma":0.000004838136,"teacher_disagreement_score":0.91988724,"about_ca_system_score_codex":0.000045015644,"about_ca_system_score_gemma":0.00007404421,"threshold_uncertainty_score":0.9997171},"labels":[],"label_agreement":null},{"id":"W2963899645","doi":"10.1016/j.jat.2014.06.002","title":"The rate of linear convergence of the Douglas–Rachford algorithm for subspaces is the cosine of the Friedrichs angle","year":2014,"lang":"en","type":"article","venue":"Journal of Approximation Theory","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":112,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Linear subspace; Mathematics; Intersection (aeronautics); Rate of convergence; Hilbert space; Trigonometric functions; Projection (relational algebra); Convergence (economics); Regular polygon; Point (geometry); Algorithm; Orthographic projection; Applied mathematics; Mathematical analysis; Pure mathematics; Computer science; Geometry","score_opus":0.008027509989422685,"score_gpt":0.22775131151861702,"score_spread":0.21972380152919435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2963899645","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063763913,0.0001325811,0.9846731,0.008006112,0.00039204658,0.0002109941,0.000010904194,0.0000036881224,0.00019421877],"genre_scores_gemma":[0.937636,0.00013828378,0.060241524,0.00090045243,0.00020754483,0.00001049408,0.0000015427172,0.000011852146,0.00085230306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831796,0.0004908295,0.0006222106,0.00008537342,0.00038969674,0.0000939259],"domain_scores_gemma":[0.99560034,0.00114742,0.0017977078,0.00043053762,0.0010008889,0.000023075909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033913485,0.00008600912,0.00019648268,0.00005267372,0.00027731148,0.000037116355,0.0011970312,0.00003812083,0.000019106123],"category_scores_gemma":[0.0005134654,0.000034162433,0.0002763267,0.0005864841,0.00019845468,0.00023834538,0.000113486814,0.000111752444,7.34635e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009191228,0.0001774504,0.0005232332,0.00005668433,0.0003027268,4.7069705e-8,0.00482036,0.020168332,0.0015027184,0.9530323,0.0021693455,0.017154854],"study_design_scores_gemma":[0.00043694634,0.00008204914,0.0018083877,0.000046125744,0.000080743965,0.000003902555,0.0003947383,0.88604623,0.028585423,0.08009741,0.0023597595,0.000058313904],"about_ca_topic_score_codex":0.0000058861046,"about_ca_topic_score_gemma":0.000002554805,"teacher_disagreement_score":0.93125963,"about_ca_system_score_codex":0.000014233904,"about_ca_system_score_gemma":0.00010271987,"threshold_uncertainty_score":0.22244018},"labels":[],"label_agreement":null},{"id":"W2964062514","doi":"","title":"The Douglas-Rachford algorithm for a hyperplane and a doubleton","year":2019,"lang":"en","type":"article","venue":"NOVA (University of Newcastle Australia)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Australian Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Hyperplane; Mathematics; Regular polygon; Simple (philosophy); Set (abstract data type); Characterization (materials science); Point (geometry); Mathematical optimization; Ellipsoid; Focus (optics); Algorithm; Combinatorics; Computer science","score_opus":0.0627402764976373,"score_gpt":0.26773076757245096,"score_spread":0.20499049107481365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964062514","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044852976,0.000018781411,0.9479853,0.0053152055,0.0003035552,0.00026637764,0.000024596056,0.000037850663,0.001195379],"genre_scores_gemma":[0.41659528,0.00006250848,0.52353215,0.00015939574,0.000076441574,6.369441e-7,0.0000355369,0.000008827153,0.05952921],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994864,0.000014201352,0.00006940643,0.00017242618,0.00013637546,0.0001212206],"domain_scores_gemma":[0.9994711,0.00008887754,0.00008226059,0.00019876214,0.00011409774,0.00004485421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001284224,0.000059946316,0.000104728075,0.00006128552,0.0001499762,0.000047736652,0.00033611612,0.00004129976,0.000103100596],"category_scores_gemma":[0.0000045445913,0.00005532375,0.000059246162,0.00023969791,0.000038881444,0.00028548448,0.000095665106,0.00004647968,0.00004101978],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024269565,0.00038721593,0.0077006537,0.00012245083,0.0007921489,0.000022604681,0.0042573647,0.005202194,0.0020862182,0.42676076,0.03245313,0.51997256],"study_design_scores_gemma":[0.0027470728,0.00028121407,0.013115291,0.000018326264,0.00007544278,0.000026424364,0.00087242987,0.82111204,0.00011633124,0.0017885211,0.15953654,0.00031038877],"about_ca_topic_score_codex":0.00034266993,"about_ca_topic_score_gemma":0.00008122816,"teacher_disagreement_score":0.8159098,"about_ca_system_score_codex":0.000014143053,"about_ca_system_score_gemma":0.000024654068,"threshold_uncertainty_score":0.22560371},"labels":[],"label_agreement":null},{"id":"W2972261694","doi":"10.28924/2291-8639-17-2019-850","title":"Fixed Points of Non-Smooth Functions on Finite Dimensional Ordered Banach Spaces via Clarke Generalized Jacobian","year":2019,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Lipschitz continuity; Differentiable function; Jacobian matrix and determinant; Banach space; Coulomb friction; Pure mathematics; Mathematical analysis; Applied mathematics; Nonlinear system","score_opus":0.006529206335299741,"score_gpt":0.2478525266525748,"score_spread":0.24132332031727505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2972261694","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034495622,0.000051323546,0.95994276,0.0041630412,0.00014646363,0.00011088255,0.000041427385,0.000011145257,0.0010373462],"genre_scores_gemma":[0.9673151,0.0000712911,0.030447615,0.000535194,0.0001226273,0.000010684489,0.000075446114,0.0000070761703,0.001414971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982059,0.00006672,0.0006720345,0.0002615118,0.0006843092,0.000109518776],"domain_scores_gemma":[0.99747574,0.00024118068,0.0007474652,0.0002900993,0.0011350412,0.00011049066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036301118,0.0001354841,0.0003521411,0.0010144338,0.00009402146,0.00013388346,0.0005990954,0.000058374655,0.0004930493],"category_scores_gemma":[0.00003265743,0.00011333914,0.00036841928,0.0012623153,0.000037091922,0.0003223413,0.00009648392,0.00013262592,0.000031910025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023854064,0.0017463164,0.05973081,0.000023724693,0.012372377,0.000009241424,0.0004741361,0.7821985,0.009642709,0.09723132,0.0031683568,0.033163987],"study_design_scores_gemma":[0.0017073001,0.00017682694,0.069262214,0.000034502038,0.0007674909,0.000016899437,0.00008558761,0.9066087,0.00084701605,0.0027778035,0.017398907,0.00031672863],"about_ca_topic_score_codex":0.000054188495,"about_ca_topic_score_gemma":0.000034064044,"teacher_disagreement_score":0.9328195,"about_ca_system_score_codex":0.000042641735,"about_ca_system_score_gemma":0.00008273422,"threshold_uncertainty_score":0.5398544},"labels":[],"label_agreement":null},{"id":"W2974305816","doi":"10.1007/978-1-4419-6014-6_6","title":"Optimal Decentralized Control","year":2019,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; University of Waterloo; University of Toronto","funders":"","keywords":"Control theory (sociology); Servomechanism; Lyapunov function; Constant (computer programming); Optimal control; Controller (irrigation); Quadratic equation; Tracking error; Mathematics; Function (biology); Mathematical optimization; Control (management); Computer science; Engineering; Control engineering; Nonlinear system","score_opus":0.010503156867826964,"score_gpt":0.21386819178887043,"score_spread":0.20336503492104346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974305816","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.446548e-8,0.000047817728,0.5415323,0.00093905133,0.0001238346,0.00007670025,0.000005191033,0.00007304495,0.45720205],"genre_scores_gemma":[0.0003715832,0.00008693117,0.07433948,0.0017958414,0.00004725455,0.0000015841994,0.000030995197,0.00001312005,0.9233132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989577,0.000010751959,0.0002383285,0.0003454725,0.000309515,0.00013822573],"domain_scores_gemma":[0.9991276,0.000065020366,0.0001394388,0.00042754793,0.00016173946,0.00007859819],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008576187,0.00017915247,0.00028257465,0.00012964985,0.000041352276,0.00014314741,0.00054829166,0.00014942534,0.0052698688],"category_scores_gemma":[0.000007973844,0.00015114831,0.00020689383,0.00003856404,0.000012900205,0.00017035606,0.00008443197,0.0001067737,0.0022856821],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026561909,0.000005473141,0.000004015401,0.0000023646548,0.00010506121,0.00000203341,0.00000814361,0.00856773,8.9593857e-7,0.98619807,0.004490055,0.00061352755],"study_design_scores_gemma":[0.00068538275,0.000021037526,0.000017214536,0.000010727068,0.00005925864,0.0000034619432,3.852e-7,0.546499,0.0000031318193,0.005974724,0.446428,0.00029766528],"about_ca_topic_score_codex":0.0000043731757,"about_ca_topic_score_gemma":0.0000021265357,"teacher_disagreement_score":0.9802233,"about_ca_system_score_codex":0.000036296078,"about_ca_system_score_gemma":0.00014144556,"threshold_uncertainty_score":0.99849117},"labels":[],"label_agreement":null},{"id":"W2974445869","doi":"10.5539/jmr.v11n5p16","title":"Notes on Constraint Qualifications for Second-Order Optimality Conditions","year":2019,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Constraint (computer-aided design); Simple (philosophy); Order (exchange); Set (abstract data type); Point (geometry); Mathematical optimization; First order; Applied mathematics; Calculus (dental); Computer science; Geometry","score_opus":0.16346184395659605,"score_gpt":0.44731128542536647,"score_spread":0.28384944146877045,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974445869","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012797684,0.000013405762,0.96994984,0.011198618,0.000117054864,0.0002992253,0.000033624015,0.0000131062725,0.005577463],"genre_scores_gemma":[0.60246706,0.000010751913,0.39634898,0.00015482109,0.000059844653,0.000008803889,0.0000066104913,0.0000075842013,0.0009355348],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998374,0.00012990566,0.0004896368,0.00012708869,0.0007052874,0.00017410696],"domain_scores_gemma":[0.9945894,0.0027608033,0.0002732778,0.00032891182,0.0019478834,0.00009975099],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029074873,0.00006940012,0.00020110102,0.00040124598,0.0001584562,0.00019239816,0.00057457696,0.0000468871,0.0007825884],"category_scores_gemma":[0.00094353565,0.000052838623,0.00013330701,0.00052551384,0.00005461698,0.00025538568,0.000054549375,0.00023040139,0.00013181816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005194348,0.00044963992,0.00006385461,0.000063016385,0.000091574286,9.964175e-7,0.0006154622,0.0111980075,0.001064884,0.98376966,0.0025049555,0.00017275305],"study_design_scores_gemma":[0.0011661254,0.0005028513,0.0005622965,0.000114348084,0.000025818135,0.000048914524,0.0010048021,0.81679314,0.0024188468,0.1719125,0.005245022,0.00020529331],"about_ca_topic_score_codex":0.0000014802802,"about_ca_topic_score_gemma":0.0000017228296,"teacher_disagreement_score":0.81185716,"about_ca_system_score_codex":0.00006246335,"about_ca_system_score_gemma":0.0002976938,"threshold_uncertainty_score":0.8568794},"labels":[],"label_agreement":null},{"id":"W2980948063","doi":"10.23952/jnva.2.2018.3.01","title":"On the convergence of the forward-backward algorithm for null-point problems","year":2018,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Null (SQL); Monotone polygon; Mathematics; Convergence (economics); Algorithm; Point (geometry); Applied mathematics; Mathematical optimization; Computer science; Geometry","score_opus":0.013859472653262506,"score_gpt":0.24790958908963945,"score_spread":0.23405011643637694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2980948063","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017817414,0.000028173541,0.9881513,0.009638259,0.00016696726,0.00009566476,0.000035303907,0.00000394614,0.00009864982],"genre_scores_gemma":[0.57599473,0.000079019956,0.42048368,0.002146742,0.0006769098,0.00000975723,0.000014062377,0.000010355787,0.00058472157],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99857825,0.000101951235,0.0005425937,0.00015201209,0.0005197696,0.00010543991],"domain_scores_gemma":[0.9971459,0.000519589,0.0007062533,0.00022851933,0.001343762,0.000055990164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010264791,0.00009873255,0.00025640486,0.0002232552,0.00024089983,0.00007379909,0.0005453473,0.00004160529,0.00014125524],"category_scores_gemma":[0.00026452576,0.000050455634,0.0004505367,0.0013228112,0.00007445033,0.0002077412,0.00007546332,0.000095098076,0.000003295104],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009724622,0.00083863956,0.0067093396,0.000032968623,0.009771463,0.0000012277906,0.0021882611,0.13541614,0.0003771532,0.82814234,0.004737112,0.011688106],"study_design_scores_gemma":[0.00027327763,0.000132777,0.0066709677,0.000010636117,0.0005023151,0.0000046330656,0.000020839712,0.9766103,0.00018672703,0.014579232,0.00094175304,0.000066510445],"about_ca_topic_score_codex":0.000013866512,"about_ca_topic_score_gemma":0.000010960079,"teacher_disagreement_score":0.8411942,"about_ca_system_score_codex":0.00002379207,"about_ca_system_score_gemma":0.00013787983,"threshold_uncertainty_score":0.2057521},"labels":[],"label_agreement":null},{"id":"W2982551279","doi":"10.1090/proc/14859","title":"Maximally monotone operators with ranges whose closures are not convex and an answer to a recent question by Stephen Simons","year":2019,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Annotation; Monotone polygon; Computer science; Mathematics; Artificial intelligence; Geometry","score_opus":0.0068287948237744965,"score_gpt":0.2396109086589292,"score_spread":0.2327821138351547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2982551279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.938228,0.000013303519,0.049441967,0.011462656,0.000014250963,0.00040943697,0.0000093759245,0.00006578781,0.00035523262],"genre_scores_gemma":[0.8756154,0.000052472726,0.12172175,0.0023916725,0.000016177833,0.000025896727,0.0000010879437,0.000012697407,0.00016284233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989531,0.000016152324,0.00019980226,0.00029945173,0.0003762834,0.00015519519],"domain_scores_gemma":[0.99907744,0.000056016117,0.0002557738,0.00015254175,0.0003370367,0.000121182646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030797976,0.00013209225,0.00030039984,0.000024167386,0.000086377695,0.0001434425,0.00042891712,0.000028299093,0.00001933157],"category_scores_gemma":[0.000069561436,0.000082045415,0.00006808487,0.0006145994,0.00013456248,0.00032093708,0.00016731821,0.00008466974,0.000006661493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005104294,0.003021252,0.25756878,0.0010035016,0.0014906281,6.9529125e-7,0.041203577,0.0022973218,0.08824441,0.5724537,0.020207822,0.011997914],"study_design_scores_gemma":[0.003088568,0.002806442,0.11565737,0.0007032685,0.00051362393,0.000023358367,0.015900834,0.7941269,0.0354821,0.025764026,0.0037399041,0.002193588],"about_ca_topic_score_codex":0.000022916462,"about_ca_topic_score_gemma":0.0000010363176,"teacher_disagreement_score":0.7918296,"about_ca_system_score_codex":0.000032165706,"about_ca_system_score_gemma":0.000023079107,"threshold_uncertainty_score":0.33457148},"labels":[],"label_agreement":null},{"id":"W2984243829","doi":"10.1287/moor.2021.1211","title":"Second-Order Optimality Conditions for Nonconvex Set-Constrained Optimization Problems","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematics; Mathematical optimization; Tangent cone; Set (abstract data type); Order (exchange); Function (biology); Tangent; Regular polygon; Duality (order theory); Feasible region; Optimization problem; Computer science; Combinatorics","score_opus":0.09983874736307896,"score_gpt":0.38433441770961,"score_spread":0.28449567034653106,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984243829","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009120132,0.000015187079,0.9912513,0.0034284976,0.000057571175,0.0009249316,0.00022547778,0.000052782812,0.0031322788],"genre_scores_gemma":[0.18231791,0.000006794693,0.81232446,0.00009418214,0.00002534215,0.0011106669,0.000606491,0.000016100596,0.0034980648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979096,0.00023620074,0.0005397843,0.00030926938,0.00075190654,0.00025325362],"domain_scores_gemma":[0.9971527,0.00043181606,0.00008370264,0.000512613,0.0017404818,0.00007869669],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021413546,0.00010505296,0.00021032595,0.00047122064,0.0012403015,0.00023122436,0.000742707,0.000040696115,0.0024870476],"category_scores_gemma":[0.00042661378,0.000107230975,0.00009429582,0.0016589778,0.00010594443,0.00044932755,0.00033870945,0.00019693114,0.000010370562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013173002,0.00023159775,0.0000045962674,0.0000430044,0.00003442344,2.0855525e-7,0.0010541966,0.67397314,0.00050203747,0.323704,0.00042811525,0.000023366469],"study_design_scores_gemma":[0.0004151071,0.000109776236,0.0000098476585,0.000006766551,0.00001030204,0.0000062933614,0.00054015225,0.9914681,0.000241351,0.0062949536,0.0007845569,0.00011283908],"about_ca_topic_score_codex":0.00001806082,"about_ca_topic_score_gemma":0.000025142832,"teacher_disagreement_score":0.31749493,"about_ca_system_score_codex":0.00010050489,"about_ca_system_score_gemma":0.00048803363,"threshold_uncertainty_score":0.9984248},"labels":[],"label_agreement":null},{"id":"W2998099872","doi":"10.1186/s13663-021-00709-0","title":"On compositions of special cases of Lipschitz continuous operators","year":2021,"lang":"en","type":"article","venue":"Fixed Point Theory and Algorithms for Sciences and Engineering","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; Vetenskapsrådet","keywords":"Lipschitz continuity; Monotone polygon; Convergence (economics); Mathematical proof; Mathematics; Applied mathematics; Mathematical optimization; Algorithm; Computer science; Pure mathematics","score_opus":0.010695333740775194,"score_gpt":0.23339687408233897,"score_spread":0.22270154034156378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2998099872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108256064,0.00016685815,0.8907765,0.00024453216,0.00020259651,0.000054626555,0.00003242758,0.000015049559,0.00025134385],"genre_scores_gemma":[0.8952571,0.000041299514,0.10449722,0.000056436897,0.00007982608,0.000003664313,0.000004740794,0.0000024758135,0.000057243655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955064,0.000021642654,0.00013185923,0.00013954964,0.000081083446,0.00007519608],"domain_scores_gemma":[0.9994353,0.00036588914,0.000037981008,0.00006112777,0.00006389276,0.000035782276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003274431,0.000054383785,0.0001251155,0.000075697906,0.00010898972,0.000047160207,0.000086883476,0.000016429098,0.000014762779],"category_scores_gemma":[0.0000986891,0.000045450186,0.00003724112,0.00025047935,0.000053196058,0.0001445686,0.000041981726,0.000024422072,1.5693819e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043691916,0.000024519237,0.000022900187,0.00001584938,0.000015559319,0.00000146034,0.0002610859,0.022552585,0.00086727634,0.97396123,0.000013946492,0.0022591942],"study_design_scores_gemma":[0.00043076996,0.00033339803,0.0007340686,0.00008229318,0.000024591394,0.000041728585,0.00031832073,0.96563095,0.0142276,0.017714314,0.0002842785,0.00017767012],"about_ca_topic_score_codex":0.0000024512763,"about_ca_topic_score_gemma":6.242643e-7,"teacher_disagreement_score":0.9562469,"about_ca_system_score_codex":0.0000025241773,"about_ca_system_score_gemma":0.00002158125,"threshold_uncertainty_score":0.18534048},"labels":[],"label_agreement":null},{"id":"W3003915678","doi":"10.46298/jnsao-2020-6061","title":"Constructing a subgradient from directional derivatives for functions of two variables","year":2020,"lang":"en","type":"article","venue":"Journal of Nonsmooth Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subgradient method; Lipschitz continuity; Function (biology); Parametric statistics; Convex function; Interval (graph theory); Regular polygon; Bivariate analysis","score_opus":0.01664307879333738,"score_gpt":0.24246524238125655,"score_spread":0.22582216358791918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3003915678","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025593566,0.0001448325,0.99521995,0.00180087,0.00007598708,0.00005390279,0.00003759416,0.000010838605,0.000096648895],"genre_scores_gemma":[0.32554013,0.00004868039,0.6741217,0.00014160328,0.000089751724,0.0000019462657,0.000036323367,0.0000037529126,0.000016115986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883413,0.00007375881,0.00058948144,0.00018143054,0.00023619347,0.00008502097],"domain_scores_gemma":[0.9979252,0.0003136764,0.00080562785,0.00008817853,0.00075174076,0.000115529685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024921022,0.00009585017,0.0003645684,0.00038396896,0.00012551693,0.00009774493,0.0001625135,0.000033971737,0.00008897609],"category_scores_gemma":[0.00027286995,0.000081527585,0.00025568032,0.0016220344,0.000034724777,0.00048426806,0.000035629266,0.00006144792,2.0889681e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002866031,0.000047127123,0.014005427,0.000005685873,0.0011753655,5.8003343e-7,0.00029508665,0.97295725,0.000102347316,0.0097963745,0.000057820824,0.0015282906],"study_design_scores_gemma":[0.0006102919,0.0000802414,0.0016036733,0.000008537398,0.00091133,0.0000032060361,0.00013946909,0.99567056,0.0002455186,0.00054642174,0.000097519114,0.00008324223],"about_ca_topic_score_codex":0.000037123937,"about_ca_topic_score_gemma":0.000017108916,"teacher_disagreement_score":0.3229808,"about_ca_system_score_codex":0.000024179923,"about_ca_system_score_gemma":0.0000842983,"threshold_uncertainty_score":0.33245984},"labels":[],"label_agreement":null},{"id":"W3007500615","doi":"10.1007/s10957-020-01633-w","title":"Connectedness of Solution Sets for Weak Generalized Symmetric Ky Fan Inequality Problems via Addition-Invariant Sets","year":2020,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Social connectedness; Mathematics; Invariant (physics); Solution set; Inequality; Equivalence (formal languages); Pure mathematics; Combinatorics; Mathematical analysis; Set (abstract data type)","score_opus":0.02784079282427759,"score_gpt":0.2731701944249676,"score_spread":0.24532940160069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007500615","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00023039515,0.00012538773,0.9957877,0.0031656134,0.000046574958,0.00040314236,0.00006903178,0.00003105863,0.00014108658],"genre_scores_gemma":[0.6188967,0.00026894532,0.379402,0.00086029724,0.00016289268,0.00011956277,0.00023494556,0.000016873153,0.000037773098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984,0.00026555525,0.0007593828,0.00021835526,0.00023984548,0.00011688327],"domain_scores_gemma":[0.99726766,0.000446152,0.0009701232,0.00017461342,0.0009892938,0.00015217025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009898413,0.0001243091,0.0002898786,0.00024217552,0.00022456005,0.00008111228,0.00032109115,0.00007581693,0.00007436499],"category_scores_gemma":[0.00031808057,0.00011118766,0.0001270848,0.0012378703,0.000048426224,0.0005535798,0.000053784763,0.000089163295,0.0000016058837],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050334307,0.00013800683,0.000031845066,0.000052677584,0.00009735617,1.506958e-7,0.00034589082,0.49457473,0.0004662015,0.50093424,0.00018325915,0.0031253009],"study_design_scores_gemma":[0.0009924733,0.00011826006,0.00011701364,0.000017997623,0.0001128603,0.000013670774,0.00006352089,0.9603473,0.0006294287,0.03660696,0.00083530316,0.00014518558],"about_ca_topic_score_codex":0.0000024800095,"about_ca_topic_score_gemma":4.9550647e-7,"teacher_disagreement_score":0.6186663,"about_ca_system_score_codex":0.00002728155,"about_ca_system_score_gemma":0.0001078585,"threshold_uncertainty_score":0.45341012},"labels":[],"label_agreement":null},{"id":"W3019271106","doi":"10.48550/arxiv.2004.12582","title":"Fixed points of compositions of nonexpansive mappings: finitely many linear reflectors","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Fixed point; Mathematics; Mathematical analysis","score_opus":0.09751280367328052,"score_gpt":0.210920290889663,"score_spread":0.11340748721638247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3019271106","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022374889,0.000009943562,0.9747355,0.0007178805,0.00013503821,0.000146831,0.00008728635,0.00007542729,0.0017172142],"genre_scores_gemma":[0.96989554,0.00005170613,0.029485429,0.0001715933,0.000026854665,4.377544e-7,0.000087588516,0.0000086834425,0.00027216875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870336,0.00012335919,0.0003323802,0.0005749452,0.00012964262,0.00013632665],"domain_scores_gemma":[0.99807155,0.00013285886,0.0005466878,0.0005810097,0.00055848534,0.000109431254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009950678,0.00018739747,0.0004078728,0.0003741243,0.00007367659,0.000023007206,0.0010354046,0.0001529443,0.00008179836],"category_scores_gemma":[0.00005655156,0.00022180198,0.00029785314,0.0011971026,0.0000803021,0.00018878991,0.00090216997,0.000252002,0.0000343011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003113336,0.00015537863,0.0009104503,0.00011085179,0.00034738635,0.000030522388,0.0005748733,0.59326917,0.0005586622,0.40377524,0.00021646364,0.000019855097],"study_design_scores_gemma":[0.00035307114,0.00005770115,0.0017684855,0.000087593726,0.00013699292,8.1254024e-7,0.00006733494,0.9794733,0.00094442535,0.016799118,0.00008090246,0.0002302764],"about_ca_topic_score_codex":0.00010841258,"about_ca_topic_score_gemma":0.0000070491437,"teacher_disagreement_score":0.9475207,"about_ca_system_score_codex":0.00006260809,"about_ca_system_score_gemma":0.0001861646,"threshold_uncertainty_score":0.90448225},"labels":[],"label_agreement":null},{"id":"W3020603765","doi":"10.1007/s10107-020-01500-6","title":"Generalized monotone operators and their averaged resolvents","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":46,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Mathematics; Resolvent; Monotonic function; Monotone polygon; Operator (biology); Convergence (economics); Set (abstract data type); Scaling; Class (philosophy); Applied mathematics; Pure mathematics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.02656643460086841,"score_gpt":0.24427471870919693,"score_spread":0.21770828410832851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020603765","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009135985,0.00004456171,0.9853509,0.00477859,0.000014485597,0.00015209752,6.1542084e-7,0.00014942195,0.0003733284],"genre_scores_gemma":[0.55626404,0.0000058118535,0.4424324,0.0011579683,0.000036672245,0.000022344615,0.0000035004812,0.000008019138,0.0000692015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919254,0.00005257238,0.00021386234,0.0002434653,0.00014843929,0.00014913626],"domain_scores_gemma":[0.9995349,0.00006000394,0.000045243476,0.00014864895,0.00004405985,0.00016711926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016885581,0.0001031376,0.00017477645,0.000032401356,0.00011763315,0.00026052617,0.00024398495,0.000033839977,0.00006243225],"category_scores_gemma":[0.0001311722,0.00007500343,0.00005522288,0.0003321348,0.000022850087,0.00019825154,0.00016894565,0.000073291834,0.000044495573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009430123,0.00018383969,0.00025334512,0.00009381996,0.0001199728,0.00000931071,0.0066966573,0.00055598095,0.00056050223,0.91128397,0.00020085099,0.08003232],"study_design_scores_gemma":[0.00031698667,0.000034264613,0.000046792,0.000010023802,0.000009326686,0.0000032859891,0.00005647278,0.9831577,0.0004811057,0.013150865,0.0025978861,0.0001353023],"about_ca_topic_score_codex":0.0000018738284,"about_ca_topic_score_gemma":2.0445904e-7,"teacher_disagreement_score":0.9826017,"about_ca_system_score_codex":0.0000086047785,"about_ca_system_score_gemma":0.000012583858,"threshold_uncertainty_score":0.3058551},"labels":[],"label_agreement":null},{"id":"W3020649264","doi":"10.1080/10556788.2020.1751154","title":"Exponential augmented Lagrangian methods for equilibrium problems","year":2020,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Lagrangian; Applied mathematics; Augmented Lagrangian method; Exponential function; Mathematics; Mathematical optimization; Mathematical economics; Computer science; Mathematical analysis","score_opus":0.048229573428117165,"score_gpt":0.3630258536378706,"score_spread":0.3147962802097534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3020649264","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000020241205,0.00017050478,0.99232054,0.0056854533,0.00035331128,0.0005848153,0.000018468145,0.00067378744,0.00019112007],"genre_scores_gemma":[0.00006566908,0.000025819001,0.99666137,0.0023649887,0.0001544787,0.00013828526,0.00023004855,0.00003850892,0.00032083975],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971769,0.00088329805,0.0005824039,0.00074065255,0.00026948008,0.00034725634],"domain_scores_gemma":[0.9977443,0.00065658666,0.0003138903,0.00042545554,0.0005715029,0.00028822324],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012671509,0.00026381257,0.000383753,0.00017866988,0.00023968863,0.00034895452,0.0007930374,0.00014045277,0.00039434354],"category_scores_gemma":[0.0015741802,0.0002593888,0.0002719926,0.0015694186,0.000034129906,0.0008542847,0.00025314867,0.00012263632,0.000016122453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018144021,0.000055077453,0.000041736253,0.000049733553,0.000085869826,4.055838e-7,0.00065110676,0.91820496,0.0010782205,0.004691908,0.00074735185,0.07437549],"study_design_scores_gemma":[0.0007095484,0.00007950629,0.0000210819,0.000009896809,0.00007363155,0.0000017685338,0.000019967509,0.98050815,0.0016813973,0.0012353993,0.015353562,0.0003060971],"about_ca_topic_score_codex":0.0000060583716,"about_ca_topic_score_gemma":4.0700772e-7,"teacher_disagreement_score":0.074069396,"about_ca_system_score_codex":0.00004659566,"about_ca_system_score_gemma":0.00011736429,"threshold_uncertainty_score":0.9999858},"labels":[],"label_agreement":null},{"id":"W3036712626","doi":"10.28924/2291-8639-18-2020-337","title":"Absolute Value Variational Inequalities and Dynamical Systems","year":2020,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Variational inequality; Convergence (economics); Discretization; Absolute (philosophy); Applied mathematics; Value (mathematics); Projection (relational algebra); Inequality; Mathematical optimization; Mathematical analysis; Algorithm","score_opus":0.013423825456928506,"score_gpt":0.26154003832871936,"score_spread":0.24811621287179086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036712626","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001266997,0.00023156541,0.98453724,0.013587573,0.000053677584,0.000060266033,0.000024416533,0.000014891424,0.00022336941],"genre_scores_gemma":[0.96843874,0.00030236735,0.029806934,0.0009822577,0.00035530372,0.000013989045,0.000028928884,0.0000042086463,0.00006727769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870145,0.00006857443,0.00051033066,0.00018521694,0.00046204028,0.000072378156],"domain_scores_gemma":[0.99856293,0.00017084136,0.00038996004,0.00009408992,0.00062872,0.00015347631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032253168,0.000087057015,0.00022672988,0.00032705808,0.00008234247,0.00034736286,0.00043453992,0.000036561167,0.00002404601],"category_scores_gemma":[0.00006385964,0.00007524085,0.00013213328,0.0006736524,0.000034599703,0.00040481583,0.00011666923,0.0000917096,0.0000038152307],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008133515,0.00005483834,0.0029284325,0.0000054392053,0.0017922561,0.000003038324,0.0003476339,0.049439043,0.00009862584,0.9416531,0.000121676356,0.0035478112],"study_design_scores_gemma":[0.00025061966,0.000023503668,0.014018138,0.000004479083,0.00031613404,0.000023573133,0.00008506058,0.9746968,0.000008198656,0.0035509933,0.006923215,0.00009927945],"about_ca_topic_score_codex":0.00003536449,"about_ca_topic_score_gemma":0.000002743146,"teacher_disagreement_score":0.9671717,"about_ca_system_score_codex":0.000025642761,"about_ca_system_score_gemma":0.000054883807,"threshold_uncertainty_score":0.33496282},"labels":[],"label_agreement":null},{"id":"W3037083547","doi":"","title":"Accelerating Smooth Games by Manipulating Spectral Shapes.","year":2020,"lang":"en","type":"article","venue":"International Conference on Artificial Intelligence and Statistics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Monotone polygon; Eigenvalues and eigenvectors; Acceleration; Regularization (linguistics); Mathematical optimization; Gradient descent; Mathematics; Computer science; Applied mathematics; Algorithm; Geometry; Artificial intelligence","score_opus":0.1591484155708708,"score_gpt":0.3326122698059081,"score_spread":0.17346385423503727,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3037083547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043633918,0.000011296938,0.9806642,0.012356649,0.00014065814,0.000067946,0.00009038863,0.00006876467,0.006163765],"genre_scores_gemma":[0.8770982,0.000071168244,0.120288365,0.002221159,0.00012851594,0.0000052920645,0.00006033887,0.0000074133723,0.000119568926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985749,0.00005010974,0.0004151387,0.00039653268,0.0003908951,0.00017242077],"domain_scores_gemma":[0.9991835,0.0001850645,0.00014597908,0.00008871946,0.00025655646,0.00014018103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013211725,0.00015141275,0.00014848012,0.000071835064,0.00015060199,0.00066930155,0.00048037808,0.000043724864,0.00076929154],"category_scores_gemma":[0.00031463432,0.00014870096,0.00003395782,0.00020006287,0.0000517995,0.00032288753,0.00010747466,0.00015309542,0.00010832053],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013274377,0.000034073382,0.00010179204,0.0000032307444,0.000021978944,0.0000059538947,0.00043281485,0.0026940089,0.0007522607,0.92173666,0.0006557845,0.07354819],"study_design_scores_gemma":[0.00002706443,0.00008206126,0.00017850898,0.0000096199565,0.0000049575474,0.0000018064911,0.00020401848,0.94877297,0.0007047731,0.049452476,0.00039573613,0.00016601606],"about_ca_topic_score_codex":0.000031262498,"about_ca_topic_score_gemma":0.00001735881,"teacher_disagreement_score":0.94607896,"about_ca_system_score_codex":0.000025504996,"about_ca_system_score_gemma":0.000053098454,"threshold_uncertainty_score":0.8423203},"labels":[],"label_agreement":null},{"id":"W3040442494","doi":"10.1007/s10957-020-01706-w","title":"On Approximate Stationary Points of the Regularized Mathematical Program with Complementarity Constraints","year":2020,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Conseil Régional de Bretagne; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Stationary point; Mathematics; Theory of computation; Complementarity (molecular biology); Stationary sequence; Sequence (biology); Stationary solution; Applied mathematics; Regularization (linguistics); Convergence (economics); Stationary state; Mathematical optimization; Weak convergence; Constraint (computer-aided design); Stationary process; Mathematical analysis; Stochastic process; Algorithm; Computer science; Geometry","score_opus":0.01314037019398161,"score_gpt":0.2549632184526553,"score_spread":0.24182284825867367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040442494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031817897,0.00000749225,0.99264,0.006039394,0.000008328829,0.0003368872,0.00001023597,0.000017332377,0.00062215806],"genre_scores_gemma":[0.2628423,0.000015926798,0.73557645,0.0014518565,0.000028828606,0.000034549725,0.000013619547,0.000007385889,0.000029105202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989747,0.00016654558,0.0003922388,0.00012138754,0.00027852913,0.000066630615],"domain_scores_gemma":[0.99867105,0.00024812104,0.00051706284,0.00015943924,0.00032458233,0.000079757345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037330744,0.00007999308,0.00016089685,0.000053969132,0.00014502041,0.000054945278,0.00030865314,0.000024616571,0.00012529118],"category_scores_gemma":[0.00009005711,0.00004998959,0.000058716876,0.00046817094,0.00015244824,0.00020775295,0.000051842653,0.00009641964,0.0000011595413],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005366592,0.00019671168,0.000044960394,0.000016995875,0.000059150796,2.6706928e-7,0.00024759214,0.13871844,0.000026454436,0.85846895,0.000057748723,0.0021090708],"study_design_scores_gemma":[0.0014236683,0.00029799595,0.0004330155,0.000049977887,0.000116536066,0.000039732917,0.00025836457,0.81899583,0.0003972201,0.17751619,0.0003282215,0.00014326324],"about_ca_topic_score_codex":1.2597214e-7,"about_ca_topic_score_gemma":7.1003136e-8,"teacher_disagreement_score":0.6809527,"about_ca_system_score_codex":0.000011537103,"about_ca_system_score_gemma":0.0000748915,"threshold_uncertainty_score":0.20385163},"labels":[],"label_agreement":null},{"id":"W3041625766","doi":"","title":"New Optimality Conditions and Exact Penalty for Mathematical Programs with Switching Constraints","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Mathematical optimization; Property (philosophy); Computer science; Bridge (graph theory); Applied mathematics; Mathematics","score_opus":0.09215743896338909,"score_gpt":0.21692737399123924,"score_spread":0.12476993502785015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3041625766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005790259,0.0000036185754,0.9915356,0.0010689624,0.00003451458,0.0004111195,0.000023541626,0.0001402823,0.0009920766],"genre_scores_gemma":[0.83392185,0.000006952516,0.16559687,0.00011020638,0.000030359857,0.0000021535682,0.00006285087,0.000007808874,0.00026095437],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881643,0.000051967963,0.0001658209,0.0007045179,0.00008677609,0.00017447503],"domain_scores_gemma":[0.9989168,0.00012614233,0.00019276915,0.00034662648,0.00015727007,0.00026041266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013974206,0.00019471823,0.00028332006,0.00009423942,0.00017294563,0.00024264133,0.0004968712,0.0001074873,0.00008170604],"category_scores_gemma":[0.00003690187,0.00018713392,0.0001229212,0.00033173914,0.0000760142,0.0002845252,0.00043427566,0.00021783529,0.000012277655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018397694,0.000063876316,0.00092070363,0.00008329499,0.00019531933,0.000024288564,0.00017581806,0.057388,0.0000044216185,0.94052464,0.00008217289,0.00051905157],"study_design_scores_gemma":[0.0004949889,0.000052390304,0.0006372599,0.00005478709,0.00015127118,0.000007039954,0.000055272772,0.8454308,0.0000053078757,0.15283997,0.000041943957,0.00022896341],"about_ca_topic_score_codex":0.00002742521,"about_ca_topic_score_gemma":0.000011304069,"teacher_disagreement_score":0.82813156,"about_ca_system_score_codex":0.000052080333,"about_ca_system_score_gemma":0.00029538354,"threshold_uncertainty_score":0.76311},"labels":[],"label_agreement":null},{"id":"W3080542723","doi":"10.48550/arxiv.2008.09313","title":"On angles between convex sets in Hilbert spaces","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Intersection (aeronautics); Mathematics; Regular polygon; Generalization; Hilbert space; Dual cone and polar cone; Convex set; Convex cone; Pure mathematics; Convergence (economics); Cone (formal languages); Subderivative; Combinatorics; Convex optimization; Mathematical analysis; Geometry; Algorithm","score_opus":0.08458077870228417,"score_gpt":0.1983092770007363,"score_spread":0.11372849829845214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3080542723","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08770616,0.000014953602,0.8995994,0.0048156884,0.00021185189,0.00019853988,0.0000322387,0.00019353633,0.007227676],"genre_scores_gemma":[0.99665296,0.000026256532,0.0017911213,0.00047915222,0.0000399709,4.0008916e-7,0.000056269084,0.000007922665,0.0009459291],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864644,0.00012586644,0.00016173662,0.0007903326,0.00010459712,0.00017102854],"domain_scores_gemma":[0.9989694,0.00016985294,0.00016874033,0.00048192698,0.000081088176,0.00012903208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011466454,0.00019779253,0.0003076357,0.0003353393,0.000064746324,0.000122013036,0.0010311003,0.0001697179,0.00009675488],"category_scores_gemma":[0.000047848527,0.00022294007,0.00014156813,0.0008869447,0.000033659184,0.00021293978,0.00082994456,0.00033529426,0.00022133709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008517069,0.000046619527,0.019620603,0.000018962217,0.00008420159,0.00008459592,0.00019216134,0.43351015,0.0000011560119,0.545651,0.0006491939,0.0001328209],"study_design_scores_gemma":[0.0003353703,0.000030508578,0.016789507,0.000042224914,0.000043624404,2.4425842e-7,0.000022832723,0.870421,0.000018430943,0.111601315,0.00038881946,0.00030614127],"about_ca_topic_score_codex":0.00017380982,"about_ca_topic_score_gemma":0.000050039354,"teacher_disagreement_score":0.9089468,"about_ca_system_score_codex":0.00012245697,"about_ca_system_score_gemma":0.00012334956,"threshold_uncertainty_score":0.90912324},"labels":[],"label_agreement":null},{"id":"W3087180137","doi":"10.23952/jnva.3.2019.2.08","title":"Convergence theorems of common solutions for fixed point, variational inequality and equilibrium problems","year":2019,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational inequality; Convergence (economics); Mathematics; Mathematical economics; Applied mathematics; Fixed point; Inequality; Fixed-point theorem; Mathematical analysis; Economics","score_opus":0.02209287738500961,"score_gpt":0.2681275900292804,"score_spread":0.24603471264427076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087180137","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032300368,0.00014541834,0.9642511,0.0028241526,0.00012526299,0.00013605818,0.00011535817,0.000009011541,0.00009326808],"genre_scores_gemma":[0.8617104,0.0000641349,0.13770775,0.0001991473,0.00011264634,0.0000036998388,0.00008871221,0.0000056140984,0.00010787805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981276,0.00013897839,0.0008678533,0.00023118638,0.00047343562,0.00016096162],"domain_scores_gemma":[0.9970254,0.0006790233,0.00091057445,0.00018762444,0.001089509,0.00010787453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017041463,0.00013024356,0.00048918545,0.00049624604,0.00011285391,0.00008858115,0.00028218355,0.00007366888,0.00014750088],"category_scores_gemma":[0.00019226475,0.0001074989,0.000303466,0.0010501241,0.00004386664,0.000673417,0.00012359978,0.00010403574,0.0000019257973],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008359277,0.00049661536,0.08817571,0.00008656586,0.002991298,6.630672e-7,0.00068938336,0.23325317,0.0013966725,0.6722141,0.00011598937,0.00049624813],"study_design_scores_gemma":[0.00067767943,0.00011525882,0.08234623,0.00001109149,0.0005158703,0.000008645777,0.000024610588,0.8953979,0.00003153083,0.020574637,0.00018130278,0.000115224255],"about_ca_topic_score_codex":0.0000422407,"about_ca_topic_score_gemma":0.000013100063,"teacher_disagreement_score":0.8294101,"about_ca_system_score_codex":0.00002844844,"about_ca_system_score_gemma":0.00017280555,"threshold_uncertainty_score":0.43836778},"labels":[],"label_agreement":null},{"id":"W3087736399","doi":"10.1080/00029890.2021.1962151","title":"Edelstein’s Astonishing Affine Isometry","year":2021,"lang":"en","type":"preprint","venue":"American Mathematical Monthly","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Okanagan University College; University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sketch; Isometry (Riemannian geometry); Mathematics; Affine transformation; Norm (philosophy); Infinity; Monotone polygon; Connection (principal bundle); Pure mathematics; Operator (biology); Mathematical analysis; Algorithm; Geometry; Law","score_opus":0.013460461695822956,"score_gpt":0.2549795204829408,"score_spread":0.24151905878711785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3087736399","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013798638,0.0001284284,0.9364208,0.005714025,0.00020689201,0.00015488258,0.000012348694,0.00028299837,0.055699755],"genre_scores_gemma":[0.3319118,0.000021543647,0.66557235,0.0012889759,0.00014295032,0.000052672676,0.00006461791,0.000029154338,0.00091597444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99733186,0.00015712132,0.00062047044,0.00081396464,0.0007262285,0.0003503477],"domain_scores_gemma":[0.9974684,0.0003523148,0.00045975117,0.0012231733,0.00026961436,0.00022672732],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003354403,0.00033998987,0.00079473236,0.00025343354,0.000118306336,0.0009281539,0.0013685246,0.00012794435,0.0004611764],"category_scores_gemma":[0.00047428478,0.0003164367,0.0003739427,0.001080848,0.000120686746,0.00030481015,0.0019114122,0.0005137475,0.00014150077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008668487,0.0013237743,0.00021371363,0.00043772347,0.0009839681,0.00013518959,0.0033539333,0.10955828,0.00013626671,0.8598277,0.0027996837,0.021221107],"study_design_scores_gemma":[0.00012612047,0.00004405324,0.00056198164,0.0001440547,0.00008842943,0.000006508648,0.00024639783,0.92099226,0.000075557655,0.07669012,0.00049858517,0.0005259296],"about_ca_topic_score_codex":0.00016735497,"about_ca_topic_score_gemma":0.000013250843,"teacher_disagreement_score":0.811434,"about_ca_system_score_codex":0.00011994729,"about_ca_system_score_gemma":0.00022337656,"threshold_uncertainty_score":0.9999288},"labels":[],"label_agreement":null},{"id":"W3088059505","doi":"10.1137/19m1281538","title":"On the Behavior of the Douglas--Rachford Algorithm for Minimizing a Convex Function Subject to a Linear Constraint","year":2020,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Constraint (computer-aided design); Regular polygon; Convex optimization; Mathematical optimization; Subject (documents); Function (biology); Convex function; Algorithm; Computer science","score_opus":0.027359444982844986,"score_gpt":0.25164085193651253,"score_spread":0.22428140695366755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3088059505","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005219783,0.000008792655,0.98412466,0.014065014,0.00047869884,0.0005519317,0.000014443415,0.000028520191,0.00020594255],"genre_scores_gemma":[0.32579362,0.000037070717,0.6573502,0.015774863,0.0006475955,0.00014907197,0.000022363467,0.000035583762,0.00018963883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986134,0.0001502105,0.00041663705,0.00022263658,0.00044231862,0.00015476391],"domain_scores_gemma":[0.998549,0.0002857814,0.00037581846,0.00022095763,0.00045288893,0.00011557933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043578897,0.0001377154,0.00017632329,0.00011581877,0.00042519715,0.00016298739,0.0004886907,0.000057133762,0.00010378623],"category_scores_gemma":[0.0003664068,0.00008259677,0.00021153173,0.00078153587,0.000031403044,0.00020822625,0.00006051902,0.00019810372,0.00000920295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053881322,0.00007980177,0.000039687144,0.000003362467,0.00004689675,7.250347e-7,0.0003590041,0.96947706,0.000049471193,0.020546814,0.00060649385,0.008736808],"study_design_scores_gemma":[0.0005154744,0.00045164453,0.00014485927,0.00002828638,0.00005633913,0.000008370933,0.000085872794,0.9970782,0.00042030992,0.0001491821,0.0009596859,0.000101802594],"about_ca_topic_score_codex":0.0000017558252,"about_ca_topic_score_gemma":7.257055e-7,"teacher_disagreement_score":0.32677448,"about_ca_system_score_codex":0.000051336207,"about_ca_system_score_gemma":0.00011041157,"threshold_uncertainty_score":0.33681986},"labels":[],"label_agreement":null},{"id":"W3093131559","doi":"10.23952/jnva.4.2020.2.03","title":"Evenly convex sets, and evenly quasiconvex functions, revisited","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund","keywords":"Quasiconvex function; Regular polygon; Mathematics; Combinatorics; Convex set; Convex optimization; Geometry","score_opus":0.01562062973891715,"score_gpt":0.2448090607348982,"score_spread":0.22918843099598105,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093131559","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005213279,0.0005697835,0.9700106,0.023878464,0.000062790175,0.00004917486,0.00004393961,0.000022187518,0.00014981053],"genre_scores_gemma":[0.7842738,0.00057498575,0.20880668,0.0053780866,0.00057449,0.0000019263086,0.000116217736,0.000012338065,0.00026146113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983095,0.00013835757,0.0006613403,0.00026846823,0.00050039723,0.00012192694],"domain_scores_gemma":[0.9981509,0.00021772968,0.0005413565,0.00013160276,0.00068861066,0.00026982947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005417327,0.00014457502,0.00045824915,0.00043804123,0.00016758728,0.00020879947,0.00024357227,0.0000681655,0.00021452214],"category_scores_gemma":[0.00022993825,0.00011993017,0.00026741074,0.0018906663,0.00002773064,0.0006433079,0.00008994499,0.00017830337,0.000012335236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006315526,0.0015356187,0.3646127,0.00028254843,0.038186792,0.00015262024,0.007041667,0.16106181,0.0012868337,0.36812496,0.0153495995,0.041733302],"study_design_scores_gemma":[0.00056542055,0.00010667621,0.059423745,0.000007278165,0.0011015773,0.000028436443,0.000053211726,0.93263406,0.000006431536,0.0008010155,0.0051190257,0.00015310677],"about_ca_topic_score_codex":0.000012216742,"about_ca_topic_score_gemma":0.000002747538,"teacher_disagreement_score":0.77906054,"about_ca_system_score_codex":0.000021825768,"about_ca_system_score_gemma":0.0001371255,"threshold_uncertainty_score":0.48906106},"labels":[],"label_agreement":null},{"id":"W3099067152","doi":"","title":"The NC-proximal average for multiple functions","year":2014,"lang":"en","type":"article","venue":"Research Online (University of Wollongong)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Bounded function; Mathematical proof; Discontinuity (linguistics); Function (biology); Mathematics; Computational intelligence; Computer science; Algorithm; Discrete mathematics; Combinatorics; Applied mathematics; Mathematical analysis; Artificial intelligence; Geometry","score_opus":0.046803948913777836,"score_gpt":0.29602437627832856,"score_spread":0.24922042736455072,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099067152","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009695689,0.00001824557,0.9748968,0.014181681,0.00006005787,0.00018302724,0.00003299768,0.000041501316,0.0008899852],"genre_scores_gemma":[0.8635959,0.00007388341,0.11378587,0.000060188406,0.00012073482,0.0000017716495,0.00007322045,0.0000074747554,0.022280945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988585,0.0001747839,0.00008955542,0.00022399108,0.00041382448,0.00023934654],"domain_scores_gemma":[0.9977755,0.0009758191,0.000057572204,0.0003790417,0.00071702246,0.000095032236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010774523,0.00005577302,0.000101753634,0.00019550588,0.0010902329,0.000061165694,0.00086165976,0.000042008873,0.00003559789],"category_scores_gemma":[0.0004713434,0.000049671686,0.00012054369,0.00078365306,0.00012462314,0.0002802457,0.00028360644,0.00013934661,0.000029283729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003598365,0.0012833592,0.0080523295,0.0000842479,0.0005166285,0.000006397412,0.002435853,0.04036408,0.0015436967,0.7614074,0.041500904,0.14244531],"study_design_scores_gemma":[0.00051301357,0.000089667614,0.007341021,0.0000042736447,0.0000064531414,5.605375e-7,0.00030028037,0.9154378,0.00001677207,0.0013648766,0.074865565,0.00005971957],"about_ca_topic_score_codex":0.00021447048,"about_ca_topic_score_gemma":0.0008183876,"teacher_disagreement_score":0.87507373,"about_ca_system_score_codex":0.000041311298,"about_ca_system_score_gemma":0.00011071556,"threshold_uncertainty_score":0.83853006},"labels":[],"label_agreement":null},{"id":"W3099707780","doi":"10.1007/s11081-020-09578-9","title":"A decomposition method for a class of convex generalized Nash equilibrium problems","year":2020,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Nash equilibrium; Convexity; Mathematical optimization; Class (philosophy); Decomposition; Extension (predicate logic); Convergence (economics); Computer science; Constraint (computer-aided design); Set (abstract data type); Regular polygon; Decomposition method (queueing theory); Mathematics; Applied mathematics; Discrete mathematics","score_opus":0.015587014739055402,"score_gpt":0.24932601145714306,"score_spread":0.23373899671808765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3099707780","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017893841,0.00003892615,0.99733084,0.0021019469,0.00004354645,0.00013990063,0.0000046533173,0.00008804182,0.00007320696],"genre_scores_gemma":[0.037038803,0.000023380231,0.96245193,0.00036949545,0.000030544514,0.00002041962,0.000036507387,0.000008474061,0.000020421474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994367,0.000016943275,0.00019840903,0.0001732999,0.000087868495,0.00008681589],"domain_scores_gemma":[0.99961776,0.000049418002,0.00006971454,0.000074107054,0.00011448534,0.00007451962],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010224807,0.000077260745,0.00014619388,0.00007154249,0.000028395742,0.00005828759,0.00010695433,0.000037121677,0.000016683342],"category_scores_gemma":[0.00004180337,0.00007908126,0.000046333837,0.0003299544,0.000004526591,0.00024198172,0.000041592706,0.000027217462,5.1793666e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032443181,0.000007893459,0.000014607821,0.000048799455,0.00002104698,7.664141e-8,0.00021051256,0.97428024,0.0044537485,0.02066373,0.000052865722,0.00024323567],"study_design_scores_gemma":[0.0004449638,0.0000319885,0.0000262615,0.000008314614,0.000014588792,0.0000012421904,0.000003885238,0.9976021,0.001047694,0.00004115183,0.0006892101,0.00008861603],"about_ca_topic_score_codex":0.0000025357563,"about_ca_topic_score_gemma":1.3465058e-7,"teacher_disagreement_score":0.036859863,"about_ca_system_score_codex":0.000008477462,"about_ca_system_score_gemma":0.000015250198,"threshold_uncertainty_score":0.32248405},"labels":[],"label_agreement":null},{"id":"W3104930806","doi":"","title":"On the finite convergence of the Douglas-Rachford algorithm for solving (not necessarily convex) feasibility problems in Euclidean spaces","year":2017,"lang":"en","type":"article","venue":"Figshare","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematics; Convergence (economics); Euclidean geometry; Regular polygon; Algorithm; Task (project management); Mathematical optimization","score_opus":0.08094162861436088,"score_gpt":0.290745497745842,"score_spread":0.20980386913148114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104930806","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013690692,0.0005006157,0.62149733,0.1122182,0.0045709508,0.013962817,0.21861635,0.0005831059,0.0143599035],"genre_scores_gemma":[0.9932877,0.000003558029,0.00433807,0.00085038884,0.000057355188,0.00016389438,0.0007009177,0.000008616087,0.0005895137],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990286,0.00005797868,0.00023253357,0.00026920074,0.0002560373,0.00015563308],"domain_scores_gemma":[0.9977682,0.0007219245,0.0003985114,0.0008413322,0.00023930044,0.000030689018],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00030553975,0.000103283826,0.00014619403,0.00003832324,0.00042978761,0.00029641765,0.0015839568,0.000048652513,0.002673355],"category_scores_gemma":[0.0024684293,0.000061540886,0.00011557111,0.00018932433,0.000023660457,0.00036191047,0.00035132896,0.000110979396,0.0000431882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011133591,0.0017279846,0.058600113,0.0015623387,0.0006311184,0.000010153204,0.014538205,0.29472923,0.00032558053,0.25892794,0.29908532,0.06975067],"study_design_scores_gemma":[0.00026565083,0.000026048558,0.028260024,0.00027736276,0.000004860451,2.697714e-7,0.00001888032,0.9651509,0.00044770574,0.0033211487,0.0021229486,0.00010419242],"about_ca_topic_score_codex":0.000059023103,"about_ca_topic_score_gemma":0.00008842737,"teacher_disagreement_score":0.979597,"about_ca_system_score_codex":0.000025815689,"about_ca_system_score_gemma":0.00009605418,"threshold_uncertainty_score":0.9982383},"labels":[],"label_agreement":null},{"id":"W3118572724","doi":"10.28924/2291-8639-18-2020-784","title":"Sufficiency and Duality for Interval-Valued Optimization Problems with Vanishing Constraints Using Weak Constraint Qualifications","year":2020,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"King Fahd University of Petroleum and Minerals","keywords":"Mathematics; Duality (order theory); Strong duality; Convexity; Wolfe duality; Weak duality; Interval (graph theory); Duality gap; Constraint (computer-aided design); Mathematical optimization; Perturbation function; Dual (grammatical number); Optimization problem; Class (philosophy); Applied mathematics; Mathematical economics; Pure mathematics; Convex analysis; Convex optimization; Combinatorics; Regular polygon; Computer science; Geometry","score_opus":0.037262814084489594,"score_gpt":0.3026263710010726,"score_spread":0.265363556916583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118572724","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013704676,0.00007424024,0.9913836,0.006699453,0.000023452152,0.00019543892,0.000049322847,0.00001940321,0.00018458492],"genre_scores_gemma":[0.68951637,0.000089617155,0.3098656,0.00038188815,0.00008837593,0.000011290424,0.00003384199,0.0000054883985,0.000007530721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985514,0.00006102251,0.00063205516,0.00028531073,0.00036612633,0.000104053026],"domain_scores_gemma":[0.99765015,0.00014970165,0.00069497485,0.00012697086,0.001215653,0.0001625698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045359004,0.00012090504,0.00027461076,0.00031949882,0.00017914506,0.00039850327,0.000420447,0.000040225532,0.00003369218],"category_scores_gemma":[0.00008264956,0.000101199636,0.00014434177,0.0008671712,0.00013953385,0.00053172116,0.00007261879,0.000092654154,4.2530814e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028983464,0.00022583171,0.0036480632,0.000021961923,0.0024155143,0.0000014696211,0.0011942714,0.7374274,0.0005875875,0.24518092,0.000043120846,0.009224839],"study_design_scores_gemma":[0.00051938597,0.00006581301,0.00071701326,0.00001617043,0.0005670506,0.000034314504,0.00039750917,0.9959143,0.000070827795,0.00084905326,0.0007107183,0.00013786796],"about_ca_topic_score_codex":0.00001357363,"about_ca_topic_score_gemma":0.000006193331,"teacher_disagreement_score":0.68814594,"about_ca_system_score_codex":0.000038139715,"about_ca_system_score_gemma":0.00012360416,"threshold_uncertainty_score":0.41268015},"labels":[],"label_agreement":null},{"id":"W3119935975","doi":"10.23952/asvao.8.2026.1.06","title":"Sufficient optimality conditions for a separable product quasiconcave programming","year":2025,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quasiconvex function; Separable space; Mathematics; Differentiable function; Function (biology); Product (mathematics); Mathematical optimization; Subderivative; Pure mathematics; Regular polygon; Convex optimization; Mathematical analysis","score_opus":0.012695217489176461,"score_gpt":0.2837351862185424,"score_spread":0.2710399687293659,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3119935975","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078973337,0.000079579164,0.9959433,0.0010591077,0.000058919566,0.0006247515,0.00002506561,0.00015698098,0.0012625577],"genre_scores_gemma":[0.4635127,0.000038384907,0.53432167,0.00052627164,0.00003005053,0.00028748548,0.00073332095,0.000008729246,0.0005414049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981424,0.000068842026,0.0004993622,0.0007535378,0.00025560122,0.00028024422],"domain_scores_gemma":[0.99867564,0.00012297907,0.00023426597,0.00046539403,0.0004091837,0.00009254728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006355661,0.00020776891,0.00040771213,0.00070358306,0.0006094426,0.00046834955,0.00029599402,0.00007760928,0.00004105961],"category_scores_gemma":[0.00007854109,0.00019867721,0.0002138815,0.0040240525,0.000057709018,0.0002905666,0.00010525361,0.00007766569,0.0000027998597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009033027,0.00010575568,0.00031441628,0.000017726,0.0005747775,1.3233526e-7,0.00017636344,0.746889,0.0000410234,0.25051117,0.00015334247,0.0012072432],"study_design_scores_gemma":[0.0004861717,0.00001881279,0.0007115478,0.0000058454807,0.0010359008,3.3351574e-7,0.000110648456,0.9954399,0.00024285653,0.0011971764,0.0005375659,0.00021324023],"about_ca_topic_score_codex":0.000040768777,"about_ca_topic_score_gemma":0.000017945826,"teacher_disagreement_score":0.46272296,"about_ca_system_score_codex":0.00006835459,"about_ca_system_score_gemma":0.000112314214,"threshold_uncertainty_score":0.81018215},"labels":[],"label_agreement":null},{"id":"W3120546093","doi":"10.2478/auom-2020-0042","title":"The modified Ishikawa iteration process with errors in CAT(0) spaces","year":2020,"lang":"en","type":"article","venue":"Analele Universităţii \"Ovidius\" Constanţa. Seria Matematică","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Etobicoke General Hospital","funders":"","keywords":"Convergence (economics); Mathematics; Applied mathematics; Process (computing); Type (biology); Mathematical optimization; Computer science; Economics","score_opus":0.01199590452213116,"score_gpt":0.20852555712111145,"score_spread":0.1965296525989803,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120546093","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15830599,0.00012264047,0.7822227,0.04527704,0.00013835661,0.0010089844,0.000024885372,0.0003775421,0.012521861],"genre_scores_gemma":[0.98615104,0.00004784569,0.012261409,0.0009150405,0.000026463336,0.000009914443,0.000027495555,0.000012839678,0.00054793176],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820024,0.0001910694,0.00039372983,0.00045002936,0.00046313222,0.00030181571],"domain_scores_gemma":[0.99861765,0.00019102756,0.0003221681,0.0003743672,0.0003285334,0.00016623814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029214274,0.00022769476,0.00030865576,0.0001806918,0.0004223582,0.0005780733,0.00084338896,0.00006986046,0.00008198314],"category_scores_gemma":[0.00008713807,0.00017024219,0.000069591624,0.0018495596,0.00009635501,0.0015308355,0.00012182846,0.00012415448,0.000051618692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002834721,0.00018951703,0.0043230024,0.00039358484,0.00040843996,0.00017557175,0.018968953,0.31830835,0.0005222706,0.6539834,0.0019331826,0.00051025354],"study_design_scores_gemma":[0.0009274417,0.000097633485,0.00051054003,0.00008112934,0.0000650033,0.00001010861,0.0052724723,0.9906325,0.00036277846,0.0009587468,0.00072898925,0.00035269643],"about_ca_topic_score_codex":0.00009064858,"about_ca_topic_score_gemma":0.00036649287,"teacher_disagreement_score":0.8278451,"about_ca_system_score_codex":0.000101328165,"about_ca_system_score_gemma":0.00029930068,"threshold_uncertainty_score":0.6942275},"labels":[],"label_agreement":null},{"id":"W3121804175","doi":"10.1515/jaa-2020-2042","title":"Lagrangian multipliers for generalized affine and generalized convex vector optimization problems of set-valued maps","year":2021,"lang":"en","type":"article","venue":"Journal of Applied Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saskatchewan Polytechnic","funders":"","keywords":"Mathematics; Affine transformation; Minkowski addition; Set (abstract data type); Regular polygon; Type (biology); Affine combination; Applied mathematics; Mathematical optimization; Pure mathematics; Computer science; Geometry","score_opus":0.014726527249160579,"score_gpt":0.24253505105234432,"score_spread":0.22780852380318375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121804175","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054503083,0.00021738316,0.992763,0.0011399424,0.00006697877,0.00013059305,0.00002400731,0.000015804075,0.00019197371],"genre_scores_gemma":[0.26064205,0.00026692013,0.7383548,0.00028810342,0.00009438031,0.000011015656,0.00012700084,0.000012823182,0.00020286973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982067,0.00007745013,0.00084043597,0.00028239583,0.00042470515,0.00016832394],"domain_scores_gemma":[0.99759454,0.000105988074,0.0009124046,0.00026187752,0.0009871135,0.00013808471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057883555,0.00016168659,0.0007194308,0.00061688997,0.000109376706,0.00013139092,0.00029965446,0.000085866646,0.00012149427],"category_scores_gemma":[0.00007130037,0.00013947692,0.00046722876,0.002205043,0.000034507106,0.00022255236,0.00006748082,0.000081348626,6.4786184e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000612584,0.00009367656,0.0001726739,0.00003673952,0.0023520433,0.000002271789,0.000477137,0.9642287,0.0052662664,0.026555624,0.00019950508,0.0005541257],"study_design_scores_gemma":[0.002315664,0.000037392194,0.00026771548,0.00000925667,0.0019514993,0.000005333769,0.000080718215,0.9907889,0.0029579964,0.0010061326,0.00041437408,0.00016505968],"about_ca_topic_score_codex":0.000013681637,"about_ca_topic_score_gemma":0.000018794592,"teacher_disagreement_score":0.25519174,"about_ca_system_score_codex":0.000041985546,"about_ca_system_score_gemma":0.0001314382,"threshold_uncertainty_score":0.56877035},"labels":[],"label_agreement":null},{"id":"W3122334716","doi":"10.48550/arxiv.2101.05857","title":"Attouch-Théra Duality, Generalized Cycles and Gap Vectors","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Duality (order theory); Duality gap; Mathematics; Dual (grammatical number); Point (geometry); Pure mathematics; Applied mathematics; Combinatorics; Mathematical optimization; Optimization problem; Geometry","score_opus":0.0943949846181626,"score_gpt":0.20442342537578065,"score_spread":0.11002844075761804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122334716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25093183,0.00010261063,0.74643886,0.00056675175,0.00028699942,0.00009854477,0.000010816197,0.00014713952,0.0014164498],"genre_scores_gemma":[0.98749673,0.00050753955,0.009713634,0.00026486363,0.000059555103,5.8827214e-7,0.00006500592,0.000010081921,0.0018819894],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983544,0.0002179397,0.00019003921,0.00092575257,0.00011476312,0.00019713384],"domain_scores_gemma":[0.99865156,0.00007672138,0.000192242,0.0006992299,0.00022140951,0.00015881781],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00018124895,0.00022703726,0.00031864643,0.00022826882,0.00016859193,0.00033289657,0.00072609045,0.00018732401,0.00012993309],"category_scores_gemma":[0.000035437177,0.00025992855,0.00019528742,0.0006640376,0.00006179529,0.00034035678,0.0018059328,0.00023481321,0.000017888498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000071665654,0.000089930494,0.009301002,0.00004603339,0.0002573548,0.00013121428,0.000268051,0.39656523,0.000032194384,0.5928462,0.0002410585,0.00021454312],"study_design_scores_gemma":[0.00042174922,0.000010529336,0.00878859,0.000031479667,0.00012277915,0.00000437262,0.000055511267,0.96483964,0.000061556784,0.024955316,0.000292755,0.0004157385],"about_ca_topic_score_codex":0.0003060777,"about_ca_topic_score_gemma":0.00008152714,"teacher_disagreement_score":0.7367252,"about_ca_system_score_codex":0.000087089706,"about_ca_system_score_gemma":0.00016353148,"threshold_uncertainty_score":0.9999853},"labels":[],"label_agreement":null},{"id":"W3122767153","doi":"10.2139/ssrn.2520482","title":"A Variational Approach to Lagrange Multipliers","year":2014,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Society of Canada","funders":"","keywords":"Lagrange multiplier; Constraint algorithm; Applied mathematics; Mathematics; Mathematical economics; Mathematical optimization; Calculus (dental); Computer science; Medicine","score_opus":0.006466003260341021,"score_gpt":0.2077591992675414,"score_spread":0.2012931960072004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122767153","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026424206,0.00003956333,0.9903029,0.0031310956,0.00010505679,0.00005875105,5.590873e-7,0.0000492151,0.0060486016],"genre_scores_gemma":[0.8239648,0.00006563135,0.17197132,0.0015876441,0.00037687618,0.000011154457,0.000008324306,0.0000114659515,0.0020028057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815446,0.0001046162,0.00020658744,0.00023450195,0.0003771007,0.000922736],"domain_scores_gemma":[0.99936616,0.00005244393,0.00009833597,0.0001902566,0.00015808032,0.0001347215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015433697,0.00010272907,0.00011979796,0.00021205565,0.00024641491,0.00017205694,0.000622282,0.000041878793,0.000011383098],"category_scores_gemma":[0.000108664266,0.000089113935,0.00009670491,0.0005884672,0.000008362392,0.00025295667,0.00006383908,0.00046138954,0.00008448354],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003900623,0.00005978624,0.00017969575,7.2793495e-7,0.000059726182,7.094702e-8,0.00017127927,0.03147577,0.000017308274,0.959409,0.000090362366,0.008532379],"study_design_scores_gemma":[0.00052579254,0.00008453522,0.0016654286,0.0000022515615,0.00001772036,0.00007766778,0.00008083084,0.7928792,0.000005299346,0.19931829,0.005155512,0.00018743792],"about_ca_topic_score_codex":0.00001926914,"about_ca_topic_score_gemma":0.00003865158,"teacher_disagreement_score":0.82370055,"about_ca_system_score_codex":0.0003063905,"about_ca_system_score_gemma":0.00058270735,"threshold_uncertainty_score":0.36339608},"labels":[],"label_agreement":null},{"id":"W3125016700","doi":"10.48550/arxiv.2101.08830","title":"On the Frank-Wolfe algorithm for non-compact constrained optimization problems","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Conselho Nacional de Desenvolvimento Científico e Tecnológico; Fundação de Apoio à Pesquisa do Distrito Federal; Fundação de Amparo à Pesquisa do Estado de Goiás; Coordenação de Aperfeiçoamento de Pessoal de Nível Superior; Centre de Recherches Mathématiques","keywords":"Lipschitz continuity; Mathematics; Sequence (biology); Mathematical optimization; Class (philosophy); Constraint (computer-aided design); Cone (formal languages); Compact space; Function (biology); Convex function; Set (abstract data type); Optimization problem; Gradient method; Feasible region; Regular polygon; Convex optimization; Constrained optimization; Algorithm; Computer science; Pure mathematics","score_opus":0.049311491804018344,"score_gpt":0.18684904071952274,"score_spread":0.1375375489155044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125016700","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008097968,0.00000881174,0.9957111,0.0010825576,0.00030519097,0.0005265006,0.000042495,0.00010688776,0.0014066744],"genre_scores_gemma":[0.92457527,0.0000872474,0.07276323,0.0006836368,0.00008313384,0.000005479988,0.00026849407,0.000020401032,0.0015130969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848,0.00012637538,0.00022063305,0.0008093751,0.00013222903,0.00023133846],"domain_scores_gemma":[0.99800855,0.00035602666,0.00029051967,0.00076785206,0.00047520737,0.00010185709],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002989927,0.00025690318,0.00029194774,0.00020621317,0.00030087706,0.0003435794,0.0010711327,0.00019066928,0.00020428737],"category_scores_gemma":[0.00006776897,0.0002277362,0.0003190933,0.0007933748,0.00006387259,0.00026984874,0.00033073654,0.0002856583,0.000015625907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000037172626,0.00007991605,0.000028793775,0.000014565641,0.00014907107,0.000007871088,0.00014400479,0.89095867,0.0000020458617,0.10798506,0.00036789128,0.0002584252],"study_design_scores_gemma":[0.00042685866,0.000035161695,0.00005576178,0.000054148117,0.000079178244,0.0000010828197,0.000057484747,0.9904369,0.000033293018,0.008483879,0.00007291813,0.00026334514],"about_ca_topic_score_codex":0.000054312182,"about_ca_topic_score_gemma":0.0000067658566,"teacher_disagreement_score":0.9237655,"about_ca_system_score_codex":0.000121693476,"about_ca_system_score_gemma":0.00030327958,"threshold_uncertainty_score":0.92868125},"labels":[],"label_agreement":null},{"id":"W3129015561","doi":"10.23952/jnva.4.2020.3.07","title":"The generic stability of solutions for vector quasi-equilibrium problems on Hadamard manifolds","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Viet Nam National University Ho Chi Minh City","keywords":"Hadamard transform; Stability (learning theory); Mathematics; Pure mathematics; Vector (molecular biology); Hadamard three-lines theorem; Applied mathematics; Mathematical analysis; Hadamard matrix; Computer science; Chemistry","score_opus":0.043436264616640616,"score_gpt":0.2566004390099626,"score_spread":0.21316417439332197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129015561","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004302453,0.00014998525,0.967651,0.027609281,0.00007579564,0.00009433602,0.000060979513,0.00000893033,0.000047219975],"genre_scores_gemma":[0.9029842,0.00010041169,0.09588531,0.0005922391,0.00035495267,0.000005979427,0.00003191881,0.000006781477,0.00003817942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983851,0.00011621043,0.00068438397,0.00018739427,0.00048081996,0.00014609458],"domain_scores_gemma":[0.9975909,0.0005766648,0.0006316376,0.00016257708,0.0009147535,0.00012348141],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000924625,0.00010463672,0.0003227263,0.00017394904,0.00022430788,0.00011312268,0.00037348302,0.000043636315,0.00003354435],"category_scores_gemma":[0.00036545223,0.00006954552,0.00043809964,0.0012684886,0.000034036704,0.00025792274,0.00007451524,0.00009481667,0.0000013810804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029632557,0.0010689686,0.008191662,0.0000828363,0.006847439,0.0000020637965,0.0014129988,0.59685916,0.0021826332,0.3790634,0.0011271911,0.0028653233],"study_design_scores_gemma":[0.0003425803,0.0002793938,0.015177104,0.0000034581808,0.0005385275,0.0000017671241,0.000027998574,0.98066187,0.00007151341,0.0013267174,0.0014902542,0.00007879179],"about_ca_topic_score_codex":0.000011295364,"about_ca_topic_score_gemma":0.000013405622,"teacher_disagreement_score":0.89868176,"about_ca_system_score_codex":0.000031497264,"about_ca_system_score_gemma":0.0001818102,"threshold_uncertainty_score":0.2835984},"labels":[],"label_agreement":null},{"id":"W3131578784","doi":"10.1287/moor.2022.1317","title":"From Perspective Maps to Epigraphical Projections","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McGill University; University of British Columbia","funders":"","keywords":"Mathematics; Epigraph; Applied mathematics; Norm (philosophy); Differentiable function; Mathematical optimization; Mathematical analysis; Pure mathematics","score_opus":0.08675494905584905,"score_gpt":0.4038517438041044,"score_spread":0.31709679474825536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3131578784","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072087874,0.000023594797,0.96451956,0.021913687,0.000065424305,0.00044588602,0.00010164339,0.000050061833,0.005671326],"genre_scores_gemma":[0.4529326,0.0000045427355,0.5446187,0.000096717005,0.00004574033,0.0003506567,0.000028154256,0.000008274535,0.0019145878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823356,0.00022973768,0.00024310345,0.00025390915,0.00088662154,0.00015308423],"domain_scores_gemma":[0.9983147,0.00024266655,0.000019541627,0.0004645516,0.0008819083,0.00007663568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008931654,0.000058165504,0.000120587945,0.0006725074,0.00078299694,0.00015244017,0.00072364183,0.000018650408,0.0006096353],"category_scores_gemma":[0.00043910387,0.00005615022,0.00006214125,0.0027402388,0.000039517345,0.00017764991,0.0005848103,0.0002190353,0.000060889888],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000017459464,0.00039672124,0.000014577536,0.0000024331744,0.000036383957,9.463897e-7,0.0091697825,0.07452412,0.0006679786,0.9128068,0.0022838346,0.0000946688],"study_design_scores_gemma":[0.00016182079,0.00014115806,0.00012797647,0.000005654911,0.00000801333,0.0000037253456,0.008125893,0.9122603,0.0004330038,0.07663047,0.0019865902,0.000115383285],"about_ca_topic_score_codex":0.00094875053,"about_ca_topic_score_gemma":0.0001417652,"teacher_disagreement_score":0.8377362,"about_ca_system_score_codex":0.00012977644,"about_ca_system_score_gemma":0.00022135527,"threshold_uncertainty_score":0.6675079},"labels":[],"label_agreement":null},{"id":"W3132131652","doi":"10.1016/j.jfranklin.2021.02.015","title":"Convergent under-approximations of reachable sets and tubes: A piecewise constant approach","year":2021,"lang":"en","type":"article","venue":"Journal of the Franklin Institute","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Piecewise; Constant (computer programming); Mathematics; Applied mathematics; Mathematical analysis; Mathematical optimization; Computer science","score_opus":0.02095563314685304,"score_gpt":0.23925266442724405,"score_spread":0.21829703128039102,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3132131652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013407243,0.0005749659,0.9786859,0.004554063,0.0005812325,0.000084402476,0.000007749456,0.000008005231,0.0020964346],"genre_scores_gemma":[0.79192644,0.00033819524,0.20677713,0.000560837,0.000053459305,0.0000030615342,0.0000034513976,0.0000046825844,0.00033273106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989243,0.00008730563,0.00044808924,0.00011540603,0.0003383934,0.000086493084],"domain_scores_gemma":[0.9988722,0.000050890834,0.000279579,0.00026050527,0.00046795947,0.000068848836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038483593,0.00007652375,0.00021087883,0.00009398099,0.00013120522,0.00006936268,0.00037190906,0.00003969955,0.000023261182],"category_scores_gemma":[0.00012793782,0.00005180935,0.00013693661,0.0005406184,0.00009059112,0.0004387651,0.00014738878,0.00013083644,0.0000014261387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014908167,0.00051633123,0.0018091678,0.000072070696,0.00049863843,0.000014456979,0.0012798288,0.16703852,0.0016130797,0.82430005,0.0013678534,0.0014750971],"study_design_scores_gemma":[0.0020130775,0.00006820109,0.003692341,0.00017724355,0.00028355187,0.0007073248,0.00043108172,0.9471619,0.0039447406,0.0326609,0.008596057,0.0002635765],"about_ca_topic_score_codex":0.000010543171,"about_ca_topic_score_gemma":0.0000053664685,"teacher_disagreement_score":0.79163915,"about_ca_system_score_codex":0.000030413614,"about_ca_system_score_gemma":0.0003711521,"threshold_uncertainty_score":0.2112724},"labels":[],"label_agreement":null},{"id":"W3153160857","doi":"10.1007/s11228-021-00584-2","title":"Resolvents and Yosida Approximations of Displacement Mappings of Isometries","year":2021,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Mathematics; Monotone polygon; Pure mathematics; Class (philosophy); Operator theory; Subderivative; Displacement (psychology); Set (abstract data type); Algebra over a field; Regular polygon; Convex optimization; Computer science; Geometry","score_opus":0.014195760703829751,"score_gpt":0.24893897843207535,"score_spread":0.2347432177282456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153160857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013833881,0.0002877874,0.9835569,0.0017248956,0.00002766284,0.00005559901,0.00007847608,0.000013747319,0.00042104063],"genre_scores_gemma":[0.8508929,0.00012799387,0.14811587,0.00013011957,0.000016705484,0.0000072729654,0.00022763855,0.0000034721538,0.0004780235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986133,0.000095538424,0.0004513552,0.0003033318,0.0004358146,0.000100645695],"domain_scores_gemma":[0.99875027,0.0001643092,0.00028724337,0.00022890075,0.0005028412,0.00006644811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035505395,0.000101845915,0.00031930834,0.0005490764,0.00012634222,0.00007189563,0.00014599509,0.000045089295,0.00013287425],"category_scores_gemma":[0.00016206893,0.00009500483,0.00013821965,0.0030653835,0.00004817024,0.00029459683,0.00016127678,0.000043525128,0.0000011401667],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000881822,0.00017614361,0.036130533,0.00005339241,0.0019844098,7.337378e-7,0.0010680826,0.013659561,0.0005674234,0.9457451,0.00006531958,0.0005404589],"study_design_scores_gemma":[0.00040234375,0.000023231325,0.15298678,0.000013589628,0.0007636329,0.00000171622,0.0001585875,0.83371884,0.00048021585,0.011179112,0.00014200843,0.00012992651],"about_ca_topic_score_codex":0.000071094284,"about_ca_topic_score_gemma":0.00001618709,"teacher_disagreement_score":0.934566,"about_ca_system_score_codex":0.00001551043,"about_ca_system_score_gemma":0.000082409075,"threshold_uncertainty_score":0.38741842},"labels":[],"label_agreement":null},{"id":"W3153975732","doi":"10.5539/jmr.v13n3p13","title":"On Notations for Conic Hulls and Related Considerations on Tangent Cones","year":2021,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Conic section; Tangent cone; Notation; Conic optimization; Cone (formal languages); Tangent; Dual cone and polar cone; Convex hull; Convex cone; Regular polygon; Constraint (computer-aided design); Set (abstract data type); Convex set; Combinatorics; Geometry; Convex optimization; Algorithm; Computer science; Arithmetic","score_opus":0.13852447827203848,"score_gpt":0.41439062190207293,"score_spread":0.2758661436300345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153975732","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03480471,0.00033768005,0.8779691,0.08015261,0.00034188488,0.00044803633,0.000023173325,0.0000254789,0.005897334],"genre_scores_gemma":[0.73689026,0.00019271155,0.2605437,0.00043160864,0.000052194893,0.000013585366,0.0000045695365,0.0000108995,0.001860439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987494,0.0001304604,0.00036805662,0.00010519011,0.0005327466,0.0001141759],"domain_scores_gemma":[0.9948243,0.0031727725,0.00015670735,0.00016477247,0.0015990407,0.000082411665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012040169,0.000052102307,0.00014945952,0.0002719111,0.00023848732,0.00022818673,0.00012704218,0.000036148154,0.00015745335],"category_scores_gemma":[0.0023926091,0.000041613963,0.000070732895,0.00033323362,0.000035733963,0.00013065289,0.00004168647,0.0001782484,0.000020379968],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032410505,0.0002469273,0.0000044191574,0.000018841049,0.00008458743,0.000016724483,0.00081003236,0.0048695835,0.00038491582,0.9899499,0.0034310697,0.00017977766],"study_design_scores_gemma":[0.00091820996,0.00033955887,0.00016333221,0.00011553019,0.00002899021,0.00016203453,0.00054129475,0.4004185,0.0019628592,0.5947485,0.00051126804,0.00008992694],"about_ca_topic_score_codex":5.944338e-7,"about_ca_topic_score_gemma":0.0000033511458,"teacher_disagreement_score":0.70208555,"about_ca_system_score_codex":0.00004256445,"about_ca_system_score_gemma":0.00028287512,"threshold_uncertainty_score":0.28643495},"labels":[],"label_agreement":null},{"id":"W3157571124","doi":"","title":"Bregman circumcenters: applications","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Bregman divergence; Monotonic function; Mathematics; Intersection (aeronautics); Generalization; Sequence (biology); Monotone polygon; Convergence (economics); Applied mathematics; Subsequence; Euclidean geometry; Mathematical optimization; Mathematical analysis","score_opus":0.05741219228777554,"score_gpt":0.17731503372868995,"score_spread":0.11990284144091441,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157571124","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016925907,0.00003942369,0.99323666,0.000431327,0.00016815169,0.00015232351,0.000010341056,0.00018593659,0.004083222],"genre_scores_gemma":[0.9888803,0.00013174668,0.008425118,0.0003143319,0.00006428458,0.0000028616244,0.00013047118,0.000008661935,0.0020422228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986496,0.00008460028,0.00015590979,0.0008523796,0.00008672709,0.00017081451],"domain_scores_gemma":[0.99834394,0.000042468684,0.00017592011,0.0010311471,0.00027966013,0.00012685638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000094584946,0.00017225061,0.00020137322,0.000213614,0.00015319951,0.00026006895,0.001273253,0.00014813313,0.00013896519],"category_scores_gemma":[0.000010546475,0.00021412,0.00023357125,0.0009228457,0.000034655583,0.00033761538,0.0012185433,0.0002433748,0.00009799042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000001300173,0.00011150698,0.000999273,0.000023974202,0.0001314125,0.00003459058,0.00009474629,0.4213874,0.000007405328,0.57657146,0.00024830943,0.0003886125],"study_design_scores_gemma":[0.00019985891,0.0000058486344,0.0010405524,0.00002493957,0.000082828294,0.0000027431993,0.00007239828,0.9771806,0.000018901725,0.01916527,0.0018953666,0.00031066296],"about_ca_topic_score_codex":0.00006151505,"about_ca_topic_score_gemma":0.000032243734,"teacher_disagreement_score":0.9871877,"about_ca_system_score_codex":0.0001341541,"about_ca_system_score_gemma":0.00019794091,"threshold_uncertainty_score":0.87315595},"labels":[],"label_agreement":null},{"id":"W3157614119","doi":"10.3934/cpaa.2021076","title":"Hadamard Semidifferential, Oriented Distance Function, and some Applications","year":2021,"lang":"en","type":"article","venue":"Communications on Pure &amp Applied Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Combinatorics; Differentiable function; Arithmetic; Discrete mathematics; Pure mathematics","score_opus":0.015103438270342705,"score_gpt":0.24957731499982472,"score_spread":0.234473876729482,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3157614119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002536615,0.00074898126,0.98732793,0.0073660193,0.00003037383,0.00016344746,0.000034721525,0.00019342144,0.0038814414],"genre_scores_gemma":[0.89118695,0.0012109708,0.10175149,0.00167949,0.000056454795,0.00041761887,0.0016516881,0.000017820099,0.0020274974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982063,0.0001455796,0.0004500797,0.00062747905,0.0003679119,0.00020263372],"domain_scores_gemma":[0.99538714,0.00024627388,0.00022879004,0.0035615012,0.0004208186,0.00015550003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021444046,0.00020699484,0.00035671506,0.00044449393,0.000847026,0.00032912698,0.0011395983,0.00009459295,0.00013564264],"category_scores_gemma":[0.000039724866,0.0002098663,0.00021409421,0.0046977643,0.000111844776,0.00025117424,0.00057579036,0.00022922711,0.00009836345],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043883974,0.00030671505,0.00091298204,0.0000057948614,0.0008664679,1.6313591e-7,0.00009308695,0.0031179609,0.00021766534,0.9906066,0.00052373385,0.003344447],"study_design_scores_gemma":[0.0013530526,0.000032896736,0.02232532,0.000022160422,0.004275366,0.0000048670563,0.0003403386,0.31785595,0.0003077127,0.12228426,0.5298836,0.0013144565],"about_ca_topic_score_codex":0.000008420627,"about_ca_topic_score_gemma":0.00017322702,"teacher_disagreement_score":0.89093333,"about_ca_system_score_codex":0.00006715574,"about_ca_system_score_gemma":0.00008822948,"threshold_uncertainty_score":0.8558099},"labels":[],"label_agreement":null},{"id":"W3159525208","doi":"10.23952/jnva.4.2020.1.02","title":"Some topics in vector optimization via image space analysis","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Università di Pisa; Università di Catania; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Space (punctuation); Image (mathematics); Vector (molecular biology); Computer science; Computer vision; Artificial intelligence; Biology; Recombinant DNA","score_opus":0.010887849041310588,"score_gpt":0.24380866746292545,"score_spread":0.23292081842161486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159525208","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001539326,0.00013615972,0.97455823,0.023603866,0.0000470259,0.00003793789,0.000012552817,0.0000135170185,0.000051393425],"genre_scores_gemma":[0.24755466,0.00025431925,0.74986684,0.0014847874,0.00066493516,0.0000016056813,0.0000817807,0.000008020255,0.00008303715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981624,0.00013788475,0.0007429303,0.0002729913,0.00054181047,0.00014197388],"domain_scores_gemma":[0.99842376,0.00013143504,0.0005562559,0.00015250078,0.0005437888,0.00019226177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004604102,0.0001441632,0.00054640876,0.0012255994,0.000081629296,0.00019124709,0.00035302574,0.000072496245,0.00018076075],"category_scores_gemma":[0.00020431457,0.00012608971,0.00047472314,0.006189521,0.000019544432,0.0010336726,0.00008435171,0.00017078326,0.0000046015793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019371766,0.00010457248,0.012723928,0.0000054885163,0.002820842,0.000011439971,0.0003380922,0.9710729,0.000052054747,0.012625828,0.000034195742,0.00019128196],"study_design_scores_gemma":[0.00038655812,0.000045711608,0.045017667,0.0000020269345,0.0019874857,0.0000029156286,0.000015656587,0.9516773,0.000017379718,0.00056207326,0.000157093,0.00012813692],"about_ca_topic_score_codex":0.000037790112,"about_ca_topic_score_gemma":0.000018882134,"teacher_disagreement_score":0.24601534,"about_ca_system_score_codex":0.000051331444,"about_ca_system_score_gemma":0.00010834341,"threshold_uncertainty_score":0.51417893},"labels":[],"label_agreement":null},{"id":"W3160114214","doi":"10.23952/jano.3.2021.2.03","title":"A variational inequality for the derivative of the scalar play operator","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund; Grantová Agentura České Republiky","keywords":"Scalar (mathematics); Mathematics; Inequality; Variational inequality; Operator (biology); Derivative (finance); Mathematical physics; Algebra over a field; Applied mathematics; Mathematical analysis; Mathematical economics; Pure mathematics; Economics; Geometry; Chemistry","score_opus":0.011465887219513209,"score_gpt":0.23695825790202957,"score_spread":0.22549237068251635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160114214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003726051,0.000056633013,0.99343836,0.005790172,0.00010516536,0.00008965254,0.0000051433776,0.000003523587,0.0001387659],"genre_scores_gemma":[0.58060414,0.000053404667,0.418162,0.0010478812,0.00009096475,0.000006962033,0.0000047774206,0.00000448614,0.000025424612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991022,0.000061019455,0.00038403284,0.000105944426,0.00027971546,0.00006710852],"domain_scores_gemma":[0.99840975,0.00039175918,0.00040490172,0.0001282736,0.00062634645,0.000038998056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037296314,0.00006587875,0.00016297237,0.000033624197,0.00017145039,0.000075053955,0.00024251525,0.00003660341,0.000030507324],"category_scores_gemma":[0.00021597189,0.000035987545,0.000093897725,0.0005041629,0.000030956904,0.00017563623,0.00007824763,0.00007956758,2.0912499e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002541215,0.000066593886,0.0001550578,0.000004746814,0.00007971774,1.5497851e-7,0.00033315658,0.8468876,0.00024599564,0.15113935,0.00011603308,0.0009462035],"study_design_scores_gemma":[0.00048696258,0.000027724256,0.0037628715,0.0000067669343,0.00004943554,0.0000067616056,0.000057758232,0.99081403,0.0011332856,0.0031085203,0.00049092557,0.000054975444],"about_ca_topic_score_codex":0.0000012146385,"about_ca_topic_score_gemma":1.8255655e-7,"teacher_disagreement_score":0.5802315,"about_ca_system_score_codex":0.00001897781,"about_ca_system_score_gemma":0.0001702724,"threshold_uncertainty_score":0.14675295},"labels":[],"label_agreement":null},{"id":"W3161875491","doi":"10.23952/jano.4.2022.2.02","title":"On angles between convex cones","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Mathematics; Orthographic projection; Regular polygon; Projection (relational algebra); Hilbert space; Mathematical proof; Convergence (economics); Pure mathematics; Algebra over a field; Geometry; Algorithm","score_opus":0.008797429418133544,"score_gpt":0.2151201609620584,"score_spread":0.20632273154392486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161875491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011519955,0.000024112633,0.99509233,0.0017500801,0.00008262544,0.000043259697,0.000002840536,0.000016204409,0.0018365729],"genre_scores_gemma":[0.89312947,0.000017238697,0.10581112,0.0008990429,0.000070649985,0.0000033693361,0.00000956385,0.0000053184745,0.00005424231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912167,0.000046519483,0.0002892031,0.000119357195,0.0003433719,0.000079877216],"domain_scores_gemma":[0.99930507,0.00014409935,0.00030559732,0.00007986834,0.00008739098,0.000077975696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023865163,0.00007151271,0.0001887604,0.0001646362,0.00019883299,0.00006689675,0.00021055035,0.000020959475,0.00021200988],"category_scores_gemma":[0.000020783591,0.00006057852,0.000050696854,0.0003914312,0.000014914178,0.00014801009,0.000082705774,0.00013186233,0.0000027867954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002874078,0.00005547722,0.00011933993,0.0000014941394,0.000032840486,0.000001772838,0.00013787684,0.8998935,0.00001574008,0.096240565,0.00046437958,0.0030082222],"study_design_scores_gemma":[0.00071817404,0.0003158068,0.0007936279,0.0000029156129,0.000036413792,0.000014711326,0.00006775964,0.98680264,0.00007296394,0.008614848,0.0024222971,0.00013783954],"about_ca_topic_score_codex":9.713058e-7,"about_ca_topic_score_gemma":9.934433e-9,"teacher_disagreement_score":0.8919775,"about_ca_system_score_codex":0.00003096635,"about_ca_system_score_gemma":0.00003638669,"threshold_uncertainty_score":0.24703203},"labels":[],"label_agreement":null},{"id":"W3166945949","doi":"10.23952/asvao.2.2020.1.01","title":"Parallel computing proximal method for nonsmooth convex optimization with fixed point constraints of quasi-nonexpansive mappings","year":2020,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science","keywords":"Fixed point; Regular polygon; Mathematics; Convex optimization; Applied mathematics; Mathematical optimization; Computer science; Mathematical analysis; Geometry","score_opus":0.015682343783175998,"score_gpt":0.25280857142931723,"score_spread":0.23712622764614122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3166945949","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014587879,0.000020016132,0.99726975,0.0014685745,0.000016511502,0.0006792025,0.00003616201,0.00009894861,0.00026496663],"genre_scores_gemma":[0.15813303,0.000022070373,0.8402439,0.00097415503,0.000034676574,0.00003677731,0.0005205641,0.000019020868,0.000015846716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99736845,0.00016149855,0.00087338366,0.00083935796,0.00047889433,0.00027844016],"domain_scores_gemma":[0.9975671,0.00025143495,0.0008930327,0.00033031305,0.0007626962,0.0001953842],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00059908704,0.0003128688,0.0008591002,0.00041554385,0.00027133073,0.00022408515,0.00035891886,0.00012910624,0.00009724339],"category_scores_gemma":[0.00010137829,0.00027204704,0.00022307504,0.0027208664,0.00011175943,0.00036123133,0.00011306901,0.00011180856,0.0000014427537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000880218,0.000075123746,0.00026247292,0.000044087876,0.000953498,4.0123572e-7,0.0016311682,0.96867293,0.000110538356,0.026454479,0.000039850256,0.0016674345],"study_design_scores_gemma":[0.0013241742,0.00015001945,0.00015613371,0.000011638912,0.00092323544,0.0000017266993,0.0005551189,0.996165,0.00025500677,0.0001157573,0.000014891251,0.00032732653],"about_ca_topic_score_codex":0.000030129126,"about_ca_topic_score_gemma":0.00000461059,"teacher_disagreement_score":0.15798715,"about_ca_system_score_codex":0.0000318426,"about_ca_system_score_gemma":0.00011377665,"threshold_uncertainty_score":0.9999732},"labels":[],"label_agreement":null},{"id":"W3175439022","doi":"10.1007/s11590-022-01896-4","title":"Directional asymptotics of Fejér monotone sequences","year":2022,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Mathematics; Monotonic function; Convergence (economics); Mathematical proof; Applied mathematics; Computational intelligence; Mathematical analysis; Computer science","score_opus":0.00684713335480327,"score_gpt":0.20037249911562688,"score_spread":0.1935253657608236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175439022","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007308174,0.000015562748,0.9885098,0.009243885,0.0002494922,0.000072366725,0.000010800838,0.00007561713,0.0010916985],"genre_scores_gemma":[0.31876802,0.000022485086,0.67598605,0.0044454033,0.000054826305,0.00004610439,0.00011100536,0.000011991318,0.0005541278],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988439,0.00011012693,0.00025579124,0.00022689033,0.00045306346,0.0001102467],"domain_scores_gemma":[0.99939585,0.000060800532,0.00019212428,0.00020681764,0.000105256986,0.000039145198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020601366,0.000080779944,0.00011512323,0.0002215586,0.0002747097,0.000052021718,0.00039982796,0.000015921412,0.000722953],"category_scores_gemma":[0.000027707672,0.000087775734,0.00007150925,0.0010078574,0.000029978679,0.00034177618,0.00015446993,0.000073605566,0.0000048977204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000027126566,0.00004538241,0.00056738115,0.0000019299255,0.00002743243,9.556636e-7,0.00013227058,0.97488874,0.00041060895,0.022780254,0.000989841,0.00015246555],"study_design_scores_gemma":[0.00016833881,0.00002092668,0.0003177941,0.000001294818,0.000010342258,0.000005721699,0.000021860065,0.99767846,0.00026625383,0.00015086333,0.0012537568,0.00010436455],"about_ca_topic_score_codex":0.000022069798,"about_ca_topic_score_gemma":5.506996e-7,"teacher_disagreement_score":0.3180372,"about_ca_system_score_codex":0.000073551724,"about_ca_system_score_gemma":0.0000563972,"threshold_uncertainty_score":0.7915828},"labels":[],"label_agreement":null},{"id":"W3175542901","doi":"10.23952/asvao.3.2021.1.06","title":"Convergence theorems of common solutions of variational inequality and f-fixed point problems in Banach spaces","year":2021,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Botswana International University of Science and Technology","keywords":"Banach space; Mathematics; Variational inequality; Convergence (economics); Fixed point; Fixed-point theorem; Pure mathematics; Eberlein–Šmulian theorem; Applied mathematics; Mathematical analysis; Lp space; Economics","score_opus":0.018378749890812476,"score_gpt":0.24392796911534284,"score_spread":0.22554921922453036,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175542901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010529727,0.0001464233,0.98832816,0.0004692527,0.000019196297,0.00011527658,0.000024068238,0.000017051589,0.00035082677],"genre_scores_gemma":[0.8673809,0.00021527977,0.1320433,0.00006961996,0.000006922017,0.000011478866,0.0002507168,0.0000043827545,0.000017386423],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982865,0.00019578058,0.00064964365,0.00039341123,0.00033102324,0.00014367735],"domain_scores_gemma":[0.99873525,0.00015605791,0.00040572137,0.00029567833,0.00034468336,0.00006263683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083667814,0.0001333648,0.0004543795,0.00042955347,0.00011028858,0.00007132206,0.0001597198,0.0000819389,0.000099928475],"category_scores_gemma":[0.000070092494,0.0001286138,0.00008983627,0.0029552032,0.00007977759,0.0002641114,0.00015502653,0.000072636205,4.1116425e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000041050967,0.000104952356,0.011518695,0.000021565518,0.00022075525,2.1033684e-7,0.0005864914,0.69508797,0.0002915632,0.2919911,0.0000036596489,0.00016889854],"study_design_scores_gemma":[0.00039830955,0.000013088986,0.02665149,0.000009612046,0.00025528076,7.4257224e-7,0.00017238336,0.96577644,0.00036060144,0.006231746,0.000002705138,0.00012760973],"about_ca_topic_score_codex":0.00025969066,"about_ca_topic_score_gemma":0.00020490293,"teacher_disagreement_score":0.85685116,"about_ca_system_score_codex":0.000023813707,"about_ca_system_score_gemma":0.000083542094,"threshold_uncertainty_score":0.5244718},"labels":[],"label_agreement":null},{"id":"W3175846223","doi":"10.1287/moor.2022.1347","title":"On the Douglas–Rachford Algorithm for Solving Possibly Inconsistent Optimization Problems","year":2023,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Disjoint sets; Generality; Shadow (psychology); Sequence (biology); Regular polygon; Algorithm; Limit (mathematics); Convergence (economics); Limit point; Mathematical optimization; Combinatorics; Mathematical analysis; Geometry","score_opus":0.12523216314823551,"score_gpt":0.3695865910523152,"score_spread":0.2443544279040797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175846223","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00042870152,0.000009455092,0.9899111,0.007852451,0.00006398743,0.00070996466,0.000017004964,0.000067092406,0.0009402836],"genre_scores_gemma":[0.025464298,0.000055095243,0.9698108,0.00010715816,0.000057476333,0.00053911447,0.000105011946,0.000019450465,0.0038416157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99835396,0.00009810767,0.00038310434,0.00021979061,0.00071116374,0.00023386296],"domain_scores_gemma":[0.9969587,0.0012356085,0.00005323487,0.0005077905,0.0011967665,0.00004789931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024462794,0.000087717395,0.00013996377,0.00048740167,0.0007567787,0.00041838293,0.00067788834,0.000046131427,0.000068405636],"category_scores_gemma":[0.000995702,0.00006029491,0.000085871565,0.0019727936,0.000065307606,0.00027724687,0.00021533052,0.0001251422,0.000065825305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.166959e-7,0.000091559086,0.0000010541498,0.000021143636,0.000025232534,1.6199535e-7,0.00095384655,0.63944787,0.00008366722,0.3576722,0.0009336263,0.0007690982],"study_design_scores_gemma":[0.00014834244,0.00007005929,0.000007899415,0.00003616368,0.0000057842685,9.019001e-7,0.00026302793,0.98571926,0.00023214151,0.013325388,0.00012467422,0.000066333036],"about_ca_topic_score_codex":0.000019185263,"about_ca_topic_score_gemma":0.0000140174425,"teacher_disagreement_score":0.3462714,"about_ca_system_score_codex":0.00004552586,"about_ca_system_score_gemma":0.00015729411,"threshold_uncertainty_score":0.58206064},"labels":[],"label_agreement":null},{"id":"W3176083364","doi":"10.23952/asvao.3.2021.2.04","title":"Convergence theorems for a fixed point of $\\eta$-demimetric mappings in Banach spaces","year":2021,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Banach space; Convergence (economics); Mathematics; Fixed point; Fixed-point theorem; Pure mathematics; Applied mathematics; Mathematical analysis; Economics","score_opus":0.011707099412186693,"score_gpt":0.23739568154458504,"score_spread":0.22568858213239834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176083364","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00210201,0.00017328344,0.9962568,0.00064456166,0.00003310026,0.00018038762,0.000013071097,0.000031775922,0.00056497735],"genre_scores_gemma":[0.6304671,0.00025525142,0.36863655,0.000222452,0.000015063773,0.000032664484,0.00023284463,0.000007858078,0.0001302012],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983274,0.00008783245,0.00055115833,0.0005368745,0.0003005707,0.00019616788],"domain_scores_gemma":[0.9986811,0.0001972159,0.00032300563,0.0003442186,0.00037855792,0.000075894764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006530851,0.00016315399,0.00048149747,0.000904138,0.000111861875,0.00013556659,0.0002539214,0.00009528328,0.00013809494],"category_scores_gemma":[0.00014361273,0.00015573064,0.00018536343,0.006767456,0.000039595834,0.0002566667,0.00010438285,0.00006616138,0.0000018020318],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011106161,0.00006761152,0.0020691305,0.000021050335,0.00036213128,6.6622636e-7,0.00040886423,0.83414257,0.00030401026,0.16188589,0.00004429437,0.0006826584],"study_design_scores_gemma":[0.0005412442,0.000013278888,0.0016580226,0.000006438024,0.00036247505,6.7133027e-7,0.00020183781,0.99342203,0.0012762563,0.0022936182,0.000046898396,0.0001772483],"about_ca_topic_score_codex":0.00006366012,"about_ca_topic_score_gemma":0.000035756428,"teacher_disagreement_score":0.6283651,"about_ca_system_score_codex":0.000034262455,"about_ca_system_score_gemma":0.00007707448,"threshold_uncertainty_score":0.63505113},"labels":[],"label_agreement":null},{"id":"W3176733198","doi":"10.1109/tac.2022.3206253","title":"Feedback Nash Equilibria in Differential Games With Impulse Control","year":2022,"lang":"en","type":"preprint","venue":"IEEE Transactions on Automatic Control","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; McGill University; Group for Research in Decision Analysis","funders":"Fonds de recherche du Québec – Nature et technologies; Science and Engineering Research Board","keywords":"Nash equilibrium; Differential game; Mathematics; Epsilon-equilibrium; Best response; Mathematical economics; Correlated equilibrium; Hamilton–Jacobi–Bellman equation; Example of a game without a value; Sequential game; Mathematical optimization; Applied mathematics; Computer science; Repeated game; Bellman equation; Equilibrium selection; Normal-form game; Game theory","score_opus":0.008777727635169114,"score_gpt":0.23139657135290917,"score_spread":0.22261884371774004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3176733198","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010032659,0.0000305324,0.9840026,0.0029867294,0.0009511002,0.0010323607,0.00017561074,0.00045932134,0.000329068],"genre_scores_gemma":[0.99099743,0.00001489885,0.00669814,0.00070905406,0.000050434952,0.0007226382,0.000020721856,0.000038177903,0.0007484767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99650615,0.00048361142,0.0008162538,0.00089144264,0.0008669571,0.00043560262],"domain_scores_gemma":[0.9977641,0.0004698041,0.00040310182,0.0010634373,0.00013383322,0.0001657179],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00033203076,0.000495686,0.0008886075,0.00077023974,0.00022504247,0.00043258036,0.0011505325,0.00019661241,0.0026532554],"category_scores_gemma":[0.0000130400285,0.00044228887,0.00040766827,0.00072049233,0.000056541117,0.00028779433,0.000019575076,0.0007280028,0.00005712682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013844289,0.0007889607,0.00008036749,0.000087366454,0.00077682623,0.000029429932,0.00056898675,0.97920763,0.0001456685,0.0010476523,0.000093693336,0.01703498],"study_design_scores_gemma":[0.0051974673,0.00014751853,0.0020417762,0.000085330736,0.0002680085,0.000008736245,0.00002973667,0.9911116,0.000030248946,0.00055024284,0.000059860726,0.0004694945],"about_ca_topic_score_codex":0.00015401283,"about_ca_topic_score_gemma":0.00015602942,"teacher_disagreement_score":0.9809648,"about_ca_system_score_codex":0.00031477553,"about_ca_system_score_gemma":0.00044065903,"threshold_uncertainty_score":0.9998029},"labels":[],"label_agreement":null},{"id":"W3182018535","doi":"10.2478/auom-2021-0028","title":"Strong convergence to a solution of the inclusion problem for a finite family of monotone operators in Hadamard spaces","year":2021,"lang":"en","type":"article","venue":"Analele Universităţii \"Ovidius\" Constanţa. Seria Matematică","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Etobicoke General Hospital","funders":"","keywords":"Monotone polygon; Variational inequality; Hadamard transform; Mathematics; Strongly monotone; Convergence (economics); Scheme (mathematics); Convex optimization; Fixed point; Regular polygon; Pure mathematics; Applied mathematics; Mathematical optimization; Algebra over a field; Mathematical analysis","score_opus":0.013002739612688429,"score_gpt":0.22684054195936254,"score_spread":0.2138378023466741,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3182018535","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12601465,0.00008002014,0.869578,0.0027363186,0.0001574668,0.00066208834,0.0000615855,0.000026310201,0.0006835509],"genre_scores_gemma":[0.86555594,0.00003186756,0.13374838,0.00020241598,0.000008342496,0.000009795412,0.000014566165,0.0000068024888,0.00042187326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983909,0.00019269862,0.0005193256,0.00032627053,0.00036666318,0.0002041421],"domain_scores_gemma":[0.9982567,0.00021252071,0.0003569191,0.00043304818,0.00066560064,0.00007520866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041633003,0.00014946822,0.00037836487,0.0002509201,0.00023439676,0.000052908355,0.0006396863,0.00006681913,0.000060975937],"category_scores_gemma":[0.00014939802,0.00013150109,0.00013858128,0.0016563168,0.000062543586,0.0005268955,0.00090337085,0.0000652747,0.000003917594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016056644,0.0005194614,0.008863245,0.0010645881,0.00039209408,0.000020816256,0.0106453085,0.41365987,0.05276151,0.5099365,0.001511851,0.00046420624],"study_design_scores_gemma":[0.0012662709,0.00011613048,0.0019678485,0.0005324299,0.00011765237,0.000003238312,0.003086684,0.9712149,0.018004036,0.0024038786,0.00095739384,0.00032952966],"about_ca_topic_score_codex":0.00024789193,"about_ca_topic_score_gemma":0.0003514678,"teacher_disagreement_score":0.7395413,"about_ca_system_score_codex":0.00012273839,"about_ca_system_score_gemma":0.0005013566,"threshold_uncertainty_score":0.5362459},"labels":[],"label_agreement":null},{"id":"W3186827305","doi":"10.23952/asvao.3.2021.3.03","title":"On Clarke’s subdifferential of marginal functions","year":2021,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subderivative; Mathematics; Mathematical economics; Regular polygon; Geometry","score_opus":0.009273283884596629,"score_gpt":0.2220112822418799,"score_spread":0.21273799835728327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3186827305","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00298385,0.000032843862,0.99364376,0.00035636532,0.00005524411,0.000061514234,0.00001543695,0.000047142377,0.0028038167],"genre_scores_gemma":[0.8495915,0.000084564446,0.1487596,0.00030562238,0.00003434738,0.000012609145,0.00060889655,0.0000087464905,0.0005940901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853903,0.000090269,0.00037189142,0.00046432213,0.00037857034,0.00015591498],"domain_scores_gemma":[0.9989407,0.000080080026,0.00020428601,0.0003943671,0.00029271704,0.000087852175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020256509,0.00015014295,0.00033514833,0.0004703559,0.00019927634,0.00014925994,0.00017469244,0.000084908555,0.00055516296],"category_scores_gemma":[0.00003619872,0.00014209152,0.00018493917,0.0028392146,0.00003246657,0.00016281378,0.00008966782,0.000086968554,0.000008715577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013051909,0.0000985106,0.0003684995,0.000005595188,0.0005477369,9.102632e-7,0.00008140856,0.8016184,0.00013995019,0.1960571,0.00010809359,0.00096073374],"study_design_scores_gemma":[0.00040296218,0.00002073816,0.0031130605,0.0000033612978,0.00070883305,0.000001062951,0.000048482347,0.9939388,0.00047736533,0.0010772918,0.000054571512,0.00015344855],"about_ca_topic_score_codex":0.000017035178,"about_ca_topic_score_gemma":0.000018526454,"teacher_disagreement_score":0.8466077,"about_ca_system_score_codex":0.000024165649,"about_ca_system_score_gemma":0.000061526225,"threshold_uncertainty_score":0.6078645},"labels":[],"label_agreement":null},{"id":"W3188185556","doi":"10.28924/2291-8639-19-2021-743","title":"Iterative Schemes for Triequilibrium-Like Problems","year":2021,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Convergence (economics); Mathematical optimization; Class (philosophy); Work (physics); Applied mathematics; Iterative method; Mathematical economics; Computer science; Artificial intelligence","score_opus":0.012128645429721778,"score_gpt":0.2845907606179899,"score_spread":0.27246211518826813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188185556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006575374,0.0003055488,0.9915165,0.007092612,0.00006813847,0.00006119428,0.000020330495,0.000009292769,0.0002688462],"genre_scores_gemma":[0.71850294,0.0005243559,0.27724177,0.0015140168,0.0004270596,0.000064007916,0.00012707344,0.000008101603,0.0015906857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989795,0.000030280526,0.0004278386,0.00018375319,0.00030519883,0.00007342816],"domain_scores_gemma":[0.9971824,0.00014110385,0.00035680644,0.00014637662,0.0020998428,0.00007344736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022563786,0.00007446992,0.00019942506,0.00036099314,0.00008350676,0.0003130428,0.00040539363,0.000029279761,0.00005018097],"category_scores_gemma":[0.000050289786,0.00006446542,0.00028633574,0.00094267604,0.000021436723,0.0004250674,0.000077527766,0.000056554974,0.000002078791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026729882,0.00066807366,0.0073977886,0.000016437174,0.011061559,0.000011112784,0.00071142946,0.025878984,0.0025115681,0.8785308,0.001793065,0.071392424],"study_design_scores_gemma":[0.0015936451,0.00008137368,0.0058724326,0.000025631349,0.0015197959,0.00009879742,0.0001717518,0.4695058,0.0043383567,0.035779096,0.48064587,0.00036746677],"about_ca_topic_score_codex":0.0000025121985,"about_ca_topic_score_gemma":0.000006321075,"teacher_disagreement_score":0.84275174,"about_ca_system_score_codex":0.000026502983,"about_ca_system_score_gemma":0.00011092681,"threshold_uncertainty_score":0.3018679},"labels":[],"label_agreement":null},{"id":"W3188778639","doi":"10.23952/asvao.4.2022.3.04","title":"Universal bounds for fixed point iterations via optimal transport metrics","year":2022,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fixed point; Mathematics; Monotonic function; Expansive; Sequence (biology); Regular polygon; Set (abstract data type); Quadrangle; Combinatorics; Mathematical optimization; Point (geometry); Fixed-point theorem; Fixed-point iteration; Discrete mathematics; Applied mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.010427080999423206,"score_gpt":0.2246679794872529,"score_spread":0.21424089848782968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188778639","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00054995617,0.00003464773,0.99763227,0.0007680437,0.00006564915,0.0003029256,0.000082573366,0.000114800016,0.00044913386],"genre_scores_gemma":[0.49209857,0.000027985228,0.50491947,0.00047954562,0.000033120174,0.0001223989,0.0019350651,0.000014644227,0.00036919594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99811774,0.00008454687,0.0004632579,0.0006087134,0.0004831309,0.00024259636],"domain_scores_gemma":[0.99892247,0.00010477167,0.0002551113,0.00036045752,0.00023359527,0.00012358486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058320723,0.00020184218,0.00036254717,0.0011562268,0.0011431738,0.00022767489,0.00038751774,0.000062774765,0.00034004587],"category_scores_gemma":[0.000018196148,0.00021568706,0.0002656773,0.0053781485,0.000031726664,0.00042974675,0.00012431009,0.00011764395,0.0000016529339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021355792,0.00008235817,0.00019494939,0.000004139272,0.00052928424,7.661722e-7,0.00057206646,0.92116857,0.00003680619,0.0766732,0.00011168425,0.0006048323],"study_design_scores_gemma":[0.0007060164,0.00005584262,0.0002705608,5.6383556e-7,0.0009913227,0.0000017375601,0.00020297896,0.9962826,0.00003881411,0.00044785294,0.00074060645,0.0002611367],"about_ca_topic_score_codex":0.000047486745,"about_ca_topic_score_gemma":0.000015316458,"teacher_disagreement_score":0.4927128,"about_ca_system_score_codex":0.0001184803,"about_ca_system_score_gemma":0.00008550928,"threshold_uncertainty_score":0.87954634},"labels":[],"label_agreement":null},{"id":"W3193429021","doi":"10.23952/jnva.5.2021.6.01","title":"On the solution existence for prox-regular perturbed sweeping processes","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vietnam Academy of Science and Technology","keywords":"PROX; Mathematics; Chemistry; Catalysis; Carbon monoxide","score_opus":0.02289848214742285,"score_gpt":0.2611132145101377,"score_spread":0.23821473236271484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193429021","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022806418,0.0002033581,0.9722931,0.024988236,0.000064219326,0.00005629162,0.000012219395,0.000008016007,0.00009395756],"genre_scores_gemma":[0.45009387,0.00021648678,0.5445316,0.00353718,0.00055935397,0.000015237477,0.00007684322,0.000010467386,0.0009589866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871546,0.000097344644,0.00042162693,0.00019599672,0.00045937428,0.000110198096],"domain_scores_gemma":[0.99666154,0.0008202258,0.00040959197,0.00015824745,0.0018866988,0.0000636967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007012335,0.00009693982,0.00024206338,0.00025080543,0.00028711697,0.00021921971,0.0002639476,0.000041775744,0.00005029904],"category_scores_gemma":[0.0012149076,0.00006311305,0.00027094636,0.0016691608,0.000019825824,0.00035354414,0.000046464098,0.00009339752,0.0000016476702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010261495,0.00073313457,0.0021187572,0.00008505568,0.0057170163,0.000014713954,0.0011571938,0.18347989,0.0007367739,0.80197716,0.0009522783,0.0029254118],"study_design_scores_gemma":[0.0003039593,0.00006146261,0.0037600822,0.00001828665,0.0006395684,0.000019411867,0.000042198488,0.9775772,0.0002139298,0.016209546,0.001053142,0.00010117915],"about_ca_topic_score_codex":0.0000035780902,"about_ca_topic_score_gemma":0.000012018526,"teacher_disagreement_score":0.79409736,"about_ca_system_score_codex":0.00003274767,"about_ca_system_score_gemma":0.00033968844,"threshold_uncertainty_score":0.25736755},"labels":[],"label_agreement":null},{"id":"W3195078226","doi":"10.1137/21m1442474","title":"The Bregman Proximal Average","year":2022,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Bregman divergence; Combinatorics; Mathematical optimization; Applied mathematics","score_opus":0.007751141731016588,"score_gpt":0.2169832816624985,"score_spread":0.2092321399314819,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3195078226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000878918,0.000060116567,0.9837889,0.011761066,0.0005443255,0.00009026497,0.0000018134331,0.000055212964,0.0036103963],"genre_scores_gemma":[0.68879974,0.00067063275,0.2860886,0.0083400225,0.0008005497,0.000104241786,0.000063645784,0.00005697394,0.015075588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984696,0.0002649445,0.0002727987,0.00017247249,0.0006421737,0.0001780171],"domain_scores_gemma":[0.9991703,0.000095967596,0.0002477637,0.00024218188,0.0001655263,0.00007827534],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0007301557,0.00009159684,0.000082503786,0.00015293279,0.0023435699,0.00053546514,0.0007122645,0.000018369197,0.00040510166],"category_scores_gemma":[0.00006553643,0.00006665463,0.00009458613,0.00070502463,0.0000153466,0.00040527567,0.00015984928,0.00029424595,0.000017924385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012023456,0.000049056536,0.000036932943,4.118941e-7,0.000019688032,0.000005525254,0.00011225724,0.91650414,0.000002810877,0.079533085,0.0017293791,0.0019946916],"study_design_scores_gemma":[0.00027672885,0.000119825105,0.000109378874,0.0000018544968,0.000005520718,0.00008434011,0.000030137731,0.9791336,0.000010010654,0.0013953976,0.01874245,0.00009074111],"about_ca_topic_score_codex":9.139204e-7,"about_ca_topic_score_gemma":3.6437754e-7,"teacher_disagreement_score":0.6977003,"about_ca_system_score_codex":0.00014286813,"about_ca_system_score_gemma":0.00011191165,"threshold_uncertainty_score":0.99895525},"labels":[],"label_agreement":null},{"id":"W3200324920","doi":"10.48550/arxiv.2109.11072","title":"The splitting algorithms by Ryu and by Malitsky-Tam applied to normal cones of linear subspaces converge strongly to the projection onto the intersection","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Linear subspace; Intersection (aeronautics); Monotonic function; Convexity; Mathematics; Monotone polygon; Convergence (economics); Projection (relational algebra); Operator (biology); Set (abstract data type); Orthographic projection; Applied mathematics; Algorithm; Mathematical optimization; Pure mathematics; Computer science; Mathematical analysis; Geometry","score_opus":0.025994129090216877,"score_gpt":0.18242186707491254,"score_spread":0.15642773798469567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200324920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13639082,0.000039672803,0.860574,0.0018645561,0.00030876073,0.00041444655,0.00002172149,0.000040334242,0.00034566686],"genre_scores_gemma":[0.9964871,0.00007217804,0.0015322543,0.0001857799,0.000062862004,0.0000060009693,0.000027906653,0.000007534212,0.0016183769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987446,0.00017523301,0.00021237665,0.0005440134,0.00014412565,0.00017965227],"domain_scores_gemma":[0.99872935,0.0001810536,0.0002472631,0.00048905733,0.0002785827,0.000074715776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005207816,0.00017370746,0.00018420558,0.00007186374,0.0004906748,0.00024925673,0.00077055616,0.00009047286,0.000011894262],"category_scores_gemma":[0.000041657582,0.000116618095,0.0000947445,0.00072062906,0.00006745218,0.00017750199,0.000906908,0.0002386849,0.0000058011647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020569291,0.00017672851,0.0043307696,0.000071439135,0.00075488817,0.00000448652,0.008112698,0.8458317,0.00074144773,0.13255589,0.004170258,0.0030440115],"study_design_scores_gemma":[0.00022755694,0.000062121224,0.0010958224,0.000025342386,0.000091500035,0.0000016937078,0.0038713778,0.9910376,0.00075524766,0.00018254337,0.0024344139,0.00021477905],"about_ca_topic_score_codex":0.0010767437,"about_ca_topic_score_gemma":0.00051048945,"teacher_disagreement_score":0.8600963,"about_ca_system_score_codex":0.00009530464,"about_ca_system_score_gemma":0.000089853354,"threshold_uncertainty_score":0.4755548},"labels":[],"label_agreement":null},{"id":"W3200576466","doi":"10.1007/978-3-030-82139-5_5","title":"Optimal Control: Necessary Conditions of Optimality","year":2021,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Control (management); Computer science; Optimal control; Control theory (sociology); Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.016648792513830783,"score_gpt":0.24638929598720352,"score_spread":0.22974050347337274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3200576466","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.292132e-7,0.00008351959,0.53807455,0.0009901391,0.00007334806,0.000055091783,0.0000740045,0.000048918846,0.46059948],"genre_scores_gemma":[0.008597491,0.00011683495,0.18242599,0.0011574075,0.00009431503,0.000007801174,0.0004020981,0.00002039931,0.80717766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861616,0.000029011704,0.0004595429,0.00039579318,0.00038133594,0.00011818394],"domain_scores_gemma":[0.9983691,0.000137375,0.00029902108,0.0005473505,0.00056031084,0.00008684229],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001504734,0.00019393425,0.0004358438,0.00016961712,0.000075568474,0.00008302036,0.0005143323,0.00017490493,0.005802083],"category_scores_gemma":[0.00002122221,0.00018507165,0.0003142475,0.00010377654,0.00006154087,0.00024561537,0.00016715348,0.00014872568,0.00007321015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016013988,0.000026135407,0.000008073781,0.000010332492,0.00020767831,0.0000071509344,0.000011359295,0.025111593,0.0000071751765,0.97228235,0.0022228959,0.000103624756],"study_design_scores_gemma":[0.0015332409,0.00011418487,0.00052818866,0.00013710072,0.00052286196,0.000034509052,0.000020999589,0.8822487,0.00014919454,0.042960856,0.07058464,0.0011655423],"about_ca_topic_score_codex":0.000014960907,"about_ca_topic_score_gemma":0.000004966621,"teacher_disagreement_score":0.9293215,"about_ca_system_score_codex":0.000028356691,"about_ca_system_score_gemma":0.0002265196,"threshold_uncertainty_score":0.99510676},"labels":[],"label_agreement":null},{"id":"W3201140435","doi":"10.23952/asvao.3.2021.2.06","title":"A new linear convergence method for a Lipschitz pseudomonotone variational inequality","year":2021,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lipschitz continuity; Variational inequality; Convergence (economics); Mathematics; Inequality; Applied mathematics; Mathematical economics; Mathematical analysis; Economics; Macroeconomics","score_opus":0.020078323768017246,"score_gpt":0.29444413631827465,"score_spread":0.2743658125502574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201140435","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000060614268,0.00005674666,0.9975771,0.001604669,0.000072503484,0.00021715461,0.000032606076,0.00009638444,0.0002822441],"genre_scores_gemma":[0.016069975,0.00008705896,0.9811846,0.0010220829,0.00012250242,0.000054473807,0.0009217215,0.000013201014,0.00052437733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776757,0.00016500865,0.00060314714,0.00080169074,0.0004238838,0.00023869985],"domain_scores_gemma":[0.9981623,0.00026964108,0.00032223482,0.0004733724,0.00056902337,0.00020341975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007781129,0.00022430283,0.00048695682,0.00035952145,0.0003236288,0.00027340034,0.00028888212,0.00013277463,0.00036549265],"category_scores_gemma":[0.00016262702,0.00022461663,0.00025848064,0.0034516046,0.000016613063,0.00035239928,0.00014554997,0.00009409666,0.0000073707038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015510117,0.000047497753,0.00020204265,0.000008374996,0.0006450627,5.2595504e-7,0.00023373203,0.7506121,0.00013046667,0.24624152,0.00012293193,0.001740234],"study_design_scores_gemma":[0.00080920564,0.000015406762,0.0007410694,0.000002711831,0.00084264716,0.0000020411737,0.000038184786,0.99190927,0.00049940136,0.0045798905,0.0002892871,0.00027087476],"about_ca_topic_score_codex":0.00009914483,"about_ca_topic_score_gemma":0.000034088353,"teacher_disagreement_score":0.24166164,"about_ca_system_score_codex":0.000042174357,"about_ca_system_score_gemma":0.00028500022,"threshold_uncertainty_score":0.91596},"labels":[],"label_agreement":null},{"id":"W3202516699","doi":"10.23952/asvao.3.2021.1.02","title":"Approximation of common solutions for a finite family of generalized demimetric mappings and monotone inclusion problems in CAT(0) spaces","year":2021,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monotone polygon; Inclusion (mineral); Mathematics; Pure mathematics; Discrete mathematics; Applied mathematics; Algebra over a field; Sociology; Gender studies; Geometry","score_opus":0.022039603183926438,"score_gpt":0.24727465486497766,"score_spread":0.2252350516810512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202516699","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022807656,0.00036726164,0.97608376,0.00030759038,0.000011548439,0.0002891788,0.000020813757,0.000019388315,0.0000928],"genre_scores_gemma":[0.6492122,0.00054254156,0.34971553,0.00007069552,0.0000060498323,0.000042749245,0.0003857001,0.000005732025,0.000018820543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844944,0.00009722586,0.0006339459,0.0003855922,0.0002710342,0.00016276346],"domain_scores_gemma":[0.9987225,0.00017546097,0.00046108666,0.00023894236,0.00034888054,0.000053144453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006844958,0.00013948049,0.0004958014,0.0010139424,0.00023397447,0.00007178792,0.00014612795,0.00010060338,0.0000074725167],"category_scores_gemma":[0.00008180177,0.00013791371,0.0001057154,0.004669046,0.00004262643,0.00024082839,0.00033281703,0.000044936747,1.412301e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009650177,0.00011215842,0.0011559897,0.000058102196,0.00021054296,1.03301915e-7,0.0010319002,0.9528141,0.0024537384,0.04109753,0.0000060654725,0.0010500947],"study_design_scores_gemma":[0.0008477036,0.000019033136,0.0025076976,0.000014829153,0.0003826381,3.2802404e-7,0.00012733287,0.99210316,0.00075848674,0.0030910664,0.000011674749,0.00013606224],"about_ca_topic_score_codex":0.00020833487,"about_ca_topic_score_gemma":0.000080038495,"teacher_disagreement_score":0.6264045,"about_ca_system_score_codex":0.000031726508,"about_ca_system_score_gemma":0.0000595985,"threshold_uncertainty_score":0.5623958},"labels":[],"label_agreement":null},{"id":"W3207624214","doi":"","title":"Weak and strong convergence of generalized proximal point algorithms","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Monotone polygon; Mathematics; Algorithm; Monotonic function; Equivalence (formal languages); Convergence (economics); Strongly monotone; Sequence (biology); Point (geometry); Operator (biology); Regularization (linguistics); Applied mathematics; Discrete mathematics; Computer science; Mathematical analysis; Artificial intelligence","score_opus":0.05170547284877338,"score_gpt":0.1914484313721675,"score_spread":0.1397429585233941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3207624214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060969897,0.0000648511,0.9378353,0.00018160878,0.00018122123,0.00010793443,0.0000113086335,0.000047535683,0.0006003779],"genre_scores_gemma":[0.9614259,0.00024637574,0.037209436,0.00004305501,0.000024216943,5.4755185e-7,0.000030251305,0.0000059861377,0.0010142191],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876446,0.00011394754,0.00020072891,0.00067275786,0.00010026053,0.000147849],"domain_scores_gemma":[0.9987903,0.000037620568,0.0002463387,0.0005067045,0.0003157897,0.00010323526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015269988,0.00016596919,0.0002925439,0.00016977132,0.000071812676,0.000084850064,0.00059705874,0.00012390754,0.00012833043],"category_scores_gemma":[0.000022160973,0.00018772334,0.0001452058,0.00050268567,0.000066205226,0.00031774415,0.0011989212,0.00017228031,0.0000039422407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009655897,0.0000880839,0.004175259,0.000059724483,0.00020706428,0.000040319446,0.00020658538,0.3950841,0.00007806572,0.59978426,0.000048657017,0.00021822541],"study_design_scores_gemma":[0.0003244237,0.000016453632,0.0019707037,0.000027397273,0.000067756766,0.000002203964,0.00008401163,0.99206346,0.00021255396,0.005001624,0.000033328946,0.000196094],"about_ca_topic_score_codex":0.0002005182,"about_ca_topic_score_gemma":0.000020591491,"teacher_disagreement_score":0.9006258,"about_ca_system_score_codex":0.000056459343,"about_ca_system_score_gemma":0.00020998181,"threshold_uncertainty_score":0.76551354},"labels":[],"label_agreement":null},{"id":"W3209016250","doi":"10.1287/moor.2021.1164","title":"Directional Necessary Optimality Conditions for Bilevel Programs","year":2021,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Calmness; Mathematics; Directional derivative; Mathematical optimization; Constraint (computer-aided design); Normality; Bilevel optimization; Parametric statistics; Optimization problem; Function (biology); Metric (unit); Applied mathematics; Mathematical analysis; Statistics; Geometry","score_opus":0.18259648702591766,"score_gpt":0.43563346992666857,"score_spread":0.25303698290075094,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209016250","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023878391,0.000033018267,0.98960567,0.004586705,0.00005119822,0.00032327263,0.000056195655,0.00004083449,0.0029152443],"genre_scores_gemma":[0.15518156,0.000016306307,0.84108555,0.000037750204,0.00003825087,0.00028614124,0.00021833206,0.0000072726752,0.0031288308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858946,0.00011292218,0.00033748787,0.00023649681,0.00054722663,0.00017643425],"domain_scores_gemma":[0.9964164,0.00039488683,0.00003164227,0.00040342455,0.0026859343,0.000067725334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000950595,0.00006742838,0.00014851474,0.00019879818,0.00047361825,0.0002856332,0.00036425874,0.00004535274,0.00021247409],"category_scores_gemma":[0.0006688409,0.00006275644,0.000096467506,0.001189714,0.00007921294,0.00037023274,0.00015816018,0.00009694797,0.000023084736],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010865682,0.0008187708,0.00005950546,0.00006450375,0.00006594037,9.2220904e-7,0.00042337546,0.031164208,0.0022085484,0.96366984,0.0009444885,0.0005787904],"study_design_scores_gemma":[0.00020495309,0.000036725483,0.00022997393,0.000021182539,0.00000938457,0.0000074183613,0.00018492046,0.96126217,0.004272925,0.033063494,0.00062497327,0.00008190299],"about_ca_topic_score_codex":0.000019592382,"about_ca_topic_score_gemma":0.00004199704,"teacher_disagreement_score":0.93060637,"about_ca_system_score_codex":0.00003816239,"about_ca_system_score_gemma":0.00044041694,"threshold_uncertainty_score":0.36427367},"labels":[],"label_agreement":null},{"id":"W3209347123","doi":"10.1007/s10107-021-01718-y","title":"Best approximation mappings in Hilbert spaces","year":2021,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Linear subspace; Hilbert space; Affine transformation; Sequence (biology); Regular polygon; Affine space; Fixed point; Convergence (economics); Subspace topology; Combinatorics; Discrete mathematics; Pure mathematics; Mathematical analysis","score_opus":0.02120571688869173,"score_gpt":0.25765783399329056,"score_spread":0.23645211710459885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209347123","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014783144,0.000047545374,0.9861924,0.005104315,0.000030107378,0.000097790966,1.7095844e-7,0.000078556055,0.006970813],"genre_scores_gemma":[0.1533704,0.0000048462034,0.84521395,0.00024303621,0.000026204329,0.000037341048,0.0000091778,0.000006523141,0.0010884973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990198,0.00004561903,0.00026461144,0.0002419464,0.00025002545,0.0001780018],"domain_scores_gemma":[0.9994653,0.00010121438,0.000060540966,0.0002205367,0.00009553116,0.00005689272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026725148,0.000082971375,0.00015015791,0.000093781055,0.000059110145,0.00033202002,0.00020434936,0.00004441297,0.000101878104],"category_scores_gemma":[0.00024204212,0.000075648815,0.000057436973,0.0008289988,0.000017074182,0.0003319756,0.00011751062,0.0000774532,0.00015336399],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.8331457e-7,0.00029092524,0.00040597728,0.00008606029,0.000016271495,0.000016838676,0.0010250015,0.00043158958,0.000073669245,0.9421211,0.00003765988,0.055494253],"study_design_scores_gemma":[0.00026590642,0.000016197871,0.00023062591,0.00009596636,0.000013083137,0.000023292236,0.00025905,0.9004532,0.0004231557,0.09393509,0.0040800236,0.00020439095],"about_ca_topic_score_codex":0.0000058095106,"about_ca_topic_score_gemma":0.000006376026,"teacher_disagreement_score":0.9000216,"about_ca_system_score_codex":0.00003294983,"about_ca_system_score_gemma":0.000035753656,"threshold_uncertainty_score":0.3201677},"labels":[],"label_agreement":null},{"id":"W3210100510","doi":"","title":"The solvabilities of three optimization problems associated with second-order cone","year":2021,"lang":"en","type":"article","venue":"Journal of nonlinear and convex analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Cone (formal languages); Order (exchange); Mathematics; Applied mathematics; Mathematical optimization; Calculus (dental); Medicine; Orthodontics; Algorithm; Economics","score_opus":0.010523103360058643,"score_gpt":0.21360422366445453,"score_spread":0.20308112030439587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3210100510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018707333,0.000584127,0.9781487,0.0022339143,0.000039605977,0.000033926055,0.000007746754,0.0000072873,0.00023734388],"genre_scores_gemma":[0.8383899,0.00064532267,0.15915142,0.0003439929,0.000070031216,0.0000025233337,0.00003812046,0.000011096084,0.0013476139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879426,0.0001078584,0.0004988897,0.00012951455,0.00036934574,0.000100161196],"domain_scores_gemma":[0.99673474,0.00030508332,0.0005991984,0.00018994512,0.0021128282,0.000058223606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056031824,0.000086267384,0.00034787305,0.00017406241,0.00014069075,0.00015315761,0.00021491718,0.000042166506,0.00014083195],"category_scores_gemma":[0.00017715406,0.000052681196,0.00017828317,0.0018092007,0.00007267237,0.00027624113,0.000048733436,0.000101453275,3.2921693e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023350007,0.00020235915,0.02132296,0.000013599864,0.006429314,0.000008912427,0.00052758167,0.965916,0.00006120309,0.0037505208,0.00005697684,0.0016872339],"study_design_scores_gemma":[0.00042146663,0.00007393141,0.004159725,0.0000139497,0.000784531,0.00001251401,0.00016758798,0.99361366,0.000125862,0.0003445593,0.00020578314,0.00007643961],"about_ca_topic_score_codex":0.000008683558,"about_ca_topic_score_gemma":0.00029045978,"teacher_disagreement_score":0.81968254,"about_ca_system_score_codex":0.000017001239,"about_ca_system_score_gemma":0.00021498409,"threshold_uncertainty_score":0.21482769},"labels":[],"label_agreement":null},{"id":"W3212678422","doi":"10.14321/realanalexch.46.2.0423","title":"ON FUNCTIONS DETERMINED BY DENSE SETS","year":2021,"lang":"en","type":"article","venue":"Real Analysis Exchange","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus","funders":"","keywords":"Mathematics; Convex function; Cone (formal languages); Function (biology); Regular polygon; Set (abstract data type); Pure mathematics; Convex cone; Type (biology); Combinatorics; Convex set; Mathematical analysis; Convex optimization; Geometry; Algorithm","score_opus":0.014808711663861496,"score_gpt":0.2507113027225677,"score_spread":0.2359025910587062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212678422","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011035001,0.00014044502,0.97302824,0.0039814734,0.00012156439,0.000052566418,0.000056827685,0.00016725688,0.011416635],"genre_scores_gemma":[0.94321537,0.0004338169,0.013455188,0.0030157233,0.000105676576,0.000041849868,0.0009472012,0.00001633777,0.038768806],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868494,0.00012419386,0.00021279757,0.0004415408,0.00035232186,0.00018419047],"domain_scores_gemma":[0.9989113,0.00012007655,0.00009330348,0.0005198594,0.00022605502,0.00012935558],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014341077,0.0001242494,0.00024013671,0.00033434134,0.00017877648,0.00015699121,0.00025192872,0.000056031382,0.0010390603],"category_scores_gemma":[0.00005228605,0.000113679474,0.00030984025,0.0033276842,0.000011709077,0.00018945921,0.000100033554,0.000064863525,0.00022968135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100695266,0.0045214267,0.025411712,0.00010921369,0.02306656,0.0007601638,0.004648019,0.15352607,0.006049403,0.24013208,0.38197514,0.15969953],"study_design_scores_gemma":[0.00034423315,0.00004688107,0.0064114565,0.000004607263,0.0009557702,0.0000060832617,0.000028093653,0.98113406,0.00038809783,0.00095946674,0.009401704,0.0003195228],"about_ca_topic_score_codex":0.00012819948,"about_ca_topic_score_gemma":0.00037007954,"teacher_disagreement_score":0.95957303,"about_ca_system_score_codex":0.000055525572,"about_ca_system_score_gemma":0.000042628344,"threshold_uncertainty_score":0.9998741},"labels":[],"label_agreement":null},{"id":"W3212784844","doi":"10.1007/s10589-022-00364-0","title":"Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems","year":2022,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Monotone polygon; Regularization (linguistics); Stationary point; Minification; Property (philosophy); Quadratic equation; Applied mathematics; Rate of convergence; Convergence (economics); Mathematical optimization; Mathematical analysis; Computer science; Geometry","score_opus":0.016634547184986328,"score_gpt":0.2905574431592843,"score_spread":0.273922895974298,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212784844","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000011787011,0.00009182021,0.992652,0.0048405807,0.00008911147,0.0011565045,0.000103446415,0.0002663555,0.0007883962],"genre_scores_gemma":[0.012536685,0.000023872019,0.9806944,0.0019134488,0.00011236193,0.0022625152,0.0017024657,0.00002972174,0.00072450686],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784994,0.00016925407,0.0005948857,0.000683255,0.00045316093,0.00024947897],"domain_scores_gemma":[0.99807036,0.0004714885,0.00038823008,0.00029339053,0.0006326162,0.00014390225],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0005228565,0.00020978929,0.00024161057,0.00035423067,0.0014184237,0.00027419082,0.00047727124,0.00005941599,0.00018355697],"category_scores_gemma":[0.00005637888,0.00023958506,0.00012075234,0.001546495,0.00003563526,0.0004536021,0.0002632781,0.00013170783,0.000008289292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044295703,0.00009676876,0.000056553283,0.000017753235,0.000036526624,9.6945286e-8,0.00018713922,0.76202995,0.0000095749565,0.23202835,0.00056974066,0.0049631186],"study_design_scores_gemma":[0.00071879587,0.000053285446,0.00014178512,0.0000037925786,0.000041076913,0.000015835554,0.000071996204,0.9517422,0.000012242424,0.019273164,0.027662523,0.0002633382],"about_ca_topic_score_codex":0.0000075381713,"about_ca_topic_score_gemma":0.0000013914417,"teacher_disagreement_score":0.21275517,"about_ca_system_score_codex":0.00011611298,"about_ca_system_score_gemma":0.00019461838,"threshold_uncertainty_score":0.99988157},"labels":[],"label_agreement":null},{"id":"W3216731464","doi":"10.23952/asvao.6.2024.2.01","title":"Forward-backward splitting with deviations for monotone inclusions","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Knut och Alice Wallenbergs Stiftelse","keywords":"Monotone polygon; Mathematics; Convergence (economics); Norm (philosophy); Bounded function; Monotonic function; Applied mathematics; Algorithm; Rate of convergence; Metric (unit); Mathematical optimization; Computer science; Mathematical analysis","score_opus":0.010706320975543498,"score_gpt":0.25210696461298776,"score_spread":0.24140064363744426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3216731464","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035926895,0.00012663688,0.99663997,0.0014169539,0.000039775932,0.00034719854,0.00002795709,0.00024935463,0.0007928986],"genre_scores_gemma":[0.44965336,0.000097124495,0.5489366,0.00030447455,0.000060763043,0.00013484474,0.00052077055,0.00001882732,0.00027321387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983374,0.0000390808,0.00040837357,0.0006555782,0.00032473143,0.00023485352],"domain_scores_gemma":[0.9989612,0.00019374861,0.0001383986,0.0003390902,0.00024443847,0.00012313879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044795746,0.00020920887,0.0003334064,0.0007602106,0.00058597705,0.00064278924,0.00024502684,0.00008847011,0.000058293543],"category_scores_gemma":[0.000035933776,0.00017112415,0.00017816335,0.0038801078,0.00003342937,0.00046829993,0.00012520442,0.00008829204,0.0000075273724],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000065667546,0.000023078965,0.00011297742,0.000017186398,0.0006831673,4.9287183e-7,0.00038394012,0.7426316,0.000025164703,0.2542805,0.00007552234,0.0017597714],"study_design_scores_gemma":[0.00028957563,0.000026974834,0.00023351608,0.000012180362,0.001264061,0.0000013379807,0.000082174345,0.9948068,0.000071991955,0.0023968036,0.00057679473,0.00023775268],"about_ca_topic_score_codex":0.000027759612,"about_ca_topic_score_gemma":0.000033454122,"teacher_disagreement_score":0.4492941,"about_ca_system_score_codex":0.000058437956,"about_ca_system_score_gemma":0.00009401502,"threshold_uncertainty_score":0.69782406},"labels":[],"label_agreement":null},{"id":"W34993526","doi":"10.1186/s13663-021-00709-0","title":"明石欽司著『ウェストファリア条約--その実像と神話』","year":2010,"lang":"en","type":"article","venue":"国際法外交雑誌","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Vetenskapsrådet","keywords":"Computer science","score_opus":0.003785155928821781,"score_gpt":0.2072024351628342,"score_spread":0.20341727923401243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W34993526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008356074,0.000013252319,0.93868715,0.00843154,0.0009003165,0.00006203667,0.0000022438278,0.0002651035,0.04328231],"genre_scores_gemma":[0.84438914,0.0000050950325,0.14831147,0.0016066944,0.00020340965,0.0000067869346,0.0000078965395,0.000006448568,0.005463089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993317,0.000016892753,0.00012291732,0.00020593005,0.00019202943,0.0001304889],"domain_scores_gemma":[0.99936974,0.00003660951,0.00004551749,0.00037505443,0.00009261017,0.00008045799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014327066,0.0000680565,0.00007692245,0.00008583124,0.00010040446,0.00013301983,0.00049406546,0.000046261626,0.0005873974],"category_scores_gemma":[0.000053833162,0.000059732,0.000059123868,0.0004045069,0.000017538012,0.000318219,0.00009778975,0.00011539626,0.0006455984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.779037e-7,0.000057326513,0.0017076075,0.000001955839,0.000019507934,0.0000033835418,0.00018176042,0.00056304934,0.0023385496,0.98069763,0.0063428404,0.008085434],"study_design_scores_gemma":[0.0005501186,0.000036219204,0.023232242,0.000004080768,0.000021490936,0.000022912427,0.000014576947,0.682112,0.00286142,0.026343571,0.2643414,0.0004599963],"about_ca_topic_score_codex":0.000018009938,"about_ca_topic_score_gemma":0.000024077013,"teacher_disagreement_score":0.95435405,"about_ca_system_score_codex":0.0000066199673,"about_ca_system_score_gemma":0.000040611434,"threshold_uncertainty_score":0.8298077},"labels":[],"label_agreement":null},{"id":"W356322785","doi":"10.1007/s10589-015-9762-4","title":"A proximal bundle method for nonsmooth nonconvex functions with inexact information","year":2015,"lang":"en","type":"article","venue":"Computational Optimization and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":91,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Conselho Nacional de Desenvolvimento Científico e Tecnológico","keywords":"Subgradient method; Mathematics; Convergence (economics); Mathematical optimization; Bounded function; Bundle; Limit (mathematics); Class (philosophy); Function (biology); Applied mathematics; Point (geometry); Computer science; Mathematical analysis","score_opus":0.015490618293717917,"score_gpt":0.2657578315025077,"score_spread":0.2502672132087898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W356322785","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000006519393,0.00002988158,0.9933828,0.003718014,0.000038919694,0.0008051996,0.000049904407,0.00019422898,0.0017745495],"genre_scores_gemma":[0.008941777,0.0000058946366,0.98765993,0.0011612644,0.000075451964,0.0008130578,0.0010085047,0.000011446677,0.00032269917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988315,0.000045896413,0.00035068527,0.00030529415,0.00030983562,0.00015678411],"domain_scores_gemma":[0.9979424,0.00019799432,0.00022360787,0.0002147782,0.001216237,0.00020499616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028738333,0.00015888715,0.00016271294,0.000281351,0.0003535228,0.00035056873,0.00022693035,0.00006242034,0.000020055408],"category_scores_gemma":[0.000050848987,0.00014302162,0.00004781988,0.000979007,0.00004285613,0.0014383863,0.00006301043,0.000069635316,0.000028284412],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012326811,0.00008457743,0.00006947951,0.00000822255,0.000034138593,2.818894e-8,0.00015561092,0.8313537,4.9482975e-7,0.16263144,0.0007790902,0.004870868],"study_design_scores_gemma":[0.00085005286,0.0001109821,0.00013924725,0.0000045597344,0.000039385715,0.000015512223,0.000079370344,0.9613622,0.000004991946,0.005478222,0.03172737,0.00018811235],"about_ca_topic_score_codex":0.0000109965,"about_ca_topic_score_gemma":0.0000030844883,"teacher_disagreement_score":0.1571532,"about_ca_system_score_codex":0.000062750274,"about_ca_system_score_gemma":0.00032974864,"threshold_uncertainty_score":0.58322525},"labels":[],"label_agreement":null},{"id":"W4205379046","doi":"10.23952/jano.3.2021.3.07","title":"A note on minimax optimization problems with an infinite number of constraints","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Minimax; Mathematical optimization; Mathematics; Computer science; Applied mathematics","score_opus":0.009611660392554573,"score_gpt":0.24041513453907434,"score_spread":0.23080347414651978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205379046","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077460194,0.0000097687725,0.99517846,0.0005682082,0.0000429236,0.000067925044,0.0000026835833,0.0000148428,0.0033405677],"genre_scores_gemma":[0.31231648,0.00006975513,0.6872095,0.00032524564,0.0000348149,0.0000019729646,0.000017241038,0.000008257974,0.000016711669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987171,0.000057137597,0.000502244,0.00020963242,0.0003992988,0.00011456459],"domain_scores_gemma":[0.99839175,0.0000974773,0.0005829206,0.00015794119,0.0006369231,0.00013299276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020167798,0.00012806388,0.00029572906,0.00013229247,0.00007332049,0.000105810104,0.00015840742,0.00006977458,0.00015000347],"category_scores_gemma":[0.000044046275,0.00010023211,0.000053556712,0.00069942564,0.00005917888,0.0004468584,0.000034598255,0.00012211074,0.0000016380175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009342449,0.00022402607,0.000127997,0.0000106768175,0.0000460012,0.0000051492675,0.00029335954,0.9759187,0.00007096991,0.019741213,0.000011381571,0.0034571139],"study_design_scores_gemma":[0.00096096116,0.00025324797,0.00017597787,0.00003617894,0.000046961202,0.000073872485,0.00004772835,0.9972535,0.00038268414,0.0005606041,0.0000761043,0.00013220121],"about_ca_topic_score_codex":0.0000012417787,"about_ca_topic_score_gemma":2.0525017e-7,"teacher_disagreement_score":0.3115419,"about_ca_system_score_codex":0.000023919894,"about_ca_system_score_gemma":0.00016195372,"threshold_uncertainty_score":0.40873468},"labels":[],"label_agreement":null},{"id":"W4205560202","doi":"10.23952/jano.3.2021.3.08","title":"Dual three-operator splitting algorithms for solving composite monotone inclusion with applications to convex minimization","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monotone polygon; Dual (grammatical number); Operator splitting; Regular polygon; Convex optimization; Minification; Operator (biology); Algorithm; Mathematics; Composite number; Combinatorics; Computer science; Mathematical optimization; Applied mathematics","score_opus":0.01150794879687846,"score_gpt":0.24825139642582314,"score_spread":0.23674344762894467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205560202","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060362497,0.00006572927,0.9962743,0.002518942,0.00005093184,0.00029509573,0.0000044918525,0.000027764841,0.00015914382],"genre_scores_gemma":[0.1297079,0.000037701604,0.86912674,0.0008629067,0.00015698167,0.00003567529,0.000038190068,0.000013853728,0.000020065541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868417,0.000021408088,0.0005070862,0.00028706342,0.00034511415,0.00015514196],"domain_scores_gemma":[0.9982813,0.00014460704,0.00037242225,0.00015102007,0.00086820644,0.00018244321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024877174,0.0001407219,0.0003007439,0.0001669254,0.00047289062,0.00022024396,0.00017355086,0.000063693136,0.00001642099],"category_scores_gemma":[0.000037749804,0.00011793486,0.000060109916,0.00081479346,0.000018628589,0.00037220123,0.000220612,0.000095701456,0.0000013935924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007606761,0.00012406804,0.000098277065,0.000014657374,0.00006207631,0.000002440373,0.0004389602,0.96812475,0.0016488149,0.019159082,0.000046430836,0.010204403],"study_design_scores_gemma":[0.0008451183,0.00011956375,0.00019414624,0.000021941541,0.00006247772,0.000030229716,0.00005476489,0.994825,0.0018323923,0.00088517653,0.0009603716,0.00016879813],"about_ca_topic_score_codex":0.0000016543963,"about_ca_topic_score_gemma":5.6140533e-7,"teacher_disagreement_score":0.12910429,"about_ca_system_score_codex":0.000052068954,"about_ca_system_score_gemma":0.00013278975,"threshold_uncertainty_score":0.4809244},"labels":[],"label_agreement":null},{"id":"W4205628230","doi":"10.28924/2291-8639-20-2022-3","title":"Well-Posedness of Triequilibrium-Like Problems","year":2022,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Class (philosophy); Metric (unit); Mathematical economics; Field (mathematics); Work (physics); Applied mathematics; Mathematical optimization; Calculus (dental); Pure mathematics; Computer science; Artificial intelligence; Operations management; Economics; Mechanical engineering","score_opus":0.007681563083107745,"score_gpt":0.2459619756583126,"score_spread":0.23828041257520485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205628230","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0056744097,0.00018294386,0.98959357,0.003584067,0.00010644483,0.00006756104,0.000023169909,0.000009549999,0.0007583063],"genre_scores_gemma":[0.9882451,0.000120809396,0.010791356,0.00031324688,0.00007501862,0.000021456048,0.000026398739,0.0000037067243,0.00040290257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998515,0.00006352642,0.0005624128,0.0001505745,0.0006412692,0.00006719799],"domain_scores_gemma":[0.9982943,0.000083678286,0.0006960315,0.00017845974,0.0006849534,0.00006258364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043787167,0.00006873787,0.00021810395,0.00076331437,0.00011278616,0.00007901558,0.00089130626,0.00001583917,0.0002546296],"category_scores_gemma":[0.000011445702,0.00006273767,0.00025467534,0.0015386135,0.000030362344,0.00026780483,0.00023124914,0.00009939751,0.0000017998102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044237262,0.0011339354,0.019110814,0.000012653552,0.007019664,0.000008838343,0.000996273,0.6184602,0.0016854184,0.3255182,0.0014472023,0.024562588],"study_design_scores_gemma":[0.001752815,0.00024464834,0.022945033,0.000012446859,0.0017970282,0.00015257414,0.0005500867,0.72915566,0.0008750568,0.020609705,0.22146088,0.00044406654],"about_ca_topic_score_codex":0.00002618631,"about_ca_topic_score_gemma":0.0000046668365,"teacher_disagreement_score":0.9825707,"about_ca_system_score_codex":0.000041095816,"about_ca_system_score_gemma":0.000082416416,"threshold_uncertainty_score":0.27880153},"labels":[],"label_agreement":null},{"id":"W4205821035","doi":"10.23952/jano.3.2021.3.04","title":"New linear convergence results on quasi-variational inequalities","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Variational inequality; Applied mathematics; Inequality; Mathematics; Mathematical economics; Mathematical analysis; Economics; Economic growth","score_opus":0.015783234826559495,"score_gpt":0.24570173668053172,"score_spread":0.22991850185397222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205821035","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006694256,0.000036939466,0.9931047,0.0045865257,0.00018619128,0.00002932547,0.0000034747816,0.000017150447,0.0019687817],"genre_scores_gemma":[0.13050103,0.00019205992,0.8671799,0.0013950322,0.00028977776,0.0000010249914,0.000028851766,0.000007130408,0.00040524022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986867,0.00006272262,0.00053439813,0.00019134374,0.00042242793,0.00010243802],"domain_scores_gemma":[0.9987014,0.00022617493,0.00039867958,0.00013069401,0.00039507428,0.00014796079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032431533,0.00010111825,0.00021230322,0.00012135881,0.00009214201,0.0001094355,0.00016860563,0.00005798493,0.000120963836],"category_scores_gemma":[0.00020777962,0.00008642281,0.000067212684,0.0005167695,0.000011826065,0.0003056006,0.000050329094,0.0001225256,0.000008301127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085171894,0.00008198989,0.000017813614,0.0000029324117,0.000036086334,0.0000044138924,0.00027174206,0.76447463,0.000041683295,0.23183581,0.00067928,0.0024684556],"study_design_scores_gemma":[0.0008767413,0.000112112575,0.00029910877,0.000012053089,0.000020586336,0.000018143412,0.0000430383,0.99201286,0.0003678201,0.004153828,0.001965199,0.00011850045],"about_ca_topic_score_codex":0.0000044112917,"about_ca_topic_score_gemma":1.7836899e-7,"teacher_disagreement_score":0.22768198,"about_ca_system_score_codex":0.000029872883,"about_ca_system_score_gemma":0.0002492885,"threshold_uncertainty_score":0.352422},"labels":[],"label_agreement":null},{"id":"W4206290566","doi":"10.23952/jano.3.2021.3.05","title":"On sequential optimality theorems for linear fractional optimization problems involving integral functions defined on $L_n^2 [0,1]$","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Mathematics; Applied mathematics; Mathematical optimization","score_opus":0.01847058817465212,"score_gpt":0.2505827690994383,"score_spread":0.23211218092478617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206290566","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001950765,0.000034951645,0.9956243,0.0022754313,0.00035603181,0.00017342689,0.000011443356,0.000042702402,0.0012866182],"genre_scores_gemma":[0.18594599,0.00016877746,0.8118792,0.0013214921,0.00033344902,0.000025249401,0.00017769731,0.000024627423,0.00012348608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823177,0.000086880136,0.0006490368,0.00036041244,0.00047912786,0.00019275134],"domain_scores_gemma":[0.9978595,0.00040071592,0.0005621415,0.00018871934,0.00083215785,0.00015680993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000450956,0.00020139813,0.00033064574,0.00025638798,0.00032673098,0.00023425856,0.0001985472,0.00012765964,0.00014872885],"category_scores_gemma":[0.000293117,0.00017010147,0.00018588985,0.00066487625,0.000037541744,0.00048725234,0.000056443285,0.00026075845,0.0000044631474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016811455,0.00024779732,0.000012240375,0.000009647481,0.00007714766,0.0000014825895,0.0000759636,0.8085729,0.00008368103,0.18991838,0.00020760686,0.00062502385],"study_design_scores_gemma":[0.0010629026,0.0002887084,0.000038520884,0.000031257434,0.00006486972,0.000021130378,0.00004303415,0.9899506,0.00022064184,0.0077457638,0.00035135626,0.00018120235],"about_ca_topic_score_codex":0.0000023453872,"about_ca_topic_score_gemma":3.4446342e-7,"teacher_disagreement_score":0.1857509,"about_ca_system_score_codex":0.00010751298,"about_ca_system_score_gemma":0.00019054447,"threshold_uncertainty_score":0.69365364},"labels":[],"label_agreement":null},{"id":"W4206398096","doi":"10.23952/jnva.5.2021.3.08","title":"Convergence of a nonmonotone projected gradient method for nonconvex multiobjective optimization","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Tianjin City; National Natural Science Foundation of China","keywords":"Convergence (economics); Mathematical optimization; Applied mathematics; Mathematics; Gradient method; Multi-objective optimization; Proximal Gradient Methods; Computer science; Economics; Convex optimization; Regular polygon","score_opus":0.013567396342799578,"score_gpt":0.2938982973958659,"score_spread":0.28033090105306635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206398096","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000910902,0.00009726652,0.9971938,0.0015085788,0.0001010875,0.00009034325,0.000051024697,0.0000074880527,0.000039506725],"genre_scores_gemma":[0.0473909,0.000090443296,0.95202506,0.00016114356,0.00010271581,0.000005772698,0.000082273036,0.000005232847,0.00013648266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982899,0.00016429306,0.00076587615,0.0002492472,0.00041738577,0.000113294285],"domain_scores_gemma":[0.99512595,0.00045668846,0.0008697974,0.00015970785,0.003295211,0.00009266689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007531182,0.00011887576,0.00047178147,0.0005893765,0.000104861116,0.00006695496,0.00020673883,0.00006656267,0.000093223956],"category_scores_gemma":[0.000440847,0.00010298562,0.00042021458,0.0022990727,0.000020554353,0.0004284092,0.0000582651,0.00008506361,4.933563e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061978484,0.00038081873,0.0030347777,0.000022810595,0.0031141904,0.000003949918,0.00068068027,0.96978205,0.0006368043,0.021312429,0.000041099127,0.00092838134],"study_design_scores_gemma":[0.00078790344,0.000084847576,0.007876285,0.000008526002,0.0010658554,0.000019083369,0.000068014495,0.98818755,0.00088013906,0.00076917734,0.00014453307,0.000108083324],"about_ca_topic_score_codex":0.000030931697,"about_ca_topic_score_gemma":0.000014991613,"teacher_disagreement_score":0.04648,"about_ca_system_score_codex":0.00004531938,"about_ca_system_score_gemma":0.00037905265,"threshold_uncertainty_score":0.41996318},"labels":[],"label_agreement":null},{"id":"W4206453027","doi":"10.23952/jnva.5.2021.3.04","title":"Continuous-time ergodic algorithm for solving monotone variational inequalities","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Bộ Giáo dục và Ðào tạo","keywords":"Ergodic theory; Monotone polygon; Variational inequality; Mathematics; Inequality; Algorithm; Applied mathematics; Mathematical optimization; Computer science; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.012604124807100697,"score_gpt":0.2549136594822756,"score_spread":0.24230953467517494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206453027","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006820237,0.0002544011,0.9949418,0.0037218,0.00013005857,0.000051538107,0.000107798216,0.000017166554,0.00009345625],"genre_scores_gemma":[0.01775341,0.00012186727,0.97888494,0.0007800719,0.0006700968,0.0000064260284,0.00027923664,0.000010710724,0.0014932293],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787813,0.00014139536,0.00088147516,0.00028443412,0.0006327888,0.00018177566],"domain_scores_gemma":[0.9958264,0.00086815987,0.00068209134,0.00017923175,0.0022988026,0.00014527704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012426189,0.00016125188,0.0005559572,0.0006039295,0.00024008595,0.00032070148,0.000285797,0.00008851617,0.00031567138],"category_scores_gemma":[0.00047398114,0.00014529066,0.00053296,0.0013751643,0.000023701787,0.00071746233,0.000093653245,0.0001269743,0.0000066691614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011390507,0.0019176669,0.011229921,0.00006893549,0.025934003,0.000081889135,0.0022406674,0.29274845,0.0023356506,0.621033,0.0021519663,0.040143903],"study_design_scores_gemma":[0.00072326494,0.000050357507,0.0076690326,0.000008440205,0.0009850598,0.000039037546,0.000042099386,0.9812746,0.000090305104,0.0074036694,0.0015449848,0.00016912098],"about_ca_topic_score_codex":0.000017769875,"about_ca_topic_score_gemma":0.000005990345,"teacher_disagreement_score":0.68852615,"about_ca_system_score_codex":0.000057492445,"about_ca_system_score_gemma":0.00045016446,"threshold_uncertainty_score":0.59247816},"labels":[],"label_agreement":null},{"id":"W4206517921","doi":"10.23952/jnva.5.2021.3.09","title":"An extragradient method for vector equilibrium problems on Hadamard manifolds","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; University of Texas at El Paso","keywords":"Hadamard transform; Mathematics; Applied mathematics; Mathematical optimization; Computer science; Pure mathematics; Mathematical analysis","score_opus":0.019740614855887167,"score_gpt":0.29815873763120415,"score_spread":0.27841812277531697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206517921","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00172107,0.00009100746,0.9918977,0.005945818,0.00013216751,0.000054052358,0.000038577462,0.000012999828,0.0001065797],"genre_scores_gemma":[0.10615665,0.000042458523,0.8921125,0.0008261447,0.00042716696,0.0000048176776,0.00011139654,0.000008931875,0.00030996144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824303,0.00017890557,0.00059742405,0.00030684733,0.0005205029,0.00015329415],"domain_scores_gemma":[0.9975843,0.00035241037,0.000442991,0.00023453699,0.001205906,0.00017984764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094339624,0.00013749643,0.000393007,0.0004891855,0.00012596635,0.00026601122,0.00030109732,0.00006678247,0.00011194421],"category_scores_gemma":[0.00014568612,0.00011224352,0.00045278337,0.0013257362,0.000009802388,0.0005056251,0.00004188315,0.00010850865,0.0000021678864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006600787,0.0010099367,0.0019064029,0.000026642241,0.0038553833,0.00002088241,0.00044827576,0.6777949,0.0022891324,0.3079174,0.0002929322,0.004372169],"study_design_scores_gemma":[0.0005079711,0.00020736767,0.017112125,0.000007385425,0.00080922706,0.0000302965,0.000018956367,0.97467184,0.00022200262,0.004091308,0.0021851812,0.0001363563],"about_ca_topic_score_codex":0.000010836627,"about_ca_topic_score_gemma":0.000018651794,"teacher_disagreement_score":0.30382606,"about_ca_system_score_codex":0.00004670651,"about_ca_system_score_gemma":0.00021342175,"threshold_uncertainty_score":0.45771578},"labels":[],"label_agreement":null},{"id":"W4206661318","doi":"10.1007/978-1-4615-0011-7_9","title":"Globally Optimal Parameters","year":2001,"lang":"en","type":"book-chapter","venue":"Applied optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Mathematical optimization; Feasible region; Interval (graph theory); Stability (learning theory); Mathematics; Set (abstract data type); Linear programming; Regular polygon; Bellman equation; Function (biology); Lagrangian; Property (philosophy); Computer science; Applied mathematics","score_opus":0.012668658230964622,"score_gpt":0.20439649108769364,"score_spread":0.191727832856729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206661318","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[9.804497e-8,0.00003111103,0.53964984,0.00034871034,0.00010623888,0.00016900222,0.0000067962837,0.00019488414,0.45949334],"genre_scores_gemma":[0.00026519972,0.00039737415,0.8029049,0.0014129509,0.00013603017,0.000029190718,0.0006158512,0.000063448904,0.19417503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977476,0.000014093277,0.00052207755,0.0007761362,0.00066682795,0.00027325857],"domain_scores_gemma":[0.9983861,0.000061256294,0.0004399324,0.00071866607,0.00024485195,0.00014922163],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017497689,0.0004193447,0.00040048498,0.00032974302,0.0001788832,0.0003858101,0.0009629712,0.00039165892,0.00091839675],"category_scores_gemma":[0.00001361365,0.00044518805,0.00019267175,0.000272826,0.000049198887,0.00031179012,0.00025372158,0.00022361525,0.0004292227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040743785,0.000010867723,4.4982784e-7,0.000003027225,0.00005994295,0.0000028865245,0.000018195946,0.52951753,5.737605e-7,0.4667938,0.0013217335,0.0022669074],"study_design_scores_gemma":[0.00035582826,0.000027851791,0.0000024196192,0.000020170204,0.000105792045,0.000009843119,0.000002756587,0.9334296,0.000008142896,0.012234168,0.053197708,0.00060569006],"about_ca_topic_score_codex":0.0000056116287,"about_ca_topic_score_gemma":0.000001630504,"teacher_disagreement_score":0.45455965,"about_ca_system_score_codex":0.00015867743,"about_ca_system_score_gemma":0.00013165563,"threshold_uncertainty_score":0.9999949},"labels":[],"label_agreement":null},{"id":"W4207048615","doi":"10.23952/jnva.6.2022.1.04","title":"An inertial non-monotonic self-adaptive iterative algorithm for solving equilibrium problems","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"King Mongkut's University of Technology Thonburi; National Research Council of Thailand","keywords":"Monotonic function; Inertial frame of reference; Applied mathematics; Mathematical optimization; Iterative method; Mathematics; Computer science; Algorithm; Mathematical analysis; Physics; Classical mechanics","score_opus":0.010984752875708444,"score_gpt":0.254817768286501,"score_spread":0.24383301541079255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4207048615","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033093146,0.00006856902,0.9952109,0.0010015494,0.0001342568,0.00012708949,0.00008951272,0.000019692641,0.000039125218],"genre_scores_gemma":[0.23730092,0.000016311931,0.7617119,0.00037007825,0.00038800796,0.00002435054,0.00009796202,0.000009780167,0.00008066416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980759,0.00014189376,0.00066693086,0.00030421524,0.00062955957,0.0001814863],"domain_scores_gemma":[0.9978458,0.00023334319,0.0006999974,0.00017132428,0.00090329145,0.00014623489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010450332,0.0001547572,0.00040625138,0.00078542123,0.00041640116,0.00023965363,0.00047952586,0.000041655207,0.0001000719],"category_scores_gemma":[0.00003534961,0.00013677051,0.00038360755,0.0016560341,0.00001498179,0.0010151182,0.00014833905,0.00019620711,8.5945953e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005993789,0.0009285521,0.00095259055,0.000008342691,0.004322864,0.000008257254,0.0027685892,0.9707901,0.0006329257,0.012552686,0.00014213525,0.006833058],"study_design_scores_gemma":[0.0007156593,0.00047941363,0.0025028123,0.000002474508,0.0007797507,0.000020729563,0.000089044115,0.9933289,0.000032870645,0.0012980467,0.00058493804,0.00016535778],"about_ca_topic_score_codex":0.000023143572,"about_ca_topic_score_gemma":0.0000062267636,"teacher_disagreement_score":0.23399161,"about_ca_system_score_codex":0.00012030692,"about_ca_system_score_gemma":0.00032494788,"threshold_uncertainty_score":0.55773395},"labels":[],"label_agreement":null},{"id":"W4210360025","doi":"10.23952/asvao.4.2022.1.01","title":"Karush-Kuhn-Tucker optimality conditions and duality for nonsmooth multiobjective semi-infinite programming problems with vanishing constraints","year":2022,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Duality (order theory); Mathematics; Mathematical optimization; Applied mathematics; Combinatorics","score_opus":0.014412729551627309,"score_gpt":0.25142750087246424,"score_spread":0.23701477132083693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210360025","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023355237,0.00003424535,0.9955981,0.00038952046,0.000024593886,0.0008299727,0.00018199629,0.00013685951,0.0004691961],"genre_scores_gemma":[0.57234484,0.000022361239,0.42574653,0.00030134516,0.000018336672,0.0004336832,0.0010694226,0.000014908306,0.000048595823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99770594,0.00017863976,0.0004953203,0.00083634903,0.0004748133,0.00030891612],"domain_scores_gemma":[0.99847436,0.00022340193,0.00043336806,0.0003297637,0.0003875697,0.00015151962],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009835181,0.0002634109,0.00045585175,0.00044667287,0.0014547497,0.0005118107,0.00023279597,0.000071082744,0.0001074935],"category_scores_gemma":[0.00005113635,0.00024841522,0.00011931029,0.0026870081,0.00015689858,0.0004918986,0.00021095935,0.00017740499,6.313334e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027307075,0.0001176339,0.0014571382,0.000020761801,0.0008263935,6.394295e-7,0.0013334585,0.94729203,0.00003536973,0.04664142,0.000016518681,0.0022313292],"study_design_scores_gemma":[0.0009335955,0.00008661398,0.0020745303,0.000005314797,0.00093191344,0.000006036174,0.000701588,0.9940104,0.000034657936,0.0006733651,0.00019347468,0.00034850693],"about_ca_topic_score_codex":0.000081016056,"about_ca_topic_score_gemma":0.000053627846,"teacher_disagreement_score":0.5700093,"about_ca_system_score_codex":0.00009244007,"about_ca_system_score_gemma":0.00011238568,"threshold_uncertainty_score":0.9999968},"labels":[],"label_agreement":null},{"id":"W4210554480","doi":"10.23952/asvao.4.2022.1.05","title":"A new algorithm for solving strongly monotone equilibrium and multivalued variational inequality problems","year":2022,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational inequality; Monotone polygon; Mathematics; Inequality; Applied mathematics; Algorithm; Mathematical optimization; Mathematical economics; Mathematical analysis; Geometry","score_opus":0.017327016398728756,"score_gpt":0.2494597300952741,"score_spread":0.23213271369654537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210554480","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033167453,0.00007888228,0.99814934,0.00058724725,0.00005181397,0.0004910695,0.0000743753,0.000106969506,0.00012863438],"genre_scores_gemma":[0.11861309,0.000023944312,0.8795347,0.00025823206,0.00007352764,0.00020505204,0.0010142401,0.00001803509,0.00025918367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977608,0.00011380169,0.0005564975,0.0007634394,0.0005309444,0.0002745736],"domain_scores_gemma":[0.9987697,0.00016428943,0.00037826464,0.00032276002,0.00019253165,0.00017246882],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088374136,0.00023177949,0.00042553825,0.0005354477,0.000591234,0.00035989858,0.00030739172,0.00006819042,0.00016488411],"category_scores_gemma":[0.000039668827,0.00024099523,0.00014974758,0.0020982758,0.000025235095,0.00043572107,0.00037401408,0.00012487038,7.9163686e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013068516,0.0000599449,0.00024427858,0.000007933998,0.0005409374,1.9256832e-7,0.00058724644,0.9395799,0.00009113481,0.052162588,0.000067405694,0.006645372],"study_design_scores_gemma":[0.0011794755,0.000049487036,0.0008538097,0.0000016307125,0.0005533243,0.0000013101605,0.00010910955,0.99373055,0.0000249321,0.0031121646,0.00009958773,0.00028463334],"about_ca_topic_score_codex":0.00017723913,"about_ca_topic_score_gemma":0.000010220935,"teacher_disagreement_score":0.11861464,"about_ca_system_score_codex":0.000084919455,"about_ca_system_score_gemma":0.00012635541,"threshold_uncertainty_score":0.98275},"labels":[],"label_agreement":null},{"id":"W4210597426","doi":"10.23952/asvao.4.2022.1.07","title":"Optimal solutions to variational inequalities via Bregman distances in Banach lattices","year":2022,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational inequality; Bregman divergence; Inequality; Banach space; Mathematics; Applied mathematics; Pure mathematics; Mathematical analysis","score_opus":0.01701782194834236,"score_gpt":0.24534203472761093,"score_spread":0.22832421277926856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210597426","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001810811,0.000066911154,0.9954066,0.0017075398,0.000055089124,0.0001947206,0.00004798243,0.00008030819,0.0006300191],"genre_scores_gemma":[0.70047325,0.00002469282,0.29777664,0.0007054685,0.000035299716,0.00016342397,0.00060234225,0.000010318443,0.00020856538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976408,0.0002474156,0.0005517141,0.00062457187,0.0006351564,0.00030037842],"domain_scores_gemma":[0.9990441,0.00014174852,0.00022849266,0.00033177412,0.00012958824,0.0001243017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010502951,0.00019483625,0.00036004971,0.0011498178,0.0007905921,0.00027945518,0.00044497233,0.00004876872,0.00046103398],"category_scores_gemma":[0.000034993293,0.00020711934,0.00011652623,0.005273551,0.000030146335,0.000424096,0.00037093315,0.00013876623,0.000005624358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011686251,0.000077255885,0.0008046969,0.0000034618847,0.00020155459,7.3787976e-7,0.0011447916,0.82329434,0.000014057059,0.17390503,0.000057175217,0.0004852212],"study_design_scores_gemma":[0.00031678163,0.00002613921,0.0039568916,0.0000015476078,0.00021686427,0.000001049603,0.00044185788,0.9933613,0.0000055448713,0.0011519521,0.00026074666,0.00025935628],"about_ca_topic_score_codex":0.0003041762,"about_ca_topic_score_gemma":0.00021196251,"teacher_disagreement_score":0.69866246,"about_ca_system_score_codex":0.00014010716,"about_ca_system_score_gemma":0.00007393221,"threshold_uncertainty_score":0.8446082},"labels":[],"label_agreement":null},{"id":"W4210650323","doi":"10.23952/asvao.4.2022.1.03","title":"Second-order optimality conditions and duality for nonsmooth multiobjective optimization problems","year":2022,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Foundation for Science and Technology Development","keywords":"Duality (order theory); Mathematical optimization; Order (exchange); Multi-objective optimization; Mathematics; Computer science; Mathematical economics; Economics; Combinatorics","score_opus":0.014302921871619929,"score_gpt":0.25729770296118976,"score_spread":0.24299478108956982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210650323","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008350759,0.00006571088,0.99648356,0.0006265347,0.00005417196,0.0007712327,0.00027838975,0.00014506132,0.0007402852],"genre_scores_gemma":[0.31627673,0.00008444786,0.6790978,0.0007471671,0.00003588238,0.0006942142,0.002711952,0.000024354054,0.00032750124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975412,0.00022731772,0.00059432955,0.0009153466,0.0004309078,0.00029091217],"domain_scores_gemma":[0.9983572,0.00019329962,0.0004387959,0.00041681933,0.00044318373,0.00015071475],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0009182783,0.0002753474,0.0004800202,0.000666259,0.0015022191,0.00036525293,0.00028364803,0.00009215105,0.0006140837],"category_scores_gemma":[0.00006287856,0.0002899889,0.00016270789,0.003177981,0.00008125071,0.0005402246,0.00029442567,0.00015760673,0.0000010664038],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001975771,0.0001227772,0.00032600245,0.000018497378,0.0005935825,1.8288655e-7,0.0007053841,0.9499604,0.000027549204,0.04781961,0.00007852155,0.0003277248],"study_design_scores_gemma":[0.00087143347,0.000056253433,0.0013756776,0.0000018250527,0.00071517605,0.0000026351265,0.00027794644,0.99486846,0.000029918776,0.0012008254,0.00024564864,0.0003541997],"about_ca_topic_score_codex":0.000057875957,"about_ca_topic_score_gemma":0.000038966526,"teacher_disagreement_score":0.3173858,"about_ca_system_score_codex":0.000110394074,"about_ca_system_score_gemma":0.000095724165,"threshold_uncertainty_score":0.99995524},"labels":[],"label_agreement":null},{"id":"W4210658354","doi":"10.23952/asvao.4.2022.1.08","title":"The connectedness of weakly and strongly efficient solution sets of nonconvex vector equilibrium problems","year":2022,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Bộ Giáo dục và Ðào tạo","keywords":"Social connectedness; Mathematics; Applied mathematics; Mathematical economics; Pure mathematics; Mathematical optimization; Combinatorics; Social psychology; Psychology","score_opus":0.009999585336952473,"score_gpt":0.22107267482189966,"score_spread":0.21107308948494719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210658354","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040472243,0.00018985353,0.95837677,0.00039423248,0.000051968454,0.00024614375,0.00003053501,0.000032592303,0.00020565011],"genre_scores_gemma":[0.9763555,0.000042199696,0.023355424,0.000031646872,0.000008996637,0.000038900744,0.00012301648,0.0000073997257,0.000036894737],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983255,0.00015716028,0.00050686445,0.00036632706,0.00047755294,0.00016659638],"domain_scores_gemma":[0.998746,0.00014397246,0.0005043971,0.0003173664,0.0002274969,0.000060781404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006126862,0.00013593188,0.0003259012,0.0003160958,0.00042236087,0.00008791146,0.00026973902,0.00004092749,0.00004536463],"category_scores_gemma":[0.000027713313,0.00011109882,0.00010201569,0.0022575336,0.000093654686,0.00008292721,0.00029322066,0.00008399453,3.05173e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016594657,0.00006127319,0.00026409788,0.000013325036,0.00030789472,9.627196e-8,0.0005626569,0.96145403,0.0007846793,0.035860837,0.000013011186,0.0006614781],"study_design_scores_gemma":[0.00037137765,0.00005172927,0.002222953,0.000002495228,0.0003805398,8.1761533e-7,0.00024422343,0.9961844,0.00022884666,0.00016768703,0.000025148796,0.000119764336],"about_ca_topic_score_codex":0.00007398578,"about_ca_topic_score_gemma":0.000013962641,"teacher_disagreement_score":0.9358833,"about_ca_system_score_codex":0.00003636965,"about_ca_system_score_gemma":0.0000634505,"threshold_uncertainty_score":0.45304784},"labels":[],"label_agreement":null},{"id":"W4210850497","doi":"10.28924/2291-8639-20-2022-11","title":"Nonconvex Vector Optimization and Optimality Conditions for Proper Efficiency","year":2022,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Vector optimization; Generalization; Context (archaeology); Closure (psychology); Algebraic number; Function (biology); Mathematical optimization; Closed set; Set (abstract data type); Vector space; Boundary (topology); Function space; Feasible region; Space (punctuation); Optimization problem; Pure mathematics; Computer science; Mathematical analysis; Multi-swarm optimization","score_opus":0.008775792801600332,"score_gpt":0.27710696735687046,"score_spread":0.2683311745552701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210850497","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015702412,0.000102154096,0.9929518,0.004933517,0.000067032124,0.0001449794,0.00007645607,0.000012438342,0.00014139987],"genre_scores_gemma":[0.90532917,0.000101910635,0.093642406,0.00042601847,0.00011482185,0.0001260563,0.00009148813,0.000005004983,0.00016315273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988809,0.000053507574,0.00041134615,0.00020032418,0.00037534852,0.000078549514],"domain_scores_gemma":[0.9985151,0.00012529315,0.00040385622,0.00012981027,0.0007495065,0.000076424774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004461221,0.00007733254,0.0001776755,0.00052134495,0.00035508606,0.00018335492,0.0004499366,0.000018772416,0.00013126976],"category_scores_gemma":[0.000033643708,0.00007033533,0.00016244418,0.0008237518,0.000039299488,0.0003183247,0.00014941231,0.00008188438,5.67466e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014495117,0.0002772913,0.0018322886,0.000003899436,0.0011591803,0.0000012724774,0.00022639178,0.8435942,0.00020091374,0.14943142,0.00021079472,0.003047848],"study_design_scores_gemma":[0.0004558461,0.00006848183,0.003416649,0.0000018220874,0.00040424315,0.00003296273,0.00010451182,0.98710215,0.000056285047,0.001964158,0.006281736,0.000111158704],"about_ca_topic_score_codex":0.000011541356,"about_ca_topic_score_gemma":0.000002441596,"teacher_disagreement_score":0.9037589,"about_ca_system_score_codex":0.00005468926,"about_ca_system_score_gemma":0.00007768277,"threshold_uncertainty_score":0.28681913},"labels":[],"label_agreement":null},{"id":"W4212975420","doi":"10.1090/fic/032/08","title":"Rigid subanalytic sets","year":2002,"lang":"en","type":"other","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Mathematics","score_opus":0.013591032443124682,"score_gpt":0.229694956846169,"score_spread":0.21610392440304432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212975420","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.7657324e-9,0.00004891906,0.4146952,0.00061943795,0.00006865471,0.000023562643,0.0000018326119,0.00020367363,0.5843387],"genre_scores_gemma":[0.000029028917,0.00006709873,0.08316578,0.00061288965,0.000059308513,0.0000022196555,0.000013067988,0.00004546819,0.91600513],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992964,0.000019092355,0.00010814555,0.00026016028,0.00021385429,0.00010233058],"domain_scores_gemma":[0.99942786,0.000014076588,0.000084949206,0.00039057285,0.000027714883,0.00005484399],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000038241862,0.00011239573,0.00014665638,0.00028724587,0.000022509967,0.000095811985,0.0004797359,0.00009218582,0.033409115],"category_scores_gemma":[0.000007934602,0.000091070884,0.00008443345,0.00041527298,0.000007952642,0.00006161832,0.00006465635,0.000049707065,0.003274226],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.6533603e-8,0.000015848815,0.000010717153,0.0000031485247,0.00004139633,0.0000020282262,0.0000065542117,0.00030369475,3.829765e-8,0.07432565,0.9243545,0.0009363873],"study_design_scores_gemma":[0.000053048032,0.000002984225,0.000010307874,0.0000055548235,0.0000151053855,0.0000012193359,3.7542392e-7,0.40225142,5.148262e-7,0.00033137808,0.597207,0.000121098885],"about_ca_topic_score_codex":0.000094426556,"about_ca_topic_score_gemma":0.00004237953,"teacher_disagreement_score":0.4019477,"about_ca_system_score_codex":0.000015976671,"about_ca_system_score_gemma":0.000018569155,"threshold_uncertainty_score":0.99750185},"labels":[],"label_agreement":null},{"id":"W4213222078","doi":"10.23952/asvao.1.2019.3.03","title":"Minimality conditions for convex composite functions and efficiency conditions in vector optimization","year":2019,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Composite number; Regular polygon; Vector (molecular biology); Mathematics; Vector optimization; Mathematical optimization; Computer science; Optimization problem; Algorithm; Recombinant DNA; Biology; Geometry; Genetics","score_opus":0.009402779630681176,"score_gpt":0.24633975026612293,"score_spread":0.23693697063544175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213222078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01669454,0.000040014373,0.980879,0.0006131119,0.000071997034,0.0006372427,0.00013800115,0.000097295735,0.00082881626],"genre_scores_gemma":[0.85941947,0.00006258097,0.13738696,0.00034071904,0.000024835668,0.00014130153,0.002358993,0.000014531734,0.00025058846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980902,0.000096301344,0.00056518475,0.0007239341,0.00026501378,0.00025932872],"domain_scores_gemma":[0.9987171,0.00023867539,0.0002746521,0.00036022664,0.00027755045,0.00013179064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040191418,0.00023291238,0.00047328958,0.0008782064,0.00041242392,0.00030599107,0.0001980801,0.00013332271,0.00023466293],"category_scores_gemma":[0.000039178987,0.00023958161,0.00013887284,0.0027449615,0.00007697031,0.0005132571,0.000084095394,0.0001009761,0.000009906818],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000142243025,0.00010204581,0.003830304,0.000017021235,0.00023224311,1.9712247e-7,0.00021451933,0.93378663,0.00024442747,0.061458543,0.00003917164,0.000060652386],"study_design_scores_gemma":[0.0010869764,0.000040909348,0.013369454,0.0000075109597,0.00049367285,0.0000013731927,0.00016015477,0.9840481,0.00003593432,0.00045262068,0.00002553017,0.00027770776],"about_ca_topic_score_codex":0.000048642753,"about_ca_topic_score_gemma":0.000026571293,"teacher_disagreement_score":0.84349203,"about_ca_system_score_codex":0.000062002364,"about_ca_system_score_gemma":0.000059683254,"threshold_uncertainty_score":0.97698545},"labels":[],"label_agreement":null},{"id":"W4214845636","doi":"10.1090/proc/16049","title":"Roots of the identity operator and proximal mappings: (Classical and phantom) cycles and gap vectors","year":2022,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lemma (botany); Mathematics; Conjecture; Convex set; Imaging phantom; Regular polygon; Hilbert space; Operator (biology); Pure mathematics; Duality (order theory); Identity (music); Set (abstract data type); Convex analysis; Operator theory; Normed vector space; Combinatorics; Mathematical analysis; Geometry; Computer science; Convex optimization; Physics","score_opus":0.011991511374713127,"score_gpt":0.2434513830502556,"score_spread":0.23145987167554247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4214845636","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9909445,0.0000507779,0.0036372489,0.0049456735,0.000015374944,0.0001654139,0.0000050016038,0.000017680146,0.00021829626],"genre_scores_gemma":[0.97989774,0.000026069776,0.019666957,0.00031991545,0.000010680501,0.000015389964,9.4788426e-8,0.000004703109,0.00005847471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990811,0.000019036464,0.00020468414,0.0001957847,0.00039178604,0.000107631386],"domain_scores_gemma":[0.99941546,0.000079663405,0.0002762521,0.00008866744,0.00009102609,0.000048917595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036871806,0.000084643,0.00022006186,0.000016974433,0.00028195247,0.00008563873,0.0004353465,0.00001355026,0.000008862067],"category_scores_gemma":[0.00013413004,0.00005060301,0.00009836941,0.0005772603,0.00046599354,0.00022666495,0.0011509863,0.00011279956,1.3666188e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020760264,0.00049852725,0.09234389,0.00056626013,0.00035047534,1.2720751e-7,0.010879062,0.00007813356,0.032210633,0.85997814,0.0012771258,0.0017968809],"study_design_scores_gemma":[0.0007031514,0.00021642639,0.22182636,0.000101999634,0.00021051956,0.000046231864,0.0059590293,0.62025684,0.0035894266,0.14647427,0.00021556996,0.00040016926],"about_ca_topic_score_codex":0.000012314595,"about_ca_topic_score_gemma":3.0919213e-7,"teacher_disagreement_score":0.71350384,"about_ca_system_score_codex":0.000020878177,"about_ca_system_score_gemma":0.000022846583,"threshold_uncertainty_score":0.2168579},"labels":[],"label_agreement":null},{"id":"W4224129493","doi":"10.1051/ro/2022050","title":"Z-equilibrium in random bi-matrix games: Definition and computation","year":2022,"lang":"en","type":"article","venue":"RAIRO. Operations research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computation; Mathematical optimization; Pareto principle; Matrix (chemical analysis); Minification; Mathematics; Pareto optimal; Applied mathematics; Mathematical economics; Computer science; Algorithm; Multi-objective optimization","score_opus":0.07502230834628136,"score_gpt":0.376351550144908,"score_spread":0.30132924179862663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4224129493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07658748,0.0002603333,0.89914316,0.019331275,0.00014366406,0.00079252035,0.0000278366,0.00011595696,0.0035977662],"genre_scores_gemma":[0.96868837,0.00003338267,0.029789222,0.00015042987,0.00002984271,0.00023546701,0.00012273224,0.0000073424208,0.00094320124],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976747,0.0008028094,0.00027625266,0.00034188342,0.0006840327,0.00022033422],"domain_scores_gemma":[0.9991409,0.00030346177,0.000020249681,0.00020358551,0.0002622151,0.000069585796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016643377,0.00007578049,0.000124625,0.0008188687,0.00057145057,0.00037950117,0.00030263985,0.000028349688,0.0002662142],"category_scores_gemma":[0.00019605811,0.00007753459,0.000034507604,0.0021492878,0.00004654228,0.00057835237,0.00037685756,0.00027720234,0.00003987157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021303675,0.00016621617,0.00045020675,0.000007345205,0.000013713054,0.000007113028,0.0013501924,0.84928966,0.000691154,0.14548975,0.0010589445,0.0014543851],"study_design_scores_gemma":[0.0010236715,0.00006289809,0.001959947,0.0000030009487,0.000002229946,0.000010492761,0.00024120479,0.99351513,0.0000351351,0.0020604555,0.0009940912,0.00009172154],"about_ca_topic_score_codex":0.00023684294,"about_ca_topic_score_gemma":0.0001229051,"teacher_disagreement_score":0.8921009,"about_ca_system_score_codex":0.0001373164,"about_ca_system_score_gemma":0.00026176733,"threshold_uncertainty_score":0.43951938},"labels":[],"label_agreement":null},{"id":"W4225767607","doi":"10.23952/jano.4.2022.1.03","title":"Vectorization in nonconvex set optimization","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vectorization (mathematics); Set (abstract data type); Computer science; Mathematical optimization; Mathematics; Algorithm; Parallel computing; Programming language","score_opus":0.007936345292094815,"score_gpt":0.2178672487866019,"score_spread":0.2099309034945071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225767607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034077032,0.00004232638,0.9972462,0.0010816813,0.00018207057,0.00009338914,0.0000019382628,0.000020850903,0.0009907953],"genre_scores_gemma":[0.63192636,0.00009605365,0.36727318,0.00055081525,0.0000704936,0.000011603229,0.000030663457,0.00001095314,0.000029848748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986248,0.00009055329,0.0005312008,0.0001907132,0.00043514665,0.00012756854],"domain_scores_gemma":[0.99911827,0.00007310981,0.00046561542,0.000113410475,0.00014705847,0.00008253385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004572472,0.0001061109,0.00022813423,0.00041448494,0.00017390377,0.00009410554,0.00026996035,0.000039855095,0.00021760243],"category_scores_gemma":[0.000037097616,0.00010316972,0.00005158822,0.0012375669,0.000013750169,0.00047036418,0.00012572964,0.00019088533,9.5006794e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043328295,0.000086986794,0.00020111237,0.0000031384407,0.000014364083,0.0000032404255,0.00040148318,0.98289406,0.000034589342,0.015104713,0.000077895544,0.0011350639],"study_design_scores_gemma":[0.0007103608,0.00010570909,0.00030620693,0.0000030388533,0.000014096063,0.000020758423,0.000085892614,0.997395,0.000023637092,0.00071892666,0.00050150324,0.000114913826],"about_ca_topic_score_codex":0.00000437505,"about_ca_topic_score_gemma":1.1942866e-7,"teacher_disagreement_score":0.6315856,"about_ca_system_score_codex":0.00011741475,"about_ca_system_score_gemma":0.00008990477,"threshold_uncertainty_score":0.4207139},"labels":[],"label_agreement":null},{"id":"W4226198151","doi":"10.1137/22m1484742","title":"Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Natural Science Foundation of Shandong Province; Austrian Science Fund; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Smoothness; Order (exchange); Mathematics; Mathematical optimization; Variational analysis; Optimization problem; Applied mathematics; Computer science","score_opus":0.02115896620607888,"score_gpt":0.2717379495631903,"score_spread":0.25057898335711143,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226198151","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010639018,0.000034893066,0.9962495,0.0010508298,0.000395198,0.00042178328,0.00019547777,0.00010104188,0.0004873923],"genre_scores_gemma":[0.1786783,0.000501661,0.8142749,0.00054143067,0.0003792218,0.00022782094,0.0032971762,0.000058180667,0.002041301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976908,0.00022012183,0.0008227033,0.0004425876,0.0005587573,0.00026500525],"domain_scores_gemma":[0.9968129,0.0003668462,0.0007902298,0.00027376594,0.0015940276,0.00016223625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009797316,0.00022141825,0.00046117452,0.0015348272,0.0004772292,0.00039331106,0.00030806178,0.00013398538,0.00025409355],"category_scores_gemma":[0.00023190201,0.00020643219,0.00022668924,0.00427394,0.000051867893,0.0010204862,0.00006925112,0.00014124044,0.0000044269286],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020977406,0.00009284031,0.00038125194,0.000023225542,0.0008746604,8.4390155e-7,0.00027156918,0.92067146,0.000023639912,0.07729309,0.0002968259,0.00004964023],"study_design_scores_gemma":[0.0008562521,0.00013558062,0.003065391,0.000021586377,0.00042787613,0.000007914507,0.00004788019,0.99434716,0.000010603148,0.0007309835,0.00013110152,0.00021768386],"about_ca_topic_score_codex":0.00000877255,"about_ca_topic_score_gemma":0.000003596474,"teacher_disagreement_score":0.18197457,"about_ca_system_score_codex":0.00011540375,"about_ca_system_score_gemma":0.00016806123,"threshold_uncertainty_score":0.841806},"labels":[],"label_agreement":null},{"id":"W4226200284","doi":"10.23952/jano.4.2022.1.09","title":"Solvability of convex optimization problems on a *-continuous closed convex set","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Subderivative; Convex set; Regular polygon; Proper convex function; Convex analysis; Conic optimization; Set (abstract data type); Convex optimization; Mathematics; Mathematical optimization; Convex combination; Convex polytope; Absolutely convex set; Computer science; Geometry","score_opus":0.010002825590155064,"score_gpt":0.21609861142083092,"score_spread":0.20609578583067586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226200284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014594188,0.00003546278,0.9960528,0.00097367505,0.00014406843,0.00020371986,0.000008627146,0.00002628711,0.0010959456],"genre_scores_gemma":[0.79390645,0.000054029457,0.20538846,0.0005240844,0.00004400613,0.000013266627,0.000027027265,0.000011456346,0.0000312001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806726,0.00013253845,0.00077595515,0.0002568682,0.00061736425,0.00014999845],"domain_scores_gemma":[0.9981959,0.00015573071,0.0009841839,0.0002006477,0.00034887553,0.00011468598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006622245,0.0001486722,0.0004411848,0.00026725527,0.00020485905,0.00007196655,0.00034649408,0.000055571327,0.0002617795],"category_scores_gemma":[0.00006346319,0.00013214943,0.000116073104,0.00077072845,0.000046729434,0.00027531074,0.00013225434,0.00022627563,0.0000010279063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013326178,0.00025616665,0.00014733113,0.00001362312,0.000056113247,0.00000139985,0.00049066177,0.9837399,0.000086103035,0.013591722,0.0001406443,0.001343059],"study_design_scores_gemma":[0.0010274315,0.00044925846,0.00019565318,0.0000073117862,0.000041976215,0.000014383632,0.000105606385,0.9963665,0.00013767662,0.0011292719,0.0003847027,0.00014022742],"about_ca_topic_score_codex":0.000004599781,"about_ca_topic_score_gemma":6.070013e-8,"teacher_disagreement_score":0.79244703,"about_ca_system_score_codex":0.000075022595,"about_ca_system_score_gemma":0.00011081676,"threshold_uncertainty_score":0.53888977},"labels":[],"label_agreement":null},{"id":"W4226238011","doi":"10.23952/jnva.6.2022.1.01","title":"Strong and total Lagrange dualities for quasiconvex programming","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Hunan Province; National Natural Science Foundation of China","keywords":"Quasiconvex function; Mathematics; Computer science; Geometry; Convex analysis; Convex optimization; Regular polygon","score_opus":0.017119572713763305,"score_gpt":0.2628088287787328,"score_spread":0.2456892560649695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226238011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012194291,0.0002649943,0.9832033,0.0040689968,0.00008849832,0.00006991405,0.000061511426,0.0000108475815,0.000037653965],"genre_scores_gemma":[0.6193774,0.000038012844,0.37937602,0.00035226607,0.00028794768,0.000016164928,0.000077045166,0.0000069997395,0.0004681712],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881744,0.000090510795,0.00040791254,0.00016023207,0.00041384326,0.000110055946],"domain_scores_gemma":[0.9988744,0.00025480177,0.00037369865,0.00008153611,0.00033374652,0.000081788305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080517965,0.00008605886,0.00026329598,0.00047359598,0.00035240207,0.00016633217,0.0001621498,0.000021755368,0.000077291494],"category_scores_gemma":[0.00006962511,0.00007553526,0.00022716266,0.00079836266,0.000018067089,0.0003734609,0.00010748067,0.000102007165,2.2362352e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015560981,0.00071276183,0.027904121,0.00005445446,0.007772771,0.000012462445,0.0038251008,0.21158919,0.000086319465,0.7262455,0.000362466,0.021279225],"study_design_scores_gemma":[0.0005844143,0.00016033484,0.013954349,0.0000018055408,0.00074713037,0.000041241365,0.00034293628,0.9784545,0.0000032100975,0.0020223896,0.0035707932,0.0001169099],"about_ca_topic_score_codex":0.000023738565,"about_ca_topic_score_gemma":0.0000067679402,"teacher_disagreement_score":0.7668653,"about_ca_system_score_codex":0.000031701682,"about_ca_system_score_gemma":0.000088988054,"threshold_uncertainty_score":0.30802384},"labels":[],"label_agreement":null},{"id":"W4226279112","doi":"10.23952/jano.4.2022.1.02","title":"Relaxed Lagrangian duality in convex infinite optimization: Reverse strong duality and optimality","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; European Regional Development Fund; Viet Nam National University Ho Chi Minh City; Ministerio de Ciencia, Innovación y Universidades","keywords":"Duality (order theory); Lagrangian; Strong duality; Convex analysis; Mathematics; Duality gap; Perturbation function; Fenchel's duality theorem; Regular polygon; Convex optimization; Mathematical optimization; Wolfe duality; Weak duality; Applied mathematics; Pure mathematics; Optimization problem; Geometry","score_opus":0.011958170476297988,"score_gpt":0.23406817775916275,"score_spread":0.22211000728286476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226279112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020419613,0.00007995818,0.9935295,0.0028539207,0.00011086598,0.00015278974,0.000008887311,0.00002643285,0.0011956977],"genre_scores_gemma":[0.5823691,0.00016958683,0.41644242,0.0008787452,0.000050235623,0.0000112314,0.000028954322,0.000011025174,0.00003872367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979515,0.00025293184,0.0007929627,0.0003103954,0.00050792156,0.00018430287],"domain_scores_gemma":[0.99866575,0.00016085508,0.00063050486,0.00018752056,0.00019018476,0.00016521358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012584904,0.0001609074,0.00039845813,0.00028696566,0.00028227762,0.0001450992,0.00025806585,0.00006646263,0.0002017354],"category_scores_gemma":[0.00008201014,0.00015576583,0.000072625306,0.0010029923,0.00005547481,0.0005891348,0.00025175145,0.00033145634,6.253552e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010199812,0.00013539336,0.0008364226,0.000010414193,0.00003273086,0.0000065571285,0.00049943133,0.97209233,0.000011379074,0.025478443,0.00007261688,0.0007222863],"study_design_scores_gemma":[0.0012382327,0.00010926812,0.0023430819,0.000006451758,0.000035128865,0.000033970304,0.0002331608,0.9944785,0.000008645614,0.0007760122,0.00055358344,0.0001839289],"about_ca_topic_score_codex":0.000022272177,"about_ca_topic_score_gemma":6.6045334e-7,"teacher_disagreement_score":0.5803271,"about_ca_system_score_codex":0.000101178906,"about_ca_system_score_gemma":0.000099658995,"threshold_uncertainty_score":0.6351946},"labels":[],"label_agreement":null},{"id":"W4226337303","doi":"10.23952/jano.4.2022.1.04","title":"Set-valued variational principles. When migration improves quality of life","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Aix-Marseille Université","keywords":"Set (abstract data type); Quality of life (healthcare); Quality (philosophy); Mathematical optimization; Applied mathematics; Mathematics; Computer science; Psychology; Epistemology; Philosophy; Psychotherapist","score_opus":0.023234993276034427,"score_gpt":0.25191491913896796,"score_spread":0.22867992586293354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226337303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028636777,0.00004408439,0.99486166,0.0015155035,0.00011220932,0.0000887465,0.0000067216397,0.000014963599,0.0004924291],"genre_scores_gemma":[0.6090266,0.00002613668,0.39032435,0.00047651262,0.00006467392,0.0000071015656,0.000026485592,0.0000060609495,0.000042089556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812293,0.00013234894,0.00082510407,0.00017084976,0.0006523499,0.00009640524],"domain_scores_gemma":[0.99819,0.00012598242,0.0011406068,0.00013066476,0.00030684247,0.00010591762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008483578,0.00009791189,0.00028936664,0.00020074009,0.00018512104,0.00006462726,0.00028080936,0.000037193506,0.0001555325],"category_scores_gemma":[0.00012331283,0.000088192,0.000093200535,0.00045968307,0.000022357566,0.00035196566,0.00014195981,0.00014347896,5.85508e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094020266,0.00008120223,0.00018651488,0.000007935782,0.000058016,2.1928716e-7,0.00067167473,0.86315155,0.0003591762,0.13471483,0.00011304953,0.00056182226],"study_design_scores_gemma":[0.0006617251,0.00011050721,0.0025412482,0.0000018565405,0.000025795522,0.000004002645,0.00010603596,0.9923497,0.000055001383,0.0034908855,0.00055082346,0.000102435915],"about_ca_topic_score_codex":0.000016077029,"about_ca_topic_score_gemma":3.3749652e-7,"teacher_disagreement_score":0.6061629,"about_ca_system_score_codex":0.00007489553,"about_ca_system_score_gemma":0.00023990878,"threshold_uncertainty_score":0.35963655},"labels":[],"label_agreement":null},{"id":"W4226363315","doi":"10.23952/jano.4.2022.1.05","title":"A new class of vector optimization problems with linear fractional objective criteria","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vietnam Institute for Advanced Study in Mathematics; Le Quy Don Technical University; Vietnam Academy of Science and Technology","keywords":"Class (philosophy); Mathematics; Vector optimization; Mathematical optimization; Optimization problem; Computer science; Applied mathematics; Artificial intelligence; Multi-swarm optimization","score_opus":0.007806373512615274,"score_gpt":0.22506443750229171,"score_spread":0.21725806398967645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226363315","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001174662,0.000035574063,0.99776584,0.0011128066,0.00010357056,0.00011897086,0.000004253477,0.000018187922,0.0007233096],"genre_scores_gemma":[0.26463953,0.000036501347,0.7349174,0.0002230215,0.00009349292,0.000007851574,0.000018622968,0.000011189679,0.000052373864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985902,0.00006574921,0.00047784808,0.00019557652,0.0005592536,0.00011137462],"domain_scores_gemma":[0.9985814,0.000086643384,0.0007451806,0.00011143526,0.00035899022,0.00011631668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024842302,0.00012087926,0.00027671846,0.00025609156,0.00018155522,0.000060816492,0.00022498769,0.00003867028,0.00037049895],"category_scores_gemma":[0.000024885763,0.000100591424,0.000064917345,0.00089047005,0.000022192475,0.0004457425,0.000089813584,0.0001876457,5.1005145e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019082346,0.00012443808,0.000050223258,0.0000069020657,0.00007782053,0.000001315561,0.00039030125,0.9884471,0.000102273785,0.009768945,0.00017682713,0.0006630127],"study_design_scores_gemma":[0.0008871301,0.00041084614,0.00019340191,0.000007979272,0.000049053113,0.00004225226,0.00007953034,0.99714875,0.00008861635,0.0004861032,0.00048705054,0.000119281474],"about_ca_topic_score_codex":0.000009539031,"about_ca_topic_score_gemma":1.6720865e-7,"teacher_disagreement_score":0.26452205,"about_ca_system_score_codex":0.00007453094,"about_ca_system_score_gemma":0.00023602,"threshold_uncertainty_score":0.4101999},"labels":[],"label_agreement":null},{"id":"W4226394830","doi":"10.23952/jano.4.2022.1.08","title":"Optimality and duality for semidefinite multiobjective programming problems using convexificators","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board","keywords":"Duality (order theory); Semidefinite programming; Mathematical optimization; Semidefinite embedding; Multiobjective programming; Mathematics; Strong duality; Multi-objective optimization; Mathematical economics; Computer science; Combinatorics; Optimization problem; Quadratically constrained quadratic program; Quadratic programming","score_opus":0.02250132360065009,"score_gpt":0.2564471490728111,"score_spread":0.23394582547216097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226394830","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028169127,0.000059353064,0.9963113,0.0004304391,0.00006554686,0.00022553692,0.000005584939,0.000018144434,0.00006719963],"genre_scores_gemma":[0.43696398,0.000018044046,0.5628082,0.00014962816,0.000026360976,0.000016904032,0.000006526123,0.000005689628,0.0000046520845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989295,0.00006623696,0.00041854367,0.00020619958,0.00025755612,0.00012198741],"domain_scores_gemma":[0.99897075,0.00013369115,0.0005143792,0.00008073698,0.00020528107,0.00009514311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006819538,0.00009765184,0.00022823956,0.00014041716,0.0003733571,0.00012321495,0.00013165367,0.000031409952,0.000011611163],"category_scores_gemma":[0.000044287666,0.00008884734,0.000060432954,0.0004174595,0.000032172175,0.0002822975,0.00011169421,0.00012724176,7.3150815e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059272523,0.00009548934,0.00027064543,0.000014585424,0.00004772083,4.6716164e-7,0.00069477764,0.9806333,0.00008406835,0.014835452,0.000010690801,0.00325352],"study_design_scores_gemma":[0.00064729695,0.00012111876,0.00021438544,0.0000034993625,0.000044475375,0.000022959865,0.00022685135,0.99664265,0.000040562045,0.0014041082,0.00052136614,0.00011069837],"about_ca_topic_score_codex":0.000005073103,"about_ca_topic_score_gemma":5.3455476e-8,"teacher_disagreement_score":0.43414706,"about_ca_system_score_codex":0.00006244694,"about_ca_system_score_gemma":0.0000636299,"threshold_uncertainty_score":0.36230892},"labels":[],"label_agreement":null},{"id":"W4229613581","doi":"10.23952/jnva.3.2019.3.04","title":"Levitin-Polyak well-posedness for bilevel vector variational inequalities","year":2019,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational inequality; Inequality; Applied mathematics; Mathematics; Bilevel optimization; Mathematical economics; Calculus (dental); Mathematical optimization; Mathematical analysis; Optimization problem; Medicine","score_opus":0.018359020500239288,"score_gpt":0.26471457696315787,"score_spread":0.24635555646291857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229613581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053121587,0.00009814225,0.9893962,0.004378605,0.00033152514,0.00011661257,0.00010328401,0.000017928296,0.00024553484],"genre_scores_gemma":[0.5230694,0.00006546291,0.4726972,0.0010872575,0.00081733754,0.000009206181,0.00021327665,0.000016234646,0.0020246655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977712,0.00014446738,0.0008812489,0.00029777514,0.0007120039,0.00019330064],"domain_scores_gemma":[0.9965525,0.00094185525,0.0008028223,0.00021736817,0.001342404,0.00014299867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013502951,0.00018322906,0.00053718087,0.00087513006,0.00016432552,0.00025074914,0.00043308648,0.00009250612,0.00050684076],"category_scores_gemma":[0.00025947348,0.00015123666,0.000524908,0.0014253522,0.000021097918,0.00082776,0.00007960666,0.00013284144,0.000022003705],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013033701,0.0004746303,0.026109826,0.000061824416,0.005604692,0.0000035303167,0.00072660425,0.16702068,0.000450122,0.79739934,0.0005603468,0.0014580716],"study_design_scores_gemma":[0.0009539826,0.000108863656,0.04977026,0.000010474621,0.00073517405,0.000014327327,0.00004613099,0.9372855,0.00003683168,0.0075230286,0.0033047767,0.00021069286],"about_ca_topic_score_codex":0.000031185376,"about_ca_topic_score_gemma":0.000008888655,"teacher_disagreement_score":0.7898763,"about_ca_system_score_codex":0.000062871746,"about_ca_system_score_gemma":0.00032453972,"threshold_uncertainty_score":0.61672515},"labels":[],"label_agreement":null},{"id":"W4229632090","doi":"10.23952/jnva.4.2020.2.09","title":"General descent method using w-distance. Application to emergence of habits following worthwhile moves","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Universidade Federal do Piauí; Centre National de la Recherche Scientifique; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Aix-Marseille Université","keywords":"Descent (aeronautics); Computer science; Mathematics; Artificial intelligence; Geography; Meteorology","score_opus":0.022134992566740046,"score_gpt":0.30083610772945923,"score_spread":0.27870111516271917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229632090","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010917014,0.00010454284,0.98578763,0.003037624,0.000051503932,0.000052387782,0.000015175141,0.0000074981613,0.000026652862],"genre_scores_gemma":[0.37529865,0.000017604387,0.6240612,0.00045625013,0.00014121765,8.924218e-7,0.000010134942,0.0000035375301,0.000010477501],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830264,0.00009437698,0.0007086902,0.00023420963,0.000552128,0.00010795223],"domain_scores_gemma":[0.9984364,0.0000896626,0.0005696208,0.00013114013,0.00057839527,0.00019476586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051636505,0.00011088132,0.00039364948,0.00037561406,0.00009785009,0.000059135375,0.00031496648,0.000039492304,0.000055166456],"category_scores_gemma":[0.00013969018,0.0000971961,0.0003735701,0.002655308,0.000008095487,0.00039091392,0.00008103105,0.00008174269,0.0000013378329],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025115653,0.00009178106,0.019214498,0.00000975291,0.0016401287,0.000002178597,0.00054273405,0.9581232,0.004040054,0.014407238,0.000042726697,0.0018605635],"study_design_scores_gemma":[0.00019341559,0.000038353264,0.013599637,0.000006072772,0.0006560069,0.0000024522978,0.000026084212,0.98439753,0.0002810658,0.00043902927,0.00025912104,0.00010121213],"about_ca_topic_score_codex":0.000035801197,"about_ca_topic_score_gemma":0.00000825353,"teacher_disagreement_score":0.36438164,"about_ca_system_score_codex":0.000024308996,"about_ca_system_score_gemma":0.00011780291,"threshold_uncertainty_score":0.39635417},"labels":[],"label_agreement":null},{"id":"W4229794940","doi":"10.23952/jnva.4.2020.1.10","title":"On the existence and approximation of solutions for bilevel vector variational inequalities in Banach spaces","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Central Florida","keywords":"Variational inequality; Banach space; Mathematics; Applied mathematics; Pure mathematics; Banach manifold; Mathematical analysis; Lp space","score_opus":0.06265698702761825,"score_gpt":0.2724028283186971,"score_spread":0.20974584129107887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229794940","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008668152,0.000080438454,0.9641857,0.026842676,0.000029092673,0.0000840792,0.00006661874,0.000004460939,0.000038788923],"genre_scores_gemma":[0.813563,0.000052892567,0.18547861,0.0007113802,0.00012838814,0.0000066537013,0.000031901043,0.0000037519978,0.0000234138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986157,0.00014434515,0.0005759995,0.00016214268,0.00039989394,0.00010191638],"domain_scores_gemma":[0.9975074,0.001281435,0.0005276866,0.000086498796,0.0005304719,0.00006653442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011488014,0.00009395471,0.000288411,0.00037875504,0.000134819,0.00009529646,0.00020742834,0.000042556647,0.000035720812],"category_scores_gemma":[0.0008952603,0.00006521022,0.00015725236,0.001202392,0.00003414139,0.0003531714,0.000053475273,0.00009430053,4.939348e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041006682,0.00009931119,0.0021705213,0.000018317773,0.00050840405,3.5103497e-7,0.0010949081,0.078009546,0.0000764896,0.9176586,0.000055676428,0.00026684444],"study_design_scores_gemma":[0.00035378564,0.00008772645,0.03617054,0.000009059624,0.00021173403,0.0000018068988,0.000104762854,0.94215494,0.000013709887,0.020757707,0.00006515661,0.00006908031],"about_ca_topic_score_codex":0.000027874492,"about_ca_topic_score_gemma":0.0000143621555,"teacher_disagreement_score":0.8969009,"about_ca_system_score_codex":0.000023131852,"about_ca_system_score_gemma":0.0001307517,"threshold_uncertainty_score":0.26591957},"labels":[],"label_agreement":null},{"id":"W4230078921","doi":"10.23952/asvao.2.2020.1.07","title":"On a class of nonsmooth fractional robust multi-objective optimization problems. Part I: Optimality conditions","year":2020,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Class (philosophy); Mathematical optimization; Mathematics; Fractional programming; Computer science; Artificial intelligence; Nonlinear programming; Nonlinear system; Physics","score_opus":0.027244085910385636,"score_gpt":0.25311997637561484,"score_spread":0.2258758904652292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230078921","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024829002,0.00002130891,0.99647164,0.0013817542,0.00004291499,0.00038622366,0.00010791947,0.00014229908,0.0011976424],"genre_scores_gemma":[0.4313283,0.000109806424,0.5656466,0.0012831984,0.000059102265,0.000083157545,0.0014041739,0.000022528093,0.00006313242],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973324,0.00017693335,0.0007664828,0.0008650441,0.0006091626,0.00024998278],"domain_scores_gemma":[0.9979977,0.00018262047,0.000653252,0.00039414363,0.00053967215,0.00023260833],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036601757,0.00030992608,0.00058871123,0.0005656603,0.00039116526,0.00020685692,0.00034086726,0.00016804323,0.0004719312],"category_scores_gemma":[0.00014077479,0.00030146097,0.00025406838,0.0038827313,0.00009803255,0.00055648363,0.00012319871,0.00019579988,0.0000112409125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003147749,0.00020787396,0.00029834599,0.000017371594,0.0007519138,5.1623266e-7,0.0004220378,0.939385,0.000030766867,0.058624677,0.00014170873,0.00008831151],"study_design_scores_gemma":[0.0009187883,0.00007491435,0.0008428793,0.000009882025,0.0007114579,6.777592e-7,0.000099622666,0.9966684,0.0000952328,0.00023143622,0.000038166705,0.00030853454],"about_ca_topic_score_codex":0.000043904405,"about_ca_topic_score_gemma":0.000012676407,"teacher_disagreement_score":0.43107998,"about_ca_system_score_codex":0.00007013506,"about_ca_system_score_gemma":0.00010917892,"threshold_uncertainty_score":0.99994373},"labels":[],"label_agreement":null},{"id":"W4230266875","doi":"10.23952/jnva.2.2018.3.09","title":"Subdifferentials and SNC property of scalarization functionals with uniform level sets and applications","year":2018,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Alexander von Humboldt-Stiftung","keywords":"Property (philosophy); Mathematics; Applied mathematics; Pure mathematics; Epistemology; Philosophy","score_opus":0.02045533504434129,"score_gpt":0.2513287533844402,"score_spread":0.23087341834009892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230266875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010196374,0.000072335766,0.9874407,0.0020624257,0.00001882025,0.00007668528,0.000037006208,0.000006398596,0.0000892288],"genre_scores_gemma":[0.79259515,0.00012045719,0.2066421,0.0002021108,0.0001831427,0.0000041469816,0.000049889117,0.0000054979705,0.00019749656],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987869,0.000060114828,0.00047602956,0.00019358912,0.00039992647,0.00008338961],"domain_scores_gemma":[0.9975912,0.00012538196,0.0004990747,0.00011950304,0.0015610307,0.00010379159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043413232,0.00010794812,0.00031333228,0.00053632044,0.00017646422,0.00010938224,0.00012916926,0.000052733187,0.000055878434],"category_scores_gemma":[0.0000587068,0.00006655675,0.00007878274,0.0011544306,0.00009188621,0.00048373433,0.00006106324,0.000067637615,7.514819e-7],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005125577,0.0017145297,0.4583027,0.0002147124,0.015075587,0.000004167099,0.0020761592,0.039334428,0.0029284817,0.43021533,0.0003876497,0.049233697],"study_design_scores_gemma":[0.00061048777,0.00018746998,0.34158903,0.00001328154,0.0010537067,0.00003985881,0.000031490046,0.6515272,0.0001235777,0.0040289788,0.0006585529,0.00013630655],"about_ca_topic_score_codex":0.00003098807,"about_ca_topic_score_gemma":0.000032820233,"teacher_disagreement_score":0.78239876,"about_ca_system_score_codex":0.000018652832,"about_ca_system_score_gemma":0.00013530198,"threshold_uncertainty_score":0.27141055},"labels":[],"label_agreement":null},{"id":"W4230390693","doi":"10.1007/978-3-319-48311-5_12","title":"Infimal Convolution","year":2017,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Convolution (computer science); Mathematics; Computer science; Artificial intelligence","score_opus":0.03435626613962568,"score_gpt":0.2561707242047038,"score_spread":0.22181445806507816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230390693","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[6.8912857e-7,0.00006733139,0.30288777,0.0002099053,0.00013501111,0.000107322136,0.0000045030843,0.00005592511,0.69653153],"genre_scores_gemma":[0.0005310891,0.0000724764,0.11875758,0.00012935424,0.00009981637,0.000008107528,0.000019943758,0.00002487738,0.8803567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988156,0.0000086619175,0.00041585934,0.0002826248,0.00033375964,0.00014348378],"domain_scores_gemma":[0.9984441,0.000065907385,0.0004579066,0.0008487862,0.00012898254,0.00005432405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026610045,0.00020930592,0.0003411857,0.00023310001,0.0001145367,0.00020794688,0.0008591684,0.00021559212,0.00018256051],"category_scores_gemma":[0.00007416137,0.00020302278,0.00012780973,0.000017342314,0.00006331743,0.00021944541,0.00024431467,0.00022116877,0.0003542166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.456942e-7,0.0000152126195,0.0000044733288,0.00003840062,0.000026691172,0.0000071527215,0.00021855235,0.00018892034,0.0000014779532,0.9979029,0.0007880098,0.00080774026],"study_design_scores_gemma":[0.00017370893,0.000013963085,0.000021419959,0.00022253273,0.000031364663,0.00000798117,0.0000028534434,0.23305176,0.0000048668508,0.7241501,0.04202813,0.00029128033],"about_ca_topic_score_codex":0.0000030984377,"about_ca_topic_score_gemma":0.0000108355,"teacher_disagreement_score":0.27375278,"about_ca_system_score_codex":0.00008915406,"about_ca_system_score_gemma":0.00011489494,"threshold_uncertainty_score":0.82790285},"labels":[],"label_agreement":null},{"id":"W4230794122","doi":"10.23952/jano.2.2020.2.05","title":"Weak convergence of a primal-dual algorithm for split common fixed-point problems in Hilbert spaces","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Tianjin Municipal Education Commission","keywords":"Convergence (economics); Hilbert space; Mathematics; Fixed point; Dual (grammatical number); Algorithm; Weak convergence; Computer science; Pure mathematics; Mathematical analysis; Linguistics","score_opus":0.011845325650636642,"score_gpt":0.22799098491161757,"score_spread":0.21614565926098092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230794122","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032700508,0.000053130643,0.9953051,0.003807925,0.000045466368,0.00016711999,0.0000037329294,0.000009804219,0.0002806676],"genre_scores_gemma":[0.27027544,0.000120652,0.72901255,0.0004988916,0.000060398776,0.0000067577425,0.00000846573,0.0000070379137,0.000009797005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887085,0.00002708033,0.0005782491,0.00016975406,0.0002423712,0.00011169132],"domain_scores_gemma":[0.99900395,0.00010492957,0.0005108324,0.00007034725,0.00019649218,0.00011347143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023645433,0.00010149694,0.000330894,0.00010958476,0.00004052534,0.00005767641,0.00018287763,0.000052307623,0.00003071694],"category_scores_gemma":[0.00003778836,0.00008499195,0.00007159542,0.0005118326,0.00002649064,0.0003091184,0.000057837467,0.00009608528,7.129904e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053454027,0.00011793599,0.0002810517,0.00003073443,0.0000380639,8.0198066e-7,0.00077087677,0.97317916,0.00017017683,0.014276671,0.00015061298,0.010930448],"study_design_scores_gemma":[0.00078690576,0.00021224562,0.00029052355,0.000015642045,0.000022452761,0.0000047546832,0.00006081491,0.99692243,0.000293484,0.00087209896,0.00042314827,0.000095500174],"about_ca_topic_score_codex":0.0000057899965,"about_ca_topic_score_gemma":3.0988477e-7,"teacher_disagreement_score":0.26994842,"about_ca_system_score_codex":0.000022274688,"about_ca_system_score_gemma":0.000058581976,"threshold_uncertainty_score":0.34658712},"labels":[],"label_agreement":null},{"id":"W4230829997","doi":"10.23952/asvao.2.2020.3.02","title":"On split generalized mixed equality equilibrium and split equality fixed point problems","year":2020,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"African University of Science and Technology; African Development Bank Group","keywords":"Mathematics; Fixed point; Mathematical economics; Point (geometry); Pure mathematics; Mathematical analysis; Geometry","score_opus":0.029641203887744775,"score_gpt":0.25536751427358123,"score_spread":0.22572631038583646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230829997","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010665209,0.00006446324,0.98341185,0.0041412227,0.000037640806,0.00035339518,0.00003439335,0.00020536875,0.0010864784],"genre_scores_gemma":[0.7544024,0.000100952886,0.24124002,0.0033485882,0.00007443352,0.00004668199,0.00063709525,0.000023234716,0.00012660981],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99673903,0.00032227792,0.00082066754,0.0011469312,0.000621971,0.0003491017],"domain_scores_gemma":[0.99826413,0.0001490646,0.00043836437,0.00055598124,0.00021904489,0.00037338515],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00092057406,0.00036748557,0.00072519726,0.0003425093,0.0002664979,0.0005849178,0.00039253867,0.00016240102,0.00021603229],"category_scores_gemma":[0.00010945286,0.0003347972,0.00022148255,0.0027816931,0.00007447189,0.00044470662,0.00031572636,0.0001688845,0.000015906087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000419625,0.00006476347,0.00023500965,0.000033534867,0.00051324465,5.8257183e-7,0.00067669014,0.76304793,0.0002764599,0.23429544,0.00012200178,0.0006923834],"study_design_scores_gemma":[0.0009729419,0.00005961815,0.0013449073,0.0000056567587,0.00058753527,5.848876e-7,0.000055624907,0.9934379,0.00023209446,0.0028039026,0.000094308525,0.0004049133],"about_ca_topic_score_codex":0.00010911904,"about_ca_topic_score_gemma":0.000016241942,"teacher_disagreement_score":0.74373716,"about_ca_system_score_codex":0.000049666454,"about_ca_system_score_gemma":0.00005125763,"threshold_uncertainty_score":0.9999104},"labels":[],"label_agreement":null},{"id":"W4230875040","doi":"10.23952/asvao.3.2021.1.03","title":"Byrne’s extended CQ-algorithms in the light of Moreau-Yosida regularization","year":2021,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Aix-Marseille Université","keywords":"Monotone polygon; Mathematics; Regular polygon; Combinatorics; Operator (biology); Regularization (linguistics); Null (SQL); Discrete mathematics; Algorithm; Computer science; Chemistry; Geometry","score_opus":0.009467551299737996,"score_gpt":0.23370365906300103,"score_spread":0.22423610776326303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230875040","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00043900806,0.000119412216,0.9944648,0.0016919274,0.000029768746,0.00014033206,0.000006230685,0.00003447136,0.0030740623],"genre_scores_gemma":[0.62872696,0.0003046497,0.36893636,0.00078792777,0.000049492035,0.000042499796,0.0007590882,0.000014435947,0.00037860003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99800193,0.0002124418,0.0005666867,0.0005196152,0.00051795406,0.00018135148],"domain_scores_gemma":[0.9986795,0.00007711241,0.00029624157,0.0005685794,0.00032249157,0.00005604679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062955887,0.00017475376,0.00038191018,0.0005143175,0.00016877044,0.00022532452,0.00037038728,0.00010729848,0.00008508758],"category_scores_gemma":[0.000060364808,0.00013931603,0.00015135619,0.005979549,0.00003536174,0.00030384943,0.00010645762,0.00010110428,0.0000021839471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004814479,0.000114295355,0.0003337496,0.000008053649,0.0002436637,0.0000025133193,0.0009084872,0.78204954,0.00020355204,0.21441646,0.000037188274,0.0016776632],"study_design_scores_gemma":[0.000401718,0.000011718964,0.0036861885,0.0000053625217,0.00042743157,0.000002409852,0.0002554955,0.99156386,0.00081592775,0.0025972363,0.000068629335,0.00016399665],"about_ca_topic_score_codex":0.000036725807,"about_ca_topic_score_gemma":0.000037088033,"teacher_disagreement_score":0.628288,"about_ca_system_score_codex":0.00002948055,"about_ca_system_score_gemma":0.000073068695,"threshold_uncertainty_score":0.5681143},"labels":[],"label_agreement":null},{"id":"W4231782214","doi":"10.23952/jnva.2.2018.3.10","title":"Optimality conditions for weakly efficient solutions of vector variational inequalities via convexificators","year":2018,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Foundation for Science and Technology Development","keywords":"Variational inequality; Mathematics; Applied mathematics; Inequality; Mathematical optimization; Mathematical analysis","score_opus":0.028075176592995816,"score_gpt":0.2928571413949666,"score_spread":0.2647819648019708,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231782214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062116226,0.000049625138,0.9904646,0.0026027707,0.0001885071,0.00008724071,0.00030761934,0.0000132977375,0.00007470256],"genre_scores_gemma":[0.7646496,0.000009974814,0.23462193,0.00016630393,0.00036003155,0.000005839241,0.00011963856,0.000005315736,0.00006134216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978239,0.00016742917,0.0010098107,0.00023430471,0.0005892307,0.00017534861],"domain_scores_gemma":[0.99519736,0.0007398412,0.0009885895,0.00020249635,0.0027345868,0.00013715497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015454916,0.00014262233,0.0004528889,0.0008250291,0.0003405067,0.000090490714,0.0003351968,0.00008003786,0.00023449158],"category_scores_gemma":[0.00040319542,0.00012363117,0.00046691488,0.001597421,0.00012375979,0.00034832518,0.000070479946,0.00009316973,0.0000042466754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060284736,0.00053417706,0.0023587893,0.000021388283,0.0032125553,6.1452977e-7,0.00073532225,0.11992555,0.00082321,0.8719465,0.00021582805,0.0001657379],"study_design_scores_gemma":[0.00047435213,0.00013290891,0.039451472,0.000007217096,0.00094792666,0.000008359761,0.00005009859,0.9513313,0.000112594695,0.007046305,0.00030689937,0.00013055302],"about_ca_topic_score_codex":0.000045071716,"about_ca_topic_score_gemma":0.0000122039355,"teacher_disagreement_score":0.86490023,"about_ca_system_score_codex":0.00007357465,"about_ca_system_score_gemma":0.0003229697,"threshold_uncertainty_score":0.50415325},"labels":[],"label_agreement":null},{"id":"W4231809672","doi":"10.23952/jano.2.2020.1.08","title":"Three extensions of Butnariu-Reich-Zaslavski theorem for inexact infinite products of nonexpansive mappings","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.017310395515079815,"score_gpt":0.22640861560569664,"score_spread":0.20909822009061682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231809672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089241634,0.000054716136,0.9940197,0.0045721736,0.000046942747,0.0001703916,0.0000061540745,0.000010903533,0.0002266073],"genre_scores_gemma":[0.52760214,0.0000665552,0.4717855,0.0004505742,0.000074769894,0.000002800724,0.000007440704,0.000007092967,0.0000031254579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987783,0.000018905703,0.000640066,0.00018089096,0.00027891307,0.00010294432],"domain_scores_gemma":[0.99775726,0.00017863419,0.00087884866,0.000120691446,0.00095744943,0.00010710316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022497345,0.00011247642,0.00038779236,0.00014474006,0.00005818838,0.00003111958,0.00023592912,0.000055543864,0.000014911549],"category_scores_gemma":[0.00027217582,0.00008858104,0.0000984742,0.0007247408,0.00004520771,0.00026844864,0.000068781716,0.00009360002,5.405848e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023834339,0.00013055658,0.00007265509,0.000063347914,0.00012605186,8.338537e-7,0.001049703,0.90823954,0.0037703796,0.08393077,0.00025740755,0.0021204061],"study_design_scores_gemma":[0.0008170835,0.0003239722,0.0003678992,0.00002459558,0.00007985479,0.000005214573,0.00006654314,0.9919665,0.0021668596,0.003844908,0.00022546659,0.0001111173],"about_ca_topic_score_codex":0.000002173712,"about_ca_topic_score_gemma":7.5017965e-8,"teacher_disagreement_score":0.52670974,"about_ca_system_score_codex":0.000011056279,"about_ca_system_score_gemma":0.00010889478,"threshold_uncertainty_score":0.36122298},"labels":[],"label_agreement":null},{"id":"W4231873779","doi":"10.23952/jnva.2.2018.2.07","title":"A Krasnoselskii-type algorithm for approximating solutions of variational inequality problems and convex feasibility problems","year":2018,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"African Capacity Building Foundation; Anhui University of Science and Technology","keywords":"Variational inequality; Mathematics; Regular polygon; Type (biology); Inequality; Applied mathematics; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.054661557515863955,"score_gpt":0.3008211946683584,"score_spread":0.24615963715249442,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231873779","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040232553,0.00011982725,0.99399585,0.0014355325,0.000095771575,0.0001767123,0.000100698926,0.00001281005,0.000039562772],"genre_scores_gemma":[0.27497682,0.000039570834,0.7244204,0.0001308781,0.00029699912,0.0000055583423,0.00007502146,0.0000062688914,0.000048453978],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99761575,0.00016873727,0.0011589035,0.00031238917,0.0005599875,0.00018421678],"domain_scores_gemma":[0.99482924,0.00050252,0.0012109148,0.00019249335,0.0031269114,0.00013790338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025105632,0.00015817417,0.000547934,0.0005458396,0.00030463777,0.0001289817,0.00026611032,0.000093797076,0.000053994096],"category_scores_gemma":[0.0005321996,0.00013215594,0.00026091415,0.0017097093,0.00010358439,0.00062682125,0.00011541526,0.000121786245,9.115719e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029553828,0.004771226,0.12453936,0.00061537104,0.022926247,0.0000034557515,0.010866295,0.16106202,0.0027849348,0.63291794,0.00046797434,0.038749646],"study_design_scores_gemma":[0.0007608548,0.0002313094,0.031910535,0.00001566127,0.0007222354,0.000011903798,0.000026283378,0.9497607,0.00002276969,0.016233223,0.00016931459,0.00013523398],"about_ca_topic_score_codex":0.000052916792,"about_ca_topic_score_gemma":0.000025476562,"teacher_disagreement_score":0.7886987,"about_ca_system_score_codex":0.000048782007,"about_ca_system_score_gemma":0.00026139716,"threshold_uncertainty_score":0.5389163},"labels":[],"label_agreement":null},{"id":"W4232011352","doi":"10.23952/asvao.2.2020.2.06","title":"Strong convergence theorems of a split common null point problem and a fixed point problem in Hilbert spaces","year":2020,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hilbert space; Convergence (economics); Null (SQL); Point (geometry); Pure mathematics; Mathematical analysis; Computer science; Geometry; Economics","score_opus":0.011046061982814265,"score_gpt":0.22402888750426891,"score_spread":0.21298282552145464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232011352","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063861813,0.00007765027,0.98851633,0.0035505784,0.000009863878,0.00037788178,0.000012499154,0.00005637467,0.0010126667],"genre_scores_gemma":[0.72949916,0.0001516282,0.2697012,0.00046179982,0.00001298978,0.000026798369,0.00011420828,0.000009979167,0.000022229651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979639,0.0001264529,0.0006980453,0.0006356651,0.00035309303,0.00022286533],"domain_scores_gemma":[0.99889535,0.00008424847,0.00042907288,0.00027530084,0.00015682982,0.00015921667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005025198,0.00023269973,0.0006107204,0.000397261,0.000120951045,0.00019819224,0.00028984304,0.00009509614,0.00010081693],"category_scores_gemma":[0.000028298487,0.00020892583,0.00011050212,0.0027115978,0.00007819842,0.00039941346,0.00020450029,0.000122035184,0.0000023080224],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030889078,0.000062066814,0.0039456477,0.000039919756,0.00029989696,9.4039393e-7,0.002198418,0.83160967,0.00016985521,0.16097388,0.000030633117,0.00063815835],"study_design_scores_gemma":[0.0006048906,0.00005505088,0.0014389663,0.000015410606,0.00030964118,7.952051e-7,0.00030619302,0.9942989,0.00023090503,0.002496395,0.0000150728365,0.00022780795],"about_ca_topic_score_codex":0.00020913253,"about_ca_topic_score_gemma":0.00007658186,"teacher_disagreement_score":0.72311294,"about_ca_system_score_codex":0.000031932494,"about_ca_system_score_gemma":0.00004761041,"threshold_uncertainty_score":0.85197484},"labels":[],"label_agreement":null},{"id":"W4232605709","doi":"10.23952/jnva.4.2020.1.08","title":"Algorithms for monotone vector variational inequalities","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monotone polygon; Variational inequality; Mathematics; Inequality; Applied mathematics; Mathematical optimization; Computer science; Algebra over a field; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.03874295072251024,"score_gpt":0.2852641020431683,"score_spread":0.24652115132065808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232605709","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00050132157,0.00010162791,0.9778618,0.021220421,0.00008983093,0.00006564227,0.0000941065,0.000017577027,0.00004763665],"genre_scores_gemma":[0.1858587,0.00007240563,0.8101368,0.00251987,0.0011188096,0.000007053311,0.00013369998,0.000009865975,0.00014279828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982366,0.000102958424,0.0007372103,0.00023652273,0.0005510344,0.00013566726],"domain_scores_gemma":[0.9974741,0.00053185044,0.0005972501,0.000108367145,0.0010858686,0.00020256556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007249597,0.0001390098,0.00043008695,0.00040439854,0.00015437738,0.00019180866,0.00034354388,0.00006477287,0.00012737424],"category_scores_gemma":[0.00048859674,0.00011720115,0.00042225572,0.0014188271,0.000018919613,0.0006374942,0.00006577626,0.00011089751,0.0000043154296],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015272487,0.00035405037,0.005850559,0.000041981108,0.0075575984,0.0000070744654,0.0021864763,0.28861386,0.00029148167,0.6911528,0.0010243331,0.0027670609],"study_design_scores_gemma":[0.00064280006,0.000112540714,0.012627676,0.0000028108134,0.0007291686,0.0000058056353,0.000034119443,0.97885245,0.000025858473,0.0043439,0.0024856108,0.00013728763],"about_ca_topic_score_codex":0.000014918284,"about_ca_topic_score_gemma":0.0000027773058,"teacher_disagreement_score":0.69023854,"about_ca_system_score_codex":0.000032131135,"about_ca_system_score_gemma":0.00020534823,"threshold_uncertainty_score":0.4779324},"labels":[],"label_agreement":null},{"id":"W4232809470","doi":"10.1090/fic/044/07","title":"Recent results on 𝑝-stable convex compact sets with applications","year":2004,"lang":"en","type":"other","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Regular polygon; Mathematics; Computer science; Geometry","score_opus":0.01740535351083777,"score_gpt":0.25639661688055704,"score_spread":0.23899126336971926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232809470","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.2330248e-8,0.000033965247,0.42352438,0.002930274,0.000026353544,0.0001805934,0.00003377689,0.00021492089,0.5730557],"genre_scores_gemma":[0.00011067065,0.00033845403,0.08517755,0.0015832721,0.00007326026,0.00002846434,0.00032599573,0.00007759667,0.91228473],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989111,0.000025102923,0.00017136811,0.00042639833,0.00032291785,0.00014312367],"domain_scores_gemma":[0.99897194,0.000033390956,0.00018749862,0.000621317,0.00009284138,0.00009301043],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00007506108,0.0001703338,0.00019878383,0.0002359033,0.00006573455,0.00011513442,0.00044042035,0.000091887254,0.0017546929],"category_scores_gemma":[0.000006345062,0.00012246522,0.00003884082,0.0006482864,0.000020547575,0.000060047172,0.000030703748,0.00009413601,0.00081356487],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010389299,0.00018228409,0.0000069679963,0.00000933015,0.0001263395,0.0000019503373,0.000031313117,0.018596765,2.883492e-7,0.2632894,0.7138089,0.003936062],"study_design_scores_gemma":[0.00047436738,0.000036978206,0.00003805888,0.0000368861,0.000015380854,0.0000015115795,0.000002922493,0.010301008,0.000012143735,0.0003541374,0.98853344,0.00019318475],"about_ca_topic_score_codex":0.00019639959,"about_ca_topic_score_gemma":0.00015378832,"teacher_disagreement_score":0.33922902,"about_ca_system_score_codex":0.0000768451,"about_ca_system_score_gemma":0.00018127143,"threshold_uncertainty_score":0.9999644},"labels":[],"label_agreement":null},{"id":"W4233360483","doi":"10.23952/asvao.3.2021.3.05","title":"Minimality conditions for convex composite functions and an application in vector optimization","year":2021,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Composite number; Vector (molecular biology); Vector optimization; Regular polygon; Mathematics; Convex optimization; Mathematical optimization; Optimization problem; Algorithm; Biology; Recombinant DNA; Multi-swarm optimization; Geometry; Genetics","score_opus":0.013222735074300601,"score_gpt":0.2677172924364603,"score_spread":0.2544945573621597,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233360483","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004194222,0.000059343478,0.9941515,0.00073908234,0.00003361929,0.00035139677,0.0000760119,0.000090672926,0.0003041882],"genre_scores_gemma":[0.60059476,0.00010298534,0.3942024,0.00038960803,0.00004327828,0.00019068888,0.0043690093,0.000013822657,0.00009342527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981538,0.00012851496,0.00051033427,0.00077562773,0.00022703351,0.00020466474],"domain_scores_gemma":[0.99866456,0.00013203244,0.00023473633,0.00040513117,0.00041703696,0.00014649027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037826874,0.00020053706,0.0003987558,0.0005113234,0.00041173384,0.00035600684,0.0001545099,0.00013068636,0.000056713616],"category_scores_gemma":[0.000041835487,0.00021908025,0.00010004522,0.0026897981,0.00005572255,0.0005937717,0.00007659343,0.00008325962,0.0000018596043],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013690494,0.00012940158,0.0019758365,0.000012842888,0.00020890369,3.8710039e-7,0.00021894163,0.93498224,0.00045850655,0.061410576,0.000017887984,0.0005707792],"study_design_scores_gemma":[0.0007538652,0.000022740944,0.009167663,0.0000035819885,0.000528196,0.0000018957704,0.00017854944,0.98817575,0.000115269366,0.00077021867,0.000037076454,0.00024519386],"about_ca_topic_score_codex":0.000060351278,"about_ca_topic_score_gemma":0.00012873007,"teacher_disagreement_score":0.59994906,"about_ca_system_score_codex":0.000054678763,"about_ca_system_score_gemma":0.000071966046,"threshold_uncertainty_score":0.8933833},"labels":[],"label_agreement":null},{"id":"W4233367799","doi":"10.23952/jnva.3.2019.3.09","title":"A modified hybrid algorithm for solving a composite minimization problem in Banach spaces","year":2019,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Science and Technology of Sichuan Province","keywords":"Banach space; Minification; Composite number; Mathematics; Algorithm; Mathematical optimization; Computer science; Discrete mathematics","score_opus":0.009859603973316545,"score_gpt":0.24384367332648263,"score_spread":0.2339840693531661,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233367799","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010518777,0.00008396079,0.9873018,0.001785986,0.00006592977,0.00012055306,0.000024081377,0.000008688342,0.000090202164],"genre_scores_gemma":[0.21416679,0.000048415946,0.78518045,0.00020540526,0.000112793634,0.000004097752,0.000075508164,0.0000059743,0.00020057416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852496,0.00006227447,0.00064080866,0.00023182738,0.00039835827,0.00014174168],"domain_scores_gemma":[0.9983432,0.00027074714,0.0005435316,0.00012249377,0.00063978485,0.000080234306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066963304,0.000121185956,0.0004057156,0.0009993279,0.0000801877,0.00021004956,0.00025661488,0.000046595324,0.000039858714],"category_scores_gemma":[0.00004802272,0.00010381302,0.00026658428,0.0013683907,0.0000100283405,0.00066260283,0.000050910992,0.000100109355,0.0000024163023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004048837,0.00029899014,0.017053662,0.000022406979,0.0014934768,0.0000043060845,0.0003981467,0.95474607,0.00015138702,0.018078277,0.00006498243,0.007647814],"study_design_scores_gemma":[0.00091492175,0.000061769875,0.012467803,0.000012960238,0.00032555842,0.000010600308,0.00001974409,0.98372525,0.000022939952,0.0021383031,0.00018004498,0.0001200749],"about_ca_topic_score_codex":0.000034386645,"about_ca_topic_score_gemma":0.0000106591515,"teacher_disagreement_score":0.20364802,"about_ca_system_score_codex":0.000053148993,"about_ca_system_score_gemma":0.00012527186,"threshold_uncertainty_score":0.4233372},"labels":[],"label_agreement":null},{"id":"W4233550747","doi":"10.15353/rea.v4i1.1537","title":"Global Univalence when Mappings are not Necessarily Continuous","year":2012,"lang":"en","type":"article","venue":"Review of Economic Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Uniqueness; Jacobian matrix and determinant; Inflection point; Mathematics; Mathematical economics; Pure mathematics; Inflection; Computer science; Mathematical analysis; Applied mathematics; Geometry","score_opus":0.01693823964819001,"score_gpt":0.26444059374895157,"score_spread":0.24750235410076155,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233550747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014383746,0.030230783,0.9554728,0.0060734157,0.00015870012,0.00016326574,0.000042959244,0.00006461239,0.006355045],"genre_scores_gemma":[0.8970825,0.03390529,0.061834678,0.0058366824,0.00014759408,0.000016773465,0.000051987026,0.00000914112,0.0011153499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986749,0.00009999975,0.0005951211,0.00027809708,0.00014767653,0.00020417979],"domain_scores_gemma":[0.9984354,0.000060461232,0.0006941355,0.0005578307,0.00012672748,0.00012548301],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006738498,0.00013431201,0.00069959613,0.00016186148,0.000053868833,0.000045522393,0.0006966209,0.00003842477,0.0006716761],"category_scores_gemma":[0.000063788364,0.00012326162,0.00052115915,0.0009673677,0.000029619066,0.00063243957,0.0001425617,0.00003639298,0.00013480669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005002233,0.0002388355,0.43720356,0.0014186697,0.0051857363,0.0000016005339,0.00020289359,0.026123155,0.000004037339,0.5038519,0.008174604,0.017590024],"study_design_scores_gemma":[0.0005806301,0.00003669679,0.21974169,0.0013826609,0.0079032015,0.000012193334,0.000089747125,0.6893949,0.000036674155,0.0024740444,0.077176616,0.0011709563],"about_ca_topic_score_codex":0.00016735474,"about_ca_topic_score_gemma":0.000019942694,"teacher_disagreement_score":0.8956441,"about_ca_system_score_codex":0.0001258935,"about_ca_system_score_gemma":0.00005593266,"threshold_uncertainty_score":0.7354382},"labels":[],"label_agreement":null},{"id":"W4233846768","doi":"10.23952/jano.1.2019.2.08","title":"Generalized monotone mixed equilibrium problems in FC-spaces: Existence and approximation","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Central Florida","keywords":"Monotone polygon; Mathematics; Applied mathematics; Pure mathematics; Mathematical economics; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.009947744684997567,"score_gpt":0.21528139591667378,"score_spread":0.2053336512316762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233846768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04163407,0.00009781901,0.9565587,0.0007753284,0.000070387425,0.00016442695,5.7503985e-7,0.000015085599,0.00068362633],"genre_scores_gemma":[0.60037947,0.00017519016,0.39917454,0.00018270855,0.000028939969,0.00000522636,0.000006906102,0.0000066810708,0.000040310064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895465,0.000043124717,0.0004361155,0.00019765717,0.0002494548,0.000118992844],"domain_scores_gemma":[0.99925643,0.000056451016,0.00037259609,0.000105721745,0.00012344123,0.000085351276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032113786,0.00010602373,0.00026451406,0.00021506324,0.00003306899,0.00016747414,0.00015043476,0.000060805312,0.000020621677],"category_scores_gemma":[0.000020279998,0.000087520464,0.000035560908,0.000497466,0.000019464871,0.0006034271,0.00006528243,0.00010083842,0.0000029313096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038483096,0.000063844294,0.0005663669,0.000020649317,0.000016022115,6.3444554e-7,0.00040579212,0.9661768,0.00072060525,0.030135911,0.000014287171,0.0018406218],"study_design_scores_gemma":[0.00093822187,0.00008902103,0.0010680592,0.00001752842,0.000011276728,0.0000103168995,0.00003914265,0.9947497,0.00011065186,0.0027376101,0.00011887834,0.000109585046],"about_ca_topic_score_codex":0.000004815482,"about_ca_topic_score_gemma":2.8743736e-7,"teacher_disagreement_score":0.55874544,"about_ca_system_score_codex":0.000029394389,"about_ca_system_score_gemma":0.00003432062,"threshold_uncertainty_score":0.3568981},"labels":[],"label_agreement":null},{"id":"W4233953722","doi":"10.23952/jnva.2.2018.1.05","title":"Two simple relaxed perturbed extragradient methods for solving variational inequalities in Euclidean spaces","year":2018,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Simple (philosophy); Variational inequality; Euclidean geometry; Mathematics; Applied mathematics; Inequality; Pure mathematics; Algebra over a field; Calculus (dental); Mathematical optimization; Mathematical analysis; Geometry; Medicine; Epistemology; Philosophy; Orthodontics","score_opus":0.035296079962392035,"score_gpt":0.3561457855130155,"score_spread":0.3208497055506235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233953722","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054680463,0.00013673936,0.9905288,0.0034710863,0.00016190433,0.00007945798,0.000025142459,0.000013597633,0.00011520475],"genre_scores_gemma":[0.2580486,0.000031215823,0.7408024,0.00039751446,0.0005169604,0.0000049705372,0.00005185541,0.0000071427294,0.00013930282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99773866,0.00030451413,0.0009906451,0.0003031184,0.00044507362,0.00021798312],"domain_scores_gemma":[0.99618435,0.0014692901,0.0007382681,0.00018042275,0.0012922136,0.00013547442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033426024,0.00017207461,0.0005054278,0.0012152586,0.00023577616,0.00027303852,0.0003697678,0.00007233067,0.00015050148],"category_scores_gemma":[0.0010242965,0.00014315802,0.0003735756,0.001865934,0.000046199617,0.0007424374,0.000086368455,0.00014074429,0.0000020615487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018261433,0.00056172087,0.029322527,0.000031053125,0.0035743632,0.0000057067878,0.004514532,0.08494976,0.0007143935,0.8674726,0.00023766712,0.008433067],"study_design_scores_gemma":[0.00088221114,0.00011060071,0.02715254,0.000007585505,0.00046446227,0.0000108191825,0.0001076351,0.93684775,0.00004386746,0.032938283,0.0012685246,0.00016573137],"about_ca_topic_score_codex":0.000119433695,"about_ca_topic_score_gemma":0.00013937156,"teacher_disagreement_score":0.85189795,"about_ca_system_score_codex":0.00008831141,"about_ca_system_score_gemma":0.0002287106,"threshold_uncertainty_score":0.5837814},"labels":[],"label_agreement":null},{"id":"W4234435134","doi":"10.23952/jano.2.2020.1.07","title":"Inexact orbits of set-valued nonexpansive mappings with summable errors","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Israel Science Foundation","keywords":"Set (abstract data type); Computer science; Mathematics; Programming language","score_opus":0.012483671187066567,"score_gpt":0.2138085194490388,"score_spread":0.20132484826197225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234435134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014429219,0.000027201206,0.9951435,0.0024602904,0.000023828901,0.00006982888,0.0000015298062,0.000015173124,0.0008157799],"genre_scores_gemma":[0.6174923,0.00004748715,0.38157153,0.0008182919,0.0000452164,0.0000011701042,0.0000051045176,0.0000071590207,0.0000117204145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896014,0.000025585643,0.0004126926,0.00015746446,0.00034209486,0.00010199923],"domain_scores_gemma":[0.99879223,0.000045927463,0.0005693949,0.000080611535,0.0003594594,0.00015236039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012874365,0.00010748956,0.00030498483,0.000114551396,0.00005713011,0.000053971526,0.0002049566,0.000043706194,0.000036530695],"category_scores_gemma":[0.000037584276,0.00007929753,0.000052327232,0.0007764191,0.000029366727,0.00037600705,0.00004827745,0.000110462075,0.0000016477918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013508135,0.000041376337,0.00011490257,0.000015035382,0.00007409627,0.0000029151295,0.0008572984,0.98971134,0.0002832758,0.008197769,0.0001543627,0.00041252244],"study_design_scores_gemma":[0.0007674857,0.0002578361,0.00018523485,0.00001510773,0.000048145463,0.000009841346,0.0001113859,0.9975749,0.0005072956,0.00018019887,0.00023543555,0.00010710267],"about_ca_topic_score_codex":0.000003568976,"about_ca_topic_score_gemma":6.7936185e-8,"teacher_disagreement_score":0.6160494,"about_ca_system_score_codex":0.0000152331695,"about_ca_system_score_gemma":0.000081541046,"threshold_uncertainty_score":0.32336596},"labels":[],"label_agreement":null},{"id":"W4234814266","doi":"10.23952/asvao.2.2020.3.06","title":"Strong convergence of modified inertial Halpern simultaneous algorithms for a finite family of demicontractive mappings","year":2020,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Inertial frame of reference; Algorithm; Mathematics; Applied mathematics; Computer science; Physics; Classical mechanics","score_opus":0.02627384774336893,"score_gpt":0.25225908761562776,"score_spread":0.22598523987225883,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234814266","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029642326,0.000038810587,0.996166,0.0002965016,0.000021543243,0.00026977182,0.00007201293,0.000033082655,0.00013808106],"genre_scores_gemma":[0.73920196,0.000046836478,0.26025996,0.0002465482,0.000024915797,0.000017453607,0.00018056933,0.0000074870054,0.000014295576],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819255,0.00005985991,0.0007364235,0.0004915405,0.0003548937,0.00016471844],"domain_scores_gemma":[0.9981066,0.00035326852,0.0006544812,0.00023412144,0.0005395392,0.00011198688],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002826961,0.00018086402,0.00059356,0.00027224026,0.00010086919,0.000058233752,0.00032136875,0.00009997314,0.000026996033],"category_scores_gemma":[0.00021252585,0.00017022146,0.00021857077,0.0017763274,0.000054012922,0.000223515,0.000084009094,0.000071832,8.3672563e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063552536,0.000043421947,0.00013324952,0.000021290076,0.0006804269,3.0210572e-7,0.0008679182,0.9781979,0.0018035221,0.016729614,0.000009445981,0.0014493751],"study_design_scores_gemma":[0.0007128852,0.000057605917,0.00016105441,0.000003877513,0.00064883323,1.2877567e-7,0.00017397857,0.99682415,0.0010858878,0.00015111627,0.0000128460615,0.00016761734],"about_ca_topic_score_codex":0.000069296184,"about_ca_topic_score_gemma":0.0000037456298,"teacher_disagreement_score":0.7362377,"about_ca_system_score_codex":0.000019015966,"about_ca_system_score_gemma":0.00006337634,"threshold_uncertainty_score":0.694143},"labels":[],"label_agreement":null},{"id":"W4234891635","doi":"10.23952/jnva.4.2020.3.05","title":"Efficiency conditions for multiobjective bilevel programming problems via convexificators","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Foundation for Science and Technology Development","keywords":"Bilevel optimization; Multiobjective programming; Mathematical optimization; Multi-objective optimization; Computer science; Mathematics; Optimization problem","score_opus":0.023227180986303303,"score_gpt":0.2721182565099743,"score_spread":0.24889107552367098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234891635","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010081136,0.000055048193,0.99309033,0.0055536195,0.00005552087,0.00014138159,0.00004982799,0.000020556226,0.000025599149],"genre_scores_gemma":[0.6135673,0.000018831714,0.38543454,0.0006265155,0.00023609778,0.000011435993,0.00006949876,0.0000063466,0.00002947187],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985538,0.00006415455,0.0006128265,0.0002457535,0.00038692512,0.00013652806],"domain_scores_gemma":[0.99777836,0.00028764163,0.0005803181,0.00009497938,0.0010666584,0.00019206072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043680533,0.00012295926,0.00034401615,0.00044387922,0.00021976553,0.00015237828,0.00028307847,0.000055007662,0.000046188823],"category_scores_gemma":[0.00026039872,0.00010037686,0.00038114205,0.0019150322,0.000032256456,0.00046363517,0.000043076416,0.000110202076,0.0000036906763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008940122,0.000996269,0.014011027,0.00007680578,0.0076525006,0.0000065663653,0.0048104157,0.86748046,0.0009925776,0.09495615,0.00028973084,0.008638086],"study_design_scores_gemma":[0.00059339684,0.00014310249,0.0061490736,0.0000040826603,0.0007520468,0.000006642961,0.000054052245,0.9897202,0.000040544448,0.0014855068,0.00092778256,0.00012356316],"about_ca_topic_score_codex":0.0000078541625,"about_ca_topic_score_gemma":0.0000025690276,"teacher_disagreement_score":0.61255914,"about_ca_system_score_codex":0.000030087258,"about_ca_system_score_gemma":0.00015075221,"threshold_uncertainty_score":0.40932497},"labels":[],"label_agreement":null},{"id":"W4235019577","doi":"10.1090/ulect/075/08","title":"Extremal functions","year":2020,"lang":"en","type":"book-chapter","venue":"University lecture series","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval","funders":"","keywords":"Mathematics; Computer science","score_opus":0.008849487504040694,"score_gpt":0.15191439391718553,"score_spread":0.14306490641314484,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235019577","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.9617465e-8,0.000030111456,0.5304567,0.005720382,0.00010544185,0.000032384938,0.00002035171,0.0001337983,0.46350074],"genre_scores_gemma":[0.0006410099,0.00006164732,0.017543975,0.0005614647,0.00012391474,6.2232246e-8,0.0001065517,0.000009744841,0.9809516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993621,0.000011882828,0.00007189726,0.00030339797,0.0001724456,0.00007827391],"domain_scores_gemma":[0.99946743,0.000019765252,0.00007949365,0.00022823663,0.00012669466,0.00007838026],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000016581736,0.00015101484,0.00016220116,0.00015604068,0.00022725629,0.00006665592,0.00039080964,0.00014203333,0.0010029782],"category_scores_gemma":[0.000008839447,0.00016119356,0.00014562467,0.00012962877,0.000040329276,0.00032649073,0.00018154914,0.00018371208,0.00028485537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007907173,0.0000031839133,0.0000021846547,0.0000048061843,0.000094987,0.000030432742,0.00014293595,0.0010347042,0.0000028839384,0.9907129,0.0072995443,0.0006635305],"study_design_scores_gemma":[0.0000793924,0.000030969015,0.000011753244,0.0000070632773,0.00006928651,0.0000072809084,0.000011658897,0.0030605432,0.0000038051455,0.011989092,0.98453164,0.00019754267],"about_ca_topic_score_codex":0.0000056956023,"about_ca_topic_score_gemma":0.000059265705,"teacher_disagreement_score":0.9787238,"about_ca_system_score_codex":0.00006192032,"about_ca_system_score_gemma":0.000118627504,"threshold_uncertainty_score":0.99991024},"labels":[],"label_agreement":null},{"id":"W4235417972","doi":"10.23952/asvao.1.2019.2.04","title":"Hybrid iterative methods for multiple sets split feasibility problems","year":2019,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Science Foundation of Shandong Province; Linyi University","keywords":"Computer science; Iterative method; Mathematical optimization; Algorithm; Mathematics","score_opus":0.024458121313880254,"score_gpt":0.31054870216457303,"score_spread":0.2860905808506928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235417972","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002245286,0.000051412742,0.9958229,0.000289598,0.000060849972,0.0008549179,0.000031968095,0.00010936356,0.00053369335],"genre_scores_gemma":[0.25616965,0.000027298274,0.74254847,0.00029753445,0.000018826087,0.00008935798,0.0006028551,0.000012166416,0.00023385586],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787986,0.0001833065,0.0005265918,0.000885918,0.0002596071,0.00026468455],"domain_scores_gemma":[0.9982869,0.00031343044,0.00032336515,0.00057219964,0.00037612967,0.00012794387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010709298,0.00024885274,0.000530115,0.00044576812,0.00026944606,0.00039134634,0.00033406384,0.00008735903,0.00014039116],"category_scores_gemma":[0.00008877568,0.0002222244,0.00025416716,0.0016560286,0.000031225034,0.00047560254,0.00013118918,0.000089346715,0.000011646418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019521967,0.000070435206,0.0020651289,0.000023789362,0.0005578877,8.524471e-8,0.00037615307,0.95889765,0.00016790832,0.033748373,0.000031048006,0.004042027],"study_design_scores_gemma":[0.00083547435,0.000036838235,0.0013658671,0.0000038985854,0.00046262235,6.152335e-7,0.00003515147,0.9934726,0.00034118144,0.0029821873,0.00018379955,0.00027977364],"about_ca_topic_score_codex":0.000026996064,"about_ca_topic_score_gemma":0.000008746392,"teacher_disagreement_score":0.25392437,"about_ca_system_score_codex":0.000065829205,"about_ca_system_score_gemma":0.000048330152,"threshold_uncertainty_score":0.9062048},"labels":[],"label_agreement":null},{"id":"W4235579657","doi":"10.23952/asvao.2.2020.2.05","title":"A general iterative algorithm for generalized split feasibility and fixed point problems","year":2020,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Education, Science and Technology; National Research Foundation of Korea; National Research Foundation","keywords":"Fixed point; Algorithm; Iterative method; Mathematical optimization; Mathematics; Computer science; Point (geometry); Mathematical analysis; Geometry","score_opus":0.0265442920692342,"score_gpt":0.25700448553049665,"score_spread":0.23046019346126245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235579657","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012722092,0.000110698566,0.9960567,0.0017330201,0.000019287747,0.000550295,0.000051249917,0.00009907959,0.00010749637],"genre_scores_gemma":[0.049612865,0.00014407499,0.9475552,0.0017483613,0.000084087726,0.00010219124,0.00065311225,0.0000140113425,0.00008612562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981043,0.00009896303,0.00048094444,0.00082626817,0.00026841377,0.00022110679],"domain_scores_gemma":[0.9989431,0.000063371685,0.00024465346,0.00025957325,0.0002698832,0.00021944115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036720393,0.0002403847,0.00048964005,0.00022875343,0.00031808726,0.00044877664,0.00020733463,0.00009570777,0.000061996034],"category_scores_gemma":[0.000040092644,0.0002147817,0.00016946338,0.0017197976,0.000045366807,0.00037497256,0.00013360885,0.00007591567,0.0000017159107],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021677592,0.00005053311,0.00030838567,0.00002252965,0.0006590335,3.8686196e-7,0.0013320883,0.9461653,0.0001310167,0.044662748,0.000103006685,0.0065432913],"study_design_scores_gemma":[0.0011496457,0.00005235025,0.00046265504,0.0000021294238,0.0006611682,6.24716e-7,0.00004319137,0.9959756,0.00010842373,0.0011910076,0.00009179326,0.0002614269],"about_ca_topic_score_codex":0.00003146099,"about_ca_topic_score_gemma":0.000008803839,"teacher_disagreement_score":0.04981028,"about_ca_system_score_codex":0.000037395923,"about_ca_system_score_gemma":0.000039103154,"threshold_uncertainty_score":0.8758544},"labels":[],"label_agreement":null},{"id":"W4235758848","doi":"10.1007/978-1-4419-9467-7_10","title":"Convex Functions: Variants","year":2011,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Convexity; Regular polygon; Convex function; Pure mathematics; Mathematics; Geometry; Economics","score_opus":0.04199159115104504,"score_gpt":0.22950075189560035,"score_spread":0.18750916074455531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235758848","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.2263791e-7,0.000064898864,0.423253,0.00008319305,0.00017918162,0.00010723823,0.000005713579,0.00006999245,0.57623655],"genre_scores_gemma":[0.00016735177,0.00007772172,0.10949357,0.00025995693,0.00007351286,0.000014989278,0.000019800089,0.00003380098,0.8898593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985766,0.0000140567545,0.0005566175,0.00036242342,0.0003223267,0.00016801429],"domain_scores_gemma":[0.99859744,0.00009693848,0.00033380237,0.0007453033,0.00015281673,0.00007370584],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027823957,0.00025846358,0.00040370834,0.00034490437,0.0000708158,0.0001035955,0.0006784826,0.00024225237,0.0014070161],"category_scores_gemma":[0.000049078557,0.00024527666,0.00014385718,0.00007756094,0.000047554437,0.00018430647,0.00020673072,0.00025306203,0.0011928481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.7215586e-7,0.00003831385,0.000002537237,0.000039227907,0.000059109527,0.000009543613,0.00052523916,0.00007094929,8.148059e-7,0.9967405,0.001766325,0.00074674346],"study_design_scores_gemma":[0.00017909492,0.000020792182,0.000013944387,0.00016806004,0.00005815447,0.000012968862,0.000010579305,0.06415953,0.0000029058472,0.89813465,0.036887467,0.0003518286],"about_ca_topic_score_codex":0.000003684838,"about_ca_topic_score_gemma":0.0000063615134,"teacher_disagreement_score":0.31375942,"about_ca_system_score_codex":0.0000692067,"about_ca_system_score_gemma":0.00011595884,"threshold_uncertainty_score":0.99999994},"labels":[],"label_agreement":null},{"id":"W4235789067","doi":"10.23952/jnva.3.2019.2.05","title":"Weak convergence theorems for infinite families of extended generalized hybrid mappings in Banach spaces","year":2019,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Banach space; Mathematics; Eberlein–Šmulian theorem; Convergence (economics); Pure mathematics; Banach manifold; Discrete mathematics; Lp space; Economics","score_opus":0.00993556594096051,"score_gpt":0.24787195536989165,"score_spread":0.23793638942893114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235789067","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1477931,0.0001692302,0.8497452,0.0018014525,0.0001289652,0.00010469016,0.000041887277,0.000006546207,0.0002088917],"genre_scores_gemma":[0.80539525,0.0002811676,0.19370767,0.0001870236,0.000081892846,0.0000026336177,0.000039054958,0.000004982406,0.00030032507],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983998,0.00009095528,0.00075730734,0.00020190811,0.0004240197,0.00012600541],"domain_scores_gemma":[0.99795765,0.0003539534,0.000716409,0.00015844568,0.000746346,0.0000671778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091088103,0.00011992115,0.0005032274,0.0010163862,0.00004737877,0.000073812575,0.00032522896,0.00004403851,0.00014496737],"category_scores_gemma":[0.000144531,0.000096406526,0.0003412063,0.0014080491,0.000027248434,0.00046743968,0.0000559334,0.000087003,0.000002433464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022843489,0.00046553166,0.1439364,0.00007429657,0.0037069444,0.0000038033468,0.0010230321,0.39246085,0.0018396974,0.45450962,0.00015602035,0.0015953585],"study_design_scores_gemma":[0.0009033963,0.000075632146,0.05654408,0.000012522967,0.00029731047,0.000005485185,0.00007738359,0.9345006,0.00013305295,0.006654146,0.0006813091,0.00011510107],"about_ca_topic_score_codex":0.000066252636,"about_ca_topic_score_gemma":0.000018532775,"teacher_disagreement_score":0.65760213,"about_ca_system_score_codex":0.000026158916,"about_ca_system_score_gemma":0.00013855903,"threshold_uncertainty_score":0.3931344},"labels":[],"label_agreement":null},{"id":"W4236367113","doi":"10.23952/jnva.4.2020.1.01","title":"Editorial: A special issue dedicated to Franco Giannessi","year":2020,"lang":"en","type":"editorial","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Engineering ethics; Engineering","score_opus":0.006033457116193005,"score_gpt":0.2569187113802373,"score_spread":0.2508852542640443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236367113","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000016900375,0.00005925215,0.36257714,0.0061282977,0.6307602,0.000065131644,0.00020559313,0.000021974787,0.00018072054],"genre_scores_gemma":[0.000026504305,0.00015354171,0.09063435,0.00046956472,0.907903,0.0000033419576,0.00040230484,0.00001967805,0.00038769806],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9948631,0.00020924862,0.0013733421,0.0005674677,0.0027353226,0.00025150587],"domain_scores_gemma":[0.99355596,0.00082089624,0.0014045398,0.00031765588,0.0033445319,0.0005564157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008983581,0.00037300232,0.0012212815,0.0015186672,0.0001997216,0.00054013083,0.0011764148,0.0005707698,0.0005609646],"category_scores_gemma":[0.0022911462,0.00031908546,0.0007682663,0.004247498,0.000029053266,0.00057867717,0.00027720726,0.0008371366,0.00009526992],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006583281,0.00012145208,0.00007163741,0.000016809769,0.0031719918,0.0000124664975,0.00027442077,0.009098026,0.000004316999,0.0005534216,0.9859565,0.00065314263],"study_design_scores_gemma":[0.00053664926,0.000137841,0.0002231227,0.000022348691,0.002077207,0.0000021618723,0.000015842952,0.09826513,0.0000018441266,0.0003799159,0.8980322,0.00030577276],"about_ca_topic_score_codex":0.000058752517,"about_ca_topic_score_gemma":0.00003469824,"teacher_disagreement_score":0.2771428,"about_ca_system_score_codex":0.00012018208,"about_ca_system_score_gemma":0.0010557814,"threshold_uncertainty_score":0.99992615},"labels":[],"label_agreement":null},{"id":"W4236445968","doi":"10.23952/jnva.4.2020.3.02","title":"Strong convergence of inertial Mann algorithms for solving hierarchical fixed point problems","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Fixed point; Inertial frame of reference; Algorithm; Mathematics; Computer science; Applied mathematics; Mathematical optimization; Mathematical analysis; Physics; Classical mechanics","score_opus":0.030614805425328663,"score_gpt":0.27088284460946,"score_spread":0.24026803918413134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236445968","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037196525,0.00006190079,0.9866261,0.009386047,0.0000711639,0.00006572256,0.000038049948,0.00000829487,0.000023076793],"genre_scores_gemma":[0.5620304,0.000049720926,0.437022,0.00041854827,0.00039720914,0.0000024375418,0.00004088934,0.0000055128526,0.000033304717],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834126,0.00005620889,0.00078929093,0.000208926,0.00047832262,0.00012599431],"domain_scores_gemma":[0.9979896,0.0002511234,0.00064357324,0.000098596975,0.0008470965,0.00017001457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005231058,0.00011318209,0.0004237154,0.00032857741,0.00009571778,0.00007621821,0.00033514807,0.000053290474,0.000088553556],"category_scores_gemma":[0.000276736,0.00009217936,0.00039980633,0.0011280248,0.000028619213,0.00044419392,0.00008367645,0.0001246574,0.0000010978596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020656514,0.0005011722,0.017474875,0.00011856473,0.006669295,0.00000764432,0.002356437,0.8521135,0.003516,0.11295242,0.0004445875,0.0036389462],"study_design_scores_gemma":[0.00058320566,0.00018590824,0.006705558,0.000007659877,0.0005592386,0.0000046543514,0.000024235404,0.9906457,0.00012738239,0.0008432951,0.00021456083,0.00009859409],"about_ca_topic_score_codex":0.000011849587,"about_ca_topic_score_gemma":0.000003854561,"teacher_disagreement_score":0.55831075,"about_ca_system_score_codex":0.000019875984,"about_ca_system_score_gemma":0.0001659449,"threshold_uncertainty_score":0.3758965},"labels":[],"label_agreement":null},{"id":"W4236668365","doi":"10.23952/asvao.2.2020.2.08","title":"Bregman common skew-attractive point theorems for semigroups of nonlinear mappings in Banach spaces","year":2020,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Banach space; Mathematics; Skew; Nonlinear system; Pure mathematics; Applied mathematics; Computer science; Physics","score_opus":0.013657895252529202,"score_gpt":0.24306950665447769,"score_spread":0.2294116114019485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236668365","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033196067,0.00004584355,0.9933668,0.0023406604,0.000014046557,0.0002923126,0.000029497221,0.000047253194,0.00054400397],"genre_scores_gemma":[0.6543483,0.00006817584,0.34455916,0.00062226993,0.000033492986,0.000026476953,0.0003138342,0.000010706167,0.000017570066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838436,0.00007566941,0.00054083986,0.0005254562,0.00028686057,0.00018683377],"domain_scores_gemma":[0.9988991,0.00015784481,0.0003930742,0.00025050095,0.00018883256,0.00011065441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043090474,0.00019143289,0.0005415713,0.0004511427,0.00013885775,0.00013985313,0.0003112777,0.000101499325,0.000042524185],"category_scores_gemma":[0.000053665255,0.00017872169,0.00017869424,0.0027547053,0.00004568744,0.00032934488,0.00009927614,0.00010056493,0.0000016385056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038192495,0.00007483146,0.0012142565,0.000023969074,0.00039616643,3.8797697e-7,0.0020090633,0.92019653,0.00019834806,0.07501234,0.000044690834,0.00079124095],"study_design_scores_gemma":[0.0006045932,0.000043461125,0.0010682194,0.0000063430266,0.00035637288,2.6176488e-7,0.00035661328,0.9954921,0.00046740304,0.0013510123,0.00005813737,0.00019550243],"about_ca_topic_score_codex":0.000120085395,"about_ca_topic_score_gemma":0.000047420188,"teacher_disagreement_score":0.6510287,"about_ca_system_score_codex":0.000030560645,"about_ca_system_score_gemma":0.000034290322,"threshold_uncertainty_score":0.7288059},"labels":[],"label_agreement":null},{"id":"W4236705252","doi":"10.23952/jano.2.2020.3.05","title":"An inertial Mann-like algorithm for fixed points of nonexpansive mappings in Hilbert spaces","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Inertial frame of reference; Hilbert space; Fixed point; Mathematics; Algorithm; Computer science; Pure mathematics; Mathematical analysis; Physics","score_opus":0.009497754820999958,"score_gpt":0.23014544622213567,"score_spread":0.22064769140113571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236705252","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084067066,0.000018406456,0.9949906,0.003897338,0.000052324493,0.00010787233,0.0000030734097,0.000009127189,0.00008062203],"genre_scores_gemma":[0.22427703,0.000042450243,0.7743004,0.0012618508,0.000091322545,0.0000036732806,0.000012069451,0.000006861875,0.000004352406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990215,0.000027037124,0.0004642633,0.00016805378,0.00021875916,0.000100423116],"domain_scores_gemma":[0.9990772,0.00006642154,0.0004137109,0.00006867232,0.00024831315,0.00012569646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001629788,0.00009456103,0.00028637424,0.00014888638,0.00003852838,0.0000628751,0.00020623795,0.000054319575,0.000015007647],"category_scores_gemma":[0.00003395172,0.000081132894,0.00006127496,0.00047716883,0.000019557869,0.0004074909,0.000034166944,0.00007917135,4.809841e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012414293,0.00014688639,0.00009701217,0.0000152064395,0.000045583347,0.0000019533145,0.0014090503,0.977349,0.0007525614,0.0044177747,0.00015615115,0.015484669],"study_design_scores_gemma":[0.000975449,0.00023424855,0.0002734314,0.000008280802,0.000020579735,0.0000025805382,0.00009272458,0.9973315,0.00037946278,0.00035832703,0.0002324093,0.00009101435],"about_ca_topic_score_codex":0.000004568643,"about_ca_topic_score_gemma":1.8208972e-7,"teacher_disagreement_score":0.22343637,"about_ca_system_score_codex":0.000016696209,"about_ca_system_score_gemma":0.000047586935,"threshold_uncertainty_score":0.33085033},"labels":[],"label_agreement":null},{"id":"W4236901845","doi":"10.23952/jnva.3.2019.2.02","title":"Iterative algorithms for split variational Inequalities and generalized split feasibility problems with applications","year":2019,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"African Capacity Building Foundation; African University of Science and Technology","keywords":"Variational inequality; Algorithm; Mathematics; Inequality; Iterative method; Mathematical optimization; Algebra over a field; Computer science; Applied mathematics; Pure mathematics; Mathematical analysis","score_opus":0.026922680682487144,"score_gpt":0.2848244915085602,"score_spread":0.25790181082607305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236901845","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008459346,0.00013622642,0.9882613,0.002561768,0.000038256952,0.0003232686,0.00013018222,0.000013735679,0.00007595969],"genre_scores_gemma":[0.104790665,0.00007378775,0.89349765,0.00041554795,0.00027820433,0.000040409082,0.00022391122,0.000010127452,0.0006697239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981388,0.00013106912,0.0006921475,0.00035965408,0.00052655267,0.0001517904],"domain_scores_gemma":[0.9970575,0.00051113154,0.0006631749,0.00020729519,0.0014251902,0.00013573318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011045422,0.00017608561,0.00048249352,0.0005071281,0.00019247283,0.00029215976,0.00023813873,0.00007025583,0.00010293677],"category_scores_gemma":[0.00006938138,0.0001312519,0.00021809721,0.001134818,0.00003740833,0.00073922734,0.00006242584,0.00011517666,0.000002597709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013838353,0.00040613773,0.05960013,0.000079505,0.0040696077,0.0000010413147,0.0011096819,0.13923518,0.000104647115,0.7937733,0.000043446285,0.0014389597],"study_design_scores_gemma":[0.0012743609,0.00015329522,0.053048078,0.0000098882965,0.0006828972,0.000017317496,0.000044488304,0.92949194,0.0000071834656,0.01375111,0.0013354992,0.00018391726],"about_ca_topic_score_codex":0.000030009927,"about_ca_topic_score_gemma":0.000016270567,"teacher_disagreement_score":0.7902568,"about_ca_system_score_codex":0.00005702218,"about_ca_system_score_gemma":0.0002152597,"threshold_uncertainty_score":0.5352297},"labels":[],"label_agreement":null},{"id":"W4238206443","doi":"10.23952/jnva.2.2018.3.06","title":"A Krasnoselskii-type algorithm for approximating zeros of monotone maps in Banach spaces with applications","year":2018,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monotone polygon; Mathematics; Banach space; Type (biology); Algorithm; Applied mathematics; Discrete mathematics; Geometry","score_opus":0.01159155292460649,"score_gpt":0.26578888351647373,"score_spread":0.2541973305918672,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238206443","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020067592,0.000053117674,0.9969208,0.0007921137,0.000030775253,0.00011375394,0.000029567425,0.0000058522423,0.000047238216],"genre_scores_gemma":[0.1046455,0.000021359327,0.8948917,0.00007790585,0.00025584482,0.000008349001,0.000036731046,0.000004915546,0.000057733858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865067,0.000050200815,0.00063219736,0.00019244832,0.00036054675,0.00011393659],"domain_scores_gemma":[0.997495,0.0002119977,0.0007087732,0.00014550998,0.001367679,0.00007101803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006791931,0.00010431902,0.00037719597,0.0007450479,0.000104040715,0.000078198216,0.00025581403,0.000048472873,0.000021605627],"category_scores_gemma":[0.000065962144,0.00008014485,0.00014391883,0.0024449837,0.000044152646,0.00035900855,0.000038663573,0.00007876309,9.221892e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00042916115,0.0031708416,0.07054416,0.00016816708,0.01423113,0.000009574187,0.0048973546,0.4256323,0.0012608833,0.39664918,0.0003458402,0.082661405],"study_design_scores_gemma":[0.00059622223,0.00017467851,0.0050704265,0.00001075036,0.00043983216,0.0000074231834,0.000048802012,0.9894289,0.00008982417,0.0035989266,0.00043901117,0.00009523626],"about_ca_topic_score_codex":0.00003568162,"about_ca_topic_score_gemma":0.000025120527,"teacher_disagreement_score":0.5637966,"about_ca_system_score_codex":0.00002809934,"about_ca_system_score_gemma":0.00015158794,"threshold_uncertainty_score":0.3268212},"labels":[],"label_agreement":null},{"id":"W4238404478","doi":"10.1007/s11228-017-0466-z","title":"Preface","year":2017,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Philosophy","score_opus":0.021250713558395976,"score_gpt":0.2790753072660079,"score_spread":0.2578245937076119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238404478","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024120705,0.000047626,0.9857342,0.0065259705,0.00009448854,0.000058312125,0.000023478786,0.00006998894,0.0050338274],"genre_scores_gemma":[0.9123278,0.000035280777,0.084252134,0.00049183244,0.00010188222,0.000009910956,0.00007784409,0.00000511678,0.0026981628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986521,0.00006827807,0.00025332687,0.0004431797,0.00041460377,0.00016852684],"domain_scores_gemma":[0.9985963,0.00006976526,0.00028213212,0.0006992621,0.00022786346,0.00012468577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041817952,0.00013530995,0.00024680953,0.00030095835,0.0010223837,0.0008354694,0.0007179915,0.000062343206,0.00026535953],"category_scores_gemma":[0.00016736964,0.00011866151,0.00019168507,0.0005798661,0.00004457064,0.0008762715,0.00026122262,0.00007400694,0.00005003643],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000043062423,0.00004665817,0.023689456,0.0000035078644,0.0012567402,0.0000018762621,0.00024620275,0.013527792,0.000027700195,0.9593303,0.00024470637,0.0016207288],"study_design_scores_gemma":[0.00020098526,0.000007876693,0.2606359,0.0000016980097,0.000366025,0.0000010663866,0.00000661982,0.7256468,0.00000957732,0.012319442,0.00067223504,0.00013178408],"about_ca_topic_score_codex":0.00018796795,"about_ca_topic_score_gemma":0.000042168693,"teacher_disagreement_score":0.9470109,"about_ca_system_score_codex":0.000023689536,"about_ca_system_score_gemma":0.0000579307,"threshold_uncertainty_score":0.8056451},"labels":[],"label_agreement":null},{"id":"W4238596059","doi":"10.23952/asvao.3.2021.3.04","title":"On convexity and quasiconvexity of extremal value functions in set optimization","year":2021,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Convexity; Set (abstract data type); Value (mathematics); Mathematics; Mathematical analysis; Mathematical economics; Mathematical optimization; Computer science; Economics; Statistics","score_opus":0.01548549559438364,"score_gpt":0.23979336503759174,"score_spread":0.2243078694432081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238596059","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0083042225,0.00007187788,0.989758,0.00048216016,0.00004465124,0.00014358739,0.000024665002,0.00004936681,0.0011214641],"genre_scores_gemma":[0.7667976,0.00019366252,0.23187505,0.00039614143,0.00002002716,0.00002039366,0.0005608995,0.000011891189,0.00012433984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979244,0.00020067194,0.00059216336,0.00069245824,0.00039113424,0.00019918526],"domain_scores_gemma":[0.998674,0.00017988049,0.00030325731,0.00043270766,0.0002930398,0.000117135634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004961545,0.00021884858,0.0005064362,0.00070488395,0.00020051148,0.0001729825,0.00016389585,0.00014363068,0.00019982646],"category_scores_gemma":[0.00010919935,0.00022089637,0.00012482126,0.0036472527,0.000075630414,0.00034720343,0.00013000143,0.00013390886,0.0000025436468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001711337,0.000110931054,0.0021656188,0.000013422047,0.00023967083,0.0000014426296,0.00029353867,0.8754194,0.000038987593,0.121310264,0.000016217244,0.00037342563],"study_design_scores_gemma":[0.0007169826,0.000028209086,0.0047380636,0.00000979002,0.0003797969,0.0000018045534,0.00016679808,0.992146,0.00019053002,0.0013967169,0.000008121541,0.00021714762],"about_ca_topic_score_codex":0.0000872224,"about_ca_topic_score_gemma":0.000054167343,"teacher_disagreement_score":0.75849336,"about_ca_system_score_codex":0.000046205594,"about_ca_system_score_gemma":0.00009035464,"threshold_uncertainty_score":0.90078926},"labels":[],"label_agreement":null},{"id":"W4238890740","doi":"10.1007/978-1-4939-7131-2_100403","title":"Generalized Eigenpair","year":2018,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Philosophy","score_opus":0.022519532716884356,"score_gpt":0.23108761856746673,"score_spread":0.20856808585058237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238890740","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[1.2966974e-7,0.000026047384,0.43915498,0.0005875778,0.00012168225,0.00003086985,0.0000018725574,0.000113914386,0.5599629],"genre_scores_gemma":[0.000015777414,0.000050563936,0.15290351,0.0015406895,0.00020541754,0.0000016345406,0.000028291883,0.000010073298,0.84524405],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99910873,0.000008135111,0.00019948959,0.00032636733,0.00026130865,0.00009597505],"domain_scores_gemma":[0.9991443,0.00001793018,0.00010760872,0.00045492596,0.00020762776,0.00006760699],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00008626164,0.00015051599,0.00017495101,0.000149343,0.000069647875,0.00011220654,0.0005364218,0.0001314913,0.019079758],"category_scores_gemma":[0.000005458368,0.00012558329,0.00015384576,0.00005052416,0.000022431843,0.00012802336,0.0001641341,0.00006147063,0.0032372093],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.0326353e-7,0.0000030808742,5.6402297e-7,0.0000012555626,0.0000505826,0.0000013007337,0.000020418842,0.000061957784,7.678161e-7,0.9542978,0.044852298,0.0007095912],"study_design_scores_gemma":[0.000099641096,0.000015909009,0.0000041013354,0.00000589742,0.000021936346,0.0000023445818,2.6585687e-7,0.101030536,0.000012203117,0.14823228,0.7503446,0.00023028572],"about_ca_topic_score_codex":0.0000063797547,"about_ca_topic_score_gemma":0.000009333826,"teacher_disagreement_score":0.8060655,"about_ca_system_score_codex":0.000027453543,"about_ca_system_score_gemma":0.000068366215,"threshold_uncertainty_score":0.99753886},"labels":[],"label_agreement":null},{"id":"W4239109439","doi":"10.23952/jano.1.2019.2.06","title":"Three convergence results for inexact orbits of nonexpansive mappings","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Mathematics; Applied mathematics; Mathematical economics; Economics; Macroeconomics","score_opus":0.008836865933084513,"score_gpt":0.2199011869786978,"score_spread":0.21106432104561326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239109439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013370697,0.00002435133,0.99678165,0.00082083326,0.000121988334,0.00014312683,0.0000044497524,0.000008255771,0.0007582887],"genre_scores_gemma":[0.5766614,0.00005970364,0.42297462,0.00021458018,0.00004536396,0.0000023190482,0.00000791996,0.000005064503,0.000029033225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989848,0.00001019324,0.00051736913,0.00015416098,0.0002393069,0.0000941324],"domain_scores_gemma":[0.9984968,0.00015271512,0.0006691576,0.00011607955,0.000495468,0.00006981632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026170816,0.00008557901,0.0002628696,0.00014068595,0.000039183524,0.000037922357,0.00021016847,0.0000509032,0.000020741692],"category_scores_gemma":[0.00006450917,0.00006896175,0.00007564164,0.00038643944,0.000017337341,0.00030157354,0.000041283878,0.0000652987,0.000002462345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002534078,0.000065371525,0.00015533948,0.000021333975,0.00006110489,3.70055e-7,0.00027377222,0.9591221,0.0006685059,0.037829973,0.00031309712,0.001235595],"study_design_scores_gemma":[0.0011485232,0.00019238348,0.0005543412,0.00001557602,0.000024246372,0.0000045048346,0.000026057869,0.9951584,0.00050393253,0.0019097925,0.000373377,0.00008891028],"about_ca_topic_score_codex":0.0000028505924,"about_ca_topic_score_gemma":1.1354159e-7,"teacher_disagreement_score":0.57532436,"about_ca_system_score_codex":0.000016289945,"about_ca_system_score_gemma":0.00006161079,"threshold_uncertainty_score":0.28121787},"labels":[],"label_agreement":null},{"id":"W4239457237","doi":"10.23952/asvao.2.2020.3.07","title":"A normal-subgradient algorithm for fixed point problems and quasiconvex equilibrium problems","year":2020,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Foundation for Science and Technology Development","keywords":"Quasiconvex function; Subgradient method; Mathematical optimization; Fixed point; Mathematics; Computer science; Algorithm; Mathematical analysis; Convex optimization; Regular polygon; Convex analysis; Geometry","score_opus":0.017680968373116078,"score_gpt":0.22077208467825535,"score_spread":0.20309111630513926,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239457237","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031282802,0.00014404296,0.99604124,0.0025003667,0.00002832813,0.0005847584,0.0000294434,0.0001420553,0.00021693473],"genre_scores_gemma":[0.14437468,0.00018299908,0.85266656,0.0017381754,0.00009496814,0.00019313116,0.00063317263,0.00002672946,0.00008960153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979483,0.000060037048,0.0005585975,0.0008146305,0.00031867542,0.00029979067],"domain_scores_gemma":[0.9988238,0.00007816651,0.00031303038,0.00027750217,0.00023256447,0.00027492022],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00038779638,0.0002680203,0.0004940366,0.00033077842,0.00025689596,0.0004536174,0.00027349926,0.000107274296,0.000049014296],"category_scores_gemma":[0.000032837204,0.0002468497,0.00017467875,0.0021173502,0.000050688395,0.00048156592,0.00017897054,0.000092422364,0.0000038858075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008980405,0.00005675945,0.000170682,0.000044871722,0.0005782105,3.870846e-7,0.0019355646,0.97071946,0.00014022611,0.01729828,0.000096861506,0.008949695],"study_design_scores_gemma":[0.0008641309,0.00008727792,0.0001619112,0.0000052186197,0.00063778216,0.000001100736,0.00007517209,0.9967037,0.000112883856,0.00068280677,0.00035569572,0.00031235392],"about_ca_topic_score_codex":0.000034964436,"about_ca_topic_score_gemma":0.0000091121665,"teacher_disagreement_score":0.14406186,"about_ca_system_score_codex":0.000027816197,"about_ca_system_score_gemma":0.000037380032,"threshold_uncertainty_score":0.9999984},"labels":[],"label_agreement":null},{"id":"W4239889688","doi":"10.23952/jano.1.2019.3.06","title":"Semicontinuity of the composition of set-valued map and scalarization function for sets","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Composition (language); Set (abstract data type); Function (biology); Mathematics; Computer science; Biology; Philosophy; Evolutionary biology","score_opus":0.006008323978339901,"score_gpt":0.21396936103636302,"score_spread":0.20796103705802313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239889688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015875833,0.000028115339,0.9832428,0.0004458396,0.000118409145,0.00017614504,0.000003953412,0.0000049890427,0.00010393514],"genre_scores_gemma":[0.87924385,0.000019188357,0.12058463,0.000104421495,0.0000196743,0.0000014887388,0.0000096224985,0.000003920855,0.000013207456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991985,0.000035899062,0.00039087798,0.00010800008,0.00020837314,0.000058337315],"domain_scores_gemma":[0.99882203,0.00007274526,0.000661213,0.00009328161,0.0003157449,0.000034974244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026313175,0.00006804504,0.00020576607,0.000089227025,0.000053665062,0.000030555475,0.00011137413,0.000054245662,0.0000107589185],"category_scores_gemma":[0.000017030492,0.0000487551,0.000062574945,0.00026433388,0.000025105524,0.00024525812,0.000042925996,0.00005570839,2.1507786e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020120094,0.000090546026,0.0015273287,0.00007102651,0.00007294211,3.3168515e-8,0.00032301433,0.9370389,0.008145284,0.04960416,0.00007029452,0.0028552627],"study_design_scores_gemma":[0.00077383325,0.00012351813,0.004788812,0.000024626774,0.000067391105,0.000003022985,0.000025586265,0.9898829,0.0018234034,0.0023818582,0.00004656007,0.000058477905],"about_ca_topic_score_codex":0.0000015029735,"about_ca_topic_score_gemma":6.747113e-8,"teacher_disagreement_score":0.86336803,"about_ca_system_score_codex":0.000014251576,"about_ca_system_score_gemma":0.0000296256,"threshold_uncertainty_score":0.19881752},"labels":[],"label_agreement":null},{"id":"W4240142185","doi":"10.23952/asvao.3.2021.1.08","title":"The iterative algorithm with inertial and error terms for fixed points of strictly pseudocontractive mappings and zeros of inverse strongly monotone operators","year":2021,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monotone polygon; Fixed point; Inertial frame of reference; Inverse; Algorithm; Mathematics; Applied mathematics; Discrete mathematics; Computer science; Mathematical analysis; Physics; Geometry","score_opus":0.008419692132606672,"score_gpt":0.2309234987171286,"score_spread":0.22250380658452193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240142185","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026346168,0.000047795816,0.9729146,0.00030955116,0.000010809375,0.00027134502,0.000046634526,0.000010820885,0.00004230307],"genre_scores_gemma":[0.5864993,0.00014822699,0.4130222,0.00008794881,0.000013459455,0.000041338204,0.0001376125,0.000007682936,0.000042252872],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988051,0.00007354965,0.0003857035,0.00038499758,0.00022017096,0.00013044693],"domain_scores_gemma":[0.9987373,0.00016770433,0.0003542371,0.00019846937,0.00047075635,0.000071576935],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025548798,0.00015499062,0.0003801867,0.00020430866,0.0002448161,0.00017570143,0.00011121827,0.000060844297,0.0000067596443],"category_scores_gemma":[0.000044841345,0.00010981227,0.000064903164,0.0011855604,0.000105676634,0.0003072636,0.00008322197,0.00005839761,6.607909e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014610756,0.00013759318,0.0020026786,0.00003232667,0.002679891,0.0000013190418,0.003205142,0.93756163,0.0020047429,0.045397077,0.000021277368,0.006810199],"study_design_scores_gemma":[0.0010734271,0.00006584501,0.0018532367,0.0000074120085,0.0005852002,0.0000012299348,0.0006372438,0.9924874,0.002940983,0.00020738279,0.000010052684,0.00013063576],"about_ca_topic_score_codex":0.000039365972,"about_ca_topic_score_gemma":0.000030799056,"teacher_disagreement_score":0.5601531,"about_ca_system_score_codex":0.00001550441,"about_ca_system_score_gemma":0.0000617367,"threshold_uncertainty_score":0.44780144},"labels":[],"label_agreement":null},{"id":"W4240225205","doi":"10.1007/978-1-4614-6170-8_100275","title":"Generalized Eigenpair","year":2014,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Political science","score_opus":0.017445543569068783,"score_gpt":0.21754330007368908,"score_spread":0.2000977565046203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240225205","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.8505262e-8,0.000021180582,0.50706846,0.0008120153,0.00008419758,0.000025109675,8.981705e-7,0.00010071213,0.4918874],"genre_scores_gemma":[0.000056880675,0.00004760004,0.12368679,0.0022470064,0.00013291187,0.0000018885743,0.000030823216,0.000010685683,0.87378544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999119,0.000011253306,0.00020688238,0.00031071034,0.00025976647,0.00009240985],"domain_scores_gemma":[0.99920005,0.000028665183,0.000114496695,0.00045388113,0.0001329127,0.00007001659],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00010365693,0.00015264464,0.00020413907,0.00014610299,0.000060318565,0.00010429398,0.00051579456,0.00012869874,0.0037704674],"category_scores_gemma":[0.0000064030373,0.00012783987,0.00016930977,0.00003994381,0.000012059213,0.00006800064,0.00013284537,0.000075503296,0.0014544512],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[2.7390857e-7,0.0000018727308,7.412017e-7,0.0000018360563,0.00004027529,8.332613e-7,0.0000067203373,0.0005520578,6.681531e-7,0.98128396,0.015264868,0.0028459113],"study_design_scores_gemma":[0.00009376485,0.000008712745,0.0000042416623,0.00000466518,0.000018298606,0.0000016700811,7.390381e-8,0.19781876,0.0000048621905,0.07484686,0.7270004,0.00019769836],"about_ca_topic_score_codex":0.000007836158,"about_ca_topic_score_gemma":0.000006876618,"teacher_disagreement_score":0.9064371,"about_ca_system_score_codex":0.000023217826,"about_ca_system_score_gemma":0.000047883514,"threshold_uncertainty_score":0.999323},"labels":[],"label_agreement":null},{"id":"W4240719804","doi":"10.23952/jnva.5.2021.6.03","title":"Weak and linear convergence of a generalized proximal point algorithm with alternating inertial steps for a monotone inclusion problem","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monotone polygon; Convergence (economics); Mathematics; Applied mathematics; Inertial frame of reference; Mathematical optimization; Algorithm; Physics; Geometry; Classical mechanics","score_opus":0.010116564471076407,"score_gpt":0.2561212226824506,"score_spread":0.24600465821137418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240719804","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032274146,0.00017369092,0.9650505,0.0023226286,0.000032124713,0.00008681772,0.000036298596,0.0000060783395,0.000017671658],"genre_scores_gemma":[0.12892775,0.00012960251,0.87049234,0.0001438949,0.00016350638,0.0000044883486,0.000043294232,0.0000058845176,0.000089241155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99834543,0.00009259801,0.00068708125,0.00024161326,0.00051650923,0.00011675914],"domain_scores_gemma":[0.9972076,0.00017267866,0.0007283939,0.00011783864,0.001666346,0.00010716318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006437227,0.0001265449,0.00044248544,0.00036645107,0.00019361115,0.0000727379,0.00017905739,0.00004988511,0.000031536987],"category_scores_gemma":[0.00010853134,0.00009497037,0.00019343151,0.0010742182,0.000028783654,0.00042983657,0.00024285993,0.000093614,1.5899633e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010464988,0.002549825,0.049958505,0.00033660408,0.020028735,0.00008612653,0.0064471853,0.72191566,0.020483274,0.14823364,0.0001134712,0.028800508],"study_design_scores_gemma":[0.0013570022,0.00016693451,0.0034288785,0.000022493074,0.0007213982,0.00004717379,0.000037073347,0.99156326,0.0008558645,0.0015385421,0.00014451086,0.000116845564],"about_ca_topic_score_codex":0.000048861864,"about_ca_topic_score_gemma":0.000021377222,"teacher_disagreement_score":0.26964766,"about_ca_system_score_codex":0.000024744295,"about_ca_system_score_gemma":0.00025716782,"threshold_uncertainty_score":0.3872779},"labels":[],"label_agreement":null},{"id":"W4241370447","doi":"10.23952/asvao.3.2021.2.02","title":"Weak approximate solutions to quasi-variational inequalities: Application to social Nash equilibria","year":2021,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational inequality; Mathematical economics; Nash equilibrium; Inequality; Mathematics; Applied mathematics; Mathematical optimization; Economics; Mathematical analysis","score_opus":0.019823808630409234,"score_gpt":0.26421345294131154,"score_spread":0.24438964431090232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241370447","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00053362316,0.00002197587,0.9923112,0.005009088,0.000058509737,0.000316782,0.00007408302,0.00017839773,0.0014963743],"genre_scores_gemma":[0.34052673,0.000026331558,0.65398526,0.0026146981,0.00020309433,0.00026669184,0.0018196289,0.000026776317,0.0005308217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971099,0.00019719098,0.0006873264,0.000947016,0.0006650961,0.00039348396],"domain_scores_gemma":[0.99820894,0.00011669572,0.0002462005,0.00051862485,0.00063693046,0.0002725811],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007970882,0.00027171662,0.0004894568,0.0007599044,0.0007329492,0.00059443316,0.0004015939,0.0001435844,0.00017439268],"category_scores_gemma":[0.00011993072,0.00029596136,0.0002013443,0.0065423753,0.000027495733,0.00041612255,0.000393032,0.00010653309,0.000047157602],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008243393,0.00009038999,0.00007912052,0.000007136092,0.00031841808,2.8735104e-7,0.0010702539,0.6205618,0.00045621343,0.37554038,0.00024919224,0.001618569],"study_design_scores_gemma":[0.00032178243,0.000017263808,0.0010365369,0.0000033687375,0.0004080671,0.0000012155417,0.00048986793,0.99452394,0.00010112305,0.0021958235,0.0005385675,0.00036244615],"about_ca_topic_score_codex":0.000078969795,"about_ca_topic_score_gemma":0.00008556593,"teacher_disagreement_score":0.37396213,"about_ca_system_score_codex":0.00012146177,"about_ca_system_score_gemma":0.00016582476,"threshold_uncertainty_score":0.9999493},"labels":[],"label_agreement":null},{"id":"W4241674788","doi":"10.23952/asvao.2.2020.1.04","title":"Bounded perturbation resilience of generalized viscosity iterative algorithms for split variational inclusion problems","year":2020,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Tianjin Municipal Education Commission","keywords":"Bounded function; Perturbation (astronomy); Resilience (materials science); Mathematics; Viscosity; Applied mathematics; Inclusion (mineral); Algorithm; Mathematical analysis; Physics; Thermodynamics","score_opus":0.02026381069082769,"score_gpt":0.2556318934823674,"score_spread":0.23536808279153973,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241674788","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008339197,0.000044122866,0.99620247,0.0021112775,0.000027133867,0.00046365886,0.000045085606,0.00006689093,0.0002054385],"genre_scores_gemma":[0.31750393,0.00006235734,0.6806087,0.0007666297,0.00005649794,0.00006059636,0.00086518476,0.000009793344,0.00006631079],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787986,0.00011135054,0.0006313304,0.0006630043,0.00053297833,0.00018149987],"domain_scores_gemma":[0.99841815,0.00013027081,0.0005109324,0.00024805323,0.0005565985,0.00013599875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048388835,0.00021050664,0.00045624413,0.00033873317,0.0006001003,0.00021449206,0.0003475059,0.00010909436,0.00006444815],"category_scores_gemma":[0.000107491695,0.00019409455,0.00018287473,0.002591104,0.000048516496,0.00051129336,0.00031482792,0.00007256999,0.0000013595055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003122767,0.000050735216,0.0001070333,0.000020696012,0.00030803637,8.8641855e-8,0.0025795898,0.80637306,0.00047719383,0.18941368,0.000026470289,0.00061221345],"study_design_scores_gemma":[0.00083195517,0.0000630085,0.000558036,0.0000050134045,0.00046507304,2.5087212e-7,0.00004154246,0.9916162,0.00048802092,0.0056498256,0.0000647932,0.00021631955],"about_ca_topic_score_codex":0.00003401113,"about_ca_topic_score_gemma":0.0000070552082,"teacher_disagreement_score":0.31667003,"about_ca_system_score_codex":0.000050104816,"about_ca_system_score_gemma":0.00008642622,"threshold_uncertainty_score":0.7914946},"labels":[],"label_agreement":null},{"id":"W4241802153","doi":"10.23952/asvao.2.2020.1.02","title":"Strong convergence of the Tseng extragradient method for solving variational inequalities","year":2020,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Civil Aviation University of China","keywords":"Variational inequality; Convergence (economics); Applied mathematics; Inequality; Mathematics; Mathematical optimization; Mathematical analysis; Economics; Macroeconomics","score_opus":0.02755449113889304,"score_gpt":0.26650185484340394,"score_spread":0.2389473637045109,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241802153","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020865427,0.000031260777,0.9976013,0.001679844,0.000043365133,0.00021372654,0.000029154164,0.000035690384,0.00015703576],"genre_scores_gemma":[0.4380621,0.000019411722,0.5612542,0.0004786828,0.000036598132,0.000024432895,0.00008797215,0.0000058243027,0.000030770498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852455,0.00010562038,0.00047866598,0.00039465484,0.0003475155,0.00014897573],"domain_scores_gemma":[0.99880505,0.00023669214,0.00037893764,0.00023572327,0.00026214618,0.000081480095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005840583,0.00014090465,0.0003132996,0.00015873773,0.0002629929,0.00011267113,0.0003518574,0.000058463145,0.00006664404],"category_scores_gemma":[0.00012744618,0.0001110224,0.0002041233,0.0018674602,0.000031480235,0.00021916683,0.00012457541,0.00006202757,6.108022e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000055571613,0.000012481507,0.00038087487,0.0000118129,0.00028441992,2.2721157e-8,0.0008185264,0.67572737,0.0001315419,0.32225576,0.000022102691,0.00034954562],"study_design_scores_gemma":[0.00028260722,0.000013579571,0.0010651179,0.0000028408956,0.0005039068,1.736651e-7,0.00018190025,0.9963399,0.00040039758,0.001038495,0.000041703992,0.00012937137],"about_ca_topic_score_codex":0.000041784482,"about_ca_topic_score_gemma":0.000008896581,"teacher_disagreement_score":0.43785346,"about_ca_system_score_codex":0.000023378578,"about_ca_system_score_gemma":0.00006698914,"threshold_uncertainty_score":0.4527362},"labels":[],"label_agreement":null},{"id":"W4241919750","doi":"10.23952/jnva.5.2021.6.07","title":"A new iterative method with alternated inertia for the split feasibility problem","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities","keywords":"Inertia; Computer science; Mathematical optimization; Iterative method; Mathematics; Physics; Classical mechanics","score_opus":0.020580835912369443,"score_gpt":0.30537518601275454,"score_spread":0.2847943501003851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241919750","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004338403,0.00017300456,0.98665255,0.012548496,0.000030171139,0.00007626279,0.00001931574,0.000006948704,0.000059410253],"genre_scores_gemma":[0.021025052,0.000038465078,0.9772867,0.00057350367,0.00021550103,0.0000029884245,0.0000324423,0.0000044336766,0.0008209042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862254,0.00014045641,0.00047750695,0.00023125346,0.0004205033,0.00010773453],"domain_scores_gemma":[0.9969166,0.00065414206,0.00045260912,0.00019044001,0.0016751899,0.00011099704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080138975,0.00011345274,0.00031624374,0.00021572712,0.00017684758,0.00028332713,0.0002730382,0.000037136546,0.00011286599],"category_scores_gemma":[0.00015969953,0.000065054715,0.00029154358,0.0017574487,0.00001269859,0.00041563174,0.00005760258,0.00011574391,8.5143853e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031034532,0.00048694198,0.024890333,0.000025727708,0.016729016,0.000022396018,0.0016387491,0.7056622,0.00035638097,0.23855217,0.00092495,0.010400804],"study_design_scores_gemma":[0.00078429957,0.000076705284,0.027411565,0.0000068261947,0.0014861504,0.000042943666,0.00002974905,0.963659,0.00009595234,0.0048325546,0.0014781432,0.00009609177],"about_ca_topic_score_codex":0.000045709297,"about_ca_topic_score_gemma":0.000072651834,"teacher_disagreement_score":0.25799683,"about_ca_system_score_codex":0.000036876678,"about_ca_system_score_gemma":0.00045611509,"threshold_uncertainty_score":0.273213},"labels":[],"label_agreement":null},{"id":"W4241961027","doi":"10.23952/jano.1.2019.2.05","title":"Polyak’s gradient method for solving the split convex feasibility problem and its applications","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Trường Đại học Giao thông vận tải","keywords":"Regular polygon; Mathematical optimization; Gradient method; Convex optimization; Mathematics; Computer science; Geometry","score_opus":0.0126004153318758,"score_gpt":0.2634251402608905,"score_spread":0.2508247249290147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241961027","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028138977,0.00012735395,0.99574226,0.0028344786,0.000041221287,0.0005025269,0.0000022394038,0.0000133426565,0.00045517876],"genre_scores_gemma":[0.23645563,0.00009890463,0.76276684,0.00051851256,0.00006031286,0.000029191744,0.0000044712565,0.0000068397817,0.000059287082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990921,0.000030790376,0.00036744133,0.00020455469,0.00019063728,0.00011450219],"domain_scores_gemma":[0.9988597,0.00029278567,0.00036664298,0.00012996684,0.0002601059,0.0000907965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006016988,0.00009459354,0.00021187372,0.000077789504,0.0001656795,0.00013775515,0.00020428862,0.00004472849,0.000016290998],"category_scores_gemma":[0.000028731552,0.00006305948,0.0000634852,0.00030106053,0.00001580833,0.00025178885,0.00006321646,0.00009506033,0.0000016245157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056507113,0.00009563289,0.00017090024,0.000037353704,0.00006736328,1.121925e-7,0.00041134356,0.5140567,0.00040517462,0.47487292,0.000067539215,0.009758458],"study_design_scores_gemma":[0.00047638864,0.00006992956,0.00033120732,0.0000053954977,0.00004089159,0.000010710301,0.00004284313,0.9894356,0.00009296561,0.008463542,0.0009468114,0.00008370138],"about_ca_topic_score_codex":0.0000014450649,"about_ca_topic_score_gemma":1.0426602e-7,"teacher_disagreement_score":0.4753789,"about_ca_system_score_codex":0.000028442322,"about_ca_system_score_gemma":0.000045684024,"threshold_uncertainty_score":0.2571491},"labels":[],"label_agreement":null},{"id":"W4242215349","doi":"10.1002/oca.2521","title":"Issue Information","year":2020,"lang":"en","type":"paratext","venue":"Optimal Control Applications and Methods","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto","funders":"","keywords":"Computer science","score_opus":0.011098627740902431,"score_gpt":0.3257696566684293,"score_spread":0.31467102892752685,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242215349","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[4.4726278e-8,0.000720205,0.9426653,0.0054732626,0.000241222,0.0005109073,0.000095306335,0.00007146271,0.050222293],"genre_scores_gemma":[0.0000798542,0.0006166427,0.9780326,0.0037262153,0.000319554,0.00060954824,0.0003721998,0.00001146131,0.016231949],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986166,0.000189141,0.00044245276,0.00038349174,0.00019107186,0.00017727366],"domain_scores_gemma":[0.9985737,0.00021563118,0.00031801383,0.0004276378,0.00028254924,0.00018244822],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040189893,0.00023350651,0.0004089296,0.00019740767,0.00023076801,0.00046760857,0.0005586025,0.0001982222,0.0006445405],"category_scores_gemma":[0.000046154328,0.00021749205,0.00011910941,0.0006196722,0.000034704637,0.0006498796,0.00015433657,0.00023625538,0.003527381],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002266449,0.00005730021,0.0000015000236,0.00012188387,0.00032036816,2.6267261e-7,0.0003433499,0.024077294,0.00009049017,0.18824068,0.18620414,0.6005201],"study_design_scores_gemma":[0.00023749653,0.000017567949,0.000009358315,0.0000033638619,0.00004817822,0.0000016152969,0.000008211515,0.33423713,0.000012545873,0.00016533026,0.66510135,0.00015787485],"about_ca_topic_score_codex":0.000015393458,"about_ca_topic_score_gemma":2.3765112e-7,"teacher_disagreement_score":0.6003622,"about_ca_system_score_codex":0.00002893992,"about_ca_system_score_gemma":0.00013284803,"threshold_uncertainty_score":0.9972485},"labels":[],"label_agreement":null},{"id":"W4242334047","doi":"10.3934/dcdss.201806i","title":"Preface","year":2018,"lang":"en","type":"article","venue":"Discrete and Continuous Dynamical Systems - S","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.005531944240292023,"score_gpt":0.22385969593736818,"score_spread":0.21832775169707616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242334047","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020224722,0.00014368717,0.968356,0.0009351649,0.00027128562,0.00012789672,0.0000063500647,0.00013910492,0.009795753],"genre_scores_gemma":[0.99335647,0.000008057441,0.0029357234,0.00016931952,0.0001239076,0.000009940792,0.000008230746,0.000005032957,0.0033833443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991105,0.00006311391,0.00019645783,0.00028526722,0.0001784224,0.00016619892],"domain_scores_gemma":[0.99944526,0.000033560078,0.0000682727,0.00023671285,0.0001143756,0.00010179714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013919082,0.000095408825,0.0001666496,0.000047463935,0.00013720964,0.00027472797,0.00026685992,0.00005334306,0.00001638398],"category_scores_gemma":[0.000022480017,0.000074288604,0.000044463457,0.00021757842,0.000054621378,0.0002285882,0.00011543171,0.000048594502,0.00003826742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009203034,0.000041861378,0.0040471926,0.00001952806,0.00009707214,0.0000051942757,0.0005204887,0.0002117576,0.00031394846,0.9874951,0.00081591133,0.006422731],"study_design_scores_gemma":[0.00019979419,0.00006930998,0.0031293726,0.000015295398,0.000013414049,0.0000110758965,0.000048132813,0.98939866,0.000010763551,0.00069170987,0.006262222,0.00015024928],"about_ca_topic_score_codex":0.00014448927,"about_ca_topic_score_gemma":0.00001706057,"teacher_disagreement_score":0.9891869,"about_ca_system_score_codex":0.000013995662,"about_ca_system_score_gemma":0.000012784436,"threshold_uncertainty_score":0.30294013},"labels":[],"label_agreement":null},{"id":"W4242461212","doi":"10.23952/asvao.3.2021.2.03","title":"Inertial extragradient methods for solving pseudomonotone variational inequalities with non-Lipschitz mappings and their optimization applications","year":2021,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational inequality; Lipschitz continuity; Inertial frame of reference; Applied mathematics; Inequality; Mathematics; Mathematical optimization; Mathematical analysis; Physics; Classical mechanics","score_opus":0.014756915171438865,"score_gpt":0.2714060946529657,"score_spread":0.2566491794815269,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242461212","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016718956,0.00015345523,0.997992,0.0007713426,0.00003106955,0.00050573715,0.000030532523,0.00009910246,0.0002495868],"genre_scores_gemma":[0.061666932,0.00022559548,0.9357214,0.000447148,0.000084345644,0.00043165826,0.0012756948,0.000023473676,0.00012377389],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978284,0.00014744453,0.0006127359,0.00087326067,0.00025510404,0.00028302666],"domain_scores_gemma":[0.9979728,0.00037723774,0.00039653157,0.00042641113,0.0006658884,0.00016116422],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008959961,0.000317987,0.00054138777,0.00055840745,0.0006509313,0.0005728193,0.0002281292,0.00013461016,0.000052768966],"category_scores_gemma":[0.00006842039,0.0002737446,0.00014449602,0.0026975658,0.00007002201,0.00049168715,0.00015077784,0.00010798029,6.489489e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024868237,0.00007364159,0.00009749592,0.000025236186,0.00073773356,2.1265414e-7,0.0010786064,0.9036551,0.00031176105,0.08976979,0.000009592311,0.004215947],"study_design_scores_gemma":[0.0008405287,0.00003357606,0.00024260688,0.000008378193,0.0005715506,0.000005421789,0.00040388247,0.99535215,0.00052140537,0.0015122761,0.00014954698,0.00035865017],"about_ca_topic_score_codex":0.000033222506,"about_ca_topic_score_gemma":0.000018853529,"teacher_disagreement_score":0.09169706,"about_ca_system_score_codex":0.000053506137,"about_ca_system_score_gemma":0.00014068683,"threshold_uncertainty_score":0.99997145},"labels":[],"label_agreement":null},{"id":"W4242621872","doi":"10.23952/jnva.5.2021.2.06","title":"Vector parametric quasi-equilibrium problems for the sum of two set-valued mappings","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Parametric statistics; Set (abstract data type); Mathematics; Applied mathematics; Mathematical economics; Mathematical optimization; Pure mathematics; Discrete mathematics; Computer science; Statistics","score_opus":0.026787738971256213,"score_gpt":0.2849981124882885,"score_spread":0.2582103735170323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242621872","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004602523,0.0005347674,0.98755133,0.007020862,0.00013659064,0.00007129029,0.00004379975,0.000006843454,0.00003201789],"genre_scores_gemma":[0.55082065,0.00019841433,0.4473043,0.00063868926,0.00044196015,0.0000071135964,0.0000806313,0.000010479162,0.00049774226],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998197,0.00012351506,0.0007594182,0.00020552355,0.00057942467,0.00013511925],"domain_scores_gemma":[0.99616814,0.0009009736,0.0007870508,0.00022091514,0.0018360538,0.000086877924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010892462,0.00011682123,0.00042473755,0.0005591973,0.00013726985,0.00015056618,0.00037577638,0.000047528563,0.000085284286],"category_scores_gemma":[0.000514468,0.00007998785,0.0005419632,0.003554489,0.00004139757,0.00036344168,0.00008483712,0.00011321321,0.000001266862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006645746,0.00092473096,0.015364986,0.00008436241,0.011641009,0.000007870569,0.0012081453,0.7759562,0.0011957503,0.19051889,0.0007201956,0.0023114083],"study_design_scores_gemma":[0.00064409163,0.00006991422,0.0142695205,0.00000822865,0.0013614306,0.000017251394,0.000046823596,0.97895837,0.00012461682,0.003101163,0.0013030424,0.000095557065],"about_ca_topic_score_codex":0.000034970246,"about_ca_topic_score_gemma":0.000015903746,"teacher_disagreement_score":0.54621816,"about_ca_system_score_codex":0.000029632516,"about_ca_system_score_gemma":0.00029694554,"threshold_uncertainty_score":0.326181},"labels":[],"label_agreement":null},{"id":"W4242634466","doi":"10.23952/asvao.2.2020.3.03","title":"Iterative algorithms for a multiple-sets split feasibility problem in Banach spaces","year":2020,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Banach space; Algorithm; Mathematics; Computer science; Mathematical optimization; Discrete mathematics","score_opus":0.03398784690827482,"score_gpt":0.2788297761288325,"score_spread":0.24484192922055764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4242634466","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013390897,0.000041966647,0.9952394,0.0023604534,0.000014651586,0.0006242434,0.0000376141,0.00008378221,0.00025879705],"genre_scores_gemma":[0.3793037,0.0000306206,0.6194837,0.00063681573,0.000027977801,0.00008723264,0.0003941156,0.00000938089,0.000026480466],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799526,0.000099100085,0.0005236448,0.0008351195,0.00030274907,0.00024411482],"domain_scores_gemma":[0.9989386,0.0001528541,0.00024685668,0.00027007877,0.00022706286,0.00016450314],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044736709,0.00022872532,0.00048334125,0.00037921476,0.00020126326,0.00037866132,0.00029443158,0.00010292115,0.000046354402],"category_scores_gemma":[0.00009803107,0.00021078993,0.0001685138,0.0032450461,0.00003432732,0.0004180731,0.00011085007,0.00009936173,0.0000034306013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003505411,0.000072082476,0.00473092,0.000021133455,0.00028476154,5.573545e-7,0.0017316301,0.97283536,0.000030362518,0.01867462,0.00004165351,0.0015418876],"study_design_scores_gemma":[0.0010191686,0.00004052942,0.0025069853,0.000003803222,0.00026819084,2.0997055e-7,0.00014520253,0.99489796,0.000060158996,0.000757651,0.000055661138,0.00024447235],"about_ca_topic_score_codex":0.000059473343,"about_ca_topic_score_gemma":0.00006191281,"teacher_disagreement_score":0.37796462,"about_ca_system_score_codex":0.000057644444,"about_ca_system_score_gemma":0.000051775634,"threshold_uncertainty_score":0.8595764},"labels":[],"label_agreement":null},{"id":"W4243059100","doi":"10.23952/jano.3.2021.1.11","title":"A weak convergence theorem for relatively nonexpansive mappings and maximal monotone operators in a Banach space","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Banach space; Mathematics; Monotone polygon; Convergence (economics); Pure mathematics; Eberlein–Šmulian theorem; Discrete mathematics; Weak convergence; Lp space; Computer science; Economics","score_opus":0.007997638099171155,"score_gpt":0.22280181065011306,"score_spread":0.21480417255094192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243059100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035104235,0.0001251284,0.99306995,0.0026609737,0.000047991845,0.00010585741,0.0000018505706,0.000007453044,0.00047036677],"genre_scores_gemma":[0.542263,0.0002923759,0.45702893,0.00032193155,0.000029075885,0.000006704347,0.000004243406,0.0000060788107,0.000047672973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991028,0.00003892702,0.00036086375,0.00020978661,0.00017083352,0.000116817246],"domain_scores_gemma":[0.999126,0.00013121859,0.0002447279,0.00007322741,0.0003279643,0.00009685437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025015464,0.00010208723,0.00025496012,0.00014078677,0.000082727536,0.00010440173,0.000106323176,0.00005900164,0.000020783613],"category_scores_gemma":[0.00008791127,0.00008837174,0.00004615616,0.0005483485,0.000031022504,0.00037166235,0.000058912232,0.000108072425,5.542161e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014043832,0.00011623191,0.00066716026,0.000016940316,0.0000700072,0.000008356053,0.0014553225,0.66602594,0.0007355061,0.3288633,0.000080690836,0.0018201488],"study_design_scores_gemma":[0.00094201905,0.00007431685,0.0013646048,0.000017312039,0.000023406139,0.000020406285,0.000282677,0.9920528,0.000468811,0.004333699,0.00029874346,0.000121236946],"about_ca_topic_score_codex":0.0000030161448,"about_ca_topic_score_gemma":3.8170882e-7,"teacher_disagreement_score":0.53875256,"about_ca_system_score_codex":0.000031465588,"about_ca_system_score_gemma":0.00009455317,"threshold_uncertainty_score":0.36036947},"labels":[],"label_agreement":null},{"id":"W4243291509","doi":"10.23952/jnva.5.2021.6.05","title":"A set scalarization function and Dini directional derivatives with applications in set optimization problems","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Science and Technology, Taiwan; National Natural Science Foundation of China","keywords":"Set (abstract data type); Function (biology); Set function; Mathematics; Computer science; Mathematical optimization; Programming language; Biology","score_opus":0.01226159257476904,"score_gpt":0.24068866769960356,"score_spread":0.2284270751248345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243291509","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061436812,0.00016840009,0.9916452,0.0018391294,0.000027029204,0.00007286254,0.000020147441,0.000012850695,0.0000706585],"genre_scores_gemma":[0.5604628,0.0003277777,0.43821278,0.0002502652,0.00014583266,0.000015388088,0.0004413254,0.000009870331,0.00013397001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853927,0.00013564574,0.00051618664,0.00027949,0.0004237635,0.00010564146],"domain_scores_gemma":[0.9982004,0.00019683903,0.0004318108,0.000119989934,0.0009570444,0.00009388928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040249864,0.00013030788,0.00029801903,0.0007042158,0.00017437898,0.00021171247,0.00010828919,0.0000667573,0.00006606332],"category_scores_gemma":[0.00008612057,0.00010600168,0.000095907875,0.0031523355,0.00003102115,0.0008545865,0.000052679225,0.00012893637,5.494742e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022738323,0.00014553375,0.11648644,0.000012523009,0.0008007529,0.0000022104855,0.0004015984,0.8565326,0.000070089016,0.025225583,0.0000073849524,0.0002925566],"study_design_scores_gemma":[0.0005371794,0.000051594383,0.18281305,0.000012776082,0.00043049396,0.000027239375,0.00011090276,0.8135617,0.000017710025,0.0021323545,0.00018823262,0.000116783514],"about_ca_topic_score_codex":0.00001629877,"about_ca_topic_score_gemma":0.00005205011,"teacher_disagreement_score":0.5543191,"about_ca_system_score_codex":0.00004415242,"about_ca_system_score_gemma":0.00018955574,"threshold_uncertainty_score":0.4322623},"labels":[],"label_agreement":null},{"id":"W4243607091","doi":"10.23952/jnva.4.2020.2.07","title":"On diametrically maximal sets, maximal premonotone operators and premonotone bifunctions","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Computer science","score_opus":0.015890769010368646,"score_gpt":0.24413468331069033,"score_spread":0.22824391430032168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243607091","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03244542,0.00013286607,0.9525981,0.014442666,0.000067816894,0.00007642842,0.000040212635,0.000023980368,0.00017251873],"genre_scores_gemma":[0.74010277,0.00023811444,0.25662524,0.0026179948,0.0002794436,0.0000027627616,0.000037601447,0.000011198632,0.00008488194],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981297,0.000120530996,0.0006457407,0.0003325759,0.00061935396,0.0001520473],"domain_scores_gemma":[0.9982437,0.0003227955,0.00040902247,0.00014678697,0.00054301997,0.00033465613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042841132,0.00017554515,0.00044698417,0.00076600624,0.00020385762,0.00027444577,0.00028482816,0.00008052008,0.00016261506],"category_scores_gemma":[0.00041655567,0.00014065286,0.00027104083,0.0027442288,0.000034672586,0.0005883516,0.00011525411,0.00023117854,0.000008461556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00077624776,0.0019146991,0.082595155,0.00006354205,0.015025527,0.00009537689,0.0023926487,0.609329,0.0008845321,0.26476708,0.0020156219,0.020140596],"study_design_scores_gemma":[0.0006383577,0.00028642363,0.07381972,0.000004927212,0.00075974,0.000018725666,0.00002001041,0.92238367,0.00002521589,0.001221577,0.0006578825,0.0001637506],"about_ca_topic_score_codex":0.000014950594,"about_ca_topic_score_gemma":0.0000030076203,"teacher_disagreement_score":0.70765734,"about_ca_system_score_codex":0.0000450935,"about_ca_system_score_gemma":0.00013515126,"threshold_uncertainty_score":0.5735657},"labels":[],"label_agreement":null},{"id":"W4243950804","doi":"10.23952/jnva.5.2021.2.02","title":"A new iterative algorithm for split feasibility and fixed point problems","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fixed point; Algorithm; Computer science; Iterative method; Point (geometry); Iterative closest point; Mathematics; Artificial intelligence; Point cloud; Geometry; Mathematical analysis","score_opus":0.02205137104709491,"score_gpt":0.2760393804290054,"score_spread":0.25398800938191046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243950804","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008048298,0.00040309425,0.99339664,0.0051887953,0.00005547434,0.000063225074,0.000041955467,0.0000069212483,0.00003905504],"genre_scores_gemma":[0.010034793,0.00013574748,0.9886068,0.00039862905,0.00023727077,0.0000019378435,0.000057990164,0.000004073749,0.00052274717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867743,0.000090586735,0.0005308326,0.000261087,0.00033080962,0.00010922543],"domain_scores_gemma":[0.9978226,0.0002812805,0.00037481176,0.00013533408,0.0012157508,0.00017025498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000599762,0.00011324163,0.0003659823,0.00029604344,0.00013823438,0.0002730127,0.00014141883,0.00005194424,0.000106244726],"category_scores_gemma":[0.00018881258,0.00009213769,0.00028923442,0.0011027015,0.000014319329,0.00054227014,0.0000727542,0.00009322352,8.221006e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023087884,0.0025146566,0.06615389,0.00017900199,0.031461347,0.00008642452,0.00834979,0.15771966,0.001094683,0.4602807,0.0031515858,0.2687774],"study_design_scores_gemma":[0.00081207673,0.00007042401,0.023421971,0.000007921684,0.00069777697,0.00003728349,0.000029726005,0.9623927,0.000040000323,0.011454027,0.0009254438,0.00011068104],"about_ca_topic_score_codex":0.000017649956,"about_ca_topic_score_gemma":0.000022488628,"teacher_disagreement_score":0.804673,"about_ca_system_score_codex":0.000040124436,"about_ca_system_score_gemma":0.00031032623,"threshold_uncertainty_score":0.3757266},"labels":[],"label_agreement":null},{"id":"W4244074079","doi":"10.23952/jano.1.2019.3.10","title":"The subgradient extragradient method for solving mixed equilibrium problems and fixed point problems in Hilbert spaces","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subgradient method; Hilbert space; Fixed point; Mathematics; Applied mathematics; Mathematical economics; Mathematical optimization; Pure mathematics; Mathematical analysis","score_opus":0.009534542447006081,"score_gpt":0.22696353117353757,"score_spread":0.2174289887265315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244074079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028467365,0.000268988,0.9926208,0.0035443408,0.0001404442,0.00036759663,7.1844045e-7,0.000011179811,0.00019919948],"genre_scores_gemma":[0.4159025,0.00029470676,0.58342427,0.00021872041,0.000049827286,0.000024304536,0.000004715632,0.000012398071,0.00006857218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878967,0.000047459696,0.0005122754,0.000226304,0.00023040574,0.00019388096],"domain_scores_gemma":[0.9988276,0.0003666936,0.000429703,0.00011880472,0.0001581904,0.000099012286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092090206,0.00012479321,0.00026594984,0.00014862187,0.0001075898,0.00027246415,0.0002007573,0.00005208435,0.000005687141],"category_scores_gemma":[0.00004980001,0.00008201678,0.00006685703,0.00036586446,0.000022740902,0.00034318297,0.000074992706,0.000112574024,5.437794e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040542305,0.00006301217,0.0003301791,0.00002504204,0.000035004963,2.7108632e-7,0.0008610509,0.9660236,0.0004992164,0.02673451,0.000053865937,0.0053337105],"study_design_scores_gemma":[0.0008102619,0.00015683363,0.0006637466,0.000024520612,0.000019954912,0.0000117621075,0.00007036648,0.9927315,0.00010242737,0.004156788,0.0011391749,0.000112668065],"about_ca_topic_score_codex":0.00000787503,"about_ca_topic_score_gemma":0.0000024965598,"teacher_disagreement_score":0.41305578,"about_ca_system_score_codex":0.000041417912,"about_ca_system_score_gemma":0.000036326783,"threshold_uncertainty_score":0.33445472},"labels":[],"label_agreement":null},{"id":"W4244767152","doi":"10.23952/jnva.5.2021.1.02","title":"Approximation of fixed points for a semigroup of Bregman quasi-nonexpansive mappings in Banach spaces","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Banach space; Fixed point; Semigroup; Mathematics; Pure mathematics; Mathematical analysis","score_opus":0.012188545239275829,"score_gpt":0.2555643003137102,"score_spread":0.24337575507443437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244767152","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031920385,0.00014873293,0.96479905,0.002938799,0.000038870432,0.000056536264,0.000043942397,0.0000030192011,0.000050680355],"genre_scores_gemma":[0.47480413,0.000088782435,0.5247035,0.00013377168,0.000072774725,0.0000025555748,0.00009771187,0.000004423271,0.00009234322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830896,0.00011141352,0.0008661768,0.00017938165,0.00043782237,0.00009626552],"domain_scores_gemma":[0.9967685,0.00037476685,0.0009758915,0.00013791205,0.0016850369,0.000057945606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000783807,0.000097987686,0.0005113244,0.0008011964,0.000043724547,0.00004828356,0.00019752834,0.00006301937,0.00004660656],"category_scores_gemma":[0.0003454474,0.00008703093,0.00031723894,0.0019826104,0.000021749684,0.00042072585,0.000049124374,0.00007850549,3.3784883e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004013973,0.00408387,0.12019754,0.0005348763,0.012530141,0.0000257443,0.009174608,0.38831827,0.01058381,0.4456273,0.00041144283,0.008110986],"study_design_scores_gemma":[0.0008243979,0.00008203714,0.038163334,0.000029362098,0.000510996,0.0000096232725,0.00018307813,0.9556967,0.0005725784,0.0037169273,0.00011779538,0.000093162635],"about_ca_topic_score_codex":0.000052757154,"about_ca_topic_score_gemma":0.00005608779,"teacher_disagreement_score":0.56737846,"about_ca_system_score_codex":0.00003130777,"about_ca_system_score_gemma":0.0002094067,"threshold_uncertainty_score":0.35490182},"labels":[],"label_agreement":null},{"id":"W4245074662","doi":"10.23952/jano.2.2020.2.08","title":"The effect of deterministic noise on a quasi-subgradient method for quasi-convex feasibility problems","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Education of Guangdong Province; Natural Science Foundation of Guangdong Province; Natural Science Foundation of Chongqing; Chongqing University; Shenzhen University; National Natural Science Foundation of China","keywords":"Subgradient method; Mathematical optimization; Regular polygon; Noise (video); Mathematics; Convex optimization; Applied mathematics; Computer science; Artificial intelligence; Geometry","score_opus":0.015804789809167923,"score_gpt":0.2717489569966035,"score_spread":0.25594416718743557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245074662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005152154,0.000035037534,0.9963451,0.0026185657,0.00006459516,0.00031050039,0.0000024783456,0.000011663861,0.00009682645],"genre_scores_gemma":[0.68056977,0.00003773346,0.3189271,0.00036679336,0.00006763263,0.000014956262,0.0000030751742,0.000007798699,0.0000051282186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987513,0.00012283502,0.0005312389,0.00019532832,0.00028227226,0.00011701726],"domain_scores_gemma":[0.9980579,0.0009063235,0.0005849029,0.00012872364,0.00018443081,0.00013769064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075286435,0.00011939822,0.00035256622,0.000058206053,0.0001439544,0.00008558819,0.0002620996,0.00004579031,0.000004190196],"category_scores_gemma":[0.00029809022,0.00007202628,0.00014013903,0.00035055686,0.00003093298,0.00011075803,0.000038460737,0.0001029575,7.2706484e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006761312,0.00014092769,0.00011933218,0.000058770973,0.00007716975,5.753523e-7,0.00047819378,0.96056336,0.00019399733,0.0171068,0.000066665765,0.020518055],"study_design_scores_gemma":[0.0009432227,0.002203947,0.000120435936,0.000009975327,0.00006708558,0.000003085797,0.000011383401,0.9949875,0.0004923574,0.0008496872,0.00023357528,0.0000777644],"about_ca_topic_score_codex":0.0000011452419,"about_ca_topic_score_gemma":9.7715734e-8,"teacher_disagreement_score":0.68005455,"about_ca_system_score_codex":0.000026543601,"about_ca_system_score_gemma":0.00004113737,"threshold_uncertainty_score":0.29371467},"labels":[],"label_agreement":null},{"id":"W4245455937","doi":"10.23952/jnva.3.2019.3.07","title":"Second-order efficiency conditions for $C^{1,1}$-vector equilibrium problems in terms of contingent derivatives and applications","year":2019,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Foundation for Science and Technology Development","keywords":"Order (exchange); Applied mathematics; Mathematics; Mathematical economics; Mathematical optimization; Economics","score_opus":0.009296819087627091,"score_gpt":0.2574272875664262,"score_spread":0.2481304684787991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245455937","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049833957,0.000114099166,0.94835514,0.0011243491,0.000036828962,0.00024057666,0.00007658275,0.0000058090513,0.00021268887],"genre_scores_gemma":[0.9182422,0.000038657105,0.08132112,0.00011375822,0.000067624074,0.0000150981905,0.000050638006,0.0000046843043,0.0001461984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879414,0.00004873452,0.000627002,0.0001904433,0.00023628396,0.00010339233],"domain_scores_gemma":[0.9983751,0.00035343078,0.00056966476,0.00011802748,0.0005201759,0.0000635803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046818386,0.000094660856,0.00035405057,0.0006267767,0.00005281175,0.00006519471,0.00018500404,0.000045002842,0.000101641024],"category_scores_gemma":[0.000077768134,0.000078733974,0.00015276478,0.001319554,0.000031677355,0.00038179345,0.000050712704,0.00007214,9.450446e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045252928,0.001129363,0.2619292,0.00021374582,0.002909028,9.2129477e-7,0.0016291334,0.3397704,0.009247392,0.38190448,0.000050292983,0.0011707825],"study_design_scores_gemma":[0.00078386936,0.00009225958,0.17685457,0.000013883449,0.00024844456,0.000004770128,0.00003083868,0.8162597,0.000085892774,0.0050366097,0.00048311154,0.000106050604],"about_ca_topic_score_codex":0.0000063245197,"about_ca_topic_score_gemma":0.000016317172,"teacher_disagreement_score":0.86840826,"about_ca_system_score_codex":0.000019405377,"about_ca_system_score_gemma":0.00008081653,"threshold_uncertainty_score":0.32106784},"labels":[],"label_agreement":null},{"id":"W4246059835","doi":"10.23952/jano.1.2019.3.07","title":"Karush-Kuhn-Tucker optimality conditions and duality for set optimization problems with mixed constraints","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Duality (order theory); Set (abstract data type); Mathematical optimization; Mathematics; Computer science; Combinatorics","score_opus":0.010954508190814213,"score_gpt":0.2360023193427086,"score_spread":0.22504781115189437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246059835","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021548062,0.0000240472,0.9953325,0.0011219275,0.000080851365,0.00038927578,0.00002103764,0.000028952398,0.0008466031],"genre_scores_gemma":[0.44006518,0.0000548029,0.5594509,0.00028911026,0.000035281806,0.000012575809,0.00005664633,0.000010098672,0.000025385403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862814,0.000055010325,0.00053038786,0.00029711614,0.0003168481,0.00017248892],"domain_scores_gemma":[0.99843466,0.000179781,0.0005816247,0.00015209151,0.00048746757,0.00016437596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047928837,0.00016980614,0.0003616166,0.0001594709,0.00016511555,0.00021163806,0.00015946632,0.00009062275,0.000087658875],"category_scores_gemma":[0.000038783204,0.00013310413,0.000063474756,0.0003950393,0.0000916299,0.0006266314,0.000050733805,0.000120516794,0.0000016073709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084524385,0.000080615166,0.00033755787,0.000029422004,0.00008493578,5.66256e-7,0.00021472255,0.9638174,0.000055863973,0.03455364,0.00006746569,0.00067327893],"study_design_scores_gemma":[0.0016887576,0.00025168696,0.0009608305,0.000023062667,0.000078310186,0.00003926469,0.00008351979,0.9952216,0.00006528005,0.001213101,0.00018161676,0.00019292788],"about_ca_topic_score_codex":0.0000019001116,"about_ca_topic_score_gemma":2.3088413e-7,"teacher_disagreement_score":0.43791035,"about_ca_system_score_codex":0.000035376328,"about_ca_system_score_gemma":0.000097223005,"threshold_uncertainty_score":0.54278284},"labels":[],"label_agreement":null},{"id":"W4246143541","doi":"10.23952/asvao.1.2019.2.05","title":"A hybrid iterative algorithm for a split mixed equilibrium problem and a hierarchical fixed point problem","year":2019,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Algorithm; Mathematical optimization; Point (geometry); Fixed point; Iterative method; Mathematics; Computer science; Geometry; Mathematical analysis","score_opus":0.007793174115774819,"score_gpt":0.2260201948707992,"score_spread":0.21822702075502437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246143541","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017874072,0.000046872126,0.99548185,0.00085516763,0.000030033407,0.00089756324,0.000050811796,0.000107916516,0.000742407],"genre_scores_gemma":[0.1069094,0.000038301983,0.8913029,0.0004094363,0.000042562162,0.00017366043,0.0006832454,0.000020127667,0.00042039427],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767745,0.00010806577,0.0005788706,0.0009378027,0.00036557304,0.00033222247],"domain_scores_gemma":[0.998674,0.00016108289,0.00030484243,0.00037774435,0.00029895979,0.00018339658],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005757132,0.00029691248,0.00059609325,0.0005764813,0.0002229929,0.0005812456,0.00026832812,0.00010066781,0.000076857694],"category_scores_gemma":[0.00001964786,0.00026326312,0.00019295886,0.0014736508,0.000053398333,0.0005314646,0.00021368916,0.00012253865,0.000007037758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004347433,0.00013134516,0.00022656794,0.000054801665,0.0012703312,0.0000011347006,0.00094941846,0.8363319,0.0002726719,0.14310369,0.00013352347,0.017481137],"study_design_scores_gemma":[0.00113381,0.000090929076,0.00020565582,0.00001094607,0.0005242608,0.000003523246,0.000050491784,0.9921785,0.00018321356,0.0051770443,0.000105709056,0.00033592212],"about_ca_topic_score_codex":0.000020811165,"about_ca_topic_score_gemma":0.000004894663,"teacher_disagreement_score":0.1558466,"about_ca_system_score_codex":0.000034133485,"about_ca_system_score_gemma":0.00006624736,"threshold_uncertainty_score":0.99998194},"labels":[],"label_agreement":null},{"id":"W4246475766","doi":"10.23952/asvao.3.2021.1.05","title":"A shrinking projection algorithm for variational inequality problems with a Lipschitz monotone mapping and fixed point problems of relatively weak nonexpansive mappings","year":2021,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational inequality; Lipschitz continuity; Monotone polygon; Mathematics; Projection (relational algebra); Fixed point; Point (geometry); Applied mathematics; Pure mathematics; Mathematical analysis; Algorithm; Geometry","score_opus":0.017879765759530413,"score_gpt":0.23061761370927417,"score_spread":0.21273784794974376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246475766","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014371027,0.00006059036,0.9969437,0.00053904596,0.000020050702,0.0006701507,0.00003485904,0.000059928916,0.00023457764],"genre_scores_gemma":[0.13532268,0.00009265178,0.8634582,0.00013047495,0.0000339057,0.00019896479,0.00065036525,0.000016358905,0.00009638035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974943,0.00015525502,0.0008141784,0.0008259781,0.00048411638,0.00022618548],"domain_scores_gemma":[0.9975778,0.00017569766,0.0008090696,0.00030715784,0.0010368143,0.00009345445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000922024,0.00026009485,0.00060998695,0.00059799233,0.0003614249,0.0002744105,0.00015070324,0.00012782986,0.000023044922],"category_scores_gemma":[0.00007483771,0.00023213048,0.00014120391,0.003261467,0.000056609726,0.0005544087,0.00012927507,0.00012308694,4.3987563e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019396452,0.00012304354,0.0011497966,0.00008529711,0.0013164844,4.313285e-7,0.00310381,0.9441753,0.00047199122,0.045899197,0.0000066487173,0.003648581],"study_design_scores_gemma":[0.0011605407,0.00006235301,0.0036643334,0.000044223907,0.00056930765,0.000004865225,0.0004601814,0.9912126,0.00022053326,0.0022840505,0.000029841702,0.0002871414],"about_ca_topic_score_codex":0.00009521521,"about_ca_topic_score_gemma":0.0000402118,"teacher_disagreement_score":0.13388556,"about_ca_system_score_codex":0.000055489094,"about_ca_system_score_gemma":0.0001462778,"threshold_uncertainty_score":0.9466006},"labels":[],"label_agreement":null},{"id":"W4246531934","doi":"10.23952/asvao.1.2019.3.02","title":"On strictly minimal elements w.r.t. preorder relations in set-valued optimization","year":2019,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","keywords":"Preorder; Set (abstract data type); Mathematics; Combinatorics; Computer science; Discrete mathematics; Programming language","score_opus":0.009740946870787663,"score_gpt":0.24121427308308216,"score_spread":0.2314733262122945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246531934","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008079556,0.00003015454,0.9851514,0.00041432498,0.000082846665,0.00058786926,0.00002129718,0.00013546205,0.0054971036],"genre_scores_gemma":[0.60282326,0.00008420565,0.3943328,0.0007086786,0.00003254082,0.000069618836,0.0011187299,0.00002968409,0.00080047594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966393,0.00020210232,0.0009579061,0.0010427028,0.0007522756,0.00040570064],"domain_scores_gemma":[0.9982234,0.00016763358,0.0005054836,0.0006826003,0.00026054593,0.00016033069],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00069597544,0.00037221055,0.00057641556,0.0017111842,0.00028123695,0.0003933996,0.00045850212,0.0002178501,0.0010161491],"category_scores_gemma":[0.000084540174,0.0003686668,0.00018933445,0.0060119205,0.0000345192,0.00072509545,0.0001614666,0.00022134405,0.00008053066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032261978,0.0001338196,0.004754918,0.000007604875,0.00035568417,8.1528617e-7,0.0003626823,0.91983235,0.000014512543,0.07406056,0.000090339716,0.00035447642],"study_design_scores_gemma":[0.0013912886,0.00006724874,0.0039693266,0.000011610956,0.00038798116,5.797375e-7,0.00011234512,0.9929409,0.000024164072,0.0006432515,0.000044016135,0.00040728683],"about_ca_topic_score_codex":0.000061284896,"about_ca_topic_score_gemma":0.000030824704,"teacher_disagreement_score":0.5947437,"about_ca_system_score_codex":0.00015666719,"about_ca_system_score_gemma":0.00009779624,"threshold_uncertainty_score":0.99989706},"labels":[],"label_agreement":null},{"id":"W4246749527","doi":"10.23952/jnva.3.2019.2.09","title":"A projected subgradient-proximal method for split equality equilibrium problems of pseudomonotone bifunctions in Banach spaces","year":2019,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation; Alexander von Humboldt-Stiftung","keywords":"Subgradient method; Banach space; Mathematics; Mathematical optimization; Pure mathematics","score_opus":0.020800882971887587,"score_gpt":0.2945715622895525,"score_spread":0.2737706793176649,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246749527","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.061957363,0.00009679131,0.93552256,0.0019750998,0.000086693115,0.00022423244,0.000049461774,0.0000091128595,0.00007869156],"genre_scores_gemma":[0.38138273,0.000024870977,0.61814845,0.00008333049,0.000088331966,0.000009030719,0.00005628505,0.000006418737,0.00020055377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788684,0.00019401703,0.0009733612,0.00028620538,0.00048823003,0.0001713758],"domain_scores_gemma":[0.99732924,0.00046704084,0.00088371383,0.00020523502,0.0010253649,0.000089394256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017509969,0.00014059352,0.0005965541,0.0012140463,0.000052196694,0.000097739045,0.00030522092,0.000079287674,0.00008137373],"category_scores_gemma":[0.00019097033,0.000114104914,0.00042531622,0.0028636989,0.00002010491,0.0005911028,0.00007194054,0.00013207074,0.0000016132968],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031597397,0.0014554877,0.15982173,0.00020583523,0.0048722443,0.0000022030754,0.001910175,0.64337474,0.00479027,0.18178755,0.00006982288,0.0013939673],"study_design_scores_gemma":[0.0009779366,0.00016271688,0.05943329,0.000015680345,0.00053528923,0.0000064050337,0.000045107543,0.9358517,0.000091628186,0.0024919554,0.00026736697,0.00012094887],"about_ca_topic_score_codex":0.00018880873,"about_ca_topic_score_gemma":0.00007367514,"teacher_disagreement_score":0.31942537,"about_ca_system_score_codex":0.000053125033,"about_ca_system_score_gemma":0.00023041657,"threshold_uncertainty_score":0.4653063},"labels":[],"label_agreement":null},{"id":"W4247170081","doi":"10.23952/jano.2.2020.2.07","title":"Two inertial linesearch extragradient algorithms for the bilevel split pseudomonotone variational inequality with constraints","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai Municipal Education Commission; Ministry of Education of the People's Republic of China","keywords":"Variational inequality; Inertial frame of reference; Algorithm; Mathematics; Inequality; Applied mathematics; Computer science; Mathematical optimization; Mathematical analysis; Physics; Classical mechanics","score_opus":0.035579502305967216,"score_gpt":0.2832461937927081,"score_spread":0.2476666914867409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247170081","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017773648,0.000024844427,0.98840696,0.010977992,0.000055442208,0.00021807945,0.000008209723,0.000015192051,0.0001155294],"genre_scores_gemma":[0.37812048,0.000031265063,0.6205775,0.0009915848,0.00024511467,0.000012537479,0.000010617671,0.000006383982,0.00000447886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987163,0.00004258875,0.00046358234,0.00020467966,0.00043348063,0.00013935815],"domain_scores_gemma":[0.99852717,0.00035832365,0.00036330524,0.00009596754,0.00048565364,0.00016956423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047471945,0.000118097545,0.0002304778,0.00007382691,0.00017826875,0.0001600917,0.00027883195,0.000038600858,0.00004571428],"category_scores_gemma":[0.000101901256,0.00007050509,0.00006985434,0.0005305156,0.0000709669,0.00025537846,0.00005462255,0.00014611377,0.0000011061583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021979112,0.0000813742,0.00006780365,0.0000072058942,0.000100766396,0.0000012491383,0.00037184719,0.9067487,0.00008170942,0.080073304,0.000058961283,0.012187264],"study_design_scores_gemma":[0.0014624494,0.00018585278,0.00061265443,0.00000432081,0.00004905256,0.000014738691,0.000039610102,0.9964088,0.00005817085,0.00086096855,0.00020253802,0.00010080753],"about_ca_topic_score_codex":0.0000037935972,"about_ca_topic_score_gemma":1.4516078e-7,"teacher_disagreement_score":0.37794274,"about_ca_system_score_codex":0.000025144825,"about_ca_system_score_gemma":0.00015033607,"threshold_uncertainty_score":0.2875114},"labels":[],"label_agreement":null},{"id":"W4247419636","doi":"10.23952/asvao.1.2019.2.06","title":"An iterative algorithm for solving equilibrium problems, variational inequalities and fixed point problems of multivalued quasi-nonexpansive mappings","year":2019,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational inequality; Fixed point; Mathematics; Iterative method; Point (geometry); Mathematical optimization; Applied mathematics; Algorithm; Mathematical analysis; Geometry","score_opus":0.014072623930202524,"score_gpt":0.24462368243477822,"score_spread":0.2305510585045757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247419636","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032772573,0.000055038177,0.9953047,0.00023668389,0.000040533647,0.00079416146,0.00009283577,0.00006485834,0.00013391674],"genre_scores_gemma":[0.35878736,0.00003430782,0.63963723,0.00018903169,0.000036456437,0.000100970414,0.0010978247,0.000017364211,0.00009942695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973837,0.00017425718,0.000888637,0.00080822,0.00048038078,0.0002647764],"domain_scores_gemma":[0.9976226,0.00030014958,0.00073587464,0.00041069358,0.0008050378,0.00012565618],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011865147,0.0002926265,0.0006995564,0.00067188207,0.00020544711,0.00038294814,0.0002846541,0.00013626242,0.00008016024],"category_scores_gemma":[0.00006312349,0.00026763525,0.00016215959,0.001469211,0.000059593844,0.0010100023,0.00012532073,0.00009093442,0.0000016969457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014025216,0.00012878292,0.0006102466,0.00006864772,0.00067956705,9.372309e-8,0.004849129,0.9266941,0.0015586441,0.06369372,0.000010072186,0.0016929983],"study_design_scores_gemma":[0.0011015042,0.00013810597,0.00083368144,0.000021390479,0.00038585663,8.1275755e-7,0.0005541799,0.9933331,0.0002750742,0.00302052,0.000012398945,0.00032334993],"about_ca_topic_score_codex":0.00011765746,"about_ca_topic_score_gemma":0.0000122466,"teacher_disagreement_score":0.35566747,"about_ca_system_score_codex":0.000042261836,"about_ca_system_score_gemma":0.00008049285,"threshold_uncertainty_score":0.9999776},"labels":[],"label_agreement":null},{"id":"W4247835158","doi":"10.23952/jano.1.2019.1.06","title":"Karush-Kuhn-Tucker optimality conditions for nonsmooth multiobjective semidefinite and semi-infinite programming","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Semidefinite programming; Mathematical optimization; Mathematics; Semidefinite embedding; Computer science; Applied mathematics; Quadratically constrained quadratic program; Quadratic programming","score_opus":0.007635573047310998,"score_gpt":0.24028631975403486,"score_spread":0.23265074670672387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247835158","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024612143,0.00005393885,0.99546,0.00063981675,0.000090032605,0.00030047953,0.00000992432,0.00002826097,0.00095638674],"genre_scores_gemma":[0.42164314,0.000092086484,0.577723,0.00039434456,0.000056061657,0.00001536827,0.000023882689,0.000010170232,0.000041957428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988602,0.0000345365,0.00045370776,0.00024976127,0.0002380403,0.0001637876],"domain_scores_gemma":[0.99861366,0.00029445955,0.00046292486,0.0001209579,0.0003701383,0.00013789242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003610198,0.000142322,0.00030548123,0.00019159634,0.000164173,0.00019721614,0.00014000821,0.000080725826,0.000029576839],"category_scores_gemma":[0.00006110156,0.000121003126,0.00008882291,0.0003988309,0.000038406517,0.0005234993,0.00006128372,0.00013190879,0.0000031344418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012636214,0.00015623163,0.0008648433,0.000033612974,0.00014195248,8.5269164e-7,0.0006183857,0.9292493,0.00033265274,0.059194908,0.0000878864,0.00919303],"study_design_scores_gemma":[0.0010358742,0.00018655932,0.0015897856,0.000018975985,0.000067791436,0.000019345998,0.00008090743,0.99335986,0.000108804656,0.001907312,0.0014461606,0.00017859653],"about_ca_topic_score_codex":0.0000029048942,"about_ca_topic_score_gemma":1.8046232e-7,"teacher_disagreement_score":0.4191819,"about_ca_system_score_codex":0.000035706285,"about_ca_system_score_gemma":0.0000640975,"threshold_uncertainty_score":0.49343643},"labels":[],"label_agreement":null},{"id":"W4247884247","doi":"10.23952/jano.1.2019.3.01","title":"A special issue dedicated to Christiane Tammer","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"History","score_opus":0.004380773534918199,"score_gpt":0.21134893315077513,"score_spread":0.20696815961585693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247884247","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038144636,0.000010892668,0.9877159,0.003914264,0.00032043524,0.00009058681,6.6258053e-7,0.000015216133,0.007550588],"genre_scores_gemma":[0.20433861,0.00008388596,0.7889109,0.0034275749,0.0027097794,0.0000033092351,0.000009174419,0.000015218422,0.00050154136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990486,0.000019219879,0.00034888487,0.00016019403,0.0003092443,0.00011388386],"domain_scores_gemma":[0.99924237,0.000042182994,0.00024279846,0.000110710964,0.00018932353,0.00017261846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015412693,0.000090276626,0.00021931462,0.00019335459,0.000049672668,0.00011284439,0.00022678052,0.000048840273,0.00068743207],"category_scores_gemma":[0.000028566754,0.00007340963,0.000049154798,0.0006128884,0.000009704752,0.0002601492,0.00006095657,0.00010481587,0.000089775065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007321914,0.00008130423,0.00013628148,0.0000050410395,0.000041597705,0.0000024117803,0.0002706872,0.9679717,0.0001510836,0.011560811,0.008667862,0.011038012],"study_design_scores_gemma":[0.0007522447,0.00018302686,0.0006812206,0.000010857293,0.000029411,0.000017974351,0.00004349254,0.9410488,0.00014824969,0.00039263573,0.05652123,0.00017088247],"about_ca_topic_score_codex":0.0000028123252,"about_ca_topic_score_gemma":8.6750966e-8,"teacher_disagreement_score":0.20395716,"about_ca_system_score_codex":0.000026383641,"about_ca_system_score_gemma":0.000050105686,"threshold_uncertainty_score":0.7526899},"labels":[],"label_agreement":null},{"id":"W4247929423","doi":"10.23952/asvao.2.2020.2.09","title":"A shrinking projection algorithm for proximal split feasibility and fixed point problems","year":2020,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Lingnan Normal University; Natural Science Foundation of Guangdong Province","keywords":"Algorithm; Projection (relational algebra); Point (geometry); Mathematics; Computer science; Geometry","score_opus":0.028012023669525415,"score_gpt":0.2502730165565297,"score_spread":0.22226099288700432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247929423","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007298379,0.000057773108,0.9969122,0.0012035954,0.000019116724,0.0007805704,0.000016748314,0.00014311897,0.00013706188],"genre_scores_gemma":[0.15558748,0.00007459794,0.8432174,0.0005885325,0.000069122485,0.00012719714,0.000291879,0.0000135027685,0.000030295276],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981901,0.00006471784,0.00044219356,0.00080619217,0.00028376174,0.00021303659],"domain_scores_gemma":[0.9990693,0.00005685705,0.00025493384,0.00022638147,0.0002364196,0.000156134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004798182,0.00020825089,0.00038529918,0.0002691836,0.00035107904,0.00041176984,0.00017986352,0.00009739691,0.00002582245],"category_scores_gemma":[0.000050436352,0.00019180046,0.00013507737,0.0020371736,0.000037339552,0.0004383523,0.0001286704,0.000088931614,0.0000012759103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000351708,0.00009941048,0.0014751885,0.000071225324,0.0007005877,3.978402e-7,0.0018948169,0.9342358,0.00012546532,0.029651968,0.00004214508,0.031667814],"study_design_scores_gemma":[0.00073311036,0.000066293695,0.00087911513,0.000004054525,0.00051656604,9.4170196e-7,0.000088946756,0.9964981,0.00008163208,0.0008463425,0.00005556128,0.00022932322],"about_ca_topic_score_codex":0.000029906934,"about_ca_topic_score_gemma":0.000010574039,"teacher_disagreement_score":0.15485765,"about_ca_system_score_codex":0.000044628414,"about_ca_system_score_gemma":0.000044816472,"threshold_uncertainty_score":0.78213954},"labels":[],"label_agreement":null},{"id":"W4248042746","doi":"10.23952/jano.3.2021.2.07","title":"A posteriori error control for variational inequalities with linear constraints in an abstract framework","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"A priori and a posteriori; Variational inequality; Mathematics; Inequality; Control (management); Applied mathematics; Mathematical optimization; Computer science; Mathematical analysis; Artificial intelligence; Philosophy; Epistemology","score_opus":0.016380383272252816,"score_gpt":0.2677829618036052,"score_spread":0.2514025785313524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248042746","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015339941,0.000018757168,0.9966098,0.0015443463,0.000056538636,0.00008905384,0.000008601471,0.000009878502,0.00012903898],"genre_scores_gemma":[0.49882537,0.000008143523,0.5005609,0.00051582226,0.00006389698,0.000004165893,0.000013225717,0.0000043527125,0.000004170263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899924,0.000041467632,0.00043884484,0.00016729104,0.0002402988,0.00011284211],"domain_scores_gemma":[0.99870497,0.00030178265,0.00033268167,0.00008882942,0.00047550627,0.00009623734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033590558,0.00009687485,0.00025297044,0.00012261422,0.00006624996,0.00013124383,0.00012008421,0.000070616516,0.000063583444],"category_scores_gemma":[0.00010365315,0.00007834046,0.000043939664,0.0003226849,0.000028873348,0.00043915366,0.000015752434,0.00011943145,4.4150502e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018017391,0.00014638664,0.00041293865,0.000009230017,0.00004446633,0.000006214255,0.0004296563,0.8908691,0.0000835304,0.1061578,0.000004643393,0.0016558629],"study_design_scores_gemma":[0.0014349065,0.00015486323,0.0034230838,0.000024156387,0.000028113483,0.00002672157,0.00013551678,0.9899542,0.000038043097,0.0046170712,0.000045459663,0.00011790211],"about_ca_topic_score_codex":0.0000012856968,"about_ca_topic_score_gemma":7.104245e-7,"teacher_disagreement_score":0.49729136,"about_ca_system_score_codex":0.000027112956,"about_ca_system_score_gemma":0.00019540862,"threshold_uncertainty_score":0.31946313},"labels":[],"label_agreement":null},{"id":"W4248114642","doi":"10.23952/jano.2.2020.2.02","title":"Some new iterative algorithms for finding fixed points of nonexpansive mappings","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities","keywords":"Fixed point; Algorithm; Mathematics; Computer science; Discrete mathematics; Mathematical analysis","score_opus":0.023667283085235857,"score_gpt":0.2526007596630225,"score_spread":0.22893347657778662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248114642","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012672969,0.000045604258,0.9925922,0.0069715576,0.000059177553,0.00010725804,0.000003368001,0.000010366667,0.00008371943],"genre_scores_gemma":[0.07631706,0.00007404293,0.921782,0.0015460504,0.00024342624,0.0000022701565,0.000008999999,0.000007234885,0.00001890314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907243,0.00001735374,0.00044467687,0.00015320154,0.00021811677,0.00009423924],"domain_scores_gemma":[0.99885386,0.000116953175,0.00054296886,0.000055136512,0.00027617035,0.0001549095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012317915,0.000094949624,0.00028470185,0.000110970184,0.00006396351,0.00007151545,0.00017825096,0.000045840137,0.000018141169],"category_scores_gemma":[0.0000863358,0.000079791884,0.0000888572,0.00038805153,0.00001535326,0.00045304126,0.000044170392,0.00007617866,9.141048e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014100327,0.00005734387,0.000021955855,0.00002149742,0.000120700075,0.0000011940481,0.0029229356,0.93624836,0.0009543871,0.053196553,0.00075385626,0.005560227],"study_design_scores_gemma":[0.00093135005,0.00019446768,0.000054751126,0.000012254039,0.000035030214,0.0000029888295,0.00007087082,0.9941993,0.0011735468,0.0029165843,0.00031659484,0.000092303315],"about_ca_topic_score_codex":0.0000011279958,"about_ca_topic_score_gemma":1.1416753e-8,"teacher_disagreement_score":0.07619032,"about_ca_system_score_codex":0.000016879596,"about_ca_system_score_gemma":0.00007670519,"threshold_uncertainty_score":0.32538188},"labels":[],"label_agreement":null},{"id":"W4248519834","doi":"10.23952/jano.1.2019.3.09","title":"The role of nonlinear scalarization functions in characterizing generalized convex vector functions","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","keywords":"Nonlinear system; Mathematics; Regular polygon; Convex function; Vector-valued function; Applied mathematics; Pure mathematics; Physics; Geometry","score_opus":0.0045039012846747155,"score_gpt":0.1969571943526005,"score_spread":0.1924532930679258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248519834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010106138,0.000080695325,0.98758346,0.0010287906,0.00020147601,0.00011960608,0.0000024181606,0.000011883925,0.00086551014],"genre_scores_gemma":[0.91754013,0.00015208904,0.08191426,0.00017266476,0.00008987194,0.000005081877,0.000022401353,0.000008969851,0.00009455144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989763,0.000046382895,0.0005061405,0.00012880233,0.0002393123,0.000103045706],"domain_scores_gemma":[0.9990019,0.00011465182,0.00046082606,0.00012483676,0.00024089101,0.000056850997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028008854,0.00008399156,0.00021349397,0.00017248816,0.000108820226,0.00009076987,0.00016332473,0.00005399685,0.00004723102],"category_scores_gemma":[0.000035457768,0.000060746726,0.00006417117,0.00065272336,0.000022321163,0.00034138255,0.000041545078,0.00011854949,0.000005566516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011093802,0.00012680085,0.0027455748,0.0000062034674,0.00005911589,2.8134394e-7,0.00022301059,0.9500055,0.0065353727,0.034317248,0.000023645442,0.005846313],"study_design_scores_gemma":[0.00054363493,0.000060223076,0.0031633317,0.0000086658,0.000020680623,0.000004157452,0.0000820663,0.99367905,0.0003748862,0.0004149548,0.0015765692,0.00007181212],"about_ca_topic_score_codex":0.000004723816,"about_ca_topic_score_gemma":4.2374288e-7,"teacher_disagreement_score":0.907434,"about_ca_system_score_codex":0.00002924679,"about_ca_system_score_gemma":0.000063371255,"threshold_uncertainty_score":0.24771796},"labels":[],"label_agreement":null},{"id":"W4248792414","doi":"10.23952/jano.2.2020.3.07","title":"Strong convergence of a modified inertial forward-backward splitting algorithm for a inclusion problem","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Algorithm; Inertial frame of reference; Inclusion (mineral); Mathematics; Computer science; Mathematical optimization; Physics; Classical mechanics; Economics","score_opus":0.013296763590287608,"score_gpt":0.23489089749541092,"score_spread":0.2215941339051233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248792414","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024668782,0.000030760883,0.9974863,0.0018362765,0.000044977198,0.0001576896,0.0000037873585,0.000014876577,0.0001786603],"genre_scores_gemma":[0.34083357,0.0000319325,0.65875995,0.00027465893,0.00008196754,0.0000036024453,0.000005671661,0.0000054151724,0.0000032082903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987887,0.000023698643,0.00059089565,0.00017288545,0.00030983603,0.000113991984],"domain_scores_gemma":[0.99873024,0.00008429209,0.0006276934,0.00006564567,0.00035446123,0.0001376748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025678577,0.00010209453,0.00029736068,0.00009100914,0.00013236458,0.000045823617,0.00024176839,0.00005436781,0.000012297894],"category_scores_gemma":[0.000052606494,0.00008468142,0.000097418364,0.0004251903,0.00002056972,0.00030431236,0.00020498302,0.000086704764,3.38983e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089388384,0.000056765617,0.000015809052,0.000024963621,0.000047174228,4.979691e-7,0.0007943777,0.9549199,0.0006163318,0.01512082,0.000050384268,0.028263588],"study_design_scores_gemma":[0.0008695071,0.00020499867,0.0000174518,0.00001140486,0.00004014551,0.000002436805,0.000034814606,0.99681413,0.00072779675,0.0010506524,0.00013723152,0.00008943156],"about_ca_topic_score_codex":0.0000021970015,"about_ca_topic_score_gemma":3.0430897e-8,"teacher_disagreement_score":0.3405869,"about_ca_system_score_codex":0.00002134106,"about_ca_system_score_gemma":0.00007947263,"threshold_uncertainty_score":0.34532082},"labels":[],"label_agreement":null},{"id":"W4248891727","doi":"10.1080/00036811.2014.890710","title":"Differential stability of convex optimization problems under inclusion constraints","year":2014,"lang":"en","type":"article","venue":"Applicable Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Windsor","keywords":"Subderivative; Mathematics; Convexity; Differential inclusion; Parametric statistics; Mathematical optimization; Function (biology); Nonlinear programming; Parametric programming; Convex analysis; Stability (learning theory); Convex optimization; Regular polygon; Nonlinear system; Computer science","score_opus":0.010897260215920003,"score_gpt":0.22235635854690458,"score_spread":0.21145909833098459,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248891727","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054679085,0.0000073799515,0.9921348,0.0005325231,0.000020384621,0.00012366162,0.0000055821656,0.00006640615,0.0016413679],"genre_scores_gemma":[0.93547636,0.0000124967255,0.064166665,0.00016906923,0.000017581735,0.000017482673,0.000083133236,0.000004969663,0.000052242358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983779,0.0001303411,0.00045221005,0.00042917763,0.00044153328,0.00016880396],"domain_scores_gemma":[0.99860245,0.00013267586,0.00027571042,0.00058304396,0.00031514483,0.000090977126],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003866416,0.00013134044,0.00040048698,0.00030371416,0.00022918689,0.00006884978,0.00050921453,0.00007668023,0.0013876442],"category_scores_gemma":[0.00003500943,0.00011694546,0.00023638495,0.0024246562,0.00009284982,0.00023350275,0.000504135,0.00006426602,0.0000112314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029112618,0.0001604611,0.0039214767,0.000013716677,0.00046515535,5.3985566e-8,0.00015995665,0.9068505,0.0009179172,0.08594571,0.0000157293,0.0015464104],"study_design_scores_gemma":[0.00024398215,0.000018017092,0.0013779134,0.000002578217,0.00038202674,1.8988166e-7,0.0000147205055,0.9926788,0.0014054776,0.003682515,0.0000676357,0.00012611796],"about_ca_topic_score_codex":0.00013192464,"about_ca_topic_score_gemma":0.00002799287,"teacher_disagreement_score":0.9300085,"about_ca_system_score_codex":0.00003615653,"about_ca_system_score_gemma":0.000037743295,"threshold_uncertainty_score":0.99952525},"labels":[],"label_agreement":null},{"id":"W4249176407","doi":"10.23952/jnva.4.2020.3.01","title":"Karush-Kuhn-Tucker optimality conditions and duality for semi-infinite programming problems with vanishing constraints","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Duality (order theory); Mathematics; Mathematical optimization; Mathematical economics; Applied mathematics; Pure mathematics","score_opus":0.025710718106543774,"score_gpt":0.27132379862349987,"score_spread":0.2456130805169561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249176407","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005876146,0.000054797067,0.98439986,0.009318549,0.000022316766,0.00013087282,0.000105184954,0.000019767,0.00007250545],"genre_scores_gemma":[0.49706054,0.000031175754,0.50181663,0.0008177275,0.00015765117,0.0000059503336,0.00008717268,0.0000058810842,0.00001725747],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99842,0.00009323729,0.0006140375,0.00028486972,0.00043533623,0.00015254522],"domain_scores_gemma":[0.9978022,0.00035575978,0.0006090526,0.00010109534,0.0008921261,0.0002397558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007801565,0.00014694872,0.00041388662,0.0002303681,0.00026100516,0.00035955547,0.00019084969,0.000058959213,0.000053174503],"category_scores_gemma":[0.00022347343,0.000114147486,0.00020727846,0.0010994648,0.00007773735,0.0007410101,0.000060862956,0.00014934258,8.1320104e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030166932,0.0009169238,0.13265805,0.00027772493,0.016617222,0.000034475033,0.0059483037,0.555445,0.00048798925,0.27704546,0.00031822835,0.009948956],"study_design_scores_gemma":[0.00096746004,0.00019785852,0.027475147,0.000016011474,0.0013112662,0.000034777862,0.00009140148,0.9671439,0.000015567792,0.0013930324,0.0011664523,0.00018710612],"about_ca_topic_score_codex":0.0000112694825,"about_ca_topic_score_gemma":0.0000123961645,"teacher_disagreement_score":0.49118438,"about_ca_system_score_codex":0.000022506103,"about_ca_system_score_gemma":0.00016864119,"threshold_uncertainty_score":0.4654799},"labels":[],"label_agreement":null},{"id":"W4249578171","doi":"10.23952/jnva.4.2020.3.03","title":"A parallel iterative method for solving a class of variational inequalities in Hilbert spaces","year":2020,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Thai Nguyen University of Technology","keywords":"Variational inequality; Hilbert space; Class (philosophy); Inequality; Mathematics; Applied mathematics; Iterative method; Algebra over a field; Pure mathematics; Calculus (dental); Mathematical analysis; Computer science; Mathematical optimization; Artificial intelligence; Medicine","score_opus":0.03440370804728949,"score_gpt":0.3068094632016179,"score_spread":0.2724057551543284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249578171","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00095121743,0.00009190934,0.98074037,0.017995259,0.000029403445,0.00006975537,0.000055275697,0.0000056123295,0.00006117735],"genre_scores_gemma":[0.15301125,0.00003659686,0.8456027,0.0010328591,0.00020263634,0.0000047673743,0.000045044922,0.0000049759165,0.000059203376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980679,0.00018453508,0.0009274261,0.00022072671,0.00047718766,0.00012218044],"domain_scores_gemma":[0.99689347,0.001134198,0.00084273034,0.000088283705,0.0009321017,0.00010921395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001201696,0.00013073288,0.0005562714,0.0006440175,0.00007354969,0.000120940385,0.00027773058,0.00006457651,0.00007010169],"category_scores_gemma":[0.00068703917,0.00010944001,0.0003540275,0.0016465163,0.000017979004,0.0006179142,0.00006533376,0.000118186115,6.050319e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014834286,0.00020788256,0.01214419,0.000039083065,0.0023899493,0.0000028079553,0.004595168,0.6177494,0.0002298815,0.3618651,0.00017277533,0.00045543996],"study_design_scores_gemma":[0.0008253919,0.00010443646,0.013391888,0.000010632763,0.00041206513,0.0000037071827,0.00012266192,0.97839725,0.000025625926,0.006102062,0.000492287,0.00011200261],"about_ca_topic_score_codex":0.000052733358,"about_ca_topic_score_gemma":0.000033932025,"teacher_disagreement_score":0.36064786,"about_ca_system_score_codex":0.00003404526,"about_ca_system_score_gemma":0.00023407876,"threshold_uncertainty_score":0.44628337},"labels":[],"label_agreement":null},{"id":"W4249757450","doi":"10.23952/jano.2.2020.3.03","title":"$L^\\infty$-stability for a class of parametric optimal control problems with mixed pointwise constraints","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Science and Technology, Taiwan; National Foundation for Science and Technology Development","keywords":"Pointwise; Class (philosophy); Stability (learning theory); Mathematics; Parametric statistics; Applied mathematics; Control (management); Mathematical optimization; Pure mathematics; Mathematical analysis; Computer science; Statistics; Artificial intelligence","score_opus":0.013711567518721511,"score_gpt":0.20823951385260372,"score_spread":0.1945279463338822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249757450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017150065,0.000026123294,0.9951262,0.0026246351,0.000027206741,0.00026986576,0.000008798137,0.00001563934,0.00018651137],"genre_scores_gemma":[0.62105674,0.000013048244,0.378592,0.00029728876,0.000026083013,0.0000054625157,0.000003636426,0.000004837796,9.05039e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873936,0.000040072977,0.00058399956,0.00020318279,0.00030412982,0.00012922344],"domain_scores_gemma":[0.9982688,0.00024825498,0.00068641314,0.00009393034,0.00051778933,0.00018482293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030912,0.00012264482,0.0004061579,0.00012603163,0.00005906455,0.00006928554,0.00020379477,0.000057520603,0.000028799843],"category_scores_gemma":[0.00014396041,0.000090489826,0.00009632407,0.0007391759,0.00008248294,0.00027088934,0.000027548882,0.000104299164,4.531064e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003590041,0.00012353837,0.00021399016,0.000033851116,0.00010129267,7.1202464e-7,0.00024536147,0.9859912,0.00017029239,0.010451044,0.000034519988,0.0022752178],"study_design_scores_gemma":[0.002387014,0.0005591419,0.0002574452,0.00000941468,0.00008502466,0.000008330513,0.00005736367,0.9958435,0.00030199363,0.00028406223,0.00009745669,0.000109233326],"about_ca_topic_score_codex":8.4045877e-7,"about_ca_topic_score_gemma":7.326542e-8,"teacher_disagreement_score":0.61934173,"about_ca_system_score_codex":0.000021348182,"about_ca_system_score_gemma":0.00011413055,"threshold_uncertainty_score":0.3690068},"labels":[],"label_agreement":null},{"id":"W4250090602","doi":"10.23952/jnva.3.2019.2.01","title":"Iterative methods for parallel convex optimization with fixed point constraints","year":2019,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Japan Society for the Promotion of Science","keywords":"Fixed point; Regular polygon; Mathematical optimization; Conic optimization; Convex optimization; Mathematics; Iterative method; Point (geometry); Computer science; Convex combination; Mathematical analysis; Geometry","score_opus":0.012411036119896674,"score_gpt":0.30032634823688686,"score_spread":0.2879153121169902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250090602","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039845196,0.000049172333,0.9970432,0.002112691,0.000069922455,0.00012648816,0.000019176938,0.000009953389,0.00017095347],"genre_scores_gemma":[0.031633705,0.000030190165,0.9674711,0.00046752556,0.00008500255,0.0000041771946,0.00006712349,0.000005841723,0.00023532144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863166,0.00015766,0.0005490058,0.00023267618,0.00030634043,0.00012265566],"domain_scores_gemma":[0.99721783,0.00054868276,0.00065233157,0.00014573363,0.0013279975,0.00010739876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008177247,0.00013591257,0.00045280985,0.0005359692,0.00010241609,0.0001870194,0.00022595303,0.000059351154,0.0003119318],"category_scores_gemma":[0.00011655628,0.00009773188,0.00026532653,0.0010758751,0.000033980257,0.0006794849,0.00003521535,0.00009700156,0.0000026470339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000868193,0.000109183726,0.0040170066,0.000009241477,0.002606667,0.0000010347444,0.0003286963,0.9553529,0.00005811852,0.035896312,0.000036207042,0.0014977859],"study_design_scores_gemma":[0.0011346152,0.00017703335,0.0037339805,0.000008550321,0.0007025374,0.000020128693,0.000055120177,0.9927642,0.000024055125,0.00094529905,0.00030106943,0.00013342613],"about_ca_topic_score_codex":0.000004652788,"about_ca_topic_score_gemma":0.0000021523595,"teacher_disagreement_score":0.037411258,"about_ca_system_score_codex":0.00003414552,"about_ca_system_score_gemma":0.00017341302,"threshold_uncertainty_score":0.39853904},"labels":[],"label_agreement":null},{"id":"W4250940015","doi":"10.23952/jnva.5.2021.2.07","title":"Modified inertial subgradient extragradient algorithms for pseudomonotone equilibrium problems with the constraint of nonexpansive mappings","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subgradient method; Inertial frame of reference; Algorithm; Constraint (computer-aided design); Mathematics; Computer science; Applied mathematics; Mathematical optimization; Physics; Geometry","score_opus":0.01917899913300497,"score_gpt":0.24717475634275868,"score_spread":0.2279957572097537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250940015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022972867,0.00018086098,0.9679527,0.008621315,0.000060511422,0.00011095044,0.000049239046,0.000005866861,0.00004566981],"genre_scores_gemma":[0.7166538,0.00006163879,0.28251305,0.0003685636,0.00019816105,0.000010007293,0.00006391313,0.0000071540885,0.00012368272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832135,0.00009381175,0.0006641716,0.00023481192,0.0005340366,0.00015179545],"domain_scores_gemma":[0.99650824,0.00033645594,0.0007623655,0.00018902852,0.0020981187,0.000105806685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063846464,0.00013914454,0.00044259144,0.00033537915,0.000117846605,0.00011670904,0.00028149335,0.000049408296,0.000025103327],"category_scores_gemma":[0.00009487596,0.0000867791,0.00037960522,0.001461729,0.00007464782,0.0002854445,0.0000627449,0.000115184754,2.9572735e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013346209,0.00061506557,0.0011823623,0.000042529937,0.0067188423,0.00001661882,0.002322599,0.8902878,0.0029774604,0.09361922,0.00013548353,0.0019485351],"study_design_scores_gemma":[0.0010820859,0.00016274468,0.004648281,0.000014820048,0.0011509073,0.00006065162,0.00012466486,0.9907595,0.00042190473,0.0009992851,0.0004503544,0.00012479119],"about_ca_topic_score_codex":0.000026301728,"about_ca_topic_score_gemma":0.000023681849,"teacher_disagreement_score":0.693681,"about_ca_system_score_codex":0.000033131306,"about_ca_system_score_gemma":0.00032122192,"threshold_uncertainty_score":0.35387492},"labels":[],"label_agreement":null},{"id":"W4251231634","doi":"10.1007/978-1-4757-9859-3_6","title":"Nonsmooth Optimization","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Simon Fraser University","funders":"","keywords":"Subderivative; Corollary; Differentiable function; Mathematics; Context (archaeology); Convex function; Pseudoconvex function; Regular polygon; Function (biology); Pure mathematics; Mathematical optimization; Calculus (dental); Mathematical economics; Applied mathematics; Convex optimization; Geometry","score_opus":0.011008353921017714,"score_gpt":0.20095240791942823,"score_spread":0.18994405399841052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251231634","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.3644686e-9,0.00002105156,0.49476966,0.00055737526,0.000044468827,0.000035724835,0.0000022584352,0.00010372207,0.50446576],"genre_scores_gemma":[0.000016440752,0.00026502475,0.23778465,0.00088556204,0.00006459923,0.0000019599709,0.000075868025,0.0000132838295,0.7608926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902755,0.0000076200936,0.00023420228,0.0003468897,0.00028460642,0.000099142584],"domain_scores_gemma":[0.99927443,0.000026526626,0.00010604264,0.00041393025,0.000111568086,0.00006748291],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000058136156,0.00017223376,0.00017626621,0.00022381374,0.00007789123,0.00015294884,0.00046491,0.0001571208,0.017238095],"category_scores_gemma":[0.0000037499115,0.00015598898,0.00012785947,0.00007899511,0.000014558387,0.00024952265,0.00007292247,0.00009798682,0.0010445843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.4466165e-7,0.0000050612907,2.59986e-7,0.0000010542093,0.000026580794,0.0000014637516,0.000008409234,0.19681709,3.9822634e-8,0.796316,0.0025774997,0.0042459574],"study_design_scores_gemma":[0.00007523046,0.000010016135,0.0000014322053,0.000009163132,0.000021207907,0.0000027717035,1.5313752e-7,0.7465927,9.4054843e-7,0.029689604,0.22338594,0.00021086115],"about_ca_topic_score_codex":0.0000055489386,"about_ca_topic_score_gemma":0.0000029829578,"teacher_disagreement_score":0.7666264,"about_ca_system_score_codex":0.000034295346,"about_ca_system_score_gemma":0.00007857328,"threshold_uncertainty_score":0.9997332},"labels":[],"label_agreement":null},{"id":"W4251591237","doi":"10.23952/jnva.3.2019.1.07","title":"Mean convergence theorems for new mappings in a Banach space","year":2019,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Banach space; Mathematics; Convergence (economics); Infinite-dimensional vector function; Eberlein–Šmulian theorem; Space (punctuation); Pure mathematics; Computer science; Lp space; Economics","score_opus":0.01011961937502782,"score_gpt":0.24595289811557125,"score_spread":0.23583327874054344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251591237","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011230765,0.000107743814,0.9827521,0.0055108946,0.000115993884,0.000079112346,0.000008216031,0.000006610548,0.00018857492],"genre_scores_gemma":[0.62069947,0.00009169773,0.3771503,0.0005191531,0.00022561762,0.000001603137,0.000023568406,0.0000061765213,0.001282393],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987082,0.0000564024,0.00051877846,0.00020848015,0.00037764688,0.00013051665],"domain_scores_gemma":[0.9985956,0.0002765648,0.0004266104,0.00014639786,0.0004393956,0.000115420284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080969854,0.00010627379,0.00035897398,0.00075004227,0.00004855823,0.000105669176,0.00032288794,0.0000536027,0.00021572434],"category_scores_gemma":[0.0001073664,0.00008617618,0.0002895899,0.0016570571,0.000010723964,0.0004993814,0.000047046622,0.00009952612,0.000008393594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083245395,0.00019823882,0.104414016,0.000019641113,0.0019393765,0.0000037043194,0.0012781285,0.21305168,0.00025930273,0.67718416,0.00039721423,0.001171276],"study_design_scores_gemma":[0.0007259683,0.00005755704,0.041032393,0.000008343974,0.00025295632,0.0000050383474,0.000041853582,0.94584495,0.000019373778,0.010046302,0.0018538663,0.00011138608],"about_ca_topic_score_codex":0.000081929946,"about_ca_topic_score_gemma":0.000046187277,"teacher_disagreement_score":0.7327933,"about_ca_system_score_codex":0.000041441017,"about_ca_system_score_gemma":0.00021138534,"threshold_uncertainty_score":0.35141626},"labels":[],"label_agreement":null},{"id":"W4251603288","doi":"10.23952/asvao.3.2021.1.10","title":"An inertial algorithm for approximating solutions of split feasibility problems in real Banach spaces","year":2021,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Inertial frame of reference; Banach space; Mathematics; Computer science; Mathematical optimization; Mathematical analysis; Physics; Classical mechanics","score_opus":0.029009633374744596,"score_gpt":0.27964110970318073,"score_spread":0.25063147632843613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251603288","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031865288,0.00004102807,0.99597013,0.0001906146,0.000019993693,0.00027534098,0.000030441266,0.000047282298,0.00023866844],"genre_scores_gemma":[0.2732389,0.00005241206,0.72589374,0.00005047715,0.000024712492,0.000047297883,0.0006622595,0.0000073666915,0.000022861972],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99810046,0.00013032371,0.00064465613,0.0006111425,0.00028763563,0.00022577138],"domain_scores_gemma":[0.9986978,0.000084252424,0.00031568174,0.00041468555,0.00039882952,0.000088747394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008531179,0.00015777591,0.00044479268,0.00042932344,0.00020825717,0.0001959745,0.0002185875,0.00010059573,0.000030604046],"category_scores_gemma":[0.000052159892,0.00015653572,0.00014200706,0.0030907406,0.00004020339,0.00039752357,0.0000898741,0.00007166187,3.4547162e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039938664,0.00018688115,0.0017498744,0.000020929583,0.00019191645,2.136886e-7,0.0005140432,0.94691426,0.00025706395,0.04539649,0.000003997571,0.004760373],"study_design_scores_gemma":[0.00055699353,0.000024425215,0.0027172128,0.000005601313,0.00032004592,4.687624e-7,0.00021440415,0.9946113,0.00017655238,0.0012010447,0.0000034916334,0.00016846324],"about_ca_topic_score_codex":0.0002454491,"about_ca_topic_score_gemma":0.00023293761,"teacher_disagreement_score":0.27007636,"about_ca_system_score_codex":0.000053416978,"about_ca_system_score_gemma":0.00010385478,"threshold_uncertainty_score":0.63833416},"labels":[],"label_agreement":null},{"id":"W4252034049","doi":"10.1007/978-1-4757-3623-6_1","title":"Introduction","year":2002,"lang":"en","type":"book-chapter","venue":"Nonconvex optimization and its applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Complementarity (molecular biology); Differentiable function; Mathematics; Pure mathematics; Stationary point; Degree (music); Point (geometry); Mathematical analysis; Applied mathematics; Mathematical economics; Physics; Geometry","score_opus":0.013706725164442667,"score_gpt":0.2146830561545367,"score_spread":0.20097633099009404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252034049","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.0042128e-8,0.00038719186,0.72843206,0.006407944,0.00009098106,0.00034452532,0.000017003686,0.00019238373,0.26412788],"genre_scores_gemma":[0.00012220786,0.0056723906,0.11486156,0.0009747959,0.0010024467,0.00015874588,0.00046455668,0.000051437393,0.8766919],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840885,0.00001702026,0.0004307738,0.0006941352,0.000299894,0.00014930737],"domain_scores_gemma":[0.9984688,0.00005281258,0.00033090485,0.00053612486,0.0004621993,0.00014913885],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001116554,0.00027767738,0.00027175772,0.0003298522,0.00029874253,0.00022603977,0.0003786885,0.0002707851,0.0039714384],"category_scores_gemma":[0.000017974702,0.00029248575,0.000095931144,0.00023210599,0.00003828157,0.00045480623,0.00013025272,0.00020557777,0.00061457633],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[6.2916075e-7,0.000023339284,3.62561e-7,0.000013649164,0.000045440203,2.798596e-7,0.000037902424,0.045247138,0.0000018236775,0.9423102,0.0073773437,0.0049418765],"study_design_scores_gemma":[0.000116265684,0.000011694776,0.0000012387749,0.000005726388,0.000042230018,0.0000070779024,0.0000012225956,0.5208973,0.000006812087,0.0030603537,0.47562823,0.00022179855],"about_ca_topic_score_codex":8.52364e-7,"about_ca_topic_score_gemma":5.8662175e-7,"teacher_disagreement_score":0.9392499,"about_ca_system_score_codex":0.00006446712,"about_ca_system_score_gemma":0.000052347554,"threshold_uncertainty_score":0.99995273},"labels":[],"label_agreement":null},{"id":"W4252451331","doi":"10.23952/jnva.3.2019.1.09","title":"Two new algorithms for finding a common zero of accretive operators in Banach spaces","year":2019,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Thai Nguyen University of Technology","keywords":"Zero (linguistics); Banach space; Mathematics; Algorithm; Pure mathematics","score_opus":0.019955220327826338,"score_gpt":0.30383760823750133,"score_spread":0.283882387909675,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252451331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05639532,0.0001138356,0.94139564,0.0017661181,0.00008917858,0.000090149195,0.000024592091,0.000004117712,0.000121071076],"genre_scores_gemma":[0.657963,0.000041144285,0.34151906,0.00013551004,0.00009825092,0.0000010384728,0.00002526191,0.0000043512305,0.00021242569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986218,0.00007374454,0.0006337699,0.00017809583,0.00037924858,0.00011330691],"domain_scores_gemma":[0.99838436,0.00037539756,0.00056424004,0.0001227978,0.00046301002,0.00009022753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072867546,0.000105866944,0.00047733288,0.000908837,0.000048810107,0.00009751164,0.00029364903,0.00004865521,0.00008282727],"category_scores_gemma":[0.000101493904,0.00008637734,0.0002857149,0.0017052278,0.00001167743,0.00051712734,0.000057484103,0.00010179591,0.0000017079855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010649977,0.000308535,0.24167097,0.000024345927,0.0029603557,0.000004269193,0.0014609043,0.6478074,0.0003610485,0.10205654,0.000121216086,0.0031179227],"study_design_scores_gemma":[0.0010779147,0.0000964161,0.03627266,0.000015899765,0.00035013363,0.0000052483124,0.000064461834,0.9590243,0.00008240143,0.0027594545,0.0001492709,0.000101859],"about_ca_topic_score_codex":0.00016343677,"about_ca_topic_score_gemma":0.00004515211,"teacher_disagreement_score":0.6015676,"about_ca_system_score_codex":0.000042650412,"about_ca_system_score_gemma":0.00021486895,"threshold_uncertainty_score":0.35223657},"labels":[],"label_agreement":null},{"id":"W4252466691","doi":"10.23952/jano.2.2020.3.01","title":"Projection-type methods with alternating inertial steps for solving multivalued variational inequalities beyond monotonicity","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation","keywords":"Monotonic function; Variational inequality; Type (biology); Inertial frame of reference; Projection (relational algebra); Mathematics; Projection method; Applied mathematics; Inequality; Mathematical analysis; Mathematical optimization; Dykstra's projection algorithm; Algorithm; Physics; Classical mechanics","score_opus":0.026495487289215598,"score_gpt":0.2956079964048903,"score_spread":0.26911250911567475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252466691","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000501341,0.00001989222,0.9965843,0.002334714,0.00009162996,0.00017270287,0.000002122048,0.00002884652,0.00026442914],"genre_scores_gemma":[0.15255314,0.0000148921345,0.84648484,0.00071150094,0.00020003252,0.000007264047,0.000009913834,0.000009314006,0.000009133785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988155,0.00006951101,0.0004885884,0.00020881974,0.00029511866,0.00012248121],"domain_scores_gemma":[0.9984169,0.00028386773,0.0005696155,0.00006500397,0.0005454053,0.00011918234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005205263,0.00012430611,0.00027124898,0.000114015114,0.0001695719,0.00016763748,0.00018148765,0.00005121086,0.000015897873],"category_scores_gemma":[0.00026462672,0.00009567542,0.000058476468,0.0004922067,0.000018818939,0.00051055825,0.00005313936,0.00012369113,3.445164e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025450665,0.000048085563,0.000077319426,0.00001531838,0.00009681374,4.738992e-7,0.001104738,0.9554218,0.0007558843,0.038478382,0.00003607779,0.0037106099],"study_design_scores_gemma":[0.00092816807,0.00025267198,0.00011104546,0.000007280991,0.00004930255,0.00000609384,0.000090075715,0.996509,0.00058834656,0.0011697427,0.0001629228,0.00012533828],"about_ca_topic_score_codex":0.0000064502137,"about_ca_topic_score_gemma":1.4603292e-7,"teacher_disagreement_score":0.15205179,"about_ca_system_score_codex":0.00003607599,"about_ca_system_score_gemma":0.00012869075,"threshold_uncertainty_score":0.39015305},"labels":[],"label_agreement":null},{"id":"W4252738740","doi":"10.23952/jano.3.2021.1.10","title":"On global optimality conditions for D.C. minimization problems with D.C. constraints","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Minification; Mathematical optimization; Computer science; Mathematics","score_opus":0.010066415683730939,"score_gpt":0.24448335597363383,"score_spread":0.2344169402899029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252738740","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032535044,0.00001902597,0.9957079,0.001658921,0.00006588387,0.00013017713,0.000016746773,0.000020161437,0.0020558173],"genre_scores_gemma":[0.38925803,0.000033995755,0.6098547,0.000715511,0.00004545538,0.000010005086,0.000054681244,0.000006074315,0.000021541626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989853,0.000033790035,0.00037642394,0.00021142942,0.00027149005,0.00012155773],"domain_scores_gemma":[0.9986192,0.00013592244,0.0003701658,0.00011420089,0.0006406012,0.00011988632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001515719,0.000114069546,0.00023161917,0.00006969059,0.00014354302,0.0001533585,0.00012501345,0.000058036938,0.000060982213],"category_scores_gemma":[0.000072388364,0.0000907359,0.000064955704,0.00052026624,0.00005079203,0.0002856626,0.000024615734,0.0000691224,0.000001105153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053429838,0.00013168018,0.00004438812,0.000008466813,0.000054692366,0.0000021417904,0.000044990586,0.7782207,0.00002272367,0.22004597,0.0001764049,0.0011944246],"study_design_scores_gemma":[0.0014821785,0.00024003559,0.00042172294,0.000025337875,0.00006956606,0.00006548813,0.000039302013,0.9862097,0.00013548869,0.010924859,0.00023740817,0.00014893095],"about_ca_topic_score_codex":4.7122873e-7,"about_ca_topic_score_gemma":2.1608123e-7,"teacher_disagreement_score":0.38893268,"about_ca_system_score_codex":0.00004823829,"about_ca_system_score_gemma":0.0001708009,"threshold_uncertainty_score":0.37001026},"labels":[],"label_agreement":null},{"id":"W4252740182","doi":"10.23952/asvao.3.2021.2.05","title":"On a viscosity iterative algorithm for variational inclusion problems and the fixed point problem of countably many nonexpansive mappings","year":2021,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai Municipal Education Commission; Ministry of Education of the People's Republic of China","keywords":"Fixed point; Viscosity; Mathematics; Point (geometry); Inclusion (mineral); Applied mathematics; Iterative method; Algorithm; Mathematical optimization; Computer science; Mathematical analysis; Geometry; Thermodynamics; Physics","score_opus":0.007743266880519959,"score_gpt":0.22160484027586774,"score_spread":0.21386157339534778,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252740182","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00033840234,0.000058304217,0.9968369,0.0018205867,0.000019546313,0.0005343126,0.00006115215,0.000024633773,0.00030613932],"genre_scores_gemma":[0.15690936,0.00013699278,0.84062755,0.0011651632,0.000032987806,0.00014522189,0.00081407715,0.000011649735,0.00015697665],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979446,0.00018467286,0.00061212137,0.0005909387,0.00050580426,0.00016189895],"domain_scores_gemma":[0.997826,0.0004032178,0.00052459555,0.00030046495,0.00087927445,0.00006645061],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010010978,0.00020481035,0.0005275974,0.00029755445,0.0006963588,0.00027227052,0.00021135171,0.000090308386,0.000047092206],"category_scores_gemma":[0.00006254808,0.00015015002,0.00017226939,0.0017529475,0.00008387822,0.0002883497,0.00036807772,0.00009157841,7.7507156e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035282716,0.000081781465,0.00002238313,0.000016061387,0.0006660634,2.8910495e-7,0.002852089,0.72440726,0.000109628745,0.2700059,0.00003526014,0.0017679958],"study_design_scores_gemma":[0.0018249884,0.000039717164,0.0002832475,0.000014854259,0.00057494553,0.0000015395962,0.00012443747,0.9815539,0.00026743786,0.015111577,0.000032957694,0.00017040066],"about_ca_topic_score_codex":0.000045473556,"about_ca_topic_score_gemma":0.000015443242,"teacher_disagreement_score":0.25714663,"about_ca_system_score_codex":0.00004444004,"about_ca_system_score_gemma":0.00007955515,"threshold_uncertainty_score":0.612294},"labels":[],"label_agreement":null},{"id":"W4253114670","doi":"10.23952/jano.3.2021.2.04","title":"A Tikhonov-type regularization for Brézis pseudomonotone equilibrium problems in Banach spaces","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tikhonov regularization; Banach space; Regularization (linguistics); Mathematics; Type (biology); Applied mathematics; Pure mathematics; Mathematical analysis; Computer science; Inverse problem; Artificial intelligence; Geology","score_opus":0.01128739405459117,"score_gpt":0.23319282345994366,"score_spread":0.2219054294053525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253114670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007515548,0.00014780619,0.99626714,0.0020898776,0.00011489677,0.0001307633,0.0000010787443,0.000014819412,0.0004820497],"genre_scores_gemma":[0.28541392,0.00025583172,0.7136368,0.00037899686,0.00010942858,0.000008938185,0.000035789886,0.000013523624,0.00014674048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988879,0.00003932437,0.000486441,0.00021491609,0.00023355757,0.00013785751],"domain_scores_gemma":[0.9988554,0.00009578357,0.00035265865,0.00012047624,0.00049074576,0.00008493258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003109058,0.00010582282,0.0002691524,0.00020007457,0.00005754451,0.00018467245,0.00015524666,0.000076459386,0.000024377634],"category_scores_gemma":[0.00010045492,0.000095554315,0.00006169305,0.0010162514,0.000016659604,0.00045707184,0.000055915076,0.00009129175,9.0126844e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040006882,0.00011578843,0.00018324718,0.000017092758,0.000028659791,0.0000019134397,0.00021333863,0.969823,0.0010556432,0.026442502,0.00010549828,0.0019733214],"study_design_scores_gemma":[0.0008650784,0.00009131977,0.00025473203,0.0000177273,0.000026787167,0.00001767222,0.00003282874,0.99148273,0.00069222687,0.0056915632,0.00070806855,0.000119251934],"about_ca_topic_score_codex":0.0000017886763,"about_ca_topic_score_gemma":5.018755e-7,"teacher_disagreement_score":0.28466237,"about_ca_system_score_codex":0.000043952896,"about_ca_system_score_gemma":0.0001365187,"threshold_uncertainty_score":0.38965917},"labels":[],"label_agreement":null},{"id":"W4253456546","doi":"10.23952/jano.2.2020.2.04","title":"Strong convergence of two inertial projection algorithms in Hilbert spaces","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Inertial frame of reference; Hilbert space; Convergence (economics); Algorithm; Projection (relational algebra); Mathematics; Computer science; Pure mathematics; Physics; Classical mechanics; Economics","score_opus":0.014073114877043255,"score_gpt":0.24559639989761287,"score_spread":0.23152328502056962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253456546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020963307,0.000026652851,0.99514437,0.0022640827,0.00006266575,0.00006149557,5.852587e-7,0.000008558223,0.00033526012],"genre_scores_gemma":[0.7350213,0.00006297158,0.26460883,0.00022656121,0.00006989881,0.0000012194835,0.000002099171,0.0000034051363,0.0000037048826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990994,0.000029895626,0.00042327607,0.00013079378,0.00023889972,0.000077750796],"domain_scores_gemma":[0.9993118,0.00003744667,0.00037712217,0.000048919588,0.00014438425,0.000080335005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014626278,0.0000744036,0.00021208926,0.00012712684,0.000028705745,0.000042944605,0.00014546988,0.000033037933,0.000027429824],"category_scores_gemma":[0.00003602217,0.00006218479,0.000041726737,0.0006530077,0.00001921395,0.0003508466,0.00004175887,0.000096054726,7.161081e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055956483,0.00005598071,0.00068619533,0.0000075677735,0.000019040268,0.0000011859917,0.00051279075,0.9836798,0.00040068504,0.011234237,0.000030616495,0.0033159906],"study_design_scores_gemma":[0.0006313918,0.00010682109,0.0004682626,0.000006645139,0.000013749062,0.0000035568742,0.000046286634,0.9978456,0.0005554451,0.00018901733,0.00006777948,0.00006544083],"about_ca_topic_score_codex":0.000013719158,"about_ca_topic_score_gemma":3.6017533e-7,"teacher_disagreement_score":0.732925,"about_ca_system_score_codex":0.00002000801,"about_ca_system_score_gemma":0.00005854223,"threshold_uncertainty_score":0.2535822},"labels":[],"label_agreement":null},{"id":"W4253531913","doi":"10.23952/jnva.3.2019.2.10","title":"On a new algorithm for solving variational inequality and fixed point problems","year":2019,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational inequality; Fixed point; Inequality; Mathematics; Fixed-point theorem; Mathematical optimization; Point (geometry); Applied mathematics; Algorithm; Computer science; Mathematical analysis; Geometry","score_opus":0.01606397769706446,"score_gpt":0.2608069803668585,"score_spread":0.24474300266979404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253531913","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029078017,0.000067533365,0.99230224,0.004381547,0.00011307795,0.000115725736,0.000038163038,0.000011229086,0.000062693405],"genre_scores_gemma":[0.08466531,0.000056303845,0.91324157,0.000996308,0.00038032263,0.000003778035,0.000084823674,0.000009267878,0.0005623032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983032,0.00006737154,0.0006599289,0.000286132,0.00053946866,0.00014390073],"domain_scores_gemma":[0.9977073,0.00068606733,0.000615081,0.0001558649,0.000667575,0.00016808207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010717865,0.00014767355,0.00041575535,0.0006096617,0.00013225593,0.00022497379,0.00022363507,0.00007354625,0.00015912937],"category_scores_gemma":[0.00021480756,0.00011930204,0.00028494772,0.00091057323,0.000012057495,0.00060174096,0.00006770019,0.00012908738,0.0000050271433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013003015,0.0007399529,0.018807255,0.000060004215,0.0074091754,0.000003943893,0.0014302396,0.39951456,0.00028142534,0.5431151,0.0009122723,0.027596071],"study_design_scores_gemma":[0.0010479407,0.00016293132,0.026699359,0.000012257399,0.0004196704,0.000010293047,0.00001228412,0.9498963,0.000007807749,0.021208627,0.00038412493,0.00013844296],"about_ca_topic_score_codex":0.000037914502,"about_ca_topic_score_gemma":0.000007750104,"teacher_disagreement_score":0.5503817,"about_ca_system_score_codex":0.000046417612,"about_ca_system_score_gemma":0.00022867529,"threshold_uncertainty_score":0.48649964},"labels":[],"label_agreement":null},{"id":"W4253921405","doi":"10.23952/asvao.2.2020.3.05","title":"Variants of the nonconvex minimization theorem and the Caristi’s fixed point theorem","year":2020,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Fixed-point theorem; Mathematics; Minification; Brouwer fixed-point theorem; Fixed point; Combinatorics; Discrete mathematics; Mathematical economics; Mathematical optimization; Mathematical analysis","score_opus":0.00863977852026941,"score_gpt":0.20694327994581507,"score_spread":0.19830350142554568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253921405","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075402803,0.00007801738,0.99115527,0.0062941066,0.000036611396,0.0003035713,0.0000131754905,0.000043638847,0.0013215685],"genre_scores_gemma":[0.9376685,0.00017533088,0.060062177,0.0019039175,0.000043688397,0.000019023726,0.00006969225,0.000011471367,0.000046226523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981226,0.00030485945,0.0005256072,0.00047771077,0.00041160933,0.00015764605],"domain_scores_gemma":[0.9985325,0.00022459248,0.00046856413,0.00045577518,0.00022102645,0.00009754066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006384322,0.00020098616,0.0004555725,0.00015096477,0.0003786203,0.0002284596,0.00049785315,0.00009173783,0.00008169175],"category_scores_gemma":[0.00016688954,0.000117251904,0.0001857087,0.0027119808,0.0002255451,0.0002227041,0.00027493256,0.000116389354,0.0000017473672],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040777984,0.000017317889,0.000458019,0.000008149161,0.0004253992,1.3935126e-7,0.0020443737,0.6105001,0.00003072712,0.38585153,0.000051970674,0.0005714989],"study_design_scores_gemma":[0.001044858,0.000012883909,0.0025292982,0.000004002251,0.00093057833,8.159307e-7,0.0002484492,0.9918888,0.00011749615,0.00305269,0.000025085947,0.00014504479],"about_ca_topic_score_codex":0.00004753589,"about_ca_topic_score_gemma":0.000009728096,"teacher_disagreement_score":0.93691444,"about_ca_system_score_codex":0.00001624064,"about_ca_system_score_gemma":0.000052797608,"threshold_uncertainty_score":0.4781394},"labels":[],"label_agreement":null},{"id":"W4254165755","doi":"10.23952/jnva.2.2018.1.04","title":"A remark on the fixed point property of nonexpansive mappings","year":2018,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Commission","keywords":"Fixed point; Property (philosophy); Fixed-point property; Mathematics; Mathematical analysis; Philosophy","score_opus":0.014834218810303505,"score_gpt":0.2392895787828564,"score_spread":0.2244553599725529,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254165755","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010726489,0.000033387532,0.9559216,0.031902272,0.00010313916,0.00007447048,0.000016055606,0.000008587892,0.0012139969],"genre_scores_gemma":[0.8462619,0.000057127952,0.15004773,0.002495954,0.00046458107,0.0000019820181,0.000010393168,0.0000061000583,0.0006542216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984883,0.00013277822,0.000565397,0.00015816708,0.00055948086,0.000095873795],"domain_scores_gemma":[0.99718815,0.00032876883,0.0006732474,0.0002082285,0.0015319651,0.00006963159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009311242,0.00010099528,0.00030407668,0.00046681697,0.00015618441,0.0000806333,0.00037443862,0.000041879597,0.00022526973],"category_scores_gemma":[0.00035315426,0.00005033026,0.00029531942,0.0016459153,0.00006291485,0.00027697027,0.000069043,0.00011272942,0.000007989557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007809145,0.0024457579,0.024729341,0.00006396835,0.027341643,0.00003104539,0.010740077,0.07739672,0.004371095,0.82914656,0.013077289,0.009875611],"study_design_scores_gemma":[0.00036431447,0.00025502683,0.027179934,0.000020387748,0.0006119485,0.000014426656,0.000078209254,0.9660561,0.0002919251,0.0030825643,0.0019336629,0.00011150631],"about_ca_topic_score_codex":0.00003225081,"about_ca_topic_score_gemma":0.000010183044,"teacher_disagreement_score":0.88865936,"about_ca_system_score_codex":0.00002436774,"about_ca_system_score_gemma":0.00012970316,"threshold_uncertainty_score":0.24665456},"labels":[],"label_agreement":null},{"id":"W4254722883","doi":"10.1007/978-1-4419-9467-7_20","title":"Monotone Operators","year":2011,"lang":"en","type":"book-chapter","venue":"CMS books in mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Monotone polygon; Subderivative; Strongly monotone; Mathematics; Operator (biology); Operator theory; Pure mathematics; Monotonic function; Set (abstract data type); Function (biology); Mathematical analysis; Computer science; Regular polygon","score_opus":0.03356991368752402,"score_gpt":0.23420051414452067,"score_spread":0.20063060045699666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254722883","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000015900322,0.00007213546,0.32469317,0.00008170117,0.000098456825,0.00012613994,0.0000032597522,0.00006723473,0.6748563],"genre_scores_gemma":[0.0004906715,0.00011466484,0.16328984,0.00027277647,0.00006065184,0.000015233048,0.0000114382465,0.00004172896,0.835703],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987304,0.000010207397,0.00049931864,0.00032013116,0.00028746767,0.00015243179],"domain_scores_gemma":[0.9988585,0.000050771974,0.00023544616,0.00067086477,0.00011275315,0.00007164999],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022062812,0.00024743724,0.0003790192,0.0002968593,0.000051173338,0.000089737085,0.0007750238,0.00020682668,0.00056035066],"category_scores_gemma":[0.000027185943,0.00022820456,0.00012798895,0.000064469954,0.000038906877,0.00015293181,0.00023358346,0.00021938795,0.0005071006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.6821416e-7,0.000027228623,0.0000032946728,0.000027869279,0.000035083904,0.000008762288,0.00063758984,0.0001325208,0.0000014483896,0.998205,0.00047068304,0.00045013413],"study_design_scores_gemma":[0.00014984669,0.00001893056,0.0000059627077,0.00015190567,0.000036228656,0.000006607167,0.000005859788,0.07023889,0.000032890264,0.90218705,0.026765857,0.00039995502],"about_ca_topic_score_codex":0.0000036617444,"about_ca_topic_score_gemma":0.000005941582,"teacher_disagreement_score":0.16140331,"about_ca_system_score_codex":0.0000652946,"about_ca_system_score_gemma":0.00008899305,"threshold_uncertainty_score":0.9305912},"labels":[],"label_agreement":null},{"id":"W4255310974","doi":"10.23952/asvao.2.2020.1.08","title":"On generalized $\\tau^w$-contingent epiderivatives in parametric vector optimization problems","year":2020,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vector optimization; Parametric statistics; Vector (molecular biology); Mathematics; Mathematical optimization; Applied mathematics; Mathematical economics; Optimization problem; Statistics; Biology","score_opus":0.022231734394370768,"score_gpt":0.24096647503806987,"score_spread":0.2187347406436991,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255310974","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027066618,0.00007674151,0.9938035,0.0023007249,0.000032552074,0.0003862056,0.0000074870495,0.00014395308,0.00054218655],"genre_scores_gemma":[0.5961645,0.0002283206,0.40133205,0.0017620616,0.000043794473,0.00006780409,0.00034686356,0.000019372752,0.00003519203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973491,0.00020680782,0.00074103446,0.0009072943,0.0004929442,0.00030281965],"domain_scores_gemma":[0.9986875,0.00016477825,0.00042097157,0.00034805082,0.00017583056,0.00020288193],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00044568777,0.000309343,0.0006087919,0.0010663316,0.00021287298,0.00036286272,0.00037418268,0.0001309927,0.00019337834],"category_scores_gemma":[0.00022704943,0.00028953247,0.00017122806,0.008389712,0.000037064096,0.00041344247,0.00012568916,0.00015634358,0.000011293618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023567865,0.0000815641,0.0006149488,0.000011689307,0.00029798696,9.748446e-7,0.0006995002,0.9448305,0.000038745427,0.052756052,0.000048202975,0.0005962618],"study_design_scores_gemma":[0.0009521362,0.000055318473,0.0014884176,0.0000068819973,0.00025509245,2.447845e-7,0.000048352736,0.99637955,0.0001043123,0.00035726296,0.000025211319,0.00032720162],"about_ca_topic_score_codex":0.000054461914,"about_ca_topic_score_gemma":0.000012280632,"teacher_disagreement_score":0.5934579,"about_ca_system_score_codex":0.00007010333,"about_ca_system_score_gemma":0.000045197805,"threshold_uncertainty_score":0.99995565},"labels":[],"label_agreement":null},{"id":"W4255830484","doi":"10.23952/jnva.5.2021.1.03","title":"On the unified approach between upper and lower semicontinuous differential inclusions","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Differential inclusion; Mathematics; Differential (mechanical device); Geology; Mathematical analysis; Physics; Thermodynamics","score_opus":0.012955151380160452,"score_gpt":0.23827842842059813,"score_spread":0.22532327704043767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255830484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08502722,0.00007987369,0.9056495,0.00865521,0.00006927715,0.00003204251,0.000024452946,0.000007796361,0.00045465914],"genre_scores_gemma":[0.9250698,0.00008833745,0.07343134,0.00069803896,0.000286153,9.859325e-7,0.000048380574,0.000004721189,0.00037223374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986368,0.00017606573,0.0004139022,0.00020209236,0.00046846102,0.000102709375],"domain_scores_gemma":[0.9983513,0.0005569652,0.0002917914,0.00017716865,0.0005187419,0.00010408323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004365646,0.000111435795,0.00030936283,0.00030687542,0.000281302,0.0002255379,0.00023820992,0.000059252743,0.00015900355],"category_scores_gemma":[0.0002073862,0.00007001826,0.00024873286,0.0011272116,0.000027811275,0.00020647401,0.00022728226,0.0001883461,0.0000019620602],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007171932,0.0011877522,0.051413465,0.000016907197,0.011368464,0.00003470251,0.0014270328,0.04370174,0.00053837645,0.8847822,0.00089846423,0.004559191],"study_design_scores_gemma":[0.00047994356,0.00005153207,0.1376697,0.000008198682,0.0013198925,0.000026780115,0.00005360677,0.84984213,0.000034102242,0.009949306,0.00041663303,0.00014818019],"about_ca_topic_score_codex":0.000008468152,"about_ca_topic_score_gemma":0.000002731875,"teacher_disagreement_score":0.87483287,"about_ca_system_score_codex":0.000019433182,"about_ca_system_score_gemma":0.00010034147,"threshold_uncertainty_score":0.2855262},"labels":[],"label_agreement":null},{"id":"W4255885295","doi":"10.23952/jnva.2.2018.3.05","title":"Strong convergence of a cyclic iterative algorithm for split common fixed-point problems of demicontractive mappings","year":2018,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Convergence (economics); Fixed point; Algorithm; Mathematics; Iterative method; Computer science; Mathematical analysis","score_opus":0.014472944952071291,"score_gpt":0.2756594635391844,"score_spread":0.2611865185871131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255885295","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076479064,0.00007598729,0.9910437,0.00089001755,0.000067775814,0.00009605948,0.00010611057,0.000004169651,0.00006826218],"genre_scores_gemma":[0.5135681,0.000048138136,0.48600492,0.00011389687,0.00017200071,0.0000032528815,0.00003086457,0.0000042352804,0.000054592692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982714,0.000090033885,0.00092058355,0.00019003982,0.0004086038,0.00011933799],"domain_scores_gemma":[0.9957474,0.00040310685,0.001432269,0.0001387525,0.0021943515,0.000084149455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007675052,0.00012133314,0.00053921563,0.00054546475,0.00009731895,0.000045725934,0.00029454712,0.0000615735,0.00008502872],"category_scores_gemma":[0.0001278893,0.00009887361,0.00036327078,0.0011116203,0.00007494451,0.0005647797,0.000058803907,0.00009560914,8.1268416e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007869412,0.004598105,0.11174109,0.00037984533,0.05503704,0.000012192625,0.021232499,0.23880242,0.013924115,0.47596467,0.00090395263,0.07661714],"study_design_scores_gemma":[0.0005811992,0.00025196813,0.017761203,0.000026985088,0.0007486761,0.0000069207613,0.00006862376,0.97630686,0.00075368455,0.0032194718,0.0001762893,0.0000981429],"about_ca_topic_score_codex":0.00005864161,"about_ca_topic_score_gemma":0.00002084396,"teacher_disagreement_score":0.7375044,"about_ca_system_score_codex":0.000035211506,"about_ca_system_score_gemma":0.00014525128,"threshold_uncertainty_score":0.40319484},"labels":[],"label_agreement":null},{"id":"W4256066471","doi":"10.23952/jnva.5.2021.6.08","title":"Convergence rate of a gradient projection method for solving variational inequalities","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Foundation for Science and Technology Development","keywords":"Variational inequality; Rate of convergence; Convergence (economics); Mathematics; Applied mathematics; Projection (relational algebra); Inequality; Proximal Gradient Methods; Mathematical optimization; Mathematical analysis; Computer science; Algorithm; Economics; Geometry; Convex function","score_opus":0.027069924769612477,"score_gpt":0.30649778737225386,"score_spread":0.2794278626026414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256066471","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015735585,0.00011898155,0.99526346,0.0027248813,0.00016715244,0.000051825464,0.000053824544,0.000007102783,0.000039204664],"genre_scores_gemma":[0.0847846,0.00010850111,0.914186,0.00032203743,0.00022897193,0.0000052201963,0.00008633813,0.0000053060858,0.00027305566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981981,0.00023046308,0.0008470934,0.00022111925,0.00038688563,0.00011636924],"domain_scores_gemma":[0.9954144,0.00088406313,0.0008842935,0.00013546967,0.0026022359,0.00007954407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019821015,0.00011301333,0.00042419365,0.0005842631,0.00013785061,0.00009692678,0.00019171978,0.00005782469,0.00010614159],"category_scores_gemma":[0.0007251807,0.00009845804,0.0004219803,0.0017051162,0.000016050035,0.000513106,0.00006011461,0.00008611491,6.0675677e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008175114,0.00044306755,0.0073211645,0.00006969477,0.0053588315,0.0000052425885,0.0013812168,0.22646916,0.0022533527,0.75477684,0.00016859338,0.001671103],"study_design_scores_gemma":[0.00047883092,0.000059776,0.015058395,0.000010210228,0.0008621761,0.000020605474,0.00008053344,0.97038287,0.0005116433,0.011935684,0.000494022,0.00010527845],"about_ca_topic_score_codex":0.00004596524,"about_ca_topic_score_gemma":0.000022611446,"teacher_disagreement_score":0.7439137,"about_ca_system_score_codex":0.00004243094,"about_ca_system_score_gemma":0.000434377,"threshold_uncertainty_score":0.40150023},"labels":[],"label_agreement":null},{"id":"W4256227716","doi":"10.23952/asvao.1.2019.1.01","title":"Convergence analysis of a Mann-like iterative algorithm in reflexive Banach spaces","year":2019,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai Municipal Education Commission; Ministry of Education of the People's Republic of China","keywords":"Convergence (economics); Banach space; Reflexivity; Mathematics; Algorithm; Modes of convergence (annotated index); Iterative method; Computer science; Pure mathematics; Sociology; Economics","score_opus":0.009246206445712125,"score_gpt":0.2524672489481745,"score_spread":0.2432210425024624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256227716","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00915443,0.00007040572,0.98930794,0.00015869254,0.000043754182,0.00021522662,0.000027299904,0.00003979289,0.0009824836],"genre_scores_gemma":[0.70619273,0.00016691719,0.29253942,0.00024317196,0.00001072342,0.000021319845,0.00050881726,0.000008824151,0.00030806442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977054,0.0001445206,0.00067026564,0.00075127825,0.0004928816,0.0002356657],"domain_scores_gemma":[0.99850315,0.00011514407,0.00046611717,0.0005163816,0.00030231784,0.00009686518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053900346,0.00023804237,0.00081619556,0.0023857192,0.00009702813,0.00017707252,0.00037513126,0.000119295764,0.0004179315],"category_scores_gemma":[0.000016316379,0.00022245293,0.00027520358,0.012666593,0.000049863476,0.0004665452,0.00013766851,0.000107912594,0.000010154618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011918674,0.000066283385,0.011885454,0.00000760632,0.0027996856,8.78415e-7,0.0011180147,0.9613593,0.000047549485,0.021867108,0.000010099243,0.0008260812],"study_design_scores_gemma":[0.00041038124,0.000026743302,0.013391731,0.000005087806,0.0021880914,2.0603323e-7,0.0002667232,0.98315424,0.00008740186,0.00020557409,0.000021401396,0.00024240166],"about_ca_topic_score_codex":0.00023468473,"about_ca_topic_score_gemma":0.00011479863,"teacher_disagreement_score":0.6970383,"about_ca_system_score_codex":0.00005873361,"about_ca_system_score_gemma":0.00004948333,"threshold_uncertainty_score":0.90713674},"labels":[],"label_agreement":null},{"id":"W4256472077","doi":"10.23952/jano.2.2020.3.04","title":"The subgradient extragradient-type algorithms for solving a class of monotone variational inclusion problems","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities","keywords":"Subgradient method; Monotone polygon; Class (philosophy); Inclusion (mineral); Mathematics; Type (biology); Applied mathematics; Mathematical optimization; Variational inequality; Algorithm; Algebra over a field; Computer science; Pure mathematics; Artificial intelligence; Psychology; Social psychology","score_opus":0.016708107747700325,"score_gpt":0.2328252932967818,"score_spread":0.2161171855490815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256472077","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015900959,0.00013020926,0.99380434,0.0054670675,0.00015576655,0.00017477645,0.0000019673462,0.000011220743,0.000095618874],"genre_scores_gemma":[0.38448456,0.00017692789,0.61475056,0.00038895395,0.00016820472,0.0000063161488,0.000009164777,0.000007544053,0.000007789083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880284,0.000024041832,0.00054618245,0.00015631657,0.00035167366,0.000118940785],"domain_scores_gemma":[0.9984937,0.00021519602,0.0006129541,0.000080207166,0.000478395,0.00011956336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039024622,0.000095029696,0.00021217504,0.000072157745,0.00034101083,0.00008328029,0.00028403048,0.000046250283,0.000007060257],"category_scores_gemma":[0.00010874158,0.000064983506,0.00008294359,0.00050740177,0.000028962748,0.00022765336,0.00015993399,0.00009012449,3.3496949e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099184595,0.00006168577,0.000016676724,0.000011691457,0.000054851476,2.388498e-7,0.00109172,0.92195004,0.00036470883,0.07187616,0.00013031103,0.004342724],"study_design_scores_gemma":[0.0005696156,0.00022895515,0.00007827338,0.000007513118,0.000033957003,0.0000030849285,0.000023110813,0.9926657,0.00012755302,0.004573893,0.0016137518,0.0000745753],"about_ca_topic_score_codex":0.0000014502338,"about_ca_topic_score_gemma":1.14268474e-7,"teacher_disagreement_score":0.38432553,"about_ca_system_score_codex":0.000028358187,"about_ca_system_score_gemma":0.000078120625,"threshold_uncertainty_score":0.26499504},"labels":[],"label_agreement":null},{"id":"W4280560409","doi":"10.48550/arxiv.2205.09040","title":"Strongly nonexpansive mappings revisited: uniform monotonicity and operator splitting","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Monotone polygon; Monotonic function; Mathematics; Operator (biology); Convergence (economics); Class (philosophy); Inverse; Duality (order theory); Pure mathematics; Function (biology); Applied mathematics; Mathematical analysis; Computer science","score_opus":0.038588412110466874,"score_gpt":0.1869406441156589,"score_spread":0.14835223200519201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4280560409","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11852708,0.00006257035,0.8772774,0.00041438855,0.00015784932,0.00028933387,0.00004664117,0.00017854759,0.0030462316],"genre_scores_gemma":[0.98700255,0.00022732146,0.01050517,0.0002852862,0.000043017968,0.0000018694471,0.00006889518,0.000012605073,0.0018532558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824035,0.00013431165,0.00023389953,0.0010163252,0.00013173615,0.00024336165],"domain_scores_gemma":[0.99851424,0.00008189758,0.00029086068,0.00071168394,0.00024603223,0.0001553042],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000311461,0.0002517177,0.00032624224,0.00031294842,0.00039448438,0.00024974786,0.0010677255,0.00013409856,0.00020689346],"category_scores_gemma":[0.00004248359,0.00029773917,0.00015483338,0.00085785,0.00004737645,0.0004892398,0.0029681427,0.00049866963,0.00001831083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000081233275,0.000037909427,0.0035170303,0.00003761074,0.0001255789,0.00005006695,0.0002823464,0.5587024,0.000007536886,0.4370326,0.00007736477,0.000121405836],"study_design_scores_gemma":[0.00029626887,0.00002533317,0.0018179533,0.0000279664,0.00007761928,0.000002373031,0.00024276308,0.990779,0.000009916333,0.0052929497,0.0010822467,0.0003455998],"about_ca_topic_score_codex":0.00020325638,"about_ca_topic_score_gemma":0.000009760049,"teacher_disagreement_score":0.8684755,"about_ca_system_score_codex":0.00025626307,"about_ca_system_score_gemma":0.00020908639,"threshold_uncertainty_score":0.9999475},"labels":[],"label_agreement":null},{"id":"W4285116060","doi":"10.23952/jano.4.2022.2.04","title":"Parallel projection method for solving split equilibrium problems","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Projection (relational algebra); Computer science; Mathematical optimization; Mathematical economics; Mathematics; Algorithm","score_opus":0.015174813360367327,"score_gpt":0.2575961429409186,"score_spread":0.24242132958055126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285116060","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046359044,0.000043828906,0.99752295,0.001560862,0.00013302876,0.00019879334,0.0000018454497,0.000024323614,0.00046800752],"genre_scores_gemma":[0.029190391,0.000020523092,0.97018313,0.00038929703,0.000089887566,0.000040791314,0.000010550145,0.000008985789,0.00006642911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894416,0.000043051365,0.00040545553,0.00018121669,0.0003010814,0.000125009],"domain_scores_gemma":[0.9990975,0.00010888818,0.0004602788,0.00008681764,0.00017665008,0.00006986647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006410758,0.00008865716,0.00020064009,0.00018623662,0.00023456024,0.000112346526,0.00021239811,0.000028998369,0.000044800523],"category_scores_gemma":[0.000028465862,0.0000785356,0.00008705148,0.0004881287,0.0000078492685,0.0003307149,0.000109393746,0.0001235709,3.585866e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057525143,0.00007361301,0.000010967022,0.000010793489,0.000031659565,3.444608e-7,0.0002682104,0.96296364,0.00022075602,0.031397883,0.00021390998,0.004750676],"study_design_scores_gemma":[0.00058487145,0.00018671787,0.000036459627,0.0000024224398,0.000031400225,0.000026219459,0.000050937528,0.9916001,0.000041379128,0.0045085163,0.0028348642,0.000096126816],"about_ca_topic_score_codex":0.0000024095975,"about_ca_topic_score_gemma":3.8268364e-8,"teacher_disagreement_score":0.029144034,"about_ca_system_score_codex":0.000058062877,"about_ca_system_score_gemma":0.000070869784,"threshold_uncertainty_score":0.3202589},"labels":[],"label_agreement":null},{"id":"W4285221937","doi":"10.23952/jano.4.2022.2.11","title":"Superiorization with a projected subgradient method","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subgradient method; Mathematics; Mathematical optimization","score_opus":0.005466644890986958,"score_gpt":0.21366184018363155,"score_spread":0.20819519529264457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285221937","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041937505,0.000024093384,0.9976998,0.0011090718,0.000056383302,0.00009234483,0.0000011755232,0.000023257757,0.00057448173],"genre_scores_gemma":[0.27478424,0.000019442836,0.7247706,0.00032888557,0.000036671303,0.0000106516745,0.000010048589,0.0000070998376,0.00003234598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895626,0.00007657646,0.00030169307,0.00015943052,0.00040765546,0.00009839183],"domain_scores_gemma":[0.99926335,0.00005186336,0.00032787898,0.00009304538,0.00018594276,0.00007793282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003125187,0.00008620439,0.00018629193,0.00021931762,0.00022932515,0.0000898189,0.00019047878,0.000019568673,0.000097623284],"category_scores_gemma":[0.000014243476,0.00006639579,0.000038319748,0.0009861927,0.000011491172,0.00026891657,0.000076421136,0.00012996826,4.6980907e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008459544,0.00008987056,0.00007841801,0.0000025825223,0.000036916976,0.0000029891264,0.00057522696,0.9611546,0.000099902536,0.034889877,0.000057777168,0.0029272458],"study_design_scores_gemma":[0.00057564507,0.00028559455,0.00025747358,0.0000020455939,0.00003415409,0.0000724927,0.000088749104,0.9964778,0.00007227297,0.00039981783,0.0016345889,0.00009938144],"about_ca_topic_score_codex":0.0000028415716,"about_ca_topic_score_gemma":7.474354e-8,"teacher_disagreement_score":0.27436486,"about_ca_system_score_codex":0.000055860375,"about_ca_system_score_gemma":0.00009155891,"threshold_uncertainty_score":0.27075416},"labels":[],"label_agreement":null},{"id":"W4285309389","doi":"10.23952/jnva.6.2022.3.01","title":"Convergence of the solution sets for set optimization problems","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Human Resource Development; Human Resource Development Group","keywords":"Convergence (economics); Mathematical optimization; Set (abstract data type); Mathematics; Applied mathematics; Computer science; Economics","score_opus":0.021239981218552847,"score_gpt":0.26198615477926684,"score_spread":0.24074617356071398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285309389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017449002,0.000069474285,0.993832,0.004009677,0.00015388925,0.000084991916,0.00007898106,0.0000044176936,0.000021659689],"genre_scores_gemma":[0.6617699,0.00005150536,0.33746988,0.00034843685,0.00008656666,0.0000109906105,0.00007553205,0.000005314151,0.00018186026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858266,0.00013883648,0.0005306596,0.0001329073,0.0005328872,0.000082030914],"domain_scores_gemma":[0.9981256,0.00015660809,0.0008404854,0.00013828698,0.0006968045,0.0000422138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008749621,0.00007225017,0.0002194638,0.0003343827,0.00031883174,0.000040168605,0.00038436247,0.00002442054,0.00013510752],"category_scores_gemma":[0.00011113846,0.000053399643,0.00032269617,0.0017108876,0.00001994459,0.00028273248,0.00013382098,0.00009092835,1.8221576e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012982377,0.0000785447,0.0033564307,0.0000065267686,0.000562374,1.3412402e-7,0.0002281714,0.98551536,0.00006722453,0.009910641,0.00012287044,0.00013876386],"study_design_scores_gemma":[0.0003279609,0.000062683066,0.007364925,0.0000024896533,0.0005117425,0.000009156551,0.000027885326,0.98955923,0.000023412545,0.0015239926,0.0005259406,0.000060597937],"about_ca_topic_score_codex":0.00001785797,"about_ca_topic_score_gemma":0.0000046474056,"teacher_disagreement_score":0.660025,"about_ca_system_score_codex":0.000046352794,"about_ca_system_score_gemma":0.00017337727,"threshold_uncertainty_score":0.24522282},"labels":[],"label_agreement":null},{"id":"W4287220120","doi":"10.3390/sym14081507","title":"A Viscosity Approximation Method for Solving General System of Variational Inequalities, Generalized Mixed Equilibrium Problems and Fixed Point Problems","year":2022,"lang":"en","type":"article","venue":"Symmetry","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Variational inequality; Mathematics; Hilbert space; Fixed point; Convergence (economics); Applied mathematics; Scheme (mathematics); Consistency (knowledge bases); Iterative method; Set (abstract data type); Midpoint; Viscosity; Mathematical optimization; Mathematical analysis; Discrete mathematics; Computer science; Geometry","score_opus":0.024871062061375036,"score_gpt":0.2550957400170995,"score_spread":0.23022467795572446,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287220120","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006243596,0.00011250644,0.9917865,0.000678736,0.00024978584,0.0005571084,0.0001000111,0.00009956686,0.00017222484],"genre_scores_gemma":[0.30112803,0.000002045833,0.6978401,0.00015477891,0.00007168558,0.00029717514,0.00023261303,0.000013287039,0.0002603171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978807,0.00042505487,0.0005827643,0.00041595093,0.00048374638,0.00021180605],"domain_scores_gemma":[0.9987066,0.00026672357,0.00043853547,0.00027005846,0.00025005057,0.000068073256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002219878,0.00014778135,0.00031838185,0.000292646,0.00028349718,0.00011606422,0.00035080165,0.000048895752,0.000026941612],"category_scores_gemma":[0.00010416738,0.00014778077,0.00012146131,0.0007374743,0.000015516718,0.00040121507,0.00038867132,0.000090450645,6.2234324e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016454103,0.00010598103,0.00032341393,0.0003648139,0.0001250095,2.9007637e-7,0.0011030597,0.14550672,0.0066661406,0.84460795,0.0002591044,0.00092104246],"study_design_scores_gemma":[0.0008357815,0.00008697488,0.0004120409,0.000014723297,0.00003947634,0.000011015381,0.00011194966,0.9881416,0.0006702847,0.009258343,0.00024705756,0.00017072828],"about_ca_topic_score_codex":0.0002415354,"about_ca_topic_score_gemma":0.0000058933247,"teacher_disagreement_score":0.8426349,"about_ca_system_score_codex":0.0001491042,"about_ca_system_score_gemma":0.00012402092,"threshold_uncertainty_score":0.6026325},"labels":[],"label_agreement":null},{"id":"W4287750835","doi":"10.48550/arxiv.2006.15662","title":"A Study of One-Parameter Regularization Methods for Mathematical\\n Programs with Vanishing Constraints","year":2020,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Munich Aerospace; Natural Sciences and Engineering Research Council of Canada; Bayerische Forschungsallianz; Technische Universität Darmstadt","keywords":"Regularization (linguistics); Mathematical optimization; Solver; Karush–Kuhn–Tucker conditions; Nonlinear system; Mathematics; Truss; Computer science; Applied mathematics; Artificial intelligence","score_opus":0.16441215834857179,"score_gpt":0.26136267269864516,"score_spread":0.09695051435007337,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4287750835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005819966,0.0000019849786,0.9924886,0.00015120869,0.00004267859,0.00096953247,0.000004913954,0.00010542178,0.0004156621],"genre_scores_gemma":[0.56075853,0.0000015382334,0.43905324,0.000027032313,0.000009215913,0.0000045878805,0.00002173382,0.000008264994,0.00011583225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849355,0.00023793509,0.0002769153,0.00072978146,0.00011405298,0.00014776592],"domain_scores_gemma":[0.9981592,0.00026001805,0.0004354682,0.00056918804,0.00047771877,0.0000983901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037249175,0.00018973832,0.0004146481,0.00016186736,0.00008771312,0.00014726463,0.00079979294,0.00012001623,0.000018034563],"category_scores_gemma":[0.00014741326,0.00018786077,0.0001242546,0.0008558257,0.00007370771,0.00025876108,0.0005152867,0.0001741841,0.0000028659813],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043186912,0.00090367906,0.000721099,0.00016528205,0.0007045208,0.0000113079905,0.0015073041,0.19711588,0.000020157155,0.795832,0.0000054058432,0.002970224],"study_design_scores_gemma":[0.0006292563,0.00024529654,0.00011950212,0.000057247766,0.00032229626,9.384298e-7,0.00029775122,0.85575193,0.00005600175,0.14231615,0.0000072872167,0.0001963342],"about_ca_topic_score_codex":0.0000107493515,"about_ca_topic_score_gemma":0.0000058603796,"teacher_disagreement_score":0.65863603,"about_ca_system_score_codex":0.00005305103,"about_ca_system_score_gemma":0.00014514585,"threshold_uncertainty_score":0.766074},"labels":[],"label_agreement":null},{"id":"W4292754607","doi":"10.1007/978-3-031-08655-7_3","title":"Equivalent norms","year":2022,"lang":"pl","type":"book-chapter","venue":"Monografie matematyczne","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Section (typography); Linear subspace; Norm (philosophy); Mathematics; Regular polygon; Dual norm; Space (punctuation); Pure mathematics; Algebra over a field; Computer science; Geometry; Normed vector space; Epistemology; Philosophy","score_opus":0.035126073993607655,"score_gpt":0.24150003166978423,"score_spread":0.20637395767617658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4292754607","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009709037,0.001987221,0.21906206,0.012122279,0.004119332,0.0015004071,0.000410558,0.0009015615,0.7597995],"genre_scores_gemma":[0.04634243,0.0044399593,0.03259372,0.004110082,0.0008803356,0.0002977945,0.001388005,0.00034012695,0.9096075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99453825,0.00014113817,0.001476227,0.0014158753,0.0017138736,0.0007146284],"domain_scores_gemma":[0.99630624,0.00017102687,0.0010664348,0.0017093342,0.0003612959,0.00038569528],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00082362926,0.0008933539,0.0011454875,0.00091621745,0.00090903917,0.00073692,0.0021427693,0.00036398822,0.056523643],"category_scores_gemma":[0.00003732325,0.00086944783,0.0009040572,0.00056755677,0.00012515667,0.0006702003,0.0019086535,0.0007781824,0.0041170577],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002408261,0.00017706648,0.00009151455,0.0002640056,0.0006231159,0.00011379192,0.00044565185,0.01151729,0.000014074432,0.97982943,0.003731232,0.003168754],"study_design_scores_gemma":[0.00090701994,0.0003345883,0.00033273426,0.000251874,0.00058989384,0.00008276568,0.000049670474,0.19249454,0.000045577977,0.021396896,0.7814543,0.0020601351],"about_ca_topic_score_codex":0.00013182955,"about_ca_topic_score_gemma":0.00001602105,"teacher_disagreement_score":0.9584325,"about_ca_system_score_codex":0.00031258265,"about_ca_system_score_gemma":0.00019111448,"threshold_uncertainty_score":0.99937564},"labels":[],"label_agreement":null},{"id":"W4298120925","doi":"10.48550/arxiv.1501.06603","title":"Proximal point algorithm, Douglas-Rachford algorithm and alternating\\n projections: a case study","year":2015,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Iterated function; Algorithm; Epigraph; Convergence (economics); Rate of convergence; Convex function; Mathematics; Euclidean geometry; Regular polygon; Constraint (computer-aided design); Computer science; Mathematical optimization","score_opus":0.0782538518003712,"score_gpt":0.22378846659037896,"score_spread":0.14553461479000776,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298120925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.058642324,0.00003972788,0.9390796,0.00012923095,0.000542853,0.0007452573,0.000028675453,0.00025460307,0.00053776987],"genre_scores_gemma":[0.8499142,0.00005432289,0.14756471,0.00010568629,0.00025023907,0.000012491119,0.000030310437,0.000025543135,0.002042528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976702,0.00025332422,0.00031659246,0.0012813451,0.00019956335,0.00027897314],"domain_scores_gemma":[0.9978475,0.00007535171,0.00035743075,0.0008374398,0.0006425669,0.00023969822],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006048166,0.0003457826,0.0003745621,0.0005377497,0.00032171098,0.00039625846,0.00082949543,0.00022596159,0.000019042156],"category_scores_gemma":[0.000054190477,0.0003689023,0.00014334352,0.00094835006,0.00006584816,0.0007045645,0.00219589,0.00064418686,0.000019190864],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006873556,0.0051409462,0.018782271,0.00017683761,0.0030240873,0.03237305,0.01297569,0.751764,0.0000015535592,0.107462496,0.001216515,0.06701382],"study_design_scores_gemma":[0.00087507657,0.00015887154,0.00015006815,0.000019627209,0.00017679908,0.00038108928,0.0015800619,0.98660564,0.0000020128275,0.009521193,0.00012453763,0.0004049977],"about_ca_topic_score_codex":0.002105921,"about_ca_topic_score_gemma":0.00012598762,"teacher_disagreement_score":0.7915149,"about_ca_system_score_codex":0.00024000177,"about_ca_system_score_gemma":0.00032910032,"threshold_uncertainty_score":0.9998763},"labels":[],"label_agreement":null},{"id":"W4298255647","doi":"","title":"Modèles distribués pour la parallélisation de l’algorithme multi-objectifs GISMOO","year":2016,"lang":"fr","type":"preprint","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Chicoutimi","funders":"","keywords":"Computer science","score_opus":0.02464986022361152,"score_gpt":0.24407483466129815,"score_spread":0.21942497443768663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4298255647","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019491415,0.0006402474,0.9124439,0.06129335,0.00041204333,0.00041594313,0.00023215915,0.00034643462,0.022266824],"genre_scores_gemma":[0.29004538,0.0012695363,0.6142291,0.0002997807,0.00012900405,0.00014627608,0.00081303285,0.00007697218,0.09299092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98414797,0.01156276,0.001089758,0.0015499773,0.000875152,0.00077437586],"domain_scores_gemma":[0.98753047,0.003615771,0.0011603555,0.002583679,0.0046077585,0.0005019756],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.008477493,0.00067307847,0.0006767156,0.00036835368,0.0008216436,0.0015824332,0.0026665826,0.000657675,0.0005174456],"category_scores_gemma":[0.003235797,0.0006745636,0.00056863297,0.0009848452,0.00040451964,0.0007890242,0.0018784583,0.0007684118,0.00037563912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012636876,0.0012869253,0.0045962776,0.00009804107,0.00029149087,0.000010860047,0.007655723,0.0070491997,0.0010185352,0.9200311,0.0012006605,0.056748576],"study_design_scores_gemma":[0.0011754143,6.3772103e-7,0.018580014,0.0011156177,0.00013572043,0.000035186065,0.00006907764,0.92242485,0.0062620323,0.021626519,0.027767805,0.00080709625],"about_ca_topic_score_codex":0.0019099034,"about_ca_topic_score_gemma":0.0010568069,"teacher_disagreement_score":0.91537565,"about_ca_system_score_codex":0.00061345415,"about_ca_system_score_gemma":0.001329946,"threshold_uncertainty_score":0.99957055},"labels":[],"label_agreement":null},{"id":"W4301163335","doi":"10.48550/arxiv.1712.00487","title":"The magnitude of the minimal displacement vector for compositions and\\n convex combinations of firmly nonexpansive mappings","year":2017,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Simons Institute for the Theory of Computing, University of California Berkeley","keywords":"Monotone polygon; Mathematics; Regular polygon; Displacement (psychology); Pure mathematics; Combinatorics; Discrete mathematics; Geometry","score_opus":0.04793071222956613,"score_gpt":0.20171344802048982,"score_spread":0.1537827357909237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301163335","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046001665,0.000036040936,0.94861543,0.0035788221,0.00028789192,0.0005850768,0.00017488633,0.000017769571,0.0007024412],"genre_scores_gemma":[0.99575055,0.00008248136,0.002563523,0.000045605073,0.000011046029,0.0000040956907,0.000021335034,0.000003881073,0.0015174695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924046,0.000073121366,0.00018973682,0.000296665,0.000092971495,0.00010702026],"domain_scores_gemma":[0.9978712,0.00030175855,0.00053222495,0.00065151736,0.0006023264,0.00004096334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001621441,0.00011682505,0.00019504613,0.00007928741,0.00055613933,0.00007946385,0.0011385219,0.00007043239,0.0000064260516],"category_scores_gemma":[0.00006933515,0.00009002601,0.00018784517,0.00017461952,0.00023536774,0.00012735627,0.00086336257,0.00011366622,0.0000014660744],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017963477,0.00014073265,0.0011232767,0.00004633818,0.00021066172,6.2590965e-7,0.0002768706,0.03798424,0.00006456468,0.9598383,0.0002491359,0.000047327874],"study_design_scores_gemma":[0.0008231925,0.00005112832,0.018595938,0.000068655834,0.0002138004,5.987534e-7,0.00010425651,0.954786,0.00018863968,0.024643306,0.0003795349,0.00014492129],"about_ca_topic_score_codex":0.000077910794,"about_ca_topic_score_gemma":0.000040072886,"teacher_disagreement_score":0.9497489,"about_ca_system_score_codex":0.00004292573,"about_ca_system_score_gemma":0.000121682744,"threshold_uncertainty_score":0.42774305},"labels":[],"label_agreement":null},{"id":"W4303045027","doi":"10.1007/s10898-022-01241-0","title":"Weak and strong convergence of generalized proximal point algorithms with relaxed parameters","year":2022,"lang":"en","type":"article","venue":"Journal of Global Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Mathematics; Monotone polygon; Algorithm; Equivalence (formal languages); Strongly monotone; Monotonic function; Convergence (economics); Sequence (biology); Regularization (linguistics); Operator (biology); Applied mathematics; Discrete mathematics; Mathematical analysis; Computer science","score_opus":0.010195142235017409,"score_gpt":0.22969302159073107,"score_spread":0.21949787935571366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4303045027","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011504388,0.0000972934,0.9866899,0.0013075699,0.00013911203,0.00008717614,0.000009362139,0.000010964883,0.00015422743],"genre_scores_gemma":[0.3574272,0.000046736506,0.64237255,0.00009933882,0.000013673457,0.0000027720068,0.00000495315,0.000003614899,0.000029134228],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986583,0.00013509743,0.0004343999,0.00014561706,0.0005210402,0.00010552555],"domain_scores_gemma":[0.9986903,0.000027024236,0.0006996417,0.00012202557,0.00038250798,0.000078471065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036136422,0.00009037044,0.00021036301,0.000093678704,0.00011807725,0.000055899054,0.0002832432,0.00002211455,0.0000683363],"category_scores_gemma":[0.000038253893,0.00007491819,0.0000656382,0.00074585684,0.000032920194,0.0005574968,0.000110919034,0.000088521105,2.2242638e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006713108,0.0000670511,0.0038222622,0.0000036674562,0.00007442901,0.0000046111973,0.00007738589,0.97689444,0.000014836364,0.01847033,0.00011577117,0.0003880697],"study_design_scores_gemma":[0.0009568467,0.0003992025,0.0016189531,0.00000846477,0.000050661856,0.00013363842,0.00010493227,0.9962085,0.00003794923,0.00033451815,0.000056492503,0.00008984641],"about_ca_topic_score_codex":0.000020771611,"about_ca_topic_score_gemma":0.0000015026765,"teacher_disagreement_score":0.34592283,"about_ca_system_score_codex":0.00013094241,"about_ca_system_score_gemma":0.00017314195,"threshold_uncertainty_score":0.3055075},"labels":[],"label_agreement":null},{"id":"W4306943628","doi":"10.1080/00207160.2022.2137672","title":"Modified inertial extragradient methods for finding minimum-norm solution of the variational inequality problem with applications to optimal control problem","year":2022,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Thailand Science Research and Innovation; University of Phayao; China Scholarship Council","keywords":"Variational inequality; Hilbert space; Mathematics; Inertial frame of reference; Lipschitz continuity; Norm (philosophy); Convergence (economics); Mathematical optimization; Optimal control; Applied mathematics; Mathematical analysis","score_opus":0.03339700161161386,"score_gpt":0.3274912516270442,"score_spread":0.2940942500154303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4306943628","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012825349,0.0000117203945,0.99248296,0.005189962,0.0003147718,0.000593325,0.0000399149,0.000015289563,0.00006952363],"genre_scores_gemma":[0.19354749,8.421741e-7,0.8057921,0.00031932347,0.00016410214,0.00012016177,0.000008083568,0.000008247744,0.000039653092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976268,0.00019286732,0.0009553923,0.00018901321,0.00089050236,0.0001454168],"domain_scores_gemma":[0.9965641,0.0005211698,0.0012326931,0.00022958849,0.0013783706,0.000074069845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015825583,0.00013547321,0.00028162115,0.0003020419,0.00020637907,0.000117588825,0.0014830414,0.000029366402,0.00001850501],"category_scores_gemma":[0.00005128286,0.000097849006,0.00021719193,0.00049007987,0.000026651851,0.0002737607,0.00032586936,0.00015754673,5.9097044e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005829111,0.00041017547,0.000049266288,0.00001981923,0.00030658624,5.254459e-7,0.0018526805,0.7039661,0.00042929794,0.28877646,0.00019493492,0.003935877],"study_design_scores_gemma":[0.001177337,0.00022773456,0.00026051432,0.00003273402,0.000066798544,0.00008402977,0.00004359668,0.97817034,0.00017166369,0.018256254,0.0013868997,0.00012211017],"about_ca_topic_score_codex":0.000004587405,"about_ca_topic_score_gemma":0.0000015385367,"teacher_disagreement_score":0.27420425,"about_ca_system_score_codex":0.0001969943,"about_ca_system_score_gemma":0.00027017735,"threshold_uncertainty_score":0.39901668},"labels":[],"label_agreement":null},{"id":"W4308866905","doi":"10.4208/jcm.2106-m2020-0209","title":"A Hybrid Viscosity Approximation Method for a Common Solution of a General System of Variational Inequalities, an Equilibrium Problem, and Fixed Point Problems","year":2022,"lang":"en","type":"article","venue":"Journal of Computational Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Alberta","keywords":"Variational inequality; Mathematics; Viscosity; Applied mathematics; Point (geometry); Inequality; Mathematical economics; Fixed point; Mathematical optimization; Mathematical analysis; Thermodynamics; Physics; Geometry","score_opus":0.027306802985023235,"score_gpt":0.28047169661228427,"score_spread":0.253164893627261,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4308866905","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016035954,0.000034374018,0.9827721,0.0005763219,0.000076968245,0.00033874606,0.000096658354,0.000016413667,0.00005243841],"genre_scores_gemma":[0.3502798,6.841725e-7,0.6495639,0.00003160107,0.00003162267,0.000018763674,0.000053145715,0.000006512589,0.000013926288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99723536,0.00037209073,0.0013046124,0.00015072631,0.00082483236,0.00011237802],"domain_scores_gemma":[0.9960075,0.00062885915,0.0021278742,0.00013681888,0.0010321432,0.00006678358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029100277,0.00012019108,0.00044489163,0.00035337725,0.00014099423,0.000058951835,0.0003433883,0.000027391645,0.000009594453],"category_scores_gemma":[0.00008909497,0.00011353716,0.0001443957,0.0003103935,0.000025434496,0.0005904693,0.00015241202,0.00010417239,1.1804696e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024601411,0.00031302337,0.000026098089,0.00037717322,0.00009150822,3.8249993e-7,0.0014322137,0.5661099,0.0006970595,0.43061212,0.000046964597,0.0002689799],"study_design_scores_gemma":[0.00066416065,0.00030629363,0.00014304793,0.0000465385,0.000060629183,0.00014428393,0.00014179733,0.78572416,0.0001755753,0.21250184,0.000009523073,0.00008218025],"about_ca_topic_score_codex":0.000019524716,"about_ca_topic_score_gemma":8.850017e-7,"teacher_disagreement_score":0.33424386,"about_ca_system_score_codex":0.00012479015,"about_ca_system_score_gemma":0.0002840007,"threshold_uncertainty_score":0.4629911},"labels":[],"label_agreement":null},{"id":"W4311161659","doi":"10.23952/jnva.7.2023.1.09","title":"Strong convergent inertial Tseng’s extragradient method for solving non-Lipschitz quasimonotone variational inequalities in Banach spaces","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Inyuvesi Yakwazulu-Natali; National Research Foundation","keywords":"Banach space; Lipschitz continuity; Mathematics; Variational inequality; Inertial frame of reference; Pure mathematics; Mathematical analysis; Applied mathematics; Physics","score_opus":0.023216054018043667,"score_gpt":0.29451932189416946,"score_spread":0.2713032678761258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311161659","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007898505,0.00012230739,0.9869037,0.0045323744,0.00026867434,0.00012926682,0.00008896497,0.000010320062,0.000045866513],"genre_scores_gemma":[0.4741417,0.000037262973,0.5247443,0.00036680326,0.0003200268,0.000029901345,0.00015309738,0.000010096556,0.00019688337],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707836,0.00033703004,0.0011069649,0.0003448141,0.0008935797,0.00023922249],"domain_scores_gemma":[0.99742335,0.0008269682,0.0008630871,0.0001724218,0.0005748873,0.00013930233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031046048,0.0001911137,0.00057120604,0.001435115,0.00037963266,0.00018621929,0.00044443732,0.000054571192,0.00030048887],"category_scores_gemma":[0.0002501832,0.00017787202,0.00045356466,0.0018749384,0.000018057475,0.0005632107,0.00018186189,0.00026488153,7.9973074e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009851658,0.0004010376,0.010267543,0.000013420536,0.0016089273,0.0000057670513,0.0014006092,0.8386033,0.00016227255,0.14663741,0.00012759952,0.000673579],"study_design_scores_gemma":[0.0011091183,0.00013442012,0.023884175,0.000004702403,0.0005069702,0.000014870781,0.00034376906,0.9707188,0.000017751114,0.0021024381,0.00096884725,0.0001941468],"about_ca_topic_score_codex":0.00027823364,"about_ca_topic_score_gemma":0.00010441935,"teacher_disagreement_score":0.46624318,"about_ca_system_score_codex":0.00019174584,"about_ca_system_score_gemma":0.00045502392,"threshold_uncertainty_score":0.7253411},"labels":[],"label_agreement":null},{"id":"W4311162274","doi":"10.23952/jnva.7.2023.1.01","title":"Accelerated cyclic iterative algorithms for the multiple-set split common fixed-point problem of quasi-nonexpansive operators","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Tianjin Municipal Education Commission","keywords":"Fixed point; Algorithm; Set (abstract data type); Mathematics; Point (geometry); Iterative method; Computer science; Mathematical analysis; Geometry","score_opus":0.03038942509624202,"score_gpt":0.29627547373606183,"score_spread":0.2658860486398198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311162274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00990277,0.00016978792,0.98362994,0.005641662,0.00009824182,0.00021031633,0.00031605506,0.000009261574,0.000021954642],"genre_scores_gemma":[0.7690446,0.00007440662,0.22960524,0.00069412426,0.00018726396,0.00003505601,0.00020035262,0.000010180027,0.00014879165],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978307,0.00025248603,0.00090194517,0.00022946633,0.0006430237,0.0001424098],"domain_scores_gemma":[0.9965098,0.0010273557,0.00095005316,0.00019507881,0.0012324823,0.00008525896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011734148,0.00015090675,0.00049866276,0.0005406871,0.0005354387,0.00015737703,0.0005503406,0.000039176346,0.00018131352],"category_scores_gemma":[0.00012723469,0.00010468543,0.00044190921,0.0020621228,0.00003524455,0.00043885488,0.00017668492,0.00021197084,7.1583895e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013616649,0.00059415185,0.008781285,0.000014329903,0.0057164165,0.0000047624662,0.0031929554,0.95865935,0.00027755875,0.0195616,0.00034580656,0.0027156],"study_design_scores_gemma":[0.00079594384,0.00024696835,0.00986995,0.0000044357444,0.00082663575,0.000015156172,0.0003634891,0.9857822,0.000099438585,0.0009618713,0.000910457,0.00012344724],"about_ca_topic_score_codex":0.00009005801,"about_ca_topic_score_gemma":0.000025276317,"teacher_disagreement_score":0.7591418,"about_ca_system_score_codex":0.00006936111,"about_ca_system_score_gemma":0.00020622516,"threshold_uncertainty_score":0.4268948},"labels":[],"label_agreement":null},{"id":"W4311162906","doi":"10.23952/jnva.7.2023.1.06","title":"Convex minimization problems based on an accelerated fixed point algorithm with applications to image restoration problems","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Thailand Science Research and Innovation; Chiang Mai University","keywords":"Minification; Image restoration; Regular polygon; Image (mathematics); Mathematical optimization; Mathematics; Algorithm; Fixed point; Convex optimization; Point (geometry); Computer science; Image processing; Artificial intelligence; Geometry; Mathematical analysis","score_opus":0.017948015741297292,"score_gpt":0.2614328074647201,"score_spread":0.2434847917234228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4311162906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006127575,0.000011702954,0.99325097,0.005630925,0.000036465543,0.0002596202,0.00007333462,0.0000288946,0.00009532681],"genre_scores_gemma":[0.15738954,0.0000095022615,0.83973414,0.0016689366,0.0001860001,0.000105410814,0.00070166675,0.000016825252,0.0001880087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976389,0.00027020113,0.00064421433,0.00035738372,0.0009435737,0.0001457474],"domain_scores_gemma":[0.99748737,0.00012894518,0.00066479674,0.00027669643,0.0012425908,0.00019959807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00085526356,0.00016449585,0.0003322108,0.0012271361,0.0004891917,0.00029969317,0.00039658294,0.00003973978,0.00024678145],"category_scores_gemma":[0.000042917953,0.00013719819,0.00013933686,0.003942133,0.000018622583,0.00076635333,0.00006731045,0.00019409611,0.0000039973834],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045321733,0.00049790414,0.00071891764,0.000005152172,0.0003702525,0.0000025377196,0.00032486892,0.9931203,0.00010923351,0.0034357144,0.00012153347,0.0012482393],"study_design_scores_gemma":[0.0006913284,0.000573666,0.005928227,0.0000052816204,0.00037773815,0.000011476868,0.00005602601,0.99002236,0.000022050346,0.000421218,0.0017139079,0.00017674346],"about_ca_topic_score_codex":0.000031533007,"about_ca_topic_score_gemma":0.000028445502,"teacher_disagreement_score":0.15677677,"about_ca_system_score_codex":0.00013023806,"about_ca_system_score_gemma":0.00030184127,"threshold_uncertainty_score":0.559478},"labels":[],"label_agreement":null},{"id":"W4312107395","doi":"10.48550/arxiv.2212.10673","title":"Asymmetry in the Complexity of the Multi-Commodity Network Pricing Problem","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Commodity; Property (philosophy); Mathematical optimization; Path (computing); Mathematical economics; Shortest path problem; Computational complexity theory; Bilevel optimization; Graph; Revenue; Computer science; Mathematics; Economics; Optimization problem; Combinatorics; Algorithm; Finance","score_opus":0.12840539643851895,"score_gpt":0.20845659397531527,"score_spread":0.08005119753679632,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312107395","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013197195,0.00002248243,0.98212147,0.0013665045,0.00026603715,0.00038385656,0.000018070981,0.000044513756,0.0025798941],"genre_scores_gemma":[0.9881308,0.000019581168,0.011257063,0.00029665473,0.000026845446,0.0000014476765,0.00001552652,0.0000047362314,0.00024736195],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828064,0.0006715757,0.00022628345,0.00047464436,0.00016559908,0.00018127724],"domain_scores_gemma":[0.9983457,0.00015757611,0.000376603,0.0009964597,0.00009373383,0.000029944142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007686782,0.0001482752,0.00022625913,0.00012397229,0.0003026285,0.000058170426,0.0029025616,0.0000808781,0.000048147765],"category_scores_gemma":[0.000030347848,0.00011178408,0.0002210731,0.0020172638,0.00012908668,0.00013379933,0.002805585,0.00060633384,0.000002919789],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023080381,0.00008041923,0.015032573,0.000012078143,0.000025120506,0.000003294728,0.00020314331,0.61772865,2.2803873e-7,0.36679283,0.000092873874,0.000026459185],"study_design_scores_gemma":[0.00019621298,0.0000070060028,0.045079533,0.00001910318,0.00003319419,5.8724623e-7,0.00007769531,0.8803774,0.0000017157568,0.07387769,0.00021067575,0.00011917372],"about_ca_topic_score_codex":0.00052646844,"about_ca_topic_score_gemma":0.0003156679,"teacher_disagreement_score":0.97493356,"about_ca_system_score_codex":0.00014648183,"about_ca_system_score_gemma":0.00014412003,"threshold_uncertainty_score":0.539373},"labels":[],"label_agreement":null},{"id":"W4312328445","doi":"10.23952/asvao.4.2022.2.01","title":"A Bregman proximal Peaceman-Rachford splitting method for convex programming","year":2022,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Regular polygon; Convex optimization; Computer science; Mathematical optimization; Mathematics; Algebra over a field; Pure mathematics; Geometry","score_opus":0.01532918752541782,"score_gpt":0.2751662106703865,"score_spread":0.25983702314496865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312328445","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00021601781,0.000053198393,0.9977654,0.0007662304,0.000043392734,0.00061205827,0.000018708157,0.00016303075,0.00036194266],"genre_scores_gemma":[0.103531264,0.0000121484245,0.8943881,0.0005529973,0.000051767187,0.0005027191,0.0006536878,0.00001960089,0.0002877606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99767935,0.0001717793,0.00053936767,0.00078544224,0.0004952697,0.00032878178],"domain_scores_gemma":[0.99870205,0.00015741108,0.00042677677,0.00038887942,0.00020626756,0.000118631826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014553397,0.00022601054,0.00046181647,0.0006513736,0.0011600972,0.00040755552,0.00042171445,0.000060997296,0.00013052778],"category_scores_gemma":[0.000048180136,0.00022918108,0.00025490322,0.0032379006,0.000025441903,0.000302861,0.00032720057,0.00014341666,0.0000013041548],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021468946,0.000076338176,0.00024759932,0.000015810247,0.0005477184,5.4446843e-7,0.00068729365,0.8854745,0.000044400076,0.100984916,0.000054312804,0.0118451165],"study_design_scores_gemma":[0.00063111045,0.000056484678,0.00011906507,0.000001556108,0.0008346255,0.0000029073215,0.0004113536,0.9955989,0.000051887604,0.00071699545,0.0012909377,0.0002841724],"about_ca_topic_score_codex":0.00004137245,"about_ca_topic_score_gemma":0.0000093882245,"teacher_disagreement_score":0.110124424,"about_ca_system_score_codex":0.00007923802,"about_ca_system_score_gemma":0.000067208945,"threshold_uncertainty_score":0.93457335},"labels":[],"label_agreement":null},{"id":"W4312340192","doi":"10.23952/jano.4.2022.3.04","title":"On split equality generalized equilibrium problems and fixed point problems of Bregman relatively nonexpansive semigroups","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation","keywords":"Fixed point; Mathematics; Bregman divergence; Applied mathematics; Fixed-point theorem; Point (geometry); Pure mathematics; Mathematical analysis; Geometry","score_opus":0.014802408140596576,"score_gpt":0.22547439034662203,"score_spread":0.21067198220602545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312340192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01208354,0.00009380466,0.9852563,0.0014877911,0.00006627688,0.00020756458,0.0000089619425,0.000018754785,0.00077701197],"genre_scores_gemma":[0.8331796,0.000083164974,0.1660861,0.0005074474,0.000034259014,0.000014717524,0.000021957525,0.000012077209,0.00006067132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982887,0.00014378801,0.00067467254,0.000250538,0.00050360715,0.00013870186],"domain_scores_gemma":[0.9984764,0.00015246504,0.00087801006,0.0001399702,0.00023515786,0.00011801139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061780174,0.0001413622,0.00037200438,0.00020969217,0.00016002027,0.00007001039,0.00021979751,0.000046608773,0.00008252124],"category_scores_gemma":[0.00003886799,0.00012005658,0.00007550381,0.00055766624,0.00004334788,0.00032194742,0.00018957842,0.00021180425,6.5408267e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010618803,0.00016109791,0.000056685916,0.000021767817,0.00006191914,0.0000010351242,0.0012155022,0.9277749,0.00078455755,0.06900959,0.000086674685,0.0007201006],"study_design_scores_gemma":[0.0012472115,0.00046649872,0.0004463766,0.000017004086,0.000043744556,0.000022257625,0.0000845703,0.9877516,0.00015914817,0.009358675,0.00024244013,0.00016044063],"about_ca_topic_score_codex":0.000012563523,"about_ca_topic_score_gemma":1.745139e-7,"teacher_disagreement_score":0.82109606,"about_ca_system_score_codex":0.000055621385,"about_ca_system_score_gemma":0.00005456223,"threshold_uncertainty_score":0.48957655},"labels":[],"label_agreement":null},{"id":"W4312362665","doi":"10.23952/asvao.4.2022.2.06","title":"Strong subdifferential calculus for convex set-valued mappings and applications to set optimization","year":2022,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subderivative; Mathematics; Set (abstract data type); Convex set; Convex analysis; Calculus (dental); Regular polygon; Absolutely convex set; Convex optimization; Mathematical optimization; Pure mathematics; Computer science; Geometry; Medicine; Dentistry","score_opus":0.017570803723444814,"score_gpt":0.2593126623540647,"score_spread":0.24174185863061987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312362665","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006227348,0.00005995053,0.9965722,0.0008864245,0.00007283729,0.0011766633,0.00020610304,0.00017190783,0.00023117049],"genre_scores_gemma":[0.4142807,0.000087234366,0.5767907,0.0014722524,0.00015640417,0.0017896094,0.0048272107,0.00005471301,0.0005411527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969863,0.00016167857,0.000703509,0.0011140492,0.0006244632,0.00040998528],"domain_scores_gemma":[0.99829435,0.000118080185,0.00040716812,0.0005551013,0.00033611446,0.00028918104],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00067813124,0.0003551905,0.0006038822,0.0010512775,0.0015007777,0.0005030204,0.0005058698,0.00011326086,0.0002873994],"category_scores_gemma":[0.00003618859,0.00038166004,0.00020013766,0.003760886,0.00007522788,0.00035512727,0.00046789058,0.0001635842,0.0000036956988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035223977,0.00006272546,0.00014041043,0.000017130133,0.0004969382,2.9063162e-7,0.000765145,0.91863066,0.00005085118,0.07855474,0.00020633463,0.001039536],"study_design_scores_gemma":[0.00095966045,0.000065620916,0.00023976322,0.000002436386,0.00096689595,0.0000024123779,0.00054175773,0.9954164,0.000044345892,0.00038652238,0.00093087356,0.00044330725],"about_ca_topic_score_codex":0.000078477446,"about_ca_topic_score_gemma":0.000016747741,"teacher_disagreement_score":0.4197815,"about_ca_system_score_codex":0.00013640043,"about_ca_system_score_gemma":0.000086781096,"threshold_uncertainty_score":0.9998635},"labels":[],"label_agreement":null},{"id":"W4312365152","doi":"10.23952/asvao.4.2022.3.08","title":"A totally relaxed self-adaptive algorithm for solving a variational inequality and fixed point problems in Banach spaces","year":2022,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Israel Science Foundation","keywords":"Variational inequality; Mathematics; Banach space; Fixed point; Point (geometry); Fixed-point theorem; Pure mathematics; Algorithm; Applied mathematics; Mathematical analysis; Geometry","score_opus":0.01250071687221059,"score_gpt":0.22745738192708245,"score_spread":0.21495666505487188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312365152","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007459773,0.00006835833,0.99768716,0.0006608719,0.000030933872,0.0004969811,0.000050489976,0.000086682725,0.00017251605],"genre_scores_gemma":[0.28405195,0.000044798344,0.7147979,0.00027879755,0.000024151639,0.00029627513,0.00044661204,0.000012065484,0.000047418285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99782485,0.00016898707,0.00056266115,0.0007250091,0.00047014316,0.0002483653],"domain_scores_gemma":[0.99888027,0.00021532243,0.00036487944,0.00025015263,0.00019333161,0.00009607123],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013602297,0.00021247692,0.0004284335,0.00073797413,0.00057877693,0.00029204003,0.00023685962,0.00007223543,0.00007369076],"category_scores_gemma":[0.000041541618,0.00021895375,0.00011884961,0.002803428,0.000023790264,0.00040644637,0.00028098843,0.00014442949,4.971712e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012719444,0.00012266515,0.0005337978,0.000007921738,0.00044771587,4.9553955e-7,0.0017423941,0.93311596,0.000015692247,0.06227478,0.000020051952,0.0017058284],"study_design_scores_gemma":[0.0010076249,0.00006387386,0.0027800763,0.0000028280583,0.00036025222,0.0000017103772,0.00034613896,0.99214315,0.0000059769395,0.0029925634,0.000030652212,0.00026514858],"about_ca_topic_score_codex":0.00016757617,"about_ca_topic_score_gemma":0.000061275925,"teacher_disagreement_score":0.28330597,"about_ca_system_score_codex":0.00014362473,"about_ca_system_score_gemma":0.00009996301,"threshold_uncertainty_score":0.89286745},"labels":[],"label_agreement":null},{"id":"W4312417684","doi":"10.23952/asvao.4.2022.2.08","title":"An inertial scheme for solving bi-level variational inequalities and the fixed point problem with pseudomonotone and $\\varrho$-demimetric mappings","year":2022,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation","keywords":"Fixed point; Inertial frame of reference; Variational inequality; Mathematics; Scheme (mathematics); Fixed-point theorem; Point (geometry); Inequality; Pure mathematics; Discrete mathematics; Applied mathematics; Mathematical analysis; Physics; Geometry; Classical mechanics","score_opus":0.016252140739581082,"score_gpt":0.23144607404939907,"score_spread":0.21519393330981798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312417684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003615736,0.00006729108,0.9939224,0.0017023562,0.000016020995,0.0004929841,0.00004765906,0.0000562536,0.00007927303],"genre_scores_gemma":[0.509473,0.000037510086,0.48914653,0.00057366624,0.000036568825,0.00024310914,0.00040862043,0.000012339022,0.00006864378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789417,0.00020960745,0.00054871367,0.0006349346,0.0004981163,0.00021447698],"domain_scores_gemma":[0.99852514,0.00035803844,0.00044419736,0.0003067913,0.0002641417,0.000101691694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020568692,0.00022235927,0.00045809246,0.00069523114,0.0011215039,0.00053089426,0.00027951406,0.000056206023,0.000068616784],"category_scores_gemma":[0.000071685165,0.00016328783,0.000083606734,0.002643623,0.00009475711,0.00048005575,0.0002267606,0.0001283378,2.750049e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000102741484,0.00004555005,0.00065743196,0.000011199575,0.00052466197,1.9703593e-7,0.0014337897,0.77557904,0.00007841703,0.22102265,0.000028459264,0.0005158794],"study_design_scores_gemma":[0.0019941188,0.00006362902,0.0012511329,0.000002317545,0.00054885884,0.000003678669,0.00045747266,0.99314153,0.000022363187,0.00223952,0.00003117298,0.00024419738],"about_ca_topic_score_codex":0.00014838544,"about_ca_topic_score_gemma":0.000017396458,"teacher_disagreement_score":0.5058573,"about_ca_system_score_codex":0.000043651627,"about_ca_system_score_gemma":0.00007310515,"threshold_uncertainty_score":0.86258143},"labels":[],"label_agreement":null},{"id":"W4312463274","doi":"10.23952/asvao.4.2022.2.07","title":"Scalarization and semicontinuity of approximate solutions to set optimization problems","year":2022,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"North Minzu University; National Natural Science Foundation of China","keywords":"Set (abstract data type); Mathematics; Mathematical optimization; Applied mathematics; Computer science","score_opus":0.014074583316739215,"score_gpt":0.22684734885927796,"score_spread":0.21277276554253874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312463274","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015773664,0.00006029888,0.9967504,0.00063410064,0.00003716593,0.0004366607,0.00006524623,0.000103630366,0.00033510738],"genre_scores_gemma":[0.59194654,0.00010521019,0.4063911,0.0003406689,0.000018547695,0.00013526478,0.00093474064,0.000017168726,0.000110725756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977357,0.00018173846,0.00061649614,0.00067396485,0.00052995037,0.00026215918],"domain_scores_gemma":[0.99869245,0.00005898266,0.0004175715,0.00040613054,0.00027261252,0.00015224346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008591103,0.00021663599,0.00043864734,0.0009839571,0.000752708,0.00021125715,0.00032256654,0.00007426475,0.00016553272],"category_scores_gemma":[0.000045968765,0.0002304045,0.00010817397,0.0048614545,0.00004743799,0.000384573,0.00052809744,0.00012099599,0.00000101761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011021783,0.00007116003,0.0006246196,0.00001531302,0.00027081653,1.7019916e-7,0.0011659737,0.9604628,0.00021699452,0.03642063,0.00004636043,0.00069410534],"study_design_scores_gemma":[0.00040665345,0.000043459888,0.0006386936,0.0000037609302,0.0005053342,0.00000201387,0.00020857893,0.99732995,0.0000668056,0.00049622246,0.00004860532,0.00024991072],"about_ca_topic_score_codex":0.000069775575,"about_ca_topic_score_gemma":0.000018100347,"teacher_disagreement_score":0.59036916,"about_ca_system_score_codex":0.00007127028,"about_ca_system_score_gemma":0.000054125067,"threshold_uncertainty_score":0.93956226},"labels":[],"label_agreement":null},{"id":"W4312521632","doi":"10.23952/jnva.6.2022.4.05","title":"Viscosity and inertial algorithms for the split common fixed point problem with applications to compressed sensing","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Tianjin Municipal Education Commission; National Natural Science Foundation of China","keywords":"Inertial frame of reference; Viscosity; Compressed sensing; Algorithm; Computer science; Point (geometry); Mathematics; Materials science; Physics; Geometry; Classical mechanics; Composite material","score_opus":0.016478617849763077,"score_gpt":0.2677258932538442,"score_spread":0.25124727540408115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312521632","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015193778,0.00005735796,0.98500997,0.01311841,0.000022108785,0.0001944937,0.000052376716,0.000008234823,0.000017672734],"genre_scores_gemma":[0.24296382,0.000015346623,0.75565827,0.0010386262,0.00017417247,0.000022488039,0.000046895144,0.000006043968,0.000074353244],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988164,0.000088253124,0.00038531603,0.00018749718,0.00042193336,0.00010060014],"domain_scores_gemma":[0.9985478,0.000403282,0.00034687182,0.00014877773,0.000457999,0.000095272095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069956185,0.000094926436,0.0002613151,0.00031892402,0.0006621738,0.00017713544,0.00025454385,0.000017735738,0.000026158035],"category_scores_gemma":[0.000021516711,0.000063635765,0.00012920029,0.0012519517,0.000020706097,0.00019622048,0.0001576065,0.00012579889,3.0851595e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011666848,0.00018947707,0.002053254,0.000008769055,0.0020665943,0.0000021297951,0.0006117462,0.96286005,0.00017513563,0.024312275,0.0001663102,0.0074375817],"study_design_scores_gemma":[0.00044211652,0.00012193194,0.011004137,0.0000023677708,0.0007549104,0.000032014912,0.00006868621,0.98371136,0.000014119773,0.0009467206,0.0028101383,0.00009152327],"about_ca_topic_score_codex":0.000061748906,"about_ca_topic_score_gemma":0.000035453282,"teacher_disagreement_score":0.24144445,"about_ca_system_score_codex":0.000038450264,"about_ca_system_score_gemma":0.0000859577,"threshold_uncertainty_score":0.5092972},"labels":[],"label_agreement":null},{"id":"W4312526919","doi":"10.23952/asvao.4.2022.3.10","title":"A porosity result regarding fixed points for a class of nonexpansive mappings","year":2022,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Israel Science Foundation","keywords":"Fixed point; Class (philosophy); Porosity; Mathematics; Computer science; Materials science; Mathematical analysis; Artificial intelligence; Composite material","score_opus":0.013056118342872715,"score_gpt":0.23444007510528586,"score_spread":0.22138395676241315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312526919","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025906495,0.0000214873,0.99545467,0.000937445,0.00003930894,0.00030416306,0.000072853574,0.000051392668,0.0005280171],"genre_scores_gemma":[0.6111811,0.000020210291,0.38732544,0.0005481724,0.000020910056,0.00010371979,0.00059577264,0.000010572893,0.00019413863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792516,0.00013383485,0.00063844136,0.0005893021,0.00051537715,0.00019789264],"domain_scores_gemma":[0.99834216,0.00014271797,0.0006203434,0.00043230326,0.0003824035,0.0000800806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010216486,0.00016858874,0.00049939554,0.0006759911,0.000577083,0.00012846343,0.0003895765,0.000057589674,0.0001017774],"category_scores_gemma":[0.00008793036,0.00016951485,0.00027343433,0.0031133834,0.00003262397,0.00022753622,0.000269645,0.000098350276,8.791381e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046736342,0.00005868513,0.00026736685,0.000010486266,0.00056659785,3.275206e-7,0.0007795415,0.92797506,0.0002933151,0.0693775,0.0002566432,0.00036775673],"study_design_scores_gemma":[0.0008396283,0.000042387503,0.0004991706,0.0000022038328,0.0005778375,9.522282e-7,0.00033290932,0.9960167,0.0002822329,0.0009994167,0.000215447,0.0001911267],"about_ca_topic_score_codex":0.000050779072,"about_ca_topic_score_gemma":0.000008241183,"teacher_disagreement_score":0.6085904,"about_ca_system_score_codex":0.00007093234,"about_ca_system_score_gemma":0.000059035403,"threshold_uncertainty_score":0.6912615},"labels":[],"label_agreement":null},{"id":"W4312595545","doi":"10.23952/jnva.6.2022.4.02","title":"A relaxed CQ algorithm involving the alternated inertial technique for the multiple-sets split feasibility problem","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Inertial frame of reference; Algorithm; Computer science; Mathematical optimization; Mathematics; Physics","score_opus":0.02195067172494669,"score_gpt":0.2744307236212402,"score_spread":0.2524800518962935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312595545","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011486734,0.00017598982,0.987582,0.010596416,0.00009242165,0.000295822,0.00008188415,0.0000133472,0.00001341274],"genre_scores_gemma":[0.32986048,0.00006973934,0.6682713,0.0010489842,0.00035362106,0.00010102399,0.000083455,0.00001175372,0.00019965651],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979484,0.00028305518,0.00068173074,0.0002397234,0.0006974428,0.00014965949],"domain_scores_gemma":[0.9971421,0.0010852721,0.0007038203,0.00026927397,0.00072947505,0.00007007056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002590963,0.00012925411,0.00028014713,0.00033598018,0.0008902572,0.00019569816,0.0007669954,0.00003781046,0.00008913241],"category_scores_gemma":[0.0003041246,0.00007536941,0.00044604944,0.001805204,0.000035230183,0.00030937238,0.00025988586,0.00029724286,5.754686e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002238325,0.00081259815,0.020057028,0.00001922658,0.0067684045,0.000010018085,0.0014951741,0.92096186,0.0010467726,0.040507056,0.0007836742,0.007314364],"study_design_scores_gemma":[0.00054670183,0.00007980219,0.015431879,0.0000029541402,0.0006428631,0.000031345215,0.00006100572,0.978365,0.000030366953,0.0034774514,0.0012327725,0.00009783281],"about_ca_topic_score_codex":0.00011202864,"about_ca_topic_score_gemma":0.000033423807,"teacher_disagreement_score":0.32871178,"about_ca_system_score_codex":0.00010694261,"about_ca_system_score_gemma":0.00020594687,"threshold_uncertainty_score":0.68472284},"labels":[],"label_agreement":null},{"id":"W4312736249","doi":"10.23952/jano.4.2022.3.03","title":"A stochastic selective projection method for solving a constrained stochastic variational inequality problem","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational inequality; Projection (relational algebra); Inequality; Mathematical optimization; Mathematics; Applied mathematics; Computer science; Mathematical analysis; Algorithm","score_opus":0.013479440996961495,"score_gpt":0.26671886377582676,"score_spread":0.25323942277886524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312736249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025397005,0.000013708411,0.9982725,0.0010513571,0.00010396498,0.00035899333,0.000010454108,0.00002898936,0.00013464136],"genre_scores_gemma":[0.29072288,0.0000011524282,0.7088535,0.00024226883,0.000071735725,0.00007008178,0.000018267487,0.000007588754,0.000012568022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985527,0.00009569898,0.0005391514,0.0002412862,0.00042221093,0.00014897498],"domain_scores_gemma":[0.9982781,0.00040813565,0.00070127525,0.00007617731,0.00044950724,0.000086798056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010076652,0.00012206459,0.00027285164,0.00027496132,0.00042070073,0.000103044666,0.00018407188,0.000039347946,0.000040068928],"category_scores_gemma":[0.00013924604,0.00011337132,0.00009099238,0.0007500595,0.000015635615,0.00030343447,0.00008600165,0.00018848364,2.5301e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015431792,0.00013022605,0.0000024368937,0.000007429476,0.00007967256,2.698695e-7,0.0006786581,0.9080711,0.00011321971,0.08817125,0.000051610143,0.0025397767],"study_design_scores_gemma":[0.0010083864,0.00027553324,0.000041270505,0.000004122531,0.00006912151,0.000045664838,0.00011035097,0.98452544,0.000010687114,0.013747915,0.00003467384,0.00012685137],"about_ca_topic_score_codex":0.000004986837,"about_ca_topic_score_gemma":1.636931e-7,"teacher_disagreement_score":0.29069746,"about_ca_system_score_codex":0.00014129658,"about_ca_system_score_gemma":0.0002667032,"threshold_uncertainty_score":0.46231484},"labels":[],"label_agreement":null},{"id":"W4312744872","doi":"10.23952/jnva.6.2022.2.07","title":"Approximate elements for set optimization problems with respect to variable domination structures","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Research Consortium for Informatics and Mathematics; Norges Teknisk-Naturvitenskapelige Universitet","keywords":"Set (abstract data type); Variable (mathematics); Mathematics; Mathematical optimization; Computer science; Mathematical analysis","score_opus":0.013747179722240498,"score_gpt":0.2589419815007808,"score_spread":0.2451948017785403,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312744872","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00086885446,0.000025006955,0.9962893,0.0023908094,0.00006527819,0.00018775067,0.00010077169,0.000012392451,0.000059793892],"genre_scores_gemma":[0.052026242,0.000010137328,0.94691646,0.0004722168,0.00012033953,0.000031903113,0.00021565308,0.000008690003,0.00019834099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819654,0.00012166685,0.0005777237,0.00025270443,0.0007084284,0.00014292645],"domain_scores_gemma":[0.99808437,0.00015640829,0.0006377325,0.00014952527,0.0008664452,0.000105496256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011515726,0.00012382743,0.00030096152,0.0009398523,0.0004137104,0.0001947257,0.0003360718,0.000026806614,0.0002082154],"category_scores_gemma":[0.000105985244,0.00009979646,0.0001399173,0.0025052184,0.000008874998,0.00045347025,0.00010908443,0.000103625935,3.3522304e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009053446,0.00008726061,0.0008691397,0.000007563125,0.0009546644,8.524109e-7,0.00028215215,0.96023023,0.000042757823,0.037061814,0.0001248702,0.00024817686],"study_design_scores_gemma":[0.0008195824,0.00028822725,0.0016816201,0.0000031645184,0.00062429754,0.000017545957,0.000055421424,0.9910348,0.000011834776,0.003639913,0.001692005,0.0001316003],"about_ca_topic_score_codex":0.000015141347,"about_ca_topic_score_gemma":0.0000053295926,"teacher_disagreement_score":0.051157385,"about_ca_system_score_codex":0.00010114584,"about_ca_system_score_gemma":0.00017459679,"threshold_uncertainty_score":0.40695816},"labels":[],"label_agreement":null},{"id":"W4312776523","doi":"10.23952/asvao.4.2022.2.04","title":"An inertial forward-backward method with self-adaptive step sizes for finding minimum-norm solutions of inclusion and split equilibrium problems","year":2022,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Inyuvesi Yakwazulu-Natali; National Research Foundation","keywords":"Inertial frame of reference; Norm (philosophy); Mathematics; Inclusion (mineral); Mathematical economics; Mathematical optimization; Applied mathematics; Computer science; Physics; Classical mechanics; Thermodynamics; Law; Political science","score_opus":0.01655596387942495,"score_gpt":0.25958026010339047,"score_spread":0.2430242962239655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312776523","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004103492,0.000059760787,0.9947616,0.00029035303,0.00002061908,0.0005000055,0.000061569815,0.000084188054,0.00011843264],"genre_scores_gemma":[0.40225956,0.000017632445,0.5971562,0.00008876445,0.000019133546,0.00011508284,0.00030962698,0.000012374578,0.000021628595],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99789137,0.00018211475,0.00050052896,0.000660244,0.0005055347,0.00026022972],"domain_scores_gemma":[0.99862844,0.00017359275,0.00045780995,0.00033803246,0.00027799452,0.00012415004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010279687,0.00022109051,0.00048570047,0.00065435946,0.0010831435,0.00014710319,0.00032863798,0.00007008878,0.000038955055],"category_scores_gemma":[0.000017219847,0.00019849067,0.0001240888,0.0024295775,0.00004281024,0.0004592964,0.0006511056,0.00010052829,1.6976223e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000080017824,0.00013852563,0.00016644096,0.00002141466,0.0006128219,2.1714418e-7,0.002050873,0.9550845,0.0005293196,0.039696764,0.000015505371,0.0016036192],"study_design_scores_gemma":[0.0009817193,0.00029241698,0.00024534704,0.0000041147987,0.0011778357,0.0000019096924,0.00042412773,0.9955737,0.00015572955,0.0008367935,0.00005038519,0.000255902],"about_ca_topic_score_codex":0.00008996445,"about_ca_topic_score_gemma":0.000041775304,"teacher_disagreement_score":0.39815608,"about_ca_system_score_codex":0.000075688775,"about_ca_system_score_gemma":0.00009671158,"threshold_uncertainty_score":0.8330774},"labels":[],"label_agreement":null},{"id":"W4312874287","doi":"10.23952/jano.4.2022.3.02","title":"Pareto subdifferential calculus for convex set-valued mappings and applications to set optimization","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subderivative; Pareto principle; Mathematics; Convex analysis; Set (abstract data type); Mathematical optimization; Regular polygon; Convex set; Calculus (dental); Convex optimization; Applied mathematics; Pure mathematics; Computer science; Medicine; Geometry","score_opus":0.014846795698720229,"score_gpt":0.2519294366041357,"score_spread":0.23708264090541548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312874287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025960634,0.000042175343,0.99711066,0.0018542921,0.0001069979,0.0004341153,0.000022712775,0.00003063369,0.00013878923],"genre_scores_gemma":[0.29462,0.00006754891,0.7030378,0.0016573789,0.000187288,0.00020881393,0.00012104857,0.000022567734,0.00007757537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986042,0.00005434441,0.0005079306,0.00029182975,0.00037168793,0.00017002744],"domain_scores_gemma":[0.99886644,0.00009761838,0.0004092707,0.00013905822,0.00028095944,0.00020662617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003597739,0.00014467981,0.00030113888,0.00028712992,0.0004888413,0.00016901741,0.00026939725,0.000048431073,0.00007330231],"category_scores_gemma":[0.000032939257,0.0001380408,0.000071979004,0.00070151617,0.00003293864,0.0002475872,0.00017981452,0.00012902686,7.9467065e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000898805,0.000059511178,0.00002427173,0.000010561367,0.000046335834,4.5599674e-7,0.00048789784,0.9643612,0.000062788335,0.032546967,0.00037088458,0.0019392814],"study_design_scores_gemma":[0.0008306083,0.0001740812,0.0000733366,0.0000031328732,0.00006374501,0.000019799489,0.00019005494,0.99363124,0.000037723818,0.0009045272,0.0039040355,0.00016771303],"about_ca_topic_score_codex":0.0000035117566,"about_ca_topic_score_gemma":1.2750525e-7,"teacher_disagreement_score":0.2943604,"about_ca_system_score_codex":0.000070633214,"about_ca_system_score_gemma":0.00007090481,"threshold_uncertainty_score":0.5629141},"labels":[],"label_agreement":null},{"id":"W4312902491","doi":"10.23952/jnva.6.2022.2.03","title":"Multiple-sets split quasi-convex feasibility problems: Adaptive subgradient methods with convergence guarantee","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Education of Guangdong Province; Zhejiang Sci-Tech University; Chongqing University; Shenzhen University; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Subgradient method; Convergence (economics); Mathematical optimization; Regular polygon; Mathematics; Computer science; Convex optimization; Economics","score_opus":0.030470401267517475,"score_gpt":0.2963089572824943,"score_spread":0.2658385560149768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312902491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017090037,0.00023369213,0.980387,0.0019378273,0.00011106011,0.000121425284,0.000060078193,0.000016841737,0.000042047566],"genre_scores_gemma":[0.51965684,0.000041030522,0.47985187,0.0002635742,0.00005355167,0.000008214848,0.000032258897,0.000005902738,0.00008673985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99709415,0.0005950075,0.0007868471,0.0003964994,0.0009315252,0.00019598407],"domain_scores_gemma":[0.99723333,0.00050547236,0.00090144196,0.00028351782,0.00093588704,0.0001403531],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021563217,0.00018845868,0.0005493745,0.0007063521,0.00041957202,0.000115284754,0.00053863216,0.000040146308,0.00031793513],"category_scores_gemma":[0.00015359478,0.00014631457,0.00037917265,0.0027015975,0.00005064006,0.0005353299,0.00018972618,0.00029620275,0.0000023455736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036050848,0.0013989671,0.08860624,0.000018135084,0.005716204,0.00002924813,0.002152881,0.8355418,0.000103590464,0.063217804,0.000083263956,0.0027714027],"study_design_scores_gemma":[0.00078578683,0.00037614928,0.054603674,0.000004299491,0.00080730574,0.00005336386,0.0001276966,0.93987423,0.00001452664,0.0025683043,0.0006025721,0.00018210443],"about_ca_topic_score_codex":0.0001003292,"about_ca_topic_score_gemma":0.000047113397,"teacher_disagreement_score":0.5025668,"about_ca_system_score_codex":0.00014999797,"about_ca_system_score_gemma":0.0002999116,"threshold_uncertainty_score":0.5966535},"labels":[],"label_agreement":null},{"id":"W4312932580","doi":"10.23952/jnva.6.2022.4.03","title":"Approximation of solutions of the split minimization problem with multiple output sets and common fixed point problems in real Banach spaces","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Inyuvesi Yakwazulu-Natali; National Research Foundation","keywords":"Mathematics; Banach space; Fixed point; Minification; Discrete mathematics; Pure mathematics; Mathematical optimization; Mathematical analysis","score_opus":0.01650511822331397,"score_gpt":0.23098742242952008,"score_spread":0.21448230420620612,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312932580","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21585718,0.00015454616,0.7767939,0.006547154,0.000051262246,0.00031055565,0.00011408383,0.000009678798,0.00016166219],"genre_scores_gemma":[0.88883877,0.000041089283,0.11098145,0.000035739922,0.000014821257,0.0000055858654,0.000042697902,0.0000036279719,0.00003619298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982663,0.00023892676,0.0006722809,0.00015483669,0.0005752142,0.00009246535],"domain_scores_gemma":[0.9981848,0.00019068104,0.0010173494,0.00014183542,0.00042310258,0.000042207725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086784124,0.000092127106,0.00032877602,0.00057389645,0.00018041005,0.0000435717,0.00022967817,0.00003075488,0.000022924418],"category_scores_gemma":[0.000057007448,0.00006453557,0.00012689317,0.0019734188,0.0000412283,0.00034338224,0.00014730339,0.00013138,5.7961934e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003321682,0.00027764656,0.17861919,0.000025473884,0.0004697347,4.5605424e-7,0.0012602947,0.8074622,0.00008103034,0.01137074,0.000014937412,0.00038508917],"study_design_scores_gemma":[0.0005169896,0.00008017138,0.23559718,0.000012068689,0.000279019,0.000009237096,0.00013713131,0.7622259,0.000012569811,0.0010500986,0.00002301214,0.0000565998],"about_ca_topic_score_codex":0.00032264492,"about_ca_topic_score_gemma":0.0003133432,"teacher_disagreement_score":0.6729816,"about_ca_system_score_codex":0.000049578524,"about_ca_system_score_gemma":0.00014322651,"threshold_uncertainty_score":0.26316842},"labels":[],"label_agreement":null},{"id":"W4312982452","doi":"10.23952/jano.4.2022.3.08","title":"Revisiting inertial subgradient extragradient algorithms for solving bilevel variational inequality problems","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"China Scholarship Council","keywords":"Subgradient method; Variational inequality; Inertial frame of reference; Inequality; Bilevel optimization; Mathematics; Applied mathematics; Algorithm; Mathematical optimization; Computer science; Mathematical analysis; Optimization problem; Physics","score_opus":0.02305230992120919,"score_gpt":0.24771067076882358,"score_spread":0.2246583608476144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312982452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039837693,0.000075631535,0.99737394,0.0016287245,0.00019661302,0.0001806993,0.000009422794,0.000021504648,0.00011508626],"genre_scores_gemma":[0.39833924,0.00002865235,0.60091996,0.0003803717,0.00023614196,0.00003609921,0.000035046964,0.000009456639,0.000015048668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983754,0.000057876823,0.0006822386,0.00023434081,0.0004827646,0.00016734263],"domain_scores_gemma":[0.9986049,0.00018227639,0.00070031337,0.000103963575,0.0002954993,0.000113043025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016793,0.00011898534,0.00025775298,0.00021164077,0.00043379221,0.00013136075,0.0002614973,0.000031934527,0.00005892528],"category_scores_gemma":[0.00008046097,0.00010596591,0.00011032703,0.0005429388,0.000014409002,0.00030852295,0.00013377458,0.00015656042,3.07271e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043084983,0.00010267249,0.000059623104,0.000011840597,0.000044272652,7.4827585e-7,0.00047879445,0.9243085,0.00013774511,0.0656693,0.000057713,0.0090857325],"study_design_scores_gemma":[0.00079064304,0.00012934527,0.00040068885,0.000006086893,0.000034467754,0.000020506994,0.0000378057,0.9940221,0.000024509705,0.0033575231,0.0010424948,0.00013387948],"about_ca_topic_score_codex":0.0000042306197,"about_ca_topic_score_gemma":5.4359194e-8,"teacher_disagreement_score":0.39794084,"about_ca_system_score_codex":0.00011209349,"about_ca_system_score_gemma":0.00009830352,"threshold_uncertainty_score":0.43211645},"labels":[],"label_agreement":null},{"id":"W4313054659","doi":"10.23952/jnva.6.2022.2.09","title":"Coderivatives and Aubin properties of solution mappings for parametric vector variational inequality problems","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chongqing Municipal Education Commission; Chongqing University of Arts and Sciences; Natural Science Foundation of Chongqing; Chongqing University","keywords":"Parametric statistics; Mathematics; Applied mathematics; Inequality; Variational inequality; Mathematical analysis; Pure mathematics; Statistics","score_opus":0.03762258843415435,"score_gpt":0.2555168940061241,"score_spread":0.21789430557196976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313054659","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027619598,0.00030201572,0.9678032,0.0039764107,0.000067725894,0.00012104371,0.00009021336,0.00000829587,0.000011526461],"genre_scores_gemma":[0.84108794,0.000046458605,0.1585113,0.00014034598,0.00008083451,0.000015131336,0.00004973555,0.000004363506,0.00006387405],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807006,0.00020941044,0.0007664021,0.00021466237,0.0006255328,0.00011395311],"domain_scores_gemma":[0.99762064,0.0003302139,0.0009709613,0.00010864435,0.00089761213,0.000071932554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015630209,0.00011374088,0.00039852777,0.00089991465,0.00030980923,0.00008394737,0.00023676858,0.000036608908,0.000052542753],"category_scores_gemma":[0.00038946248,0.00009575562,0.0002273347,0.0020228303,0.000037770653,0.00046725402,0.0001400159,0.00012026835,1.7977597e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027045634,0.0012386126,0.03258934,0.00017450243,0.00664232,0.0000014289592,0.0035457085,0.7012019,0.0045435624,0.2479906,0.00017750978,0.0016240351],"study_design_scores_gemma":[0.00060321385,0.0001617754,0.05211147,0.0000064356304,0.0004745014,0.000009884268,0.00005880233,0.9422308,0.000054220698,0.003807503,0.00036819553,0.00011317299],"about_ca_topic_score_codex":0.000047334768,"about_ca_topic_score_gemma":0.0000048601933,"teacher_disagreement_score":0.81346834,"about_ca_system_score_codex":0.00005993559,"about_ca_system_score_gemma":0.000203279,"threshold_uncertainty_score":0.3904801},"labels":[],"label_agreement":null},{"id":"W4313120262","doi":"10.23952/jnva.6.2022.6.03","title":"Approximate efficiency in set-valued optimization with variable order","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii; Ministerul Cercetării, Inovării şi Digitalizării","keywords":"Set (abstract data type); Order (exchange); Variable (mathematics); Mathematical optimization; Mathematics; Computer science; Economics; Mathematical analysis; Programming language","score_opus":0.009410964135138465,"score_gpt":0.23497000925447162,"score_spread":0.22555904511933314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313120262","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021185502,0.00006124343,0.99616987,0.0012721827,0.000052598974,0.00005729089,0.000017133034,0.000011427822,0.00023972962],"genre_scores_gemma":[0.13987856,0.000028128505,0.85932773,0.00040999753,0.0000694662,0.000007751901,0.000079747755,0.000008026834,0.00019060222],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980727,0.00020084172,0.0005772186,0.00023731067,0.00076156866,0.00015036689],"domain_scores_gemma":[0.9985353,0.00012157033,0.00052550965,0.00015962089,0.00057638733,0.000081610924],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011612558,0.00012074272,0.00033278114,0.0011474167,0.00025577098,0.00012951945,0.00036553896,0.00003087535,0.00044963649],"category_scores_gemma":[0.00008434302,0.000097602824,0.00010863793,0.0059990836,0.000017292012,0.00051405065,0.00012840134,0.00020193167,7.3667513e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003634445,0.00021506104,0.0046285507,0.0000033904296,0.00043963132,0.00000723404,0.0002816648,0.9690686,0.0000068303334,0.025220685,0.000016841615,0.00007516999],"study_design_scores_gemma":[0.0007587194,0.000113529844,0.0031510906,0.000003154697,0.00034686935,0.000038563452,0.000075329765,0.9945535,0.0000020006419,0.0006120426,0.00022026955,0.00012494053],"about_ca_topic_score_codex":0.0000474957,"about_ca_topic_score_gemma":0.000007824994,"teacher_disagreement_score":0.13776001,"about_ca_system_score_codex":0.000089575085,"about_ca_system_score_gemma":0.00030404254,"threshold_uncertainty_score":0.49232042},"labels":[],"label_agreement":null},{"id":"W4313148861","doi":"10.23952/jnva.6.2022.4.06","title":"Stability on parametric strong symmetric quasi-equilibrium problems via nonlinear scalarization","year":2022,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chongqing Municipal Education Commission; National Natural Science Foundation of China","keywords":"Nonlinear system; Parametric statistics; Quasistatic process; Stability (learning theory); Mathematical economics; Symmetric equilibrium; Mathematics; Applied mathematics; Economics; Mathematical optimization; Statistical physics; Computer science; Physics; Equilibrium selection; Thermodynamics; Game theory; Statistics; Repeated game","score_opus":0.018939710786786912,"score_gpt":0.24634961015975654,"score_spread":0.22740989937296963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313148861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01986455,0.00013141574,0.97667503,0.0027189574,0.00019623047,0.00011975793,0.00007147672,0.000027964315,0.00019463396],"genre_scores_gemma":[0.89669096,0.00003708818,0.10236778,0.00039398487,0.0002324727,0.000007892177,0.00016255121,0.000011671085,0.00009559363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964804,0.0004297358,0.0010061975,0.0004007061,0.0014637312,0.00021922545],"domain_scores_gemma":[0.9971638,0.00052528374,0.00097538554,0.00031481017,0.000832853,0.0001878743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018723557,0.00019708635,0.00051539554,0.0024785756,0.00037994373,0.00021605272,0.0005768403,0.00006241924,0.0004211532],"category_scores_gemma":[0.00035206208,0.00017404024,0.00046828276,0.009483184,0.000028031101,0.00065154943,0.00022533364,0.0003835435,0.00000598063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054102344,0.001484301,0.021035155,0.000013852263,0.0015592881,0.000006587291,0.00020119657,0.9498578,0.00006822767,0.02281728,0.000051952487,0.0028503004],"study_design_scores_gemma":[0.0005384791,0.00039286524,0.023191689,0.0000027607773,0.00060946564,0.00001960068,0.000031376614,0.9729085,0.00002169689,0.0015128666,0.0005920076,0.00017869347],"about_ca_topic_score_codex":0.0000401817,"about_ca_topic_score_gemma":0.0000052908,"teacher_disagreement_score":0.8768264,"about_ca_system_score_codex":0.00019748099,"about_ca_system_score_gemma":0.00022717864,"threshold_uncertainty_score":0.70971555},"labels":[],"label_agreement":null},{"id":"W4318332805","doi":"10.23952/jano.5.2023.1.09","title":"On the lower semicontinuity and subdifferentiability of the value function for conic linear programming problems","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conic section; Mathematics; Linear programming; Value (mathematics); Mathematical optimization; Function (biology); Bellman equation; Applied mathematics; Geometry; Statistics","score_opus":0.010704904426451695,"score_gpt":0.22028324289249643,"score_spread":0.20957833846604473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025410553,0.000011275277,0.97223353,0.001934105,0.000104262006,0.00024571997,0.0000013738133,0.000013220069,0.000045932054],"genre_scores_gemma":[0.9780653,0.000029176734,0.021656314,0.000171744,0.000036355777,0.000010059783,0.0000024859926,0.000004472061,0.000024106641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927187,0.000044142882,0.0002876796,0.000116934745,0.00019726259,0.00008212225],"domain_scores_gemma":[0.9990786,0.0002734853,0.00033014553,0.00010793525,0.00017562283,0.000034253295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005209672,0.0000676606,0.0001414196,0.000053351574,0.00013818633,0.000056793895,0.00014186156,0.00003794908,0.0000062552745],"category_scores_gemma":[0.000104999235,0.00003586351,0.00007107159,0.0004287814,0.000040582872,0.000100456724,0.000054816806,0.000088401845,2.859567e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008969637,0.00011774973,0.00030813031,0.000023523378,0.000057436508,5.611119e-8,0.00024554084,0.902937,0.00022502236,0.09000441,0.00009802436,0.005893439],"study_design_scores_gemma":[0.00031726374,0.00014894953,0.0020079904,0.000013282119,0.000040559087,0.0000010970099,0.000022658061,0.9886801,0.00013234241,0.008396373,0.00019335735,0.000046015215],"about_ca_topic_score_codex":0.0000012623311,"about_ca_topic_score_gemma":1.6396775e-7,"teacher_disagreement_score":0.9526547,"about_ca_system_score_codex":0.000013115797,"about_ca_system_score_gemma":0.000028057073,"threshold_uncertainty_score":0.14624715},"labels":[],"label_agreement":null},{"id":"W4318332836","doi":"10.23952/jano.5.2023.1.06","title":"On nonsmooth multiobjective semi-infinite programming with switching constraints","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Mathematics; Multiobjective programming; Semi-infinite programming; Multi-objective optimization; Computer science; Geometry","score_opus":0.007485384557642302,"score_gpt":0.22649303926863382,"score_spread":0.2190076547109915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014495847,0.0000041249523,0.9964265,0.0005871602,0.000048858063,0.00009175188,7.3380824e-7,0.000056486348,0.001334801],"genre_scores_gemma":[0.70770186,0.000025550606,0.2919315,0.00026817553,0.00004057172,0.0000040350383,0.0000047744643,0.000007855033,0.000015682863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904424,0.000026864407,0.00028960328,0.0001724336,0.00032737193,0.00013948375],"domain_scores_gemma":[0.9991111,0.0001858047,0.0003268181,0.00008619168,0.00018414385,0.00010593986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026190808,0.00010927622,0.00019513904,0.00028785554,0.000144189,0.000149998,0.00013984556,0.00004310036,0.00001635187],"category_scores_gemma":[0.00004782496,0.00007884103,0.000044998982,0.000930066,0.000029003204,0.00027779245,0.00003494365,0.00014912646,0.0000064789488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006386284,0.00005420392,0.000075075804,0.00000393754,0.000056034027,0.0000073317765,0.00045515414,0.95021266,0.000043249114,0.025021408,0.000030312718,0.023976775],"study_design_scores_gemma":[0.0007282779,0.00019049793,0.0005363509,0.000025303925,0.000025017416,0.000019426932,0.00010574054,0.9971432,0.0000639078,0.00092927867,0.00011442963,0.000118548654],"about_ca_topic_score_codex":0.0000013478658,"about_ca_topic_score_gemma":1.1644699e-7,"teacher_disagreement_score":0.7062523,"about_ca_system_score_codex":0.000029399593,"about_ca_system_score_gemma":0.00006017903,"threshold_uncertainty_score":0.3215044},"labels":[],"label_agreement":null},{"id":"W4318332838","doi":"10.23952/jano.5.2023.1.04","title":"Cone enlargements and applications to vector optimization","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii; Ministerul Cercetării, Inovării şi Digitalizării","keywords":"Cone (formal languages); Vector (molecular biology); Computer science; Biology; Algorithm; Recombinant DNA; Genetics","score_opus":0.010940995224264113,"score_gpt":0.24648181870624686,"score_spread":0.23554082348198274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332838","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013382336,0.000026336069,0.9968041,0.0021152948,0.000060528742,0.00017245646,0.0000023673574,0.00005273814,0.00063234306],"genre_scores_gemma":[0.17788734,0.00045832962,0.8201502,0.0011352503,0.00017360646,0.000036408004,0.00003145549,0.000016817088,0.00011058366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989845,0.000023789444,0.00037890932,0.00020180206,0.00027786812,0.00013308607],"domain_scores_gemma":[0.99915737,0.00007808071,0.00023871545,0.00011669072,0.00022298291,0.0001861794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027036958,0.00010394143,0.00019952768,0.00034150438,0.00014890409,0.00015432492,0.00017643132,0.00004875295,0.00003360269],"category_scores_gemma":[0.000039104172,0.00009252591,0.000034504243,0.0012338889,0.000017219621,0.0003150275,0.000104401726,0.00007270716,0.000012073406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016273718,0.00003629916,0.000050803857,0.000005675697,0.000029971467,7.9800463e-7,0.00014187662,0.9695836,0.000073980045,0.02440742,0.00027254995,0.005380754],"study_design_scores_gemma":[0.00041031028,0.00006448032,0.00059476355,0.000005964719,0.000027180029,0.000006296922,0.000034432942,0.99597174,0.000047980848,0.0006709541,0.0020530454,0.00011284247],"about_ca_topic_score_codex":0.000001092357,"about_ca_topic_score_gemma":5.4382145e-8,"teacher_disagreement_score":0.17775351,"about_ca_system_score_codex":0.000024238047,"about_ca_system_score_gemma":0.0000334025,"threshold_uncertainty_score":0.3773097},"labels":[],"label_agreement":null},{"id":"W4318332842","doi":"10.23952/jano.5.2023.1.05","title":"Convexity and continuity of specific set-valued maps and their extremal value functions","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Convexity; Mathematics; Set (abstract data type); Value (mathematics); Combinatorics; Applied mathematics; Statistics; Computer science; Economics; Financial economics","score_opus":0.01607627434821768,"score_gpt":0.22365710738346953,"score_spread":0.20758083303525185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008510429,0.00009506625,0.9899662,0.0006815233,0.00007991053,0.000069082205,0.000007363836,0.000023176834,0.0005672538],"genre_scores_gemma":[0.91787523,0.0005091753,0.08136048,0.000112964146,0.00006728562,0.0000017732882,0.000013276862,0.000006764104,0.000053055497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913704,0.000045805682,0.000371129,0.00016485355,0.00018256488,0.00009861095],"domain_scores_gemma":[0.9991788,0.0001300463,0.00032084738,0.000091631286,0.00017071211,0.00010792285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038340673,0.000099427416,0.00026795143,0.00019027128,0.000113026064,0.00008460871,0.00009794972,0.000053802636,0.000018715447],"category_scores_gemma":[0.00002922348,0.00007589772,0.000045863155,0.0005617455,0.00006784737,0.00024711047,0.000082106875,0.00009685843,0.0000012470558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002302472,0.00018287683,0.0022374475,0.00004708578,0.00023226024,0.000004850483,0.0024477183,0.7641056,0.0015272228,0.20523839,0.0013101049,0.022436177],"study_design_scores_gemma":[0.0006996272,0.00008300094,0.007529463,0.000010396744,0.000027829577,0.000019232722,0.00017431944,0.986504,0.00014177822,0.0040999684,0.0006073889,0.00010298995],"about_ca_topic_score_codex":0.0000026474354,"about_ca_topic_score_gemma":1.262015e-7,"teacher_disagreement_score":0.9093648,"about_ca_system_score_codex":0.000011265281,"about_ca_system_score_gemma":0.000028277516,"threshold_uncertainty_score":0.30950192},"labels":[],"label_agreement":null},{"id":"W4318332889","doi":"10.23952/jano.5.2023.1.03","title":"Subdifferential calculus for ordered multifunctions with applications to set-valued optimization","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subderivative; Mathematics; Calculus (dental); Set (abstract data type); Pure mathematics; Mathematical optimization; Applied mathematics; Algebra over a field; Computer science; Regular polygon; Geometry; Convex optimization; Medicine","score_opus":0.016155330983677545,"score_gpt":0.25938858929646325,"score_spread":0.2432332583127857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012520303,0.000007627114,0.99726707,0.0017641017,0.00009069997,0.0004612605,0.000009295943,0.0000913734,0.00018339517],"genre_scores_gemma":[0.09024704,0.00004034032,0.90880674,0.00037974317,0.0001565565,0.00013233708,0.00010125259,0.000021538386,0.000114456416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987238,0.00002725994,0.00045342906,0.00027271383,0.00033018828,0.00019262003],"domain_scores_gemma":[0.99863344,0.00011772598,0.00032027924,0.00016991851,0.00055478833,0.00020385195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023226919,0.00014978288,0.00026738376,0.0004276682,0.00028420318,0.0001807313,0.0002374678,0.00006967801,0.000029721856],"category_scores_gemma":[0.00004701727,0.00011978641,0.00007530031,0.0016927609,0.00002247575,0.00030530017,0.000059503294,0.00008779712,0.0000069530915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011423133,0.00006585006,0.000016465206,0.000009002617,0.00006144198,4.832944e-7,0.00019623169,0.9757925,0.00006382741,0.020652786,0.00034299996,0.0026841708],"study_design_scores_gemma":[0.0009991355,0.00016866026,0.00014015123,0.000007437732,0.0000743934,0.000007490523,0.00006613577,0.99688107,0.000070890346,0.00035433873,0.0010726275,0.00015767259],"about_ca_topic_score_codex":0.0000028278391,"about_ca_topic_score_gemma":5.636324e-7,"teacher_disagreement_score":0.09012184,"about_ca_system_score_codex":0.00004429366,"about_ca_system_score_gemma":0.00008600037,"threshold_uncertainty_score":0.48847482},"labels":[],"label_agreement":null},{"id":"W4319083709","doi":"10.3934/jimo.2023012","title":"Adaptive inertial subgradient extragradient methods for finding minimum-norm solutions of pseudomonotone variational inequalities","year":2023,"lang":"en","type":"article","venue":"Journal of Industrial and Management Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"China Scholarship Council","keywords":"Subgradient method; Variational inequality; Monotonic function; Hilbert space; Lipschitz continuity; Inertial frame of reference; Mathematics; Convergence (economics); Applied mathematics; Norm (philosophy); Operator (biology); Iterative method; Mathematical optimization; Computer science; Mathematical analysis","score_opus":0.11797007526500378,"score_gpt":0.33201914576291347,"score_spread":0.2140490704979097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4319083709","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004419848,0.000053884884,0.9968492,0.0015541987,0.00060016406,0.00030452822,0.000012434532,0.000024919695,0.00015868439],"genre_scores_gemma":[0.059434343,0.00051443407,0.9391634,0.00007967259,0.0003334695,0.00003823681,0.000058225876,0.000011746851,0.00036650043],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983655,0.00018851046,0.00077422237,0.00018001172,0.00030678118,0.0001849346],"domain_scores_gemma":[0.9982874,0.0003548197,0.00072965206,0.000113451846,0.00043412455,0.000080569116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020304671,0.00012364413,0.00027171482,0.00079856574,0.00018769271,0.000088523615,0.00024640723,0.000079683785,0.000017217668],"category_scores_gemma":[0.00023470269,0.000109188935,0.0001405024,0.0010784927,0.000032416116,0.0005583107,0.00013375598,0.0000852296,5.368084e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009435114,0.00009067789,0.00004106168,0.000016970447,0.00026624405,0.0000012678149,0.00053443055,0.7004427,0.00004208143,0.28298932,0.0010057449,0.01447518],"study_design_scores_gemma":[0.0017391365,0.00022537188,0.00018344434,0.000047640653,0.00014222033,0.000004172382,0.0002543391,0.99336666,0.000071876595,0.0031829488,0.00066258287,0.00011958336],"about_ca_topic_score_codex":0.000010657281,"about_ca_topic_score_gemma":0.0000012516854,"teacher_disagreement_score":0.29292402,"about_ca_system_score_codex":0.000066562054,"about_ca_system_score_gemma":0.000074933945,"threshold_uncertainty_score":0.44525954},"labels":[],"label_agreement":null},{"id":"W4322761535","doi":"10.18280/mmep.100124","title":"A New Iterative Sequence of (λ, ρ)-Firmly Nonexpansive Multi-Valued Mappings in Modular Function Spaces with Applications","year":2023,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Modular design; Sequence (biology); Function (biology); Computer science; Mathematics; Programming language; Chemistry","score_opus":0.03206823886724831,"score_gpt":0.22759822589540085,"score_spread":0.19552998702815255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322761535","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031722651,0.000032463155,0.9962466,0.00019922518,0.0000096959575,0.00018507386,0.0000015344142,0.00012288611,0.000030302333],"genre_scores_gemma":[0.30356193,0.000023637618,0.6961916,0.000010908771,0.0000084372605,0.000062589,0.000006276929,0.0000081687385,0.00012643733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992704,0.0000097309685,0.00021396395,0.00021643365,0.00015520012,0.00013427853],"domain_scores_gemma":[0.9996187,0.000053264554,0.000053080075,0.00014198669,0.00007129738,0.00006163848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015913407,0.00010204206,0.00016835083,0.00020852558,0.000039470793,0.000063018575,0.000115498224,0.00003818151,0.000002668435],"category_scores_gemma":[0.000011704422,0.00008500687,0.000024076575,0.0008555281,0.000016983793,0.00020001312,0.000035394572,0.000075392854,0.000007808115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012186786,0.000016793456,0.000011173834,0.000094613664,0.000016677672,4.3575608e-7,0.0015374457,0.8369957,0.00039251655,0.16080289,0.000001439021,0.00012909033],"study_design_scores_gemma":[0.00019351614,0.00002569573,0.000027802425,0.0001293624,0.000010170869,0.0000019532235,0.000039894694,0.986502,0.00005351501,0.012893596,0.000022678742,0.00009983326],"about_ca_topic_score_codex":0.000025385121,"about_ca_topic_score_gemma":0.000001115526,"teacher_disagreement_score":0.30038968,"about_ca_system_score_codex":0.0000139957065,"about_ca_system_score_gemma":0.000021498283,"threshold_uncertainty_score":0.34664795},"labels":[],"label_agreement":null},{"id":"W4323314127","doi":"10.3390/axioms12030271","title":"Strong and Δ-Convergence Fixed-Point Theorems Using Noor Iterations","year":2023,"lang":"en","type":"article","venue":"Axioms","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Majmaah University","keywords":"Banach space; Generalization; Mathematics; Fixed point; Uniformly convex space; Regular polygon; Convergence (economics); Fixed-point theorem; Iterative and incremental development; Pure mathematics; Extension (predicate logic); Applied mathematics; Discrete mathematics; Mathematical analysis; Computer science; Lp space; Eberlein–Šmulian theorem","score_opus":0.026749327036182227,"score_gpt":0.2722810483164442,"score_spread":0.24553172128026196,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323314127","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022684498,0.000016545244,0.9749828,0.0015581452,0.00015746916,0.000044572498,0.0000033393871,0.000114133836,0.00043850753],"genre_scores_gemma":[0.98647916,0.000016521451,0.012692956,0.00021164179,0.000040369847,0.0000041435455,0.000010813671,0.0000039019806,0.0005404913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942136,0.000028338465,0.000119524884,0.00018710656,0.00012826947,0.00011540779],"domain_scores_gemma":[0.99962866,0.000051123236,0.000038852515,0.00017284651,0.000058999136,0.000049533137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015346533,0.000058509406,0.00006516925,0.00012542907,0.00017322353,0.00015176044,0.00016765489,0.000021325006,0.00008752517],"category_scores_gemma":[0.000029814897,0.000052449872,0.000029883433,0.000750824,0.000022092285,0.0004120436,0.00011028762,0.00003393172,0.000096757176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.524639e-7,0.000012706083,0.0005940329,0.0000034088614,0.00002290914,0.0000031760883,0.00093368784,0.027243856,0.00078953535,0.96850127,0.00019472787,0.0016999352],"study_design_scores_gemma":[0.00007192114,0.000006912954,0.0030349079,0.000003902233,0.000005823456,0.0000029373903,0.000044916003,0.99384475,0.0001530704,0.0026049549,0.00015594663,0.00006996484],"about_ca_topic_score_codex":0.000036916317,"about_ca_topic_score_gemma":0.0000063770012,"teacher_disagreement_score":0.9666009,"about_ca_system_score_codex":0.000012227079,"about_ca_system_score_gemma":0.000025937237,"threshold_uncertainty_score":0.21388437},"labels":[],"label_agreement":null},{"id":"W4323364238","doi":"10.48550/arxiv.2106.11547","title":"On the Douglas-Rachford algorithm for solving possibly inconsistent optimization problems","year":2021,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Disjoint sets; Generality; Sequence (biology); Algorithm; Shadow (psychology); Mathematics; Limit (mathematics); Regular polygon; Perturbation (astronomy); Convergence (economics); Limit point; Displacement (psychology); Optimization problem; Computer science; Mathematical optimization; Combinatorics; Mathematical analysis; Geometry","score_opus":0.06262726780689454,"score_gpt":0.18328688591734543,"score_spread":0.1206596181104509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323364238","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00078806194,0.000028371953,0.99613243,0.0010464238,0.0005387944,0.00047694356,0.000020370573,0.0001254074,0.0008431731],"genre_scores_gemma":[0.71030635,0.00025386238,0.28341305,0.0012899092,0.00019384472,0.0000214477,0.00033229362,0.00003885303,0.004150385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836427,0.00012373706,0.00025322687,0.0008721902,0.00014440728,0.00024219489],"domain_scores_gemma":[0.99778473,0.00034958607,0.00034779205,0.0008510332,0.00057445484,0.00009238179],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036680882,0.0002550669,0.0002623508,0.00024154573,0.0004296714,0.000507433,0.0011279214,0.00018867863,0.0000818412],"category_scores_gemma":[0.00009474689,0.00022718239,0.00033976848,0.00082459446,0.000045950328,0.00035590905,0.0009163482,0.00029618872,0.000011058273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003348639,0.00007267017,0.000028024206,0.000017205533,0.00012477422,0.0000071723243,0.0001453127,0.80962723,0.0000010109665,0.18928422,0.00015471576,0.00053428486],"study_design_scores_gemma":[0.00029644748,0.00003360858,0.000038058377,0.000071706694,0.00009500504,0.0000014475712,0.00008946477,0.98363864,0.0000152225,0.015351744,0.00010291195,0.00026572225],"about_ca_topic_score_codex":0.000060962106,"about_ca_topic_score_gemma":0.000025235802,"teacher_disagreement_score":0.7127194,"about_ca_system_score_codex":0.00019029086,"about_ca_system_score_gemma":0.00028152432,"threshold_uncertainty_score":0.9264229},"labels":[],"label_agreement":null},{"id":"W4323555942","doi":"10.48550/arxiv.2303.02282","title":"Every proximal mapping is a resolvent of level proximal subdifferential","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subderivative; Resolvent; Mathematics; Pure mathematics; Function (biology); Representation (politics); Mathematical analysis; Geometry; Regular polygon; Convex optimization","score_opus":0.17839428254559359,"score_gpt":0.2078219580515841,"score_spread":0.029427675505990514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4323555942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05255917,0.000010415349,0.94571555,0.00044447146,0.00034908272,0.000264865,0.00007207764,0.00018038311,0.00040398314],"genre_scores_gemma":[0.9834412,0.000044182027,0.01019927,0.00007467994,0.00007370983,0.0000020160458,0.000055312627,0.000017057871,0.0060925684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99809813,0.00011421054,0.00034017657,0.00095274835,0.0002189763,0.0002757391],"domain_scores_gemma":[0.99824893,0.00006679606,0.0004209167,0.00080415624,0.00034559588,0.00011357773],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00024629897,0.00025604098,0.00038496192,0.00057386776,0.0001240588,0.00009702706,0.0013609037,0.00022179572,0.000093441595],"category_scores_gemma":[0.000038179274,0.00028843433,0.00037337025,0.0011140186,0.000063925574,0.00028177546,0.0020418637,0.0003247657,0.00006755871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010581132,0.00059355464,0.019867236,0.00049791334,0.0011131932,0.0001796227,0.001654657,0.41358247,0.00025790863,0.55947423,0.0022740213,0.00039938808],"study_design_scores_gemma":[0.0003889052,0.000028510172,0.015190241,0.00009483894,0.00008994656,0.0000010735645,0.000047106936,0.9601849,0.00024165632,0.023313195,0.00009349612,0.00032617187],"about_ca_topic_score_codex":0.00020098226,"about_ca_topic_score_gemma":0.000023444749,"teacher_disagreement_score":0.9355163,"about_ca_system_score_codex":0.00013808752,"about_ca_system_score_gemma":0.00030421463,"threshold_uncertainty_score":0.9999568},"labels":[],"label_agreement":null},{"id":"W4328023177","doi":"10.3934/naco.2023011","title":"Optimality conditions and constraint qualifications for cardinality constrained optimization problems","year":2023,"lang":"en","type":"article","venue":"Numerical Algebra Control and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Linear subspace; Cardinality (data modeling); Mathematics; Constraint (computer-aided design); Subspace topology; Bounded function; Feasible region; Mathematical optimization; Metric (unit); Set (abstract data type); Computer science; Pure mathematics","score_opus":0.017974784800389075,"score_gpt":0.2632299106870835,"score_spread":0.24525512588669443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4328023177","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017449856,0.00006140746,0.98803973,0.009952437,0.00009283482,0.000742778,0.00018963222,0.00041231303,0.00033435988],"genre_scores_gemma":[0.65342605,0.00018276105,0.3443646,0.0008461869,0.000066823144,0.00023230982,0.00076031056,0.000018861881,0.00010208301],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981322,0.00018237624,0.0005281435,0.00060100795,0.00025173614,0.00030451294],"domain_scores_gemma":[0.99832255,0.00051224325,0.00022918629,0.000269013,0.00044754145,0.00021946777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060886383,0.00021852525,0.00035866862,0.00023005351,0.00056846306,0.00033727367,0.00019459026,0.00012465098,0.000057736295],"category_scores_gemma":[0.00029050652,0.0002106224,0.00010669854,0.0010121342,0.0001809933,0.0006094166,0.00006597816,0.00009323748,0.000005848096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011071158,0.000048671776,0.0003676475,0.000022086266,0.00007617801,4.782991e-7,0.00012518004,0.8640553,0.00002992838,0.1339877,0.00016107941,0.0011147178],"study_design_scores_gemma":[0.0014616188,0.00006789535,0.0013006801,0.000010117206,0.00008641396,0.000009060723,0.00006838741,0.9926484,0.0000050543404,0.003834442,0.0002550021,0.00025288368],"about_ca_topic_score_codex":0.000026195503,"about_ca_topic_score_gemma":0.0000013868589,"teacher_disagreement_score":0.6532515,"about_ca_system_score_codex":0.000034746772,"about_ca_system_score_gemma":0.00009280741,"threshold_uncertainty_score":0.8588932},"labels":[],"label_agreement":null},{"id":"W4365402337","doi":"10.24193/fpt-ro.2022.2.20","title":"Strong convergence theorem for a general system of variational inequalities, equilibrium problems, and fixed point problems","year":2022,"lang":"en","type":"article","venue":"Fixed Point Theory","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"University of Alberta","keywords":"Mathematics; Variational inequality; Convergence (economics); Fixed point; Mathematical economics; Fixed-point theorem; Applied mathematics; Inequality; Mathematical optimization; Pure mathematics; Mathematical analysis; Economics","score_opus":0.020969829220602525,"score_gpt":0.22721610150749103,"score_spread":0.2062462722868885,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365402337","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045039384,0.00017916907,0.99216485,0.0009065044,0.00035555774,0.0006365251,0.00030604468,0.00012898618,0.00081843743],"genre_scores_gemma":[0.945551,0.000005412569,0.051848777,0.0002963645,0.00010343639,0.0004101106,0.0002580351,0.000023182527,0.0015036991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975444,0.00067393953,0.000614532,0.00044365146,0.00044975907,0.00027370232],"domain_scores_gemma":[0.9983351,0.00052861136,0.00041081815,0.00037949876,0.000255434,0.000090527865],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026741636,0.00018285114,0.00031044977,0.00019878178,0.000266678,0.00008218571,0.0005571973,0.000046527104,0.00037452867],"category_scores_gemma":[0.00012119687,0.0001726125,0.00013263665,0.0004318837,0.000061464205,0.00038784838,0.00048496856,0.00011975771,0.000003692668],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040976032,0.000067812805,0.00014667322,0.00014847865,0.000093844465,6.1523394e-7,0.001865758,0.055422567,0.00069472357,0.9410762,0.00026565665,0.00017670104],"study_design_scores_gemma":[0.00083101407,0.00016853199,0.0003434362,0.000029478058,0.000041279967,0.000017983866,0.00049229164,0.8791719,0.00023652447,0.11746055,0.00096284616,0.00024415407],"about_ca_topic_score_codex":0.00005069069,"about_ca_topic_score_gemma":0.000002950233,"teacher_disagreement_score":0.9410471,"about_ca_system_score_codex":0.00013000074,"about_ca_system_score_gemma":0.00020763953,"threshold_uncertainty_score":0.70389336},"labels":[],"label_agreement":null},{"id":"W4365453787","doi":"10.1002/mma.9247","title":"A modified Ishikawa iteration scheme for <i>b</i>‐enriched nonexpansive mapping to solve split variational inclusion problem and fixed point problem in Hilbert spaces","year":2023,"lang":"en","type":"article","venue":"Mathematical Methods in the Applied Sciences","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Hilbert space; Mathematics; Scheme (mathematics); Convergence (economics); Fixed point; Applied mathematics; Iterative method; Mathematical optimization; Mathematical analysis","score_opus":0.06611859151660801,"score_gpt":0.35838853631239037,"score_spread":0.2922699447957824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4365453787","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002918259,0.000008205012,0.97391534,0.019421486,0.000031350035,0.001176187,0.0000022595118,0.0000635955,0.0024633366],"genre_scores_gemma":[0.03934453,0.00000289048,0.95851123,0.0014089831,0.00002808497,0.0006502873,0.0000063751604,0.0000064873752,0.00004111911],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766946,0.00022965515,0.0005840303,0.00058626704,0.0005841856,0.00034639245],"domain_scores_gemma":[0.99677867,0.0026392795,0.00016663189,0.00024404979,0.00010122471,0.00007012256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0093797045,0.00017215525,0.00031022777,0.0005439281,0.0005081625,0.00047999574,0.00082892907,0.00007598662,0.0000098025075],"category_scores_gemma":[0.00063734065,0.00011908792,0.000051618896,0.0034808756,0.00008595204,0.00038458183,0.0007379255,0.00012274784,0.000009839897],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008651437,0.00007941087,0.000018423854,0.000054892906,0.000008644427,5.302594e-7,0.018649094,0.024259258,0.007177516,0.94734436,0.00006531746,0.002333888],"study_design_scores_gemma":[0.00018535044,0.000023250752,0.00019604752,0.000024819625,0.000003413649,0.000001297474,0.00046693606,0.5256303,0.00012631109,0.47321385,0.00003118105,0.00009723124],"about_ca_topic_score_codex":0.000011391297,"about_ca_topic_score_gemma":0.000008636062,"teacher_disagreement_score":0.501371,"about_ca_system_score_codex":0.000052640597,"about_ca_system_score_gemma":0.00008336947,"threshold_uncertainty_score":0.48562643},"labels":[],"label_agreement":null},{"id":"W4366524444","doi":"10.1287/moor.2023.1366","title":"Sensitivity Analysis of the Maximal Value Function with Applications in Nonconvex Minimax Programs","year":2023,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Minimax; Mathematics; Sensitivity (control systems); Function (biology); Mathematical economics; Duality (order theory); Maximization; Value (mathematics); Mathematical optimization; Bellman equation; Applied mathematics; Combinatorics; Statistics","score_opus":0.0643395731625063,"score_gpt":0.34800617114357185,"score_spread":0.2836665979810655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366524444","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14803828,0.000004805122,0.8491558,0.0013893006,0.000010902016,0.0005796467,0.000012069753,0.00003269784,0.0007764975],"genre_scores_gemma":[0.94162124,0.0000050376975,0.057792753,0.000007909841,0.000006006068,0.00012492694,0.00003824723,0.0000049211662,0.0003989467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840224,0.00020444716,0.00032667755,0.00019801591,0.00071761553,0.00015100915],"domain_scores_gemma":[0.99829286,0.00031391124,0.0000590539,0.0005817617,0.0007204091,0.000032008305],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016136621,0.000065710075,0.00019919603,0.0008934617,0.00018912424,0.00008382015,0.00035755202,0.000036962665,0.000017913577],"category_scores_gemma":[0.00013094234,0.00004343592,0.000089485104,0.012005079,0.00011366449,0.00018696426,0.00017731987,0.00011504788,0.000010448893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000033163435,0.00044762998,0.007182551,0.00004364087,0.00026667278,5.1842085e-7,0.0017454022,0.58159417,0.0008379816,0.40734518,0.000022229731,0.0005107444],"study_design_scores_gemma":[0.00009425604,0.000032135147,0.02963616,0.00001377448,0.00006808131,4.270108e-7,0.0004392354,0.96817636,0.00037573726,0.0010960982,0.000021767708,0.00004594149],"about_ca_topic_score_codex":0.00018899508,"about_ca_topic_score_gemma":0.0008892576,"teacher_disagreement_score":0.793583,"about_ca_system_score_codex":0.000034563647,"about_ca_system_score_gemma":0.00015987392,"threshold_uncertainty_score":0.5768042},"labels":[],"label_agreement":null},{"id":"W4380609297","doi":"10.1137/22m1483165","title":"The Splitting Algorithms by Ryu, by Malitsky–Tam, and by Campoy Applied to Normal Cones of Linear Subspaces Converge Strongly to the Projection onto the Intersection","year":2023,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Linear subspace; Intersection (aeronautics); Convexity; Monotone polygon; Convergence (economics); Projection (relational algebra); Monotonic function; Operator (biology); Algorithm; Mathematical optimization; Pure mathematics; Mathematical analysis","score_opus":0.007490345301454423,"score_gpt":0.237609898501728,"score_spread":0.23011955320027358,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380609297","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0089372285,0.000063936175,0.9731783,0.01666451,0.00043889883,0.00041755007,0.000023928693,0.000057442023,0.00021819453],"genre_scores_gemma":[0.9556527,0.00090999913,0.03527198,0.0023145,0.0006068079,0.00014775612,0.00017974575,0.00005791863,0.0048585795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998392,0.00019855019,0.00042659463,0.00025577212,0.00049699604,0.00023008113],"domain_scores_gemma":[0.9988038,0.0002338905,0.00034374575,0.00021520306,0.00030314442,0.000100205754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012562167,0.00015354305,0.00014943637,0.000116356,0.0009860218,0.00044461907,0.00043025348,0.000056877212,0.00001729985],"category_scores_gemma":[0.000118062984,0.00008666051,0.00006004057,0.0011383748,0.00003938417,0.0003332706,0.000108768465,0.000200608,0.000013440931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000083280494,0.000040486648,0.00022942002,0.0000049904634,0.00007757141,2.5196718e-7,0.0020128181,0.9625424,0.00048381876,0.0024804508,0.028555226,0.0034892554],"study_design_scores_gemma":[0.00030839877,0.00019989516,0.00026347808,0.000016001119,0.000023047018,0.000008671835,0.0013098343,0.9888325,0.00088022626,0.000028685246,0.008003573,0.00012571484],"about_ca_topic_score_codex":0.00008258871,"about_ca_topic_score_gemma":0.000027363385,"teacher_disagreement_score":0.9467155,"about_ca_system_score_codex":0.00008415698,"about_ca_system_score_gemma":0.00005129853,"threshold_uncertainty_score":0.7583782},"labels":[],"label_agreement":null},{"id":"W4380738747","doi":"10.20944/preprints202306.1147.v1","title":"On the Sub Convexlike Optimization Problems","year":2023,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saskatchewan Polytechnic","funders":"","keywords":"Vector optimization; Lagrangian; Saddle point; Locally convex topological vector space; Mathematics; Set (abstract data type); Optimization problem; Regular polygon; Point (geometry); Saddle; Mathematical optimization; Pure mathematics; Applied mathematics; Topological space; Topology (electrical circuits); Computer science; Combinatorics; Geometry; Multi-swarm optimization","score_opus":0.15182494756278495,"score_gpt":0.3172229888724547,"score_spread":0.16539804130966976,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4380738747","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009735321,0.000020170108,0.96045494,0.02071195,0.0011910772,0.00084372837,0.00001640364,0.00086278276,0.006163643],"genre_scores_gemma":[0.98216414,0.0003303161,0.008364998,0.0020350353,0.00019127277,0.0005010994,0.000185965,0.000061674495,0.006165465],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99722826,0.00027264905,0.0005044747,0.0010628965,0.00065567886,0.00027602055],"domain_scores_gemma":[0.99693185,0.00035086562,0.00041249325,0.0018543095,0.000350424,0.000100052275],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011087555,0.0003021168,0.00029110903,0.00025854137,0.00025416462,0.0001929092,0.0020004099,0.00023338036,0.00067762134],"category_scores_gemma":[0.0005020927,0.00023470238,0.00023703616,0.0007032942,0.000052691794,0.00017473119,0.0026000384,0.0006154955,0.00381438],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000029260939,0.00006371585,0.0055709025,0.00002473905,0.00011240949,0.0000019242918,0.00035493483,0.90662324,0.0000378115,0.08671983,0.00044047422,0.000047053447],"study_design_scores_gemma":[0.00013667718,0.000008988623,0.012982837,0.000080479724,0.000034150627,0.0000010984357,0.000010583781,0.9592596,0.00079458155,0.025873981,0.00050402334,0.00031294138],"about_ca_topic_score_codex":0.00007230537,"about_ca_topic_score_gemma":0.0000087087255,"teacher_disagreement_score":0.97242886,"about_ca_system_score_codex":0.00011124794,"about_ca_system_score_gemma":0.00019053937,"threshold_uncertainty_score":0.99696124},"labels":[],"label_agreement":null},{"id":"W4381489648","doi":"10.1007/s11075-023-01589-8","title":"Alternated inertial algorithms for split feasibility problems","year":2023,"lang":"en","type":"article","venue":"Numerical Algorithms","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Deblurring; Monotonic function; Algorithm; Mathematics; Theory of computation; Convergence (economics); Inertial frame of reference; Subsequence; Set (abstract data type); Hilbert space; Mathematical optimization; Image (mathematics); Image processing; Computer science; Image restoration; Artificial intelligence; Mathematical analysis","score_opus":0.06135734977768593,"score_gpt":0.31752046410624785,"score_spread":0.2561631143285619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4381489648","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00063124683,0.00001876576,0.9925344,0.0048907204,0.000506205,0.00039999807,0.00003481274,0.0006978126,0.00028604822],"genre_scores_gemma":[0.12286262,0.00004270592,0.86883795,0.0016141512,0.0008592333,0.00040580236,0.00043059047,0.000056127854,0.0048908405],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791986,0.00007052419,0.0004203829,0.0006722125,0.00048162622,0.00043537255],"domain_scores_gemma":[0.99875444,0.00017614645,0.00012261746,0.00044807876,0.00029728736,0.00020140392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044537237,0.00019253338,0.00028360228,0.00018296552,0.00020807967,0.0001949077,0.0007407455,0.00009012114,0.00008310557],"category_scores_gemma":[0.00016280707,0.00016601039,0.00020885236,0.0020528913,0.000035304096,0.00037544986,0.00021981656,0.00012339732,0.00031744785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010321259,0.0018670629,0.0066215075,0.00017361714,0.00072743057,0.00005698841,0.0017873456,0.21267349,0.0014458928,0.13219108,0.023129217,0.6192232],"study_design_scores_gemma":[0.00061081036,0.000094387,0.0041960916,0.0000048301245,0.000014176886,0.0000034720892,0.000006567715,0.9809114,0.00015010315,0.0057936735,0.0079878,0.0002267072],"about_ca_topic_score_codex":0.000101447746,"about_ca_topic_score_gemma":0.0000021122548,"teacher_disagreement_score":0.7682379,"about_ca_system_score_codex":0.00007897458,"about_ca_system_score_gemma":0.00008321895,"threshold_uncertainty_score":0.67697066},"labels":[],"label_agreement":null},{"id":"W4382789316","doi":"10.3390/math11132928","title":"On Sub Convexlike Optimization Problems","year":2023,"lang":"en","type":"article","venue":"Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saskatchewan Polytechnic","funders":"","keywords":"Vector optimization; Locally convex topological vector space; Lagrangian; Saddle point; Mathematics; Optimization problem; Set (abstract data type); Mathematical optimization; Regular polygon; Point (geometry); Saddle; Vector space; Applied mathematics; Pure mathematics; Topological space; Topology (electrical circuits); Computer science; Combinatorics; Geometry; Multi-swarm optimization","score_opus":0.021116247417683604,"score_gpt":0.233306876441692,"score_spread":0.2121906290240084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382789316","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005711984,0.0000026176426,0.9932109,0.0014061045,0.00009088236,0.00009361852,0.000001543211,0.00036189888,0.0042612436],"genre_scores_gemma":[0.14697614,0.000092681374,0.84418565,0.001530438,0.00008522351,0.000077559605,0.00010354449,0.000040243693,0.006908532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992764,0.000018025401,0.00017858022,0.0001514565,0.00025809574,0.000117471594],"domain_scores_gemma":[0.99940145,0.00012676712,0.000078400975,0.00027046454,0.000082151615,0.00004073951],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021177037,0.00007316895,0.000096006755,0.00016110703,0.00008560098,0.00011440912,0.00026883653,0.000032984055,0.00007502455],"category_scores_gemma":[0.00009215943,0.000062695326,0.000042464668,0.0009511949,0.0000091297225,0.00014559424,0.00006563841,0.00003956621,0.0008181066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[1.8082073e-7,0.00003902092,0.000007547277,0.0000142779945,0.000009441156,8.2548576e-7,0.000344212,0.6461227,0.000016702586,0.3513638,0.0019224245,0.00015886589],"study_design_scores_gemma":[0.000098591285,0.000015181361,0.00002715333,0.0000123347645,0.0000048264906,0.0000010387454,0.000011888363,0.96826816,0.000107305124,0.031186027,0.00019203607,0.00007544852],"about_ca_topic_score_codex":7.6498134e-7,"about_ca_topic_score_gemma":4.774925e-7,"teacher_disagreement_score":0.3221455,"about_ca_system_score_codex":0.000016766171,"about_ca_system_score_gemma":0.000019255176,"threshold_uncertainty_score":0.9999599},"labels":[],"label_agreement":null},{"id":"W4382937981","doi":"10.28924/2291-8639-21-2023-63","title":"Optimality Conditions for Set-Valued Optimization Problems","year":2023,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Saskatchewan Polytechnic","funders":"","keywords":"Chen; Mathematics; Set (abstract data type); Mathematical optimization; Optimization problem; Applied mathematics; Computer science","score_opus":0.023511048116961034,"score_gpt":0.32449497572046143,"score_spread":0.3009839276035004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382937981","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005211392,0.000031045667,0.9940986,0.0048087044,0.000078649944,0.00014831386,0.00007367733,0.000045786204,0.00019408896],"genre_scores_gemma":[0.7082445,0.00057809084,0.2884599,0.00060015114,0.00044810827,0.00020870246,0.0007562851,0.000015001743,0.0006892433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873585,0.000038177266,0.0005317543,0.00020248629,0.0003845697,0.000107143955],"domain_scores_gemma":[0.99771327,0.00016135348,0.0004709724,0.00017375033,0.0013883064,0.00009233989],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005525986,0.0000900394,0.00020922328,0.0009593678,0.0001717614,0.00025303586,0.0005645788,0.000041842566,0.000050167364],"category_scores_gemma":[0.00006820736,0.00008119071,0.00027956042,0.0019752542,0.00003336046,0.00047351114,0.000079512865,0.00006075435,0.000007765273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000045749903,0.0000680162,0.0008880037,0.000004059251,0.0013566873,7.9529167e-7,0.00012013751,0.87810886,0.0000878577,0.11682811,0.0006147669,0.0019181396],"study_design_scores_gemma":[0.00035177622,0.000022693921,0.0034784211,0.0000052137293,0.00038423744,0.000007878911,0.0000491979,0.98312974,0.000055860346,0.008030774,0.004386621,0.00009761196],"about_ca_topic_score_codex":0.00001004907,"about_ca_topic_score_gemma":0.0000054106413,"teacher_disagreement_score":0.7077234,"about_ca_system_score_codex":0.000037882426,"about_ca_system_score_gemma":0.00006566871,"threshold_uncertainty_score":0.3310861},"labels":[],"label_agreement":null},{"id":"W4382987540","doi":"10.28924/2291-8639-21-2023-62","title":"Strong and ∆-Convergence of a New Iteration for Common Fixed Points of Two Asymptotically Nonexpansive Mappings","year":2023,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fixed point; Convergence (economics); Fixed-point iteration; Table (database); Applied mathematics; Pure mathematics; Mathematical analysis; Computer science","score_opus":0.015773889115669543,"score_gpt":0.3136478461550535,"score_spread":0.2978739570393839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4382987540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027772354,0.000041229123,0.9687147,0.003272305,0.00003379113,0.000082293176,0.000023662506,0.000006721146,0.00005293075],"genre_scores_gemma":[0.949039,0.00015090441,0.050494798,0.000109519424,0.000076340606,0.000007755377,0.000035608016,0.000003012214,0.00008307243],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989074,0.000019989026,0.00055752805,0.00013751199,0.0003135961,0.00006396778],"domain_scores_gemma":[0.9979694,0.00018736385,0.0005986393,0.000114123926,0.0010690511,0.000061451225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030823043,0.0000677132,0.00024004235,0.00054478156,0.000045924688,0.00006960972,0.00033006017,0.000025478976,0.000019166799],"category_scores_gemma":[0.000054612276,0.00006121776,0.00016159682,0.0009426643,0.00003590595,0.0003177109,0.000074798874,0.00004350767,0.000001067375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000061328,0.00023918545,0.040924232,0.000036368117,0.0041642836,0.0000018211413,0.0013757504,0.04987157,0.008809606,0.8587931,0.0005893541,0.035133447],"study_design_scores_gemma":[0.0011621531,0.0000929413,0.06288799,0.000038318623,0.00071893184,0.000010087085,0.0001615898,0.89827216,0.002800304,0.032726504,0.0009761304,0.00015290517],"about_ca_topic_score_codex":0.00004556392,"about_ca_topic_score_gemma":0.000022498081,"teacher_disagreement_score":0.9212666,"about_ca_system_score_codex":0.0000137760935,"about_ca_system_score_gemma":0.00006381949,"threshold_uncertainty_score":0.24963878},"labels":[],"label_agreement":null},{"id":"W4384567367","doi":"10.23952/jnva.7.2023.3.09","title":"A new inertial relaxed Tseng extrgradient method for solving quasi-monotone bilevel variational inequality problems in Hilbert spaces","year":2023,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monotone polygon; Inertial frame of reference; Hilbert space; Variational inequality; Mathematics; Inequality; Applied mathematics; Pure mathematics; Mathematical economics; Mathematical optimization; Mathematical analysis; Physics; Geometry; Classical mechanics","score_opus":0.031817443199348656,"score_gpt":0.31318169149884323,"score_spread":0.2813642482994946,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384567367","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026772441,0.00007167461,0.98422027,0.012618123,0.00016757831,0.00015117013,0.000038225116,0.00002999062,0.000025739206],"genre_scores_gemma":[0.12162396,0.00010832975,0.8766533,0.00036237467,0.00058230717,0.000017525317,0.00017403511,0.000014852489,0.0004632999],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971138,0.0002106352,0.001240771,0.00040223068,0.0007612666,0.00027127797],"domain_scores_gemma":[0.9967904,0.0011880699,0.00086100557,0.00020306699,0.0007499622,0.00020748116],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030083505,0.00020695783,0.0006228738,0.0018464018,0.00018540124,0.00025808788,0.0003961571,0.00011837645,0.000072325434],"category_scores_gemma":[0.00077497377,0.00017579441,0.00045637944,0.0043799984,0.000014603885,0.00077425584,0.00012185307,0.0002000258,0.0000049363493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008082101,0.000400629,0.024014644,0.00003229071,0.0022065837,0.000006514977,0.001782545,0.8759984,0.00047849896,0.09032988,0.0005827514,0.0040864567],"study_design_scores_gemma":[0.0011069672,0.00008807198,0.08966972,0.00001706372,0.00042480146,0.000008869626,0.00003306534,0.89474237,0.000014236475,0.012938528,0.0007706888,0.00018565104],"about_ca_topic_score_codex":0.00045792633,"about_ca_topic_score_gemma":0.00027888484,"teacher_disagreement_score":0.118946716,"about_ca_system_score_codex":0.00011401788,"about_ca_system_score_gemma":0.00045705136,"threshold_uncertainty_score":0.7168688},"labels":[],"label_agreement":null},{"id":"W4384568992","doi":"10.23952/asvao.5.2023.1.08","title":"Connectedness properties of efficient and minimal sets to vector optimization problems","year":2023,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Social connectedness; Vector (molecular biology); Mathematics; Computer science; Mathematical optimization; Psychology; Social psychology; Biology; Genetics","score_opus":0.018781851817287698,"score_gpt":0.23066566344164047,"score_spread":0.21188381162435277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384568992","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034410875,0.00005038526,0.9642203,0.0006219868,0.000038309383,0.00035883457,0.000015664637,0.00016100578,0.00012266324],"genre_scores_gemma":[0.8463426,0.000091090005,0.15307747,0.00013396057,0.000016253816,0.000059986694,0.00019235116,0.0000145915765,0.00007168758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99817574,0.00008096124,0.00050493417,0.0005917975,0.00041395053,0.00023264607],"domain_scores_gemma":[0.9989181,0.000054363834,0.00023806101,0.00031152638,0.00033050857,0.00014743162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004560428,0.00020627335,0.000423848,0.0010141983,0.0002386052,0.0002133439,0.00022978162,0.000090719775,0.0000332079],"category_scores_gemma":[0.00007286478,0.00018129054,0.0000840712,0.005617151,0.000052950454,0.00018492046,0.00020130706,0.00005668493,0.0000060787042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015362888,0.000044130324,0.00022480827,0.00003400481,0.00027935742,3.3387002e-7,0.001374264,0.9888537,0.0005665262,0.008124346,0.000025090414,0.00045810736],"study_design_scores_gemma":[0.00035774257,0.000034235814,0.001420526,0.000015471383,0.00034331484,6.814935e-7,0.00017010522,0.9968358,0.0005506853,0.000036908397,0.000010366853,0.0002241203],"about_ca_topic_score_codex":0.00004496212,"about_ca_topic_score_gemma":0.000010430059,"teacher_disagreement_score":0.8119317,"about_ca_system_score_codex":0.000026719634,"about_ca_system_score_gemma":0.00004385583,"threshold_uncertainty_score":0.73928136},"labels":[],"label_agreement":null},{"id":"W4384568994","doi":"10.23952/asvao.5.2023.1.01","title":"Characterization of solution sets of geodesic convex semi-infinite programming on Riemannian manifolds","year":2023,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Characterization (materials science); Geodesic; Mathematics; Regular polygon; Geodesic map; Pure mathematics; Mathematical analysis; Geometry; Materials science","score_opus":0.015798636324246888,"score_gpt":0.24339891762637691,"score_spread":0.22760028130213003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384568994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036864858,0.000005834447,0.9621119,0.0002445873,0.00003885607,0.00023868296,0.000025685229,0.0001313841,0.00033823543],"genre_scores_gemma":[0.9476576,0.00012402689,0.050423834,0.00009636069,0.000020947757,0.000029963296,0.0015317631,0.0000143064135,0.00010118548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808556,0.0000952028,0.00064740423,0.00046531396,0.0004895824,0.00021691536],"domain_scores_gemma":[0.9985527,0.000075253374,0.00061599736,0.0003831654,0.00029133807,0.00008157769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005857629,0.00019439247,0.00046573652,0.0011558182,0.00017660152,0.00009749909,0.00024579724,0.000121653946,0.000045212048],"category_scores_gemma":[0.000032674612,0.00018962503,0.00016259444,0.0052900524,0.000051391133,0.00029436906,0.00009605986,0.000071018236,0.000008891498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022974282,0.00008657987,0.0014654867,0.000046791483,0.0005474834,5.40532e-7,0.00069455843,0.95286566,0.004183193,0.035729438,0.000012833243,0.0043444675],"study_design_scores_gemma":[0.00035050782,0.0000458104,0.01200351,0.000014952122,0.0004320832,3.3612534e-7,0.000046654935,0.9846218,0.0020827604,0.00019536568,0.000026891483,0.00017932961],"about_ca_topic_score_codex":0.00004097548,"about_ca_topic_score_gemma":0.000010527005,"teacher_disagreement_score":0.911688,"about_ca_system_score_codex":0.000028224305,"about_ca_system_score_gemma":0.000039291725,"threshold_uncertainty_score":0.77326846},"labels":[],"label_agreement":null},{"id":"W4384568996","doi":"10.23952/asvao.5.2023.1.07","title":"Modified forward-backward splitting method for split equilibrium, variational inclusion, and fixed point problems","year":2023,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Inyuvesi Yakwazulu-Natali; National Research Foundation","keywords":"Fixed point; Inclusion (mineral); Mathematics; Fixed-point theorem; Point (geometry); Applied mathematics; Mathematical analysis; Physics; Geometry; Thermodynamics","score_opus":0.018749994680958393,"score_gpt":0.2732119802542857,"score_spread":0.25446198557332733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384568996","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006696829,0.000040745635,0.9956851,0.0023405526,0.000048246708,0.00053361116,0.000040888368,0.00026348553,0.0003776607],"genre_scores_gemma":[0.102101885,0.0000914275,0.89523053,0.00057580887,0.000084788924,0.00017610448,0.0013843647,0.000027288559,0.00032780494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99732244,0.00013083158,0.00071736664,0.0009242786,0.0005354248,0.00036967968],"domain_scores_gemma":[0.9982097,0.00042304755,0.00039953514,0.00040457633,0.0003804236,0.00018272734],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0019486386,0.00028838025,0.0005452598,0.00094640243,0.0008239989,0.0004398119,0.00034893482,0.00016145162,0.000045813293],"category_scores_gemma":[0.00015495048,0.00027160556,0.00020961084,0.0040259506,0.000036568443,0.0005007449,0.0007801176,0.00010161544,0.000005521562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015617868,0.000027160639,0.00011687991,0.000030770967,0.0004941288,2.8409772e-7,0.0008479372,0.835926,0.00019345466,0.15984952,0.000110447196,0.002387799],"study_design_scores_gemma":[0.00083404005,0.000026788439,0.00086462614,0.000007286209,0.00066353136,0.0000011646414,0.00006763207,0.9784074,0.00006905046,0.018618645,0.00012288403,0.00031694703],"about_ca_topic_score_codex":0.00005593107,"about_ca_topic_score_gemma":0.000011513885,"teacher_disagreement_score":0.14248142,"about_ca_system_score_codex":0.0000536378,"about_ca_system_score_gemma":0.00007130941,"threshold_uncertainty_score":0.9999736},"labels":[],"label_agreement":null},{"id":"W4384569020","doi":"10.23952/asvao.5.2023.1.05","title":"Nonsmooth interval-valued multiobjective optimization problems and generalized variational inequalities on Hadamard manifolds","year":2023,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; National Natural Science Foundation of China; European Commission","keywords":"Hadamard transform; Interval (graph theory); Mathematics; Variational inequality; Applied mathematics; Mathematical optimization; Multi-objective optimization; Inequality; Mathematical analysis; Combinatorics","score_opus":0.022445043960167735,"score_gpt":0.25165177957149326,"score_spread":0.22920673561132554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384569020","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017995547,0.000028477585,0.99537355,0.0008595807,0.00008748599,0.00042451915,0.00004640871,0.0003734422,0.0010069804],"genre_scores_gemma":[0.42832276,0.0005397081,0.56613857,0.0010210678,0.00013192745,0.00023548264,0.0026833913,0.000053352695,0.0008737264],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99688625,0.00031619563,0.0007412714,0.000987036,0.00070736045,0.00036190683],"domain_scores_gemma":[0.99832034,0.00023000663,0.00043613688,0.00045568988,0.00038133247,0.00017650104],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010828613,0.00038939965,0.00059939624,0.001545709,0.0005790386,0.0006341047,0.0003194886,0.00019210423,0.00014375718],"category_scores_gemma":[0.000116298004,0.00036490164,0.0001860023,0.0044635553,0.00007153658,0.00060924754,0.00023483283,0.0001502259,0.000019480154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028902903,0.00006151766,0.0005267703,0.000017035734,0.000722063,8.702426e-7,0.0011174603,0.86771244,0.000026414975,0.12921754,0.00008935879,0.0004796098],"study_design_scores_gemma":[0.0011038248,0.00005604412,0.0038836473,0.000014053938,0.0005556046,0.0000014384613,0.00016997861,0.99220663,0.00003960923,0.0015082416,0.000040100094,0.00042083388],"about_ca_topic_score_codex":0.00019844635,"about_ca_topic_score_gemma":0.000062017,"teacher_disagreement_score":0.42923495,"about_ca_system_score_codex":0.00009732505,"about_ca_system_score_gemma":0.000063429376,"threshold_uncertainty_score":0.9998803},"labels":[],"label_agreement":null},{"id":"W4384574966","doi":"10.23952/jano.5.2023.2.06","title":"Iterative solutions of split fixed point and monotone inclusion problems in Hilbert spaces","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation","keywords":"Fixed point; Lipschitz continuity; Monotone polygon; Mathematics; Hilbert space; Spectral radius; Convergence (economics); Strongly monotone; Fixed-point theorem; Operator (biology); Applied mathematics; Iterative method; Computation; Bounded function; Discrete mathematics; Pure mathematics; Mathematical optimization; Mathematical analysis; Algorithm","score_opus":0.011545052402500398,"score_gpt":0.22943313813430838,"score_spread":0.21788808573180798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384574966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066063986,0.00007382326,0.98936874,0.003468221,0.000033604032,0.00010110598,0.0000014706148,0.000013991782,0.0003326703],"genre_scores_gemma":[0.8623703,0.00038294512,0.13705462,0.00012779362,0.000022268023,0.000004119578,0.00000774108,0.0000048174816,0.000025402675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990875,0.000037219706,0.00041507947,0.00013441699,0.00022185034,0.00010389894],"domain_scores_gemma":[0.99930483,0.000100823694,0.0003173009,0.00006801191,0.00014193974,0.00006706839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003854636,0.00007984197,0.00022348958,0.00034073708,0.00012404584,0.000057277484,0.0001114411,0.000045666224,0.000011589291],"category_scores_gemma":[0.000040259412,0.00006453729,0.00003416832,0.000912262,0.000029801355,0.00035029315,0.0002522574,0.00008569622,7.952002e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002372623,0.000071238755,0.00030716535,0.000012083058,0.000021450827,0.0000011497427,0.0021705492,0.96497715,0.00042577245,0.030087646,0.000059027327,0.001843045],"study_design_scores_gemma":[0.0004939084,0.00007623917,0.0025827978,0.000025549283,0.000012627346,0.0000048343954,0.000069070666,0.9906007,0.000093152594,0.005899741,0.00006971099,0.00007168926],"about_ca_topic_score_codex":0.0000099532,"about_ca_topic_score_gemma":9.1472873e-7,"teacher_disagreement_score":0.8557639,"about_ca_system_score_codex":0.000023834826,"about_ca_system_score_gemma":0.000033998374,"threshold_uncertainty_score":0.26317543},"labels":[],"label_agreement":null},{"id":"W4384574973","doi":"10.23952/jano.5.2023.2.07","title":"A note on the subdifferential of convex multi-composite functionals","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subderivative; Minimax; Mathematics; Regular polygon; Constraint (computer-aided design); Composite number; Convex analysis; Convex function; Mathematical optimization; Applied mathematics; Pure mathematics; Convex optimization; Geometry; Algorithm","score_opus":0.016859116991125394,"score_gpt":0.24352579363967303,"score_spread":0.22666667664854764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384574973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024583212,0.000008565016,0.99424946,0.0027727806,0.00011982528,0.00005942563,0.0000020755815,0.000018436986,0.00031107958],"genre_scores_gemma":[0.918653,0.00008527982,0.08055802,0.0005487836,0.00007683767,0.0000030240078,0.000008069848,0.0000063461594,0.000060630056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990783,0.000041345884,0.00035456897,0.00011104012,0.00032962626,0.00008515349],"domain_scores_gemma":[0.9990497,0.00024121752,0.00035916662,0.00010071163,0.0001923419,0.00005683453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027574235,0.00007963653,0.00018842595,0.00018140838,0.00010011733,0.000058223475,0.00019418023,0.000039918832,0.000054455086],"category_scores_gemma":[0.000042568274,0.00005017161,0.000080004334,0.00063772144,0.00002836646,0.00012344173,0.000048433518,0.00009922486,0.000008492031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007136722,0.00009675611,0.0000788844,0.000004512615,0.000054781547,9.3931345e-7,0.00021486996,0.9524127,0.0008516886,0.04422736,0.0002859563,0.0017001798],"study_design_scores_gemma":[0.000451422,0.00006493061,0.0031707508,0.000007983888,0.00002378922,0.0000031729194,0.000017150762,0.9945344,0.00061324163,0.00090015575,0.00015401767,0.000059030193],"about_ca_topic_score_codex":0.0000012765972,"about_ca_topic_score_gemma":4.792105e-8,"teacher_disagreement_score":0.9161947,"about_ca_system_score_codex":0.000012837566,"about_ca_system_score_gemma":0.000031459276,"threshold_uncertainty_score":0.2045939},"labels":[],"label_agreement":null},{"id":"W4384574993","doi":"10.23952/jano.5.2023.2.03","title":"Existence and stability to vector optimization problems via improvement sets","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Bộ Giáo dục và Ðào tạo","keywords":"Vector optimization; Optimization problem; Mathematical optimization; Stability (learning theory); Mathematics; Parametric statistics; Continuous optimization; Computer science; Applied mathematics; Multi-swarm optimization","score_opus":0.014264775075372974,"score_gpt":0.23458838648716213,"score_spread":0.22032361141178916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384574993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024466119,0.000017126253,0.99455506,0.0024316772,0.00009068474,0.0001932656,0.0000019668996,0.000050003153,0.00021358828],"genre_scores_gemma":[0.3514286,0.00016177716,0.64780784,0.0004984582,0.000051139363,0.00001325189,0.000012103405,0.000010616535,0.000016191243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873054,0.00003144318,0.0004698081,0.00025912304,0.00034878743,0.00016032558],"domain_scores_gemma":[0.99902457,0.00007738374,0.00028594604,0.00013751155,0.000270839,0.00020376647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045070873,0.00012457115,0.00023161409,0.00022580639,0.00013500756,0.00016526075,0.00018067243,0.0000526067,0.00003120161],"category_scores_gemma":[0.00005672649,0.000104398874,0.00004148911,0.0010137191,0.000022641956,0.0003959366,0.00012780665,0.00008948267,0.000003979382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026388225,0.000049100043,0.000065001754,0.0000150634905,0.000023060808,9.752882e-7,0.00043846198,0.98771733,0.00034701545,0.0033943937,0.00004616922,0.007877056],"study_design_scores_gemma":[0.00034839814,0.00018248706,0.0005285154,0.000009577535,0.000019490531,0.000005903475,0.000038175567,0.99726254,0.00021235058,0.0011723907,0.00009668456,0.0001234662],"about_ca_topic_score_codex":0.0000039591723,"about_ca_topic_score_gemma":2.2549871e-7,"teacher_disagreement_score":0.34898198,"about_ca_system_score_codex":0.00004592746,"about_ca_system_score_gemma":0.00004213633,"threshold_uncertainty_score":0.42572626},"labels":[],"label_agreement":null},{"id":"W4384574994","doi":"10.23952/asvao.5.2023.2.11","title":"Convergence of inexact iterates of an algorithm based on unions of nonexpansive mappings","year":2023,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Iterated function; Convergence (economics); Generalization; Mathematics; Bounded function; Set (abstract data type); Operator (biology); Metric (unit); Space (punctuation); Algorithm; Applied mathematics; Discrete mathematics; Computer science; Mathematical analysis","score_opus":0.010767045992957627,"score_gpt":0.243367399716307,"score_spread":0.23260035372334936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384574994","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006731201,0.00000603287,0.9926887,0.00013889285,0.000021309079,0.000115558905,0.0000601247,0.000037625035,0.00020051669],"genre_scores_gemma":[0.7441778,0.000044060947,0.2549701,0.00010359479,0.000008521748,0.000009105379,0.00064762007,0.0000070079086,0.00003217358],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832356,0.000105204985,0.00063405244,0.0003692361,0.0004419956,0.00012594527],"domain_scores_gemma":[0.99827397,0.0001453339,0.00056590367,0.00043017094,0.000513186,0.00007143175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050347624,0.00014550074,0.00047662517,0.0011273837,0.00008254945,0.000037295937,0.00029152434,0.00007203272,0.00009138747],"category_scores_gemma":[0.000044564727,0.00013179675,0.00014844917,0.005880774,0.00006412693,0.00021423197,0.000060045666,0.000050295504,0.0000020029593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009834035,0.00008421269,0.00045929805,0.000015968844,0.00025160934,3.0487365e-7,0.0003824115,0.9843508,0.000487334,0.012899584,0.000014631059,0.0010440208],"study_design_scores_gemma":[0.00033845252,0.00006719173,0.00285719,0.0000101842,0.0002795004,9.826469e-8,0.00013207257,0.9931024,0.0028333734,0.00025431314,0.0000041423605,0.00012113903],"about_ca_topic_score_codex":0.00007813627,"about_ca_topic_score_gemma":0.0000043363425,"teacher_disagreement_score":0.73771864,"about_ca_system_score_codex":0.000011922558,"about_ca_system_score_gemma":0.00005641722,"threshold_uncertainty_score":0.53745157},"labels":[],"label_agreement":null},{"id":"W4384575229","doi":"10.23952/asvao.5.2023.2.09","title":"On calmness of the optimal value function","year":2023,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Calmness; Mathematics; Quadratic equation; Function (biology); Parametric statistics; Context (archaeology); Applied mathematics; Compact space; Set (abstract data type); Mathematical optimization; Value (mathematics); Pure mathematics; Computer science; Statistics; Geometry","score_opus":0.009572350696402963,"score_gpt":0.2240817017528675,"score_spread":0.21450935105646454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384575229","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007804289,0.000009104584,0.9904286,0.0005091892,0.00008645267,0.00013797956,0.000007832257,0.000108465574,0.00090804894],"genre_scores_gemma":[0.9643974,0.00004573399,0.03458883,0.00042853216,0.00003109847,0.000024784815,0.00015413301,0.000011343762,0.0003181676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849004,0.0000974217,0.00035440765,0.00041080068,0.00047949966,0.0001678114],"domain_scores_gemma":[0.9989634,0.000108494656,0.00024644716,0.00047448702,0.00014661945,0.000060519065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004278759,0.0001505443,0.00027128545,0.00055494724,0.0002985585,0.00011107615,0.00034653675,0.00008346127,0.000062831896],"category_scores_gemma":[0.00004510306,0.00010979676,0.00018773836,0.006393592,0.000045511493,0.00016662113,0.00014960513,0.00008457962,0.000014292217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009307969,0.000023411934,0.00019146664,0.000003999069,0.00026634923,1.2375045e-7,0.00013104366,0.78552854,0.00005821859,0.21310353,0.00010217199,0.0005818655],"study_design_scores_gemma":[0.00025854804,0.00002061183,0.007646096,0.0000039131737,0.00047801304,2.2418718e-7,0.00004823385,0.9896921,0.00019623934,0.0014968743,0.000033566248,0.0001255663],"about_ca_topic_score_codex":0.000030357187,"about_ca_topic_score_gemma":0.0000043468126,"teacher_disagreement_score":0.9565931,"about_ca_system_score_codex":0.000024681656,"about_ca_system_score_gemma":0.000035943835,"threshold_uncertainty_score":0.4477382},"labels":[],"label_agreement":null},{"id":"W4385266632","doi":"10.4310/amsa.2023.v8.n2.a7","title":"An alternated inertial algorithm with weak and linear convergence for solving monotone inclusions","year":2023,"lang":"en","type":"article","venue":"Annals of Mathematical Sciences and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Convergence (economics); Monotone polygon; Inertial frame of reference; Mathematics; Algorithm; Applied mathematics; Geometry; Physics; Classical mechanics","score_opus":0.05307460723183364,"score_gpt":0.3552045073688411,"score_spread":0.30212990013700747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385266632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010272122,0.000019397372,0.9844624,0.004810968,0.0000055071946,0.0002097115,0.000012807765,0.000050889106,0.00015620064],"genre_scores_gemma":[0.54970515,0.00026621207,0.44921696,0.00040232769,0.000052967185,0.00020215094,0.000014873494,0.0000059331555,0.00013344098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992556,0.000010890118,0.00017946449,0.00023890256,0.00018375153,0.00013138332],"domain_scores_gemma":[0.9993534,0.00018480666,0.000078292665,0.0001380009,0.00014422751,0.00010126755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040742243,0.00006278469,0.000114278766,0.000089424575,0.0003631603,0.00007212709,0.00027715534,0.00002197096,0.000010594427],"category_scores_gemma":[0.00003026886,0.000044162964,0.000020255673,0.0007682805,0.0001697247,0.00027750994,0.00011365499,0.000024372384,0.00000420809],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000023210616,0.0001225234,0.00013787429,0.000027667294,0.000018462106,1.5950191e-7,0.00033315824,0.0029867848,0.00081563817,0.97492576,0.00010431781,0.020525353],"study_design_scores_gemma":[0.00007834262,0.000079688616,0.00044688,0.0000101818705,0.000006879107,0.000001751946,0.00007322781,0.9409447,0.000715415,0.057185274,0.00039129864,0.00006640062],"about_ca_topic_score_codex":0.00001826603,"about_ca_topic_score_gemma":0.0000027901797,"teacher_disagreement_score":0.9379579,"about_ca_system_score_codex":0.0000013798223,"about_ca_system_score_gemma":0.000029588373,"threshold_uncertainty_score":0.27931723},"labels":[],"label_agreement":null},{"id":"W4385392424","doi":"10.1007/s11590-023-02036-2","title":"Every proximal mapping is a resolvent of level proximal subdifferential","year":2023,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subderivative; Resolvent; Mathematics; Pure mathematics; Function (biology); Representation (politics); Mathematical analysis; Applied mathematics; Regular polygon; Geometry; Convex optimization","score_opus":0.0362417735556344,"score_gpt":0.2407461680358212,"score_spread":0.20450439448018679,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385392424","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00548517,0.0000056835743,0.9806597,0.013055066,0.00018340557,0.0001870683,0.000016763035,0.0001877584,0.00021935071],"genre_scores_gemma":[0.29135188,0.000040583076,0.70189375,0.004616318,0.0001780588,0.000068623995,0.00026326347,0.00003603624,0.0015514645],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984233,0.00007254214,0.0004024734,0.00037340683,0.0004870749,0.00024124127],"domain_scores_gemma":[0.9991615,0.00004684879,0.00022085226,0.00032891886,0.0001756879,0.00006623462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002341175,0.00014267539,0.00019232846,0.00048201033,0.00013524879,0.000118413554,0.00044012655,0.00005666276,0.00019471344],"category_scores_gemma":[0.000047366328,0.00014195146,0.00012951922,0.001752386,0.000036030382,0.00050719164,0.00017790169,0.000076919445,0.000046165133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011839087,0.00007373801,0.0014970568,0.00003316848,0.00008417338,0.000004465776,0.0010070737,0.9802004,0.0025738091,0.0053036143,0.0085954275,0.000615231],"study_design_scores_gemma":[0.0003685396,0.000016119364,0.004295694,0.000018874878,0.0000140706725,0.000001768357,0.000021156096,0.9937356,0.0009742381,0.000069101094,0.0003224397,0.00016241043],"about_ca_topic_score_codex":0.000014639211,"about_ca_topic_score_gemma":7.104095e-7,"teacher_disagreement_score":0.28586674,"about_ca_system_score_codex":0.000043171607,"about_ca_system_score_gemma":0.000059693295,"threshold_uncertainty_score":0.57886124},"labels":[],"label_agreement":null},{"id":"W4385644730","doi":"10.1007/s11228-023-00683-2","title":"Relaxed Constant Positive Linear Dependence Constraint Qualification for Disjunctive Systems","year":2023,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Constraint (computer-aided design); Piecewise; Mathematics; Constant (computer programming); Upper and lower bounds; Piecewise linear function; Mathematical optimization; Set (abstract data type); Regular polygon; Property (philosophy); Computer science; Mathematical analysis","score_opus":0.029383924758906967,"score_gpt":0.2904096471752086,"score_spread":0.2610257224163017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385644730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001355741,0.000052184187,0.9945249,0.0025826013,0.00015133613,0.00031644542,0.00045514922,0.00016872147,0.00039291172],"genre_scores_gemma":[0.9547197,0.00005648355,0.041922614,0.00027899127,0.0001186647,0.00012973325,0.0018084316,0.000011278693,0.0009540898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978511,0.0002169734,0.0005157129,0.00063168415,0.00053506804,0.00024948403],"domain_scores_gemma":[0.9977391,0.00074782287,0.0003161575,0.00029165548,0.0007664212,0.00013887996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010853268,0.00018862372,0.00036645436,0.0006784022,0.00045262487,0.00024477812,0.00028623117,0.00010180985,0.00003489067],"category_scores_gemma":[0.0003192112,0.000169564,0.00023814115,0.0032827384,0.00006728192,0.00043108934,0.00008764363,0.00008713309,0.00004422408],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018700446,0.00003898919,0.0013356932,0.000010298985,0.0012981265,0.0000016191309,0.00061562407,0.10254761,0.00009598416,0.8935953,0.00017805595,0.00026399514],"study_design_scores_gemma":[0.00042933703,0.00003473271,0.017315388,0.000009532651,0.00063894945,0.0000029256191,0.00033031887,0.9714462,0.00001729272,0.009423914,0.00013094796,0.00022044261],"about_ca_topic_score_codex":0.00013944264,"about_ca_topic_score_gemma":0.000018802864,"teacher_disagreement_score":0.95336396,"about_ca_system_score_codex":0.000076900964,"about_ca_system_score_gemma":0.00015742506,"threshold_uncertainty_score":0.6914619},"labels":[],"label_agreement":null},{"id":"W4385812602","doi":"10.3390/axioms12080783","title":"Constraint Qualifications for Vector Optimization Problems in Real Topological Spaces","year":2023,"lang":"en","type":"article","venue":"Axioms","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saskatchewan Polytechnic","funders":"","keywords":"Mathematics; Affine transformation; Vector optimization; Constraint (computer-aided design); Duality (order theory); Mathematical optimization; Applied mathematics; Optimization problem; Pure mathematics","score_opus":0.05907880329849124,"score_gpt":0.31476724078238727,"score_spread":0.255688437483896,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385812602","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009653557,0.000005666892,0.98647255,0.010984744,0.0001001014,0.00021011554,0.000009326794,0.00019876726,0.0010533736],"genre_scores_gemma":[0.9436513,0.00006537568,0.055423096,0.00015319741,0.000040179337,0.00008465657,0.00012249679,0.0000050699055,0.00045461036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992506,0.000045658413,0.00020272646,0.00023129214,0.00012255457,0.00014719568],"domain_scores_gemma":[0.99947596,0.00016973623,0.000064733584,0.0001642293,0.00008427081,0.000041068695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030026928,0.00006315791,0.00009716328,0.00018864036,0.000087577886,0.000097584685,0.0002312977,0.000049232956,0.000054968004],"category_scores_gemma":[0.00009075821,0.000056060017,0.00004569194,0.0010995818,0.000032098655,0.00018083787,0.000042868975,0.00003517314,0.00003775898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.9190147e-7,0.000026503547,0.00014698303,0.0000031782035,0.000006080618,3.3984458e-7,0.0003341176,0.45531464,0.000041493204,0.5436441,0.00013089398,0.0003509026],"study_design_scores_gemma":[0.00019629857,0.000025573376,0.0036655616,0.0000039416723,0.0000034830693,6.8960907e-7,0.000101073485,0.9924074,0.000021113166,0.0032315939,0.0002631823,0.00008008319],"about_ca_topic_score_codex":0.000067051165,"about_ca_topic_score_gemma":0.000030066622,"teacher_disagreement_score":0.94268596,"about_ca_system_score_codex":0.000028523837,"about_ca_system_score_gemma":0.000046569145,"threshold_uncertainty_score":0.22860612},"labels":[],"label_agreement":null},{"id":"W4386896227","doi":"10.20944/preprints202309.1330.v1","title":"Constraint Qualifications for Vector Optimization Problemsin Real Topological Spaces","year":2023,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saskatchewan Polytechnic","funders":"","keywords":"Mathematics; Affine transformation; Constraint (computer-aided design); Vector optimization; Duality (order theory); Mathematical optimization; Locally convex topological vector space; Regular polygon; Applied mathematics; Convex function; Pure mathematics; Optimization problem; Topological space","score_opus":0.24739849258756094,"score_gpt":0.38879509530644896,"score_spread":0.14139660271888801,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386896227","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027574978,0.000012480476,0.97275144,0.0189961,0.0007070552,0.0010837564,0.00010273441,0.00086083193,0.0027280862],"genre_scores_gemma":[0.71439797,0.00034064415,0.2796216,0.00024882716,0.00028973442,0.00077878346,0.0008257042,0.000045735196,0.0034509995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99708676,0.00021537246,0.0007142297,0.0012561673,0.00039898235,0.00032848],"domain_scores_gemma":[0.9972296,0.00034957004,0.00052880164,0.0011907442,0.00054674404,0.00015459266],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010236405,0.00030517558,0.00041777233,0.0002947716,0.0002681166,0.00020695588,0.0012877121,0.00035584354,0.00041274398],"category_scores_gemma":[0.0005552856,0.00030109318,0.000298839,0.0005178633,0.00010726036,0.00020853296,0.0013581038,0.00033859795,0.00036880028],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008021068,0.00013353814,0.008764201,0.00006240198,0.00013909137,0.0000012751971,0.00051556015,0.71839833,0.00013561614,0.2715693,0.00017975486,0.00009288167],"study_design_scores_gemma":[0.00031825033,0.000023127046,0.028391069,0.000054813834,0.000082892395,0.0000024039018,0.00008661915,0.94583124,0.00047565042,0.023364535,0.0008729638,0.0004964245],"about_ca_topic_score_codex":0.00020256214,"about_ca_topic_score_gemma":0.000024122124,"teacher_disagreement_score":0.7116405,"about_ca_system_score_codex":0.00015482838,"about_ca_system_score_gemma":0.00037395913,"threshold_uncertainty_score":0.9999441},"labels":[],"label_agreement":null},{"id":"W4387260731","doi":"10.23952/jnva.7.2023.5.10","title":"The generalized conditional gradient method for composite multiobjective optimization problems on Riemannian manifolds","year":2023,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; Natural Science Foundation of Sichuan Province; National Natural Science Foundation of China","keywords":"Mathematics; Composite number; Applied mathematics; Mathematical optimization; Algorithm","score_opus":0.018067634946869224,"score_gpt":0.29633070600023526,"score_spread":0.278263071053366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387260731","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00046923506,0.000037552163,0.991154,0.007904109,0.00013366142,0.00014252633,0.000076880526,0.000026263338,0.000055741482],"genre_scores_gemma":[0.036273062,0.00024667365,0.96097046,0.00079800043,0.00044653178,0.000035862224,0.00054587994,0.000014600031,0.00066893024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981807,0.0001982223,0.000625473,0.00024430163,0.00058010675,0.00017118965],"domain_scores_gemma":[0.9970399,0.0009827109,0.0006133571,0.00015478511,0.0011019324,0.000107310814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014229915,0.000142076,0.00030947567,0.00072718755,0.00061593624,0.00026139416,0.00031479998,0.00005912715,0.000022788683],"category_scores_gemma":[0.0001737166,0.000096927055,0.0004132518,0.0019999843,0.00002574492,0.00032354463,0.000052720203,0.000107015345,0.000004836023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004264828,0.00007775802,0.0003618893,0.000003922297,0.0015228495,0.0000013664157,0.00018560207,0.898149,0.000029507735,0.09888213,0.00029918933,0.00044412678],"study_design_scores_gemma":[0.0007963497,0.000105820625,0.013797391,0.000005549029,0.0005480334,0.000009128687,0.000023825472,0.97439855,0.000019123572,0.00871905,0.0014634527,0.00011369626],"about_ca_topic_score_codex":0.000015642892,"about_ca_topic_score_gemma":0.000013524465,"teacher_disagreement_score":0.09016308,"about_ca_system_score_codex":0.000063052146,"about_ca_system_score_gemma":0.00009700149,"threshold_uncertainty_score":0.4737346},"labels":[],"label_agreement":null},{"id":"W4387260736","doi":"10.23952/jnva.7.2023.5.02","title":"Vectorial penalisation in vector optimisation in real linear-topological spaces","year":2023,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vector (molecular biology); Topology (electrical circuits); Mathematics; Computer science; Pure mathematics; Combinatorics; Biology","score_opus":0.02786336668756757,"score_gpt":0.2996362875133996,"score_spread":0.27177292082583204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387260736","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67452824,0.0000615857,0.3105603,0.01385654,0.0005307277,0.00014904715,0.000036157944,0.000059574213,0.00021785812],"genre_scores_gemma":[0.9430518,0.00026883458,0.05574315,0.00009887338,0.0005934095,0.0000034658556,0.0001679758,0.0000029267667,0.00006952892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819773,0.00019643412,0.000704516,0.00021917136,0.00052902475,0.00015313578],"domain_scores_gemma":[0.99871683,0.00042019016,0.00038361538,0.00009539254,0.00030389897,0.00008004752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013194038,0.00011365095,0.00035547424,0.0013331614,0.00006271496,0.00011163267,0.0002327552,0.000096119045,0.000088273424],"category_scores_gemma":[0.00029513444,0.000086877946,0.0001818023,0.004397053,0.000016888993,0.00056607684,0.000061594605,0.00016896431,0.000004623718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009535251,0.00025785068,0.1895173,0.000007732688,0.00046298388,0.0000400088,0.000931694,0.7526116,0.00039013382,0.054705765,0.000053936375,0.0009256583],"study_design_scores_gemma":[0.00039330198,0.00003647924,0.37877387,0.0000046730124,0.00007651231,0.000003176574,0.000034363155,0.6190341,0.000008056057,0.0015031536,0.00006348537,0.00006882974],"about_ca_topic_score_codex":0.00019384455,"about_ca_topic_score_gemma":0.00025761782,"teacher_disagreement_score":0.2685236,"about_ca_system_score_codex":0.000093080525,"about_ca_system_score_gemma":0.00012144168,"threshold_uncertainty_score":0.354278},"labels":[],"label_agreement":null},{"id":"W4388008257","doi":"10.1080/01630563.2023.2270308","title":"How Averaged is the Composition of Two Linear Projections?","year":2023,"lang":"en","type":"article","venue":"Numerical Functional Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Composition (language); Projection (relational algebra); Linear operators; Modulus; Upper and lower bounds; Pure mathematics; Mathematical analysis; Algorithm; Geometry","score_opus":0.019178791869584846,"score_gpt":0.24691013234894518,"score_spread":0.22773134047936033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388008257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00080161367,0.000019919156,0.9869826,0.011802621,0.00007651075,0.000091506925,0.000010628932,0.00009613588,0.000118503456],"genre_scores_gemma":[0.8624113,0.00015899428,0.13414264,0.0010023449,0.00012763665,0.0000363264,0.0004755014,0.0000099613035,0.0016352764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871856,0.00012154907,0.00026434244,0.00032409522,0.00044541966,0.0001260473],"domain_scores_gemma":[0.998968,0.0001716159,0.00018280637,0.00023476602,0.00038587768,0.00005695811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027306812,0.00011534105,0.00021465505,0.00049778447,0.00038901117,0.00017449807,0.00016564345,0.00004386331,0.00013624776],"category_scores_gemma":[0.000047138223,0.00008155092,0.00021583204,0.0063852835,0.000043983488,0.00042015608,0.00008263776,0.00008594462,0.0000115217845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075333473,0.000044486456,0.002492114,0.00000326228,0.0003969267,3.5265774e-7,0.00009951486,0.98053205,0.00006098383,0.015342659,0.00036685125,0.0006532755],"study_design_scores_gemma":[0.00020257042,0.000023081453,0.009315628,0.0000020276862,0.0002907819,0.0000022874212,0.000027352062,0.9891425,0.00012693308,0.0005039135,0.00026843435,0.000094508185],"about_ca_topic_score_codex":0.000050885963,"about_ca_topic_score_gemma":0.000003527119,"teacher_disagreement_score":0.8616097,"about_ca_system_score_codex":0.000017567349,"about_ca_system_score_gemma":0.00003105533,"threshold_uncertainty_score":0.332555},"labels":[],"label_agreement":null},{"id":"W4388184463","doi":"10.48550/arxiv.2310.20142","title":"Alternating Proximal Point Algorithm with Gradient Descent and Ascent Steps for Convex-Concave Saddle-Point Problems","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Saddle point; Mathematics; Convex function; Function (biology); Gradient descent; Minimax; Proximal Gradient Methods; Concave function; Regular polygon; Convergence (economics); Mathematical analysis; Sequence (biology); Saddle; Applied mathematics; Mathematical optimization; Combinatorics; Geometry; Computer science","score_opus":0.07343936484998281,"score_gpt":0.19114774431311266,"score_spread":0.11770837946312984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388184463","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009829251,0.000025223706,0.98754686,0.0008275045,0.00029139305,0.0010420058,0.00005069956,0.00025050077,0.00013657128],"genre_scores_gemma":[0.90168685,0.00016137629,0.09622995,0.00019710325,0.00010007319,0.000022976888,0.00010956086,0.0000426071,0.0014495297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768525,0.00009673707,0.0003254724,0.0012988833,0.00019233182,0.00040130832],"domain_scores_gemma":[0.9981441,0.00013235808,0.00044438502,0.0005877648,0.00045759088,0.00023378147],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00042941558,0.00035791713,0.00041867426,0.00034003335,0.0002553323,0.00028406826,0.0007621451,0.00014531704,0.000009577581],"category_scores_gemma":[0.000032848835,0.00034506762,0.00018450875,0.00052198034,0.00008490242,0.00034667106,0.0011299133,0.00030919892,0.000013989015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005115127,0.0002602011,0.0038274617,0.00030621307,0.0006934204,0.00012994032,0.0010627502,0.75182855,0.000010273302,0.23946664,0.00013795911,0.0022254596],"study_design_scores_gemma":[0.0010803913,0.00015481388,0.001076193,0.00017549301,0.00014656961,0.00000743952,0.00012537824,0.9787871,0.000062521205,0.017848572,0.000094303396,0.00044118118],"about_ca_topic_score_codex":0.00018835605,"about_ca_topic_score_gemma":0.00007343124,"teacher_disagreement_score":0.89185756,"about_ca_system_score_codex":0.00031029375,"about_ca_system_score_gemma":0.00020079692,"threshold_uncertainty_score":0.99990016},"labels":[],"label_agreement":null},{"id":"W4388321717","doi":"10.1093/oso/9780198501657.003.0006","title":"Functional analytic basis","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Mathematics; Baire category theorem; Section (typography); Open mapping theorem (functional analysis); Banach space; Metric space; Mathematical proof; Basis (linear algebra); Pure mathematics; Topological space; Fréchet space; Interpolation space; Eberlein–Šmulian theorem; Discrete mathematics; Algebra over a field; Functional analysis; Lp space; Computer science","score_opus":0.020865907705529693,"score_gpt":0.2040801340135772,"score_spread":0.1832142263080475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388321717","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.4619813e-8,0.000028344886,0.37182733,0.0011966455,0.00007551425,0.000026323723,0.0000039585543,0.00008798902,0.62675387],"genre_scores_gemma":[0.00019687912,0.00010944552,0.017976314,0.0015865403,0.00013874315,0.0000020975124,0.00007953022,0.000011428536,0.97989905],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988504,0.0000072087805,0.00024045458,0.00039239583,0.00040414816,0.00010537532],"domain_scores_gemma":[0.999258,0.000045685745,0.00008910624,0.00040109316,0.00012407823,0.00008207377],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000071983544,0.00017536944,0.00019808373,0.0002979622,0.000085989275,0.00012817344,0.000364219,0.00013373148,0.049481034],"category_scores_gemma":[0.000004450145,0.00015501233,0.00022904741,0.00010437525,0.000017586453,0.00019321742,0.00007128651,0.00011677625,0.003848343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000010612906,0.000006956897,0.0000022953727,0.0000013415881,0.000098152595,0.000002437662,0.0000045512343,0.0030733962,1.2528041e-7,0.97099614,0.019458016,0.0063555376],"study_design_scores_gemma":[0.00015519846,0.000017896136,0.00016365845,0.000012799149,0.000096318894,0.00000943903,4.3838529e-7,0.2374263,0.00000275189,0.17338659,0.58832294,0.00040565396],"about_ca_topic_score_codex":0.000008145298,"about_ca_topic_score_gemma":0.000008297579,"teacher_disagreement_score":0.79760957,"about_ca_system_score_codex":0.00004767968,"about_ca_system_score_gemma":0.00010501399,"threshold_uncertainty_score":0.99692726},"labels":[],"label_agreement":null},{"id":"W4388677313","doi":"10.23952/asvao.5.2023.3.04","title":"Strong convergence of a path for convex minimization, generalized split feasibility, and fixed point problems","year":2023,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation of Korea; National Research Foundation","keywords":"Minification; Convergence (economics); Mathematics; Regular polygon; Path (computing); Mathematical optimization; Fixed point; Convex optimization; Point (geometry); Applied mathematics; Mathematical analysis; Computer science; Geometry; Economics","score_opus":0.030131954061232476,"score_gpt":0.2669325895038634,"score_spread":0.2368006354426309,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388677313","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006304018,0.00007327159,0.99234265,0.00044335675,0.00003727478,0.0005489369,0.000051887575,0.00011390099,0.00008471176],"genre_scores_gemma":[0.6234169,0.00051516574,0.37448668,0.00017470511,0.000026666316,0.00011383719,0.0010630509,0.000017607608,0.0001854028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980286,0.0000867204,0.00065166317,0.00066384074,0.0003340388,0.00023514807],"domain_scores_gemma":[0.9985281,0.00013679216,0.0004000522,0.00038537348,0.00042678145,0.00012285916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067426957,0.00020823098,0.0005208001,0.00055794517,0.00024097128,0.0001664001,0.0002414707,0.000102924394,0.0000714796],"category_scores_gemma":[0.00008171132,0.00019560594,0.0001501654,0.0032107658,0.00007412117,0.0003009993,0.00014923936,0.000049702623,0.0000020351717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019220457,0.000041618805,0.00336187,0.000054352517,0.0004118204,1.7087032e-7,0.00056985824,0.89313173,0.00012874366,0.101773545,0.00012659509,0.00038047225],"study_design_scores_gemma":[0.0009671647,0.00003518089,0.003276962,0.000006917668,0.00051881693,4.1867017e-7,0.00011506602,0.9926689,0.00013798189,0.0020228813,0.000036911144,0.00021276865],"about_ca_topic_score_codex":0.000046431127,"about_ca_topic_score_gemma":0.000017596969,"teacher_disagreement_score":0.61785597,"about_ca_system_score_codex":0.000030919222,"about_ca_system_score_gemma":0.00006144216,"threshold_uncertainty_score":0.79765785},"labels":[],"label_agreement":null},{"id":"W4389705465","doi":"10.23952/jnva.7.2023.6.08","title":"A stochastic projection and contraction algorithm with inertial effects for stochastic variational inequalities","year":2023,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Centre Scientifique et Technique du Bâtiment; Fundamental Research Funds for the Central Universities; Natural Science Foundation of Chongqing; National Natural Science Foundation of China","keywords":"Contraction (grammar); Inertial frame of reference; Variational inequality; Mathematics; Projection (relational algebra); Contraction mapping; Applied mathematics; Mathematical optimization; Computer science; Algorithm; Mathematical analysis; Physics; Classical mechanics; Medicine; Fixed point","score_opus":0.01285559939370816,"score_gpt":0.26389647626491786,"score_spread":0.2510408768712097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389705465","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038880622,0.000040582006,0.99394596,0.0017574542,0.0001329657,0.00015464427,0.000042601674,0.000032318334,0.0000053889125],"genre_scores_gemma":[0.54392046,0.000038859285,0.45416313,0.00030880567,0.00095540093,0.000048020345,0.000261713,0.0000187406,0.00028487257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984575,0.00011216216,0.0004979977,0.0002444383,0.00053262594,0.00015525823],"domain_scores_gemma":[0.9972314,0.0011353048,0.00051810534,0.000091742564,0.0009140508,0.00010939706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009349635,0.00015005053,0.00037291143,0.0010896883,0.00024159621,0.00020509257,0.00012290372,0.00006917018,0.00001045593],"category_scores_gemma":[0.0003909475,0.00011559684,0.00015616475,0.0017630217,0.000029234196,0.00068148645,0.0000387955,0.000115781346,0.0000015961945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002654974,0.00027601206,0.00094324327,0.00006063447,0.005118155,0.0000073717047,0.0011349706,0.91534406,0.00018856478,0.06411403,0.000119471515,0.012427995],"study_design_scores_gemma":[0.0011386265,0.00022444007,0.02429894,0.000015077649,0.0010921207,0.000036443336,0.00004917923,0.96995515,0.000005443784,0.003004816,0.00004176,0.00013801389],"about_ca_topic_score_codex":0.000039686056,"about_ca_topic_score_gemma":0.00001732883,"teacher_disagreement_score":0.5400324,"about_ca_system_score_codex":0.000045912075,"about_ca_system_score_gemma":0.00019464639,"threshold_uncertainty_score":0.47139025},"labels":[],"label_agreement":null},{"id":"W4389705548","doi":"10.23952/jnva.7.2023.6.06","title":"New Bregman projection algorithms for solving the split feasibility problem","year":2023,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Tianjin Municipal Education Commission","keywords":"Projection (relational algebra); Computer science; Algorithm; Bregman divergence; Mathematics; Mathematical optimization; Applied mathematics","score_opus":0.03831201730820097,"score_gpt":0.30940780313483246,"score_spread":0.2710957858266315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389705548","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012192682,0.000041903306,0.98691577,0.011483599,0.000108202745,0.00013158687,0.00001452557,0.000027973576,0.000057187706],"genre_scores_gemma":[0.046479292,0.00010560484,0.9501149,0.00040292193,0.0009964699,0.000009469461,0.00008095268,0.000010393319,0.0017999638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985643,0.00006439524,0.0005384501,0.00021688202,0.00047198337,0.00014401569],"domain_scores_gemma":[0.99818766,0.0003696637,0.00046228545,0.00017002196,0.00071197894,0.00009840972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001537551,0.00010497113,0.00025767376,0.00054920354,0.00030765356,0.00025444804,0.00033614933,0.000049914208,0.00003829402],"category_scores_gemma":[0.00018400354,0.00006883849,0.00038411052,0.0028646225,0.00001471879,0.00049783516,0.000072461495,0.00011053061,0.000004701945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019405072,0.0005610251,0.049652584,0.00008794526,0.011322494,0.000009613865,0.0038668483,0.55681986,0.0003775146,0.2942983,0.011400821,0.071409],"study_design_scores_gemma":[0.00036906073,0.00005561822,0.054689992,0.000004412694,0.00055856124,0.0000097503635,0.000036982387,0.9317327,0.000009916632,0.01108057,0.0013698668,0.00008256492],"about_ca_topic_score_codex":0.000059195492,"about_ca_topic_score_gemma":0.000032224918,"teacher_disagreement_score":0.3749129,"about_ca_system_score_codex":0.000048609792,"about_ca_system_score_gemma":0.00025354166,"threshold_uncertainty_score":0.28071523},"labels":[],"label_agreement":null},{"id":"W4389705551","doi":"10.23952/jnva.7.2023.6.01","title":"A characterization of the $\\varepsilon$-normal set and its application in robust convex optimization problems","year":2023,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"People's Government of Jilin Province; National Research Foundation of Korea; National Natural Science Foundation of China; National Research Foundation; Education Department of Jilin Province; National Science Foundation","keywords":"Characterization (materials science); Set (abstract data type); Mathematics; Regular polygon; Convex set; Convex optimization; Combinatorics; Computer science; Mathematical optimization; Materials science; Geometry; Nanotechnology","score_opus":0.017299909002317333,"score_gpt":0.23775357238189507,"score_spread":0.22045366337957772,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389705551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11022246,0.000035241,0.88617253,0.003329113,0.00005396158,0.000120799385,0.00003257846,0.000011909638,0.000021377376],"genre_scores_gemma":[0.97862303,0.00030377816,0.020601714,0.00014384494,0.00007656656,0.000006494981,0.00013838841,0.0000059108115,0.00010027949],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985923,0.00011293394,0.0006233243,0.00016906114,0.00040774542,0.000094632705],"domain_scores_gemma":[0.9984773,0.00009794138,0.00070090755,0.00012411989,0.0005470762,0.000052649506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074218964,0.000092112736,0.0002660797,0.0007278624,0.00009546999,0.00006417815,0.00023103761,0.000060625163,0.00002060611],"category_scores_gemma":[0.00010109137,0.00006869065,0.000120303055,0.0035938716,0.000018802657,0.0005673102,0.00009386565,0.000097775934,0.0000012157171],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009660351,0.00005800169,0.026846513,0.000017352831,0.00026767034,5.575978e-7,0.00046942802,0.96346205,0.0014154627,0.007209799,0.0000042436154,0.00023923283],"study_design_scores_gemma":[0.0002601978,0.000017242239,0.17850365,0.000009978973,0.0001679715,0.000005226733,0.000013858629,0.8206156,0.00008140166,0.00022471082,0.000041635103,0.00005856952],"about_ca_topic_score_codex":0.000022380817,"about_ca_topic_score_gemma":0.000022515485,"teacher_disagreement_score":0.8684006,"about_ca_system_score_codex":0.000024033488,"about_ca_system_score_gemma":0.00008860943,"threshold_uncertainty_score":0.28011233},"labels":[],"label_agreement":null},{"id":"W4389986782","doi":"10.1137/1.9781611977806.ch22","title":"Chapter 22: Nonexpansive Mappings","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Lipschitz continuity; Norm (philosophy); Mathematics; Banach space; Euclidean geometry; Combinatorics; Discrete mathematics; Pure mathematics; Geometry","score_opus":0.06763523599678925,"score_gpt":0.2372667054453626,"score_spread":0.16963146944857335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389986782","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000074567447,0.000018869374,0.33232096,0.00085956743,0.00036011747,0.001348439,0.00015101598,0.00038479158,0.6645488],"genre_scores_gemma":[0.00017633541,0.00006525392,0.1564346,0.00080234185,0.0008551318,0.00017462374,0.00011710297,0.00011594335,0.84125865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99834764,0.0000018502461,0.0005072425,0.00051726395,0.0003747185,0.0002512715],"domain_scores_gemma":[0.99870896,0.00024134581,0.00042279082,0.00035528108,0.00014977444,0.00012187129],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003203056,0.0003692768,0.0005363212,0.000089039204,0.00029709906,0.00021670091,0.00040478405,0.0005846159,0.000042370993],"category_scores_gemma":[0.000015897602,0.00033759,0.0005662024,0.000041021496,0.0000997871,0.000050898467,0.0002933188,0.00032761836,0.000059908994],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000031387503,0.000007965665,2.6198126e-8,0.0000634053,0.00033025708,3.8512914e-7,0.00095919875,0.000022738024,0.000032180098,0.9893498,0.004152879,0.0050780503],"study_design_scores_gemma":[0.0012398799,0.000051353512,1.13366234e-7,0.00015240222,0.00032029446,0.0000036067677,0.00018851417,0.019308655,0.000119145705,0.8859114,0.091979854,0.0007247442],"about_ca_topic_score_codex":0.0000016068979,"about_ca_topic_score_gemma":7.99205e-7,"teacher_disagreement_score":0.17670988,"about_ca_system_score_codex":0.000035683766,"about_ca_system_score_gemma":0.000085961336,"threshold_uncertainty_score":0.9999076},"labels":[],"label_agreement":null},{"id":"W4390018035","doi":"10.1137/1.9781611977806.ch31","title":"Chapter 31: Douglas-Rachford Algorithm","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Corollary; Regular polygon; Function (biology); Mathematics; Convex function; Algorithm; Applied mathematics; Pure mathematics; Computer science; Geometry","score_opus":0.06883681098945635,"score_gpt":0.24256163612209755,"score_spread":0.1737248251326412,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390018035","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001900177,0.000021607995,0.55593455,0.00046957945,0.0005291902,0.0010712453,0.00017983046,0.0003473585,0.44144472],"genre_scores_gemma":[0.0000142945355,0.00006041204,0.3533201,0.00035872203,0.0010357939,0.00012610981,0.00011910541,0.000083827625,0.64488167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819,0.0000020488503,0.00056896074,0.00054178486,0.00041476142,0.00028248326],"domain_scores_gemma":[0.9986508,0.00024998788,0.00042827547,0.0004095861,0.00012327779,0.00013807589],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00041775068,0.00040596313,0.0005685116,0.000091402566,0.00034666466,0.0002620456,0.00046709305,0.0006472221,0.000029759383],"category_scores_gemma":[0.0000120877385,0.00036440368,0.000629065,0.00004573968,0.00010246347,0.000059217768,0.00034114294,0.00038072042,0.000058004036],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024456388,0.000011104402,1.9207787e-8,0.000046588673,0.0003224661,4.0947575e-7,0.0005649598,0.000019517855,0.000005760487,0.95543236,0.0046581947,0.03893617],"study_design_scores_gemma":[0.0012605472,0.00005626002,6.908497e-8,0.0000992741,0.00032310956,0.0000039599663,0.00010108965,0.06613507,0.000055722852,0.7603432,0.17093372,0.00068797567],"about_ca_topic_score_codex":0.0000018891868,"about_ca_topic_score_gemma":9.875939e-7,"teacher_disagreement_score":0.2034369,"about_ca_system_score_codex":0.00004274316,"about_ca_system_score_gemma":0.000103372346,"threshold_uncertainty_score":0.9998808},"labels":[],"label_agreement":null},{"id":"W4390018052","doi":"10.1137/1.9781611977806.ch3","title":"Chapter 3: Convex and Lower Semicontinuous Functions","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Epigraph; Regular polygon; Domain (mathematical analysis); Mathematics; Combinatorics; Convex function; Pure mathematics; Mathematical analysis; Geometry","score_opus":0.05180484687614406,"score_gpt":0.2244508081548497,"score_spread":0.17264596127870563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390018052","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000054099288,0.000051456074,0.33191976,0.0010743939,0.00079562154,0.0017585347,0.00028477045,0.0005166421,0.6635447],"genre_scores_gemma":[0.00069180713,0.00008181334,0.04840638,0.000513736,0.00071318645,0.00012575227,0.00008720582,0.00009037021,0.94928974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99872714,0.0000018328524,0.00039852445,0.00044291635,0.00023595587,0.00019363887],"domain_scores_gemma":[0.9990185,0.00022072213,0.0002825063,0.00026732904,0.00009746901,0.000113490896],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00027059545,0.00029725351,0.0004511775,0.000066900175,0.0002990326,0.00021151261,0.00019731029,0.0004842896,0.000034188102],"category_scores_gemma":[0.0000127736,0.00026832227,0.00032773058,0.000029220737,0.00011553,0.000044539716,0.00022631027,0.0002798659,0.00002685405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040608816,0.000009052222,1.2787766e-7,0.000043686116,0.00027591738,3.0195974e-7,0.0004485213,0.000008879705,0.00002721183,0.9894766,0.003750311,0.0059553008],"study_design_scores_gemma":[0.002361192,0.00012655895,5.061215e-7,0.00018597818,0.0007545629,0.000011863349,0.00027690365,0.030694198,0.0000655728,0.7485604,0.21587051,0.001091701],"about_ca_topic_score_codex":0.0000013975874,"about_ca_topic_score_gemma":0.0000011860769,"teacher_disagreement_score":0.28574502,"about_ca_system_score_codex":0.00001992515,"about_ca_system_score_gemma":0.00005677885,"threshold_uncertainty_score":0.9999769},"labels":[],"label_agreement":null},{"id":"W4390018108","doi":"10.1137/1.9781611977806.ch15","title":"Chapter 15: Minimizing a Sum and the Fritz John Necessary Conditions","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Differentiable function; Mathematics; Regular polygon; Combinatorics; Convex function; Pure mathematics; Geometry","score_opus":0.05948786503889495,"score_gpt":0.24607555645683463,"score_spread":0.18658769141793968,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390018108","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000047470152,0.000169511,0.26266542,0.007007813,0.0006061626,0.0035908534,0.00055701274,0.0005091807,0.72484654],"genre_scores_gemma":[0.004023506,0.0005538089,0.17023273,0.003273909,0.0020612401,0.0008432917,0.00038798104,0.0002519297,0.8183716],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986428,0.0000055441806,0.00046501582,0.00039701513,0.00028830973,0.00020128909],"domain_scores_gemma":[0.99844754,0.0007128965,0.000362455,0.00029894395,0.00008691234,0.0000912843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005256361,0.00029868548,0.000496473,0.000064566055,0.00058958685,0.00030902715,0.00032021676,0.00039622604,0.000025210124],"category_scores_gemma":[0.000024231042,0.00021724164,0.00040788902,0.000039469232,0.0002921638,0.000054987442,0.00030270516,0.00033481003,0.0000095057585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007298348,0.0000066769226,7.005417e-8,0.00005033343,0.0003161094,2.4320028e-7,0.0012687318,0.00001706044,0.00000666437,0.99381983,0.003043068,0.0014639046],"study_design_scores_gemma":[0.0027586818,0.000024801811,2.9290254e-7,0.00012783812,0.00049635663,0.000005794852,0.00041428284,0.04254895,0.000024566312,0.93016887,0.022985194,0.00044439538],"about_ca_topic_score_codex":0.000003047727,"about_ca_topic_score_gemma":0.000002730666,"teacher_disagreement_score":0.093525045,"about_ca_system_score_codex":0.000016764856,"about_ca_system_score_gemma":0.000065806205,"threshold_uncertainty_score":0.88588566},"labels":[],"label_agreement":null},{"id":"W4390018126","doi":"10.1137/1.9781611977806.ch7","title":"Chapter 7: Support Functions and Polar Cones","year":2023,"lang":"en","type":"book-chapter","venue":"Society for Industrial and Applied Mathematics eBooks","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Regular polygon; Polar; Function (biology); Combinatorics; Mathematics; Convex function; Physics; Geometry; Biology; Cell biology","score_opus":0.06920395932843891,"score_gpt":0.2378710108017915,"score_spread":0.1686670514733526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390018126","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019476902,0.000043765896,0.24051435,0.0013644479,0.00049377437,0.0014872208,0.00048629355,0.00043639925,0.75515425],"genre_scores_gemma":[0.00067232363,0.000083419975,0.05207893,0.00044819433,0.0006121476,0.00010960306,0.00018401693,0.00008259841,0.9457288],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987882,0.0000017794873,0.00038656648,0.00040000377,0.00024229179,0.00018120478],"domain_scores_gemma":[0.9991041,0.00019080883,0.00026158712,0.00024141754,0.000087850975,0.00011425553],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00029629376,0.0002746757,0.00040246427,0.00007190385,0.0003480427,0.00019342774,0.00018676509,0.00042655753,0.000044035514],"category_scores_gemma":[0.000011057593,0.0002469741,0.00029610452,0.000027956406,0.000112282556,0.000048557245,0.00021798201,0.00023708874,0.000029185056],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002734429,0.0000071276445,2.5730307e-7,0.00004843304,0.00025768435,2.3717308e-7,0.0004720362,0.0000059168756,0.000011978187,0.99144334,0.0030968133,0.004653466],"study_design_scores_gemma":[0.0017398029,0.00011391076,7.403833e-7,0.00009394548,0.00066282955,0.000011672304,0.0003343265,0.016002035,0.0000391753,0.7955646,0.18458228,0.00085469725],"about_ca_topic_score_codex":0.0000019955787,"about_ca_topic_score_gemma":0.0000017140335,"teacher_disagreement_score":0.19587873,"about_ca_system_score_codex":0.000017348659,"about_ca_system_score_gemma":0.000072000264,"threshold_uncertainty_score":0.9999983},"labels":[],"label_agreement":null},{"id":"W4390617708","doi":"10.3390/math12020177","title":"Proximal Analytic Center Cutting Plane Algorithms for Variational Inequalities and Nash Economic Equilibrium","year":2024,"lang":"en","type":"article","venue":"Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saskatchewan Polytechnic","funders":"","keywords":"Variational inequality; Nash equilibrium; Cutting-plane method; Mathematics; Constructive; Plane (geometry); Mathematical proof; Symmetric equilibrium; Sequence (biology); Trembling hand perfect equilibrium; Center (category theory); Mathematical economics; Mathematical optimization; Applied mathematics; Epsilon-equilibrium; Algorithm; Best response; Game theory; Computer science; Equilibrium selection; Geometry; Repeated game; Process (computing)","score_opus":0.03155404047169629,"score_gpt":0.279439344576841,"score_spread":0.2478853041051447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390617708","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014108841,0.00004873597,0.99573386,0.0016056866,0.00017674798,0.00012951277,0.00006142232,0.00010982702,0.00072333583],"genre_scores_gemma":[0.10291501,0.000009270703,0.8937035,0.00022667431,0.00030614648,0.00004517212,0.000104447165,0.000020154439,0.0026696096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922776,0.00001749512,0.0002790704,0.00021563428,0.00012813203,0.00013189408],"domain_scores_gemma":[0.9993587,0.0003582858,0.000064163374,0.0001320578,0.000044613647,0.00004218954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040676346,0.00009449266,0.00014581342,0.00012400128,0.00005957663,0.00044203,0.00016575353,0.00003362554,0.000051229585],"category_scores_gemma":[0.000051819075,0.00008310206,0.000057809986,0.00011208299,0.000014130655,0.0003466117,0.0000908228,0.00004033007,0.000029729064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000011857087,0.000041212155,0.00010007187,0.00025795188,0.00011793509,0.0000013655144,0.0017522472,0.0028081003,0.000024082507,0.99313563,0.00081946864,0.00094075344],"study_design_scores_gemma":[0.00012666985,0.000015658616,0.000037113066,0.000028372848,0.000023172583,0.000012505421,0.000048152877,0.957742,0.00003053522,0.04094862,0.0008907373,0.000096468786],"about_ca_topic_score_codex":0.0000037027307,"about_ca_topic_score_gemma":0.000001285738,"teacher_disagreement_score":0.9549339,"about_ca_system_score_codex":0.000041497493,"about_ca_system_score_gemma":0.00006627908,"threshold_uncertainty_score":0.42625055},"labels":[],"label_agreement":null},{"id":"W4391103088","doi":"10.3390/math12020352","title":"The Augmented Weak Sharpness of Solution Sets in Equilibrium Problems","year":2024,"lang":"en","type":"article","venue":"Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Science Foundation of Shandong Province; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; University of Alberta","keywords":"Mathematical optimization; Degenerate energy levels; Degeneracy (biology); Solution set; Solution concept; Premise; Variational inequality; Mathematics; Set (abstract data type); Finite set; Regular polygon; Optimization problem; Computer science; Applied mathematics; Mathematical analysis; Physics","score_opus":0.02156666159529515,"score_gpt":0.26224130773598414,"score_spread":0.24067464614068898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391103088","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022376035,0.00020541012,0.9917142,0.0028195565,0.00014981053,0.0001240243,0.0000025840707,0.000074395306,0.0026724173],"genre_scores_gemma":[0.8973265,0.00005502624,0.099902645,0.00005335908,0.000029446197,0.000038139842,0.000011473639,0.000013722736,0.0025696515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993385,0.00002456164,0.00024809618,0.00010420658,0.00019171747,0.00009290729],"domain_scores_gemma":[0.9995419,0.0001440727,0.000054513068,0.00019282872,0.000050751678,0.00001595399],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004003303,0.000051359573,0.00008001451,0.00007854367,0.00003320043,0.00012710998,0.00028363365,0.000022213228,0.000016620626],"category_scores_gemma":[0.000040970648,0.00003390566,0.000039517352,0.0005919052,0.00001641065,0.00017283454,0.00009427803,0.00004374566,0.00002857931],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[9.1147956e-7,0.00014280174,0.000087210254,0.00030469702,0.00004935071,0.0000014582222,0.002932874,0.013773496,0.0010497083,0.97615504,0.0012149841,0.0042874515],"study_design_scores_gemma":[0.00004661408,0.0000068510703,0.000116045965,0.00006540478,0.0000057565608,0.0000016598451,0.000027250739,0.96499205,0.00015193447,0.033894867,0.00065249845,0.000039050698],"about_ca_topic_score_codex":0.000007800025,"about_ca_topic_score_gemma":0.000013068013,"teacher_disagreement_score":0.95121855,"about_ca_system_score_codex":0.00002498406,"about_ca_system_score_gemma":0.00003701812,"threshold_uncertainty_score":0.13826329},"labels":[],"label_agreement":null},{"id":"W4391685089","doi":"10.1137/23m1597009","title":"Various Notions of Nonexpansiveness Coincide for Proximal Mappings of Functions","year":2024,"lang":"en","type":"article","venue":"SIAM Journal on Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Chongqing","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.012879784767656305,"score_gpt":0.25316713163343724,"score_spread":0.24028734686578093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391685089","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003040555,0.00008279003,0.9963925,0.0019148545,0.000497473,0.00016940359,0.000026382093,0.000048216105,0.0005643415],"genre_scores_gemma":[0.4679463,0.00011437959,0.5303692,0.00017539987,0.0001808067,0.000028199347,0.00006710286,0.000021689128,0.0010968759],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988503,0.000052995023,0.0004801779,0.00018959142,0.00030512628,0.0001218083],"domain_scores_gemma":[0.9985076,0.00017308955,0.00026086014,0.00016300587,0.0008332749,0.00006216795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035794778,0.000102916136,0.00018569415,0.0005054029,0.00015903651,0.00013082898,0.00023723136,0.00005895393,0.00008555032],"category_scores_gemma":[0.00012425041,0.00009066465,0.00018488655,0.0009461826,0.00002729794,0.0005562635,0.0000291472,0.000108751265,0.0000054346874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016643615,0.00009864166,0.000024318793,0.00004216655,0.00008712922,0.0000014452951,0.00023286008,0.919414,0.00037250124,0.07830669,0.00044895496,0.000954692],"study_design_scores_gemma":[0.00029320165,0.00019372048,0.00013504097,0.00010160407,0.000057560374,0.00003817633,0.000030454077,0.9962283,0.000612063,0.0013368174,0.0008799222,0.000093173345],"about_ca_topic_score_codex":0.0000044942562,"about_ca_topic_score_gemma":9.896065e-7,"teacher_disagreement_score":0.46764225,"about_ca_system_score_codex":0.00006132329,"about_ca_system_score_gemma":0.00024995013,"threshold_uncertainty_score":0.3697197},"labels":[],"label_agreement":null},{"id":"W4391852571","doi":"10.23952/jnva.8.2024.2.05","title":"Higher-order mixed duality for set-valued optimization problems","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"King Fahd University of Petroleum and Minerals","keywords":"Duality (order theory); Order (exchange); Set (abstract data type); Mathematics; Mathematical optimization; Applied mathematics; Computer science; Pure mathematics; Economics; Programming language","score_opus":0.02601638508285583,"score_gpt":0.2913374948269958,"score_spread":0.26532110974413997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391852571","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002599796,0.00036019122,0.9916538,0.007124931,0.00033015464,0.00008324933,0.00005297064,0.000034786786,0.00009991112],"genre_scores_gemma":[0.06613009,0.00014077264,0.9316296,0.000375837,0.00058573426,0.000008751497,0.00020518733,0.000012665634,0.00091139815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982642,0.00010955464,0.0007092197,0.00027585166,0.0005017029,0.00013949347],"domain_scores_gemma":[0.99791884,0.0003224161,0.00033728773,0.00014782535,0.0011580383,0.00011557442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011167641,0.00014216472,0.00035368104,0.0007584512,0.00015374132,0.0004370154,0.00025715612,0.00008123375,0.00017655367],"category_scores_gemma":[0.00014495467,0.000111799134,0.0003923919,0.002541262,0.00002104737,0.00079216174,0.000052146308,0.00011770949,0.0000035354014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000143786365,0.00009080421,0.00040676226,0.00003473499,0.002421216,0.0000024120375,0.00019224937,0.88282204,0.000018807472,0.112764,0.00043974788,0.00079283776],"study_design_scores_gemma":[0.00035491813,0.00005868838,0.0028150778,0.000013873987,0.0011998881,0.00000948236,0.000009876637,0.98706007,0.000008365035,0.004404313,0.0039319736,0.00013346777],"about_ca_topic_score_codex":0.000013340533,"about_ca_topic_score_gemma":0.000006257551,"teacher_disagreement_score":0.10835969,"about_ca_system_score_codex":0.00005316878,"about_ca_system_score_gemma":0.0002164231,"threshold_uncertainty_score":0.45590365},"labels":[],"label_agreement":null},{"id":"W4391852904","doi":"10.23952/jnva.8.2024.2.07","title":"On constraint qualifications for an infinite system of quasiconvex inequalities","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Jishou University; National Science and Technology Council; National Natural Science Foundation of China","keywords":"Quasiconvex function; Constraint (computer-aided design); Inequality; Mathematics; Pure mathematics; Mathematical economics; Mathematical analysis; Geometry; Subderivative; Regular polygon","score_opus":0.03695997312133393,"score_gpt":0.31102639622428335,"score_spread":0.27406642310294943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391852904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042356094,0.00011004051,0.993532,0.0015156566,0.00012405425,0.000054169395,0.0001652895,0.00002116353,0.00024199564],"genre_scores_gemma":[0.88183415,0.000027530077,0.11768531,0.00012704456,0.00017478007,0.0000026259163,0.00007570361,0.000005081761,0.000067791036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984675,0.00011716506,0.00076877774,0.00017520173,0.00038793846,0.00008343862],"domain_scores_gemma":[0.99769807,0.00088309264,0.000400904,0.00015701406,0.0007695517,0.000091351576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010815857,0.00009929933,0.0003367204,0.0009836205,0.00008792731,0.0001760167,0.00022630482,0.000051586634,0.00003416496],"category_scores_gemma":[0.0001322367,0.00007756393,0.00033342213,0.0011858607,0.00003069124,0.00044127763,0.000019177836,0.00008355137,0.0000019414385],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016769767,0.000105257546,0.00020908922,0.000053145657,0.0014243885,9.905825e-7,0.0005751741,0.058495402,0.00006140145,0.9381508,0.00006158585,0.00084599695],"study_design_scores_gemma":[0.0002218885,0.00017438897,0.0011911932,0.000033425393,0.00072240253,0.000009830438,0.00024354576,0.99010473,0.000032062406,0.006725105,0.0004532573,0.00008817199],"about_ca_topic_score_codex":0.000020798472,"about_ca_topic_score_gemma":0.000005758972,"teacher_disagreement_score":0.93160933,"about_ca_system_score_codex":0.000036398746,"about_ca_system_score_gemma":0.000220953,"threshold_uncertainty_score":0.31629652},"labels":[],"label_agreement":null},{"id":"W4391854493","doi":"10.23952/jnva.8.2024.2.04","title":"Variational inequalities, Ky Fan minimax inequality, and strong Nash equilibria in generalized games","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Minimax; Mathematical economics; Inequality; Variational inequality; Nash equilibrium; Mathematics; Ky Fan inequality; Applied mathematics; Mathematical optimization; Economics; Kantorovich inequality; Mathematical analysis; Linear inequality","score_opus":0.024881529968761938,"score_gpt":0.29486720645080894,"score_spread":0.269985676482047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391854493","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053279683,0.0012083737,0.93813294,0.0068134675,0.00020702499,0.00006566992,0.00008964326,0.000030253175,0.00017292562],"genre_scores_gemma":[0.80564606,0.00038961897,0.19241643,0.00045336699,0.00053345936,0.000004567443,0.0001440874,0.000013017515,0.00039938203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973075,0.0003249436,0.0010815168,0.00036065548,0.00072874164,0.00019667586],"domain_scores_gemma":[0.9982353,0.0006656066,0.00036321898,0.00016499817,0.00041222197,0.00015869175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019431774,0.00019714885,0.0005327573,0.0015016011,0.00009645704,0.0005733223,0.00029697927,0.00010001583,0.00020395675],"category_scores_gemma":[0.00024841764,0.00016569304,0.00027940332,0.0022655383,0.000037428134,0.0011405082,0.00015670467,0.00022521568,0.000003502795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006509518,0.00028979612,0.052931666,0.00007937391,0.0039234255,0.000050337414,0.0019644464,0.0589119,0.0003353475,0.8774091,0.00032084805,0.0037186875],"study_design_scores_gemma":[0.0005351074,0.000045205634,0.06363585,0.000025538058,0.0004622669,0.000028941604,0.000050725383,0.9235253,0.000005876045,0.0107058175,0.0008011615,0.00017821598],"about_ca_topic_score_codex":0.00015700753,"about_ca_topic_score_gemma":0.00008214645,"teacher_disagreement_score":0.8667033,"about_ca_system_score_codex":0.000082139995,"about_ca_system_score_gemma":0.00034375567,"threshold_uncertainty_score":0.67567664},"labels":[],"label_agreement":null},{"id":"W4391988389","doi":"10.4153/s0008439524000316","title":"On some convexity questions of Handelman","year":2024,"lang":"en","type":"preprint","venue":"Canadian Mathematical Bulletin","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convexity; Integrable system; Mathematics; Regular polygon; Pure mathematics; Economics; Geometry","score_opus":0.015329726493821074,"score_gpt":0.2429123747135787,"score_spread":0.22758264821975763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391988389","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003595145,0.0004898187,0.6918836,0.18991882,0.0012516872,0.0008801223,0.00043057484,0.00041955273,0.11113069],"genre_scores_gemma":[0.92122924,0.000035860405,0.060280275,0.0047987257,0.00016347141,0.000102984195,0.00009409009,0.000047265068,0.013248073],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863714,0.0000670806,0.0003881124,0.00040335045,0.00029053024,0.00021377114],"domain_scores_gemma":[0.9985436,0.00020011226,0.00010135931,0.0006290651,0.00014086925,0.00038497083],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003020874,0.00018343214,0.000330785,0.00039911325,0.00006720073,0.00017548601,0.00067483133,0.00020066302,0.004845278],"category_scores_gemma":[0.0003192959,0.00016708334,0.00018946346,0.00020784883,0.00006585821,0.000018660763,0.00034670808,0.00041526824,0.0075147916],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.7059729e-7,0.000031150703,8.463404e-7,0.00016040006,0.00005105577,0.000010650099,0.00010170501,0.0021823973,7.7279986e-7,0.98217064,0.015143163,0.00014676581],"study_design_scores_gemma":[0.000046584857,0.0000139026115,0.000019871097,0.00024679847,0.000037648115,0.0000022835623,0.0000037145155,0.15884845,0.000015908092,0.83711165,0.0034956,0.00015758492],"about_ca_topic_score_codex":0.0012232153,"about_ca_topic_score_gemma":0.00035663726,"teacher_disagreement_score":0.9176341,"about_ca_system_score_codex":0.00015952843,"about_ca_system_score_gemma":0.0006578019,"threshold_uncertainty_score":0.9960644},"labels":[],"label_agreement":null},{"id":"W4392201491","doi":"10.3390/axioms13030156","title":"Iterative Stability Analysis for Generalized α-Nonexpensive Mappings with Fixed Points","year":2024,"lang":"en","type":"article","venue":"Axioms","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"King Abdulaziz University","keywords":"Fixed point; Stability (learning theory); Mathematics; Applied mathematics; Computer science; Mathematical analysis","score_opus":0.023753221776090183,"score_gpt":0.261664722779933,"score_spread":0.23791150100384284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392201491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008625226,0.000064055355,0.9866148,0.0040194024,0.000082335035,0.00017958635,0.000023763374,0.00013450706,0.0002562938],"genre_scores_gemma":[0.87699527,0.000005372068,0.121194735,0.0007369146,0.00004381066,0.00006717253,0.00009468354,0.000007462389,0.00085456984],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890256,0.00006150991,0.0002005473,0.0004583379,0.00021999762,0.00015703999],"domain_scores_gemma":[0.99907076,0.000176505,0.000055919056,0.00029963764,0.0003299992,0.000067167384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001955869,0.00012000977,0.0002165876,0.00027251118,0.00010941416,0.00036526468,0.0002427059,0.00003482255,0.00018222946],"category_scores_gemma":[0.000040778203,0.00008849561,0.00019200772,0.0020440186,0.000028693237,0.0004554844,0.0000557422,0.000047866895,0.000028734617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006750717,0.00013529374,0.0012401707,0.000064848486,0.00456146,0.000018732431,0.009324554,0.02000684,0.0010317825,0.9599851,0.0013910306,0.0021727274],"study_design_scores_gemma":[0.00026627196,0.000052280207,0.0018104841,0.000007820795,0.0002729094,0.0000015785166,0.0000635152,0.9937016,0.00087224226,0.0017923753,0.0009996371,0.00015931718],"about_ca_topic_score_codex":0.000059427497,"about_ca_topic_score_gemma":0.000047903777,"teacher_disagreement_score":0.97369474,"about_ca_system_score_codex":0.00005072554,"about_ca_system_score_gemma":0.00007156971,"threshold_uncertainty_score":0.36087462},"labels":[],"label_agreement":null},{"id":"W4392374648","doi":"10.28924/2291-8639-22-2024-42","title":"A New Four-Step Iterative Approximation Scheme for Reich-Suzuki-Type Nonexpansive Operators in Banach Spaces","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Eusko Jaurlaritza","keywords":"Mathematics; Banach space; Scheme (mathematics); Type (biology); Pure mathematics; Mathematical analysis","score_opus":0.01438397302016907,"score_gpt":0.3015242865792421,"score_spread":0.287140313559073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392374648","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023982397,0.0005857425,0.9899771,0.00657874,0.00011984666,0.00014433441,0.000013509057,0.00001706345,0.00016539417],"genre_scores_gemma":[0.73557645,0.00029776865,0.2629101,0.00029978965,0.0003216342,0.0000389285,0.0000597718,0.000008930518,0.00048661928],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871397,0.000027717417,0.00053185114,0.00026099014,0.00036632485,0.00009915577],"domain_scores_gemma":[0.9983651,0.0001975897,0.00023404048,0.00013656089,0.000986748,0.00007994374],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037017622,0.00011427783,0.00023937202,0.0011355114,0.000070085734,0.0006627856,0.00046391526,0.000048545116,0.000048303355],"category_scores_gemma":[0.000065071064,0.00009647447,0.00021116156,0.0019468603,0.000017637727,0.0007868054,0.00005968914,0.00011403606,0.0000060694124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064852786,0.00023909177,0.0061091743,0.00003377156,0.006000009,0.000020796879,0.002364996,0.051304936,0.0022037544,0.8376385,0.0028347764,0.09118533],"study_design_scores_gemma":[0.00043524278,0.0000490698,0.0026235292,0.000042213505,0.00033575157,0.000022058553,0.0001543931,0.97049934,0.0004189557,0.00702952,0.018219719,0.00017019485],"about_ca_topic_score_codex":0.000052694322,"about_ca_topic_score_gemma":0.000056074212,"teacher_disagreement_score":0.9191944,"about_ca_system_score_codex":0.00008966838,"about_ca_system_score_gemma":0.00022137885,"threshold_uncertainty_score":0.63912565},"labels":[],"label_agreement":null},{"id":"W4392403996","doi":"10.23952/jano.6.2024.1.03","title":"Numerical computation of entropy-regularized quadratic optimization problems","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Computation; Quadratic equation; Applied mathematics; Mathematics; Entropy (arrow of time); Mathematical optimization; Computer science; Algorithm; Physics; Geometry; Thermodynamics","score_opus":0.007662265125497311,"score_gpt":0.2274391926198778,"score_spread":0.2197769274943805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392403996","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014537411,0.00024177125,0.9975468,0.0012428348,0.00020128342,0.00014453511,0.0000013219557,0.000054592587,0.00042147675],"genre_scores_gemma":[0.48889658,0.00013466128,0.51076025,0.000093667055,0.00006928384,0.0000036989459,0.0000145476,0.000011775493,0.000015526319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818045,0.000075632735,0.0008511221,0.00024804732,0.000499728,0.00014502405],"domain_scores_gemma":[0.9987596,0.00014288082,0.000499378,0.00011530397,0.00035639206,0.00012644289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037774554,0.00016227554,0.0003883841,0.00037904302,0.00008406585,0.0002419675,0.00021668336,0.00009077713,0.000054064792],"category_scores_gemma":[0.00005106767,0.0001318435,0.00012915436,0.0011099649,0.00003967767,0.00065656815,0.000045979534,0.00015710318,0.0000030305625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003487164,0.00010237375,0.000013529716,0.000057889774,0.000093267765,0.0000024320625,0.00035031783,0.95732933,0.00024341856,0.038103666,0.00007272718,0.0035961769],"study_design_scores_gemma":[0.00049937115,0.00014348552,0.00004425797,0.00006178671,0.000082244704,0.000025953937,0.000020322866,0.996034,0.00015712812,0.0026967234,0.00009900289,0.00013567459],"about_ca_topic_score_codex":0.0000035999492,"about_ca_topic_score_gemma":3.7064684e-8,"teacher_disagreement_score":0.4887512,"about_ca_system_score_codex":0.00005260871,"about_ca_system_score_gemma":0.00012203694,"threshold_uncertainty_score":0.5376422},"labels":[],"label_agreement":null},{"id":"W4392404031","doi":"10.23952/jano.6.2024.1.07","title":"On the linear convergence rate of generalized ADMM for convex composite programming","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Henan Province; National Natural Science Foundation of China","keywords":"Convergence (economics); Rate of convergence; Mathematics; Composite number; Regular polygon; Mathematical optimization; Applied mathematics; Linear programming; Computer science; Algorithm; Economics; Geometry","score_opus":0.013037206758040057,"score_gpt":0.2509826683118481,"score_spread":0.23794546155380808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392404031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008402569,0.00008838864,0.99593925,0.0027337796,0.00013828104,0.0001340668,0.0000021013982,0.00001595472,0.00010793204],"genre_scores_gemma":[0.5385737,0.00011867079,0.46049434,0.0006680363,0.00008295473,0.00000936123,0.0000066057387,0.000008018309,0.000038329512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924237,0.000036540903,0.00035963577,0.00012297192,0.00015706774,0.00008143929],"domain_scores_gemma":[0.99908966,0.00033917231,0.00023060883,0.00008029336,0.00020740913,0.00005288743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039786883,0.0000795687,0.000184766,0.00009904251,0.00007937108,0.00009961226,0.00017408705,0.000033751425,0.000029502755],"category_scores_gemma":[0.000041441184,0.00004922546,0.00008860133,0.0003903772,0.000028721932,0.0001466892,0.000025928075,0.00008005515,0.0000013373848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070290844,0.000038464168,0.000005208736,0.000018383222,0.00006871602,7.145687e-7,0.00016491841,0.68618536,0.00046438674,0.3103648,0.00020900661,0.0024097501],"study_design_scores_gemma":[0.0002716577,0.00010975118,0.000015224328,0.000021899217,0.000038567792,0.0000034889251,0.00001113444,0.9938505,0.001097259,0.0032623163,0.0012586878,0.00005950695],"about_ca_topic_score_codex":0.0000010315453,"about_ca_topic_score_gemma":2.4014788e-8,"teacher_disagreement_score":0.53773344,"about_ca_system_score_codex":0.000013049679,"about_ca_system_score_gemma":0.000047835325,"threshold_uncertainty_score":0.2007356},"labels":[],"label_agreement":null},{"id":"W4392404093","doi":"10.23952/jano.6.2024.1.04","title":"A new hybrid Halpern-based extragradient algorithm for a pseudomonotone equilibrium problem and a fixed point problem of nonexpansive mappings in Banach spaces","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Banach space; Fixed point; Mathematics; Algorithm; Point (geometry); Pure mathematics; Applied mathematics; Mathematical analysis; Geometry","score_opus":0.0063825247507114345,"score_gpt":0.22055230662088773,"score_spread":0.2141697818701763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392404093","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005557318,0.0002697411,0.99585134,0.0028066563,0.000040553678,0.0003276681,0.0000054227353,0.00001989197,0.00012301847],"genre_scores_gemma":[0.12783048,0.00007321092,0.8718676,0.000118931646,0.000046731402,0.000016026648,0.000008680437,0.000010677001,0.000027687773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871016,0.000026631988,0.0005940552,0.00026367564,0.00024962903,0.00015582604],"domain_scores_gemma":[0.9991273,0.0001508811,0.00031642843,0.00007942372,0.00018975777,0.00013618544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033771954,0.000144027,0.00035782822,0.00038193844,0.00003737327,0.00018532401,0.00014250215,0.000048981354,0.000011582944],"category_scores_gemma":[0.00001434556,0.00011755774,0.00008868548,0.0005727872,0.000028110897,0.0003681408,0.00004334451,0.00011210201,2.841527e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113970396,0.0001495957,0.000024699422,0.00012918097,0.000107244705,0.00000941923,0.0011164289,0.9260905,0.0011494274,0.013175895,0.00025814297,0.057675485],"study_design_scores_gemma":[0.0010160859,0.00025075217,0.000034702625,0.00010506127,0.000048938786,0.000025110145,0.00004839075,0.9931837,0.000762863,0.004231195,0.00016422858,0.00012897473],"about_ca_topic_score_codex":0.000019388306,"about_ca_topic_score_gemma":4.602278e-7,"teacher_disagreement_score":0.12727475,"about_ca_system_score_codex":0.00004501131,"about_ca_system_score_gemma":0.0001847024,"threshold_uncertainty_score":0.47938657},"labels":[],"label_agreement":null},{"id":"W4392404120","doi":"10.23952/jano.6.2024.1.02","title":"Tseng-type algorithms for solving variational inequalities over the solution sets of split variational inclusion problems with an application to a bilevel optimization problem","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Technion-Israel Institute of Technology","keywords":"Bilevel optimization; Variational inequality; Inclusion (mineral); Mathematical optimization; Type (biology); Mathematics; Optimization problem; Algorithm; Inequality; Computer science; Mathematical analysis; Sociology","score_opus":0.016482215035793793,"score_gpt":0.2631354231861637,"score_spread":0.2466532081503699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392404120","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020302995,0.00007345871,0.99645513,0.0024020285,0.000121472265,0.00060359546,0.000017900464,0.00004647394,0.00007688256],"genre_scores_gemma":[0.1753099,0.00004513892,0.823984,0.00026817224,0.00016992459,0.000056971534,0.00012974018,0.000020147103,0.000015979545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792916,0.00007217499,0.000777335,0.00034737197,0.0006949376,0.00017902568],"domain_scores_gemma":[0.9978062,0.00034982673,0.0005654073,0.00018032856,0.0009755055,0.00012275811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012191583,0.00019121279,0.0002864892,0.00037100964,0.00039436412,0.00026865327,0.0003232039,0.00010225697,0.00002645188],"category_scores_gemma":[0.00007151115,0.00013182953,0.0000723403,0.001225225,0.00003624611,0.00097517495,0.00016524702,0.00013906695,7.9769796e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012485094,0.00011292619,0.000017819528,0.000053039374,0.00008271689,2.231442e-7,0.0015607151,0.87210375,0.0002635657,0.11909075,0.00005192743,0.0065377057],"study_design_scores_gemma":[0.00048732365,0.0003907696,0.00031615177,0.00005823927,0.000089461835,0.000013630655,0.000037481106,0.9875228,0.000049126083,0.010577234,0.0002841438,0.00017364077],"about_ca_topic_score_codex":0.000019515883,"about_ca_topic_score_gemma":0.0000014580629,"teacher_disagreement_score":0.17510685,"about_ca_system_score_codex":0.000108898355,"about_ca_system_score_gemma":0.0002914326,"threshold_uncertainty_score":0.5375852},"labels":[],"label_agreement":null},{"id":"W4393151143","doi":"10.23952/asvao.6.2024.2.04","title":"Stability and existence of solutions for weak bilevel optimization problems","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bilevel optimization; Stability (learning theory); Mathematical optimization; Computer science; Mathematics; Optimization problem; Machine learning","score_opus":0.034524529619996566,"score_gpt":0.2569524523892896,"score_spread":0.22242792276929302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393151143","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016653296,0.00036850641,0.9978242,0.00056122476,0.000046691377,0.00038943478,0.000055352437,0.00012097734,0.0004671056],"genre_scores_gemma":[0.32477945,0.00042110187,0.67401356,0.00006175036,0.000027414697,0.00009770658,0.00049902324,0.0000135132395,0.00008645656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982222,0.00006268043,0.0005456331,0.0006567227,0.00028269496,0.00023010139],"domain_scores_gemma":[0.99887186,0.00018321256,0.00018837732,0.0003268973,0.00033131146,0.0000983228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008022535,0.00018840197,0.000367263,0.0005697604,0.0003078026,0.00032843548,0.00019609684,0.00010404878,0.00006519386],"category_scores_gemma":[0.00006099416,0.00017066377,0.00014863921,0.0027158496,0.00008803356,0.00050061796,0.00012888038,0.00006823022,8.46888e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005262598,0.00003700555,0.00008489229,0.00007153516,0.0003288957,6.198239e-8,0.0003641418,0.8230743,0.000119071345,0.17455532,0.000016067153,0.0013434469],"study_design_scores_gemma":[0.00024061257,0.000030492285,0.00019788033,0.000014583574,0.00072502217,8.348127e-7,0.00008639369,0.9959052,0.00009457707,0.0024436084,0.00007055469,0.0001902008],"about_ca_topic_score_codex":0.000039335584,"about_ca_topic_score_gemma":0.000018642419,"teacher_disagreement_score":0.32461292,"about_ca_system_score_codex":0.00003983063,"about_ca_system_score_gemma":0.000078701385,"threshold_uncertainty_score":0.6959467},"labels":[],"label_agreement":null},{"id":"W4393151209","doi":"10.23952/asvao.6.2024.2.08","title":"Optimality conditions for nonconvex mathematical programming problems using weak subdifferentials and augmented normal cones","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Đại học Đà Nẵng","keywords":"Mathematical optimization; Mathematics; Computer science; Applied mathematics","score_opus":0.02447864129062956,"score_gpt":0.28811232583099855,"score_spread":0.263633684540369,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393151209","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021637455,0.00013940853,0.9963613,0.00040037668,0.00004628413,0.0005383969,0.00004318854,0.00016824667,0.00013903655],"genre_scores_gemma":[0.48323193,0.000079155776,0.5156481,0.000077128745,0.000048921418,0.0001437781,0.0006444834,0.000017737704,0.00010876022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827754,0.000063564345,0.00053480075,0.00060220767,0.0002737948,0.00024811408],"domain_scores_gemma":[0.9990844,0.00017202471,0.00016228177,0.00022474914,0.00022475571,0.00013180288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005042949,0.00022276847,0.00042486677,0.0005162894,0.0004043287,0.00092766166,0.00015362739,0.00010747121,0.00010278495],"category_scores_gemma":[0.000034668046,0.00019775618,0.00016385883,0.0015709158,0.00008003847,0.00047349677,0.00010403572,0.00007897945,0.000002259243],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000723009,0.00007185749,0.00013815502,0.00014586389,0.0010666224,5.1733446e-7,0.00038459786,0.78599995,0.0002538088,0.21042408,0.000025662763,0.0014816794],"study_design_scores_gemma":[0.00035776512,0.00002241193,0.00014650472,0.000023500275,0.0015546985,0.000003807373,0.000086024,0.99386925,0.00010073349,0.0035278797,0.00007037949,0.00023702635],"about_ca_topic_score_codex":0.000024077395,"about_ca_topic_score_gemma":0.000008353164,"teacher_disagreement_score":0.4810682,"about_ca_system_score_codex":0.000049275277,"about_ca_system_score_gemma":0.00006298809,"threshold_uncertainty_score":0.8945463},"labels":[],"label_agreement":null},{"id":"W4393170727","doi":"10.23952/asvao.6.2024.2.05","title":"Generalized viscosity inertial Tseng’s method with adaptive step sizes for solving pseudomonotone variational inequalities with fixed point constraints","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Inyuvesi Yakwazulu-Natali; National Research Foundation","keywords":"Inertial frame of reference; Variational inequality; Fixed point; Viscosity; Mathematics; Applied mathematics; Point (geometry); Mathematical optimization; Mathematical analysis; Physics; Classical mechanics; Geometry; Thermodynamics","score_opus":0.016459875657489926,"score_gpt":0.26276958849119375,"score_spread":0.24630971283370381,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393170727","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051517587,0.00005754041,0.9978279,0.00059867615,0.00004229188,0.0004561008,0.00007864298,0.00019205184,0.00023164913],"genre_scores_gemma":[0.25175047,0.000026596785,0.74706316,0.0002665899,0.00007213781,0.0001315135,0.0005480872,0.000019999376,0.00012142498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99769586,0.00016582319,0.0005203261,0.00082585204,0.0005104559,0.00028167566],"domain_scores_gemma":[0.9983421,0.0004586373,0.0002570787,0.00029351344,0.00051783776,0.00013083687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083792116,0.00032424033,0.0005677421,0.0006348506,0.00039339418,0.0007074264,0.00022812108,0.000110634326,0.00011915827],"category_scores_gemma":[0.000044505436,0.0002447599,0.00015010776,0.0025456797,0.0000961352,0.0006149626,0.00008231467,0.00012134869,0.0000018763542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015123232,0.000040459297,0.000057173904,0.000020255267,0.0017814554,0.0000014299892,0.0007681612,0.73570466,0.00012305983,0.26022747,0.000044313743,0.0010803451],"study_design_scores_gemma":[0.0011464539,0.00011454058,0.00019013003,0.000021017651,0.00157514,0.000005205465,0.00028819882,0.9952969,0.00026929693,0.0006893099,0.000027209971,0.00037660165],"about_ca_topic_score_codex":0.00016639322,"about_ca_topic_score_gemma":0.00010131089,"teacher_disagreement_score":0.25959226,"about_ca_system_score_codex":0.00007980252,"about_ca_system_score_gemma":0.0002199093,"threshold_uncertainty_score":0.99810183},"labels":[],"label_agreement":null},{"id":"W4393443251","doi":"10.23952/jano.6.2024.2.07","title":"On approximate positively properly efficient solutions in nonsmooth semi-infinite multiobjective optimization problems with data uncertainty","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Multi-objective optimization; Mathematics; Applied mathematics; Computer science","score_opus":0.016073939679707213,"score_gpt":0.23526598263677026,"score_spread":0.21919204295706304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393443251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025285257,0.00008478136,0.99695426,0.0012434595,0.000076268625,0.0002937086,0.000015600779,0.0000527685,0.0010262695],"genre_scores_gemma":[0.6314337,0.00011384222,0.36802453,0.00023822603,0.000052280873,0.000016321417,0.00008230767,0.000019305284,0.000019432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983376,0.000074017466,0.0005042068,0.0004321709,0.0004420093,0.00020999131],"domain_scores_gemma":[0.9989405,0.00017904572,0.00026556794,0.0002358821,0.000268781,0.00011021808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005468505,0.00018571,0.00027465262,0.00047504157,0.00015409094,0.00034677272,0.00034712968,0.00007266368,0.000017453893],"category_scores_gemma":[0.000050263865,0.000130379,0.00004214176,0.0013518664,0.00004841489,0.00061152846,0.000119077755,0.00025733304,0.000002656219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011200559,0.0002126088,0.000010825092,0.000020596808,0.00006260918,0.000007370732,0.00054100016,0.97371995,0.000023792472,0.023251738,0.000036226822,0.0020012427],"study_design_scores_gemma":[0.00067807635,0.00023204606,0.00008456806,0.0001323082,0.000049718405,0.000025422449,0.00005356152,0.998199,0.000012544067,0.00029210807,0.000066984496,0.00017364866],"about_ca_topic_score_codex":0.000014032493,"about_ca_topic_score_gemma":0.0000014244218,"teacher_disagreement_score":0.6311809,"about_ca_system_score_codex":0.00016414482,"about_ca_system_score_gemma":0.00019599703,"threshold_uncertainty_score":0.53167015},"labels":[],"label_agreement":null},{"id":"W4393443269","doi":"10.23952/jano.6.2024.2.05","title":"Pontryagin optimality conditions for generalized bilevel optimal control problems with pure state inequality constraints","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pontryagin's minimum principle; Optimal control; Bilevel optimization; Inequality; Mathematics; Mathematical economics; Control (management); State (computer science); Mathematical optimization; Maximum principle; Applied mathematics; Economics; Optimization problem; Mathematical analysis","score_opus":0.01176881556444719,"score_gpt":0.25060960242217994,"score_spread":0.23884078685773275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393443269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001039125,0.0000934515,0.9955636,0.002579466,0.00009950006,0.00033109772,0.000074060896,0.000059425187,0.00016022418],"genre_scores_gemma":[0.5649218,0.000048293892,0.43450478,0.0003573316,0.00006763295,0.000026999305,0.000036291236,0.000011556002,0.000025319521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850994,0.000061256265,0.00061242847,0.00028813342,0.0003326092,0.00019564062],"domain_scores_gemma":[0.99869907,0.00021785908,0.00033808907,0.00012657547,0.0004442316,0.00017420451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057855266,0.000176512,0.00037397235,0.00020101898,0.00015135811,0.00039070222,0.00019983288,0.00006669909,0.000058247126],"category_scores_gemma":[0.00003721887,0.00012700279,0.00011046997,0.00049851707,0.00008889681,0.00056102074,0.000028116618,0.00015743126,0.0000014937287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012734503,0.00008938035,0.000030362447,0.000042276908,0.00020581527,0.000004580699,0.00025650734,0.93933535,0.00016150893,0.057188798,0.00017121705,0.0023868494],"study_design_scores_gemma":[0.0017420857,0.00019476839,0.00017269753,0.000031769632,0.00013358222,0.0000466653,0.000022061715,0.9927296,0.00006539498,0.004367595,0.00031519216,0.00017859992],"about_ca_topic_score_codex":0.0000029390233,"about_ca_topic_score_gemma":2.7741305e-7,"teacher_disagreement_score":0.5638827,"about_ca_system_score_codex":0.00005055822,"about_ca_system_score_gemma":0.00020748768,"threshold_uncertainty_score":0.5179023},"labels":[],"label_agreement":null},{"id":"W4393562725","doi":"10.5281/zenodo.4110025","title":"Near-optimal robust bilevel linear instances","year":2020,"lang":"en","type":"dataset","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Bilevel optimization; Computer science; Mathematics; Mathematical optimization; Algorithm; Optimization problem","score_opus":0.05064478226336799,"score_gpt":0.24864429454260698,"score_spread":0.19799951227923898,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393562725","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000026238267,0.000048432506,0.25442702,0.0026932233,0.00020573373,0.0002903773,0.7383789,0.00080632395,0.0031473858],"genre_scores_gemma":[0.00008952298,0.0002592799,0.02085986,0.0007908129,0.00030724303,6.686392e-8,0.97687733,0.00050835125,0.00030754128],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971892,0.00036698554,0.00044264007,0.00084485835,0.00077580486,0.0003805013],"domain_scores_gemma":[0.9976793,0.000038615424,0.00029760977,0.00086647796,0.0008214548,0.0002965294],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00046916117,0.0002853115,0.0003161847,0.00031963227,0.0023850997,0.002541044,0.0036571138,0.00016838429,0.008927701],"category_scores_gemma":[0.0006649427,0.0002920265,0.00013146258,0.0016374671,0.00013742688,0.0005791844,0.0027261747,0.00053838437,0.025877811],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013047007,0.00009484081,8.362799e-8,0.00005094243,0.000082605526,0.000018175266,0.00014779635,0.010391781,0.000006052095,0.0016331672,0.9829002,0.004661279],"study_design_scores_gemma":[0.0002618417,0.000120403,0.00001245741,0.000023026756,0.000031054406,0.000029270477,0.000018575567,0.075365655,0.00000585305,0.000042465304,0.9237914,0.00029798626],"about_ca_topic_score_codex":0.000026742004,"about_ca_topic_score_gemma":6.742236e-7,"teacher_disagreement_score":0.23849842,"about_ca_system_score_codex":0.00013534335,"about_ca_system_score_gemma":0.000027093683,"threshold_uncertainty_score":0.9999532},"labels":[],"label_agreement":null},{"id":"W4393616030","doi":"10.23952/jano.6.2024.2.01","title":"Primal and dual second-order necessary optimality conditions in bilevel programming","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bilevel optimization; Dual (grammatical number); Order (exchange); Mathematical optimization; Computer science; Mathematics; Economics; Optimization problem; Philosophy","score_opus":0.009523742768348347,"score_gpt":0.2521858338886716,"score_spread":0.24266209112032325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393616030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027916967,0.00020421753,0.994421,0.0015689991,0.000085991975,0.00008695865,0.00000325706,0.000029863515,0.00080798764],"genre_scores_gemma":[0.566609,0.00009098371,0.4329942,0.00020102985,0.000056932313,0.000005149446,0.000009676289,0.0000062468953,0.000026749198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990411,0.000032028034,0.00040593787,0.00019889719,0.00020158057,0.000120473705],"domain_scores_gemma":[0.9994738,0.00010879572,0.00013566637,0.00006632105,0.000117288386,0.000098099255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031619842,0.0001012788,0.00019747217,0.00026781287,0.00007690483,0.00029575074,0.000093544375,0.000059329082,0.00008889361],"category_scores_gemma":[0.000025696996,0.00008368586,0.000038039103,0.0007272045,0.000037080994,0.0006439829,0.000061460225,0.00016886824,0.0000013369277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000404381,0.00018046568,0.00047994487,0.00006369685,0.00009265288,0.000029346418,0.0008041541,0.84806836,0.00014929177,0.12836899,0.00019057828,0.021532105],"study_design_scores_gemma":[0.00034259312,0.000058358564,0.001789973,0.000023390208,0.000023999279,0.000056549336,0.000044434513,0.9942526,0.000027506856,0.0025179505,0.0007516451,0.000110977846],"about_ca_topic_score_codex":0.0000026285747,"about_ca_topic_score_gemma":3.960302e-7,"teacher_disagreement_score":0.5638174,"about_ca_system_score_codex":0.0000303117,"about_ca_system_score_gemma":0.00009297082,"threshold_uncertainty_score":0.34126106},"labels":[],"label_agreement":null},{"id":"W4393618622","doi":"10.23952/jnva.8.2024.3.03","title":"Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Technology Planning Project of Shenzhen Municipality; Department of Education of Guangdong Province; Shenzhen University; National Natural Science Foundation of China","keywords":"Subgradient method; Bregman divergence; Regular polygon; Mathematics; Convex optimization; Mathematical optimization; Applied mathematics; Geometry","score_opus":0.02586037608595399,"score_gpt":0.3274527099345255,"score_spread":0.30159233384857154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393618622","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007861476,0.0007047031,0.99308157,0.005053002,0.00012972717,0.00011997502,0.00004330552,0.000028173417,0.000053382326],"genre_scores_gemma":[0.19958943,0.00008570667,0.79949164,0.00019121128,0.00023808957,0.000009009999,0.000045334986,0.000009796788,0.00033976158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981186,0.0001683598,0.00068009377,0.000372688,0.0004915468,0.00016872336],"domain_scores_gemma":[0.9977487,0.00066740304,0.00036330015,0.00021973264,0.00084347394,0.00015740155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017867446,0.0001697155,0.00047574463,0.00061999384,0.00016766372,0.000393194,0.00031895304,0.000060218004,0.000050045794],"category_scores_gemma":[0.00015006344,0.000116412855,0.00045114977,0.0021238965,0.00003926324,0.0006681074,0.00004241212,0.00015387674,0.0000021519638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024774042,0.0022585217,0.01722171,0.00031969126,0.014353128,0.000024998582,0.002985549,0.17241289,0.0001739438,0.76649755,0.0004877071,0.023016594],"study_design_scores_gemma":[0.00038617846,0.00032379426,0.0058097686,0.000026660562,0.0012700605,0.000025536738,0.000025654546,0.97788227,0.000016541153,0.009006222,0.0050673736,0.00015994118],"about_ca_topic_score_codex":0.000021356056,"about_ca_topic_score_gemma":0.000047473623,"teacher_disagreement_score":0.8054694,"about_ca_system_score_codex":0.000088974055,"about_ca_system_score_gemma":0.00024525743,"threshold_uncertainty_score":0.47471786},"labels":[],"label_agreement":null},{"id":"W4393619867","doi":"10.23952/jnva.8.2024.3.01","title":"Editorial: A special issue on mathematical optimization and applications","year":2024,"lang":"en","type":"editorial","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Management science; Engineering","score_opus":0.005875416991156993,"score_gpt":0.2663284836132323,"score_spread":0.2604530666220753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393619867","genre_codex":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[2.6351935e-7,0.00013391914,0.6494925,0.0012463812,0.3483639,0.00008861275,0.00013331784,0.000021019825,0.00052009954],"genre_scores_gemma":[0.0000038154512,0.0006532497,0.12493209,0.00007363046,0.8731974,0.000009410813,0.00025985722,0.000017959706,0.0008526154],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99662656,0.00011889925,0.0009985258,0.0004688938,0.0016260424,0.00016106857],"domain_scores_gemma":[0.9961465,0.0011264277,0.0007980161,0.00027042234,0.0014561809,0.0002024631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009900512,0.00029804208,0.00076591445,0.0013908251,0.00017588481,0.00070182997,0.00044837568,0.00046666525,0.00029325762],"category_scores_gemma":[0.0005274229,0.00024055826,0.00042247574,0.0017405385,0.000045430097,0.0004026666,0.00015474652,0.00065473694,0.00004145956],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023327531,0.00018513674,0.000005345551,0.00006088237,0.0024883682,0.000004211743,0.00012537857,0.09522449,4.635014e-7,0.017225044,0.8834403,0.0012170376],"study_design_scores_gemma":[0.00022049241,0.00006963506,0.0000067162364,0.000028969493,0.001918962,0.0000038310855,0.0000069119883,0.39171585,3.337971e-7,0.005293986,0.6005699,0.0001643755],"about_ca_topic_score_codex":0.0000065720956,"about_ca_topic_score_gemma":0.0000036493093,"teacher_disagreement_score":0.52483344,"about_ca_system_score_codex":0.00009424992,"about_ca_system_score_gemma":0.00040387418,"threshold_uncertainty_score":0.9809681},"labels":[],"label_agreement":null},{"id":"W4393621040","doi":"10.23952/jnva.8.2024.3.04","title":"A Bregman projection algorithm with self adaptive step sizes for split variational inequality problems involving non-Lipschitz operators","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Centre Scientifique et Technique du Bâtiment; Fundamental Research Funds for the Central Universities; Natural Science Foundation of Chongqing; National Natural Science Foundation of China","keywords":"Variational inequality; Lipschitz continuity; Projection (relational algebra); Mathematics; Bregman divergence; Inequality; Algorithm; Applied mathematics; Mathematical optimization; Computer science; Mathematical analysis","score_opus":0.015251073378332708,"score_gpt":0.25972472163458715,"score_spread":0.24447364825625445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393621040","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00167909,0.00021601362,0.9956213,0.0019113666,0.00016239137,0.0002191601,0.00009217421,0.00005018367,0.000048309612],"genre_scores_gemma":[0.08353197,0.00008205278,0.9152785,0.00020295696,0.000587416,0.000026745172,0.000113705086,0.000016196538,0.00016048513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99760646,0.00013972398,0.0008279844,0.00043606723,0.00078945095,0.00020031047],"domain_scores_gemma":[0.99718225,0.00047374272,0.0004898932,0.00016578876,0.0015371627,0.00015114616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014399756,0.00023126054,0.00048317402,0.001030325,0.0002982209,0.00062815635,0.00029301702,0.00010043378,0.000042997923],"category_scores_gemma":[0.00008955366,0.00016989623,0.000369913,0.0027287696,0.000026062986,0.0013731965,0.000068513196,0.00022485139,0.0000029529335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003051665,0.0016806413,0.011148667,0.00033893532,0.032612093,0.000036911028,0.006454005,0.5117112,0.00017170493,0.4110548,0.00071942346,0.023766516],"study_design_scores_gemma":[0.00064518524,0.00028832327,0.011801588,0.000047078767,0.0014745911,0.000036071073,0.000067420675,0.9823405,0.000009767751,0.0023611777,0.00070591463,0.00022237748],"about_ca_topic_score_codex":0.00008277271,"about_ca_topic_score_gemma":0.00005256537,"teacher_disagreement_score":0.47062936,"about_ca_system_score_codex":0.0001394236,"about_ca_system_score_gemma":0.00065811345,"threshold_uncertainty_score":0.69281673},"labels":[],"label_agreement":null},{"id":"W4393621155","doi":"10.23952/jnva.8.2024.3.07","title":"A parameterized three-operator splitting algorithm for non-convex minimization problems with applications","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Guangzhou University","keywords":"Parameterized complexity; Operator splitting; Minification; Regular polygon; Operator (biology); Convex optimization; Algorithm; Mathematics; Convex analysis; Computer science; Mathematical optimization; Applied mathematics","score_opus":0.011351709448222043,"score_gpt":0.2527101792319024,"score_spread":0.2413584697836804,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393621155","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00035018093,0.00017949338,0.99718606,0.0019172034,0.00005808137,0.00020217401,0.00004781477,0.000026739419,0.000032244385],"genre_scores_gemma":[0.029035946,0.00006193479,0.97002935,0.0001922767,0.00036416092,0.000048607937,0.00011133572,0.000011610292,0.00014475538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985284,0.000037733105,0.0006066807,0.00029532242,0.00039636905,0.00013547935],"domain_scores_gemma":[0.9982099,0.0003293053,0.00033153204,0.00015016652,0.000867043,0.000112068345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058135216,0.00014513166,0.00036425973,0.0006959998,0.00018080755,0.0004938839,0.00024151216,0.00006178803,0.000039477673],"category_scores_gemma":[0.000037755664,0.000104784216,0.0002779227,0.0021733448,0.000023372033,0.0006646425,0.00003548528,0.0001103743,0.0000032788685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001338111,0.0011150993,0.008249754,0.00036528276,0.026496543,0.00002709749,0.002107938,0.5733267,0.0007700753,0.16152476,0.00045412197,0.2254288],"study_design_scores_gemma":[0.00044819264,0.00009830967,0.0015657657,0.000023210197,0.0012031061,0.000021719854,0.000015049273,0.9923401,0.00001909104,0.0017654339,0.0023627812,0.00013724381],"about_ca_topic_score_codex":0.000009601249,"about_ca_topic_score_gemma":0.000009158247,"teacher_disagreement_score":0.41901338,"about_ca_system_score_codex":0.000039815168,"about_ca_system_score_gemma":0.00024892928,"threshold_uncertainty_score":0.4762534},"labels":[],"label_agreement":null},{"id":"W4394779291","doi":"10.1016/j.na.2024.113542","title":"Corrigendum to ‘Applications of Strassen’s theorem and Choquet theory to optimal transport problems, to uniformly convex functions and to uniformly smooth functions’ [Nonlinear Anal., 232 (2023) 113267]","year":2024,"lang":"en","type":"erratum","venue":"Nonlinear Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; University of Toronto","funders":"","keywords":"Mathematics; Regular polygon; Proposition; Danskin's theorem; Strassen algorithm; Pure mathematics; Mathematical economics; Brouwer fixed-point theorem; Fixed-point theorem; Physics","score_opus":0.01194797003726988,"score_gpt":0.24731168309268475,"score_spread":0.23536371305541487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394779291","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038253397,0.00040247312,0.9813981,0.0054890597,0.0014860957,0.0014262538,0.004198391,0.00023779769,0.004979265],"genre_scores_gemma":[0.0064782463,0.00060259434,0.3633702,0.005739431,0.001921902,0.0011390216,0.0094623845,0.00024275263,0.61104345],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99490494,0.00016316504,0.0013687972,0.0018729034,0.0010417701,0.0006484517],"domain_scores_gemma":[0.9955675,0.0001403475,0.0003425555,0.00149845,0.0012810492,0.0011700974],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011582917,0.00076945534,0.0013849915,0.004254865,0.00046146754,0.00046929138,0.0011142957,0.00045117963,0.0006008713],"category_scores_gemma":[0.000113863694,0.00071419025,0.0006160223,0.012493919,0.00010325717,0.00036907868,0.00045396702,0.0007293298,0.0003173109],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035095558,0.0014876779,0.002173085,0.00089781056,0.016654108,0.00003815435,0.006835259,0.4601934,0.00022201895,0.053313125,0.43331337,0.024521029],"study_design_scores_gemma":[0.00027508917,0.0004161162,0.002148252,0.00012841368,0.00434275,0.0000079275305,0.0008448206,0.22763947,0.000018725545,0.00041630524,0.76268077,0.0010813583],"about_ca_topic_score_codex":0.00055994943,"about_ca_topic_score_gemma":0.0035327345,"teacher_disagreement_score":0.6180279,"about_ca_system_score_codex":0.00019750792,"about_ca_system_score_gemma":0.0007254891,"threshold_uncertainty_score":0.9995309},"labels":[],"label_agreement":null},{"id":"W4396559761","doi":"10.23952/jnva.8.2024.4.08","title":"Nonlinear strict cone separation theorems in real normed spaces","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cone (formal languages); Separation (statistics); Mathematics; Nonlinear system; Pure mathematics; Algorithm; Physics; Statistics","score_opus":0.013685969555848143,"score_gpt":0.2955155321612319,"score_spread":0.2818295626053837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396559761","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039240994,0.0005042114,0.95309025,0.0059952624,0.0002397345,0.00007010157,0.000035758,0.00003646682,0.00078723213],"genre_scores_gemma":[0.82045203,0.0010286318,0.17713186,0.00023050146,0.0005922776,0.0000026355754,0.000106718566,0.000010311293,0.00044505365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981634,0.0001623517,0.0007136962,0.00024977874,0.000569268,0.00014148856],"domain_scores_gemma":[0.9985806,0.00046607436,0.00028682736,0.00013651395,0.00042377962,0.00010623833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012742555,0.00013907797,0.00036983137,0.0014588735,0.000081805745,0.0004311219,0.00026204786,0.000078538185,0.00012206803],"category_scores_gemma":[0.00013462044,0.00010784193,0.00028386182,0.0033126106,0.000025349227,0.0009052349,0.000053208263,0.00019574296,0.000010948671],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001826346,0.0008799605,0.04546565,0.000068952555,0.0071086637,0.00016989128,0.002990927,0.4459393,0.00073324924,0.48731962,0.00060367765,0.008537457],"study_design_scores_gemma":[0.00030545428,0.000061675,0.028478308,0.000015571824,0.00045304236,0.000019406905,0.000036085832,0.96676636,0.000024379304,0.0026171266,0.0011015479,0.00012101916],"about_ca_topic_score_codex":0.000095415155,"about_ca_topic_score_gemma":0.00009018907,"teacher_disagreement_score":0.781211,"about_ca_system_score_codex":0.000072865805,"about_ca_system_score_gemma":0.00026368586,"threshold_uncertainty_score":0.43976662},"labels":[],"label_agreement":null},{"id":"W4396566733","doi":"10.23952/jnva.8.2024.4.12","title":"Convex sets approximable as the sum of a compact set and a cone","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cone (formal languages); Regular polygon; Set (abstract data type); Combinatorics; Mathematics; Convex set; Dual cone and polar cone; Computer science; Algorithm; Geometry; Convex optimization; Programming language","score_opus":0.017130644669410812,"score_gpt":0.28192944249186536,"score_spread":0.2647987978224545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396566733","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03726868,0.002111165,0.9341368,0.025551915,0.0001575704,0.000094547366,0.00008923265,0.000022187485,0.00056789146],"genre_scores_gemma":[0.96909755,0.00030107296,0.029727923,0.00042822806,0.0001134444,6.8596347e-7,0.000023912964,0.000004789421,0.00030238123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874145,0.000099849894,0.00047816243,0.00015559397,0.00043537482,0.00008954678],"domain_scores_gemma":[0.9986576,0.00043678505,0.00028485604,0.00012436676,0.0004118569,0.00008457909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008580733,0.00009752846,0.00033219246,0.0004570011,0.00010162819,0.0002314331,0.00021683775,0.000040430856,0.00011360878],"category_scores_gemma":[0.00009175525,0.00006032128,0.00022493243,0.0014411382,0.000051286865,0.00039392902,0.000053794683,0.00013244865,0.0000033984682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001617858,0.00058172847,0.027527932,0.00019960679,0.025709923,0.0000709826,0.0068430626,0.15042639,0.00080048863,0.7793296,0.0027359764,0.0056125517],"study_design_scores_gemma":[0.00023480036,0.00005703443,0.013023927,0.0000148335885,0.00093594706,0.000064498796,0.000054298063,0.9788034,0.000028224842,0.004904469,0.001806348,0.00007221993],"about_ca_topic_score_codex":0.00006969035,"about_ca_topic_score_gemma":0.0000073522833,"teacher_disagreement_score":0.93182886,"about_ca_system_score_codex":0.000016440526,"about_ca_system_score_gemma":0.00017318808,"threshold_uncertainty_score":0.24598303},"labels":[],"label_agreement":null},{"id":"W4396568207","doi":"10.23952/jnva.8.2024.4.04","title":"Subdifferential calculus and ideal solutions for set optimization problems","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii; Ministerul Cercetării, Inovării şi Digitalizării","keywords":"Subderivative; Ideal (ethics); Calculus (dental); Mathematics; Set (abstract data type); Mathematical optimization; Applied mathematics; Mathematical economics; Computer science; Philosophy; Epistemology; Regular polygon; Geometry; Medicine; Convex optimization","score_opus":0.02337657879043771,"score_gpt":0.2738330498924152,"score_spread":0.2504564711019775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396568207","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006098414,0.00060113874,0.9939628,0.0045030206,0.0001446128,0.00006650748,0.000062745654,0.000020880016,0.000028433107],"genre_scores_gemma":[0.42122808,0.00058464764,0.57666564,0.00025547663,0.00066587905,0.000010268961,0.00023480388,0.000013691327,0.00034153112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987767,0.00005786146,0.00048849924,0.00021654363,0.00031654924,0.00014387624],"domain_scores_gemma":[0.9988519,0.00024313718,0.00019911717,0.00008518992,0.0005094207,0.00011124961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067057123,0.000110287474,0.0002619912,0.0007143985,0.00021787529,0.00041591426,0.00014652699,0.00006209025,0.000055739438],"category_scores_gemma":[0.000086312764,0.0000877049,0.000256237,0.0011392994,0.000023535316,0.00060045964,0.00006540119,0.00009647916,0.000001070583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015005708,0.000074673444,0.0004873683,0.000037279704,0.0022400785,0.0000027208052,0.00037674702,0.8310912,0.000053976808,0.16362406,0.00028226175,0.0017146239],"study_design_scores_gemma":[0.00028382541,0.000056721008,0.0024950572,0.000011575464,0.0011411255,0.00002511154,0.000012984251,0.99192095,0.0000032337227,0.0029927844,0.00095664454,0.00010000355],"about_ca_topic_score_codex":0.00002008243,"about_ca_topic_score_gemma":0.0000132031255,"teacher_disagreement_score":0.42061824,"about_ca_system_score_codex":0.000033482662,"about_ca_system_score_gemma":0.00013871043,"threshold_uncertainty_score":0.40106708},"labels":[],"label_agreement":null},{"id":"W4396568915","doi":"10.23952/jnva.8.2024.4.11","title":"Characterization of E-Benson proper efficient solutions of vector optimization problems with variable ordering structures in linear spaces","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board; Chongqing University; National Natural Science Foundation of China","keywords":"Characterization (materials science); Variable (mathematics); Mathematics; Vector optimization; Mathematical optimization; Computer science; Optimization problem; Mathematical economics; Applied mathematics; Materials science; Mathematical analysis; Nanotechnology","score_opus":0.01125904404186292,"score_gpt":0.22868611054513996,"score_spread":0.21742706650327703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396568915","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035975583,0.00013675839,0.9630184,0.00064867496,0.00007581506,0.00008053349,0.000029745706,0.000009919752,0.00002456907],"genre_scores_gemma":[0.7086406,0.000076204255,0.29109168,0.000016045578,0.00007295169,0.000002117101,0.000058593552,0.000006802357,0.000035044497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99845946,0.00008127913,0.00068569276,0.00019174865,0.00047007113,0.00011172041],"domain_scores_gemma":[0.9984241,0.00009947016,0.00049071363,0.00011563138,0.0008190336,0.00005105981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055955513,0.00011579653,0.0003542164,0.0010899137,0.00005948774,0.000096067,0.00016871968,0.00005734286,0.000070225426],"category_scores_gemma":[0.000068348454,0.000082885555,0.00011962935,0.0031352695,0.000029438434,0.00044687078,0.000045772427,0.00011346388,3.1203612e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021071613,0.00012272519,0.0012504025,0.00007188923,0.0006464711,0.0000013788572,0.00045394976,0.9673187,0.0032018095,0.026760343,8.265004e-7,0.0001504428],"study_design_scores_gemma":[0.0002566963,0.000085337255,0.009609016,0.00009361107,0.0004350238,0.000008813804,0.000020112895,0.98895764,0.0002187776,0.00017648652,0.000049373128,0.00008913277],"about_ca_topic_score_codex":0.00006475043,"about_ca_topic_score_gemma":0.000014203151,"teacher_disagreement_score":0.67266494,"about_ca_system_score_codex":0.00004925363,"about_ca_system_score_gemma":0.00024975362,"threshold_uncertainty_score":0.3379975},"labels":[],"label_agreement":null},{"id":"W4396678147","doi":"10.28924/2291-8639-22-2024-77","title":"An Algorithm for Nonlinear Problems Based on Fixed Point Methodologies With Applications","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Nonlinear system; Mathematics; Fixed point; Algorithm; Point (geometry); Fixed-point theorem; Mathematical optimization; Calculus (dental); Discrete mathematics; Mathematical analysis; Geometry; Medicine","score_opus":0.02484396467627621,"score_gpt":0.33771500461722737,"score_spread":0.31287103994095117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396678147","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000020866806,0.00010179748,0.9945469,0.004807084,0.000037536756,0.00020796838,0.0000832304,0.00004750347,0.00014714636],"genre_scores_gemma":[0.0465433,0.00008312055,0.95217127,0.00044536707,0.00029054403,0.00022416253,0.00013449705,0.000009230913,0.00009852216],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875176,0.000053372274,0.00040773698,0.00029455638,0.00039843432,0.000094127136],"domain_scores_gemma":[0.9980758,0.00041605398,0.00024325207,0.0002450129,0.00092476147,0.00009512603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005864883,0.00011627544,0.00021546896,0.00087334705,0.00011536821,0.0004800384,0.0006234077,0.0000404797,0.00002409989],"category_scores_gemma":[0.000017458475,0.00008375052,0.00022407967,0.0011929397,0.000039261267,0.000415325,0.00002757133,0.00010193056,0.000003235267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022220605,0.0004318689,0.00024505405,0.000017032255,0.0029370456,0.0000041082685,0.00015716118,0.36777383,0.000173445,0.15077516,0.00022972884,0.47723332],"study_design_scores_gemma":[0.00022095638,0.00012922268,0.00030177084,0.000014348527,0.0004447096,0.000010406951,0.000034898498,0.9721704,0.000202056,0.0054110205,0.020953195,0.00010700992],"about_ca_topic_score_codex":0.000008125024,"about_ca_topic_score_gemma":0.000012288038,"teacher_disagreement_score":0.6043966,"about_ca_system_score_codex":0.00004524579,"about_ca_system_score_gemma":0.00011577363,"threshold_uncertainty_score":0.46290213},"labels":[],"label_agreement":null},{"id":"W4398236802","doi":"10.1007/s10107-024-02092-1","title":"A characterization of maximal homogeneous-quadratic-free sets","year":2024,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Characterization (materials science); Homogeneous; Quadratic equation; Numerical analysis; Combinatorics; Discrete mathematics; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.015584046408120339,"score_gpt":0.25287113773625985,"score_spread":0.23728709132813952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4398236802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005111102,0.000034881647,0.99196696,0.0014000861,0.000070081755,0.00014705854,0.0000038350136,0.00023122279,0.0010347788],"genre_scores_gemma":[0.5077624,0.0000044286135,0.49165434,0.000072130315,0.00004107175,0.000035148765,0.000021860433,0.000013483618,0.00039515406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894834,0.00003264826,0.00033436096,0.00022248241,0.00030858055,0.00015356988],"domain_scores_gemma":[0.9993574,0.00009766295,0.00006059784,0.000341584,0.00008171054,0.00006107186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026503977,0.00009754501,0.00016332549,0.00013329343,0.000052549625,0.0002926613,0.00040955015,0.00004537201,0.00013543501],"category_scores_gemma":[0.0001221814,0.000080096004,0.000100031124,0.0006517711,0.000028132332,0.00032441047,0.00015430828,0.00006272693,0.0000917374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016256301,0.00014394705,0.000014871332,0.00029053495,0.0000661434,0.0000141492965,0.0008814794,0.00005610025,0.0038901845,0.87876505,0.000031086194,0.11584481],"study_design_scores_gemma":[0.00009348221,0.00004249256,0.00007596993,0.00009396707,0.0000377231,0.000024047335,0.000013823039,0.9365519,0.0018208162,0.059541494,0.0015656659,0.00013860695],"about_ca_topic_score_codex":0.0000013140897,"about_ca_topic_score_gemma":5.14919e-7,"teacher_disagreement_score":0.93649584,"about_ca_system_score_codex":0.00001836466,"about_ca_system_score_gemma":0.000040907064,"threshold_uncertainty_score":0.32662204},"labels":[],"label_agreement":null},{"id":"W4399041129","doi":"10.1080/02331934.2024.2358086","title":"Optimality conditions for bilevel programmes via Moreau envelope reformulation*","year":2024,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Bilevel optimization; Mathematics; Envelope (radar); Mathematical optimization; Applied mathematics; Mathematical economics; Optimization problem; Computer science","score_opus":0.019653196089471827,"score_gpt":0.2972087012561994,"score_spread":0.2775555051667276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399041129","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025876028,0.000062018575,0.99355257,0.0037095244,0.00028450962,0.00041000807,0.000041958985,0.0004849653,0.0014285796],"genre_scores_gemma":[0.123260565,0.000031524625,0.8737632,0.00027056318,0.00011247085,0.00021755528,0.0010484502,0.000018823204,0.0012768473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99879223,0.000037554484,0.00032854793,0.00041635087,0.00023071388,0.00019460356],"domain_scores_gemma":[0.9990999,0.0001108929,0.0000791273,0.0002793776,0.00035166214,0.00007902017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002819167,0.00014074935,0.000134292,0.00025495162,0.00026686324,0.0005120841,0.00027280694,0.000081497215,0.00016422285],"category_scores_gemma":[0.00006968807,0.0001259567,0.000120825884,0.0010536099,0.000026277408,0.0011897302,0.000058484922,0.00005885708,0.000039973977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000025492063,0.000042421907,0.000044710396,0.00002206311,0.000045130077,6.367731e-7,0.0001333424,0.7935101,0.000022256387,0.19872425,0.00068909815,0.0067634755],"study_design_scores_gemma":[0.00017350425,0.00002921899,0.00029927897,0.000015244695,0.000033095053,0.0000049253495,0.0000056920267,0.9867063,0.00008786796,0.008304585,0.0041693337,0.00017090977],"about_ca_topic_score_codex":0.000019681745,"about_ca_topic_score_gemma":0.000003808759,"teacher_disagreement_score":0.19319628,"about_ca_system_score_codex":0.00009520287,"about_ca_system_score_gemma":0.00012876016,"threshold_uncertainty_score":0.5136366},"labels":[],"label_agreement":null},{"id":"W4399525519","doi":"10.1007/s10957-024-02469-4","title":"Directional Derivative of the Value Function for Parametric Set-Constrained Optimization Problems","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Theory of computation; Directional derivative; Parametric statistics; Mathematical optimization; Set (abstract data type); Function (biology); Derivative (finance); Value (mathematics); Parametric programming; Bellman equation; Applied mathematics; Algorithm; Mathematical analysis; Computer science; Statistics","score_opus":0.011051055988377318,"score_gpt":0.24836058291853402,"score_spread":0.2373095269301567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399525519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038737486,0.00039425652,0.9973771,0.0012197805,0.00019572036,0.00038910148,0.000013861272,0.000032992124,0.00033842394],"genre_scores_gemma":[0.39664584,0.00041492225,0.601345,0.00034428676,0.00029674877,0.0001856722,0.000047320613,0.000024928535,0.00069524895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998817,0.00016048126,0.00052011805,0.00018284285,0.00023240091,0.00008715511],"domain_scores_gemma":[0.99801147,0.00068676774,0.00044711755,0.00015971385,0.0006435789,0.000051332237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009606744,0.00010488784,0.00015966714,0.00032912844,0.0002462716,0.0001466829,0.00025963187,0.00006315336,0.000036802398],"category_scores_gemma":[0.00021062711,0.00007500968,0.00015212118,0.0016674115,0.000081729464,0.0005880064,0.000040423958,0.00010225505,5.3461844e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010709146,0.000032571996,0.000014351138,0.000020749643,0.000070691225,2.942873e-8,0.000092299575,0.5970414,0.00003463983,0.40065205,0.000038417787,0.001992079],"study_design_scores_gemma":[0.0002530156,0.0000628437,0.000091661524,0.000041031926,0.00012941918,0.000021588605,0.000059691807,0.9498832,0.00022844765,0.047443647,0.0017016169,0.000083837615],"about_ca_topic_score_codex":6.682456e-7,"about_ca_topic_score_gemma":1.4972471e-7,"teacher_disagreement_score":0.39660713,"about_ca_system_score_codex":0.00003777313,"about_ca_system_score_gemma":0.00016759595,"threshold_uncertainty_score":0.3058806},"labels":[],"label_agreement":null},{"id":"W4400259585","doi":"10.1007/s10957-024-02485-4","title":"State-Dependent Sweeping Processes: Asymptotic Behavior and Algorithmic Approaches","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Theory of computation; Mathematics; State (computer science); State dependent; Applied mathematics; Mathematical optimization; Mathematical economics; Algorithm","score_opus":0.01581851546151451,"score_gpt":0.24916689482874468,"score_spread":0.23334837936723019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400259585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031904047,0.0015027235,0.9971262,0.00062054093,0.000043586024,0.00016606657,0.0000043718974,0.000044198536,0.00017326041],"genre_scores_gemma":[0.6652142,0.0021511407,0.33149764,0.00019077149,0.00020704286,0.00012827224,0.00001637398,0.000023770637,0.0005707926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991277,0.000080148384,0.00033879105,0.00019199053,0.00017568543,0.00008571897],"domain_scores_gemma":[0.9991966,0.00021882413,0.00016931731,0.00011295756,0.0002130555,0.000089269524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066097773,0.00009373556,0.00012872179,0.00024120713,0.00016905606,0.00041513363,0.00019022233,0.00003619677,0.000021333084],"category_scores_gemma":[0.000045852412,0.00007833435,0.00003641642,0.00057378213,0.000043817156,0.0007731344,0.000054540884,0.00010793938,0.0000027608635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072905355,0.000113967166,0.00011108618,0.00009187433,0.00009470436,0.0000043700643,0.00070386886,0.44376364,0.000024587789,0.50700605,0.0000142996105,0.04806428],"study_design_scores_gemma":[0.000305477,0.00006038813,0.00026565033,0.00006522167,0.00018966096,0.0002569888,0.00025244374,0.9548789,0.0001849466,0.04259662,0.0007316041,0.00021210147],"about_ca_topic_score_codex":4.879315e-7,"about_ca_topic_score_gemma":2.632608e-7,"teacher_disagreement_score":0.6656286,"about_ca_system_score_codex":0.000022269343,"about_ca_system_score_gemma":0.00011606298,"threshold_uncertainty_score":0.4003143},"labels":[],"label_agreement":null},{"id":"W4400959697","doi":"10.23952/jano.6.2024.3.09","title":"A self-adaptive algorithm with multi-step inertia for solving convex bilevel optimization problems","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Tianjin Municipal Education Commission","keywords":"Bilevel optimization; Inertia; Mathematical optimization; Computer science; Regular polygon; Algorithm; Convex optimization; Mathematics; Optimization problem; Physics","score_opus":0.012680389766965283,"score_gpt":0.22778450855343294,"score_spread":0.21510411878646765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400959697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000058572514,0.0001972966,0.9984395,0.00068301347,0.00012967705,0.00029958508,0.000005116151,0.00009488057,0.00014506889],"genre_scores_gemma":[0.020382423,0.00016669139,0.9790352,0.000196929,0.00011540909,0.000026134949,0.000016799544,0.000022106104,0.000038322243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986808,0.000023641836,0.00050231605,0.00030046792,0.00031473575,0.00017804014],"domain_scores_gemma":[0.99879795,0.0001518785,0.00032671966,0.00010578044,0.0004835112,0.00013417067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003165496,0.00018116178,0.0003043887,0.00029904896,0.0001485837,0.0003648517,0.00019906997,0.00008544144,0.000017490793],"category_scores_gemma":[0.00002149058,0.00013172699,0.00008528442,0.00075245544,0.00002607338,0.000747838,0.000047014222,0.00014416839,0.0000014365147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003846025,0.000107807224,0.0000051885736,0.000032487467,0.00016197193,0.0000027504952,0.0004647091,0.97613925,0.000019498246,0.008876585,0.00006982494,0.014081448],"study_design_scores_gemma":[0.0009129042,0.00026434826,0.00001435902,0.00005064783,0.00011461431,0.000033792014,0.00004607686,0.99757963,0.000048191967,0.00023262684,0.00051633775,0.00018645948],"about_ca_topic_score_codex":0.0000027490842,"about_ca_topic_score_gemma":2.2707908e-7,"teacher_disagreement_score":0.021440374,"about_ca_system_score_codex":0.000069440546,"about_ca_system_score_gemma":0.00015712665,"threshold_uncertainty_score":0.53716713},"labels":[],"label_agreement":null},{"id":"W4400959818","doi":"10.23952/jano.6.2024.3.08","title":"On fixed point iterative methods for solving non-Lipschitz quasi-monotone variational inequalities","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lipschitz continuity; Monotone polygon; Variational inequality; Fixed point; Mathematics; Applied mathematics; Inequality; Fixed-point theorem; Iterative method; Point (geometry); Mathematical analysis; Mathematical optimization; Geometry","score_opus":0.015111775827970629,"score_gpt":0.3083736395106421,"score_spread":0.2932618636826715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400959818","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040796294,0.00007959352,0.9959558,0.0028961548,0.00028295832,0.0001415758,0.000004824664,0.000032545322,0.00056570227],"genre_scores_gemma":[0.12300849,0.000047753096,0.87597996,0.00066901825,0.00017980601,0.000016962984,0.000018197547,0.000011589846,0.00006823869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987722,0.000072119845,0.00054503063,0.00023233872,0.00024639405,0.00013190645],"domain_scores_gemma":[0.9981619,0.0010962579,0.00027312717,0.00009471565,0.00027626188,0.00009774383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009669354,0.00014262497,0.00028599857,0.0003105756,0.0001504961,0.00039779322,0.00016974099,0.00006743147,0.000050010553],"category_scores_gemma":[0.00017763936,0.00011195835,0.00012363747,0.00045334615,0.00001879207,0.0005493455,0.00004285856,0.00014604654,0.0000024656663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006630477,0.00007313697,0.0000013945514,0.000018129149,0.00009403838,8.467253e-7,0.0009252942,0.5930985,0.00019052663,0.3960297,0.0002589919,0.00924307],"study_design_scores_gemma":[0.00040215533,0.00022110403,0.000028398932,0.000033764292,0.000042698874,0.000008090369,0.00004438711,0.96622413,0.00025842266,0.0320918,0.00051601423,0.00012901383],"about_ca_topic_score_codex":0.0000017712648,"about_ca_topic_score_gemma":5.259708e-8,"teacher_disagreement_score":0.3731256,"about_ca_system_score_codex":0.000058096226,"about_ca_system_score_gemma":0.000108821696,"threshold_uncertainty_score":0.4565529},"labels":[],"label_agreement":null},{"id":"W4401016180","doi":"10.3390/axioms13080502","title":"Efficiency of a New Iterative Algorithm Using Fixed-Point Approach in the Settings of Uniformly Convex Banach Spaces","year":2024,"lang":"en","type":"article","venue":"Axioms","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Regular polygon; Banach space; Fixed point; Mathematics; Uniformly convex space; Iterative method; Algorithm; Mathematical optimization; Computer science; Discrete mathematics; Lp space; Mathematical analysis; Eberlein–Šmulian theorem; Geometry","score_opus":0.016893035565318255,"score_gpt":0.2618968558443583,"score_spread":0.24500382027904002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401016180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005221279,0.00020785622,0.992215,0.001191626,0.000052128198,0.00009387294,0.0000043382565,0.000017606191,0.0009963112],"genre_scores_gemma":[0.88638675,0.0000058664464,0.113272265,0.00015722195,0.000025662166,0.000002240915,0.000006493024,0.0000035367705,0.00013995937],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991228,0.00006796229,0.00024666436,0.00019081344,0.00026906794,0.000102714526],"domain_scores_gemma":[0.99951625,0.00011374757,0.000088314584,0.00018189632,0.00007627155,0.000023549783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045695767,0.00007629376,0.00014144446,0.00020747358,0.000036303085,0.00010572132,0.0003691369,0.000029669807,0.000018547857],"category_scores_gemma":[0.000024347251,0.000050508163,0.000067427405,0.001583271,0.000037849935,0.00029170606,0.000067591325,0.00007407859,0.000002638707],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005055735,0.0002957735,0.00023496419,0.0001508622,0.00014744702,0.000011616883,0.091309674,0.08410528,0.00070373854,0.7983252,0.0005238816,0.024186507],"study_design_scores_gemma":[0.00009494816,0.00002879427,0.00022449721,0.000032906428,0.000012764656,0.0000059932145,0.0008144905,0.9974735,0.00036775894,0.0008155022,0.00007043059,0.00005843457],"about_ca_topic_score_codex":0.00031833645,"about_ca_topic_score_gemma":0.0000029077116,"teacher_disagreement_score":0.91336817,"about_ca_system_score_codex":0.000019697985,"about_ca_system_score_gemma":0.00012689857,"threshold_uncertainty_score":0.20596631},"labels":[],"label_agreement":null},{"id":"W4401285986","doi":"10.23952/jnva.8.2024.5.04","title":"Several accelerated iterative algorithms for the multiple-set split common fixed-point problem of quasi-nonexpansive operators","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Tianjin Municipal Education Commission","keywords":"Fixed point; Algorithm; Set (abstract data type); Point (geometry); Computer science; Iterative method; Mathematics; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.029566360662077372,"score_gpt":0.3069010079058518,"score_spread":0.27733464724377443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401285986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032176517,0.00034939373,0.9903815,0.005536523,0.000125951,0.00015239957,0.00019965005,0.000014232918,0.000022710214],"genre_scores_gemma":[0.6395391,0.00017215704,0.35907903,0.00042936212,0.00036839198,0.000013848696,0.00014851091,0.000011787885,0.00023775447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99816436,0.00013109023,0.00084732065,0.00024147418,0.0004779915,0.0001377674],"domain_scores_gemma":[0.9967955,0.0011578131,0.00043151813,0.00015821998,0.0013683249,0.00008861867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092127104,0.00016278678,0.00046532435,0.00054939336,0.00020660115,0.00037889526,0.00037823064,0.00006758729,0.0000855159],"category_scores_gemma":[0.00011527952,0.00010187871,0.00047305954,0.0018899802,0.000038943806,0.0007145001,0.00007630536,0.00017848333,0.0000020440782],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015901796,0.00053020165,0.004698389,0.000090175716,0.016178098,0.00001745269,0.0063420595,0.8848916,0.00039555525,0.07649566,0.0010578006,0.009143937],"study_design_scores_gemma":[0.0004345087,0.00014622312,0.00472001,0.000024770588,0.0010416732,0.000015506079,0.00012137092,0.9910728,0.00011791447,0.0013390769,0.00084495114,0.000121193574],"about_ca_topic_score_codex":0.00006756876,"about_ca_topic_score_gemma":0.000032614567,"teacher_disagreement_score":0.6363215,"about_ca_system_score_codex":0.00004976722,"about_ca_system_score_gemma":0.00024493737,"threshold_uncertainty_score":0.41544932},"labels":[],"label_agreement":null},{"id":"W4401286238","doi":"10.23952/asvao.6.2024.3.03","title":"New inertial proximal algorithms for solving multivalued variational inequalities","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Inertial frame of reference; Variational inequality; Algorithm; Inequality; Mathematics; Computer science; Applied mathematics; Mathematical analysis; Physics; Classical mechanics","score_opus":0.02193920736837902,"score_gpt":0.2723068559334333,"score_spread":0.2503676485650543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401286238","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000062852734,0.00014809828,0.99739593,0.0012418152,0.00014671631,0.0003092838,0.00003448655,0.0002673778,0.00039343003],"genre_scores_gemma":[0.098133914,0.00004571556,0.8993084,0.0002883443,0.0003239315,0.00008915358,0.00084993267,0.00002250686,0.00093811954],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979441,0.00006041364,0.0005526062,0.0007240698,0.00045099124,0.00026780617],"domain_scores_gemma":[0.9989746,0.00022341622,0.0001540557,0.0002673207,0.00023139919,0.00014915856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00070449937,0.00024765386,0.00037681055,0.00079631706,0.0003236942,0.0009252757,0.00028356814,0.0001251075,0.00014921182],"category_scores_gemma":[0.000086808795,0.00022475056,0.00023678681,0.0025154573,0.000024782734,0.0006606853,0.00011228113,0.00010020415,0.0000068698214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010753652,0.0000203273,0.000041582476,0.000019036137,0.00068825664,4.240445e-7,0.00066132157,0.6570833,0.00009336334,0.33612356,0.00026763912,0.004990507],"study_design_scores_gemma":[0.00047308335,0.000023082539,0.0002232042,0.000009007955,0.00076220965,0.0000010509283,0.000058575202,0.993056,0.000122028156,0.004668604,0.0003153706,0.00028775784],"about_ca_topic_score_codex":0.00012378211,"about_ca_topic_score_gemma":0.000014781101,"teacher_disagreement_score":0.3359728,"about_ca_system_score_codex":0.000065856904,"about_ca_system_score_gemma":0.00019638997,"threshold_uncertainty_score":0.9165062},"labels":[],"label_agreement":null},{"id":"W4401286307","doi":"10.23952/asvao.6.2024.3.04","title":"Optimality conditions and duality for E-differentiable fractional multiobjective interval valued optimization problems with E-invexity","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chongqing Jiaotong University; Chongqing Municipal Education Commission; National Natural Science Foundation of China","keywords":"Differentiable function; Duality (order theory); Mathematics; Interval (graph theory); Omega; Applied mathematics; Mathematical optimization; Mathematical economics; Pure mathematics; Combinatorics; Physics","score_opus":0.017241376518577295,"score_gpt":0.2707839141049116,"score_spread":0.25354253758633427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401286307","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013389132,0.00009573033,0.99642944,0.000595628,0.0000627211,0.00067269,0.00014215613,0.0002787872,0.0003839023],"genre_scores_gemma":[0.46026066,0.00008958616,0.53718805,0.00020050496,0.00006031287,0.00025463777,0.001735252,0.00002419777,0.00018678718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99750334,0.00014251724,0.00056499464,0.0010451403,0.00045208746,0.00029191116],"domain_scores_gemma":[0.9985148,0.00022378154,0.00025532543,0.00034634097,0.00048410892,0.00017568989],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068241364,0.00033575154,0.0005104619,0.0006881416,0.00063865073,0.0009871791,0.00020166223,0.00016066672,0.00017111909],"category_scores_gemma":[0.000050506344,0.0002899631,0.00018630068,0.0023492414,0.00012750573,0.0010344248,0.00011793158,0.00017336107,0.00000281614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035610883,0.000098794626,0.00041337436,0.000067484565,0.0013373422,5.328966e-7,0.00044917836,0.9077777,0.000022712786,0.089518316,0.00006010425,0.00021882556],"study_design_scores_gemma":[0.0007382901,0.00006702418,0.0018805058,0.000024877732,0.0014944646,0.000004402549,0.000104315,0.99300045,0.00007138369,0.0021948225,0.000051661395,0.00036779806],"about_ca_topic_score_codex":0.00011857482,"about_ca_topic_score_gemma":0.000053038875,"teacher_disagreement_score":0.45924142,"about_ca_system_score_codex":0.000104446255,"about_ca_system_score_gemma":0.00011073036,"threshold_uncertainty_score":0.99995524},"labels":[],"label_agreement":null},{"id":"W4401286308","doi":"10.23952/asvao.6.2024.3.05","title":"A new stepsize strategy for Korpelevich’s algorithm solving variational inequalities","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational inequality; Mathematics; Inequality; Mathematical optimization; Applied mathematics; Algorithm; Computer science; Calculus (dental); Mathematical analysis; Medicine","score_opus":0.02210928143807291,"score_gpt":0.2684482322796023,"score_spread":0.24633895084152937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401286308","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012971755,0.00031606853,0.9976774,0.0007088456,0.00010189587,0.00023858048,0.000048763475,0.000232205,0.00066330325],"genre_scores_gemma":[0.042862255,0.00012783964,0.95401937,0.00034423056,0.00022888283,0.00006450839,0.00085175753,0.000021904334,0.0014792744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980343,0.00007252726,0.00053406844,0.0006835478,0.00041812335,0.0002574149],"domain_scores_gemma":[0.9988832,0.00030671337,0.00015668863,0.000280997,0.00022294956,0.00014947739],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00067720935,0.00023983308,0.0003779706,0.0007317527,0.0002887631,0.001166266,0.000278946,0.00011941386,0.0002517167],"category_scores_gemma":[0.000041019015,0.0002230582,0.00022775761,0.0026686073,0.00002017017,0.00064422097,0.00008457535,0.00009414373,0.000009340127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034571224,0.00001312049,0.000016102713,0.000016124812,0.0006736942,4.18673e-7,0.00033388595,0.63258505,0.000010344366,0.3435143,0.00027785782,0.022555647],"study_design_scores_gemma":[0.0003290249,0.00002294507,0.00015945217,0.000008787128,0.0008093925,0.0000012246359,0.00009875948,0.98840046,0.000024218189,0.009411118,0.00046255483,0.0002720566],"about_ca_topic_score_codex":0.00012144566,"about_ca_topic_score_gemma":0.000023106275,"teacher_disagreement_score":0.3558154,"about_ca_system_score_codex":0.000060552025,"about_ca_system_score_gemma":0.0002246081,"threshold_uncertainty_score":0.9998706},"labels":[],"label_agreement":null},{"id":"W4401286311","doi":"10.23952/asvao.6.2024.3.10","title":"The relaxed regularized method of extragradient type for equilibrium problems","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Type (biology); Applied mathematics; Mathematics; Computer science; Mathematical economics; Mathematical optimization; Geology","score_opus":0.016156799536376165,"score_gpt":0.2721117248313574,"score_spread":0.25595492529498126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401286311","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013431435,0.00035553976,0.9979564,0.00076459255,0.0000909245,0.00030798468,0.000009405124,0.00008956752,0.0002912943],"genre_scores_gemma":[0.08936815,0.00031083895,0.9091554,0.00009014481,0.00004560657,0.00007733081,0.0002781,0.000017337621,0.0006570637],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985153,0.00009168553,0.00047364924,0.0004551044,0.00028251598,0.00018176598],"domain_scores_gemma":[0.9987777,0.0003318093,0.0001801006,0.00037447095,0.00027088358,0.00006503735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009316744,0.00014758993,0.00029889974,0.00034119713,0.00022140982,0.00036232715,0.00030509965,0.00007084408,0.000017789413],"category_scores_gemma":[0.000059204714,0.000102904894,0.00020129059,0.0034570445,0.00004125947,0.00019967728,0.00008386512,0.000067027046,0.0000016722687],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012832238,0.000016165119,0.00001713901,0.000022659611,0.0006640367,1.1585892e-7,0.0002707586,0.7682842,0.00030356494,0.2258902,0.000115714625,0.00440263],"study_design_scores_gemma":[0.00021476152,0.000029979257,0.00011069439,0.0000061561336,0.000822791,7.226858e-7,0.000027601736,0.99374294,0.00020603552,0.0038647598,0.0008466945,0.00012683951],"about_ca_topic_score_codex":0.000014852708,"about_ca_topic_score_gemma":0.000013706464,"teacher_disagreement_score":0.22545879,"about_ca_system_score_codex":0.000026919153,"about_ca_system_score_gemma":0.000060581773,"threshold_uncertainty_score":0.41963398},"labels":[],"label_agreement":null},{"id":"W4401286329","doi":"10.23952/asvao.6.2024.3.06","title":"Penalty method for set-valued quasi-equilibrium problems","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Set (abstract data type); Mathematical economics; Mathematical optimization; Mathematics; Computer science; Applied mathematics; Programming language","score_opus":0.020370418599399726,"score_gpt":0.28899722269990474,"score_spread":0.268626804100505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401286329","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009338009,0.00032854365,0.9964054,0.0011922322,0.00013308898,0.00054003665,0.000051857467,0.00038853186,0.0008668911],"genre_scores_gemma":[0.07676024,0.00012611326,0.9200906,0.00059806445,0.00015303513,0.00021239131,0.001122222,0.000041768126,0.0008955286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99695677,0.00020343284,0.0007333493,0.0011612822,0.0005421331,0.00040304102],"domain_scores_gemma":[0.9983659,0.00030939252,0.00023871016,0.0005662623,0.00031731123,0.00020242146],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016146662,0.00036106564,0.00062089594,0.0010256779,0.00039060062,0.0011125314,0.0004818179,0.0001821546,0.00017467665],"category_scores_gemma":[0.00007267539,0.00031964813,0.00041253417,0.004676403,0.00004264291,0.0006802866,0.00016820853,0.0001813305,0.000019829295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011113544,0.000055137607,0.000034352495,0.00006877391,0.0010355883,8.645879e-7,0.00070160284,0.84640205,0.00014961165,0.14715517,0.00042622464,0.0039595263],"study_design_scores_gemma":[0.0004283149,0.000051365096,0.00006898413,0.00001420071,0.0015469951,0.0000027390918,0.000080111546,0.99224395,0.00016258268,0.003834307,0.00116349,0.00040294477],"about_ca_topic_score_codex":0.00007447862,"about_ca_topic_score_gemma":0.000023528666,"teacher_disagreement_score":0.14584193,"about_ca_system_score_codex":0.00007787096,"about_ca_system_score_gemma":0.00012535577,"threshold_uncertainty_score":0.99992555},"labels":[],"label_agreement":null},{"id":"W4401286365","doi":"10.23952/asvao.6.2024.3.08","title":"Two new self-adaptive extragradient algorithms with pseudomonotone mappings","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Strong","keywords":"Algorithm; Computer science","score_opus":0.009884107117179913,"score_gpt":0.23109648752296544,"score_spread":0.22121238040578553,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401286365","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025604476,0.00019336319,0.99615264,0.00076307246,0.000054477034,0.00023160414,0.0000070589917,0.00036566053,0.001976056],"genre_scores_gemma":[0.16367924,0.00016653862,0.8349504,0.00030641846,0.000098653436,0.000032680473,0.00017586905,0.000021025939,0.0005692087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976785,0.00007250571,0.000484249,0.0009251329,0.0005582385,0.0002813469],"domain_scores_gemma":[0.9988988,0.00007979146,0.00017950505,0.0004383176,0.00017522198,0.00022837624],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044229682,0.00030038538,0.0004483222,0.0008607291,0.00025479004,0.000844107,0.0003265639,0.00008250054,0.00014570239],"category_scores_gemma":[0.0000070284805,0.00023642949,0.00018243639,0.005036021,0.000036190104,0.0005533464,0.00010311409,0.00014497613,0.00002562176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001006123,0.00004113402,0.000052646817,0.0000067733927,0.00145112,0.000005374755,0.00095781364,0.80283165,0.000014527324,0.18936884,0.00014833253,0.005111738],"study_design_scores_gemma":[0.00047016735,0.00004525261,0.00022730764,0.000010550426,0.0012455538,0.0000064245273,0.00009768996,0.9960761,0.00006218538,0.0011320125,0.0002985507,0.00032820125],"about_ca_topic_score_codex":0.00015768937,"about_ca_topic_score_gemma":0.000029335642,"teacher_disagreement_score":0.19324447,"about_ca_system_score_codex":0.0000844421,"about_ca_system_score_gemma":0.0001361125,"threshold_uncertainty_score":0.9641315},"labels":[],"label_agreement":null},{"id":"W4401286375","doi":"10.23952/asvao.6.2024.3.07","title":"Two new inertial relaxed CQ algorithms for a class of bilevel variational inequalities with the split feasibility problem constraints","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Class (philosophy); Bilevel optimization; Variational inequality; Inertial frame of reference; Mathematics; Algorithm; Inequality; Mathematical optimization; Computer science; Artificial intelligence; Optimization problem; Mathematical analysis; Physics; Classical mechanics","score_opus":0.029927537731216432,"score_gpt":0.2784316637808924,"score_spread":0.24850412604967598,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401286375","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031389744,0.000064741034,0.99636525,0.0021578998,0.000036325084,0.00047845638,0.000079341604,0.00008713966,0.00041697497],"genre_scores_gemma":[0.33822122,0.000020196956,0.6606111,0.00022239063,0.00008543886,0.00007096317,0.00046144685,0.000013136339,0.00029412904],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980827,0.00011423584,0.00054949324,0.0005878095,0.00047070158,0.00019503821],"domain_scores_gemma":[0.9984986,0.00038111166,0.0002590625,0.00034046764,0.00042648325,0.000094231145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010051524,0.00021128834,0.00038474915,0.0003897036,0.00022677094,0.00037614544,0.000291197,0.00008127722,0.00009633241],"category_scores_gemma":[0.000053956377,0.00014113002,0.00016023786,0.0029813254,0.00012666671,0.00033570122,0.000078969,0.00010199989,0.0000015469561],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002451489,0.000030838306,0.00012683134,0.000022809627,0.0007073478,1.9380433e-7,0.0006581311,0.607708,0.000035947025,0.38817006,0.000100760015,0.0024146226],"study_design_scores_gemma":[0.0007309485,0.000042021045,0.00057250314,0.000011761303,0.00091544475,0.0000015140449,0.00013398952,0.99234456,0.0000545788,0.004916495,0.000087469765,0.0001887114],"about_ca_topic_score_codex":0.00015075279,"about_ca_topic_score_gemma":0.000065576816,"teacher_disagreement_score":0.3846366,"about_ca_system_score_codex":0.000054719778,"about_ca_system_score_gemma":0.0003478672,"threshold_uncertainty_score":0.5755115},"labels":[],"label_agreement":null},{"id":"W4401399850","doi":"10.1142/9789811267048_0004","title":"Two Heuristic Methods for Solving Generalized Nash Equilibrium Problems Using a Novel Penalty Function","year":2024,"lang":"en","type":"book-chapter","venue":"Series on computers and operations research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Penalty method; Mathematical optimization; Nash equilibrium; Heuristic; Function (biology); Computer science; Mathematics; Applied mathematics; Mathematical economics","score_opus":0.1415827206551833,"score_gpt":0.41428727808191906,"score_spread":0.27270455742673577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401399850","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000132955665,0.0005743759,0.9895231,0.0019482865,0.0006848753,0.0007155137,0.000047373407,0.00010256708,0.006390593],"genre_scores_gemma":[0.0005398446,0.0001928245,0.8784913,0.00031437233,0.00051495165,0.00009381492,0.00020028236,0.000060001912,0.1195926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776435,0.00009209945,0.00045688948,0.00084983936,0.00049037085,0.00034644228],"domain_scores_gemma":[0.9980253,0.00035329495,0.000058377285,0.00045535917,0.00095929566,0.00014836037],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0012973204,0.00029297438,0.00037053323,0.0007618472,0.0008128712,0.0019247789,0.00044567967,0.0001508614,0.000068804395],"category_scores_gemma":[0.000064111184,0.00026430833,0.00016619769,0.00033588012,0.00012259289,0.00053923274,0.00055320584,0.00043078553,0.000019211435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146767015,0.000022526128,2.3274721e-7,0.000080758764,0.00013522168,0.0000012414289,0.0001590262,0.20438723,0.00059701497,0.7902998,0.00038277794,0.003919533],"study_design_scores_gemma":[0.0003405521,0.00023712091,0.0000012191138,0.00017333754,0.000048319063,0.0000149377265,0.000008999663,0.94065666,0.000028612747,0.023377746,0.034841616,0.0002708632],"about_ca_topic_score_codex":0.000081280676,"about_ca_topic_score_gemma":0.00007429388,"teacher_disagreement_score":0.766922,"about_ca_system_score_codex":0.00014923999,"about_ca_system_score_gemma":0.00033963277,"threshold_uncertainty_score":0.9999809},"labels":[],"label_agreement":null},{"id":"W4402219439","doi":"10.1090/proc/16931","title":"A generalization of Darboux-Froda theorem and its applications","year":2024,"lang":"en","type":"article","venue":"Proceedings of the American Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Uncountable set; Countable set; Mathematics; Monotone polygon; Lemma (botany); Generalization; Classification of discontinuities; Discrete mathematics; Jump; Pure mathematics; Mathematical analysis","score_opus":0.00847304478455699,"score_gpt":0.2463466814574323,"score_spread":0.2378736366728753,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402219439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03507948,0.00022997474,0.95483035,0.005438073,0.000020127101,0.00028647983,0.000007514206,0.00010782455,0.0040001795],"genre_scores_gemma":[0.9050048,0.000103033184,0.09447559,0.00020994969,0.00002608882,0.000028684779,6.289167e-7,0.0000070403585,0.00014421229],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930155,0.0000054790717,0.00021607066,0.00016808421,0.00022986901,0.000078960526],"domain_scores_gemma":[0.99942946,0.00009481023,0.00017314298,0.000087314496,0.00018170105,0.00003356514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023005116,0.000069220856,0.00015884386,0.00002621627,0.00006179905,0.000065815475,0.0003563911,0.000017927216,0.000011799601],"category_scores_gemma":[0.000065804576,0.000044893637,0.00013278394,0.0010074445,0.00013917134,0.00017131913,0.0001770256,0.000051084768,0.0000029179298],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[4.928608e-7,0.000028883213,0.0000801859,0.00015925561,0.000047883823,5.6384075e-9,0.0007461476,0.000045018583,0.0038335084,0.99398386,0.0001946883,0.0008800655],"study_design_scores_gemma":[0.000037800954,0.000015427107,0.000295129,0.000042182568,0.00004798933,0.0000025440065,0.000145579,0.75244313,0.0032457164,0.24339901,0.00025681843,0.000068641515],"about_ca_topic_score_codex":0.0000024151789,"about_ca_topic_score_gemma":3.6486476e-8,"teacher_disagreement_score":0.8699253,"about_ca_system_score_codex":0.00001479062,"about_ca_system_score_gemma":0.000023428336,"threshold_uncertainty_score":0.18307094},"labels":[],"label_agreement":null},{"id":"W4402337594","doi":"10.23952/asvao.7.2025.1.04","title":"Existence conditions and radiant properties of solutions to uncertain vector optimization problems","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Mathematics; Computer science; Applied mathematics","score_opus":0.027481680299787172,"score_gpt":0.24464241099247538,"score_spread":0.2171607306926882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402337594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076299295,0.0005693285,0.99635285,0.0014630373,0.000047053127,0.00033271682,0.00003466036,0.00013656689,0.0003007852],"genre_scores_gemma":[0.67967474,0.0003764179,0.31924927,0.00019370932,0.000028804276,0.00009419001,0.00022005796,0.000014047381,0.00014873335],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983243,0.00007469903,0.00047976343,0.000585798,0.00031564554,0.00021983292],"domain_scores_gemma":[0.99912184,0.000057582056,0.00012992347,0.00029501788,0.00024013463,0.00015549033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003790417,0.00019547336,0.00034091505,0.0009086798,0.00033123133,0.00041783907,0.0002038061,0.00008360124,0.00006474118],"category_scores_gemma":[0.000046518144,0.00017161289,0.0001035858,0.0038013675,0.0000831608,0.0004733528,0.00012441976,0.00007869244,0.0000046008295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003688614,0.000029826744,0.000034504756,0.000043801967,0.0003411787,4.6741846e-7,0.00089358614,0.8742513,0.0003885781,0.12353023,0.00003861215,0.00044421587],"study_design_scores_gemma":[0.00014910732,0.000028710028,0.00021215154,0.000040710554,0.0005542054,0.0000023167013,0.00011811168,0.99800944,0.00016468248,0.0004535977,0.000054977412,0.00021200317],"about_ca_topic_score_codex":0.00010632491,"about_ca_topic_score_gemma":0.000030936764,"teacher_disagreement_score":0.67891175,"about_ca_system_score_codex":0.000050258237,"about_ca_system_score_gemma":0.00008936158,"threshold_uncertainty_score":0.69981706},"labels":[],"label_agreement":null},{"id":"W4402337623","doi":"10.23952/asvao.7.2025.1.05","title":"Algorithms for solving optimization programs involving difference of convex functions","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convex optimization; Regular polygon; Mathematical optimization; Conic optimization; Mathematics; Computer science; Convex analysis; Geometry","score_opus":0.023114089844672107,"score_gpt":0.2563600564298553,"score_spread":0.2332459665851832,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402337623","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015125697,0.00034432198,0.9981969,0.00027298907,0.00011862567,0.00038030176,0.000022915809,0.00022560258,0.0002870692],"genre_scores_gemma":[0.32677966,0.00024802072,0.6713697,0.00009218295,0.00006640519,0.00013189498,0.00097621325,0.000021300195,0.0003146448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980828,0.000043118755,0.0005975603,0.00067642157,0.0003594161,0.00024065125],"domain_scores_gemma":[0.9987578,0.00017058231,0.00023657382,0.00033908,0.00038963134,0.0001063278],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000471054,0.00023008499,0.00043816332,0.00082800793,0.00030960803,0.0005651319,0.00027342656,0.00012600994,0.00006623686],"category_scores_gemma":[0.000049300746,0.00021144762,0.00024091107,0.003663894,0.000060332346,0.00045786245,0.00010297917,0.00009359875,0.0000021245799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000006099165,0.000052088242,0.00018538587,0.00005523504,0.00067718554,2.5519992e-7,0.00042203616,0.93156683,0.00008851563,0.059592977,0.000026201935,0.007327174],"study_design_scores_gemma":[0.00026531008,0.000039843293,0.00013164633,0.000024600784,0.001027734,8.284144e-7,0.00013634667,0.9973689,0.000090974114,0.0006337782,0.000044725126,0.00023534353],"about_ca_topic_score_codex":0.000040161583,"about_ca_topic_score_gemma":0.000012544493,"teacher_disagreement_score":0.32682726,"about_ca_system_score_codex":0.00004885638,"about_ca_system_score_gemma":0.000084844294,"threshold_uncertainty_score":0.8622584},"labels":[],"label_agreement":null},{"id":"W4402337707","doi":"10.23952/asvao.7.2025.1.03","title":"Second-order optimality conditions for nonsmooth multiobjective optimization subjected to mixed constraints","year":2024,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vietnam Institute for Advanced Study in Mathematics","keywords":"Mathematical optimization; Order (exchange); Mathematics; Multi-objective optimization; Computer science; Economics","score_opus":0.012052665572709146,"score_gpt":0.27059511087319166,"score_spread":0.25854244530048254,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402337707","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005902395,0.000054534536,0.9955193,0.000769656,0.00016018408,0.0008535347,0.00031637427,0.0003988947,0.0013373289],"genre_scores_gemma":[0.29748517,0.000042328382,0.69893426,0.0005665176,0.000066901055,0.00029505903,0.0022777696,0.00002993853,0.00030206906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99731934,0.00012711978,0.00067107537,0.0011154023,0.00039321877,0.00037381495],"domain_scores_gemma":[0.99788386,0.00030614322,0.0001914989,0.00045547727,0.0009092112,0.00025378398],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060557865,0.00035573286,0.0005326215,0.0013268032,0.0005370639,0.0008970348,0.0003318676,0.00018549683,0.00069400005],"category_scores_gemma":[0.0001590761,0.00035097747,0.00023989812,0.0071626157,0.00009765796,0.00065026793,0.00012047816,0.00013902054,0.000019286459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001873443,0.00006704803,0.000034794077,0.000027135266,0.0010633755,7.589658e-7,0.0005819316,0.92138577,0.00019086013,0.074889906,0.00030754565,0.0014321291],"study_design_scores_gemma":[0.00048800732,0.000043270567,0.0005845087,0.0000134009415,0.0009881202,0.000002402182,0.00015480911,0.99619347,0.0003674322,0.00052943296,0.00020350603,0.00043163422],"about_ca_topic_score_codex":0.000029249639,"about_ca_topic_score_gemma":0.00006174059,"teacher_disagreement_score":0.2968949,"about_ca_system_score_codex":0.0001267657,"about_ca_system_score_gemma":0.00020376146,"threshold_uncertainty_score":0.9998942},"labels":[],"label_agreement":null},{"id":"W4402423510","doi":"10.24908/iqurcp17986","title":"Isoperimetric Control of an Expanding Set","year":2024,"lang":"en","type":"article","venue":"Inquiry Queen s Undergraduate Research Conference Proceedings","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Isoperimetric inequality; Set (abstract data type); Control (management); Mathematics; Computer science; Combinatorics; Artificial intelligence; Programming language","score_opus":0.104890303910512,"score_gpt":0.3946173881720683,"score_spread":0.2897270842615563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402423510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012696908,0.00023031233,0.96209735,0.020117458,0.00024048067,0.00036203337,0.000010812763,0.00036790853,0.0038767618],"genre_scores_gemma":[0.9904177,0.00021722306,0.008454202,0.00007312144,0.00013917696,0.00004576921,0.000009701806,0.000018177187,0.0006249069],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968415,0.00013219134,0.00044710166,0.0007111979,0.0013405931,0.0005274069],"domain_scores_gemma":[0.9971853,0.00033770484,0.00008856963,0.0002710181,0.0018573175,0.00026010207],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0022889865,0.0001870278,0.00029847506,0.0016739762,0.00023405552,0.0014077168,0.0012154611,0.00010662491,0.000062561296],"category_scores_gemma":[0.0004002802,0.00016251979,0.00010429254,0.004496629,0.00024799453,0.0023972536,0.00027618388,0.00042504372,0.000090975],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016852626,0.0000774613,0.00040237635,0.00012545178,0.000106443156,0.000010543766,0.002815509,0.0001310835,0.0038614795,0.98283446,0.0010108142,0.008607555],"study_design_scores_gemma":[0.00037783847,0.00031247683,0.00027640935,0.00015181296,0.000020424628,0.000013257837,0.00073696236,0.87711596,0.0043583126,0.1147593,0.0016071381,0.00027010235],"about_ca_topic_score_codex":0.00016185993,"about_ca_topic_score_gemma":0.0000023385505,"teacher_disagreement_score":0.9777208,"about_ca_system_score_codex":0.00013069258,"about_ca_system_score_gemma":0.0005321133,"threshold_uncertainty_score":0.9996289},"labels":[],"label_agreement":null},{"id":"W4402877879","doi":"10.28924/2291-8639-22-2024-168","title":"A Strongly Convergent Hybrid Method to Unify Split Generalized Mixed Equilibrium and Fixed Point Problems","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fixed point; Fixed-point theorem; Applied mathematics; Mathematical economics; Pure mathematics; Calculus (dental); Mathematical analysis","score_opus":0.012673631714667425,"score_gpt":0.2976602022414865,"score_spread":0.2849865705268191,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402877879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0060337367,0.0004128155,0.9804843,0.012655472,0.00010866965,0.0001074844,0.000030310992,0.000026576281,0.00014062066],"genre_scores_gemma":[0.69022,0.0002730916,0.30794692,0.0005262318,0.0002776458,0.000039759063,0.000045709407,0.000010426683,0.00066020724],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849206,0.00007848362,0.00056368334,0.00030573658,0.0004465538,0.000113465576],"domain_scores_gemma":[0.998685,0.00013057678,0.0002083783,0.00017299218,0.0006101625,0.00019291227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061600993,0.00012282273,0.00026350428,0.0008799967,0.000055871937,0.0005854931,0.00048113012,0.000028023458,0.00010092654],"category_scores_gemma":[0.000022815222,0.00010174951,0.0002291482,0.0010540314,0.000022864364,0.00039847702,0.00018167778,0.00010249897,0.000009735957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035357825,0.00028049693,0.0020625056,0.00003589622,0.010134658,0.000034564924,0.00081516907,0.17580503,0.006043266,0.70723456,0.0027622546,0.09475623],"study_design_scores_gemma":[0.000357302,0.000053250802,0.0041088155,0.000026623782,0.00078814017,0.000095384865,0.000047917947,0.9434231,0.0009765989,0.0087420195,0.041176382,0.00020444718],"about_ca_topic_score_codex":0.000047016532,"about_ca_topic_score_gemma":0.000012745838,"teacher_disagreement_score":0.76761806,"about_ca_system_score_codex":0.000055237047,"about_ca_system_score_gemma":0.000080360165,"threshold_uncertainty_score":0.56459236},"labels":[],"label_agreement":null},{"id":"W4403512476","doi":"10.1515/math-2024-0073","title":"Vector optimization problems with weakened convex and weakened affine constraints in linear topological spaces","year":2024,"lang":"en","type":"article","venue":"Open Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saskatchewan Polytechnic","funders":"","keywords":"Mathematics; Affine transformation; Locally convex topological vector space; Topology (electrical circuits); Regular polygon; Topological vector space; Pure mathematics; Topological space; Combinatorics; Geometry","score_opus":0.023339994681873564,"score_gpt":0.27062528345905373,"score_spread":0.24728528877718017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403512476","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016992127,0.00006172986,0.98800415,0.004596524,0.000063149935,0.00038573236,0.0000048830816,0.00008074519,0.0051038754],"genre_scores_gemma":[0.21027558,0.00005884634,0.7880687,0.0001348064,0.000021688942,0.0000332204,0.000015653412,0.000010749022,0.0013807479],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910593,0.00004174357,0.00024966517,0.00029095748,0.00017924889,0.00013245396],"domain_scores_gemma":[0.99947107,0.00014679882,0.00006870794,0.00018525738,0.00006958897,0.000058608188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003350611,0.000121234254,0.00022230952,0.000108955486,0.00006204656,0.00071090827,0.0003619008,0.000055903096,0.00040388765],"category_scores_gemma":[0.00005692647,0.00008528778,0.000020533353,0.00058246515,0.00007323274,0.0004761697,0.00019411478,0.000080146376,0.000023513048],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000101570095,0.0002797355,0.00037716213,0.00019153916,0.000103505554,0.00003523654,0.002670962,0.2302044,0.00010407871,0.7640258,0.00016125987,0.001836149],"study_design_scores_gemma":[0.00031956512,0.00006178692,0.00010212826,0.00011906756,0.000016108965,0.000022061931,0.000105204366,0.9950628,0.000043952157,0.0037421098,0.00027064345,0.00013457246],"about_ca_topic_score_codex":0.0000148005465,"about_ca_topic_score_gemma":0.000027124686,"teacher_disagreement_score":0.76485837,"about_ca_system_score_codex":0.000023795234,"about_ca_system_score_gemma":0.00008162869,"threshold_uncertainty_score":0.6855305},"labels":[],"label_agreement":null},{"id":"W4403587853","doi":"10.48550/arxiv.2409.04412","title":"Robust Elicitable Functionals","year":2024,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Business","score_opus":0.07782397172361198,"score_gpt":0.26318866560553006,"score_spread":0.18536469388191806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403587853","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027894374,0.001205188,0.9250768,0.019190071,0.0038743906,0.00024425608,0.000030508041,0.0008230343,0.021661423],"genre_scores_gemma":[0.89381105,0.0002466243,0.05014995,0.0036376342,0.0011959614,0.00012326281,0.00024571343,0.00005049463,0.050539304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827534,0.000053619366,0.00033745385,0.0007366886,0.0003800421,0.0002168335],"domain_scores_gemma":[0.998734,0.00007085992,0.00013268007,0.0007049364,0.00025972546,0.00009778177],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028168914,0.0002212981,0.000250032,0.00026480257,0.00012183395,0.00035442002,0.00080013357,0.0001825582,0.0006213826],"category_scores_gemma":[0.00006206705,0.00020359697,0.00023436327,0.0006243675,0.000019186695,0.00017777426,0.00183335,0.00045618936,0.002675509],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000040622485,0.00014399247,0.027277207,0.00014823742,0.00058967015,0.000022374517,0.0002876444,0.7287084,0.000066574125,0.2080723,0.0336498,0.0010297582],"study_design_scores_gemma":[0.00017757365,0.00002151739,0.039449777,0.00012558539,0.00016140261,0.000007503637,0.000016391847,0.8928371,0.00014963,0.046265624,0.020130597,0.00065730605],"about_ca_topic_score_codex":0.00008912065,"about_ca_topic_score_gemma":0.000010869936,"teacher_disagreement_score":0.8749268,"about_ca_system_score_codex":0.00008890649,"about_ca_system_score_gemma":0.0002567737,"threshold_uncertainty_score":0.998101},"labels":[],"label_agreement":null},{"id":"W4403622663","doi":"10.48550/arxiv.2408.02812","title":"On Continuous Terminal Embeddings of Sets of Positive Reach","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Centre de Recherches Mathématiques; National Science Foundation","keywords":"Terminal (telecommunication); Mathematics; Computer science; Computer network","score_opus":0.030969453325202706,"score_gpt":0.19761529409817138,"score_spread":0.16664584077296868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403622663","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33334124,0.00002952115,0.6485076,0.00027365203,0.00035571595,0.00021297295,0.00012419534,0.000106415886,0.017048722],"genre_scores_gemma":[0.995649,0.000017692666,0.0023605286,0.000048789032,0.000013236578,2.3645885e-7,0.000024321385,0.00000704968,0.0018791887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989355,0.00007204395,0.00021307397,0.00054874906,0.00011511164,0.0001154924],"domain_scores_gemma":[0.99875957,0.00011668659,0.00030849036,0.00046164228,0.0002944492,0.0000591476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015028768,0.00015965391,0.00031658742,0.00039439398,0.000033347234,0.000034814326,0.000713889,0.00013653,0.000040414783],"category_scores_gemma":[0.000029799132,0.00016936666,0.00023635471,0.0006030772,0.00006103804,0.00009314876,0.0009203572,0.0002519688,0.000027293881],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002581801,0.000107915104,0.0002464061,0.00007732959,0.00019971025,0.00009128359,0.00035005843,0.17737752,0.000046573205,0.820984,0.00023342179,0.00025995204],"study_design_scores_gemma":[0.00020503801,0.00009082463,0.0009530123,0.00022018077,0.0001716736,0.0000031817208,0.0000405061,0.8787623,0.0005546354,0.118783295,0.000015563042,0.0001997759],"about_ca_topic_score_codex":0.00011868889,"about_ca_topic_score_gemma":0.0000046225623,"teacher_disagreement_score":0.7022007,"about_ca_system_score_codex":0.00007418163,"about_ca_system_score_gemma":0.00013348868,"threshold_uncertainty_score":0.69065714},"labels":[],"label_agreement":null},{"id":"W4403639950","doi":"10.28924/2291-8639-22-2024-189","title":"Approximating Fixed Point of (α, β, γ)-Nonexpansive Mapping Using Picard-Thakur Iterative Scheme","year":2024,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Fixed point; Scheme (mathematics); Fixed-point iteration; Pure mathematics; Applied mathematics; Statistics; Mathematical analysis","score_opus":0.017422890187661084,"score_gpt":0.29525227469298915,"score_spread":0.27782938450532807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403639950","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00839445,0.0003803981,0.9892892,0.0015148685,0.00007093154,0.000061537634,0.000016862445,0.000015983705,0.0002557635],"genre_scores_gemma":[0.747547,0.00009533479,0.25202277,0.00010054398,0.00015674651,0.0000064234396,0.000016568149,0.000004789298,0.000049813734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984404,0.000049948598,0.0007483604,0.00020980452,0.000466254,0.000085231724],"domain_scores_gemma":[0.9979849,0.00016593089,0.0005174056,0.00015141456,0.0011121602,0.000068215995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004280955,0.000103620914,0.00028880686,0.0010644059,0.00007879319,0.000304745,0.00046234243,0.000036646423,0.000039852737],"category_scores_gemma":[0.000050857692,0.000087755885,0.00033164208,0.0016431112,0.000040347313,0.0006163369,0.000112966256,0.000117448784,0.0000028415632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022859262,0.000473468,0.009621663,0.000094776646,0.02289171,0.00004112932,0.007141733,0.12426974,0.042324807,0.74356496,0.00022748222,0.04932567],"study_design_scores_gemma":[0.00015571484,0.000016389999,0.0013149135,0.000065832144,0.0004107131,0.000041639018,0.00032632393,0.9907695,0.0011691168,0.004596873,0.0010179948,0.00011498469],"about_ca_topic_score_codex":0.000020221478,"about_ca_topic_score_gemma":0.0000024761036,"teacher_disagreement_score":0.8664998,"about_ca_system_score_codex":0.00005858222,"about_ca_system_score_gemma":0.00009915851,"threshold_uncertainty_score":0.35785812},"labels":[],"label_agreement":null},{"id":"W4403702737","doi":"10.48550/arxiv.2409.10323","title":"On the Hardness of Meaningful Local Guarantees in Nonsmooth Nonconvex Optimization","year":2024,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research; Azrieli Foundation; National Science Foundation","keywords":"Mathematical optimization; Mathematics; Mathematical economics; Computer science","score_opus":0.04385393497825748,"score_gpt":0.17902519119033827,"score_spread":0.1351712562120808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403702737","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007917126,0.000020874222,0.98775756,0.00072922575,0.00033636251,0.00015806283,0.00001117699,0.00006938858,0.0030002126],"genre_scores_gemma":[0.99662197,0.00005421767,0.002260729,0.00015993865,0.000019343026,0.0000011355654,0.000015144011,0.000010303852,0.00085719384],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987078,0.00015762623,0.00023864841,0.00061083713,0.00013846454,0.0001466499],"domain_scores_gemma":[0.9987848,0.00017977106,0.00019427437,0.00061799615,0.00018115267,0.00004204956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003239626,0.00018901909,0.00025165975,0.00044030615,0.00006396471,0.00008948023,0.0010805919,0.0001523737,0.0001250646],"category_scores_gemma":[0.00004739721,0.00015953652,0.00017526653,0.001290805,0.00008465266,0.00013541848,0.00091412134,0.00038896056,0.000050266262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000075695716,0.000037241927,0.0000864484,0.00001948524,0.000038365826,0.000016059083,0.00014569628,0.57714915,8.3178327e-7,0.42237592,0.000081719045,0.000041529314],"study_design_scores_gemma":[0.00016538601,0.00001909712,0.00012829147,0.0001277836,0.00004575178,5.421632e-7,0.000073776624,0.95129824,0.000040485425,0.047923807,0.000019028927,0.00015779446],"about_ca_topic_score_codex":0.00015085626,"about_ca_topic_score_gemma":0.000047974634,"teacher_disagreement_score":0.98870486,"about_ca_system_score_codex":0.0001388423,"about_ca_system_score_gemma":0.00020313688,"threshold_uncertainty_score":0.650571},"labels":[],"label_agreement":null},{"id":"W4403705855","doi":"10.23952/jnva.8.2024.6.02","title":"Semidefinite programming approximation for a matrix optimization problem over an uncertain linear system","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Hong Kong Polytechnic University; National Natural Science Foundation of China","keywords":"Semidefinite programming; Semidefinite embedding; Linear programming; Mathematical optimization; Quadratically constrained quadratic program; Second-order cone programming; Matrix (chemical analysis); Mathematics; Optimization problem; Linear matrix inequality; Robust optimization; Computer science; Convex optimization; Quadratic programming","score_opus":0.01608318479415679,"score_gpt":0.2949658219614598,"score_spread":0.27888263716730305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403705855","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000363523,0.00022150681,0.99796104,0.0009735482,0.00015352851,0.00016867265,0.00004126452,0.00007165872,0.00004526954],"genre_scores_gemma":[0.04507583,0.000041087318,0.953865,0.00007053614,0.0004522076,0.000016230138,0.00025734014,0.000013327821,0.00020846931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99807465,0.000113997834,0.0008072913,0.00031972572,0.00052650843,0.00015782927],"domain_scores_gemma":[0.998107,0.00026288087,0.0004542048,0.00016536402,0.0008770767,0.00013348188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013661095,0.00016091001,0.00035864578,0.0010580326,0.00018452496,0.0005810802,0.00026136832,0.00009374409,0.000026834818],"category_scores_gemma":[0.00008617205,0.00012937377,0.0003645366,0.0022785382,0.0000151604345,0.0013734332,0.000040457817,0.00012397699,0.0000020093128],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021776517,0.00009039279,0.00027117055,0.00010731547,0.00115803,0.000003951559,0.0002954463,0.87484086,0.000024078037,0.12089867,0.000028859356,0.0022594542],"study_design_scores_gemma":[0.00032974512,0.00010942375,0.0002856261,0.000042044478,0.0011734643,0.000030130199,0.000049653157,0.9957433,0.000006731648,0.0008173811,0.0012645664,0.00014794769],"about_ca_topic_score_codex":0.000018774583,"about_ca_topic_score_gemma":0.000004927175,"teacher_disagreement_score":0.120902434,"about_ca_system_score_codex":0.000104908286,"about_ca_system_score_gemma":0.00021775835,"threshold_uncertainty_score":0.56033695},"labels":[],"label_agreement":null},{"id":"W4403730190","doi":"10.23952/jnva.8.2024.6.08","title":"Path connectedness of solution sets for partially ordered set optimization problems","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Social connectedness; Path (computing); Set (abstract data type); Mathematics; Mathematical optimization; Topology (electrical circuits); Computer science; Combinatorics; Psychology; Social psychology","score_opus":0.0235317873649427,"score_gpt":0.2840176524090194,"score_spread":0.26048586504407667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403730190","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009501179,0.00028742407,0.99545676,0.0029259152,0.00015880496,0.000088216475,0.000089055335,0.000019393869,0.000024319314],"genre_scores_gemma":[0.4088391,0.00020499936,0.59024864,0.00011128196,0.0002325658,0.000006664141,0.00024993462,0.000009564332,0.000097240736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984301,0.00008991968,0.0007387839,0.00020941113,0.00041677852,0.000115047435],"domain_scores_gemma":[0.9977794,0.00032545888,0.00046575785,0.000116379546,0.0012326521,0.00008030259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00088410213,0.00011513016,0.00034876692,0.00070184737,0.00010113014,0.00017829474,0.00020748848,0.000072027084,0.00007075571],"category_scores_gemma":[0.00018476568,0.00009299796,0.00033476346,0.0017463799,0.000020879354,0.00063033786,0.000039364586,0.00008075932,9.650813e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002454982,0.0001062207,0.00056399044,0.00006977776,0.0018969234,0.0000016413926,0.00039886596,0.9650203,0.00015105915,0.030650748,0.00013965093,0.0009762973],"study_design_scores_gemma":[0.0003659089,0.000097164266,0.0015836951,0.00003064016,0.00106555,0.000010732482,0.000015387986,0.9937886,0.00002976773,0.002452588,0.00045703628,0.0001029522],"about_ca_topic_score_codex":0.000018120076,"about_ca_topic_score_gemma":0.000012377683,"teacher_disagreement_score":0.407889,"about_ca_system_score_codex":0.00003516141,"about_ca_system_score_gemma":0.0002667357,"threshold_uncertainty_score":0.37923464},"labels":[],"label_agreement":null},{"id":"W4404004512","doi":"10.1112/jlms.70014","title":"Continuity of extensions of Lipschitz maps and of monotone maps","year":2024,"lang":"en","type":"article","venue":"Journal of the London Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Fields Institute for Research in Mathematical Sciences; University of Toronto","funders":"European Research Council","keywords":"Lipschitz continuity; Monotone polygon; Mathematics; Pure mathematics; Geometry","score_opus":0.010609014730780013,"score_gpt":0.2448317439417928,"score_spread":0.23422272921101278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404004512","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06534694,0.00056699465,0.928202,0.005179022,0.00021282143,0.00011120522,0.00002076916,0.000009942918,0.0003503137],"genre_scores_gemma":[0.7680891,0.00010536929,0.231385,0.00008967337,0.000043090644,5.7574783e-7,2.977805e-7,0.000004893218,0.0002820075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987595,0.000064061205,0.00061560515,0.00008280423,0.00040476117,0.000073243515],"domain_scores_gemma":[0.99867725,0.00036585715,0.0004246292,0.00019919395,0.0002816009,0.000051483916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077108096,0.00006961488,0.00033486658,0.000040194293,0.00003423365,0.00002750962,0.0003599724,0.00004975855,0.000031178486],"category_scores_gemma":[0.00017598423,0.00003988331,0.0004570931,0.0003786247,0.00010842089,0.00015170038,0.00017317093,0.00014477376,0.000001171692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017986496,0.00050281256,0.00071007485,0.00082394667,0.00072714535,0.0000024641074,0.004816629,0.0029389074,0.010048011,0.96963805,0.007934607,0.0018393415],"study_design_scores_gemma":[0.00057498406,0.00011486041,0.00401238,0.0006207578,0.00030604203,0.00007506596,0.0002166066,0.57944703,0.005168373,0.40890196,0.0004424465,0.00011948264],"about_ca_topic_score_codex":0.000002747563,"about_ca_topic_score_gemma":3.5226398e-7,"teacher_disagreement_score":0.70274216,"about_ca_system_score_codex":0.000013755938,"about_ca_system_score_gemma":0.000064450745,"threshold_uncertainty_score":0.16263942},"labels":[],"label_agreement":null},{"id":"W4404051442","doi":"10.1101/2024.10.29.620968","title":"Robust fine-mapping in the presence of linkage disequilibrium mismatch","year":2024,"lang":"en","type":"preprint","venue":"bioRxiv (Cold Spring Harbor Laboratory)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Montreal Heart Institute","funders":"","keywords":"Linkage disequilibrium; Disequilibrium; Linkage (software); Computational biology; Computer science; Genetics; Biology; Medicine; Haplotype; Genotype","score_opus":0.023425753599497598,"score_gpt":0.22004027206167007,"score_spread":0.19661451846217248,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404051442","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30433506,0.0038547108,0.66806567,0.017449588,0.0031811392,0.0017523592,0.00025642727,0.0008806216,0.0002244433],"genre_scores_gemma":[0.964737,0.00007445263,0.03467997,0.0001884038,0.00018615126,0.00008922944,3.3118658e-7,0.00002854807,0.000015898477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974128,0.0002294618,0.00063868257,0.00082668656,0.0005771867,0.0003151753],"domain_scores_gemma":[0.9975605,0.00021308244,0.00032926735,0.0014686517,0.00034047922,0.00008800057],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010345968,0.0003184729,0.00040419804,0.00043504644,0.0000703097,0.00046636263,0.0020704006,0.00023763759,0.00002138254],"category_scores_gemma":[0.00024345587,0.00026300538,0.00019190011,0.0019732467,0.000063726045,0.0002206304,0.0014170144,0.0006682695,0.000039913437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025477217,0.0015143403,0.029188044,0.0062057753,0.0012252554,0.00051368313,0.0020929847,0.37116835,0.16504069,0.41644403,0.006557544,0.000023806097],"study_design_scores_gemma":[0.0002963648,0.000020421625,0.058958378,0.0009487608,0.00010280992,2.6537714e-8,0.0000086993305,0.9300013,0.0071818354,0.00020134474,0.0015061971,0.00077384716],"about_ca_topic_score_codex":0.00006413362,"about_ca_topic_score_gemma":0.0000037936622,"teacher_disagreement_score":0.66040194,"about_ca_system_score_codex":0.00008351782,"about_ca_system_score_gemma":0.0004884813,"threshold_uncertainty_score":0.99998224},"labels":[],"label_agreement":null},{"id":"W4404106010","doi":"10.3390/math12223466","title":"A New Extragradient-Viscosity Method for a Variational Inequality, an Equilibrium Problem, and a Fixed Point Problem","year":2024,"lang":"en","type":"article","venue":"Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"University of Alberta","keywords":"Variational inequality; Fixed point; Viscosity; Mathematics; Applied mathematics; Mathematical economics; Mathematical optimization; Inequality; Point (geometry); Mathematical analysis; Thermodynamics; Physics; Geometry","score_opus":0.03271614504710567,"score_gpt":0.3141233599569188,"score_spread":0.28140721490981313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404106010","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014388662,0.000047096582,0.99400073,0.0044898987,0.000064966625,0.00040664253,0.0000191659,0.00020477749,0.00062282005],"genre_scores_gemma":[0.0041460255,0.0000025589738,0.9944661,0.0001824505,0.000079939244,0.000053020012,0.000031012947,0.000013383205,0.001025501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998697,0.00007074541,0.0003946511,0.00038046384,0.0002750472,0.00018212496],"domain_scores_gemma":[0.999033,0.00033207348,0.000101434,0.0002659105,0.00012615023,0.00014146612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010219223,0.00014245916,0.00021150494,0.00014900356,0.00008557913,0.00062401366,0.00029921986,0.000056961144,0.000052957395],"category_scores_gemma":[0.00007060006,0.00011958526,0.00008665245,0.00046249147,0.000009949589,0.0006634865,0.00015720198,0.00007161216,0.000010405678],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024586386,0.000116580355,0.000011330327,0.00027333052,0.00007736868,0.0000010911252,0.003893112,0.0021608684,0.00035879886,0.9886326,0.0008910697,0.0035813942],"study_design_scores_gemma":[0.00014086043,0.000045888522,0.000026744594,0.000031648207,0.000035007793,0.000012452712,0.000015625554,0.62354857,0.000049499413,0.3756426,0.00035188408,0.000099260855],"about_ca_topic_score_codex":0.000029278099,"about_ca_topic_score_gemma":0.000014200935,"teacher_disagreement_score":0.62138766,"about_ca_system_score_codex":0.00003793819,"about_ca_system_score_gemma":0.00016562632,"threshold_uncertainty_score":0.6017378},"labels":[],"label_agreement":null},{"id":"W4404288773","doi":"10.1007/s10013-024-00716-9","title":"On a Result by Baillon, Bruck, and Reich","year":2024,"lang":"en","type":"article","venue":"Vietnam Journal of Mathematics","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Mathematics","score_opus":0.008124496692483212,"score_gpt":0.24314863198613845,"score_spread":0.23502413529365523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404288773","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004471819,0.0009767961,0.9854017,0.00663145,0.00019545294,0.000039438222,0.0000036785796,0.000031618747,0.0022480688],"genre_scores_gemma":[0.46246746,0.0009631404,0.53179437,0.0011775687,0.00018799074,0.0000022696802,0.0000026344337,0.000026716754,0.0033778416],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991076,0.0000289259,0.00036353865,0.00009794039,0.0003251609,0.000076851895],"domain_scores_gemma":[0.9992824,0.00021878855,0.00015259725,0.00013597324,0.00013898699,0.000071209484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053342554,0.000074693664,0.00015113309,0.0001546889,0.000055749835,0.0002419514,0.00024263527,0.000032131567,0.000036889716],"category_scores_gemma":[0.00017518495,0.00005226936,0.000071539216,0.00033649005,0.000014587549,0.00026249263,0.000031731543,0.00012353457,0.00002851444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007637307,0.00028855147,0.00002658427,0.00018933749,0.00026672438,0.00006397257,0.004220793,0.002146072,0.0007254809,0.8903561,0.092847474,0.008861263],"study_design_scores_gemma":[0.0003729,0.00024110782,0.000039002494,0.00037855218,0.00007747907,0.00031881328,0.00013259405,0.89343697,0.00030688744,0.0912332,0.013278325,0.00018414459],"about_ca_topic_score_codex":4.3167736e-7,"about_ca_topic_score_gemma":2.9475342e-7,"teacher_disagreement_score":0.8912909,"about_ca_system_score_codex":0.000021621167,"about_ca_system_score_gemma":0.000044774057,"threshold_uncertainty_score":0.2333143},"labels":[],"label_agreement":null},{"id":"W4404697636","doi":"10.23952/jnva.5.2021.5.06","title":"A minimax approach to characterize quasi $\\epsilon$-Pareto solutions in multiobjective optimization problems","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation of Korea; National Research Foundation","keywords":"Minimax; Pareto principle; Multi-objective optimization; Mathematical optimization; Mathematics; Pareto optimal; Mathematical economics","score_opus":0.027483499167942224,"score_gpt":0.25114288895214926,"score_spread":0.22365938978420702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404697636","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025346822,0.000091292066,0.99338526,0.0034733505,0.000066781315,0.00008046776,0.00003290451,0.000011795992,0.00032345374],"genre_scores_gemma":[0.19821642,0.000103448714,0.80070364,0.0005298881,0.00011723161,0.000010054809,0.00015270067,0.000007472051,0.00015914328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979759,0.0002013344,0.0007724139,0.0003370807,0.0005215217,0.00019175067],"domain_scores_gemma":[0.9977578,0.00015617054,0.0004222235,0.00019015139,0.001303666,0.0001699721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073698716,0.00014881842,0.00045004848,0.0010808656,0.0001482358,0.00022060584,0.00026281385,0.00007817797,0.00005735207],"category_scores_gemma":[0.00031517335,0.0001359729,0.0002735584,0.0041239467,0.00001590829,0.00071643846,0.00011829937,0.00016308117,0.0000036234285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000138465775,0.00071178185,0.0056406534,0.000007790937,0.000747269,0.0000057925017,0.00075056654,0.9836091,0.00009821231,0.00800275,0.00002738924,0.00038484597],"study_design_scores_gemma":[0.00039686428,0.00003944372,0.07500824,0.0000114465465,0.0003159432,0.000028963288,0.00007375216,0.92348963,0.000011806263,0.00033090616,0.00015011737,0.00014289116],"about_ca_topic_score_codex":0.00004586918,"about_ca_topic_score_gemma":0.000047275415,"teacher_disagreement_score":0.19568174,"about_ca_system_score_codex":0.00010649079,"about_ca_system_score_gemma":0.0003041174,"threshold_uncertainty_score":0.55448145},"labels":[],"label_agreement":null},{"id":"W4404697668","doi":"10.23952/jnva.5.2021.5.07","title":"The weighted set relation: Characterizations in the convex case","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Research Consortium for Informatics and Mathematics; Norges Teknisk-Naturvitenskapelige Universitet","keywords":"Relation (database); Mathematics; Set (abstract data type); Regular polygon; Computer science; Geometry; Data mining; Programming language","score_opus":0.015338650158507647,"score_gpt":0.26226445495452083,"score_spread":0.24692580479601317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404697668","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022372799,0.0003479148,0.9286916,0.048028857,0.00015328916,0.00005708522,0.000027525552,0.0000080850195,0.00031281536],"genre_scores_gemma":[0.9434809,0.0004745978,0.053594735,0.0016433347,0.00034628817,0.0000040827263,0.00011653843,0.000005193818,0.00033430973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843144,0.00032961855,0.00057401875,0.00013845487,0.0004282192,0.00009822107],"domain_scores_gemma":[0.9979186,0.0007567082,0.00029160472,0.00020820434,0.00077309087,0.000051777653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010766198,0.000082386425,0.00019779635,0.00026967918,0.0003997628,0.0003540364,0.0002787645,0.000043665637,0.000075191936],"category_scores_gemma":[0.00021949508,0.00004745624,0.00019876489,0.0028715408,0.000025400637,0.0004314799,0.000049871287,0.0001724363,0.0000032677144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004144261,0.0005921306,0.05651598,0.000011086666,0.0046811616,0.0014428529,0.005455506,0.06562638,0.00013286101,0.861065,0.00064273545,0.0037929101],"study_design_scores_gemma":[0.00029801682,0.000015212018,0.09845564,0.0000033712986,0.00042590237,0.0008508696,0.00020582898,0.8934976,0.000006617322,0.0024977513,0.0036694496,0.00007373717],"about_ca_topic_score_codex":0.000014802608,"about_ca_topic_score_gemma":0.00009266549,"teacher_disagreement_score":0.9211081,"about_ca_system_score_codex":0.000024146597,"about_ca_system_score_gemma":0.00019329078,"threshold_uncertainty_score":0.34139812},"labels":[],"label_agreement":null},{"id":"W4404697948","doi":"10.23952/jnva.5.2021.5.04","title":"Optimality conditions for vector variational inequalities via image space analysis","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational inequality; Image (mathematics); Mathematics; Space (punctuation); Variational analysis; Inequality; Vector space; Mathematical optimization; Applied mathematics; Computer science; Computer vision; Mathematical analysis; Pure mathematics","score_opus":0.017521723538171677,"score_gpt":0.2924390208997683,"score_spread":0.27491729736159665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404697948","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015909309,0.0001169131,0.9867763,0.01080719,0.00012201721,0.000060578874,0.00037493443,0.000019909809,0.0001312096],"genre_scores_gemma":[0.27125236,0.00006690746,0.7262508,0.00058066874,0.00041851774,0.000009342564,0.0008619329,0.000009294777,0.0005501518],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973505,0.00029449892,0.0010157429,0.00038193137,0.00074831303,0.00020899352],"domain_scores_gemma":[0.99425995,0.0010726143,0.0008703991,0.00029571156,0.0032994165,0.00020191664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013724242,0.0002001918,0.0007258125,0.0012029888,0.00032985705,0.0003866813,0.00034016173,0.00010015617,0.00059603614],"category_scores_gemma":[0.00065324374,0.00018302343,0.0011315999,0.0047005364,0.00004462749,0.0009573551,0.000100514284,0.00015312461,0.0000048803045],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005307168,0.00067961065,0.010997297,0.00003060492,0.030357232,0.000019468953,0.0005592687,0.34588292,0.00095355115,0.6098482,0.0004204384,0.00019832281],"study_design_scores_gemma":[0.00055873377,0.000040494855,0.09480794,0.0000035733335,0.006824373,0.000020404212,0.00005122192,0.88676405,0.00008957361,0.010092917,0.0005497017,0.00019703107],"about_ca_topic_score_codex":0.00004891936,"about_ca_topic_score_gemma":0.000056148634,"teacher_disagreement_score":0.5997553,"about_ca_system_score_codex":0.000084267915,"about_ca_system_score_gemma":0.00044872935,"threshold_uncertainty_score":0.74634784},"labels":[],"label_agreement":null},{"id":"W4404697950","doi":"10.23952/jnva.5.2021.5.13","title":"Inertial-type projection methods for solving convex constrained monotone nonlinear equations with applications to robotic motion control","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Petroleum Technology Development Fund; Deutscher Akademischer Austauschdienst","keywords":"Monotone polygon; Regular polygon; Type (biology); Nonlinear system; Projection (relational algebra); Projection method; Inertial frame of reference; Mathematics; Motion (physics); Control theory (sociology); Computer science; Mathematical optimization; Control (management); Dykstra's projection algorithm; Artificial intelligence; Algorithm; Physics; Geometry; Classical mechanics","score_opus":0.02436396564325839,"score_gpt":0.3297443857075322,"score_spread":0.3053804200642738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404697950","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002679808,0.00008138633,0.9931335,0.0060837064,0.000085438594,0.00026646286,0.000026568214,0.000021399708,0.000033556924],"genre_scores_gemma":[0.100266196,0.00002585595,0.8985209,0.0005938447,0.000279589,0.000031712847,0.00013514483,0.000009224497,0.00013755471],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827355,0.0001601997,0.0007204381,0.00032254556,0.00036095036,0.00016230001],"domain_scores_gemma":[0.9948828,0.00075720414,0.00054618187,0.00020924064,0.0034300012,0.00017455143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009551288,0.00015659827,0.00048634355,0.000718316,0.0002852969,0.00023034253,0.00020067349,0.00007497384,0.00005298479],"category_scores_gemma":[0.00060325017,0.00013084756,0.0002541801,0.0031167604,0.000026455227,0.00046956062,0.000038734703,0.00012651405,0.0000028113018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010556462,0.0004507439,0.0014971169,0.00002254986,0.0035482566,0.000002951542,0.00035057424,0.92568916,0.003816147,0.054786805,0.00002747256,0.009702683],"study_design_scores_gemma":[0.0009352134,0.00014000098,0.0025502166,0.0000091133725,0.0014141211,0.000027753133,0.000060367318,0.99280834,0.00026487335,0.00096767535,0.0006647952,0.00015751552],"about_ca_topic_score_codex":0.00001715682,"about_ca_topic_score_gemma":0.000027182869,"teacher_disagreement_score":0.09999821,"about_ca_system_score_codex":0.000068873436,"about_ca_system_score_gemma":0.0004850217,"threshold_uncertainty_score":0.5335809},"labels":[],"label_agreement":null},{"id":"W4404698223","doi":"10.23952/jnva.5.2021.4.09","title":"Convergence analysis of an inertial Tseng’s extragradient algorithm for solving pseudomonotone variational inequalities and applications","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational inequality; Convergence (economics); Inertial frame of reference; Algorithm; Mathematics; Applied mathematics; Computer science; Physics; Economics","score_opus":0.016297085468995567,"score_gpt":0.2780908640302008,"score_spread":0.2617937785612052,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404698223","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007416086,0.00025265262,0.9911377,0.00078745413,0.000064787084,0.00007942536,0.0002344691,0.000009558585,0.000017883824],"genre_scores_gemma":[0.20469797,0.000256225,0.7938734,0.00023157608,0.000320573,0.00001702089,0.0004823433,0.000007859568,0.00011300662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977612,0.00014805034,0.001029174,0.00034584219,0.0005652092,0.00015052917],"domain_scores_gemma":[0.9959963,0.0006368117,0.0008486111,0.00023114064,0.0021102817,0.00017688797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011169693,0.00015857996,0.0006558736,0.0012056947,0.00020780525,0.00015769473,0.00025984,0.00008175924,0.00010757935],"category_scores_gemma":[0.00019013083,0.00014553843,0.0004728661,0.0033518397,0.000048577116,0.00068038306,0.00008369769,0.00010305745,3.3135427e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008668206,0.0014665772,0.015617121,0.000059746708,0.035739947,0.000011360229,0.0020372036,0.45598978,0.0016046939,0.46211264,0.000034025263,0.02524022],"study_design_scores_gemma":[0.0004805182,0.000068113826,0.035239056,0.0000041849016,0.005388528,0.0000147018345,0.000106931926,0.9555367,0.00012378904,0.0026401347,0.00024662307,0.00015069729],"about_ca_topic_score_codex":0.000060141218,"about_ca_topic_score_gemma":0.000061932966,"teacher_disagreement_score":0.49954695,"about_ca_system_score_codex":0.000038827457,"about_ca_system_score_gemma":0.000294904,"threshold_uncertainty_score":0.5934885},"labels":[],"label_agreement":null},{"id":"W4404698232","doi":"10.23952/jnva.5.2021.4.02","title":"Coercivity conditions, zeros of maximal monotone operators, and monotone equilibrium problems","year":2021,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monotone polygon; Mathematics; Coercivity; Strongly monotone; Monotonic function; Pure mathematics; Mathematical analysis; Physics; Geometry","score_opus":0.012120509782805764,"score_gpt":0.2528265650102866,"score_spread":0.24070605522748084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404698232","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23323587,0.0005819319,0.76315176,0.0027412297,0.00006288626,0.00005703515,0.0000955099,0.000010087807,0.000063684325],"genre_scores_gemma":[0.89001745,0.00029310683,0.10913228,0.00020328895,0.000100818404,0.000002009643,0.00008256435,0.000005398785,0.00016308985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982851,0.00014164016,0.0007300727,0.00023599403,0.0004888307,0.00011834945],"domain_scores_gemma":[0.9976827,0.00018326772,0.00054095837,0.00017682924,0.0012695938,0.00014667358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005763638,0.00012927622,0.0005030194,0.0004468955,0.00012449111,0.000117183234,0.00018768651,0.00006996494,0.00014514236],"category_scores_gemma":[0.00014482555,0.00011236028,0.0002456979,0.0014932438,0.000056764715,0.00066287344,0.0001330331,0.00013262298,0.0000014268766],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011431736,0.0024063934,0.28690395,0.00015539413,0.012850259,0.00011460796,0.0017837144,0.36781922,0.027912725,0.29826543,0.00039455554,0.0012794404],"study_design_scores_gemma":[0.00073780277,0.00007832605,0.1634253,0.000015335498,0.0010208812,0.00009553653,0.000034246958,0.82947016,0.0009764909,0.0037172586,0.00026544786,0.00016324126],"about_ca_topic_score_codex":0.000034018667,"about_ca_topic_score_gemma":0.00000927631,"teacher_disagreement_score":0.65678155,"about_ca_system_score_codex":0.000024019764,"about_ca_system_score_gemma":0.00027032697,"threshold_uncertainty_score":0.4581919},"labels":[],"label_agreement":null},{"id":"W4405558068","doi":"10.23952/jnva.9.2025.1.05","title":"Local optimality conditions and local saddle point theorems for nonconvex robust programming","year":2024,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Saddle point; Mathematical optimization; Mathematics; Saddle; Mathematical economics; Point (geometry); Computer science; Geometry","score_opus":0.016550747852606768,"score_gpt":0.27915027451782237,"score_spread":0.2625995266652156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405558068","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00069480925,0.0003547236,0.9937788,0.004839692,0.00010170124,0.00007721935,0.000058399983,0.000024263336,0.000070349175],"genre_scores_gemma":[0.59610796,0.000070010086,0.40317404,0.0002370633,0.00021104436,0.000006205036,0.000081844104,0.000006997732,0.00010482835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985694,0.00007498484,0.0005710705,0.00027301072,0.00036300276,0.000148489],"domain_scores_gemma":[0.99844015,0.0004780138,0.0002238297,0.00011759661,0.00058257335,0.00015785091],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010334875,0.00013601173,0.0003388817,0.00056982593,0.00019797061,0.0004178787,0.00018620379,0.00007232319,0.000079498626],"category_scores_gemma":[0.00008283368,0.0001057622,0.00035487354,0.0011652675,0.00009285613,0.0006900995,0.00006496103,0.00014588035,0.0000024095523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041181134,0.00023948762,0.0010977373,0.000063767926,0.0041459478,0.000017174321,0.00053012476,0.39986354,0.00003564791,0.5724486,0.00029857748,0.021218227],"study_design_scores_gemma":[0.0003157653,0.00009015196,0.0032511665,0.00001739415,0.0010549872,0.00005233209,0.00010092077,0.9823512,0.0000142283525,0.011129166,0.001496902,0.00012579779],"about_ca_topic_score_codex":0.000023002638,"about_ca_topic_score_gemma":0.000018969939,"teacher_disagreement_score":0.59541315,"about_ca_system_score_codex":0.000055070857,"about_ca_system_score_gemma":0.00018658704,"threshold_uncertainty_score":0.43128574},"labels":[],"label_agreement":null},{"id":"W4406151066","doi":"10.4153/s0008439524000821","title":"A characterization of the existence of zeros for operators with Lipschitzian derivative and closed range","year":2025,"lang":"en","type":"article","venue":"Canadian Mathematical Bulletin","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Università di Catania; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Mathematics; Hilbert space; Derivative (finance); Regular polygon; Operator (biology); Convex function; Characterization (materials science); Range (aeronautics); Combinatorics; Space (punctuation); Function (biology); Convex set; Pure mathematics; Convex optimization; Geometry; Chemistry; Physics","score_opus":0.006942119736910395,"score_gpt":0.19998669480001127,"score_spread":0.19304457506310088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406151066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14122646,0.000008965554,0.8404203,0.01634251,0.000026194679,0.00048228292,0.000034304125,0.000009763312,0.0014492475],"genre_scores_gemma":[0.96834755,0.0000017949359,0.030107005,0.0008320647,0.000004943105,0.00002850069,0.0000038069995,0.0000035496419,0.000670766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999505,0.000031539887,0.00017556777,0.000118351854,0.0000843199,0.00008521566],"domain_scores_gemma":[0.9994305,0.00009809477,0.000076774,0.00017300407,0.00015894296,0.000062701605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000119378616,0.000058831072,0.00013786483,0.000079899844,0.00007257106,0.000028835404,0.000220343,0.000028838802,0.00008169159],"category_scores_gemma":[0.00015618774,0.000038754337,0.000031029846,0.00034075772,0.00006811141,0.000034733854,0.00002813609,0.000028696195,0.0000036285867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007270611,0.000027049346,0.0006736207,0.00012284932,0.00004157625,2.4309765e-7,0.0006624875,0.000035022793,0.0013663989,0.9964784,0.000104536695,0.0004805522],"study_design_scores_gemma":[0.006808323,0.00060892536,0.16700584,0.0026909085,0.0005366381,0.000021076787,0.0009528224,0.59710974,0.07051535,0.122897945,0.029341305,0.0015111117],"about_ca_topic_score_codex":0.000102800055,"about_ca_topic_score_gemma":0.00015024954,"teacher_disagreement_score":0.87358046,"about_ca_system_score_codex":0.000018694915,"about_ca_system_score_gemma":0.00018212559,"threshold_uncertainty_score":0.15803559},"labels":[],"label_agreement":null},{"id":"W4406909652","doi":"10.4171/rmi/1493","title":"Stability of weighted norm inequalities","year":2025,"lang":"en","type":"article","venue":"Revista Matemática Iberoamericana","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; McMaster University","funders":"Ministerio de Ciencia e Innovación","keywords":"Mathematics; Norm (philosophy); Inequality; Stability (learning theory); Pure mathematics; Mathematical economics; Applied mathematics; Calculus (dental); Mathematical analysis; Computer science; Philosophy; Medicine; Epistemology","score_opus":0.014670431148246212,"score_gpt":0.25773153004012894,"score_spread":0.24306109889188274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406909652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01405617,0.00029508528,0.9573306,0.0038658923,0.00008925053,0.00016359595,0.000018788116,0.00013856638,0.024042072],"genre_scores_gemma":[0.9565298,0.000072461975,0.042015564,0.00053358765,0.000010230292,0.000011456844,0.0000115505845,0.0000045253,0.00081081694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987339,0.0001319209,0.00047188468,0.0002711146,0.0002324346,0.00015879195],"domain_scores_gemma":[0.998721,0.00018369476,0.00018022249,0.0005947651,0.00026294304,0.000057393405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000301105,0.00011099874,0.00032121994,0.00016280529,0.000065675005,0.00009419272,0.00051793957,0.00002933958,0.00022198482],"category_scores_gemma":[0.0001248903,0.00009729411,0.00009975125,0.0014619145,0.000091998634,0.00021293748,0.00015682235,0.000056861634,0.000017963845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004766814,0.000078833255,0.0029382957,0.00012187981,0.000072409974,6.134203e-7,0.00015576929,0.000036055557,0.00016229262,0.9920228,0.0005909451,0.003815311],"study_design_scores_gemma":[0.0020369927,0.00031947275,0.070947416,0.0005646659,0.00048415706,0.0000070222545,0.0012435515,0.7470311,0.013589018,0.04175688,0.1201516,0.0018681338],"about_ca_topic_score_codex":0.00020003594,"about_ca_topic_score_gemma":0.000004172201,"teacher_disagreement_score":0.95026594,"about_ca_system_score_codex":0.000061616,"about_ca_system_score_gemma":0.00016572305,"threshold_uncertainty_score":0.39675388},"labels":[],"label_agreement":null},{"id":"W4407104476","doi":"10.28924/2291-8639-23-2025-34","title":"Approximating Fixed Point of (α, β, γ)-Nonexpansive Mappings Using JK Iterative Scheme","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Scheme (mathematics); Fixed point; Mathematical analysis","score_opus":0.009252092969256668,"score_gpt":0.29309616320347764,"score_spread":0.283844070234221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407104476","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007703181,0.00012012778,0.989308,0.0021165386,0.000043979097,0.00006500735,0.000009584101,0.0000074398476,0.00062613114],"genre_scores_gemma":[0.72060037,0.00006285953,0.27884483,0.0002974392,0.00006021446,0.00000696204,0.0000111834315,0.0000025647707,0.00011359657],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986244,0.000045060155,0.00073705125,0.0001717865,0.0003467604,0.00007497409],"domain_scores_gemma":[0.9971357,0.00013401212,0.000816941,0.00016186753,0.001703439,0.000048055965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035333863,0.0000916471,0.00029328038,0.0010366853,0.00009401362,0.00014901716,0.0005357672,0.00003570196,0.000029179957],"category_scores_gemma":[0.00007522283,0.00008062922,0.00024957396,0.0016326278,0.000044639033,0.0004187017,0.00013333248,0.00009007234,7.951852e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003207851,0.00051901257,0.01957279,0.000032843014,0.011728068,0.0000052902947,0.0017769024,0.07458983,0.018914562,0.85103226,0.00019270829,0.021603642],"study_design_scores_gemma":[0.0005002472,0.00002090973,0.0056254463,0.00006259848,0.0006471121,0.000014012537,0.00039379057,0.976082,0.0035458722,0.011924589,0.0010417148,0.00014167994],"about_ca_topic_score_codex":0.000031448988,"about_ca_topic_score_gemma":0.000004025536,"teacher_disagreement_score":0.9014922,"about_ca_system_score_codex":0.000052519146,"about_ca_system_score_gemma":0.000103698,"threshold_uncertainty_score":0.32879642},"labels":[],"label_agreement":null},{"id":"W4407244990","doi":"10.1007/s11590-025-02192-7","title":"A necessary condition for the guarantee of the superiorization method","year":2025,"lang":"en","type":"article","venue":"Optimization Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Cancer Institute; National Institutes of Health; University of Haifa; Israel Science Foundation; National Natural Science Foundation of China; Deutsches Krebsforschungszentrum","keywords":"Iterated function; Sequence (biology); Function (biology); Outcome (game theory); Mathematics; Mathematical optimization; Value (mathematics); Convergence (economics); Initial value problem; Convex function; Rate of convergence; Regular polygon; Algorithm; Gradient descent; Applied mathematics; Computer science; Mathematical economics; Statistics; Mathematical analysis; Channel (broadcasting); Artificial intelligence","score_opus":0.006837686961980912,"score_gpt":0.2661051495676065,"score_spread":0.2592674626056256,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407244990","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000070429465,0.000027185395,0.94670105,0.05228793,0.00034272202,0.0003160496,0.000008174042,0.00003224231,0.00021420808],"genre_scores_gemma":[0.113278955,0.000059947823,0.8679016,0.017581703,0.00007324882,0.00014388555,0.000079578575,0.000012739157,0.00086831505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991686,0.00011659795,0.00025659523,0.00018751029,0.00017767942,0.000093056056],"domain_scores_gemma":[0.9989299,0.00033365298,0.000157417,0.00035182064,0.00021793031,0.000009240615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030329387,0.000081625214,0.00010524499,0.000110975714,0.00030928827,0.000099570694,0.0005453784,0.00003673093,0.0000302045],"category_scores_gemma":[0.00013265101,0.000051440715,0.00011661787,0.0011279645,0.000039909486,0.00031531687,0.00007305647,0.00004652967,8.7881216e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000039441825,0.00001333315,0.00015159039,0.000007371429,0.000041515934,2.286411e-8,0.000107749234,0.88909423,0.0004147712,0.10742307,0.002093019,0.00064936234],"study_design_scores_gemma":[0.00029028096,0.000004932651,0.000683144,0.000012095407,0.00005254156,5.03605e-7,0.000022399392,0.9959737,0.0008651907,0.0005369547,0.0015023486,0.000055925673],"about_ca_topic_score_codex":0.00001212651,"about_ca_topic_score_gemma":0.0000020342088,"teacher_disagreement_score":0.113208525,"about_ca_system_score_codex":0.000028396924,"about_ca_system_score_gemma":0.00006179425,"threshold_uncertainty_score":0.23788266},"labels":[],"label_agreement":null},{"id":"W4408125550","doi":"10.1016/j.cnsns.2025.108734","title":"Two accelerated double inertial algorithms for variational inequalities on Hadamard manifolds","year":2025,"lang":"en","type":"article","venue":"Communications in Nonlinear Science and Numerical Simulation","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Fundamental Research Funds for the Central Universities; Natural Science Foundation of Chongqing; National Natural Science Foundation of China; St. Thomas University","keywords":"Hadamard transform; Inertial frame of reference; Mathematics; Variational inequality; Algorithm; Inequality; Applied mathematics; Pure mathematics; Mathematical analysis; Physics; Classical mechanics","score_opus":0.09239345723974057,"score_gpt":0.3988448430460079,"score_spread":0.30645138580626735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408125550","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020516473,0.00004241071,0.98780245,0.00785763,0.0001227661,0.0002908092,0.0000082656725,0.00006448743,0.001759532],"genre_scores_gemma":[0.774343,0.000019728468,0.22441174,0.0009474866,0.00002933978,0.000053161773,0.00005466879,0.0000032740033,0.0001375746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870265,0.00008506596,0.00036342992,0.00033652963,0.0003355154,0.00017683393],"domain_scores_gemma":[0.9978318,0.00073757046,0.00009802397,0.0006416013,0.00063739833,0.000053575335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010588194,0.00010377457,0.00014471797,0.00047743,0.00058104115,0.00031138278,0.0010307586,0.000046131183,0.000008085088],"category_scores_gemma":[0.0004301403,0.00009755211,0.000034397613,0.002617201,0.00014584203,0.0007434854,0.0003627865,0.000110051435,0.000004802605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035651374,0.00022887914,0.0010741315,0.000004975281,0.000011125492,9.77532e-8,0.00023122143,0.35158864,0.0001222742,0.62626666,0.00002953764,0.020406812],"study_design_scores_gemma":[0.00087088183,0.000032236763,0.004818935,0.000012786506,0.000006447727,1.9379733e-7,0.00002470886,0.98672473,0.0000989203,0.00436622,0.00293807,0.00010587827],"about_ca_topic_score_codex":0.00011107297,"about_ca_topic_score_gemma":0.000017565708,"teacher_disagreement_score":0.77229136,"about_ca_system_score_codex":0.00013344015,"about_ca_system_score_gemma":0.00030607413,"threshold_uncertainty_score":0.44689575},"labels":[],"label_agreement":null},{"id":"W4408159900","doi":"10.1007/s10107-025-02197-1","title":"Nonsmooth nonconvex–nonconcave minimax optimization: Primal–dual balancing and iteration complexity analysis","year":2025,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Minimax; Dual (grammatical number); Mathematical optimization; Numerical analysis; Applied mathematics","score_opus":0.01581679033868256,"score_gpt":0.2714378659362668,"score_spread":0.25562107559758424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408159900","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00062446186,0.00004517862,0.9913541,0.0022808278,0.000049757597,0.00024227795,0.0000020857115,0.00020314673,0.005198128],"genre_scores_gemma":[0.26560387,0.0000039420156,0.73342913,0.0004008618,0.000022463837,0.00003338372,0.000033631222,0.000005821888,0.00046687934],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998339,0.00009683306,0.000529248,0.0004611178,0.0003197696,0.00025404664],"domain_scores_gemma":[0.99888897,0.00027390724,0.00015478561,0.00035605725,0.0002144875,0.00011180916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005335944,0.0001831627,0.00039428,0.00040678002,0.0003044453,0.0006919807,0.00025995247,0.00008445962,0.00016881771],"category_scores_gemma":[0.00018441379,0.00016528126,0.00014962432,0.0021331147,0.000094747644,0.00047776802,0.00022577906,0.000115617666,0.000013866585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000072532607,0.00025487816,0.0021550232,0.00011504983,0.00066355517,0.00000653829,0.0010499307,0.035393354,0.000015681368,0.9296881,0.00008814246,0.030562477],"study_design_scores_gemma":[0.00028098832,0.000023177367,0.0010481277,0.000028004453,0.00029563552,0.000003923673,0.00005694705,0.98638004,0.000034216588,0.011343545,0.0003341797,0.00017122299],"about_ca_topic_score_codex":0.000010276704,"about_ca_topic_score_gemma":0.000010712146,"teacher_disagreement_score":0.9509867,"about_ca_system_score_codex":0.00006793876,"about_ca_system_score_gemma":0.00007135667,"threshold_uncertainty_score":0.67399746},"labels":[],"label_agreement":null},{"id":"W4408578012","doi":"10.23952/jano.7.2025.1.04","title":"Explicit iterative methods for the split feasibility problem with multiple output sets","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Iterative method; Computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.019025794215610275,"score_gpt":0.3115094066775586,"score_spread":0.2924836124619483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408578012","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005423023,0.00007614957,0.99521035,0.0036486802,0.00005201167,0.00031241224,0.0000015520982,0.000014493848,0.0006301089],"genre_scores_gemma":[0.08095559,0.000033712644,0.91826683,0.00059860793,0.000025286825,0.000022878461,0.0000033854242,0.0000042603842,0.00008946585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991446,0.00006247073,0.00035656593,0.00018500643,0.00014671682,0.00010460927],"domain_scores_gemma":[0.9984526,0.000647036,0.00030648365,0.00014375229,0.00039418347,0.000055940323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058157544,0.00010517593,0.00022327462,0.000103718034,0.00020847225,0.0001794595,0.00023544487,0.000041498413,0.0000065751333],"category_scores_gemma":[0.00008078748,0.000059755028,0.000068595386,0.0005174965,0.000025608917,0.00026401077,0.00005275547,0.00010095525,2.477464e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019566694,0.00008983031,0.00022793972,0.000013094348,0.00012083581,1.9503238e-7,0.00040095468,0.90977854,0.000030233157,0.061117362,0.00017531187,0.027850058],"study_design_scores_gemma":[0.0008064357,0.000092243914,0.0008404523,0.000011705925,0.000066096116,0.000003270918,0.000057555586,0.99229795,0.00012024242,0.004375839,0.0012539246,0.000074314084],"about_ca_topic_score_codex":0.0000019233833,"about_ca_topic_score_gemma":2.6525112e-7,"teacher_disagreement_score":0.082519405,"about_ca_system_score_codex":0.000037737187,"about_ca_system_score_gemma":0.00007905841,"threshold_uncertainty_score":0.24367394},"labels":[],"label_agreement":null},{"id":"W4408578410","doi":"10.23952/jano.7.2025.1.05","title":"Approximate weak and proper subdifferentials of the difference of two vector convex mappings and applications","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Regular polygon; Mathematics; Vector (molecular biology); Pure mathematics; Geometry; Biology","score_opus":0.006293103049162445,"score_gpt":0.2214991119194109,"score_spread":0.21520600887024846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408578410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034711782,0.00010954465,0.99476594,0.0007840262,0.000028660173,0.00015925705,0.00000207364,0.0000052348228,0.00067410443],"genre_scores_gemma":[0.930939,0.00020520082,0.06866925,0.000105181345,0.000015978381,0.000007413482,0.000001299006,0.0000030278666,0.000053604224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992012,0.00003374102,0.0004027771,0.00013032295,0.00016699734,0.000064989035],"domain_scores_gemma":[0.99911606,0.00008017372,0.00044158654,0.00011375326,0.0002045386,0.000043861815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015273245,0.00008132185,0.0002579552,0.00011405215,0.000079542624,0.000049517334,0.00017353277,0.000035655008,0.000006859786],"category_scores_gemma":[0.000021952068,0.000051778778,0.00003787846,0.0004224547,0.000090624264,0.0001026037,0.00011374423,0.00007323136,6.333082e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001089605,0.00034536206,0.0058162124,0.00025543652,0.00026530138,1.7905056e-7,0.0007434514,0.10618421,0.015125752,0.8473103,0.000052343654,0.023792498],"study_design_scores_gemma":[0.00097091385,0.00005180973,0.019195398,0.00005864548,0.00012702063,0.00000612743,0.00005107634,0.9659027,0.0036556206,0.009740039,0.00012803348,0.00011264694],"about_ca_topic_score_codex":0.00000464884,"about_ca_topic_score_gemma":1.7475628e-7,"teacher_disagreement_score":0.9274679,"about_ca_system_score_codex":0.000008729229,"about_ca_system_score_gemma":0.00004362316,"threshold_uncertainty_score":0.21114773},"labels":[],"label_agreement":null},{"id":"W4408768692","doi":"10.23952/asvao.7.2025.2.06","title":"An Inertial scheme for approximating the solutions of pseudo-monotone equilibrium and common fixed point problems in Banach spaces","year":2025,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation","keywords":"Banach space; Monotone polygon; Inertial frame of reference; Mathematics; Fixed point; Scheme (mathematics); Fixed-point theorem; Pure mathematics; Applied mathematics; Mathematical analysis; Physics; Classical mechanics; Geometry","score_opus":0.014606569909322065,"score_gpt":0.26223810458000674,"score_spread":0.24763153467068466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408768692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012951353,0.0000861581,0.9850297,0.0012319565,0.000016147666,0.00042675898,0.00000975861,0.000036870355,0.00021128547],"genre_scores_gemma":[0.72980636,0.00003095985,0.26973727,0.00014214219,0.000011974933,0.00008467059,0.00015890112,0.0000053886174,0.000022321095],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855584,0.00010370146,0.00055719283,0.00040914337,0.00018236563,0.00019173797],"domain_scores_gemma":[0.9990284,0.00014456795,0.0002791492,0.00034279792,0.00015647031,0.000048659487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008806388,0.00015106176,0.00038192724,0.00053815916,0.00023025023,0.00023358196,0.00027001605,0.00008074499,0.000008027174],"category_scores_gemma":[0.0000480609,0.00012025116,0.00008510927,0.0024671038,0.000071870956,0.0003403743,0.0001394329,0.00007991557,1.3389297e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000112801845,0.000076394084,0.0022483505,0.000028949542,0.00022495014,3.5458083e-8,0.0005583078,0.89580494,0.0010357585,0.09924568,0.000011395419,0.00075393805],"study_design_scores_gemma":[0.00054051034,0.000024032517,0.0019138238,0.0000112618145,0.00031602933,2.0937848e-7,0.00023440506,0.99470663,0.00022169972,0.0019005672,0.0000060167313,0.00012481993],"about_ca_topic_score_codex":0.0002138748,"about_ca_topic_score_gemma":0.00017517994,"teacher_disagreement_score":0.716855,"about_ca_system_score_codex":0.000026062142,"about_ca_system_score_gemma":0.000045642584,"threshold_uncertainty_score":0.49037},"labels":[],"label_agreement":null},{"id":"W4408965248","doi":"10.1007/s10957-025-02647-y","title":"Fully Zeroth-Order Bilevel Programming via Gaussian Smoothing","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bilevel optimization; Theory of computation; Mathematics; Gaussian; Smoothing; Mathematical optimization; Order (exchange); Applied mathematics; Zeroth law of thermodynamics; Calculus (dental); Algorithm; Optimization problem; Statistics; Physics","score_opus":0.005682910952490658,"score_gpt":0.2516350456607874,"score_spread":0.24595213470829677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408965248","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019968662,0.00020230978,0.9948885,0.0030859078,0.00006499934,0.00016885638,9.835354e-7,0.000037245383,0.0015312482],"genre_scores_gemma":[0.07054127,0.00016942312,0.926933,0.0011039989,0.00010454023,0.000048504648,0.000009150091,0.0000091938455,0.0010809146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989643,0.00012484424,0.0004617817,0.00017156535,0.00016548853,0.0001120396],"domain_scores_gemma":[0.9986245,0.0001940742,0.0003718188,0.00020642237,0.00052539597,0.00007778306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008294901,0.00010182798,0.00016157595,0.00035244584,0.00032365008,0.00023365622,0.0003582163,0.00005830087,0.00004978101],"category_scores_gemma":[0.0000994767,0.000087260145,0.00006946664,0.0012179879,0.000045995886,0.0005934119,0.000070248905,0.00012459152,0.0000027568829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009364241,0.00008350095,0.00007870152,0.000009942325,0.000059806935,4.5588985e-7,0.00013941765,0.29969227,0.00003625956,0.6393088,0.00006324367,0.060518254],"study_design_scores_gemma":[0.0008855829,0.00006088758,0.0005117032,0.000069351365,0.00016170203,0.00005272409,0.00019750558,0.83001435,0.00027886362,0.14419211,0.023289556,0.00028564155],"about_ca_topic_score_codex":0.0000011275187,"about_ca_topic_score_gemma":3.4849748e-7,"teacher_disagreement_score":0.5303221,"about_ca_system_score_codex":0.000028398583,"about_ca_system_score_gemma":0.000121696954,"threshold_uncertainty_score":0.35583654},"labels":[],"label_agreement":null},{"id":"W4409337533","doi":"10.1007/s11228-025-00750-w","title":"Calm Local Optimality for Nonconvex-Nonconcave Minimax Problems","year":2025,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Minimax; Mathematical optimization; Mathematical economics; Economics; Mathematics; Computer science","score_opus":0.015341426648920797,"score_gpt":0.2783141284345232,"score_spread":0.2629727017856024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409337533","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004181786,0.00011906435,0.99141335,0.0057069473,0.00012586077,0.00024186552,0.00009713287,0.00008574612,0.0017918771],"genre_scores_gemma":[0.7473234,0.000034397504,0.24560854,0.0024166503,0.0001140648,0.00014180184,0.00058680767,0.000010228751,0.0037640918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978868,0.00013583976,0.000583211,0.00071547856,0.00039861153,0.00028009716],"domain_scores_gemma":[0.9982789,0.0003944185,0.00021778219,0.00037974666,0.00059384346,0.00013531631],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008228299,0.00022579568,0.00047333093,0.0006561009,0.0004155448,0.00027869223,0.00044650686,0.00013368009,0.00014146876],"category_scores_gemma":[0.00012561458,0.00020496978,0.00039168974,0.0028442377,0.000072323965,0.00042590816,0.00017023935,0.00010362187,0.000011688961],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021297012,0.00012197734,0.00380022,0.000030773605,0.0023739357,7.489283e-7,0.00029806854,0.16000761,0.000023570268,0.82945466,0.00081101136,0.0030561236],"study_design_scores_gemma":[0.0007222076,0.000031084073,0.020548603,0.0000083800305,0.001047672,8.3410595e-7,0.00004469368,0.94910455,0.000025096973,0.02611002,0.0021333017,0.00022358887],"about_ca_topic_score_codex":0.00021667308,"about_ca_topic_score_gemma":0.00009142682,"teacher_disagreement_score":0.80334467,"about_ca_system_score_codex":0.000103133665,"about_ca_system_score_gemma":0.00026147178,"threshold_uncertainty_score":0.8358425},"labels":[],"label_agreement":null},{"id":"W4409346340","doi":"10.23952/asvao.7.2025.3.01","title":"Preface","year":2025,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Philosophy","score_opus":0.007098429098351498,"score_gpt":0.2375803590673039,"score_spread":0.2304819299689524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409346340","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002261097,0.000072420575,0.9884671,0.0009663572,0.000039394276,0.000114000315,0.000002932446,0.00012746298,0.0099842325],"genre_scores_gemma":[0.49360695,0.0001647883,0.5029199,0.00131561,0.000021707974,0.000031669755,0.00017429722,0.0000069318044,0.0017581059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99876046,0.00005283537,0.00031780466,0.00048000758,0.00022716373,0.00016170387],"domain_scores_gemma":[0.9992057,0.000054492117,0.00012693409,0.00039669432,0.00014807847,0.00006810151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027567204,0.0001485331,0.0002792009,0.00071126776,0.0002678551,0.00030256694,0.00030652998,0.00008097292,0.00009739181],"category_scores_gemma":[0.00002617568,0.00013724233,0.000116666015,0.0044106008,0.000027991937,0.00025717166,0.00013979991,0.000068901914,0.000008635141],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003072628,0.00002338226,0.00044220316,0.0000040001505,0.00043464758,1.580322e-7,0.00008780312,0.7328655,0.000020414434,0.26417968,0.00013869969,0.00180041],"study_design_scores_gemma":[0.00026422748,0.0000051052257,0.0018450585,0.0000026183322,0.00057300605,1.6719278e-7,0.000031563464,0.99496806,0.00011668595,0.0017051187,0.0003463325,0.00014205331],"about_ca_topic_score_codex":0.000029601382,"about_ca_topic_score_gemma":0.000011870458,"teacher_disagreement_score":0.49338084,"about_ca_system_score_codex":0.00003175875,"about_ca_system_score_gemma":0.000047008372,"threshold_uncertainty_score":0.559658},"labels":[],"label_agreement":null},{"id":"W4409346344","doi":"10.23952/asvao.7.2025.3.03","title":"Some of the latest applications of certain minimax theorems","year":2025,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Gruppo Nazionale per l'Analisi Matematica, la Probabilità e le loro Applicazioni; European Commission; Università di Catania; Istituto Nazionale di Alta Matematica \"Francesco Severi\"","keywords":"Minimax; Mathematics; Mathematical economics; Calculus (dental); Applied mathematics; Medicine","score_opus":0.005842625390165904,"score_gpt":0.22976565258876697,"score_spread":0.22392302719860108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409346344","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00045590327,0.00011702957,0.9964423,0.0007967528,0.00002197545,0.00021539768,0.00001254526,0.000025235087,0.0019128592],"genre_scores_gemma":[0.8977359,0.00014599787,0.101244606,0.00029022567,0.0000173781,0.000046691486,0.00007778066,0.000005362514,0.00043604348],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988073,0.00007000708,0.00046945963,0.0003020672,0.00024414607,0.0001070344],"domain_scores_gemma":[0.99874675,0.00011299714,0.00035230606,0.00052801,0.00022644739,0.00003347575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031445303,0.00011887489,0.00031120196,0.00046635605,0.00017149265,0.00005537373,0.0003939556,0.000071079114,0.000027262715],"category_scores_gemma":[0.00002852483,0.00008809764,0.00017345898,0.0044955546,0.00009227149,0.00013914077,0.00015696576,0.000057635087,8.3334186e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000026776656,0.00003965087,0.00063910283,0.000009885814,0.00028803217,1.4260242e-8,0.00010163337,0.56825304,0.00010049709,0.4298959,0.00002198494,0.0006475639],"study_design_scores_gemma":[0.00022589015,0.0000054415914,0.0023306655,0.000005984439,0.0006491789,1.10644514e-7,0.00006482801,0.9840392,0.00092807395,0.011578026,0.00008388899,0.000088708715],"about_ca_topic_score_codex":0.000050822036,"about_ca_topic_score_gemma":0.000011098777,"teacher_disagreement_score":0.89728004,"about_ca_system_score_codex":0.000017745147,"about_ca_system_score_gemma":0.00006446982,"threshold_uncertainty_score":0.35925174},"labels":[],"label_agreement":null},{"id":"W4409575416","doi":"10.1007/s10957-025-02633-4","title":"On Further Notions of Strong Nonexpansiveness and Corresponding Notions of Monotonicity","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Monotonic function; Theory of computation; Mathematical economics; Pure mathematics; Calculus (dental); Mathematical analysis; Algorithm","score_opus":0.0060534767553237084,"score_gpt":0.26060178471429657,"score_spread":0.2545483079589729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409575416","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035398006,0.000100924146,0.99461234,0.00075002975,0.000040118237,0.00013203498,0.0000114571285,0.0000080875425,0.0008051906],"genre_scores_gemma":[0.9417079,0.00016623376,0.057813175,0.00009958733,0.000015545278,0.000012871035,0.000005172744,0.000004035874,0.00017548913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909925,0.00013153217,0.00044945476,0.00012489123,0.00013213468,0.00006276144],"domain_scores_gemma":[0.99823964,0.0005420126,0.0004813958,0.00017799022,0.00051464955,0.000044300614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005258767,0.00007874655,0.00019757659,0.00041943736,0.00014919118,0.000036153324,0.0002002093,0.000045703648,0.000030596828],"category_scores_gemma":[0.0001222423,0.00006986093,0.000066005174,0.00073205016,0.00008176341,0.0002827142,0.00005061912,0.000082364684,3.6975774e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021070224,0.00008776259,0.00012864542,0.000009152706,0.000039581686,6.187506e-8,0.00013900342,0.43936503,0.00013495627,0.5589298,0.0000074220493,0.001137494],"study_design_scores_gemma":[0.0013732912,0.00017089039,0.0053099585,0.00019046433,0.00027660662,0.000013817773,0.0007080521,0.88573927,0.0030853078,0.10261581,0.00029499878,0.00022155241],"about_ca_topic_score_codex":0.0000016255351,"about_ca_topic_score_gemma":5.0051165e-7,"teacher_disagreement_score":0.9381681,"about_ca_system_score_codex":0.000016962233,"about_ca_system_score_gemma":0.0000867386,"threshold_uncertainty_score":0.2848846},"labels":[],"label_agreement":null},{"id":"W4410327681","doi":"10.23952/jnva.9.2025.4.05","title":"Log-exponential approximation in semi-infinite programming: A variational approach","year":2025,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; Agencia Nacional de Investigación y Desarrollo","keywords":"Exponential function; Applied mathematics; Mathematics; Exponential growth; Semi-infinite programming; Mathematical optimization; Mathematical analysis; Calculus (dental); Geometry","score_opus":0.011704033823622426,"score_gpt":0.2568907822599164,"score_spread":0.24518674843629398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410327681","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023078006,0.000095358664,0.99415547,0.0025627709,0.00010556369,0.000092366914,0.000009542648,0.000016540924,0.0006546168],"genre_scores_gemma":[0.36253643,0.0000567888,0.63640827,0.0003489261,0.00019183807,0.000009953357,0.00014170946,0.0000054828383,0.00030058587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977612,0.00017695238,0.0009702788,0.00030149298,0.00061544124,0.0001746585],"domain_scores_gemma":[0.9981776,0.0002483939,0.00059404736,0.00018372475,0.0007068081,0.000089463676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012212294,0.00016242296,0.00044859046,0.0020656732,0.0001349955,0.00026851543,0.00038929147,0.00011132817,0.000040439245],"category_scores_gemma":[0.00022482156,0.00014214881,0.0003201296,0.0042563323,0.000028358867,0.00060284464,0.000102841695,0.00022144841,0.000002181685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007649645,0.001196635,0.07405244,0.00004252111,0.0031716472,0.0000075415896,0.0006651447,0.48180598,0.00009269566,0.43203205,0.00009072615,0.006766137],"study_design_scores_gemma":[0.0007527818,0.000027351116,0.09151373,0.0000108913155,0.00050116744,0.000009051299,0.000029987177,0.90160197,0.000007024082,0.004720286,0.00070399087,0.00012175334],"about_ca_topic_score_codex":0.0000423295,"about_ca_topic_score_gemma":0.000020412699,"teacher_disagreement_score":0.42731175,"about_ca_system_score_codex":0.000090428846,"about_ca_system_score_gemma":0.00031568267,"threshold_uncertainty_score":0.579666},"labels":[],"label_agreement":null},{"id":"W4410328011","doi":"10.23952/asvao.8.2026.1.05","title":"New approximate optimality conditions of strong type in multiobjective generalized Nash equilibrium problems","year":2025,"lang":"en","type":"article","venue":"Applied Set-Valued Analysis and Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Nash equilibrium; Type (biology); Mathematical economics; Mathematics; Mathematical optimization; Applied mathematics; Geology","score_opus":0.014272253567528675,"score_gpt":0.27251743745524193,"score_spread":0.2582451838877132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410328011","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003089433,0.00006877846,0.9940118,0.000246956,0.000040608713,0.00029835233,0.00001479299,0.00006173672,0.0021675394],"genre_scores_gemma":[0.59561354,0.000063726475,0.403501,0.000115129544,0.000012370644,0.000027299235,0.0003976441,0.0000070326228,0.0002622376],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983043,0.00011326199,0.000602228,0.00052449707,0.00025497502,0.00020073063],"domain_scores_gemma":[0.9989222,0.00006815533,0.0002854826,0.00036877248,0.00027696427,0.00007842273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038132482,0.00018594917,0.00048099467,0.0009439012,0.0001097228,0.0001415013,0.0002805963,0.00010656357,0.00010099704],"category_scores_gemma":[0.00004091815,0.00018287376,0.00012701782,0.005321989,0.000043157055,0.00034240642,0.00014747615,0.00009464337,0.0000015643334],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001412214,0.00006110929,0.0015456926,0.000015573913,0.00039104157,1.6821969e-7,0.00027352382,0.8509186,0.0002646117,0.1461626,0.000036964797,0.0003159838],"study_design_scores_gemma":[0.0008674846,0.000014367775,0.003955772,0.000011046098,0.0004139281,1.6717217e-7,0.0000724019,0.9917091,0.00035509025,0.002425342,0.000010997022,0.00016428925],"about_ca_topic_score_codex":0.0003399125,"about_ca_topic_score_gemma":0.000083486084,"teacher_disagreement_score":0.5925241,"about_ca_system_score_codex":0.00006239236,"about_ca_system_score_gemma":0.00015001193,"threshold_uncertainty_score":0.74573755},"labels":[],"label_agreement":null},{"id":"W4410527794","doi":"10.23952/jnva.9.2025.5.01","title":"On the stability for parametric set optimization problems via improvement sets without the strict convexity","year":2025,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Shenzhen Research Institute, City University of Hong Kong; Shenzhen Research Institute of Big Data; Centre Scientifique et Technique du Bâtiment; National Natural Science Foundation of China","keywords":"Convexity; Parametric statistics; Set (abstract data type); Stability (learning theory); Mathematical optimization; Mathematics; Optimization problem; Computer science; Statistics; Machine learning; Economics","score_opus":0.02368541174404669,"score_gpt":0.27803174944309667,"score_spread":0.25434633769904996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410527794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004003085,0.000046012472,0.97977823,0.015717188,0.0000966919,0.00024605685,0.000037334605,0.000008750581,0.000066635184],"genre_scores_gemma":[0.8974072,0.00006905566,0.10032386,0.0019192038,0.00008540941,0.000023267494,0.000052518353,0.0000047805847,0.00011472694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982811,0.0002283285,0.0006368546,0.00022300228,0.0005030024,0.00012768364],"domain_scores_gemma":[0.99628544,0.0017139424,0.0006029852,0.0002734693,0.001068793,0.000055389348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024105653,0.00013141819,0.0002916335,0.0004961612,0.00039686606,0.00025031378,0.0004559497,0.000054010696,0.00007283671],"category_scores_gemma":[0.00070898194,0.00006964912,0.00032615595,0.0028722857,0.000038280956,0.00025270766,0.00007349195,0.00015907906,8.2949083e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000496366,0.00018947516,0.0039711855,0.000010844255,0.0018325881,1.5920483e-7,0.00013327679,0.9470726,0.00001045785,0.045591667,0.00017405408,0.0009640556],"study_design_scores_gemma":[0.00041407495,0.000099976794,0.009427663,0.0000055319315,0.0007832741,0.0000010896287,0.000027996499,0.97837055,0.000026520158,0.01057149,0.00019719372,0.00007463259],"about_ca_topic_score_codex":0.000029163733,"about_ca_topic_score_gemma":0.000011096368,"teacher_disagreement_score":0.89340407,"about_ca_system_score_codex":0.000075692005,"about_ca_system_score_gemma":0.00019318466,"threshold_uncertainty_score":0.30524132},"labels":[],"label_agreement":null},{"id":"W4410527853","doi":"10.23952/jnva.9.2025.5.08","title":"Image space analysis to lagrange duality in nonconvex set optimization","year":2025,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Duality (order theory); Space (punctuation); Set (abstract data type); Mathematics; Image (mathematics); Lagrange multiplier; Mathematical optimization; Computer science; Combinatorics; Artificial intelligence; Programming language","score_opus":0.010211471036947145,"score_gpt":0.28971300090534946,"score_spread":0.2795015298684023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410527853","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004421853,0.00006384516,0.9826115,0.012289526,0.000070991926,0.000066055276,0.000030994004,0.000012941539,0.00043230044],"genre_scores_gemma":[0.23257586,0.00010160036,0.76542646,0.0012963349,0.00010078253,0.0000039996376,0.00008963799,0.0000050792164,0.00040027508],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99787104,0.00021854068,0.00088237046,0.00032395267,0.00053552026,0.00016856109],"domain_scores_gemma":[0.9978775,0.00029320485,0.00044777314,0.00026139134,0.0009734006,0.00014675799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001373564,0.0001598748,0.0006188246,0.003826228,0.000115860836,0.00025708717,0.00041155913,0.000083833525,0.0002002585],"category_scores_gemma":[0.00030421696,0.0001407497,0.00047715602,0.01328912,0.000020417008,0.00065888726,0.00012443945,0.00015813611,0.000004478638],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032545842,0.00017214565,0.03855484,0.0000078258245,0.0046818033,0.0000070745873,0.00036521137,0.94112986,0.00003620939,0.014644672,0.00012586339,0.00024193367],"study_design_scores_gemma":[0.00039712604,0.000022883884,0.14646624,0.000006410621,0.0024257198,0.0000016068274,0.000042128566,0.8496308,0.000010810389,0.0006022767,0.00027578938,0.00011824818],"about_ca_topic_score_codex":0.00017082924,"about_ca_topic_score_gemma":0.00020525084,"teacher_disagreement_score":0.228154,"about_ca_system_score_codex":0.000101014746,"about_ca_system_score_gemma":0.00019176018,"threshold_uncertainty_score":0.6384981},"labels":[],"label_agreement":null},{"id":"W4410527866","doi":"10.23952/jnva.9.2025.5.03","title":"First order optimality conditions for nonsmooth quadratic problems in Banach spaces","year":2025,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Banach space; Quadratic equation; Order (exchange); Mathematics; Applied mathematics; Pure mathematics; Mathematical optimization; Economics; Geometry; Finance","score_opus":0.012408810373061453,"score_gpt":0.28515666855944105,"score_spread":0.2727478581863796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410527866","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020973454,0.00013897452,0.984338,0.01300729,0.00007205887,0.000104671984,0.00003588248,0.0000084367475,0.00019733654],"genre_scores_gemma":[0.45836315,0.00016111415,0.5398141,0.0007479452,0.000119215605,0.000020500303,0.0000970907,0.000005849959,0.0006710479],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986198,0.00007770874,0.0006811106,0.00020972056,0.00028137147,0.00013030383],"domain_scores_gemma":[0.99802524,0.0005025115,0.00038163186,0.0001457042,0.00087715493,0.000067762994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008113478,0.00011498864,0.00038356037,0.001139216,0.00018618508,0.00020084396,0.00027790116,0.00006257158,0.00007096266],"category_scores_gemma":[0.00029586212,0.00009555563,0.00024992583,0.0030850517,0.000026271291,0.0004920794,0.000049103397,0.00010965301,0.0000012919508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017083856,0.00037761373,0.036856916,0.000040391154,0.0017424293,0.0000011683214,0.0002580712,0.8119219,0.00002176201,0.14829218,0.00028358016,0.00018689937],"study_design_scores_gemma":[0.0005085456,0.000034645247,0.07470867,0.000019718214,0.000563281,0.0000024614592,0.0000292261,0.9131548,0.000003174464,0.009679102,0.0012047004,0.00009170673],"about_ca_topic_score_codex":0.00007833825,"about_ca_topic_score_gemma":0.0003465647,"teacher_disagreement_score":0.4562658,"about_ca_system_score_codex":0.000059316946,"about_ca_system_score_gemma":0.0002699001,"threshold_uncertainty_score":0.38966456},"labels":[],"label_agreement":null},{"id":"W4410527867","doi":"10.23952/jnva.9.2025.5.04","title":"Convergence of inertial iterative algorithms based on auxiliary principle for linearly constrained monotone equilibrium problems","year":2025,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Chongqing; Natural Science Foundation of Ningxia Province; National Natural Science Foundation of China","keywords":"Convergence (economics); Inertial frame of reference; Monotone polygon; Mathematics; Applied mathematics; Mathematical optimization; Algorithm; Physics; Classical mechanics; Geometry; Economics","score_opus":0.013455802604535536,"score_gpt":0.28729571826500894,"score_spread":0.2738399156604734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410527867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0044706897,0.000044316857,0.9914979,0.0035000998,0.00013731027,0.00013518175,0.00009366885,0.000009614246,0.00011127356],"genre_scores_gemma":[0.59737545,0.000020642441,0.40134346,0.0006859166,0.00017093837,0.00000993387,0.00008975329,0.0000055656146,0.0002983649],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982484,0.0000977392,0.00085636234,0.00024066553,0.00042962795,0.00012722047],"domain_scores_gemma":[0.99709153,0.0005318649,0.000652636,0.00017329594,0.0014646287,0.000086027074],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073364394,0.00014396198,0.00047151186,0.0009112586,0.00009120443,0.00009133491,0.0003126292,0.00007353912,0.000052909527],"category_scores_gemma":[0.00029642068,0.00011646399,0.00039265028,0.0017277879,0.000049698574,0.00034319545,0.00005282904,0.00011418645,6.639479e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018227563,0.00058955397,0.0068403436,0.00005034903,0.0024427206,0.0000025052288,0.00023009416,0.9278397,0.0013070578,0.059454724,0.00009368732,0.00096699933],"study_design_scores_gemma":[0.0010811771,0.000204154,0.008491798,0.000026834165,0.0005784573,0.0000014778084,0.000008692785,0.98744863,0.00052824616,0.0010837067,0.0004423433,0.000104480685],"about_ca_topic_score_codex":0.000016376358,"about_ca_topic_score_gemma":0.0000042776746,"teacher_disagreement_score":0.59290475,"about_ca_system_score_codex":0.000037859252,"about_ca_system_score_gemma":0.00044648955,"threshold_uncertainty_score":0.47492635},"labels":[],"label_agreement":null},{"id":"W4410902729","doi":"10.33621/jdsr.v7i154879","title":"Autocompleting inequality","year":2025,"lang":"en","type":"article","venue":"Journal of Digital Social Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus","funders":"","keywords":"Inequality; Economics; Mathematics; Mathematical economics; Mathematical analysis","score_opus":0.13321789755303473,"score_gpt":0.45390023052560424,"score_spread":0.32068233297256954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410902729","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0091527635,0.000061950734,0.88684803,0.035348788,0.0001668108,0.0000823245,0.00000319902,0.000023622637,0.068312526],"genre_scores_gemma":[0.99534845,0.000004269003,0.003393664,0.000116264426,0.00012955294,9.615038e-7,7.060282e-7,0.000001732373,0.0010044203],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985603,0.0001385289,0.00031890848,0.00008471316,0.0007385163,0.00015900041],"domain_scores_gemma":[0.99825907,0.0003474041,0.00011498673,0.00007851931,0.0011477289,0.00005232174],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00170772,0.000039495357,0.00012619284,0.00032837671,0.00025420298,0.0006319371,0.00059135054,0.000033355496,0.00002144807],"category_scores_gemma":[0.001046332,0.000033057015,0.00011609994,0.0013706794,0.00004281053,0.00069794734,0.0002297092,0.00024579914,0.000013797867],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000146249795,0.00029273206,0.0058018593,0.000016480944,0.00011341155,0.000008832881,0.00064386276,0.00028277174,0.00006619242,0.9075859,0.012177312,0.072996],"study_design_scores_gemma":[0.002012383,0.0004067669,0.11092527,0.00011021104,0.000025824102,0.000014131851,0.001059526,0.09133746,0.0002737947,0.6466223,0.14683153,0.00038082048],"about_ca_topic_score_codex":0.0000054734824,"about_ca_topic_score_gemma":8.0393676e-7,"teacher_disagreement_score":0.9861957,"about_ca_system_score_codex":0.00010308461,"about_ca_system_score_gemma":0.00033409143,"threshold_uncertainty_score":0.6093784},"labels":[],"label_agreement":null},{"id":"W4411668152","doi":"10.28924/2291-8639-23-2025-160","title":"Accelerated Self-Adaptive Method for Solving Nonsmooth Convex Minimization Problem in Real Hilbert Spaces","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Minification; Hilbert space; Convex analysis; Regular polygon; Convex optimization; Mathematical optimization; Applied mathematics; Mathematical analysis; Pure mathematics; Geometry","score_opus":0.01480828194133054,"score_gpt":0.32208008977036096,"score_spread":0.3072718078290304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411668152","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041985224,0.000063236395,0.99294215,0.0053052013,0.000046972586,0.00017420838,0.000009957061,0.00001786584,0.0010205613],"genre_scores_gemma":[0.25088307,0.0003881106,0.7478457,0.00037889343,0.000084002866,0.00007041432,0.00003775421,0.0000048348306,0.0003072095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987391,0.0000559319,0.0006057759,0.00023799618,0.000260411,0.00010074767],"domain_scores_gemma":[0.99771863,0.00032698078,0.00048206592,0.00012896974,0.0012915502,0.00005178371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005081004,0.000103131046,0.0002823496,0.0012450274,0.00009942942,0.0002820049,0.0005126318,0.000054370914,0.000015837059],"category_scores_gemma":[0.000038139176,0.00009225809,0.00018083926,0.0018536637,0.00001646391,0.00043427752,0.000076038756,0.000085281565,7.6371214e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007108961,0.00061356026,0.018339125,0.000016595426,0.0054818583,0.0000028084758,0.0009108936,0.11219045,0.0004853334,0.81597346,0.000618105,0.045296732],"study_design_scores_gemma":[0.0006680356,0.000026927393,0.011278317,0.000019788924,0.00048182698,0.000003536525,0.00011046302,0.97242314,0.00031558308,0.010643858,0.003913655,0.00011489395],"about_ca_topic_score_codex":0.00011044699,"about_ca_topic_score_gemma":0.000091483744,"teacher_disagreement_score":0.86023265,"about_ca_system_score_codex":0.00009823171,"about_ca_system_score_gemma":0.00016511758,"threshold_uncertainty_score":0.37621754},"labels":[],"label_agreement":null},{"id":"W4412767575","doi":"10.23952/jano.7.2025.2.08","title":"An inertial extragradient algorithm with non-monotone step sizes for variational inequality problems and fixed point problems of nonexpansive semigroups","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Strong","keywords":"Variational inequality; Monotone polygon; Fixed point; Inertial frame of reference; Mathematics; Applied mathematics; Algorithm; Mathematical optimization; Mathematical analysis; Physics; Geometry","score_opus":0.006690705911487792,"score_gpt":0.22845132810469052,"score_spread":0.22176062219320272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767575","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019059816,0.00004071331,0.99675936,0.00079184904,0.00004975778,0.00034422643,0.000009476449,0.000012497953,0.00008614243],"genre_scores_gemma":[0.376604,0.000055320263,0.623082,0.00016053276,0.00003982904,0.000021913744,0.000023027478,0.0000057781717,0.000007639185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986716,0.000043939162,0.0006321437,0.00024588435,0.00027872808,0.00012769476],"domain_scores_gemma":[0.9984008,0.00015863874,0.0005999085,0.00012232561,0.0006120241,0.00010628596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043794792,0.00014427752,0.00036791785,0.00021454645,0.0001138559,0.000101731675,0.00016638225,0.00007110266,0.0000058151472],"category_scores_gemma":[0.000030439925,0.000108368564,0.000052459956,0.00050681183,0.00004631328,0.00045940027,0.00004334759,0.000097599506,6.679576e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001747399,0.000329995,0.0002070585,0.000061955725,0.00014747443,4.3473e-7,0.00082628237,0.9693887,0.00084354053,0.020445783,0.000025184689,0.0075488016],"study_design_scores_gemma":[0.0017061984,0.00047142545,0.0015856555,0.000045215264,0.00008320073,0.000006311092,0.00007256519,0.9934934,0.00029329918,0.0020697128,0.000046640045,0.00012638362],"about_ca_topic_score_codex":0.000016788485,"about_ca_topic_score_gemma":0.0000013499591,"teacher_disagreement_score":0.374698,"about_ca_system_score_codex":0.00003288992,"about_ca_system_score_gemma":0.00010900991,"threshold_uncertainty_score":0.44191417},"labels":[],"label_agreement":null},{"id":"W4412767577","doi":"10.23952/jano.7.2025.2.03","title":"Strong convergence of an inertial Tseng’s extragradient algorithm for pseudomonotone variational inequalities with applications to optimal control problems","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Centre Scientifique et Technique du Bâtiment; Fundamental Research Funds for the Central Universities; Natural Science Foundation of Chongqing","keywords":"Variational inequality; Inertial frame of reference; Convergence (economics); Algorithm; Mathematics; Applied mathematics; Computer science; Physics; Economics","score_opus":0.00856190637897728,"score_gpt":0.24556300266634484,"score_spread":0.23700109628736757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002755285,0.000022872175,0.99823034,0.0008096833,0.00005577051,0.00046573766,0.000019012614,0.000015808044,0.000105254294],"genre_scores_gemma":[0.24876626,0.000013042562,0.7508178,0.00021425444,0.000059355494,0.00008210836,0.000018977351,0.0000056241315,0.000022618597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871975,0.00004181622,0.0006043347,0.00021765547,0.0002820777,0.00013433711],"domain_scores_gemma":[0.9984837,0.0001597541,0.0004363177,0.00013214721,0.0006623241,0.00012573325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038862356,0.00012658088,0.00031297057,0.00026979286,0.0001184954,0.00008001816,0.00024988528,0.00005224656,0.000012009459],"category_scores_gemma":[0.000023769584,0.00010221359,0.000057673322,0.0005914856,0.000035372494,0.0003519871,0.000031830055,0.000076240365,2.6001197e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111296715,0.00017066527,0.000023098377,0.000013537461,0.00009087938,1.6581997e-7,0.00026162426,0.8597333,0.00016999197,0.13068517,0.000015871825,0.008724398],"study_design_scores_gemma":[0.0013542778,0.00030904385,0.0001993497,0.000015135753,0.00007607665,0.0000043391306,0.000086969114,0.99635893,0.00023664434,0.0009775053,0.00026884108,0.00011289278],"about_ca_topic_score_codex":0.000006785075,"about_ca_topic_score_gemma":4.953826e-7,"teacher_disagreement_score":0.24849072,"about_ca_system_score_codex":0.000041533585,"about_ca_system_score_gemma":0.00017235639,"threshold_uncertainty_score":0.41681492},"labels":[],"label_agreement":null},{"id":"W4412767601","doi":"10.23952/jano.7.2025.2.04","title":"Calculus rules of generalized proper $\\epsilon$-subdifferential for vector valued mappings and applications","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subderivative; Calculus (dental); Mathematics; Pure mathematics; Geometry; Medicine; Regular polygon; Orthodontics","score_opus":0.007807725067741243,"score_gpt":0.2367515569242589,"score_spread":0.22894383185651765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076427567,0.00011174376,0.9974649,0.0010446913,0.000056251938,0.00023539521,0.0000043338014,0.000012002653,0.00030639747],"genre_scores_gemma":[0.23800606,0.00013427611,0.7613471,0.00028829562,0.000063750806,0.000036449645,0.000014857331,0.000006663358,0.000102526436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913836,0.00002249227,0.00043445715,0.00015920785,0.0001562318,0.0000892518],"domain_scores_gemma":[0.9991314,0.00006516991,0.00033234537,0.000093725415,0.00031260602,0.00006476049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016596234,0.00009388806,0.00026950327,0.00019190073,0.00011632824,0.00007331503,0.00015716776,0.000055618548,0.0000110568135],"category_scores_gemma":[0.000027589847,0.000073379546,0.00006918553,0.00030136987,0.00005023119,0.00015349255,0.000054858607,0.00005750418,2.546494e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016173824,0.00017943734,0.000050009494,0.00007405188,0.00017380202,1.8158309e-7,0.00022793033,0.2164036,0.0016346036,0.7714983,0.00024953388,0.009346799],"study_design_scores_gemma":[0.0010862233,0.000058438625,0.00050807494,0.000013986445,0.00009840567,0.0000026405833,0.000017346038,0.99020517,0.0005649421,0.006295695,0.0010592316,0.00008986062],"about_ca_topic_score_codex":0.0000029248129,"about_ca_topic_score_gemma":7.7332906e-8,"teacher_disagreement_score":0.77380157,"about_ca_system_score_codex":0.000018317083,"about_ca_system_score_gemma":0.00006260946,"threshold_uncertainty_score":0.2992331},"labels":[],"label_agreement":null},{"id":"W4412767620","doi":"10.23952/jano.7.2025.2.06","title":"On approximate efficient solutions of nonsmooth minimax programming problems involving inequality and equality constraints with applications","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Minimax; Inequality; Mathematical optimization; Mathematics; Mathematical economics; Applied mathematics; Mathematical analysis","score_opus":0.013837618799269535,"score_gpt":0.2451002029475536,"score_spread":0.23126258414828407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010264782,0.00006518715,0.9972077,0.00068387244,0.000017509794,0.00026211565,0.0000031900724,0.000018603776,0.00071531796],"genre_scores_gemma":[0.6548767,0.00003011137,0.34492403,0.00013125947,0.000008465624,0.000017219325,0.000004689052,0.0000033350836,0.000004181436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881935,0.000052953565,0.00053397974,0.00020545472,0.0002574383,0.00013081655],"domain_scores_gemma":[0.9987712,0.00017922437,0.00051906874,0.00013758757,0.00030950623,0.000083442246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005576031,0.00011245165,0.00027114147,0.0002182997,0.00017572167,0.000091777576,0.00014718296,0.000050491006,0.0000051380794],"category_scores_gemma":[0.00004211021,0.00008553367,0.000040460396,0.000738441,0.00013037233,0.00012818904,0.00007056033,0.000117940544,1.808733e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003689411,0.00024055081,0.00014618924,0.000052641324,0.00005232608,1.7217221e-7,0.00021209885,0.594978,0.00007313147,0.39499256,0.000005894654,0.009209536],"study_design_scores_gemma":[0.0007317074,0.00012071573,0.00046508072,0.00007022297,0.00006426406,0.0000050750546,0.000105391075,0.9944244,0.00008240262,0.0037235168,0.000094349045,0.00011289829],"about_ca_topic_score_codex":0.0000047768,"about_ca_topic_score_gemma":4.214501e-7,"teacher_disagreement_score":0.6538502,"about_ca_system_score_codex":0.000041954296,"about_ca_system_score_gemma":0.00010377049,"threshold_uncertainty_score":0.34879616},"labels":[],"label_agreement":null},{"id":"W4412826065","doi":"10.28924/2291-8639-23-2025-185","title":"Approximating Solutions of Resolvents of Monotone Operators and Convex Functions in Hadamard Spaces","year":2025,"lang":"en","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Hadamard transform; Monotone polygon; Pure mathematics; Regular polygon; Convex function; Mathematical analysis; Geometry","score_opus":0.007995188861906696,"score_gpt":0.26727683344786746,"score_spread":0.25928164458596076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412826065","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02383092,0.00026845827,0.9733173,0.0020993385,0.000046724563,0.00006177196,0.00001453425,0.000003531562,0.00035738992],"genre_scores_gemma":[0.9603573,0.00014087757,0.039305706,0.00005870111,0.000024290686,0.000009772422,0.000008126464,0.0000016066006,0.00009361404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885404,0.0000422016,0.00066705083,0.00013267664,0.00024260911,0.00006141574],"domain_scores_gemma":[0.99853706,0.00012279503,0.00048508655,0.00012623586,0.0006911103,0.00003770362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004093803,0.000064067426,0.0002642015,0.0011078864,0.000063003434,0.00006269487,0.0003066929,0.00003168033,0.0000132075165],"category_scores_gemma":[0.00006082505,0.00005777271,0.0001210415,0.0014259343,0.00006217553,0.0002444534,0.00011350636,0.00007282579,2.51683e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000347463,0.0007995457,0.20400365,0.000039715895,0.004903426,0.0000017697815,0.00077735237,0.10344753,0.0024291174,0.6616759,0.00023013326,0.021657176],"study_design_scores_gemma":[0.0010341575,0.000048827893,0.119331606,0.00009860633,0.00085451565,0.000007991579,0.00069087953,0.8626147,0.00096065464,0.012645581,0.0015481159,0.00016438607],"about_ca_topic_score_codex":0.0000945281,"about_ca_topic_score_gemma":0.000046610097,"teacher_disagreement_score":0.93652636,"about_ca_system_score_codex":0.00002513749,"about_ca_system_score_gemma":0.000075516575,"threshold_uncertainty_score":0.23559028},"labels":[],"label_agreement":null},{"id":"W4412962796","doi":"10.1007/s10957-025-02775-5","title":"On second-order weak sharp minima of general nonconvex set-constrained optimization problems","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maxima and minima; Mathematics; Theory of computation; Order (exchange); Set (abstract data type); Mathematical optimization; Applied mathematics; Optimization problem; Mathematical analysis; Algorithm; Computer science","score_opus":0.007202094939164196,"score_gpt":0.24986896311350723,"score_spread":0.24266686817434305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412962796","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014625871,0.000114692586,0.9889732,0.0013706416,0.000089182715,0.00024724525,0.000011691945,0.000025538598,0.009021564],"genre_scores_gemma":[0.12884283,0.00041840083,0.8624441,0.0015828962,0.00015438178,0.000086936096,0.00008675342,0.00002371862,0.0063599697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849683,0.0001831617,0.0007449017,0.00023105682,0.0002234557,0.00012061814],"domain_scores_gemma":[0.99772024,0.00036585148,0.0006989079,0.0002673304,0.00086460484,0.00008303974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008007651,0.00014800097,0.00027540527,0.00048529368,0.00019031174,0.00011209875,0.00039773498,0.00009218116,0.00033889126],"category_scores_gemma":[0.00014233097,0.00013144127,0.00010378074,0.0011867947,0.0000869065,0.0004815416,0.000061128914,0.00013150783,0.0000019824004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001683109,0.00008620856,0.000015034342,0.00001546524,0.00005973178,1.3544943e-7,0.000093116745,0.572334,0.00005443598,0.42614895,0.00017314964,0.0010029641],"study_design_scores_gemma":[0.0008820159,0.00008881605,0.00006645813,0.00005223298,0.00007939228,0.000013170914,0.00009392365,0.96839744,0.0004471775,0.028331926,0.0014016988,0.00014574821],"about_ca_topic_score_codex":8.365428e-7,"about_ca_topic_score_gemma":5.8747867e-7,"teacher_disagreement_score":0.39781702,"about_ca_system_score_codex":0.0000393816,"about_ca_system_score_gemma":0.0002293907,"threshold_uncertainty_score":0.5360019},"labels":[],"label_agreement":null},{"id":"W4413189772","doi":"10.1016/j.cnsns.2025.109213","title":"Extragradient algorithms with double inertial for solving variational inequalities and applications to signal processing","year":2025,"lang":"en","type":"article","venue":"Communications in Nonlinear Science and Numerical Simulation","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China; National University's Basic Research Foundation of China; Natural Science Foundation of Chongqing; Natural Science Foundation Project of Chongqing, Chongqing Science and Technology Commission; St. Thomas University","keywords":"Inertial frame of reference; Variational inequality; Signal processing; Algorithm; Computer science; SIGNAL (programming language); Mathematics; Applied mathematics; Digital signal processing; Physics; Classical mechanics","score_opus":0.0433790946009549,"score_gpt":0.35210810903545925,"score_spread":0.30872901443450435,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413189772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009001051,0.00010767318,0.9942511,0.0040345048,0.0000125079705,0.00042294338,0.000004118988,0.000037512014,0.0002295484],"genre_scores_gemma":[0.60681856,0.000010424513,0.39262447,0.00032917716,0.000017966862,0.00015149622,0.000014481718,0.0000024593667,0.000030964835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989739,0.000029182143,0.0002683869,0.0003272842,0.00024500283,0.0001562659],"domain_scores_gemma":[0.99856174,0.00037673741,0.000076275486,0.0003492973,0.0005614235,0.000074526695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073757605,0.00008741959,0.00011807611,0.0003903865,0.00069532817,0.0003109237,0.00055939215,0.000030855776,0.0000016775581],"category_scores_gemma":[0.00009203811,0.00007739849,0.000013894704,0.0023350625,0.0001671643,0.0006796534,0.0002988623,0.00007473878,6.917937e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040117247,0.00023543542,0.0030007784,0.000026210002,0.000011775672,7.938663e-8,0.0012486594,0.39208496,0.00025692565,0.33704028,0.0000060763336,0.26604873],"study_design_scores_gemma":[0.00038342446,0.000030455238,0.004144775,0.000021503189,0.000008185142,5.442121e-7,0.00006669223,0.990374,0.00003567019,0.0019423942,0.0028933457,0.00009899375],"about_ca_topic_score_codex":0.00004446939,"about_ca_topic_score_gemma":0.000019433703,"teacher_disagreement_score":0.60591847,"about_ca_system_score_codex":0.00008110142,"about_ca_system_score_gemma":0.00028034815,"threshold_uncertainty_score":0.53479725},"labels":[],"label_agreement":null},{"id":"W4413202532","doi":"10.1007/s11081-025-10008-x","title":"Proximal methods for equilibrium problems over the set of fixed points of enriched nonexpansive mappings","year":2025,"lang":"en","type":"article","venue":"Optimization and Engineering","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Set (abstract data type); Fixed point; Mathematics; Computer science; Applied mathematics; Financial engineering; Mathematical optimization; Mathematical analysis; Economics; Finance","score_opus":0.011741232856187132,"score_gpt":0.2752185028452058,"score_spread":0.2634772699890187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413202532","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040293878,0.000067428984,0.99829715,0.0008057964,0.00007206742,0.00020599921,0.000003078775,0.00002830391,0.000117231226],"genre_scores_gemma":[0.055128507,0.000026516725,0.94454604,0.0000928122,0.000010705765,0.00003144058,0.000014218909,0.000005411853,0.0001443268],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994444,0.000025797952,0.00023661261,0.0001366312,0.00007145117,0.00008505639],"domain_scores_gemma":[0.99936897,0.0001779454,0.00009882909,0.00014162326,0.00019252038,0.00002010004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029165306,0.000074658004,0.00014522567,0.00014355325,0.000032566204,0.000033594926,0.00016626058,0.000037177033,0.0000091908605],"category_scores_gemma":[0.0001507659,0.000059535512,0.000048790596,0.0005731401,0.0000146507255,0.00017717539,0.000075099124,0.000032715663,7.468482e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002445754,0.00000919081,0.00006330323,0.000076929115,0.000045039887,1.5015496e-8,0.0004061208,0.959253,0.0034051347,0.036095537,0.00003662869,0.00060665625],"study_design_scores_gemma":[0.00027892127,0.000013973955,0.00066297996,0.000019508927,0.000020245698,3.1174642e-7,0.00001723056,0.9969956,0.0013110925,0.00026184853,0.00036111457,0.00005714439],"about_ca_topic_score_codex":0.0000047412577,"about_ca_topic_score_gemma":1.6184153e-7,"teacher_disagreement_score":0.05472557,"about_ca_system_score_codex":0.000009851171,"about_ca_system_score_gemma":0.00002909213,"threshold_uncertainty_score":0.24277878},"labels":[],"label_agreement":null},{"id":"W4413235408","doi":"10.23952/jnva.9.2025.6.03","title":"Sufficient weighted second-order cone complementarity problems","year":2025,"lang":"en","type":"article","venue":"Journal of Nonlinear and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Guangxi Province; National Natural Science Foundation of China","keywords":"Complementarity (molecular biology); Cone (formal languages); Mathematics; Order (exchange); First order; Applied mathematics; Complementarity theory; Mathematical optimization; Mathematical economics; Algorithm; Economics; Physics; Nonlinear system","score_opus":0.011277535074001688,"score_gpt":0.2616877527151657,"score_spread":0.250410217641164,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413235408","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007935007,0.00016363969,0.98409307,0.006802576,0.00013160515,0.000058042522,0.000029268802,0.000013810058,0.0007729637],"genre_scores_gemma":[0.52973366,0.00011306436,0.46574128,0.002375789,0.00017505416,0.0000037534344,0.00013266293,0.0000060392226,0.0017187424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983304,0.000109350876,0.00074681995,0.00021840473,0.00045795724,0.00013705694],"domain_scores_gemma":[0.99784213,0.00020298515,0.0004675635,0.00017321092,0.0012189046,0.00009523124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007529656,0.00012583034,0.00038813692,0.0009774299,0.00019627872,0.00019336566,0.00035190277,0.000051594565,0.00061331404],"category_scores_gemma":[0.000067282956,0.0001016858,0.00025913748,0.0030933993,0.000028502533,0.00037530548,0.0001132592,0.00015153814,0.000004218135],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000676128,0.0016878007,0.08755684,0.00006289927,0.014775539,0.000012432424,0.0009815326,0.16075128,0.00031555744,0.72856504,0.002735208,0.002488282],"study_design_scores_gemma":[0.0006729173,0.000042842825,0.062325303,0.000008947745,0.000820909,0.0000058970595,0.000028713277,0.9243837,0.000026369455,0.0038531243,0.0077197785,0.00011149685],"about_ca_topic_score_codex":0.000043845022,"about_ca_topic_score_gemma":0.0000913599,"teacher_disagreement_score":0.7636324,"about_ca_system_score_codex":0.000058678677,"about_ca_system_score_gemma":0.00024072094,"threshold_uncertainty_score":0.6715359},"labels":[],"label_agreement":null},{"id":"W4414845944","doi":"10.1080/10556788.2025.2545846","title":"Near-optimal algorithm with complexity separation for strongly convex-strongly concave composite saddle point problems","year":2025,"lang":"en","type":"article","venue":"Optimization methods & software","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Optech (Canada)","funders":"Ministry of Science and Higher Education of the Russian Federation","keywords":"Saddle point; Separation (statistics); Point (geometry); Composite number; Computational complexity theory; Separation method","score_opus":0.02667676483093195,"score_gpt":0.33738743854053665,"score_spread":0.3107106737096047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414845944","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017769598,0.00008888775,0.9961523,0.0010917725,0.00019754894,0.0009683821,0.000084846986,0.0006740179,0.00072450016],"genre_scores_gemma":[0.0004287802,0.000012119754,0.9959012,0.00045843015,0.00004326015,0.00020007168,0.000632296,0.000043120293,0.0022806672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99748003,0.00043711122,0.000576328,0.0007615262,0.0003574652,0.00038756293],"domain_scores_gemma":[0.99751085,0.00044149402,0.00040315106,0.0005696308,0.0009257347,0.00014911141],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007802424,0.00034182423,0.0004958263,0.0002719198,0.0006037888,0.0005975144,0.00056166097,0.00015104198,0.00012870696],"category_scores_gemma":[0.0001554069,0.00031925717,0.00015497433,0.0013128074,0.00016547473,0.00079937244,0.0001630377,0.00015950808,0.000006102866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032486423,0.00010953734,0.0004918662,0.0000407203,0.00016804504,6.5010295e-7,0.0002400101,0.9707047,0.00001668295,0.018789146,0.0009871909,0.008418981],"study_design_scores_gemma":[0.0015326354,0.00015139107,0.00027375369,0.000049201146,0.00011468812,0.0000046428067,0.00004946433,0.99369425,0.00024181134,0.0008624662,0.0026773724,0.00034833406],"about_ca_topic_score_codex":0.00005807124,"about_ca_topic_score_gemma":0.000013994356,"teacher_disagreement_score":0.022989556,"about_ca_system_score_codex":0.0001345199,"about_ca_system_score_gemma":0.00032010252,"threshold_uncertainty_score":0.999926},"labels":[],"label_agreement":null},{"id":"W4415428077","doi":"10.3233/faia251225","title":"Polynomial-Time Algorithms for Fair Orientations of Chores","year":2025,"lang":"","type":"book-chapter","venue":"Frontiers in artificial intelligence and applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Conjecture; Vertex (graph theory); Enhanced Data Rates for GSM Evolution; Orientation (vector space); Zero (linguistics)","score_opus":0.03437198010607099,"score_gpt":0.29366001654164003,"score_spread":0.259288036435569,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415428077","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000024379158,0.0006106075,0.9855519,0.0017079615,0.00042797104,0.0015782515,0.0004748884,0.000032729007,0.009613243],"genre_scores_gemma":[0.01047119,0.0051865494,0.90630907,0.0005165261,0.00077245274,0.0018485719,0.00087962975,0.00006967235,0.07394636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969929,0.0000358565,0.0014415587,0.00093049987,0.00029058158,0.00030859656],"domain_scores_gemma":[0.9977489,0.0003309403,0.0005830865,0.00058762706,0.0006154668,0.00013395336],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00036835647,0.00037516758,0.0006805701,0.00099492,0.0004469085,0.00018140377,0.0007619163,0.00031210555,0.00015849984],"category_scores_gemma":[0.000080053185,0.00042812768,0.00028361444,0.00084365974,0.00043160786,0.00029155932,0.00018291624,0.0002252655,0.000030426343],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024634539,0.00015939867,0.0000398288,0.000056801302,0.00013429442,2.2664689e-7,0.00031738615,0.0065406826,0.00002723069,0.6224554,0.0027518661,0.3674922],"study_design_scores_gemma":[0.00008027806,0.00008079159,0.000028454224,0.00012598313,0.00022779503,7.452951e-7,0.00033401497,0.73165476,0.001169751,0.19997591,0.06584531,0.00047621143],"about_ca_topic_score_codex":0.00006491241,"about_ca_topic_score_gemma":0.000030260464,"teacher_disagreement_score":0.72511405,"about_ca_system_score_codex":0.00009036261,"about_ca_system_score_gemma":0.00032719446,"threshold_uncertainty_score":0.9998171},"labels":[],"label_agreement":null},{"id":"W4415914301","doi":"10.28924/2291-8639-23-2025-280","title":"Solving Split Mixed Equilibrium With Multiple Output Sets and Fixed Point of Certain Multi-Valued Mappings","year":2025,"lang":"","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational inequality; Fixed point; Convergence (economics); Regular polygon; Hilbert space; Compact space; Minification; Convex optimization","score_opus":0.013589582947291163,"score_gpt":0.2745420659679443,"score_spread":0.2609524830206531,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415914301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030371197,0.00072492554,0.96274257,0.005574596,0.000119094904,0.00021092534,0.0000698452,0.00001111757,0.0001757525],"genre_scores_gemma":[0.87824315,0.0005260066,0.12014243,0.00028037984,0.00007655771,0.000016017464,0.000036014684,0.0000092506525,0.0006702134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99694836,0.00014417499,0.001444118,0.00049680093,0.00075253483,0.00021402324],"domain_scores_gemma":[0.9948175,0.0003263468,0.0016010036,0.00035615623,0.0027058232,0.00019314868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008277281,0.0002775502,0.0007357308,0.0018689252,0.00020531089,0.00044399008,0.000863277,0.000109004206,0.000054266562],"category_scores_gemma":[0.00017084346,0.00023873092,0.00042051473,0.0022862686,0.00028252133,0.0006201777,0.00036926073,0.00023598071,0.0000017262987],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079797924,0.0042440933,0.2669126,0.00041905418,0.06954335,0.000048126745,0.0066397367,0.27331018,0.006795271,0.2201337,0.00097172626,0.15018417],"study_design_scores_gemma":[0.0016950563,0.00007045679,0.08166614,0.00014458824,0.0023105803,0.000023951112,0.00052125327,0.910753,0.0005853201,0.0009677021,0.0010263671,0.00023556527],"about_ca_topic_score_codex":0.0002022144,"about_ca_topic_score_gemma":0.00009902793,"teacher_disagreement_score":0.84787196,"about_ca_system_score_codex":0.00009297579,"about_ca_system_score_gemma":0.00027068614,"threshold_uncertainty_score":0.97351646},"labels":[],"label_agreement":null},{"id":"W4416063083","doi":"10.1112/blms.70230","title":"Plank theorems and their applications: A survey","year":2025,"lang":"en","type":"article","venue":"Bulletin of the London Mathematical Society","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Plank; Regular polygon; Euclidean geometry; Euclidean space; Space (punctuation); Convex geometry","score_opus":0.008581310718105424,"score_gpt":0.22418119766480937,"score_spread":0.21559988694670396,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416063083","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036479998,0.00013539249,0.9814938,0.013654921,0.00002075913,0.000197538,0.000007693158,0.000033369273,0.0040917303],"genre_scores_gemma":[0.6102391,0.00026248384,0.36352804,0.0096516665,0.0000623441,0.0002209689,0.000017957504,0.000021947273,0.015995529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99929464,0.00010495831,0.00021580418,0.0001659945,0.00012810803,0.000090492904],"domain_scores_gemma":[0.99867773,0.0007336243,0.0000903507,0.00038102403,0.000091066024,0.000026215628],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006862521,0.00008091001,0.0001574485,0.000014449029,0.00013289471,0.00005445861,0.0005512654,0.000049612452,0.000095787786],"category_scores_gemma":[0.00014243627,0.00004610142,0.0001434009,0.0003421508,0.00010455778,0.000017088909,0.00030598018,0.00007235338,0.000017083785],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000019664194,0.00008621875,0.00039644638,0.000054127173,0.00007033992,1.1557197e-8,0.00024565795,0.000086810665,0.000035083915,0.9873752,0.010436383,0.0012117423],"study_design_scores_gemma":[0.00059734174,0.00001550405,0.008119411,0.0000899553,0.000044725075,0.0000033452243,0.0001369234,0.19058493,0.00088811613,0.7501933,0.049099647,0.0002267837],"about_ca_topic_score_codex":0.00001598107,"about_ca_topic_score_gemma":0.0000010265368,"teacher_disagreement_score":0.61796576,"about_ca_system_score_codex":0.000012197103,"about_ca_system_score_gemma":0.00002528977,"threshold_uncertainty_score":0.18799613},"labels":[],"label_agreement":null},{"id":"W4416099375","doi":"10.48550/arxiv.2503.22004","title":"On Opial's Lemma","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Lemma (botany); Monotone polygon; Convergence (economics); Hilbert space; Limit (mathematics); Weak convergence; Projection (relational algebra)","score_opus":0.039729023934394515,"score_gpt":0.2813416872812596,"score_spread":0.24161266334686507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416099375","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019171223,0.00006308841,0.9298739,0.012710212,0.0018721052,0.00020087043,0.000024052644,0.00032571805,0.035758864],"genre_scores_gemma":[0.9187124,0.0001195236,0.036373165,0.007959381,0.00039340463,0.000065974855,0.00014916585,0.00001488003,0.036212146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868494,0.00007304643,0.00025445878,0.0005705128,0.0002615679,0.00015546245],"domain_scores_gemma":[0.9986981,0.0001122422,0.00014041971,0.00082870084,0.00015666395,0.00006384256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015877548,0.00017949779,0.00022494391,0.00022553491,0.000108914326,0.00014294274,0.0010829144,0.00015692152,0.00017886593],"category_scores_gemma":[0.00010417439,0.0001689788,0.00017505045,0.00038636327,0.000015062786,0.00010517741,0.0010124057,0.00030543527,0.00040038195],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008977087,0.0002291087,0.039309986,0.00007000326,0.00029995726,0.0000134096745,0.00034477154,0.16814966,0.000013734509,0.77475166,0.012885104,0.003923609],"study_design_scores_gemma":[0.0007207027,0.00007393039,0.15589906,0.00029173229,0.00013595502,0.0000017913794,0.0000102977965,0.7584415,0.0005290211,0.04898788,0.03382141,0.0010866765],"about_ca_topic_score_codex":0.00006856106,"about_ca_topic_score_gemma":0.000009550911,"teacher_disagreement_score":0.89954114,"about_ca_system_score_codex":0.00006516548,"about_ca_system_score_gemma":0.00021257714,"threshold_uncertainty_score":0.6890756},"labels":[],"label_agreement":null},{"id":"W4416142823","doi":"10.1007/s10474-025-01562-y","title":"On multiplicities of interpoint distances","year":2025,"lang":"en","type":"article","venue":"Acta Mathematica Academiae Scientiarum Hungaricae","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Multiplicity (mathematics); Regular polygon; Set (abstract data type); Convex set; Minimum distance","score_opus":0.007456651264844217,"score_gpt":0.2618056852499535,"score_spread":0.2543490339851093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416142823","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005422778,0.00005330126,0.94523627,0.0110197,0.00033770475,0.00019276065,0.000008110267,0.00013722274,0.03759217],"genre_scores_gemma":[0.9440841,0.000017106493,0.04993457,0.0008645235,0.000012448396,0.000019484361,0.000003660715,0.0000055251066,0.0050585964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982531,0.0000702699,0.00052879815,0.00040791533,0.00050019246,0.00023973986],"domain_scores_gemma":[0.99844426,0.0005107324,0.00025473413,0.0005690012,0.00015140927,0.000069871094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000612711,0.0001556577,0.00029699891,0.00046336444,0.00018183848,0.00014091772,0.0013674429,0.00010119999,0.00010971969],"category_scores_gemma":[0.0005532218,0.00012434511,0.00015017857,0.0014752836,0.00014431641,0.00042908636,0.0003737666,0.00021542046,0.00004271103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004852534,0.00013452678,0.00006770744,0.000054321805,0.00005780167,3.0236268e-7,0.00058978266,0.00024847218,0.0010027194,0.99089867,0.0061166845,0.0008241776],"study_design_scores_gemma":[0.00049249275,0.00006118222,0.00134735,0.00031723676,0.00006866013,0.0000018935889,0.00022680215,0.6234006,0.011329836,0.3577818,0.004645942,0.00032616165],"about_ca_topic_score_codex":0.0000040843474,"about_ca_topic_score_gemma":0.0000020850084,"teacher_disagreement_score":0.93866134,"about_ca_system_score_codex":0.000048880665,"about_ca_system_score_gemma":0.000079438614,"threshold_uncertainty_score":0.50706464},"labels":[],"label_agreement":null},{"id":"W4416187189","doi":"10.28924/2291-8639-23-2025-289","title":"Strong Convergence of Cesàro Mean Sequences and Split Equilibrium Solutions via Hybrid Mappings in Hilbert Spaces","year":2025,"lang":"","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hilbert space; Convergence (economics); Intersection (aeronautics); Sequence (biology); Rate of convergence; Spectral radius; Scheme (mathematics); Projection (relational algebra)","score_opus":0.012126946663875683,"score_gpt":0.2746871475255785,"score_spread":0.2625602008617028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416187189","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030626986,0.0019915367,0.9532001,0.013231023,0.00017675577,0.00015066758,0.00006311794,0.0000065210247,0.0005533018],"genre_scores_gemma":[0.98837966,0.0020857586,0.008834033,0.00020394703,0.00009753515,0.000012666119,0.000021300888,0.0000046958235,0.00036041238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99707764,0.00012866402,0.001475151,0.00043576807,0.0006636839,0.00021907358],"domain_scores_gemma":[0.9964628,0.00027853134,0.0012798978,0.00026756315,0.001567627,0.00014358024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089194824,0.00021633938,0.00060963666,0.0021302404,0.00014768737,0.00035674922,0.0009406014,0.0000719166,0.00013276369],"category_scores_gemma":[0.0000681163,0.00020978751,0.00034186922,0.0026204817,0.00029832305,0.00080998515,0.00036939958,0.00022005838,0.0000020032542],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011872587,0.0013303052,0.15793513,0.0001384003,0.014961234,0.000022109634,0.002095658,0.15530077,0.0043683643,0.5909562,0.00038299922,0.07239007],"study_design_scores_gemma":[0.0007494408,0.00006291619,0.052738924,0.000174336,0.0017920951,0.000036565492,0.00049309066,0.9262632,0.0008829061,0.014465203,0.0020457676,0.000295533],"about_ca_topic_score_codex":0.00057141023,"about_ca_topic_score_gemma":0.00025724794,"teacher_disagreement_score":0.95775265,"about_ca_system_score_codex":0.00011335943,"about_ca_system_score_gemma":0.00031564763,"threshold_uncertainty_score":0.85548866},"labels":[],"label_agreement":null},{"id":"W4416284559","doi":"10.48550/arxiv.2507.07428","title":"Relocated Fixed-Point Iterations with Applications to Variable Stepsize Resolvent Splitting","year":2025,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Resolvent; Convergence (economics); Monotone polygon; Extension (predicate logic); Constant (computer programming); Operator (biology); Iterative method","score_opus":0.026601801472507326,"score_gpt":0.2718916639777435,"score_spread":0.24528986250523618,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416284559","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009870814,0.000050592338,0.98291546,0.008225921,0.00018050535,0.0007815213,0.00004814413,0.00032812843,0.0064826338],"genre_scores_gemma":[0.13094035,0.0000352735,0.8482703,0.004101259,0.00024453903,0.0014834165,0.0004943478,0.000029801773,0.014400729],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976807,0.00010857989,0.00057968474,0.0009867717,0.0003524423,0.00029177422],"domain_scores_gemma":[0.9972064,0.00018144948,0.0002782566,0.0014353847,0.00072542543,0.000173082],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004042806,0.00029116028,0.0003426754,0.00037061996,0.0004082312,0.00038609133,0.0011346628,0.00016580634,0.00009901723],"category_scores_gemma":[0.00011859941,0.00027123519,0.000111723646,0.0018382265,0.000023126178,0.00024041756,0.001202399,0.0003987763,0.00016387722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016499605,0.00033235463,0.020474954,0.00013953676,0.00041427134,0.000004387865,0.0009864041,0.7163335,0.00014287981,0.25671434,0.0033309145,0.0011099317],"study_design_scores_gemma":[0.000913458,0.00011823925,0.030773327,0.0008034709,0.00041728644,0.000008233883,0.00013023902,0.8865229,0.00070399663,0.007580758,0.0704649,0.0015631987],"about_ca_topic_score_codex":0.00017520179,"about_ca_topic_score_gemma":0.00004223346,"teacher_disagreement_score":0.2491336,"about_ca_system_score_codex":0.00017963047,"about_ca_system_score_gemma":0.00058158406,"threshold_uncertainty_score":0.999974},"labels":[],"label_agreement":null},{"id":"W4416510237","doi":"10.1016/j.orl.2025.107388","title":"A Frank-Wolfe algorithm for strongly monotone variational inequalities","year":2025,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"European Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Variational inequality; Monotone polygon; Monotonic function; Inequality; Approximation algorithm","score_opus":0.046896952140906896,"score_gpt":0.36397876815767194,"score_spread":0.31708181601676505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416510237","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004175992,0.000029630455,0.94676375,0.05152204,0.00013310017,0.00037959666,0.000050696843,0.000056937526,0.00064663275],"genre_scores_gemma":[0.053541973,0.000025627529,0.9336235,0.0042110216,0.00020729435,0.0008579753,0.0002771752,0.00001131034,0.00724411],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998224,0.00029411868,0.00028618495,0.00035610312,0.00053735333,0.00030220218],"domain_scores_gemma":[0.99824893,0.0004973168,0.000018062645,0.00035849007,0.0008107533,0.00006647025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012983364,0.000097007556,0.00012832605,0.0006293343,0.0008160909,0.00069937523,0.00058966817,0.000039224433,0.000109004424],"category_scores_gemma":[0.00033771698,0.00009411182,0.000079664125,0.0012969755,0.00006379908,0.0006753185,0.00015266026,0.00016340087,0.00003989886],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034701213,0.00008377408,0.000041500738,0.000007251695,0.000095627955,9.003359e-7,0.0003476222,0.20860454,0.0006923514,0.76902497,0.014966322,0.0061316527],"study_design_scores_gemma":[0.0003860244,0.000020286114,0.00043473026,0.000007658379,0.000006062136,4.493053e-7,0.000060333394,0.9885922,0.00018409145,0.0011524298,0.009062103,0.00009361728],"about_ca_topic_score_codex":0.00026367305,"about_ca_topic_score_gemma":0.000053164218,"teacher_disagreement_score":0.7799877,"about_ca_system_score_codex":0.00012872794,"about_ca_system_score_gemma":0.00036936352,"threshold_uncertainty_score":0.67440915},"labels":[],"label_agreement":null},{"id":"W4416785448","doi":"10.28924/2291-8639-23-2025-322","title":"A Modified Inertial Subgradient Extragradient Method for Solving Pseudomonotone Equilibrium Problem","year":2025,"lang":"","type":"article","venue":"International Journal of Analysis and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subgradient method; Inertial frame of reference; Convergence (economics); Hilbert space; Fixed point; Weak convergence","score_opus":0.012614179370875452,"score_gpt":0.31754787675896107,"score_spread":0.3049336973880856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416785448","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011300575,0.0009942951,0.98354477,0.012793841,0.00034848863,0.00047669612,0.00007540283,0.000016705462,0.0006197752],"genre_scores_gemma":[0.7061628,0.0006850768,0.29050195,0.00067270733,0.00054091786,0.00015736245,0.00006337931,0.000013091166,0.001202734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964217,0.00012208417,0.001825411,0.00060531776,0.00072640483,0.0002991056],"domain_scores_gemma":[0.9941107,0.00050972856,0.0014774321,0.00037996675,0.0032936381,0.0002285124],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014582151,0.00030154863,0.0007516351,0.002372508,0.0002862661,0.0008315708,0.0013604873,0.00013332332,0.00005331659],"category_scores_gemma":[0.00011516255,0.00027815648,0.0010894511,0.0028525672,0.00009198163,0.0005801557,0.0003038404,0.00023927806,0.000002037959],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002698856,0.0010587602,0.0008240287,0.000049705908,0.016797513,0.000004656901,0.0007800608,0.32623824,0.0023999447,0.53508085,0.0006216919,0.11587464],"study_design_scores_gemma":[0.001374821,0.00010252635,0.0012746571,0.000060775394,0.0040509966,0.000017919798,0.000071068884,0.9680112,0.0007490583,0.014578155,0.009452248,0.00025659762],"about_ca_topic_score_codex":0.0001154664,"about_ca_topic_score_gemma":0.000049803875,"teacher_disagreement_score":0.7050327,"about_ca_system_score_codex":0.00020979512,"about_ca_system_score_gemma":0.00039212606,"threshold_uncertainty_score":0.99996704},"labels":[],"label_agreement":null},{"id":"W4417072362","doi":"10.1016/j.cnsns.2025.109549","title":"Viscosity-type algorithms with acceleration techniques for variational inequalities and demicontractive mappings with applications in cybersecurity investments and classification problems","year":2025,"lang":"en","type":"article","venue":"Communications in Nonlinear Science and Numerical Simulation","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"Center of Excellence in Theoretical and Computational Science, King Mongkut's University of Technology Thonburi; King Mongkut's University of Technology North Bangkok; King Mongkut's University of Technology Thonburi","keywords":"Inertial frame of reference; Convergence (economics); Variational inequality; Lipschitz continuity; Acceleration; Extrapolation; Hilbert space; Operator (biology); Inverse problem","score_opus":0.04463713228434112,"score_gpt":0.34106836069495633,"score_spread":0.2964312284106152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417072362","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012000237,0.00010290629,0.98442054,0.0024200124,0.000007876753,0.0008152041,0.0000058251176,0.00003968882,0.00018770224],"genre_scores_gemma":[0.6799609,0.00010315245,0.31948397,0.00020266273,0.0000053944323,0.00018113028,0.000048924572,0.00000282071,0.000011013352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989394,0.000083844214,0.00027962786,0.00036451235,0.00020437206,0.00012826808],"domain_scores_gemma":[0.9984617,0.00047153054,0.0001416395,0.0003344807,0.0005432974,0.000047315953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076530845,0.00010593807,0.0001433951,0.0004212916,0.00042235202,0.00023427325,0.00032431397,0.000055044675,4.850712e-7],"category_scores_gemma":[0.00018208075,0.00008954257,0.000007751749,0.0019772763,0.0002916581,0.0012111745,0.00016075192,0.00012111322,1.6441734e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007393316,0.0006136893,0.11559224,0.00006370277,0.000037357553,1.3518387e-7,0.0034806,0.025310967,0.0007094452,0.80401355,0.000004022538,0.050100364],"study_design_scores_gemma":[0.00033489362,0.00004697787,0.09847557,0.000034673816,0.000010059182,6.2495246e-7,0.00013889118,0.89431095,0.00004272033,0.0059461836,0.00055936724,0.00009908005],"about_ca_topic_score_codex":0.00009936365,"about_ca_topic_score_gemma":0.00007763883,"teacher_disagreement_score":0.869,"about_ca_system_score_codex":0.000118012824,"about_ca_system_score_gemma":0.00021567711,"threshold_uncertainty_score":0.365144},"labels":[],"label_agreement":null},{"id":"W4417420616","doi":"10.2478/auom-2025-0013","title":"Weak convergence theorems for inertial Krasnoselskii-Mann iterations in the class of enriched nonexpansive operators in Hilbert spaces","year":2025,"lang":"en","type":"article","venue":"Analele Universităţii \"Ovidius\" Constanţa. Seria Matematică","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Convergence (economics); Hilbert space; Fixed point; Weak convergence; Rate of convergence; Inertial frame of reference","score_opus":0.0075893781053157595,"score_gpt":0.23889174852895226,"score_spread":0.2313023704236365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417420616","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18913858,0.00024619314,0.7757,0.017169153,0.00050163793,0.0021026395,0.00008544973,0.000101828984,0.014954546],"genre_scores_gemma":[0.988788,0.00007271597,0.009360777,0.00079955894,0.000014227274,0.000032001542,0.000045952853,0.0000071552677,0.0008795879],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802727,0.00034945997,0.0006474974,0.0004052379,0.0002938857,0.00027662836],"domain_scores_gemma":[0.9979055,0.0008181701,0.00028114198,0.0005039804,0.00043821888,0.000052992527],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006489507,0.00022179454,0.00044949242,0.0006942427,0.00020030138,0.00018940076,0.001001899,0.00010559844,0.00009925106],"category_scores_gemma":[0.00023712005,0.0001845615,0.00013881036,0.0023822698,0.00012482499,0.0009085424,0.00015353663,0.00012956704,0.000010307548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044407603,0.00017572488,0.0034481247,0.00012757933,0.00012136777,0.000008849374,0.0043145632,0.017354652,0.0014524126,0.97157955,0.001317095,0.000055684395],"study_design_scores_gemma":[0.0036933173,0.00016667641,0.005451346,0.00035854953,0.0002457248,0.000008416101,0.022339555,0.9438859,0.002521165,0.016550474,0.004042517,0.0007363448],"about_ca_topic_score_codex":0.0002646815,"about_ca_topic_score_gemma":0.0010299489,"teacher_disagreement_score":0.9550291,"about_ca_system_score_codex":0.00012327249,"about_ca_system_score_gemma":0.00038494676,"threshold_uncertainty_score":0.75262},"labels":[],"label_agreement":null},{"id":"W62443529","doi":"10.1007/978-1-4419-0158-3_29","title":"Generating Eigenvalue Bounds Using Optimization","year":2009,"lang":"en","type":"book-chapter","venue":"Springer optimization and its applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Eigenvalues and eigenvectors; Parametric statistics; Mathematics; Applied mathematics; Sensitivity (control systems); Matrix (chemical analysis); Shadow price; Mathematical optimization; Pure mathematics; Physics; Statistics; Engineering","score_opus":0.02370612038389466,"score_gpt":0.2485887075939056,"score_spread":0.22488258721001095,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W62443529","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[8.0632776e-7,0.0009306533,0.94107217,0.00064623466,0.000087040484,0.0006219029,0.000021423244,0.00028491087,0.056334864],"genre_scores_gemma":[0.00029598328,0.0020288762,0.9029121,0.0010522081,0.00038449507,0.00007332818,0.00040156124,0.000081155056,0.09277029],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976226,0.00003324292,0.0007112184,0.0009072273,0.00045096097,0.0002747582],"domain_scores_gemma":[0.9978837,0.000053066673,0.00058409775,0.0006355117,0.0006316808,0.00021199424],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022951668,0.00045037264,0.00040143842,0.0005137548,0.0007605468,0.0006163979,0.00052627106,0.00035992375,0.0005659155],"category_scores_gemma":[0.000027568132,0.00050025596,0.00014775117,0.0003771174,0.000043117743,0.0006844025,0.00020815816,0.00025689715,0.000041187577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.146183e-7,0.000019266714,6.743462e-7,0.000011044516,0.00004251651,4.5779672e-7,0.000034196764,0.7005847,0.00001530783,0.29452416,0.000041355415,0.0047254926],"study_design_scores_gemma":[0.00019753414,0.00002130024,0.0000017377403,0.000036335106,0.00011627902,0.000011018287,0.0000029102566,0.9756774,0.000020638474,0.0015688962,0.021830905,0.00051504554],"about_ca_topic_score_codex":0.000004574112,"about_ca_topic_score_gemma":0.00000216841,"teacher_disagreement_score":0.29295525,"about_ca_system_score_codex":0.00014924843,"about_ca_system_score_gemma":0.00020623955,"threshold_uncertainty_score":0.9997449},"labels":[],"label_agreement":null},{"id":"W6925376621","doi":"10.17863/cam.74088","title":"Measurement of single top-quark production in association with a W boson in the single-lepton channel at s = 8 TeV with the ATLAS detector","year":2020,"lang":"en","type":"article","venue":"Apollo (University of Cambridge)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"H2020 Marie Skłodowska-Curie Actions; Institut National de Physique Nucléaire et de Physique des Particules; European Regional Development Fund; Max-Planck-Gesellschaft; Centre National de la Recherche Scientifique; British Columbia Knowledge Development Fund; Fundação para a Ciência e a Tecnologia; Agencia Nacional de Promoción Científica y Tecnológica; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung; Science and Technology Facilities Council; Bundesministerium für Bildung und Forschung; Ministry of Education, Culture, Sports, Science and Technology; Natural Sciences and Engineering Research Council of Canada; European Social Fund; Royal Society; Centre National pour la Recherche Scientifique et Technique; Japan Society for the Promotion of Science; National Research Center \"Kurchatov Institute\"; Israel Science Foundation; Türkiye Atom Enerjisi Kurumu; Joint Institute for Nuclear Research; Ministerstwo Edukacji i Nauki; Conselho Nacional de Desenvolvimento Científico e Tecnológico; Bundesministerium für Wissenschaft, Forschung und Wirtschaft; Generalitat de Catalunya; Generalitat Valenciana; Austrian Science Fund; U.S. Department of Energy; National Natural Science Foundation of China; Alexander von Humboldt-Stiftung; Institut de Valorisation des Données; Leverhulme Trust; European Commission; Fundação de Amparo à Pesquisa do Estado de São Paulo; Javna Agencija za Raziskovalno Dejavnost RS; Deutsche Forschungsgemeinschaft; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Agence Nationale de la Recherche; National Science Foundation; TRIUMF; Compute Canada; Agencia Nacional de Investigación y Desarrollo; Services Fédéraux des Affaires Scientifiques, Techniques et Culturelles; Department of Science and Technology, Ministry of Science and Technology, India; Canarie; Centres de Recerca de Catalunya; CERN; Danmarks Grundforskningsfond; Ministerio de Ciencia e Innovación; General Secretariat for Research and Technology","keywords":"Large Hadron Collider; Luminosity; Atlas (anatomy); Top quark; Detector; ATLAS experiment; Lepton; Invariant mass","score_opus":0.01845350207527442,"score_gpt":0.17205608994676816,"score_spread":0.15360258787149375,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6925376621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9026173,0.000027157625,0.06367264,0.032931104,0.000027974012,0.00025471827,0.0000024925448,0.000018517174,0.00044810353],"genre_scores_gemma":[0.9986968,0.0000043226873,0.0010739592,0.000093047114,0.00001679724,6.2664043e-7,0.0000025358638,0.0000028582283,0.00010902768],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99886876,0.00013873234,0.00009999354,0.00020153447,0.0005829649,0.00010799921],"domain_scores_gemma":[0.9993194,0.00003944265,0.00024296319,0.00016668839,0.00020704558,0.00002446273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041016203,0.000074037314,0.00013657584,0.00009198903,0.00009529486,0.000019170819,0.00032037767,0.000031799413,0.0000037914147],"category_scores_gemma":[0.00004951,0.00005247567,0.000041257026,0.0011038654,0.000032264954,0.00026727712,0.000054893186,0.00007292453,0.0000024081858],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027014248,0.003468121,0.37642103,0.00040192527,0.001165307,0.000061011702,0.14930707,0.2725651,0.16187662,0.009892193,0.011393221,0.010746995],"study_design_scores_gemma":[0.0070190155,0.0031955247,0.5121276,0.0003812149,0.00044588285,0.000016448861,0.01862338,0.3201125,0.13313526,0.000054004606,0.0038567893,0.0010323778],"about_ca_topic_score_codex":0.00042709042,"about_ca_topic_score_gemma":0.0010664117,"teacher_disagreement_score":0.13570657,"about_ca_system_score_codex":0.0002487693,"about_ca_system_score_gemma":0.00005665338,"threshold_uncertainty_score":0.21398957},"labels":[],"label_agreement":null},{"id":"W6958294134","doi":"10.6084/m9.figshare.12521861.v1","title":"Espn@ UFC Fight Night live stream Online Free Reddit","year":2020,"lang":"en","type":"dataset","venue":"Figshare","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Countdown; Time line; Event (particle physics); Work (physics); Midnight","score_opus":0.030569171030068377,"score_gpt":0.2520321029272575,"score_spread":0.2214629318971891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6958294134","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[7.4191773e-9,0.00011683188,0.00019173774,0.0018459782,0.0001371019,0.00014310774,0.99723214,0.00014305711,0.00019002096],"genre_scores_gemma":[3.6099962e-7,0.000029601435,0.0041826908,0.0028859265,0.00064543163,0.000056177203,0.9910746,0.000014149083,0.0011110284],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99801576,0.00007673778,0.00036644435,0.0007123052,0.00058701204,0.00024170961],"domain_scores_gemma":[0.9976808,0.00018243225,0.00034681513,0.0012661996,0.0003081254,0.0002156497],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000027441132,0.000327299,0.00037131633,0.00018944636,0.00013547827,0.00035237975,0.002930324,0.0002833609,0.3679371],"category_scores_gemma":[0.0013523361,0.000300085,0.00022434357,0.00080887537,0.000004257224,0.00032291774,0.0012423784,0.0004113344,0.023039255],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000016302477,0.00007616167,1.5542201e-7,0.00009021822,0.00007952013,0.000049994524,0.000020953526,0.00033585352,6.6050916e-8,0.000028251052,0.99911994,0.00019728355],"study_design_scores_gemma":[0.00016810949,0.000038299288,0.000028798833,0.00034726714,0.000031061874,0.0000036421966,0.000002537503,0.022414893,0.0000030822323,0.00007264211,0.97654754,0.00034214745],"about_ca_topic_score_codex":0.000030752275,"about_ca_topic_score_gemma":0.00016410966,"teacher_disagreement_score":0.3448978,"about_ca_system_score_codex":0.000062296436,"about_ca_system_score_gemma":0.00026761292,"threshold_uncertainty_score":0.9999451},"labels":[],"label_agreement":null},{"id":"W6966710554","doi":"10.48550/arxiv.2502.09074","title":"Bilevel gradient methods and the Morse parametric qualification condition","year":2025,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Discovery Air (Canada)","funders":"","keywords":"Bilevel optimization; Piecewise; Morse code; Parametric statistics; Sequence (biology); Differentiable function; Class (philosophy); Regular polygon","score_opus":0.09370189232750736,"score_gpt":0.2613209673149412,"score_spread":0.16761907498743384,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6966710554","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026468874,0.00006737002,0.9945368,0.0009813552,0.0002415178,0.00023932502,0.000018129265,0.0000839102,0.0011846748],"genre_scores_gemma":[0.9446367,0.00041637622,0.051853925,0.00030827383,0.000023348504,0.0000040000464,0.00005610111,0.0000037445316,0.0026975276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983175,0.00065167586,0.00020124712,0.0006318054,0.00007769676,0.00012010124],"domain_scores_gemma":[0.9981667,0.0005855105,0.00027625193,0.0006805065,0.00022721953,0.00006385169],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087632175,0.00015649092,0.00023353615,0.00049426296,0.00021158485,0.00015036405,0.000742106,0.0001306096,0.000020685471],"category_scores_gemma":[0.00018597634,0.00013125494,0.00014735245,0.0015637074,0.00011535836,0.00019128104,0.000682605,0.00022690522,0.000011601324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008647326,0.00002660313,0.00019774133,0.000014301368,0.00007703389,0.0000014633263,0.00012205876,0.24264205,8.395457e-7,0.7559148,0.000084672276,0.0009097604],"study_design_scores_gemma":[0.00039547632,0.0000049527725,0.0018214132,0.000012181108,0.00012123858,6.1023496e-7,0.000032177366,0.816865,0.000015108024,0.18035379,0.0002546609,0.00012335111],"about_ca_topic_score_codex":0.00017602775,"about_ca_topic_score_gemma":0.000008461303,"teacher_disagreement_score":0.9426829,"about_ca_system_score_codex":0.000094790856,"about_ca_system_score_gemma":0.00011259892,"threshold_uncertainty_score":0.53524214},"labels":[],"label_agreement":null},{"id":"W6995631258","doi":"","title":"Parametrically prox-regular functions","year":2013,"lang":"en","type":"other","venue":"cIRcle (University of British Columbia)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convexity; Generalization; Representation (politics); Monotonic function; Stability (learning theory); Convex function; Complex-valued function; Extension (predicate logic)","score_opus":0.0061046701610472575,"score_gpt":0.15781623820805296,"score_spread":0.1517115680470057,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6995631258","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026660366,0.0002556549,0.771085,0.0003614762,0.00026146058,0.00034476956,0.00013596273,0.00039191096,0.22689714],"genre_scores_gemma":[0.0065885778,0.00014824471,0.03864363,0.00007704353,0.000051199306,0.0000011334257,0.00006809929,0.000050505765,0.9543716],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.998907,0.000051252824,0.00010688458,0.00044497693,0.000331567,0.00015828546],"domain_scores_gemma":[0.99897987,0.00002654937,0.00022984613,0.00045384592,0.00019501866,0.000114873714],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00007452387,0.00005136878,0.00027451123,0.00021226659,0.00012361511,0.00022521288,0.0007557883,0.00019561802,0.00266575],"category_scores_gemma":[0.00002475392,0.00018346819,0.00017085596,0.0010208258,0.0000905207,0.0002463886,0.00020648209,0.00010762402,0.00045219212],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[3.2160352e-7,0.00012612042,0.00041245276,0.00003149931,0.00015589043,0.000018936595,0.000017384302,0.00007250645,0.0000011699634,0.0001449227,0.7839602,0.21505858],"study_design_scores_gemma":[0.0011463993,0.00010228464,0.53713906,0.0002596022,0.00022536698,0.000036390327,0.00013960939,0.05683778,4.47781e-8,0.00077265565,0.40249804,0.0008428045],"about_ca_topic_score_codex":0.07801882,"about_ca_topic_score_gemma":0.04821584,"teacher_disagreement_score":0.73244137,"about_ca_system_score_codex":0.000042579428,"about_ca_system_score_gemma":0.00010232372,"threshold_uncertainty_score":0.99824595},"labels":[],"label_agreement":null},{"id":"W7021178481","doi":"","title":"\\n Danse macabre — Canada [Québec] 2009, 8 minutes 30 secondes","year":2010,"lang":"ru","type":"article","venue":"Érudit (Université de Montréal)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Macabre; Key (lock); Precarity","score_opus":0.003399348113688201,"score_gpt":0.14376893520266676,"score_spread":0.14036958708897856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7021178481","genre_codex":"commentary","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21037568,0.03465794,0.06520368,0.6501321,0.00455385,0.0009402447,0.0011852483,0.0005824452,0.03236881],"genre_scores_gemma":[0.46846256,0.0015521129,0.017072069,0.0049330457,0.00053046976,0.0000073340957,0.00013649523,0.00006302564,0.5072429],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9980008,0.0000856313,0.0002708669,0.0006036599,0.00052332773,0.0005156972],"domain_scores_gemma":[0.9981118,0.00017775416,0.00026394005,0.00068354397,0.00030763616,0.00045533577],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00018230213,0.00031475374,0.00032616727,0.00020081723,0.0009239472,0.00011470837,0.0010476807,0.00019416813,0.004385935],"category_scores_gemma":[0.00006298765,0.00035490826,0.00018051939,0.00075039826,0.00007572376,0.00043671182,0.00044638893,0.00039403338,0.0002695755],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041174786,0.00016147253,0.004610594,0.00004040863,0.00049848336,0.0015590368,0.0010090278,0.008283853,0.0010000302,0.04807376,0.9145045,0.020217622],"study_design_scores_gemma":[0.0005950768,0.00003066565,0.0043513277,0.000012736181,0.00015104009,0.0001399647,0.00021561938,0.19614178,0.0001919952,0.00023349111,0.79749995,0.000436378],"about_ca_topic_score_codex":0.9492613,"about_ca_topic_score_gemma":0.9988783,"teacher_disagreement_score":0.64519906,"about_ca_system_score_codex":0.0034157352,"about_ca_system_score_gemma":0.0015134152,"threshold_uncertainty_score":0.99989027},"labels":[],"label_agreement":null},{"id":"W7024255604","doi":"","title":"The Russian embargo influence on the competitiveness of the Lithuanian dairy industry.","year":2016,"lang":"en","type":"dissertation","venue":"KTUePubl (Repository of Kaunas University of Technology)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Lithuanian; European union; Globalization; Dairy industry; Politics; Eu countries; Competition (biology)","score_opus":0.0036133563088301722,"score_gpt":0.18118426861366552,"score_spread":0.17757091230483535,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024255604","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8997835,0.00031842728,0.0029295841,0.040696513,0.0013467255,0.0008611899,0.00007092272,0.00022634312,0.053766828],"genre_scores_gemma":[0.99011153,0.000053829135,0.00057653425,0.000038541893,0.000015533617,0.0000013822429,0.0000058054798,0.000008268542,0.009188585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9985457,0.00014731081,0.00033579397,0.00032401195,0.0004781995,0.00016894982],"domain_scores_gemma":[0.9970616,0.000221661,0.001103412,0.0011281094,0.0004498051,0.000035428006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002520605,0.00018991446,0.00030878597,0.0003057927,0.00078055594,0.000027816624,0.003510745,0.0005577319,0.00002327209],"category_scores_gemma":[0.000108817745,0.00010994968,0.00023417818,0.0010170839,0.0006949035,0.00017827353,0.00032204413,0.0005289378,0.0000039302467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062614075,0.00015071676,0.013256826,0.00006132209,0.00038558384,0.000005193121,0.0008698956,0.00043361407,0.002057274,0.98065495,0.00017092659,0.0018910711],"study_design_scores_gemma":[0.0013384662,0.0003871529,0.84429675,0.0022205848,0.0004815212,0.000015578511,0.006721103,0.0025161952,0.10219945,0.013507752,0.025427878,0.00088758435],"about_ca_topic_score_codex":0.00012409194,"about_ca_topic_score_gemma":0.00008023526,"teacher_disagreement_score":0.96714723,"about_ca_system_score_codex":0.00007233792,"about_ca_system_score_gemma":0.0003713715,"threshold_uncertainty_score":0.6523896},"labels":[],"label_agreement":null},{"id":"W7024836033","doi":"","title":"Synthetic archaeosome adjuvants","year":2009,"lang":"en","type":"article","venue":"NPARC","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"","score_opus":0.010040243005421742,"score_gpt":0.22945913959315417,"score_spread":0.21941889658773242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7024836033","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011004183,0.000016777722,0.9342423,0.015704025,0.000086167,0.00003580774,8.812374e-7,0.00011958549,0.04869402],"genre_scores_gemma":[0.8830748,0.0000117154,0.11464381,0.0013887457,0.000032861113,0.000001277439,0.0000015165177,0.0000014843994,0.0008437811],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945134,0.00002190708,0.00009128396,0.00015882081,0.00017012707,0.00010651291],"domain_scores_gemma":[0.9996211,0.000022317712,0.000027904121,0.00023013605,0.00004392671,0.000054596327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000080528705,0.00004780243,0.00006687807,0.00007491959,0.000054588312,0.000044426677,0.0003204228,0.000017531027,0.00026551768],"category_scores_gemma":[0.000027373038,0.000041724365,0.000039247032,0.0002858707,0.0000093085,0.00017263339,0.000034374712,0.00003522916,0.00019037313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000013301913,0.000056607256,0.0000716943,8.837288e-7,0.000007986892,0.000004310101,0.00020559647,0.0010564073,0.0012707362,0.91529846,0.0008849296,0.08114106],"study_design_scores_gemma":[0.00020120612,0.000051381874,0.009040543,0.0000075976122,0.0000074963527,0.000008608805,0.0000046673845,0.7078854,0.00070067565,0.27745214,0.0044831433,0.00015716438],"about_ca_topic_score_codex":8.88952e-7,"about_ca_topic_score_gemma":4.316188e-7,"teacher_disagreement_score":0.8819744,"about_ca_system_score_codex":0.0000106983725,"about_ca_system_score_gemma":0.000019375046,"threshold_uncertainty_score":0.29072323},"labels":[],"label_agreement":null},{"id":"W7027119837","doi":"","title":"Canadian traveler problem with neutralizations","year":2020,"lang":"en","type":"article","venue":"Dspace Repository (Marmara Üniversitesi)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Government (linguistics); Work (physics); Agency (philosophy); Focus (optics)","score_opus":0.006419780952613018,"score_gpt":0.16339723661269354,"score_spread":0.1569774556600805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7027119837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026664133,0.00005911691,0.88282907,0.044297308,0.00011724969,0.00032429126,0.000012045952,0.00036323356,0.0693313],"genre_scores_gemma":[0.8992736,0.000016357772,0.08765946,0.0039667035,0.00012656733,0.000008028986,0.000038652222,0.000022378003,0.008888292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894035,0.00006267952,0.00013008475,0.00037052773,0.00025293735,0.00024340744],"domain_scores_gemma":[0.9989658,0.000020411224,0.00008617089,0.00022556195,0.00020447021,0.0004975715],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000042906424,0.0001394996,0.00013516772,0.00016596608,0.00039145641,0.00020852391,0.00046260122,0.000055084925,0.00008644648],"category_scores_gemma":[0.000006137635,0.00013306827,0.00006611893,0.0010856817,0.000024378158,0.0006518956,0.000055139073,0.00010120812,0.00006695547],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000108438886,0.00030432898,0.16508505,0.0001382624,0.0008970185,0.0012789302,0.021251384,0.42422846,0.0035368376,0.26811284,0.112955675,0.0021027853],"study_design_scores_gemma":[0.0012423265,0.00023811508,0.020671444,0.000029717008,0.00019424994,0.00008767506,0.0005293887,0.8868641,0.0010448605,0.00010262811,0.088065244,0.00093020586],"about_ca_topic_score_codex":0.0056728674,"about_ca_topic_score_gemma":0.0025322621,"teacher_disagreement_score":0.89660716,"about_ca_system_score_codex":0.0001572689,"about_ca_system_score_gemma":0.00046252707,"threshold_uncertainty_score":0.8575716},"labels":[],"label_agreement":null},{"id":"W7037666510","doi":"","title":"Étude des apports, des obstacles et des défis d’une communauté de pratique intentionnellement créée visant le développement professionnel des enseignants en formation générale des adultes","year":2025,"lang":"fr","type":"other","venue":"Constellation (Université du Québec à Chicoutimi)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Decantation; Demotion","score_opus":0.03666775969595149,"score_gpt":0.227791481636174,"score_spread":0.1911237219402225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7037666510","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053131208,0.0016130982,0.8941922,0.004491767,0.00016941463,0.00094088365,0.00006466759,0.00026836744,0.045128357],"genre_scores_gemma":[0.8387588,0.005879195,0.12862271,0.0005760556,0.000071098235,0.000030006291,0.00039693498,0.000088604495,0.025576545],"study_design_codex":"qualitative","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99566364,0.0012885433,0.0009921893,0.0007902361,0.0005609411,0.0007044587],"domain_scores_gemma":[0.9957662,0.00078631146,0.0009781602,0.0005560656,0.0015913551,0.00032189488],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011062723,0.0007050954,0.00068556564,0.0008725965,0.0031087152,0.00051108043,0.00088114804,0.00042375145,0.014288275],"category_scores_gemma":[0.00040639157,0.00076495827,0.00038738875,0.0014413013,0.001490397,0.0018919689,0.0007593385,0.00041656423,0.000069735965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021721385,0.0022390694,0.1365018,0.0022075656,0.002011521,0.000064061875,0.46418655,0.086510904,0.00064235757,0.07337844,0.010592288,0.22144821],"study_design_scores_gemma":[0.00302766,0.00025702373,0.39360818,0.006483318,0.00079757127,0.00008361732,0.057994045,0.51467395,0.00091546436,0.018110316,0.0024380707,0.0016107633],"about_ca_topic_score_codex":0.017385675,"about_ca_topic_score_gemma":0.09179286,"teacher_disagreement_score":0.78562766,"about_ca_system_score_codex":0.0022477673,"about_ca_system_score_gemma":0.0027229066,"threshold_uncertainty_score":0.9994801},"labels":[],"label_agreement":null},{"id":"W7039010965","doi":"","title":"Jeux de mots, jeux de sons, jeux de scène dans les comédies de Plaute.","year":2023,"lang":"fr","type":"book-chapter","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Heritage","funders":"","keywords":"Context (archaeology); Subject (documents); Football; Narrative; Perspective (graphical)","score_opus":0.034844124629762954,"score_gpt":0.2404253148116476,"score_spread":0.20558119018188464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7039010965","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00138119,0.00094242254,0.8397729,0.044947907,0.00023875681,0.00031589382,0.00021413078,0.0005276879,0.111659154],"genre_scores_gemma":[0.071792364,0.0076247323,0.40403,0.0012354819,0.00015788594,0.000094744624,0.000949714,0.00019486701,0.51392025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99159074,0.0042193183,0.0010168016,0.001190172,0.000867142,0.0011158566],"domain_scores_gemma":[0.9905646,0.0028846774,0.0008682231,0.0022843673,0.002726458,0.00067169813],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00791474,0.0007033952,0.000716218,0.00056536595,0.0015827665,0.0011584535,0.0030127284,0.00066585577,0.0005844747],"category_scores_gemma":[0.0024170438,0.00082263845,0.00058349414,0.0008361224,0.0005943437,0.00048973085,0.0013835208,0.00094018754,0.00035169325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013673554,0.00032518266,0.00670954,0.00012968914,0.00032411533,0.000038275757,0.011486199,0.006507997,0.00073408,0.9558,0.0033852411,0.014546017],"study_design_scores_gemma":[0.00078069477,0.0000030503513,0.013006167,0.0020069059,0.0003656676,0.00011851763,0.0004323696,0.8528606,0.0036712745,0.03607317,0.089518666,0.001162869],"about_ca_topic_score_codex":0.0039292267,"about_ca_topic_score_gemma":0.010491462,"teacher_disagreement_score":0.91972685,"about_ca_system_score_codex":0.0008325664,"about_ca_system_score_gemma":0.0012909606,"threshold_uncertainty_score":0.99987847},"labels":[],"label_agreement":null},{"id":"W7084049987","doi":"10.64628/aap.vu3wsy64a","title":"Women in senior management: The more the better","year":2025,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"","score_opus":0.005616348316779838,"score_gpt":0.22588779894255775,"score_spread":0.2202714506257779,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084049987","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025114482,0.000011103821,0.69902104,0.20730856,0.00007710938,0.00010635075,2.3778837e-7,0.000037738882,0.0909264],"genre_scores_gemma":[0.8108378,0.000020085681,0.020933941,0.066772036,0.00002877942,0.000089622336,0.0000016898947,0.0000026940552,0.10131334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996021,0.000032765918,0.000078078374,0.00009785812,0.00009386105,0.000095382224],"domain_scores_gemma":[0.99966776,0.00004737782,0.000012986398,0.0002468661,0.000015922124,0.000009070025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023511657,0.000032994256,0.000035228844,0.000062964726,0.000079010824,0.00010389262,0.0004900128,0.000008651283,0.00011221933],"category_scores_gemma":[0.0000050766425,0.000015117381,0.00002059832,0.0007453666,0.000012097609,0.00008450619,0.00016366415,0.00003509584,0.000030252471],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.8493243e-7,0.000021174676,0.002656006,0.0000026084297,0.000048302474,0.0000012723658,0.001160532,0.0055288062,0.0000010172789,0.9681741,0.007263695,0.015141621],"study_design_scores_gemma":[0.0002087326,0.0000023703537,0.11056497,0.0000036895335,0.000007353918,2.8593445e-7,0.000535564,0.8201834,0.000012618108,0.024582954,0.0438359,0.00006214768],"about_ca_topic_score_codex":0.000016383798,"about_ca_topic_score_gemma":0.0000139149415,"teacher_disagreement_score":0.9435911,"about_ca_system_score_codex":0.00002330149,"about_ca_system_score_gemma":0.000008755152,"threshold_uncertainty_score":0.12287229},"labels":[],"label_agreement":null},{"id":"W7084121294","doi":"10.6084/m9.figshare.30177557.v1","title":"Table S3 from Temporarily Trapped: Stormwater Pond Sediment is a Key Transient Sink for Microplastic Debris","year":2025,"lang":"en","type":"article","venue":"Figshare","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Stormwater; Microplastics; Debris; Sink (geography); Sediment; Hydrology (agriculture)","score_opus":0.019660627483388735,"score_gpt":0.2367780832438934,"score_spread":0.21711745576050467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084121294","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006427846,0.00090183335,0.687423,0.01690902,0.0010124162,0.0012666117,0.28806508,0.00040156615,0.0033777005],"genre_scores_gemma":[0.3818654,0.000023117816,0.22553943,0.040369656,0.0010725169,0.002066355,0.30309498,0.000113100476,0.04585544],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989989,0.000021582671,0.00022293208,0.00038083488,0.00018230853,0.0001934841],"domain_scores_gemma":[0.9992812,0.00012622621,0.00006714668,0.00026540496,0.00019062083,0.00006935269],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00003745594,0.00013536427,0.00016163783,0.00013058179,0.0001489018,0.00024506974,0.00039831633,0.00006866124,0.02194022],"category_scores_gemma":[0.000057551788,0.000121567726,0.00011680454,0.00045411763,0.000002963703,0.0002635355,0.00007328997,0.000057405625,0.00033040173],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010713952,0.000074378564,0.000026355856,0.000038305905,0.000099884164,0.000001334846,0.0005195123,0.0015415703,0.00022589635,0.00028331054,0.9963969,0.0007818255],"study_design_scores_gemma":[0.0006370655,0.00002897661,0.0006252433,0.00020422688,0.000035638222,4.035433e-7,0.000016292968,0.21926972,0.003010128,0.0003680176,0.77560335,0.00020094769],"about_ca_topic_score_codex":0.0000674124,"about_ca_topic_score_gemma":0.000016929382,"teacher_disagreement_score":0.46188357,"about_ca_system_score_codex":0.000043999124,"about_ca_system_score_gemma":0.00016517201,"threshold_uncertainty_score":0.97895384},"labels":[],"label_agreement":null},{"id":"W7084137328","doi":"10.6084/m9.figshare.30025215.v1","title":"Glycaemic profile and cognitive impairment in individuals with diabetes mellitus: A cross-sectional study on HbA1c, random blood glucose, and serum insulin levels","year":2025,"lang":"en","type":"article","venue":"Figshare","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Glycated hemoglobin; Confounding; Diabetes mellitus; Cognition; Cognitive impairment; Type 2 diabetes; Insulin","score_opus":0.019813446239807898,"score_gpt":0.2726475762239178,"score_spread":0.25283412998410987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084137328","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96224046,0.000475993,0.00030472217,0.00020285124,0.00002580059,0.0011680148,0.035198625,0.000072523755,0.00031100304],"genre_scores_gemma":[0.9968497,0.000003153803,0.000489534,0.000290917,0.00001382346,0.00033267873,0.0018984574,0.0000050643816,0.000116682706],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9988179,0.00010256427,0.00023042185,0.00042958808,0.00025566516,0.00016381634],"domain_scores_gemma":[0.99920696,0.0003672171,0.000085667016,0.00012255728,0.0001632723,0.000054312626],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017580704,0.00014327401,0.00019449122,0.0002501141,0.00014017013,0.00033854827,0.00016355464,0.000053491323,0.0017061933],"category_scores_gemma":[0.00022648305,0.000117021365,0.000025316387,0.00064811175,0.000011705529,0.0002906801,0.00018703875,0.00011879779,0.000026339776],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052471438,0.0006710995,0.99596035,0.000065061344,0.00031855548,0.000006798104,0.00092736864,0.00046812365,0.000004500218,0.0001770368,0.00028569283,0.0010629277],"study_design_scores_gemma":[0.0053953,0.00025523355,0.9829407,0.0003460841,0.000025965977,0.0000011730298,0.00006706457,0.010370073,0.00028853753,0.00012778101,0.00004303465,0.00013910308],"about_ca_topic_score_codex":0.00000458708,"about_ca_topic_score_gemma":0.000019815789,"teacher_disagreement_score":0.034609225,"about_ca_system_score_codex":0.000021489723,"about_ca_system_score_gemma":0.00010143199,"threshold_uncertainty_score":0.99920636},"labels":[],"label_agreement":null},{"id":"W7096765829","doi":"","title":"Y.: Revisiting Tietze-Nakajima: local and global convexity for maps, Canadian","year":2010,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Convexity; Regular polygon; Convex function; Calculus (dental); Convex set; Key (lock)","score_opus":0.008943762606832677,"score_gpt":0.23589600066495478,"score_spread":0.2269522380581221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7096765829","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00052919297,0.000010101978,0.98082227,0.009226358,0.00012814847,0.00007067289,0.000017151566,0.00003824205,0.00915784],"genre_scores_gemma":[0.7766017,0.0000023352122,0.220468,0.0023198212,0.00007324268,0.0000049250634,0.000016949236,0.0000022374375,0.00051082426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99948275,0.000010482529,0.00010225399,0.00018273797,0.000079478035,0.00014229931],"domain_scores_gemma":[0.9994977,0.00003566249,0.000027615395,0.00013470993,0.00012318564,0.00018110037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019088112,0.000055124412,0.00007392954,0.00003596087,0.00015014864,0.00013852102,0.00017605028,0.000042689764,0.00009655131],"category_scores_gemma":[0.000052567488,0.00004905783,0.00003025202,0.00018955278,0.000025714833,0.00018584229,0.000040950457,0.00004533557,0.000015912283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[7.161536e-7,0.0000037671302,0.0045425035,0.000004223575,0.00000994998,6.663704e-7,0.000018647608,0.0001132832,0.0000064383057,0.97753775,0.0017686957,0.015993375],"study_design_scores_gemma":[0.00021329209,0.000008709729,0.009604742,0.000001966156,0.0000081569,0.00000822925,0.000014946222,0.9519504,0.00002345896,0.010458769,0.027590513,0.00011683973],"about_ca_topic_score_codex":0.01402549,"about_ca_topic_score_gemma":0.043492645,"teacher_disagreement_score":0.967079,"about_ca_system_score_codex":0.00002744589,"about_ca_system_score_gemma":0.00014104432,"threshold_uncertainty_score":0.9925402},"labels":[],"label_agreement":null},{"id":"W7099274103","doi":"","title":"Valuation of a Spark Spread:","year":2009,"lang":"en","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Electricity; Natural gas; Combined cycle; Power station; Turnkey; Base load power plant; Natural gas prices; Electricity generation; SPARK (programming language)","score_opus":0.02706891089308159,"score_gpt":0.25938167071307233,"score_spread":0.23231275981999075,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7099274103","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005110542,0.0000049603,0.97238845,0.0028651815,0.000018615397,0.000019574054,1.2515447e-7,0.000029344357,0.024162715],"genre_scores_gemma":[0.80413926,0.0000024227306,0.1945034,0.00053505314,0.000008808373,3.467927e-7,0.0000017037768,3.956203e-7,0.0008086207],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99965745,0.000014121635,0.0000904424,0.0000713286,0.00013180586,0.000034847537],"domain_scores_gemma":[0.999731,0.000014525672,0.000036109945,0.00011764424,0.00008445436,0.00001623423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010199354,0.000022971477,0.00004254758,0.00005489579,0.00001551914,0.000017215016,0.00013249565,0.000010584831,0.000099328674],"category_scores_gemma":[0.000018831302,0.000018775376,0.000025276184,0.0002897841,0.0000025744603,0.00016501821,0.000010378037,0.000009757953,0.000023796136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[5.54898e-7,0.0000331866,0.00018932563,3.8143318e-7,0.0000042593065,7.7188915e-8,0.000070188325,0.008445558,0.00025746282,0.9796484,0.00042448638,0.010926094],"study_design_scores_gemma":[0.000095243384,0.000029367802,0.022301843,0.0000013146824,0.00000436578,4.336079e-7,0.0000027708081,0.93283886,0.0013674981,0.043027215,0.00029360247,0.000037477555],"about_ca_topic_score_codex":0.000007762954,"about_ca_topic_score_gemma":0.0000011515973,"teacher_disagreement_score":0.9366212,"about_ca_system_score_codex":0.000004829257,"about_ca_system_score_gemma":0.000016644386,"threshold_uncertainty_score":0.108757935},"labels":[],"label_agreement":null},{"id":"W7117298013","doi":"10.3390/axioms15010008","title":"Averaged Iterative Algorithms for Convex Optimization Problems over a Common Fixed-Points Set of Demicontractive Mappings","year":2025,"lang":"en","type":"article","venue":"Axioms","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Hilbert space; Bounded function; Convergence (economics); Convex optimization; Minification; Quadratic equation; Iterative method; Set (abstract data type)","score_opus":0.01640749668156665,"score_gpt":0.2835957253020276,"score_spread":0.26718822862046093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117298013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006095679,0.000030381127,0.9961359,0.0018195612,0.0001563715,0.0004276223,0.000039941897,0.00005140676,0.00072922773],"genre_scores_gemma":[0.8327171,0.000028744611,0.16386937,0.0016338566,0.00005023386,0.00014007914,0.00020100654,0.000011324015,0.0013482715],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989416,0.00008177959,0.00035442668,0.00029995907,0.00017271058,0.00014950133],"domain_scores_gemma":[0.99877846,0.00031603678,0.00024473373,0.00022836214,0.00039328702,0.000039146817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027662845,0.0001250292,0.0002560069,0.00021713998,0.0001252932,0.000093729956,0.00031433415,0.00007781853,0.00005829172],"category_scores_gemma":[0.000107888794,0.00011773155,0.00010345042,0.00069498835,0.000036591464,0.0005059393,0.00008363017,0.00007903191,0.000003644185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058097838,0.00022777144,0.0007800581,0.000093086084,0.0006156521,0.0000015123197,0.0066089844,0.57564557,0.0008570726,0.40616876,0.0014731198,0.007470298],"study_design_scores_gemma":[0.000862256,0.000043890966,0.00092473975,0.000044720116,0.00003183604,7.2767614e-7,0.000041760883,0.9923952,0.0012566859,0.0037444944,0.0005352586,0.00011839445],"about_ca_topic_score_codex":0.00005745086,"about_ca_topic_score_gemma":0.000006719566,"teacher_disagreement_score":0.83226657,"about_ca_system_score_codex":0.000058911526,"about_ca_system_score_gemma":0.00008252172,"threshold_uncertainty_score":0.48009533},"labels":[],"label_agreement":null},{"id":"W7117851726","doi":"","title":"Baillon-Bruck-Reich revisited: divergent-series parameters and strong convergence in the linear case","year":2025,"lang":"","type":"article","venue":"ArXiv.org","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sequence (biology); Convergence (economics); Bounded function; Fixed point; Constant (computer programming); Work (physics)","score_opus":0.034343474693926956,"score_gpt":0.2807671022458118,"score_spread":0.24642362755188485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117851726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8809029,0.0013947111,0.10526776,0.010610374,0.00068310427,0.00044575866,0.000027490318,0.000044673085,0.00062324974],"genre_scores_gemma":[0.99178666,0.0011850817,0.0038344662,0.0019241066,0.000050032853,0.000020554231,0.000013607463,0.000008060135,0.001177408],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973652,0.00044755833,0.000679329,0.0007639859,0.00034239955,0.00040156674],"domain_scores_gemma":[0.998324,0.0003654676,0.00021613398,0.0007378002,0.00024165242,0.000114992414],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00078395614,0.00030626717,0.00036865313,0.00029126974,0.00063083257,0.00030267867,0.0007669896,0.00012283499,0.00025511318],"category_scores_gemma":[0.00035028564,0.00024848076,0.00014491321,0.002328075,0.00022722584,0.0008644782,0.00039407954,0.0003226095,0.00007837443],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003156645,0.00014385513,0.95386916,0.00007654463,0.0001963057,0.00039735195,0.003029498,0.010157793,0.000026323569,0.029788528,0.0004157673,0.001867331],"study_design_scores_gemma":[0.00083906704,0.00012105307,0.2654063,0.00016233174,0.00027229416,0.00014519072,0.0017551528,0.7276191,0.00018621268,0.0003788743,0.0025766108,0.00053781027],"about_ca_topic_score_codex":0.0005595909,"about_ca_topic_score_gemma":0.0001984863,"teacher_disagreement_score":0.7174613,"about_ca_system_score_codex":0.00006559527,"about_ca_system_score_gemma":0.00016080041,"threshold_uncertainty_score":0.9999967},"labels":[],"label_agreement":null},{"id":"W7124321901","doi":"10.65109/rbwm9295","title":"On the Computational Complexity of Quasi-Variational Inequalities and Multi-Leader-Follower Games","year":2024,"lang":"","type":"article","venue":"","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computational complexity theory; Domain (mathematical analysis); Computational problem; Relaxation (psychology); Computational model; Inequality","score_opus":0.09430179713763372,"score_gpt":0.3040440142640592,"score_spread":0.2097422171264255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7124321901","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012454174,0.0004731873,0.9573748,0.038388133,0.00048322944,0.00020157528,0.00013552385,0.00007547398,0.0016226718],"genre_scores_gemma":[0.89859986,0.00004694411,0.09551387,0.0019251222,0.00009029931,0.000012042268,0.000058523205,0.000012865355,0.0037404469],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970671,0.00046237034,0.00075185136,0.000581932,0.0009075952,0.00022916424],"domain_scores_gemma":[0.99625474,0.0026939483,0.00018536905,0.0003008456,0.00046455147,0.00010053816],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0011400648,0.00027336896,0.0003384393,0.00031600546,0.00033304034,0.00069205597,0.00043808954,0.000097925804,0.0029015942],"category_scores_gemma":[0.00029888187,0.00018931185,0.00021503973,0.0009775392,0.00050465687,0.00049315195,0.00022260491,0.00022627502,0.000103839404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000107285,0.0002821807,0.00015291598,0.00006594007,0.000301946,0.0000015935341,0.0028148938,0.05186902,0.0000047509466,0.94148546,0.0015628793,0.001447667],"study_design_scores_gemma":[0.00027720295,0.00008644002,0.0052751056,0.00008400421,0.000053070988,0.0000046741216,0.00031749523,0.88649523,0.000012291611,0.106886074,0.00030804376,0.00020035089],"about_ca_topic_score_codex":0.00017149311,"about_ca_topic_score_gemma":0.00003562035,"teacher_disagreement_score":0.8973545,"about_ca_system_score_codex":0.00005246804,"about_ca_system_score_gemma":0.00036765233,"threshold_uncertainty_score":0.99800986},"labels":[],"label_agreement":null},{"id":"W7132953767","doi":"","title":"Viability kernals for nonlinear systems","year":2008,"lang":"","type":"dissertation","venue":"TSpace","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Control theory (sociology); Constructive; Nonlinear system; Set (abstract data type); Affine transformation; Boundary (topology); Control (management)","score_opus":0.03277645271928684,"score_gpt":0.34225423698141894,"score_spread":0.30947778426213207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132953767","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0061758133,0.00095929514,0.98212904,0.0015839855,0.0032409704,0.0016754501,0.00010955856,0.00015397879,0.0039719227],"genre_scores_gemma":[0.17667867,0.0029472443,0.32328358,0.0009708076,0.0036083688,0.0010912551,0.007178426,0.00025259246,0.48398906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9962447,0.00022160457,0.0009858769,0.0011675906,0.00088302913,0.00049718854],"domain_scores_gemma":[0.99519163,0.0004937038,0.0009950299,0.0009422088,0.0021063616,0.0002710808],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070166757,0.0005247957,0.000843245,0.0003185808,0.0007038432,0.00049819204,0.001045593,0.00045494136,0.00027299306],"category_scores_gemma":[0.00046077374,0.0005346801,0.00060836755,0.0010827857,0.000054784763,0.00038481716,0.00008099024,0.0002758289,0.0002351327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007280506,0.003008747,0.0022625045,0.004034981,0.0028524396,0.000032410306,0.0695383,0.7611621,0.00085492677,0.12316303,0.02415278,0.008209753],"study_design_scores_gemma":[0.0005427943,0.000108348606,0.0007297083,0.00010004938,0.00016504384,0.000008453503,0.00092914776,0.97075987,0.0002038339,0.00014868184,0.025727795,0.0005762718],"about_ca_topic_score_codex":0.0006616615,"about_ca_topic_score_gemma":0.00005065892,"teacher_disagreement_score":0.6588454,"about_ca_system_score_codex":0.00018630787,"about_ca_system_score_gemma":0.00077838823,"threshold_uncertainty_score":0.9997105},"labels":[],"label_agreement":null},{"id":"W7142865936","doi":"10.23952/jano.8.2026.1.03","title":"A fast three-operator splitting method with $o(1/k)$ last-iterate convergence rates for monotone inclusions","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Monotone polygon; Rate of convergence; Sequence (biology); Differential inclusion","score_opus":0.008348923102842342,"score_gpt":0.2830043175382748,"score_spread":0.27465539443543247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7142865936","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051841553,0.00025774824,0.9944284,0.0035548788,0.00027264815,0.00047386863,0.000011916253,0.000020056583,0.00046207427],"genre_scores_gemma":[0.19257915,0.00030179668,0.8056284,0.0011399658,0.00014508855,0.000026142792,0.000013562877,0.000019055264,0.00014683539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974445,0.00011049183,0.0011948424,0.0004998438,0.00042585545,0.00032446312],"domain_scores_gemma":[0.996621,0.00050323294,0.0010749254,0.00021909944,0.0013357048,0.00024602772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093282264,0.00034109366,0.0007368909,0.00045825145,0.0007155983,0.00056447956,0.0004173044,0.0001557068,0.00008701438],"category_scores_gemma":[0.00012756605,0.00026501677,0.00016658536,0.0017796074,0.0000817772,0.0006814673,0.00023261267,0.00029192877,0.0000018622336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053506996,0.00021825489,0.00034945016,0.00006006731,0.00033868445,0.000002675233,0.00058878394,0.9422896,0.00036413895,0.041340094,0.00010038077,0.013812786],"study_design_scores_gemma":[0.0019381291,0.0003321726,0.000299504,0.00014720407,0.00035757976,0.000013118081,0.00014063844,0.9934346,0.00068997504,0.001842766,0.0005187409,0.00028558972],"about_ca_topic_score_codex":0.000007058287,"about_ca_topic_score_gemma":0.0000016596323,"teacher_disagreement_score":0.19206072,"about_ca_system_score_codex":0.00008939963,"about_ca_system_score_gemma":0.000483291,"threshold_uncertainty_score":0.9999802},"labels":[],"label_agreement":null},{"id":"W7162016144","doi":"10.17654/0972111810038","title":"EQUATION FOR THE OPTIMAL TRAJECTORY OF LINEAR DYNAMICAL SYSTEMS WITH A QUADRATIC CRITERION","year":2011,"lang":"","type":"article","venue":"Far East Journal of Dynamical Systems","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Akademie Věd České Republiky","keywords":"Trajectory; Quadratic equation; Linear dynamical system; Dynamical systems theory; Ordinary differential equation; Dynamical system (definition); Boundary value problem; Linear system","score_opus":0.04338194253899671,"score_gpt":0.2509168835634106,"score_spread":0.20753494102441386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7162016144","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0112914285,0.0015080005,0.98380077,0.0004058813,0.0019991277,0.0008455938,0.00006465833,0.000018036963,0.00006647613],"genre_scores_gemma":[0.9724946,0.000056039946,0.02662761,0.000029759974,0.00051241514,0.000030243682,0.000012891429,0.00003624302,0.00020019055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9944756,0.00076452404,0.0024905347,0.00042389875,0.0013966255,0.00044880284],"domain_scores_gemma":[0.9934663,0.0005612227,0.0028010283,0.0005246293,0.0023350054,0.00031182295],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0021732368,0.00040840995,0.0010742778,0.00039976658,0.00033263376,0.00032857616,0.0012369547,0.00025551155,0.00004138734],"category_scores_gemma":[0.00024161852,0.00025524915,0.0005718639,0.00089220714,0.00022432226,0.000791254,0.000094196585,0.00043834985,0.00001047405],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009563217,0.0008607053,0.0009532714,0.0006573849,0.0014487677,0.00001845301,0.004204063,0.9484632,0.0002735148,0.041036833,0.000037489735,0.001089974],"study_design_scores_gemma":[0.0014294536,0.0016435294,0.0018616375,0.0006952089,0.0006666628,0.00032777904,0.0013051921,0.99163365,0.000005962919,0.00003527481,0.000097879274,0.0002977932],"about_ca_topic_score_codex":0.00024804386,"about_ca_topic_score_gemma":0.000018372646,"teacher_disagreement_score":0.96120316,"about_ca_system_score_codex":0.00025466032,"about_ca_system_score_gemma":0.00051704556,"threshold_uncertainty_score":0.99999},"labels":[],"label_agreement":null}]}