{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032673408,0.00067231414,0.9931751,0.0004181917,0.00017161816,0.000039262344,0.000052377283,0.00015959422,0.0020442898],"genre_scores_gemma":[0.19664733,0.0019299224,0.7791367,0.00053099595,0.0006304807,0.00046447787,0.00038166557,0.00043105695,0.019847445],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868125,0.0006313189,0.000080243524,0.0001696191,0.00031517318,0.00012245621],"domain_scores_gemma":[0.9947653,0.0038389047,0.00018641603,0.00029020148,0.00075901404,0.00016012025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0057251737,0.0016713445,0.001903802,0.0010693229,0.0011329883,0.00209225,0.0026597802,0.0026765894,0.0078724595],"category_scores_gemma":[0.015959818,0.0013309092,0.0013453189,0.0013889703,0.002103501,0.0029939287,0.0026247692,0.00558754,0.0009919013],"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.0003808796,0.00021137658,0.0009572198,0.00037870818,0.00016619221,0.00011399916,0.00024447087,0.33810404,0.0024198222,0.44614673,0.007587654,0.20328896],"study_design_scores_gemma":[0.000026904128,0.00002760886,0.000071792594,0.000028295299,0.000019352332,0.000014888183,0.0000101968535,0.9385425,0.0006410119,0.059338644,0.0012653174,0.000013588643],"about_ca_topic_score_codex":0.006194868,"about_ca_topic_score_gemma":0.007536662,"teacher_disagreement_score":0.0078724595,"about_ca_system_score_codex":0.0015205931,"about_ca_system_score_gemma":0.0025868411,"threshold_uncertainty_score":0.030277967},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013550941,0.0018198501,0.9704286,0.0017394767,0.00018679042,0.00004432872,0.00013878703,0.00008788302,0.012003242],"genre_scores_gemma":[0.8028489,0.0058641173,0.17227565,0.0005474772,0.0017936613,0.00063705374,0.00046666557,0.00030828506,0.015258302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967811,0.001765739,0.00016290952,0.00041123998,0.0007291273,0.00014986789],"domain_scores_gemma":[0.98722744,0.0097795725,0.0010432682,0.00057634973,0.001019398,0.00035396995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070099467,0.0013266279,0.0025911618,0.0029494225,0.0015212419,0.0056405417,0.0024987594,0.002268561,0.0051165586],"category_scores_gemma":[0.020416338,0.0009458051,0.002182242,0.0026380748,0.0033159712,0.0074055474,0.0031353484,0.0037868728,0.0005408082],"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.000038412563,0.000058938564,0.0003749986,0.00010667491,0.00009052268,0.000051625513,0.00011749884,0.09583171,0.0005281998,0.8876371,0.002030835,0.013133514],"study_design_scores_gemma":[0.0000069631215,0.000024402807,0.0000813894,0.000023417511,0.000019125397,0.000015734853,0.000025162935,0.42573157,0.00014850432,0.57313615,0.00077412266,0.00001353332],"about_ca_topic_score_codex":0.0009820875,"about_ca_topic_score_gemma":0.0008568942,"teacher_disagreement_score":0.0070099467,"about_ca_system_score_codex":0.002468253,"about_ca_system_score_gemma":0.0015677849,"threshold_uncertainty_score":0.0370726},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031542204,0.0007496412,0.9291927,0.0007960492,0.00019605007,0.000073558054,0.00011898649,0.000038433882,0.037292387],"genre_scores_gemma":[0.6132765,0.0023032865,0.33519846,0.00045342135,0.0005410992,0.0004378408,0.00030336189,0.00015451503,0.047331497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990969,0.00039496692,0.000037389385,0.00015700707,0.00021941622,0.000094385134],"domain_scores_gemma":[0.9989121,0.000625906,0.0001218735,0.00007742925,0.00014763298,0.000115147646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021642519,0.0009552904,0.00071033416,0.0011030677,0.00088450016,0.0025638847,0.0010607076,0.0013817344,0.003696258],"category_scores_gemma":[0.004288713,0.0005788521,0.0013187068,0.0010617661,0.0026666156,0.0031723692,0.0018079344,0.0032631382,0.0004986155],"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.000016535425,0.00001710983,0.0001192992,0.00004065358,0.000009388468,0.000083666935,0.00006349379,0.016643586,0.0005785323,0.9762516,0.00065825746,0.005517778],"study_design_scores_gemma":[0.000016568385,0.00006414936,0.00026922103,0.000045725843,0.0000143100815,0.00016570526,0.00011802452,0.25951982,0.0013317548,0.73066497,0.007764421,0.000025368017],"about_ca_topic_score_codex":0.0011398504,"about_ca_topic_score_gemma":0.0011890823,"teacher_disagreement_score":0.003696258,"about_ca_system_score_codex":0.0019726604,"about_ca_system_score_gemma":0.0015073251,"threshold_uncertainty_score":0.014312744},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19669834,0.004080685,0.72158986,0.005020621,0.00023184717,0.000068706395,0.00039720343,0.00030721762,0.07160549],"genre_scores_gemma":[0.90208566,0.0024675634,0.076939635,0.0011025531,0.00062109943,0.00012252039,0.0003135891,0.00023032131,0.016117088],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984485,0.00061346916,0.00011136838,0.0003976846,0.00025611103,0.0001727782],"domain_scores_gemma":[0.9919636,0.0045612673,0.0007470358,0.00082703796,0.0010769021,0.000824172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036240176,0.0008565742,0.0012781554,0.001807499,0.0014177422,0.0027298478,0.0014443218,0.0015317593,0.004735924],"category_scores_gemma":[0.016245607,0.0008668148,0.0013620127,0.0010125296,0.0052160244,0.008166586,0.00467173,0.004025006,0.0005125844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001668823,0.000013738156,0.00024210673,0.00003803623,0.000007519536,0.00006374853,0.00013412435,0.0008715839,0.0006068885,0.99381655,0.00064484205,0.0035441325],"study_design_scores_gemma":[0.0000073846822,0.000017098751,0.00033753322,0.000018682842,0.000006893962,0.0001792692,0.00007496823,0.0112850815,0.0003055189,0.9857275,0.0020295708,0.000010420567],"about_ca_topic_score_codex":0.0014793968,"about_ca_topic_score_gemma":0.0010190726,"teacher_disagreement_score":0.004735924,"about_ca_system_score_codex":0.0011039127,"about_ca_system_score_gemma":0.00074797415,"threshold_uncertainty_score":0.019165874},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040797092,0.012212063,0.85496587,0.0047770026,0.00093192654,0.00008409821,0.0006601684,0.00037752365,0.08519423],"genre_scores_gemma":[0.5931366,0.019469919,0.27812052,0.0056111934,0.004430346,0.00039627426,0.0018546161,0.0014619405,0.095518656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843377,0.00048372117,0.000126255,0.0003592865,0.00043362202,0.00016333346],"domain_scores_gemma":[0.9966204,0.0016920172,0.00029857105,0.0006241548,0.00040601304,0.00035883373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053322157,0.002764405,0.0024937096,0.0034769466,0.0024956057,0.0037367938,0.0032293655,0.0036019494,0.008563191],"category_scores_gemma":[0.010498707,0.0011068865,0.0035860313,0.004546955,0.004577222,0.009184534,0.0060488633,0.006341048,0.0013745303],"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.000025049576,0.000021178193,0.00011926847,0.00015308506,0.000028228558,0.00010778698,0.00010387069,0.0023348168,0.0009307148,0.98574454,0.002098989,0.008332494],"study_design_scores_gemma":[0.000006608447,0.000014530816,0.00016791614,0.000026232383,0.00002170895,0.00011023348,0.000023075188,0.012564459,0.00042566613,0.98207283,0.0045521995,0.000014494099],"about_ca_topic_score_codex":0.00095804024,"about_ca_topic_score_gemma":0.0011529987,"teacher_disagreement_score":0.008563191,"about_ca_system_score_codex":0.002505102,"about_ca_system_score_gemma":0.0008792782,"threshold_uncertainty_score":0.028646708},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07779208,0.0031092786,0.8802683,0.0014064707,0.00019918777,0.000045241504,0.0005500585,0.00023195425,0.036397476],"genre_scores_gemma":[0.71561843,0.0036400002,0.24075387,0.00048509135,0.00045174154,0.0001653525,0.0013341291,0.00024075354,0.037310615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989266,0.00024303248,0.000083949584,0.0002842777,0.00039537007,0.00006682552],"domain_scores_gemma":[0.9981943,0.0006370925,0.0003005387,0.0002079332,0.00052127294,0.0001388619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013190943,0.0007648271,0.0004891628,0.0009867911,0.000489494,0.0030017176,0.00063759583,0.00062651717,0.0044021336],"category_scores_gemma":[0.0050887517,0.00039350468,0.0008064839,0.0009054914,0.0024880026,0.004499516,0.0018625179,0.002165557,0.0008499488],"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.00005414981,0.000015104841,0.0006387953,0.00013137357,0.000028426326,0.00014632124,0.00027024624,0.018163664,0.0032116757,0.93886507,0.0018369632,0.036638252],"study_design_scores_gemma":[0.000012603932,0.00006928356,0.0016365376,0.00007258418,0.000017831746,0.00040841202,0.0002008428,0.1514075,0.0042124824,0.81809646,0.023832591,0.000032894142],"about_ca_topic_score_codex":0.00153245,"about_ca_topic_score_gemma":0.001058978,"teacher_disagreement_score":0.0044021336,"about_ca_system_score_codex":0.0013581546,"about_ca_system_score_gemma":0.0005698229,"threshold_uncertainty_score":0.014726579},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009909645,0.0005792142,0.9801493,0.00022053944,0.0001069633,0.000015706482,0.00003345588,0.00011736824,0.008867827],"genre_scores_gemma":[0.40669566,0.0029092706,0.54212284,0.00024675525,0.0006038463,0.00018110957,0.00026150982,0.0007516106,0.04622742],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947613,0.0002205268,0.000016066044,0.000056014855,0.00019611514,0.000035095145],"domain_scores_gemma":[0.9992242,0.00044888174,0.00004666087,0.00009476147,0.00012686255,0.00005856956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013787269,0.00079442374,0.0013621062,0.0010948756,0.00039094788,0.0016078608,0.0012085491,0.0011871121,0.0030855278],"category_scores_gemma":[0.003395349,0.00076765625,0.00095297094,0.0011468924,0.0015663197,0.0019032736,0.0021222904,0.00282157,0.00094911497],"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.00007824357,0.00006105075,0.00018758295,0.00015551438,0.00005403259,0.00003710172,0.0001270548,0.26828676,0.0032720661,0.67254025,0.0043047904,0.050895523],"study_design_scores_gemma":[0.000008517055,0.000026056148,0.000059398466,0.00001633148,0.000009813145,0.000027407757,0.000013568639,0.8418316,0.0006889653,0.15443347,0.002875865,0.000008910539],"about_ca_topic_score_codex":0.0012120203,"about_ca_topic_score_gemma":0.001089444,"teacher_disagreement_score":0.0030855278,"about_ca_system_score_codex":0.001107988,"about_ca_system_score_gemma":0.00067474204,"threshold_uncertainty_score":0.010322094},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042471197,0.00017231675,0.989234,0.0002590388,0.00015078677,0.000046771962,0.00003248741,0.00014900007,0.0057085217],"genre_scores_gemma":[0.10679832,0.0005212205,0.8720752,0.00034313282,0.00021877054,0.00027488897,0.00015483623,0.00028060278,0.019333092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855834,0.0004567355,0.0000643947,0.0002842035,0.00051382184,0.0001225366],"domain_scores_gemma":[0.99830353,0.0006852969,0.00008832609,0.00019744213,0.0004569622,0.00026847055],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023549094,0.0011137341,0.0017383405,0.0014306892,0.0010622725,0.0017717142,0.0017778752,0.0028820059,0.0043789404],"category_scores_gemma":[0.006669193,0.00072656886,0.0014957236,0.0012632579,0.0030196873,0.0021748242,0.004869859,0.0032422752,0.0016446227],"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.00028437833,0.00019017643,0.0006641596,0.00050621614,0.00014499352,0.00047575543,0.0005504575,0.14169036,0.019019218,0.70365167,0.009142299,0.1236803],"study_design_scores_gemma":[0.00015326637,0.00050976704,0.00024303661,0.000093794275,0.000057452526,0.0006335121,0.00007071764,0.6980657,0.008588557,0.26305136,0.028441304,0.000091553484],"about_ca_topic_score_codex":0.0009742569,"about_ca_topic_score_gemma":0.0008817431,"teacher_disagreement_score":0.0043789404,"about_ca_system_score_codex":0.0007856457,"about_ca_system_score_gemma":0.0014715763,"threshold_uncertainty_score":0.014649034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1454658,0.0108345,0.4925618,0.010812135,0.0014742864,0.00007703223,0.00057917414,0.00032209622,0.33787322],"genre_scores_gemma":[0.8652738,0.0064313025,0.06498722,0.0022809254,0.0019153511,0.00016951465,0.000342176,0.00016676597,0.05843285],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992035,0.00019891933,0.000032849195,0.00019490525,0.00026444066,0.00010542786],"domain_scores_gemma":[0.9987317,0.00068860146,0.00009489124,0.00016734572,0.00019684213,0.00012065651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019126622,0.0003732106,0.00064054894,0.0012304743,0.0015379464,0.001625493,0.0005077825,0.00093975087,0.005075894],"category_scores_gemma":[0.003959277,0.00025455776,0.0007480351,0.00060038676,0.003726675,0.004297392,0.0026787287,0.002240434,0.0009273024],"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.000012826322,0.0000037866114,0.000064632506,0.0000146200955,0.0000029205105,0.000036200407,0.00006543642,0.00044190296,0.0002275624,0.99324834,0.0011087625,0.0047728936],"study_design_scores_gemma":[0.000008480706,0.000021653039,0.00024175913,0.000017951495,0.000003841363,0.00011094907,0.00004080724,0.003207558,0.00031968922,0.9789468,0.017069055,0.000011375918],"about_ca_topic_score_codex":0.0008891429,"about_ca_topic_score_gemma":0.00050758914,"teacher_disagreement_score":0.005075894,"about_ca_system_score_codex":0.00091089285,"about_ca_system_score_gemma":0.00040145885,"threshold_uncertainty_score":0.016980588},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039156687,0.0025886572,0.8061134,0.004079764,0.00073016644,0.00007336141,0.00024811598,0.00026273684,0.14674707],"genre_scores_gemma":[0.585645,0.0033583967,0.27312812,0.0027245437,0.00208951,0.00039082987,0.00058083783,0.000546348,0.13153633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896944,0.00022623519,0.00006973517,0.00021817746,0.00041107964,0.00010532257],"domain_scores_gemma":[0.99801874,0.0009738889,0.00013324583,0.00030911702,0.00036323714,0.00020178455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002125588,0.00085033476,0.0007457422,0.0014547819,0.0012210609,0.0024208827,0.0016389725,0.0015819103,0.008221617],"category_scores_gemma":[0.0046242718,0.00062780106,0.001193526,0.00072684727,0.0039077103,0.0063003716,0.003260552,0.0069606532,0.0011428642],"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.0000048618695,0.0000074574295,0.000031586307,0.000018831732,0.0000029285961,0.00002832348,0.00006154945,0.0005935727,0.00044140368,0.9931377,0.0015047955,0.00416702],"study_design_scores_gemma":[0.0000035659398,0.000008408406,0.000035147437,0.000008677279,0.0000019856911,0.00003967453,0.000016799237,0.0049084923,0.00016264105,0.9916899,0.0031202254,0.000004424572],"about_ca_topic_score_codex":0.00033104373,"about_ca_topic_score_gemma":0.00056212855,"teacher_disagreement_score":0.008221617,"about_ca_system_score_codex":0.0010358158,"about_ca_system_score_gemma":0.00068822195,"threshold_uncertainty_score":0.027504086},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07183941,0.0035443527,0.9089831,0.0009418036,0.00015737227,0.000066312685,0.00023743226,0.00018859512,0.014041697],"genre_scores_gemma":[0.88635725,0.0023046187,0.09477433,0.00038852,0.00025048447,0.00034194588,0.00081753416,0.00020829124,0.014556952],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746656,0.0006936703,0.00018809263,0.00049865205,0.00086496945,0.00028812484],"domain_scores_gemma":[0.9901052,0.0064553875,0.00088141626,0.0004963078,0.0016400807,0.00042166453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005452858,0.0014502013,0.0010865533,0.0012213093,0.0006098569,0.0022532726,0.0013294137,0.0011619455,0.0037621402],"category_scores_gemma":[0.014044697,0.00039309319,0.0009494174,0.0006863883,0.0020434472,0.002805594,0.0030137799,0.0034720746,0.0003627109],"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.0005504768,0.00008661043,0.0031791967,0.0007597926,0.000165001,0.00022651309,0.0007145048,0.4111749,0.014155784,0.52122694,0.0022624321,0.04549789],"study_design_scores_gemma":[0.000012538989,0.00009759727,0.00064551766,0.000062186045,0.000018752798,0.00003591622,0.000050955852,0.9244883,0.0024090852,0.07059198,0.0015715099,0.000015659869],"about_ca_topic_score_codex":0.0023884724,"about_ca_topic_score_gemma":0.0014237814,"teacher_disagreement_score":0.005452858,"about_ca_system_score_codex":0.0022970943,"about_ca_system_score_gemma":0.0010324533,"threshold_uncertainty_score":0.0288378},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51050264,0.00043491708,0.46525386,0.0012347554,0.000109424,0.00006745012,0.00016989087,0.00052807847,0.021699013],"genre_scores_gemma":[0.94803447,0.0003156172,0.04551569,0.00018944716,0.00012528225,0.00008942759,0.00020526968,0.00012801167,0.0053967526],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976986,0.0006100597,0.00011819026,0.0006262427,0.000676365,0.0002704819],"domain_scores_gemma":[0.99444515,0.0033575036,0.00051002885,0.0006228644,0.000521104,0.00054341345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020553488,0.0006387931,0.00092326466,0.0009726473,0.0012143921,0.0024964558,0.0008539024,0.000894862,0.0024814515],"category_scores_gemma":[0.009146746,0.00061087636,0.0009584735,0.0007516988,0.0057673594,0.005697646,0.0028296341,0.0027878468,0.00043437307],"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.00017898202,0.000047336496,0.001073241,0.000090460235,0.00003824141,0.00028656863,0.00045374339,0.006757956,0.0057270997,0.9756706,0.00058691937,0.009088854],"study_design_scores_gemma":[0.000026064408,0.00005798585,0.00045294967,0.000011437042,0.00001290784,0.000260223,0.000118660704,0.043704063,0.0026724401,0.95164347,0.0010226896,0.000017092625],"about_ca_topic_score_codex":0.00055449863,"about_ca_topic_score_gemma":0.00036647407,"teacher_disagreement_score":0.0024964558,"about_ca_system_score_codex":0.00081861357,"about_ca_system_score_gemma":0.0006316813,"threshold_uncertainty_score":0.010869861},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002444224,0.01055998,0.13499247,0.003369038,0.0016529168,0.000028631795,0.0001951133,0.00018717698,0.8465704],"genre_scores_gemma":[0.12420015,0.014298121,0.05964839,0.0018468106,0.002525461,0.00019511054,0.0005291794,0.00076411007,0.7959926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996165,0.00010465823,0.00001526353,0.00007622593,0.0001586397,0.00002876189],"domain_scores_gemma":[0.9997137,0.00013165835,0.000013506883,0.00006568009,0.000056801335,0.00001855145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005327224,0.00083025906,0.000842107,0.00086541596,0.0009441075,0.0025037548,0.0007573326,0.0009058033,0.020129183],"category_scores_gemma":[0.0012832566,0.00046866926,0.0006053803,0.0011225176,0.0021413644,0.0034446795,0.0014004797,0.0035598965,0.005693571],"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.0000037381928,0.0000068894783,0.00001137612,0.000030147474,0.000002795594,0.000010570865,0.000032086307,0.00025121108,0.00014886519,0.9678848,0.017064469,0.0145530505],"study_design_scores_gemma":[0.0000023216278,0.000004178312,0.00004527475,0.000033626155,0.0000034985399,0.00006875008,0.000019088768,0.0012983965,0.00029858717,0.8718495,0.12637319,0.0000036669871],"about_ca_topic_score_codex":0.00040918894,"about_ca_topic_score_gemma":0.00060566224,"teacher_disagreement_score":0.020129183,"about_ca_system_score_codex":0.0013196975,"about_ca_system_score_gemma":0.00073920516,"threshold_uncertainty_score":0.067338824},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024013245,0.0032211065,0.9328052,0.0011343319,0.0006033683,0.000032841483,0.00009605686,0.00014491558,0.037948962],"genre_scores_gemma":[0.6598812,0.00910522,0.2751846,0.0014571117,0.0028862592,0.00026142472,0.00027395063,0.0007074904,0.050242778],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898654,0.00030993068,0.000046332363,0.00022927577,0.00031889245,0.0001090009],"domain_scores_gemma":[0.99732035,0.0013964664,0.00030472918,0.0003639096,0.00045932192,0.00015524299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020942797,0.0008029413,0.00070201315,0.0015131688,0.0010524453,0.0016801802,0.001304885,0.0011425633,0.0066190325],"category_scores_gemma":[0.008903125,0.0003471121,0.00081578724,0.0013786448,0.0024635978,0.004485905,0.0023923079,0.0022521785,0.0013079597],"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.000007756817,0.000007557212,0.00011912039,0.000036481873,0.000010502902,0.000042006042,0.00006512553,0.0068899593,0.00071377243,0.9832961,0.0008826985,0.007929043],"study_design_scores_gemma":[0.000004730863,0.00003979649,0.00024300754,0.000033080698,0.000012811773,0.00010110961,0.000029281864,0.07969714,0.00072566676,0.90730774,0.011790424,0.00001529059],"about_ca_topic_score_codex":0.0014258688,"about_ca_topic_score_gemma":0.0008669119,"teacher_disagreement_score":0.0066190325,"about_ca_system_score_codex":0.0010332405,"about_ca_system_score_gemma":0.0006649151,"threshold_uncertainty_score":0.022142887},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03837247,0.0013570905,0.8706549,0.0031795714,0.00031511334,0.00026166,0.00083253457,0.00035178638,0.08467499],"genre_scores_gemma":[0.7440906,0.003648216,0.22687016,0.00095518416,0.0006288916,0.0011758977,0.0018354304,0.0004933567,0.020302199],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99756753,0.0006612223,0.00018985862,0.00040785587,0.00078207604,0.00039135048],"domain_scores_gemma":[0.9934582,0.004083405,0.00053482427,0.00027226008,0.0013024489,0.0003487843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032820983,0.0015324156,0.00134686,0.0021665092,0.0012527962,0.0031909538,0.0014235745,0.002497786,0.015734613],"category_scores_gemma":[0.017995501,0.0011978482,0.0013566893,0.0012984192,0.0032322279,0.0043110065,0.0028277242,0.004303501,0.0018478621],"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.00003412427,0.000057353507,0.00027915544,0.00018594769,0.000020774123,0.00019523721,0.00015507084,0.055393692,0.0018368829,0.92892635,0.004268926,0.008646517],"study_design_scores_gemma":[0.00003801926,0.00004631016,0.0002451217,0.00009502365,0.000010136994,0.000073115254,0.000106289976,0.23684025,0.0014365832,0.75568825,0.005395298,0.000025574876],"about_ca_topic_score_codex":0.0024176328,"about_ca_topic_score_gemma":0.0023330417,"teacher_disagreement_score":0.015734613,"about_ca_system_score_codex":0.0017725923,"about_ca_system_score_gemma":0.0025642568,"threshold_uncertainty_score":0.052637517},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29108593,0.0010062392,0.68741363,0.000932234,0.00017961237,0.00007400777,0.00013320635,0.00017168213,0.019003429],"genre_scores_gemma":[0.8859642,0.00065208564,0.10606282,0.00024325738,0.0002646572,0.00017668935,0.00014763117,0.0001250034,0.006363651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965475,0.0010232436,0.00025503433,0.0008157668,0.0009465307,0.0004118164],"domain_scores_gemma":[0.9895835,0.0064965216,0.00096604077,0.0004071429,0.0011830102,0.0013638712],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051340624,0.0012333926,0.0012725367,0.0022905043,0.0015597407,0.002854807,0.0015819255,0.001163383,0.0023080048],"category_scores_gemma":[0.01197181,0.00077376235,0.0022789943,0.0010770074,0.005296614,0.006600681,0.0059496392,0.0034588515,0.00024814514],"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.00011948718,0.00002719819,0.0006597381,0.00012754327,0.0000651144,0.0003197914,0.00040825445,0.004432915,0.0071811825,0.981396,0.00034850472,0.004914278],"study_design_scores_gemma":[0.000016991084,0.00009367976,0.00035168946,0.000024413877,0.000032336044,0.00039039415,0.00016367748,0.0455689,0.0047152066,0.947226,0.0013777717,0.000038968235],"about_ca_topic_score_codex":0.00029483764,"about_ca_topic_score_gemma":0.0002653135,"teacher_disagreement_score":0.0051340624,"about_ca_system_score_codex":0.0012337104,"about_ca_system_score_gemma":0.00081915775,"threshold_uncertainty_score":0.027151823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030550748,0.0043267966,0.79618496,0.0027955594,0.00035339803,0.0000630254,0.0003522866,0.00022161152,0.16515163],"genre_scores_gemma":[0.6234943,0.0066538975,0.25119722,0.00103343,0.0012440189,0.0005078008,0.0011434696,0.0014401114,0.1132858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962574,0.0013260039,0.00016296872,0.00066869473,0.0012469873,0.00033789486],"domain_scores_gemma":[0.9887367,0.006541906,0.0006159921,0.0019806486,0.0015948483,0.00053000683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004582698,0.0013004439,0.0019202114,0.0025149144,0.0018156093,0.005682867,0.002373133,0.002113876,0.0080883],"category_scores_gemma":[0.02152347,0.0013985505,0.0025065192,0.0025838506,0.00471171,0.0099929115,0.0054899673,0.007922073,0.0023774472],"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.000031729134,0.0000108248905,0.00012055426,0.000046375037,0.000016545118,0.000039087132,0.000086917215,0.004714314,0.00042917088,0.98177195,0.0021749935,0.010557564],"study_design_scores_gemma":[0.000007236269,0.000017030821,0.00039683262,0.00003292716,0.000016607451,0.00015675326,0.00004754992,0.023187438,0.00077900983,0.96795124,0.0073849875,0.00002234323],"about_ca_topic_score_codex":0.0015883542,"about_ca_topic_score_gemma":0.0015752045,"teacher_disagreement_score":0.0080883,"about_ca_system_score_codex":0.0019952338,"about_ca_system_score_gemma":0.0016179688,"threshold_uncertainty_score":0.027058005},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022492478,0.0013263007,0.91360146,0.0012020796,0.0003189244,0.000067377514,0.00007926295,0.000103722225,0.060808435],"genre_scores_gemma":[0.60159695,0.0024803735,0.34438092,0.00093917386,0.00095988275,0.00031356965,0.00015972617,0.00018899608,0.048980374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803096,0.00064918114,0.00009597291,0.00035994695,0.0007108772,0.00015295733],"domain_scores_gemma":[0.9954867,0.0025701334,0.00037662068,0.0004135194,0.00068359595,0.00046943224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003371672,0.001064314,0.0006762082,0.002542221,0.0015932377,0.0034078879,0.0018778301,0.0016039754,0.005805581],"category_scores_gemma":[0.010147674,0.00066586316,0.0014351521,0.0014502972,0.0051253457,0.006562536,0.0040951055,0.0049224915,0.0006524837],"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.0000033422157,0.0000061512756,0.000033186032,0.000016785174,0.0000036431964,0.000042337964,0.0000726045,0.0013958883,0.0003288276,0.99506336,0.00025367455,0.0027801567],"study_design_scores_gemma":[0.0000043199657,0.000013087896,0.000071630006,0.000017664624,0.000006902679,0.000112333044,0.000046028636,0.012501851,0.00044774052,0.98294604,0.003819644,0.000012686795],"about_ca_topic_score_codex":0.00061227445,"about_ca_topic_score_gemma":0.00092920073,"teacher_disagreement_score":0.005805581,"about_ca_system_score_codex":0.0015408406,"about_ca_system_score_gemma":0.0013080469,"threshold_uncertainty_score":0.019421577},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016290343,0.000103942875,0.99640924,0.00004638136,0.00005703737,0.000029658488,0.000030926094,0.0000678597,0.0016259402],"genre_scores_gemma":[0.04413477,0.00028698464,0.95027393,0.00011938318,0.000073278534,0.00025686866,0.00015747387,0.00013757478,0.0045597916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995309,0.00012377105,0.000023724459,0.00007480515,0.00020816736,0.00003860184],"domain_scores_gemma":[0.9996131,0.0002049692,0.000031389427,0.000045084966,0.00008090813,0.000024558834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011712823,0.0011919412,0.0013656404,0.00091084634,0.00074816484,0.0011398346,0.0017208526,0.0018126147,0.0072090784],"category_scores_gemma":[0.001752758,0.0008788339,0.0013277789,0.0010861931,0.0008980086,0.0011188138,0.0016569732,0.0030875702,0.0010856164],"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.0002315661,0.00025229147,0.00046220628,0.00040705627,0.00015332049,0.00015833684,0.00017663286,0.3779835,0.016136995,0.23283072,0.007374563,0.36383274],"study_design_scores_gemma":[0.000028485838,0.00006882777,0.00012216109,0.000020603462,0.000020143465,0.00004498944,0.000013107428,0.9623045,0.0010702957,0.030755315,0.005537325,0.000014296748],"about_ca_topic_score_codex":0.002216709,"about_ca_topic_score_gemma":0.0028251333,"teacher_disagreement_score":0.0072090784,"about_ca_system_score_codex":0.00051985064,"about_ca_system_score_gemma":0.0009472399,"threshold_uncertainty_score":0.024116814},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038820389,0.06391153,0.27877694,0.02595682,0.38976532,0.0003527526,0.0014363353,0.0011536694,0.23476467],"genre_scores_gemma":[0.0415986,0.05738476,0.07683841,0.0057346434,0.27098933,0.0007895188,0.0024854569,0.0019150611,0.5422642],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99899274,0.00028260486,0.00006733644,0.00019758842,0.00039301784,0.00006679376],"domain_scores_gemma":[0.997472,0.0010578794,0.000117140815,0.00034095495,0.0007102477,0.00030181196],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013030469,0.0019373584,0.0034963076,0.0021980423,0.0009308135,0.0046075573,0.0018778604,0.0030283374,0.08121833],"category_scores_gemma":[0.0051174276,0.00054970104,0.0016086586,0.0027951263,0.0012422854,0.003129415,0.0014762159,0.0035114065,0.02277136],"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.000047485315,0.00011600815,0.0001597513,0.00046634884,0.000070509544,0.000102529644,0.000041595635,0.0068643275,0.0004979944,0.110891186,0.7919072,0.08883507],"study_design_scores_gemma":[0.000059932776,0.00007789464,0.00054840883,0.00024983377,0.00007648607,0.00039047102,0.000060551058,0.041516747,0.0004519787,0.24661498,0.70991224,0.00004044371],"about_ca_topic_score_codex":0.0008817989,"about_ca_topic_score_gemma":0.0012001347,"teacher_disagreement_score":0.08121833,"about_ca_system_score_codex":0.0010795945,"about_ca_system_score_gemma":0.0014534282,"threshold_uncertainty_score":0.2717024},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40496695,0.0014134324,0.5552389,0.0014939533,0.00006003099,0.000043561202,0.00023138545,0.00015588847,0.036395982],"genre_scores_gemma":[0.9580366,0.00056000554,0.037256107,0.00013825767,0.000100204205,0.000044658664,0.00009110767,0.00006464027,0.00370844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915504,0.00025945532,0.00003020663,0.00019278361,0.00020687141,0.00015562681],"domain_scores_gemma":[0.99706835,0.0017031217,0.00042361396,0.00024612262,0.00034315643,0.0002156773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013573406,0.0004921601,0.00045986928,0.0011872284,0.00077476614,0.0013099031,0.00070705183,0.00071966153,0.0031647421],"category_scores_gemma":[0.004988434,0.00025976778,0.00062084646,0.0010109555,0.0027398015,0.004002104,0.0011590768,0.0013296632,0.00034561052],"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.000022192751,0.000013962542,0.0005400283,0.00003616479,0.000009550647,0.00008053438,0.00021247141,0.004638506,0.0027639337,0.9833265,0.0005998192,0.007756306],"study_design_scores_gemma":[0.0000049914556,0.000025448233,0.0004852875,0.000013006278,0.000005835058,0.00015823267,0.000109778426,0.041071035,0.0016361258,0.95459795,0.0018791095,0.0000131880615],"about_ca_topic_score_codex":0.0006685969,"about_ca_topic_score_gemma":0.00046794806,"teacher_disagreement_score":0.0031647421,"about_ca_system_score_codex":0.00088241714,"about_ca_system_score_gemma":0.00033884228,"threshold_uncertainty_score":0.010587096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010114168,0.000089871384,0.98757905,0.00014543073,0.000013634027,0.000019383147,0.000022448228,0.000054198626,0.0019617402],"genre_scores_gemma":[0.57421744,0.00066638045,0.4158548,0.00018305796,0.00013908742,0.0003262726,0.00026054407,0.00028264787,0.008069751],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985707,0.00048678575,0.000072962976,0.00030245632,0.00044365527,0.00012345314],"domain_scores_gemma":[0.99446625,0.003531771,0.00062024745,0.0006384891,0.0005034103,0.00023986993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032184997,0.0012341606,0.0014662218,0.0013006013,0.0007392295,0.0021718978,0.0015915447,0.0017904465,0.0026511236],"category_scores_gemma":[0.010359085,0.0008368555,0.001251827,0.0007097465,0.0043024938,0.005209163,0.0048600803,0.003977599,0.0006052116],"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.00007277829,0.000041655374,0.00071801856,0.0001488394,0.00004409917,0.0001718759,0.00026405032,0.24875878,0.0076476904,0.7105024,0.0011199004,0.030510006],"study_design_scores_gemma":[0.000013426217,0.00003958061,0.00014547908,0.000016612434,0.000008362908,0.000051870775,0.000039684586,0.66961724,0.0026237357,0.32586998,0.0015542028,0.000019753752],"about_ca_topic_score_codex":0.00059083995,"about_ca_topic_score_gemma":0.0005281724,"teacher_disagreement_score":0.0032184997,"about_ca_system_score_codex":0.000552212,"about_ca_system_score_gemma":0.0009950853,"threshold_uncertainty_score":0.017021239},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48374692,0.001442242,0.47717512,0.0011580654,0.00011442542,0.00010478519,0.00031940386,0.0002763637,0.035662647],"genre_scores_gemma":[0.95641273,0.0008366003,0.03773016,0.00018081038,0.0000739585,0.00007198783,0.0002011463,0.000067978704,0.004424573],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891067,0.00021323405,0.00007522876,0.00033019597,0.00025718508,0.00021340982],"domain_scores_gemma":[0.99744296,0.00082205306,0.0005840939,0.00035532186,0.00039042858,0.0004051681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021314684,0.001400023,0.001372104,0.0015410673,0.0011759424,0.0024200964,0.0009279887,0.0013803153,0.0027127475],"category_scores_gemma":[0.0061381646,0.0007188911,0.0015666836,0.0012373192,0.0030396234,0.0036758184,0.003543923,0.00205638,0.00039946224],"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.00011412417,0.000021551543,0.0016089015,0.00015978211,0.000044641696,0.00027111947,0.00026038862,0.011130721,0.006948824,0.9654074,0.0007603849,0.013272211],"study_design_scores_gemma":[0.000044828288,0.00026285384,0.00331234,0.000091644135,0.00009147159,0.0015474671,0.00046047408,0.06584332,0.018434564,0.8962595,0.013591049,0.000060405553],"about_ca_topic_score_codex":0.00054579246,"about_ca_topic_score_gemma":0.00049011374,"teacher_disagreement_score":0.0027127475,"about_ca_system_score_codex":0.0012781906,"about_ca_system_score_gemma":0.0007005782,"threshold_uncertainty_score":0.011272371},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012774296,0.0055365167,0.94977933,0.0028098738,0.0007187002,0.00019153909,0.000112659196,0.0002683533,0.027808601],"genre_scores_gemma":[0.28958187,0.010643109,0.65725535,0.0022178355,0.0013484646,0.0015211826,0.0004165636,0.0016694387,0.035346143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968033,0.0016780877,0.0001081351,0.00032871217,0.00084202574,0.00023970696],"domain_scores_gemma":[0.9796521,0.016201437,0.00055758737,0.0011359962,0.0019691496,0.0004836306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011207612,0.0030335882,0.0015248539,0.0021880069,0.0016387149,0.0018031312,0.002502606,0.0022145514,0.010761882],"category_scores_gemma":[0.03880285,0.0009934371,0.0021613108,0.0011928998,0.004901834,0.0072421823,0.0052123466,0.008771203,0.0020592825],"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.00059065054,0.00019701864,0.0020174615,0.00085450767,0.00017920029,0.00039120455,0.0005515446,0.12638244,0.008224246,0.75386137,0.016234593,0.09051582],"study_design_scores_gemma":[0.00006156947,0.00010951625,0.0004887404,0.00022072185,0.00004488284,0.00021006363,0.00008156692,0.80070496,0.003247794,0.18763891,0.0071149063,0.00007637806],"about_ca_topic_score_codex":0.0044787945,"about_ca_topic_score_gemma":0.0046801628,"teacher_disagreement_score":0.011207612,"about_ca_system_score_codex":0.0017479705,"about_ca_system_score_gemma":0.0018680042,"threshold_uncertainty_score":0.05927223},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027050452,0.00045802206,0.9603184,0.0003182939,0.00007839114,0.00013099132,0.00014458601,0.00006129179,0.011439533],"genre_scores_gemma":[0.7300154,0.0012634199,0.25240025,0.0002464221,0.00014618452,0.0006804062,0.00043162392,0.000074037795,0.014742228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992723,0.0002324206,0.0000537416,0.0001881801,0.00018066133,0.00007265548],"domain_scores_gemma":[0.9992291,0.00037889936,0.00012682193,0.0000488874,0.00016085885,0.000055468947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017146236,0.00164358,0.001070072,0.0008306056,0.00047338344,0.0015610846,0.0009929049,0.0012128656,0.0019583278],"category_scores_gemma":[0.003165955,0.00039762948,0.0007526944,0.0005797178,0.0011436456,0.0014135574,0.0012978115,0.0018348073,0.0001916099],"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.00006361113,0.000117494325,0.000832253,0.00026872262,0.000054068445,0.000442942,0.00013690915,0.4221285,0.0064871344,0.51607,0.0021470364,0.051251248],"study_design_scores_gemma":[0.000019541507,0.00006213679,0.00027852983,0.00003135233,0.000011496946,0.00011721103,0.000038753824,0.87035775,0.0011672074,0.12489706,0.0030043563,0.000014658346],"about_ca_topic_score_codex":0.0008873153,"about_ca_topic_score_gemma":0.0005761912,"teacher_disagreement_score":0.0019583278,"about_ca_system_score_codex":0.0009940247,"about_ca_system_score_gemma":0.0010302279,"threshold_uncertainty_score":0.009067893},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13688026,0.010502955,0.7287768,0.0046751704,0.00072599325,0.00011209921,0.00044101462,0.00020857403,0.11767715],"genre_scores_gemma":[0.8397352,0.0076380004,0.09574856,0.0013101262,0.00082005706,0.00023779097,0.00034362052,0.00028078165,0.053885885],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992729,0.00022058522,0.000040681225,0.00017532747,0.00020538794,0.00008515607],"domain_scores_gemma":[0.99788564,0.0012666043,0.00016348621,0.00014747032,0.000342866,0.00019398514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029161118,0.001419076,0.001419591,0.0026627951,0.0014808407,0.00286936,0.0020296017,0.0020697126,0.0053595225],"category_scores_gemma":[0.008563406,0.00070879346,0.002004119,0.0022822958,0.0030516016,0.0047772257,0.002853134,0.004515527,0.00043814417],"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.000018492638,0.000010526894,0.00010286801,0.00006874001,0.000014760091,0.000045491954,0.00012467358,0.0022871792,0.0007287408,0.99144167,0.0007994627,0.004357289],"study_design_scores_gemma":[0.000013778975,0.000038882867,0.0002896558,0.000037840382,0.000024699995,0.000116218376,0.00006399461,0.018720081,0.00065546355,0.9762967,0.0037210297,0.000021613689],"about_ca_topic_score_codex":0.0013767725,"about_ca_topic_score_gemma":0.0012836606,"teacher_disagreement_score":0.0053595225,"about_ca_system_score_codex":0.0025617527,"about_ca_system_score_gemma":0.001004747,"threshold_uncertainty_score":0.018586874},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32120302,0.0008806184,0.6516709,0.0008618128,0.00024665706,0.00009220545,0.00018439764,0.00023453603,0.024625892],"genre_scores_gemma":[0.8981104,0.0005061035,0.090454936,0.00023105746,0.0002804383,0.00016919282,0.00018533313,0.0001643988,0.009898197],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99620456,0.00090057304,0.00026537292,0.0008546889,0.0012481626,0.00052665995],"domain_scores_gemma":[0.9927942,0.0037596403,0.0007296466,0.0003221383,0.0011431273,0.0012511641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038211772,0.0012627123,0.0012738258,0.0024108514,0.0014430459,0.0031149744,0.00156494,0.0010963336,0.003215275],"category_scores_gemma":[0.009196222,0.0007811733,0.002239927,0.00096074876,0.0042967554,0.005813964,0.0060917474,0.00325996,0.0003570942],"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.00015412415,0.000036602734,0.00074807426,0.00014739146,0.00008995504,0.00039428225,0.0004619645,0.0042178975,0.0147818,0.971115,0.00046206187,0.007390819],"study_design_scores_gemma":[0.000024235742,0.00014122696,0.00042637455,0.000032085958,0.000043202574,0.00051416125,0.00018748704,0.04932338,0.009205244,0.9378892,0.0021635448,0.000049793245],"about_ca_topic_score_codex":0.00029926063,"about_ca_topic_score_gemma":0.00024540036,"teacher_disagreement_score":0.0038211772,"about_ca_system_score_codex":0.0011888836,"about_ca_system_score_gemma":0.00083910284,"threshold_uncertainty_score":0.020208597},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023887663,0.0000583971,0.9969387,0.00003377007,0.000018976238,0.000025937094,0.0000062384047,0.000034606233,0.00049467763],"genre_scores_gemma":[0.12687962,0.00015849553,0.8700334,0.000086339925,0.00007860185,0.00021289011,0.00010181472,0.000094459494,0.0023542852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986842,0.00044337707,0.00009903057,0.00025533463,0.000426846,0.00009114567],"domain_scores_gemma":[0.9987398,0.0006728778,0.00010770963,0.00011879978,0.0002748684,0.00008595111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025865606,0.00086513604,0.0012659125,0.0010728453,0.0006385415,0.001330586,0.0019147687,0.0018509941,0.0032697187],"category_scores_gemma":[0.005471877,0.0005455753,0.001076817,0.0007769991,0.0010658595,0.002345749,0.0026235112,0.0024792582,0.00062652584],"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.00025541836,0.00016908605,0.0008317343,0.00032796603,0.0001587968,0.00034824447,0.000504253,0.2838812,0.016901331,0.51903254,0.0022922265,0.17529725],"study_design_scores_gemma":[0.000022447708,0.00005324295,0.000039796778,0.000011167431,0.0000078078265,0.00004847456,0.000014059612,0.97341913,0.0011685401,0.023784755,0.0014192943,0.000011254396],"about_ca_topic_score_codex":0.0011173163,"about_ca_topic_score_gemma":0.0009258126,"teacher_disagreement_score":0.0032697187,"about_ca_system_score_codex":0.00067982764,"about_ca_system_score_gemma":0.0011238562,"threshold_uncertainty_score":0.013679206},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020787055,0.00040391093,0.96593314,0.0007694944,0.0001364256,0.000043788685,0.000065186236,0.000034298948,0.01182661],"genre_scores_gemma":[0.68135726,0.001222191,0.29554027,0.00038638193,0.00049934513,0.00040037103,0.0002800526,0.00013362314,0.020180525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880004,0.0005411647,0.000045297773,0.00019052769,0.00029410218,0.00012897282],"domain_scores_gemma":[0.9984205,0.0009378021,0.00016174123,0.000101160265,0.00019619575,0.00018266469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025260132,0.0012977979,0.0010808535,0.0013073855,0.0007836094,0.0030366383,0.0010452066,0.0018212082,0.0032613287],"category_scores_gemma":[0.004387587,0.0006133307,0.0018787517,0.0010024722,0.0024886287,0.003113038,0.002534288,0.003881717,0.0003328885],"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.000034292443,0.000065862434,0.00024409329,0.00010643936,0.00002768482,0.00012692726,0.00010068215,0.05764691,0.001135062,0.9304939,0.0010353659,0.0089828],"study_design_scores_gemma":[0.00002285273,0.000088723464,0.00016547595,0.000046326386,0.000018328357,0.00018706266,0.00009498933,0.5232909,0.0008564618,0.47146776,0.0037364915,0.000024559053],"about_ca_topic_score_codex":0.0007999773,"about_ca_topic_score_gemma":0.00064049946,"teacher_disagreement_score":0.0032613287,"about_ca_system_score_codex":0.0019613358,"about_ca_system_score_gemma":0.0017869304,"threshold_uncertainty_score":0.014230549},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027873438,0.0011024036,0.95679134,0.00091839297,0.00030765476,0.0001426383,0.00011027312,0.00016152696,0.012592236],"genre_scores_gemma":[0.4604481,0.0016896421,0.5222361,0.0008164803,0.00038934773,0.00054334593,0.00044390612,0.0008694352,0.012563636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99592626,0.0020369098,0.0002340191,0.00048226342,0.00092230504,0.0003982635],"domain_scores_gemma":[0.97313243,0.020417819,0.0008492875,0.0013584201,0.0032879806,0.0009540167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015540095,0.0019018975,0.0028324595,0.0030859855,0.0015834958,0.0031129492,0.0038333992,0.0039161774,0.008102413],"category_scores_gemma":[0.052586876,0.001273309,0.0028598527,0.0022808262,0.007578131,0.006649023,0.0058450736,0.0076460945,0.0012237121],"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.00050211727,0.0001264046,0.0008004918,0.0004096454,0.000095828116,0.00020616602,0.00047423408,0.18840271,0.004490339,0.7706927,0.0036412857,0.030158054],"study_design_scores_gemma":[0.0000716298,0.0001727076,0.00028507863,0.00010654646,0.00002437007,0.000076005585,0.000078173805,0.8083875,0.002077509,0.18657725,0.0020787327,0.00006447122],"about_ca_topic_score_codex":0.0067364336,"about_ca_topic_score_gemma":0.0053526894,"teacher_disagreement_score":0.015540095,"about_ca_system_score_codex":0.002050204,"about_ca_system_score_gemma":0.0037530577,"threshold_uncertainty_score":0.08218485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060242906,0.0013128141,0.9080439,0.0020241265,0.00048262716,0.000091425056,0.00012438561,0.00024619358,0.027431546],"genre_scores_gemma":[0.54382,0.0016119545,0.41932616,0.000997106,0.0004987139,0.00018738622,0.00033767754,0.0010797975,0.032141153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99756145,0.0013647672,0.000090747424,0.00016572428,0.0005594928,0.00025783383],"domain_scores_gemma":[0.98516417,0.01039078,0.00048473716,0.0013950375,0.0017832221,0.0007820266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008390945,0.0008866684,0.001071424,0.0012850338,0.0014003122,0.0026931828,0.0018693525,0.001992389,0.006277263],"category_scores_gemma":[0.026056608,0.00067049847,0.00073050894,0.0010530525,0.0034233627,0.004229241,0.0020926422,0.0042400127,0.0011686744],"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.0002813592,0.00008225798,0.00095034274,0.00010457794,0.00001776048,0.00005893116,0.00019835454,0.063323185,0.0022252619,0.90386,0.0031966565,0.025701344],"study_design_scores_gemma":[0.000053281095,0.000095611635,0.0003555874,0.000057440695,0.000015174687,0.00004891722,0.00005952518,0.55723906,0.0020542233,0.43611115,0.0038739357,0.00003611494],"about_ca_topic_score_codex":0.005853076,"about_ca_topic_score_gemma":0.0071466086,"teacher_disagreement_score":0.008390945,"about_ca_system_score_codex":0.0019554454,"about_ca_system_score_gemma":0.0030857949,"threshold_uncertainty_score":0.044376135},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3377586,0.0076357666,0.5432878,0.003071491,0.0001802566,0.00004391558,0.00017279864,0.00022157417,0.107627876],"genre_scores_gemma":[0.9463241,0.0018424446,0.043204278,0.0003392719,0.00021588276,0.000065035485,0.000088766574,0.00010882091,0.007811333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988631,0.00040327973,0.000047059093,0.00018573542,0.0003692096,0.00013161512],"domain_scores_gemma":[0.9968245,0.0022159554,0.00020841883,0.00014982867,0.00037676716,0.00022451188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029572798,0.0005066485,0.0006569871,0.0013676612,0.00089064165,0.0018000853,0.0007735537,0.00093549944,0.002549394],"category_scores_gemma":[0.0068471846,0.00033403933,0.00057178986,0.0005835284,0.0032763118,0.00313611,0.0022229902,0.0020251116,0.00040986686],"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.00003405897,0.000010776606,0.0003201145,0.000047263566,0.0000061866604,0.00009679254,0.0001797338,0.0056062303,0.0031962828,0.98349553,0.0004918752,0.0065151546],"study_design_scores_gemma":[0.000014451111,0.000054114334,0.00042893147,0.00005225071,0.000007850522,0.00019958089,0.00015351202,0.055942163,0.002121355,0.93756044,0.0034386113,0.000026790045],"about_ca_topic_score_codex":0.0006593566,"about_ca_topic_score_gemma":0.00032938216,"teacher_disagreement_score":0.0029572798,"about_ca_system_score_codex":0.0008157778,"about_ca_system_score_gemma":0.00053401216,"threshold_uncertainty_score":0.015639782},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2684907,0.0016437436,0.71309453,0.0004788407,0.00022223005,0.00009629854,0.000056540583,0.00013880567,0.015778296],"genre_scores_gemma":[0.9055471,0.00081207044,0.073120676,0.00010278272,0.00009632843,0.00020818949,0.0000763774,0.00011479107,0.01992172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864227,0.00056144834,0.00010116711,0.00016644075,0.00041324878,0.00011549096],"domain_scores_gemma":[0.9930975,0.0038919859,0.0007658748,0.00030046335,0.0015670118,0.00037727077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034638892,0.0015899802,0.0011185671,0.00172445,0.0009263879,0.0021505952,0.001890143,0.0017670383,0.0026976806],"category_scores_gemma":[0.016024394,0.00061930896,0.0010994131,0.0009628774,0.0029059916,0.0024524003,0.0027252587,0.0015993644,0.00040230513],"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.0008640734,0.00010715132,0.0017089241,0.000420042,0.00018306264,0.00041928003,0.0014741368,0.3484146,0.019619517,0.5954777,0.0007731751,0.030538423],"study_design_scores_gemma":[0.000040807554,0.00022907725,0.00040027944,0.000043201242,0.000026723941,0.00012116643,0.00015078083,0.8441842,0.0050950376,0.14860527,0.0010536955,0.000049775903],"about_ca_topic_score_codex":0.0021969217,"about_ca_topic_score_gemma":0.0010575509,"teacher_disagreement_score":0.0034638892,"about_ca_system_score_codex":0.0017065583,"about_ca_system_score_gemma":0.0013193853,"threshold_uncertainty_score":0.01831907},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05141627,0.0015800662,0.927292,0.0014788815,0.0004715158,0.00014161048,0.00031509192,0.000099272445,0.017205345],"genre_scores_gemma":[0.7506441,0.0027403983,0.2103796,0.0016046063,0.00081600057,0.00073116954,0.00074957847,0.00023758311,0.032097008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978446,0.00084084837,0.00015057476,0.00035542,0.0005691596,0.0002394074],"domain_scores_gemma":[0.9950836,0.0025511915,0.0004755388,0.00025057056,0.0010543582,0.0005847933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005540887,0.0022269387,0.0015932446,0.0017752167,0.0011510015,0.0036688903,0.0028248995,0.0020815092,0.0072494606],"category_scores_gemma":[0.008119069,0.0009960819,0.002084727,0.0014020636,0.003152906,0.005765919,0.0044093323,0.004776487,0.0004981485],"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.00013997356,0.000052651772,0.00042671475,0.00025928524,0.000076922675,0.0001915892,0.00027919834,0.018226624,0.006118405,0.966055,0.0011530834,0.0070205275],"study_design_scores_gemma":[0.0000510685,0.000115833165,0.0006616642,0.000058835005,0.000038471328,0.00020379057,0.00016660009,0.48619246,0.0012950697,0.5091941,0.001974078,0.000048105994],"about_ca_topic_score_codex":0.002641899,"about_ca_topic_score_gemma":0.0029402087,"teacher_disagreement_score":0.0072494606,"about_ca_system_score_codex":0.0025040659,"about_ca_system_score_gemma":0.0019461003,"threshold_uncertainty_score":0.029303372},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8093391,0.0002774595,0.122398816,0.00088514853,0.000118327065,0.000056597608,0.00026173613,0.0003485135,0.066314325],"genre_scores_gemma":[0.9888509,0.00008063863,0.0051629376,0.00005351994,0.00002160795,0.000024059063,0.00008714668,0.000049206094,0.0056700637],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998628,0.000021238458,0.0000045804536,0.000022343635,0.00004272664,0.000046460424],"domain_scores_gemma":[0.99962986,0.000088840075,0.000067959736,0.00004867598,0.000080325255,0.00008440024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023968368,0.0003375888,0.00037078527,0.00077160605,0.0010160978,0.0010663134,0.0003360954,0.00056495576,0.0050126547],"category_scores_gemma":[0.0012562709,0.00020741227,0.00029494672,0.0002014735,0.0016639932,0.0009790078,0.0013991778,0.0009134432,0.00047607144],"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.000077538345,0.000018484821,0.0009819523,0.000033126562,0.000008924476,0.00021857819,0.00017213367,0.018302392,0.0062826285,0.9666845,0.0015963364,0.005623444],"study_design_scores_gemma":[0.000040533552,0.00012035286,0.001802055,0.00005577671,0.000010854301,0.00028194068,0.0002674114,0.21928154,0.005010014,0.76603305,0.0070731933,0.000023239665],"about_ca_topic_score_codex":0.0021843174,"about_ca_topic_score_gemma":0.0014856106,"teacher_disagreement_score":0.0050126547,"about_ca_system_score_codex":0.001065604,"about_ca_system_score_gemma":0.00057408726,"threshold_uncertainty_score":0.016769052},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35430777,0.0013734978,0.588415,0.0008593432,0.00019316247,0.00007561589,0.0002127129,0.00019840054,0.054364543],"genre_scores_gemma":[0.93674797,0.00085283763,0.0451803,0.00022043438,0.00023948586,0.00013651884,0.00026335454,0.0000875751,0.016271532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915564,0.00014089086,0.00004365103,0.00017512661,0.0003012697,0.00018347074],"domain_scores_gemma":[0.99805105,0.0009243653,0.00030636767,0.00012484884,0.00039868083,0.00019472613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012715989,0.0011643675,0.0005068538,0.0016118838,0.00097017974,0.0023916846,0.000997646,0.00091025507,0.004293056],"category_scores_gemma":[0.0063991807,0.0003246447,0.000608211,0.0012523654,0.0015099123,0.0034924336,0.0020867158,0.002145978,0.0004779673],"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.00006160238,0.00002849119,0.000463826,0.000043043518,0.000017523642,0.00008635653,0.000106546424,0.0035103902,0.005848302,0.9772917,0.00081106165,0.011731056],"study_design_scores_gemma":[0.00002931127,0.00005136082,0.00059340894,0.000027889982,0.000018982115,0.0002500079,0.000100936435,0.07786273,0.00331967,0.913253,0.004465818,0.000026934087],"about_ca_topic_score_codex":0.000516121,"about_ca_topic_score_gemma":0.00032770925,"teacher_disagreement_score":0.004293056,"about_ca_system_score_codex":0.0010067803,"about_ca_system_score_gemma":0.00044001045,"threshold_uncertainty_score":0.01436168},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006662538,0.0016728761,0.9633126,0.0014682984,0.00023978043,0.00004252521,0.00013770918,0.000041604977,0.026422076],"genre_scores_gemma":[0.46657988,0.007292027,0.44425347,0.0009854884,0.0012208716,0.0006607394,0.00065575005,0.0003217749,0.07802992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991266,0.00040454994,0.00003379677,0.00010426791,0.00023966905,0.000091118236],"domain_scores_gemma":[0.99897456,0.00049698603,0.000084333165,0.000118151285,0.0002262577,0.0000996835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024927217,0.0013966935,0.0014299224,0.0017692635,0.0006638074,0.0027925288,0.0013149275,0.0014122461,0.006410497],"category_scores_gemma":[0.0049206656,0.00069730176,0.0011073754,0.0013995736,0.0020707932,0.003103632,0.0019892901,0.004199848,0.0009646156],"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.000006887171,0.000012333523,0.00004353702,0.000023020575,0.000011063958,0.00001188233,0.000024567493,0.008381386,0.00017962421,0.98331773,0.001303101,0.0066848793],"study_design_scores_gemma":[0.000005277251,0.000004585008,0.000052418618,0.000012478507,0.000004229115,0.000012309992,0.00001189213,0.08845884,0.00008763569,0.9089923,0.0023540426,0.0000040104046],"about_ca_topic_score_codex":0.0019263772,"about_ca_topic_score_gemma":0.00175108,"teacher_disagreement_score":0.006410497,"about_ca_system_score_codex":0.0019568307,"about_ca_system_score_gemma":0.0018693348,"threshold_uncertainty_score":0.021445274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022951404,0.0010383845,0.9674874,0.0010909192,0.00012671086,0.000056965582,0.00006874619,0.00007170759,0.0071077566],"genre_scores_gemma":[0.59228003,0.004021142,0.38441822,0.00042121598,0.0005176543,0.00042698256,0.00028715984,0.00037454435,0.017253112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983398,0.00089219125,0.000054394648,0.0002906588,0.00026594297,0.00015695275],"domain_scores_gemma":[0.994303,0.004068596,0.00031309048,0.00018603573,0.0006748883,0.0004544479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005060493,0.0014937758,0.001959081,0.0018069794,0.00085636444,0.0031130724,0.0021045865,0.003168778,0.0042232694],"category_scores_gemma":[0.022496141,0.0013243386,0.0013621749,0.0016149922,0.0039803847,0.005008316,0.0028997092,0.0034781331,0.0006399058],"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.00013934585,0.00008204386,0.00029619326,0.0003010654,0.00008482834,0.000049469647,0.00021959151,0.25772548,0.0014857618,0.71462756,0.0027766067,0.022212043],"study_design_scores_gemma":[0.000026277046,0.00006326735,0.00014369709,0.00005421078,0.000028140576,0.000042138505,0.00006857187,0.6417463,0.00079725817,0.35535762,0.0016401837,0.000032417076],"about_ca_topic_score_codex":0.002234946,"about_ca_topic_score_gemma":0.0015338201,"teacher_disagreement_score":0.005060493,"about_ca_system_score_codex":0.0023746465,"about_ca_system_score_gemma":0.0031104183,"threshold_uncertainty_score":0.026762784},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025204156,0.00071442255,0.9661055,0.0004876961,0.00014282428,0.000081676066,0.000054819815,0.00009967975,0.00710924],"genre_scores_gemma":[0.7325783,0.0021093693,0.23491195,0.00078104186,0.0005652679,0.0008944265,0.0002259747,0.00033809198,0.027595501],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976042,0.0011517046,0.000106386986,0.00025534595,0.0007069351,0.0001754557],"domain_scores_gemma":[0.9940142,0.0034724507,0.00035687137,0.0003818499,0.0013398473,0.0004347291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007646779,0.0013839101,0.0010968173,0.0020041943,0.0009807289,0.0016483143,0.0017392824,0.0011472333,0.003865849],"category_scores_gemma":[0.010372248,0.0005549915,0.0022946172,0.0007335323,0.0036162538,0.0036733325,0.0053722877,0.004051855,0.0004065731],"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.00009012193,0.000033133147,0.0006955787,0.00024995152,0.000104150895,0.00012900805,0.00035472243,0.02880333,0.006613999,0.949734,0.00082130043,0.012370691],"study_design_scores_gemma":[0.000046463327,0.00030272047,0.0006359263,0.00007218652,0.000055984146,0.0002013657,0.00013494746,0.50176793,0.0031411585,0.48984003,0.0037599711,0.00004142991],"about_ca_topic_score_codex":0.0011079626,"about_ca_topic_score_gemma":0.0007718623,"teacher_disagreement_score":0.007646779,"about_ca_system_score_codex":0.0015338134,"about_ca_system_score_gemma":0.001433524,"threshold_uncertainty_score":0.04044056},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003546628,0.0003107673,0.98323774,0.00026106287,0.000105360516,0.000033995148,0.000031898893,0.00006132685,0.012411224],"genre_scores_gemma":[0.2606926,0.0019934291,0.7108202,0.0004094327,0.00049476605,0.0004922521,0.00022150858,0.00021018124,0.024665605],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912864,0.00046538754,0.000022763947,0.00009402795,0.00020936271,0.000079780926],"domain_scores_gemma":[0.9996333,0.00012372294,0.000028801185,0.000037866896,0.00013675292,0.00003946816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015318218,0.0011308467,0.00065578474,0.00085898733,0.000616899,0.0016023101,0.0009282743,0.00080780184,0.0053988104],"category_scores_gemma":[0.0020902397,0.00044224778,0.0009338408,0.00084215513,0.0015775813,0.0014499582,0.002093993,0.0024732065,0.0012423925],"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.000022701935,0.0000550614,0.00018371013,0.00008286231,0.000019870535,0.000054243486,0.00008957322,0.09324308,0.0010636216,0.8759496,0.0032032237,0.026032496],"study_design_scores_gemma":[0.000018156019,0.000060251416,0.00006731449,0.000022819535,0.000008579913,0.00007265913,0.00004596074,0.6865814,0.00094871636,0.3039422,0.00821633,0.00001566398],"about_ca_topic_score_codex":0.0014008965,"about_ca_topic_score_gemma":0.0018010812,"teacher_disagreement_score":0.0053988104,"about_ca_system_score_codex":0.00078856375,"about_ca_system_score_gemma":0.0016569211,"threshold_uncertainty_score":0.018060803},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007673501,0.0001388222,0.9972458,0.000060514274,0.000046091875,0.000014093511,0.000054555196,0.00009322072,0.0015796431],"genre_scores_gemma":[0.116380684,0.0012249105,0.8612411,0.00036281784,0.00026049744,0.00028656062,0.0005335282,0.00060891797,0.01910095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908113,0.00031245482,0.00003826318,0.00021374771,0.00026670296,0.000087805085],"domain_scores_gemma":[0.998643,0.00059619884,0.00010638834,0.00028476806,0.00025362987,0.00011609365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018373802,0.0009467762,0.0016428893,0.00093515054,0.0006214977,0.0012763604,0.0027047945,0.001451518,0.0076284735],"category_scores_gemma":[0.0047140317,0.0009915044,0.0018761258,0.001166269,0.0013000267,0.001976754,0.0029554777,0.002593788,0.0023580012],"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.000066593624,0.00007617309,0.0005700081,0.00024122754,0.00008252952,0.00015373775,0.00017317556,0.3794133,0.0055742366,0.51689714,0.0071734935,0.0895785],"study_design_scores_gemma":[0.000009527352,0.000023421164,0.00008473612,0.000025189238,0.000017644692,0.000056807392,0.000012781462,0.9341551,0.0005352392,0.056993593,0.008069344,0.00001672978],"about_ca_topic_score_codex":0.009109749,"about_ca_topic_score_gemma":0.0072932397,"teacher_disagreement_score":0.009109749,"about_ca_system_score_codex":0.0007820108,"about_ca_system_score_gemma":0.0019087283,"threshold_uncertainty_score":0.025519788},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45722127,0.0012554042,0.47590488,0.0020507115,0.00012566325,0.00014581016,0.00056675693,0.0004010927,0.062328354],"genre_scores_gemma":[0.95942897,0.0006439461,0.030853847,0.00017850999,0.00012078014,0.00013262598,0.0004944216,0.00010234223,0.008044599],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937916,0.00011324609,0.000031243137,0.00019052565,0.00015672467,0.00012901227],"domain_scores_gemma":[0.9991167,0.00031402172,0.00010834132,0.00006391724,0.00026175167,0.00013520032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000805768,0.00064114685,0.00067828037,0.0012750778,0.00091921864,0.0014334803,0.0007091492,0.0012188919,0.004786837],"category_scores_gemma":[0.0033370086,0.0003393765,0.00052814727,0.000708291,0.0012702987,0.0022350322,0.001479075,0.0012680932,0.00048864156],"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.00025103122,0.00010442118,0.003864712,0.00027445648,0.000054761153,0.00055086927,0.0003362881,0.06544655,0.018891819,0.8683413,0.005587675,0.03629597],"study_design_scores_gemma":[0.00008779976,0.0002047887,0.0039521614,0.00009641979,0.00005853066,0.000633935,0.00026236122,0.5407671,0.009043284,0.42985308,0.014992792,0.00004787956],"about_ca_topic_score_codex":0.0018733926,"about_ca_topic_score_gemma":0.001176023,"teacher_disagreement_score":0.004786837,"about_ca_system_score_codex":0.0012909871,"about_ca_system_score_gemma":0.00088247773,"threshold_uncertainty_score":0.016013622},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025322915,0.00024033905,0.99456364,0.00013697203,0.00010212373,0.00005237653,0.000055046352,0.00047576652,0.0018415138],"genre_scores_gemma":[0.03781828,0.00022282281,0.95776993,0.00012785246,0.000092367925,0.00025060863,0.0002843589,0.0003318314,0.0031018588],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990421,0.00027615146,0.000058003192,0.00013687096,0.00039311993,0.00009372429],"domain_scores_gemma":[0.9985051,0.0007542033,0.00007002623,0.00012880901,0.0004310315,0.00011085113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017340719,0.0017405289,0.003278204,0.0017588774,0.001101937,0.0022460844,0.0024663224,0.002894373,0.009772832],"category_scores_gemma":[0.004286913,0.0015511955,0.0011056666,0.00260859,0.00095009257,0.0026050678,0.0027267286,0.0041346415,0.0017198381],"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.00046033153,0.000458022,0.00055415253,0.00035030898,0.00017657901,0.00012666966,0.00011848003,0.37055394,0.0036693392,0.058670834,0.015098293,0.5497631],"study_design_scores_gemma":[0.00007211687,0.000038458664,0.000046112076,0.000018010229,0.000016145083,0.000028271661,0.000009559443,0.9813033,0.0005293069,0.015638271,0.002290407,0.000010078783],"about_ca_topic_score_codex":0.003200371,"about_ca_topic_score_gemma":0.0051524686,"teacher_disagreement_score":0.009772832,"about_ca_system_score_codex":0.00097130996,"about_ca_system_score_gemma":0.0023121212,"threshold_uncertainty_score":0.032693386},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0086140195,0.0045569944,0.9541401,0.0011434326,0.0002381932,0.000034824498,0.0001645113,0.00009898359,0.031008998],"genre_scores_gemma":[0.5949412,0.020050768,0.3463362,0.0013046408,0.0031249465,0.00046581923,0.00052487396,0.00031736773,0.032934204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987109,0.00040380837,0.00007549383,0.00029148647,0.00041455953,0.00010375781],"domain_scores_gemma":[0.9981951,0.0010405176,0.0001253802,0.00017602197,0.0003424079,0.00012050649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002708011,0.00086487224,0.0011909674,0.0026679945,0.0013401054,0.003409613,0.0018680504,0.0017021324,0.0045233984],"category_scores_gemma":[0.006161282,0.00058490434,0.0011005003,0.0028329971,0.004432963,0.0061809137,0.0028920346,0.0031977969,0.0012465988],"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.000003166766,0.0000041963,0.00006176476,0.00003388599,0.0000063711436,0.00001805561,0.000042216867,0.0032824455,0.000117154384,0.99075073,0.0005877896,0.0050921906],"study_design_scores_gemma":[0.000003487433,0.000016567375,0.00010524895,0.00002510353,0.000007399383,0.000077349694,0.00002939525,0.028451024,0.00022565121,0.9605867,0.010461362,0.000010683672],"about_ca_topic_score_codex":0.0011676202,"about_ca_topic_score_gemma":0.0005924081,"teacher_disagreement_score":0.0045233984,"about_ca_system_score_codex":0.0018440562,"about_ca_system_score_gemma":0.0009596564,"threshold_uncertainty_score":0.015132248},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064045705,0.00068558694,0.91754764,0.00094873237,0.00017579677,0.00008667998,0.00008854601,0.0001130973,0.016308097],"genre_scores_gemma":[0.583788,0.0011466396,0.3905431,0.000663933,0.0003297129,0.00040393308,0.00024390117,0.0002187532,0.022662032],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985415,0.0005727694,0.00007153956,0.00024235516,0.00040595914,0.00016594121],"domain_scores_gemma":[0.99877065,0.0005716647,0.00015876582,0.0000976008,0.0002449758,0.00015633318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002490104,0.001423216,0.00097280205,0.0013037303,0.000666259,0.0019578573,0.0012553105,0.0021418454,0.0037256393],"category_scores_gemma":[0.005452196,0.00048673886,0.001457435,0.000678634,0.0033419523,0.0030237527,0.0034636785,0.0025272425,0.00041500627],"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.000028570963,0.000022805623,0.00018770265,0.00009008889,0.000026485379,0.00013621074,0.0001548056,0.023418192,0.0037450956,0.96294415,0.0008529254,0.008392821],"study_design_scores_gemma":[0.00002168896,0.000048596237,0.00009081467,0.00002856218,0.000010409872,0.00014048906,0.00010467059,0.21433245,0.00095303106,0.781947,0.0022934112,0.000028928918],"about_ca_topic_score_codex":0.00069463643,"about_ca_topic_score_gemma":0.0005921684,"teacher_disagreement_score":0.0037256393,"about_ca_system_score_codex":0.0009926732,"about_ca_system_score_gemma":0.0010504989,"threshold_uncertainty_score":0.01316911},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10644591,0.002323154,0.8407101,0.0030131338,0.00034159955,0.00010101487,0.000468199,0.00025666517,0.046340253],"genre_scores_gemma":[0.7186374,0.0021188664,0.2362932,0.000994219,0.0006562987,0.00033800022,0.0009410616,0.00067570753,0.039345212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975672,0.0009775555,0.00009162486,0.0003498697,0.0007562138,0.00025765243],"domain_scores_gemma":[0.99304223,0.0035730682,0.00051188475,0.00079510326,0.0013650508,0.0007127127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004564675,0.0010680509,0.001762232,0.004385989,0.0026965917,0.0038393969,0.003242565,0.0029199077,0.00965825],"category_scores_gemma":[0.019526588,0.00077246793,0.0012098236,0.0020507523,0.004587194,0.0060319235,0.005101534,0.0061126654,0.0019229293],"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.000028879871,0.000012925414,0.00008465218,0.00001804986,0.0000076361475,0.0000123426935,0.000049804945,0.004933993,0.00030284424,0.9891344,0.0008493647,0.0045650667],"study_design_scores_gemma":[0.000014644433,0.000017468517,0.00015206808,0.00002088978,0.0000058854657,0.000034493456,0.000043506785,0.0664835,0.0004277472,0.93035066,0.0024241642,0.000024900115],"about_ca_topic_score_codex":0.0037199936,"about_ca_topic_score_gemma":0.0023866924,"teacher_disagreement_score":0.00965825,"about_ca_system_score_codex":0.003379364,"about_ca_system_score_gemma":0.0017173192,"threshold_uncertainty_score":0.03231007},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.097358026,0.0011029,0.87293404,0.0012935338,0.00012581005,0.000060704642,0.00020274788,0.000091973,0.026830342],"genre_scores_gemma":[0.7986386,0.0010126752,0.18886945,0.00026036808,0.00021638798,0.00017222103,0.00022397086,0.00010052319,0.010505927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993156,0.00028778074,0.000028960952,0.00011628867,0.0001494407,0.00010203769],"domain_scores_gemma":[0.9992461,0.0004988631,0.00007915934,0.0000515506,0.000082043014,0.00004214706],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00179079,0.0009027433,0.0010205596,0.0005319638,0.0008031937,0.0023314361,0.0005958666,0.001278195,0.0032581883],"category_scores_gemma":[0.0038919304,0.00047040475,0.000611611,0.000720644,0.0016922164,0.0024032977,0.0014500736,0.0019437381,0.00021021033],"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.00018981918,0.000089927045,0.0005043765,0.0001902683,0.000040503157,0.00018754655,0.000116777366,0.1397333,0.003866361,0.8247907,0.002544543,0.027745856],"study_design_scores_gemma":[0.000025285575,0.00005878091,0.0003114374,0.000045340614,0.000012302984,0.00013562696,0.000061899904,0.56863266,0.002421091,0.4235448,0.004735718,0.0000150479045],"about_ca_topic_score_codex":0.0010531815,"about_ca_topic_score_gemma":0.0009067264,"teacher_disagreement_score":0.0032581883,"about_ca_system_score_codex":0.001208369,"about_ca_system_score_gemma":0.0009715659,"threshold_uncertainty_score":0.010899782},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037588575,0.42037314,0.5446454,0.0035847041,0.0005874702,0.00007505934,0.0003462503,0.0004048547,0.026224203],"genre_scores_gemma":[0.067457005,0.61249566,0.30126408,0.0016693403,0.0034517008,0.00024786562,0.0012187551,0.00062499393,0.011570564],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982687,0.00049266824,0.00016539669,0.0004616823,0.0005173842,0.000094057024],"domain_scores_gemma":[0.99683136,0.0021726177,0.00011333104,0.00031566375,0.00046355915,0.00010348396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026091014,0.0017523109,0.0032907266,0.002194519,0.0008091701,0.0049182544,0.0023396183,0.002221325,0.00521886],"category_scores_gemma":[0.005621284,0.0016485763,0.0015571119,0.007537689,0.0014700274,0.0053350916,0.003097742,0.0045090434,0.002653187],"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.00009892738,0.00038498087,0.0014434939,0.003838329,0.00020246033,0.00008111071,0.00016549818,0.024264641,0.00057565735,0.1926196,0.02262275,0.7537026],"study_design_scores_gemma":[0.000068506735,0.00026509524,0.0015008274,0.0017225196,0.00017091399,0.00080681226,0.00033046628,0.16874075,0.0016806666,0.54010755,0.28449243,0.00011351014],"about_ca_topic_score_codex":0.0015083065,"about_ca_topic_score_gemma":0.0014825475,"teacher_disagreement_score":0.00521886,"about_ca_system_score_codex":0.0009416775,"about_ca_system_score_gemma":0.0017218221,"threshold_uncertainty_score":0.017458856},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15371953,0.0009578491,0.80063593,0.0008312438,0.00008710185,0.00008812783,0.00040798384,0.00026917394,0.04300295],"genre_scores_gemma":[0.88278675,0.0012625675,0.100439146,0.0004019403,0.00032137873,0.00024979995,0.0005931445,0.00022364542,0.013721512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882084,0.00047318972,0.00006639014,0.00017676908,0.00028542543,0.00017728283],"domain_scores_gemma":[0.9976254,0.0010114224,0.0003168243,0.00023822892,0.00043372362,0.00037434767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017263021,0.000915384,0.00066535024,0.0016847661,0.001108123,0.002449982,0.0011168784,0.0008916415,0.0063479203],"category_scores_gemma":[0.0046040444,0.0005805876,0.0010198419,0.0016364129,0.0021606425,0.005684543,0.0033686787,0.0033324854,0.000693091],"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.000017468956,0.000018102755,0.00016131517,0.000034673147,0.000007014559,0.000044751283,0.00015177908,0.0013088803,0.00094714755,0.9920804,0.00050936296,0.0047192257],"study_design_scores_gemma":[0.000007850078,0.000037314585,0.00018503258,0.000024599376,0.000007841376,0.00018674239,0.00014214133,0.01652141,0.0007980276,0.9798522,0.0022204735,0.000016409174],"about_ca_topic_score_codex":0.0002560201,"about_ca_topic_score_gemma":0.00028832234,"teacher_disagreement_score":0.0063479203,"about_ca_system_score_codex":0.0006636028,"about_ca_system_score_gemma":0.0005397754,"threshold_uncertainty_score":0.021235943},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025563054,0.00006583516,0.9960181,0.000043241882,0.000038938502,0.000018130326,0.000022045431,0.00016099315,0.0010763372],"genre_scores_gemma":[0.112667486,0.00022537238,0.8794926,0.00009581935,0.000076360775,0.00020908342,0.00016964822,0.00033306703,0.006730617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996099,0.00013334454,0.000022854327,0.000045860797,0.0001594553,0.000028634844],"domain_scores_gemma":[0.9990433,0.0005221842,0.00006499657,0.00013146947,0.00017424535,0.00006373287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010834143,0.00082439336,0.0014373761,0.00067546294,0.00061903393,0.0010808052,0.0013165277,0.0013853882,0.0040460746],"category_scores_gemma":[0.003010276,0.00074093585,0.0009826182,0.0012105065,0.0009844857,0.0011727314,0.0017269219,0.0020825684,0.00091665203],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000115341936,0.00011195315,0.0003990498,0.00021265187,0.00009029303,0.00009543178,0.00011905855,0.7238091,0.0055155563,0.12827992,0.0036961655,0.13755548],"study_design_scores_gemma":[0.0000068912404,0.000013551145,0.000026007494,0.000004890309,0.0000046646437,0.0000075848334,0.0000036257566,0.98690885,0.00024559596,0.011495287,0.001277248,0.0000058664064],"about_ca_topic_score_codex":0.003167257,"about_ca_topic_score_gemma":0.005007406,"teacher_disagreement_score":0.0040460746,"about_ca_system_score_codex":0.0004140968,"about_ca_system_score_gemma":0.0014293323,"threshold_uncertainty_score":0.0135355},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016079472,0.0006717611,0.9624991,0.00067761634,0.00022689534,0.00031791604,0.00057593075,0.00023089633,0.01872045],"genre_scores_gemma":[0.3865513,0.0047547626,0.5901939,0.0009041762,0.0009079345,0.0022112934,0.0029682696,0.0011401998,0.010368182],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9956026,0.00133498,0.00042345174,0.0005303809,0.0016973418,0.00041130433],"domain_scores_gemma":[0.97279716,0.018078374,0.001622719,0.0014630309,0.005282216,0.0007564335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010157324,0.0026480213,0.0024186806,0.0028971033,0.0019717782,0.003977945,0.0029366938,0.0035900034,0.006234088],"category_scores_gemma":[0.067861244,0.0010515767,0.0019382392,0.0022654966,0.003903711,0.0039524925,0.0050604544,0.008037418,0.0024966341],"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.00053499773,0.00024867442,0.0011567821,0.0010859347,0.00016263401,0.00062172284,0.00068458554,0.17080545,0.031256538,0.72328967,0.008855352,0.061297596],"study_design_scores_gemma":[0.00014722999,0.00018745927,0.00086931296,0.00049968116,0.00008642535,0.00036791197,0.00032953633,0.4940956,0.018407708,0.47270918,0.012205423,0.00009440996],"about_ca_topic_score_codex":0.0027172535,"about_ca_topic_score_gemma":0.0013624959,"teacher_disagreement_score":0.010157324,"about_ca_system_score_codex":0.0008857939,"about_ca_system_score_gemma":0.0036414945,"threshold_uncertainty_score":0.053717732},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079891175,0.00072907336,0.8672912,0.00085636444,0.00030022798,0.00015910673,0.00020200266,0.0004825216,0.050088298],"genre_scores_gemma":[0.6934313,0.0014006754,0.27351335,0.0004949917,0.0002851556,0.00047737316,0.0004835543,0.0006107932,0.029302815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974848,0.0007480079,0.00017049162,0.0003559118,0.00088673586,0.00035404394],"domain_scores_gemma":[0.99746954,0.0006778992,0.00025172555,0.0003866502,0.00078934437,0.00042487905],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003656367,0.001112644,0.0009573591,0.0023519504,0.0015004262,0.002371488,0.0011876452,0.001110093,0.006471079],"category_scores_gemma":[0.0077865976,0.0008454134,0.0011120224,0.0011536155,0.003419381,0.0039500305,0.004404631,0.0035421483,0.0013789133],"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.000035943587,0.000017681925,0.00021752219,0.000069214,0.000012198358,0.00016450061,0.00025469705,0.0031345547,0.0063090096,0.980891,0.0008598183,0.008033905],"study_design_scores_gemma":[0.00003503078,0.00019005778,0.00075441564,0.0001298104,0.000060326805,0.000685684,0.000533579,0.06604606,0.032742187,0.8642902,0.034477673,0.000054969638],"about_ca_topic_score_codex":0.00044582676,"about_ca_topic_score_gemma":0.00035637149,"teacher_disagreement_score":0.006471079,"about_ca_system_score_codex":0.0014670737,"about_ca_system_score_gemma":0.00084922096,"threshold_uncertainty_score":0.02164787},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008460971,0.022532718,0.77529955,0.037496395,0.0037940629,0.00007791151,0.00041202494,0.00024788437,0.15167846],"genre_scores_gemma":[0.49255207,0.031941775,0.37178743,0.015479856,0.0056915795,0.00041162324,0.00032649768,0.00063353195,0.081175655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912244,0.00033410327,0.000048308128,0.00020994303,0.0002157353,0.00006951105],"domain_scores_gemma":[0.99892575,0.00053104985,0.00012985947,0.0001342596,0.00021282648,0.000066151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001809719,0.0009877228,0.0007556673,0.0014304495,0.0011438727,0.0022389372,0.0008266238,0.0019396887,0.007869112],"category_scores_gemma":[0.0051031774,0.0005469673,0.0011309023,0.001517721,0.0057494557,0.0052110213,0.0022982988,0.005925876,0.0029168315],"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.00000892292,0.0000049727887,0.000113246984,0.00009728048,0.000012556505,0.0000362692,0.00012033795,0.0020825465,0.00022720691,0.98250335,0.0052881255,0.009505128],"study_design_scores_gemma":[0.0000060024554,0.000023303317,0.000079798156,0.00006993433,0.0000064082665,0.00007824733,0.000044933277,0.0057101306,0.00040986118,0.95255303,0.041005827,0.000012559513],"about_ca_topic_score_codex":0.0020870862,"about_ca_topic_score_gemma":0.0010326387,"teacher_disagreement_score":0.007869112,"about_ca_system_score_codex":0.0023998283,"about_ca_system_score_gemma":0.0011341085,"threshold_uncertainty_score":0.026324868},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048193876,0.00041568285,0.9925183,0.00016179506,0.00006118962,0.000041685413,0.00001061205,0.000028082002,0.0019432062],"genre_scores_gemma":[0.31430757,0.0013619192,0.6772772,0.00020753474,0.00017314794,0.0005469953,0.00008076946,0.000074054355,0.005970808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933916,0.00026584943,0.000045620356,0.00009933888,0.00020861629,0.000041442763],"domain_scores_gemma":[0.9992187,0.00042869282,0.000081725746,0.000044671026,0.00018873757,0.00003748041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017893745,0.0008613081,0.00073133927,0.00057497626,0.0006597558,0.0008777647,0.0011838909,0.0017954893,0.0015824444],"category_scores_gemma":[0.0038820638,0.00045874124,0.001164123,0.00053384725,0.0011518499,0.0013237988,0.0017097596,0.0017260261,0.00024752392],"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.00008058495,0.00007302272,0.0012920758,0.00065688154,0.00016996419,0.00018525269,0.00050790014,0.6742829,0.01152642,0.25087118,0.0011796571,0.05917414],"study_design_scores_gemma":[0.000008496336,0.000023335653,0.00005003704,0.000019318264,0.000010546388,0.00003132152,0.0000134241,0.9889052,0.00080341916,0.00890718,0.0012196625,0.000007981646],"about_ca_topic_score_codex":0.002465364,"about_ca_topic_score_gemma":0.0018945211,"teacher_disagreement_score":0.002465364,"about_ca_system_score_codex":0.0006892758,"about_ca_system_score_gemma":0.0011540826,"threshold_uncertainty_score":0.009463251},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073967325,0.00070211844,0.9813145,0.0011703966,0.00026494323,0.000030602292,0.000035116736,0.00008009628,0.009005571],"genre_scores_gemma":[0.7565744,0.0017370002,0.1889664,0.0006986559,0.00080317317,0.00020982466,0.00018237656,0.00023066325,0.05059749],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994809,0.00020117682,0.000019832198,0.00008587285,0.00015530715,0.000057100253],"domain_scores_gemma":[0.99861,0.00081708876,0.000106685766,0.00009734938,0.00029629088,0.00007258192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012135209,0.0009669211,0.0010811784,0.00061860046,0.0007642188,0.0013353697,0.0018993482,0.0017171165,0.0040704045],"category_scores_gemma":[0.004279702,0.00064260035,0.000753323,0.0007979106,0.002168837,0.0018054671,0.0019094769,0.0023754213,0.00037235592],"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.00007085287,0.000054029657,0.00029000264,0.000159115,0.00005216616,0.00013920173,0.00008335231,0.6388571,0.001941228,0.31608546,0.0029100236,0.039357416],"study_design_scores_gemma":[0.000008260317,0.0000117327245,0.000048659414,0.0000064757805,0.000005998556,0.000019646199,0.0000052117593,0.9202183,0.00026164495,0.078382865,0.001020363,0.000010702601],"about_ca_topic_score_codex":0.008779029,"about_ca_topic_score_gemma":0.005193969,"teacher_disagreement_score":0.008779029,"about_ca_system_score_codex":0.00096752966,"about_ca_system_score_gemma":0.0018711595,"threshold_uncertainty_score":0.017455816},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03539379,0.0011292889,0.9436784,0.002151984,0.00023588703,0.00007391843,0.00014743143,0.00006157555,0.017127614],"genre_scores_gemma":[0.6586858,0.0016928173,0.2996532,0.00073416345,0.0004771872,0.0004696659,0.0005898589,0.000311488,0.037385806],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992618,0.00042146986,0.000025069532,0.000069552574,0.00014406227,0.0000781633],"domain_scores_gemma":[0.9964535,0.0025557613,0.00018932403,0.00017095571,0.00036750123,0.00026292686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039143646,0.0011352532,0.0016233247,0.0012040449,0.0006717706,0.0021979995,0.0017964296,0.0021750324,0.005526269],"category_scores_gemma":[0.0107676005,0.00077504263,0.0013829443,0.00089251687,0.0021045592,0.0030083705,0.0024045464,0.0038763664,0.00037842427],"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.00006738664,0.000111917114,0.00035197366,0.00009387722,0.000038885337,0.00006486087,0.00013827249,0.20933783,0.0005538067,0.77823853,0.002651636,0.008351099],"study_design_scores_gemma":[0.000008197377,0.000008447932,0.00005836499,0.000009970838,0.0000042766173,0.000006725202,0.000019581732,0.8873955,0.00006474639,0.11187771,0.0005419029,0.000004594726],"about_ca_topic_score_codex":0.0050980933,"about_ca_topic_score_gemma":0.0047778334,"teacher_disagreement_score":0.005526269,"about_ca_system_score_codex":0.0018915947,"about_ca_system_score_gemma":0.0018966122,"threshold_uncertainty_score":0.020701408},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06113191,0.012108299,0.8790932,0.0061966376,0.00059004064,0.000047114,0.00019318343,0.00016445499,0.040475205],"genre_scores_gemma":[0.7833422,0.010470136,0.15378422,0.0007436559,0.0012309834,0.0002008054,0.00044731345,0.000254251,0.049526412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884856,0.0005772999,0.0000464828,0.00020039029,0.00023807376,0.00008922744],"domain_scores_gemma":[0.9963643,0.0024941955,0.00027501996,0.00026279502,0.00040731262,0.00019644952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002782916,0.0010343401,0.0015594511,0.0022725803,0.0011223818,0.0033768034,0.0019023066,0.0024145562,0.0050235996],"category_scores_gemma":[0.012106326,0.00075317407,0.0012818688,0.0020652618,0.0044576745,0.0059877615,0.003581737,0.004665085,0.00049651065],"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.000022999542,0.000011926068,0.00012905248,0.000042496882,0.000017946977,0.000017881544,0.00009444256,0.008927269,0.00019672242,0.984525,0.00073227094,0.005281963],"study_design_scores_gemma":[0.0000073435804,0.000016660353,0.00009304077,0.000015403693,0.000009223975,0.000025368343,0.000059487797,0.037102237,0.00012558894,0.95989096,0.0026478183,0.0000068234745],"about_ca_topic_score_codex":0.0033330303,"about_ca_topic_score_gemma":0.0017971959,"teacher_disagreement_score":0.0050235996,"about_ca_system_score_codex":0.0021562274,"about_ca_system_score_gemma":0.001020252,"threshold_uncertainty_score":0.01680559},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06615396,0.009217179,0.7657149,0.010889069,0.0012911706,0.000107505286,0.0007172178,0.00016725832,0.14574184],"genre_scores_gemma":[0.7630847,0.009523273,0.15326086,0.0019860838,0.0029093095,0.0004664191,0.0005511369,0.00028262835,0.06793551],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986052,0.000548883,0.00006122721,0.00013605371,0.0005245291,0.00012420304],"domain_scores_gemma":[0.9965612,0.002120577,0.0003138866,0.0002649656,0.00052667124,0.00021266071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037224744,0.001381293,0.0013688488,0.00276194,0.0013685126,0.0035883663,0.002103588,0.002029789,0.008405777],"category_scores_gemma":[0.01125372,0.00065929594,0.001701069,0.002001779,0.0037221138,0.005794681,0.0033348396,0.0049363244,0.00081613514],"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.000013713536,0.0000054659595,0.000042104202,0.000033584212,0.000011101769,0.000014149173,0.00003152151,0.0026911134,0.00014754524,0.99328893,0.0009816628,0.0027391273],"study_design_scores_gemma":[0.000014570353,0.000007066886,0.00011631237,0.000011833057,0.0000060356706,0.00003929395,0.00001779961,0.023943515,0.00007813454,0.9733132,0.0024427806,0.000009439177],"about_ca_topic_score_codex":0.0023065293,"about_ca_topic_score_gemma":0.0021343923,"teacher_disagreement_score":0.008405777,"about_ca_system_score_codex":0.0023243078,"about_ca_system_score_gemma":0.0017081471,"threshold_uncertainty_score":0.0281201},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5006718,0.0011837853,0.46823597,0.0009537097,0.00020489146,0.00016526098,0.00018159978,0.00014156525,0.028261421],"genre_scores_gemma":[0.95374185,0.00043986485,0.037979554,0.00007874295,0.00015007122,0.00018363752,0.00016559413,0.000040843828,0.0072197155],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99807066,0.00042891267,0.00012946624,0.0005142514,0.0007165389,0.00014020348],"domain_scores_gemma":[0.9940916,0.0028402791,0.00064043567,0.00043746468,0.0013385199,0.00065171195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037565609,0.0006509632,0.0009844853,0.0021568637,0.0012012435,0.003081667,0.0010356145,0.0008154747,0.0031464307],"category_scores_gemma":[0.0068776812,0.0004464056,0.0013395133,0.0008731867,0.0055618593,0.0050708195,0.0023018739,0.001878538,0.00030116455],"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.000042688866,0.000031373373,0.00043562788,0.000033042783,0.000016996011,0.0001838337,0.00085038354,0.0025011653,0.0027709529,0.99008334,0.00018665622,0.0028639364],"study_design_scores_gemma":[0.000039754414,0.000103205624,0.00044546556,0.000019347004,0.0000118849275,0.0002468336,0.00027755293,0.036102172,0.0018998483,0.9586908,0.0021375944,0.000025577287],"about_ca_topic_score_codex":0.0009880329,"about_ca_topic_score_gemma":0.00054554956,"teacher_disagreement_score":0.0037565609,"about_ca_system_score_codex":0.0018325653,"about_ca_system_score_gemma":0.0009710153,"threshold_uncertainty_score":0.019866884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018061774,0.0016534303,0.9632082,0.0011573998,0.00007226738,0.00003302919,0.00004612848,0.000038533628,0.015729235],"genre_scores_gemma":[0.7701052,0.0045975144,0.21211071,0.0008643174,0.0006069248,0.00032353986,0.00017531429,0.00025765254,0.010958842],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987451,0.00058625423,0.00004139586,0.00025805458,0.00027342743,0.00009569197],"domain_scores_gemma":[0.99467516,0.0043810094,0.00029327837,0.0001723851,0.00033701898,0.0001411587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034448348,0.00094045495,0.0011565126,0.0010765002,0.0009278282,0.0015636985,0.0012689185,0.0016531455,0.003316613],"category_scores_gemma":[0.007459493,0.0005666553,0.0011750965,0.0010541225,0.005079726,0.0040172013,0.00300571,0.0043665012,0.00042364054],"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.000012649656,0.000019334462,0.0001310556,0.00006841953,0.000018916,0.00004609052,0.00009762799,0.023284115,0.0006745132,0.96895707,0.00043012152,0.0062602307],"study_design_scores_gemma":[0.0000064708297,0.00003543645,0.00017199367,0.000029174731,0.0000071452537,0.000038314076,0.000022526907,0.098406345,0.0002679984,0.89977205,0.0012309166,0.000011687964],"about_ca_topic_score_codex":0.0009783789,"about_ca_topic_score_gemma":0.0005868739,"teacher_disagreement_score":0.0034448348,"about_ca_system_score_codex":0.0010095105,"about_ca_system_score_gemma":0.0008626189,"threshold_uncertainty_score":0.018218279},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17132275,0.0020581444,0.7977977,0.002419966,0.000090848436,0.00031085117,0.00026188875,0.00013882633,0.025599005],"genre_scores_gemma":[0.7258295,0.0036351308,0.25566444,0.00058922486,0.00036475525,0.0010091944,0.00072431745,0.00041301173,0.011770346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968725,0.0018268934,0.00015502803,0.00044887137,0.00045038885,0.00024633892],"domain_scores_gemma":[0.96541446,0.02894961,0.0016256168,0.00064062694,0.0020747406,0.0012949749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009064378,0.0023670034,0.0034109908,0.0030851394,0.0016063956,0.0043631196,0.0018441288,0.0027779606,0.006742907],"category_scores_gemma":[0.051445182,0.0020992456,0.0024691147,0.0018878145,0.004769232,0.0074724676,0.007362883,0.006943937,0.0005864808],"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.0005379654,0.00026181183,0.0014255581,0.0008040129,0.0001836052,0.00030847843,0.0017399851,0.09357656,0.006297342,0.8619958,0.0032998372,0.029569045],"study_design_scores_gemma":[0.00008790649,0.00034724188,0.0008369079,0.00021656047,0.00007904303,0.00024785177,0.0006141145,0.37190503,0.0018285669,0.62090373,0.0028636954,0.00006934426],"about_ca_topic_score_codex":0.00086216157,"about_ca_topic_score_gemma":0.00059409055,"teacher_disagreement_score":0.009064378,"about_ca_system_score_codex":0.001628348,"about_ca_system_score_gemma":0.0014727161,"threshold_uncertainty_score":0.047937572},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011065836,0.000060321607,0.9981213,0.00003683446,0.000010483333,0.00003350245,0.000014752814,0.000046561476,0.0005696128],"genre_scores_gemma":[0.027005177,0.00015011996,0.970648,0.000046145375,0.000024666038,0.0001704489,0.000117955424,0.00006791851,0.0017696503],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994087,0.00014290767,0.000032045536,0.00013102795,0.00023823022,0.000047061276],"domain_scores_gemma":[0.99944645,0.0002845876,0.000039144998,0.00005460097,0.00014101712,0.000034085486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015063738,0.0010941478,0.00083914207,0.0008411386,0.0006090721,0.0008891222,0.0012869469,0.0012750019,0.006820611],"category_scores_gemma":[0.0019392755,0.0005818307,0.0010100569,0.00083181116,0.0008284927,0.0014963157,0.0013361966,0.0030760658,0.0009634923],"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.00016289213,0.00020615479,0.0006887983,0.00043728895,0.00009522451,0.00020809252,0.00021740214,0.18351887,0.021729266,0.23521085,0.0055589275,0.55196625],"study_design_scores_gemma":[0.000041075506,0.00012868019,0.00019457609,0.00003523558,0.00002343684,0.00015696853,0.000020469051,0.9353724,0.0052512703,0.050013006,0.008739598,0.00002331543],"about_ca_topic_score_codex":0.0018612808,"about_ca_topic_score_gemma":0.0017709032,"teacher_disagreement_score":0.006820611,"about_ca_system_score_codex":0.0007868839,"about_ca_system_score_gemma":0.0011847566,"threshold_uncertainty_score":0.022817254},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022036845,0.004278483,0.821443,0.0045204163,0.0008691267,0.00013475999,0.00052440073,0.00018602694,0.14600688],"genre_scores_gemma":[0.62466496,0.0046559814,0.22809783,0.0022698203,0.0015403362,0.0005626575,0.0008991173,0.0005218352,0.13678752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988638,0.0005084451,0.000044529283,0.0001706995,0.00031542478,0.00009710204],"domain_scores_gemma":[0.99869674,0.00063967035,0.000099058445,0.00012282163,0.0002827974,0.00015897604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022885578,0.0018286834,0.0012597272,0.0014648101,0.0012260918,0.0026908605,0.0015053414,0.002088328,0.012010405],"category_scores_gemma":[0.0050774324,0.0008908432,0.0013654012,0.00095107115,0.0019388241,0.0033840567,0.0037694029,0.004356457,0.0012700133],"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.000024855439,0.000014690619,0.000075665586,0.00008107528,0.000024440236,0.00003854785,0.000049140934,0.0050604106,0.0013687242,0.9787133,0.0027995815,0.011749649],"study_design_scores_gemma":[0.000020296802,0.000049790404,0.00021162788,0.0000629821,0.00003073061,0.00016617421,0.00004686292,0.13845949,0.0012014459,0.84252214,0.017209204,0.000019187655],"about_ca_topic_score_codex":0.0011150695,"about_ca_topic_score_gemma":0.0012586466,"teacher_disagreement_score":0.012010405,"about_ca_system_score_codex":0.0017919461,"about_ca_system_score_gemma":0.0009841659,"threshold_uncertainty_score":0.040178776},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008062646,0.0002689832,0.98916143,0.0001375068,0.00009586209,0.000048607006,0.00003330636,0.00011196656,0.0020797853],"genre_scores_gemma":[0.17535827,0.00037900935,0.8140374,0.00019935842,0.0001830948,0.00029529186,0.00022896501,0.00037579867,0.008942829],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99904627,0.0004070411,0.00006081201,0.000108663866,0.00030653924,0.00007064624],"domain_scores_gemma":[0.9971781,0.0016271342,0.00018230817,0.00034408394,0.0004578616,0.00021042819],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002798327,0.0012230648,0.0014147029,0.0011544516,0.00061048,0.0015691568,0.0027279207,0.001931346,0.005906823],"category_scores_gemma":[0.007729941,0.0010521479,0.0013188946,0.00095797,0.0012029095,0.003102647,0.0034797268,0.003724043,0.0009431533],"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.000566478,0.0002766008,0.0006969653,0.00032879104,0.00024309839,0.00019593982,0.0003689097,0.29476395,0.013294199,0.47633803,0.0048577157,0.20806932],"study_design_scores_gemma":[0.000037440182,0.00003838566,0.0000557523,0.000012906974,0.0000137756915,0.000022447543,0.000011558862,0.9345976,0.00084173837,0.06297599,0.0013827862,0.000009622213],"about_ca_topic_score_codex":0.0011395541,"about_ca_topic_score_gemma":0.0017130931,"teacher_disagreement_score":0.005906823,"about_ca_system_score_codex":0.0008671803,"about_ca_system_score_gemma":0.0010210809,"threshold_uncertainty_score":0.01976031},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074572206,0.00063784193,0.9159615,0.0009295356,0.000062284795,0.000043139717,0.00016413929,0.00012048906,0.0075088916],"genre_scores_gemma":[0.62986684,0.0010694559,0.3418815,0.00034287595,0.00028551233,0.00039955767,0.0007665544,0.0004904305,0.024897294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973109,0.0010414778,0.0001568194,0.00062720315,0.0006991223,0.00016461058],"domain_scores_gemma":[0.9880642,0.008771102,0.0009748094,0.00057873403,0.00074811233,0.00086303026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004435725,0.0013248124,0.00311876,0.0021051883,0.0014740342,0.0046840957,0.0027045542,0.0023113778,0.0037889404],"category_scores_gemma":[0.014452361,0.0016581994,0.0018966356,0.0014283173,0.003692983,0.0061048716,0.004979866,0.004045917,0.00048470142],"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.00016612091,0.00012154662,0.0008602289,0.00032729714,0.00019064937,0.00036179653,0.00053265336,0.16735518,0.0065102074,0.8087507,0.0018089317,0.013014611],"study_design_scores_gemma":[0.00001843366,0.000075985175,0.00043953513,0.00004728581,0.000035136043,0.00017328792,0.00013589271,0.7251899,0.0014135877,0.27090964,0.001540652,0.000020650765],"about_ca_topic_score_codex":0.00151009,"about_ca_topic_score_gemma":0.0013477433,"teacher_disagreement_score":0.0046840957,"about_ca_system_score_codex":0.002034851,"about_ca_system_score_gemma":0.00095127313,"threshold_uncertainty_score":0.0234586},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003639686,0.00078894245,0.9898233,0.00021672943,0.0002652911,0.00009623283,0.000046728605,0.000081515725,0.005041639],"genre_scores_gemma":[0.079334654,0.0013991843,0.89923286,0.00037828035,0.00051418465,0.00067703635,0.00022161631,0.0003514087,0.01789086],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986487,0.00064445107,0.0000966488,0.00014748712,0.00038142607,0.000081245315],"domain_scores_gemma":[0.9976841,0.0013558056,0.00013810935,0.00013772017,0.0005281987,0.00015607987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041605565,0.002225349,0.001583446,0.0018057086,0.00112761,0.0018317673,0.0031701094,0.0025576537,0.0054960027],"category_scores_gemma":[0.008577437,0.0012125445,0.0031601049,0.0013837228,0.0018803199,0.0025102585,0.0039642053,0.0039488263,0.0009208359],"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.00025039574,0.00022834257,0.0010667469,0.0010398156,0.00042917233,0.00034622295,0.0007917787,0.22708206,0.010929495,0.5863602,0.009130381,0.16234525],"study_design_scores_gemma":[0.000039417144,0.00007971721,0.00015804659,0.00005670609,0.000055432505,0.00008996176,0.00003944644,0.92560685,0.001049122,0.06567523,0.007114173,0.000035928588],"about_ca_topic_score_codex":0.003492666,"about_ca_topic_score_gemma":0.00638159,"teacher_disagreement_score":0.0054960027,"about_ca_system_score_codex":0.0013788214,"about_ca_system_score_gemma":0.0015730035,"threshold_uncertainty_score":0.022003353},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0398398,0.0007719383,0.9212121,0.0012538958,0.00019653475,0.00016378459,0.00034579248,0.00018031946,0.0360358],"genre_scores_gemma":[0.7266133,0.0016964664,0.23177859,0.00064140145,0.0004594334,0.0009061671,0.0006460025,0.0005085731,0.03675015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980872,0.00079415727,0.00009730463,0.00026960252,0.00047191256,0.00027976697],"domain_scores_gemma":[0.9941439,0.0040474157,0.00047271996,0.0002769079,0.00077647634,0.0002825723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044630063,0.0017691919,0.0022808188,0.0022016303,0.0010841618,0.0030198263,0.0027630173,0.0025495212,0.01577686],"category_scores_gemma":[0.014213524,0.0011444417,0.0014335247,0.0016789105,0.0026983863,0.006512326,0.003073562,0.0044675106,0.0013036559],"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.000110737536,0.000099277364,0.00013688848,0.00016704359,0.000028457935,0.00013956868,0.000181964,0.10315103,0.0019505791,0.88172245,0.0026777158,0.009634202],"study_design_scores_gemma":[0.00006126144,0.00004786641,0.00016564521,0.000044874098,0.000019730007,0.000044697023,0.000047978243,0.5444847,0.0011880711,0.4516509,0.0022036112,0.000040718685],"about_ca_topic_score_codex":0.0029538316,"about_ca_topic_score_gemma":0.0031938644,"teacher_disagreement_score":0.01577686,"about_ca_system_score_codex":0.0022997952,"about_ca_system_score_gemma":0.0027315372,"threshold_uncertainty_score":0.0527789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03402677,0.001211559,0.9474113,0.0012310538,0.00016126306,0.000055790104,0.00008540099,0.0001830095,0.015633807],"genre_scores_gemma":[0.76501095,0.0029518108,0.21242926,0.0005026069,0.00045425157,0.00025848395,0.00018141085,0.00024022424,0.017971087],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99900925,0.00034130854,0.00003473275,0.00022039394,0.0003200471,0.00007427284],"domain_scores_gemma":[0.9981499,0.0007494116,0.00020644562,0.00030274029,0.00038044708,0.0002111717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016637469,0.0010381398,0.0008701365,0.0007887336,0.0012819745,0.0019777073,0.00092045614,0.0011288992,0.005498437],"category_scores_gemma":[0.0047396678,0.0004176981,0.0011056666,0.0010428434,0.0034371698,0.003883462,0.0035069345,0.0027967389,0.0007572684],"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.000048456455,0.00003733022,0.0004939076,0.00017307125,0.00002851799,0.00015873008,0.0002872373,0.019708458,0.0049740584,0.9427086,0.0013622876,0.030019429],"study_design_scores_gemma":[0.000024992572,0.00019701252,0.0006151222,0.000057551617,0.000015532856,0.0004957015,0.00013416357,0.13850282,0.006761439,0.8437393,0.009417673,0.000038755275],"about_ca_topic_score_codex":0.00068133534,"about_ca_topic_score_gemma":0.00042526206,"teacher_disagreement_score":0.005498437,"about_ca_system_score_codex":0.00064782996,"about_ca_system_score_gemma":0.00078663835,"threshold_uncertainty_score":0.018394113},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009260552,0.0006219523,0.98447996,0.00026665375,0.00015912543,0.00005230273,0.00004894535,0.000043330434,0.0050671217],"genre_scores_gemma":[0.4151918,0.001732084,0.5548966,0.0005708047,0.0005182116,0.00057675596,0.00038059687,0.00038749416,0.025745684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993487,0.0003212695,0.0000368172,0.00007309696,0.00017286702,0.00004726922],"domain_scores_gemma":[0.9984151,0.00096662657,0.00010503629,0.000116351985,0.00025053968,0.00014629676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00264133,0.0013265862,0.0012228894,0.0011163099,0.0006701908,0.0012902312,0.0016603826,0.0014152721,0.0051585953],"category_scores_gemma":[0.004032447,0.0009005947,0.0014099188,0.0006429284,0.0016448644,0.0021822886,0.003717526,0.0028664717,0.0004452863],"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.0002566772,0.00013900173,0.0006326967,0.00045413082,0.00020284067,0.0001649275,0.00031016205,0.18255357,0.011054998,0.730531,0.0031829665,0.07051716],"study_design_scores_gemma":[0.000021304262,0.000049561346,0.00010040343,0.000028733433,0.000018232706,0.000033111777,0.000027399914,0.8606557,0.00054691156,0.13622427,0.0022834418,0.000010888357],"about_ca_topic_score_codex":0.0014177299,"about_ca_topic_score_gemma":0.0018499495,"teacher_disagreement_score":0.0051585953,"about_ca_system_score_codex":0.0009233724,"about_ca_system_score_gemma":0.00095585437,"threshold_uncertainty_score":0.017257273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15067704,0.002502616,0.69140655,0.005625916,0.00033269235,0.000077127035,0.0008157662,0.00032912256,0.1482332],"genre_scores_gemma":[0.8866185,0.0033849382,0.04431344,0.0008586678,0.0010937311,0.00023708362,0.0014264258,0.0011322909,0.06093497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857616,0.0005292463,0.00007858712,0.00027377778,0.0003181395,0.00022401634],"domain_scores_gemma":[0.993735,0.0031189155,0.00045022272,0.0007330193,0.0014386236,0.0005242046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023266342,0.0009491308,0.0014271847,0.0028932104,0.0018500297,0.0046387827,0.0013087341,0.001403376,0.012264683],"category_scores_gemma":[0.011888677,0.0007512953,0.0014606015,0.0021038793,0.0031586918,0.00847147,0.0029918943,0.003968542,0.001870319],"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.00004118965,0.000017850512,0.0003312653,0.00006734406,0.000017258822,0.00006572622,0.00015101893,0.0033852165,0.0014570802,0.98160326,0.0038817693,0.0089809345],"study_design_scores_gemma":[0.000007496152,0.000014454518,0.000484217,0.000022959433,0.000013892834,0.00014046275,0.00012415268,0.023216425,0.0007536373,0.970769,0.0044426518,0.000010590634],"about_ca_topic_score_codex":0.0011393896,"about_ca_topic_score_gemma":0.0008321429,"teacher_disagreement_score":0.012264683,"about_ca_system_score_codex":0.0016744918,"about_ca_system_score_gemma":0.0010302616,"threshold_uncertainty_score":0.041029394},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011722064,0.00033922633,0.98017395,0.00052766595,0.0000855825,0.000030818836,0.0000859386,0.0000961419,0.0069385916],"genre_scores_gemma":[0.5746133,0.0010992909,0.38047686,0.0003899682,0.0002935695,0.00039224376,0.00055059505,0.0006248968,0.0415593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988494,0.00052450073,0.000045380915,0.00011052025,0.00035921502,0.00011093917],"domain_scores_gemma":[0.9974884,0.00152953,0.0002068352,0.00023394599,0.00030560477,0.00023577659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023682332,0.0012065007,0.0014107837,0.0010492547,0.0006791882,0.0017484198,0.0016671061,0.0013904347,0.004837277],"category_scores_gemma":[0.008392834,0.00072860805,0.00080321333,0.0011069118,0.0018442677,0.0029834516,0.002563319,0.0024127455,0.00046522374],"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.000059011265,0.00006180625,0.00019130923,0.0001776983,0.00003373345,0.000071878065,0.00007235716,0.2675166,0.0010264111,0.7012951,0.0029650244,0.026529051],"study_design_scores_gemma":[0.000008993159,0.000015298054,0.00006374998,0.000016347278,0.000005284124,0.000022135127,0.000013037201,0.72229874,0.00023683078,0.2755632,0.0017488725,0.0000075331586],"about_ca_topic_score_codex":0.0024842138,"about_ca_topic_score_gemma":0.003183125,"teacher_disagreement_score":0.004837277,"about_ca_system_score_codex":0.0014475156,"about_ca_system_score_gemma":0.0017979771,"threshold_uncertainty_score":0.016182303},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.66507196,0.0011375413,0.26182607,0.0034717724,0.00048015316,0.000121048666,0.0006366938,0.00028967534,0.06696504],"genre_scores_gemma":[0.9687663,0.00032838478,0.024742614,0.0002511624,0.00018967428,0.00009271647,0.00036180145,0.000048310674,0.0052191955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860364,0.00019426935,0.000113178176,0.00035490075,0.00037787887,0.00035612553],"domain_scores_gemma":[0.98789716,0.0067578275,0.0011288321,0.00093595206,0.0017132827,0.00156701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016511597,0.00033572727,0.0015785829,0.0013047054,0.0025967157,0.0023320222,0.0015078887,0.002678326,0.0038044741],"category_scores_gemma":[0.015692737,0.0008105175,0.0010708822,0.0005959257,0.005254645,0.0035321536,0.0036620118,0.002333982,0.00045842127],"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.0003386106,0.00011609686,0.0052700564,0.00019672349,0.00005319673,0.0017215011,0.0006372334,0.0059917397,0.012560855,0.9559091,0.0038740255,0.013330784],"study_design_scores_gemma":[0.00010737666,0.0001542942,0.0030266624,0.00012581865,0.000052890533,0.0054239277,0.0010026656,0.06574184,0.010106613,0.9049684,0.009186147,0.00010335081],"about_ca_topic_score_codex":0.0007703996,"about_ca_topic_score_gemma":0.00079526677,"teacher_disagreement_score":0.0038044741,"about_ca_system_score_codex":0.0006022129,"about_ca_system_score_gemma":0.00090702757,"threshold_uncertainty_score":0.012727261},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018077698,0.00015010832,0.97974133,0.00012140224,0.000012050349,0.00005438497,0.000024285564,0.000057216886,0.0017615078],"genre_scores_gemma":[0.30146375,0.00038049615,0.6953473,0.00010646489,0.000027211496,0.00048397982,0.00018607388,0.00013643948,0.0018682525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867994,0.00072135235,0.000063534695,0.00015013992,0.00025977008,0.00012523873],"domain_scores_gemma":[0.9969928,0.0022388352,0.00021595751,0.00015265578,0.00031871072,0.0000809227],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033398166,0.0011505082,0.0016285001,0.0010395438,0.0006782916,0.0012952177,0.0011424941,0.001661318,0.002232539],"category_scores_gemma":[0.009036183,0.00082132756,0.00095843157,0.0011785025,0.0012851775,0.0015602019,0.002479514,0.0018508241,0.0004547206],"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.000047603924,0.00005080021,0.00037721117,0.00017488246,0.000040238807,0.000091923976,0.00012983983,0.913575,0.0013112396,0.05443016,0.00046742076,0.029303744],"study_design_scores_gemma":[0.000019087884,0.000040896026,0.000044919092,0.000029868428,0.000007487994,0.000027362845,0.000042775366,0.95473856,0.000957404,0.04325534,0.0008290553,0.0000072334556],"about_ca_topic_score_codex":0.00060055556,"about_ca_topic_score_gemma":0.0006395967,"teacher_disagreement_score":0.0033398166,"about_ca_system_score_codex":0.0006186052,"about_ca_system_score_gemma":0.0009577263,"threshold_uncertainty_score":0.017662823},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016974857,0.0001197719,0.98069304,0.00009354696,0.000021099222,0.000031583346,0.000015980388,0.00020089664,0.0018492197],"genre_scores_gemma":[0.2637704,0.00026377232,0.7315828,0.00006461258,0.00001938723,0.00015880866,0.000084870415,0.0001790834,0.0038762281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980342,0.00073649705,0.00008576262,0.00022721571,0.00073582446,0.00018041994],"domain_scores_gemma":[0.9982497,0.0006907001,0.0001617728,0.00026860874,0.0004639253,0.00016526866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030060187,0.00097534247,0.0014706238,0.0015393917,0.0009333702,0.0018726536,0.0016812851,0.001462961,0.0018037122],"category_scores_gemma":[0.006584436,0.0011152782,0.0013246911,0.00070336787,0.0019518296,0.0024925913,0.0038148365,0.0028860332,0.00062632613],"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.00019853309,0.00007879046,0.0009735546,0.00022132805,0.00009827538,0.0002740811,0.0011157251,0.15346527,0.021203175,0.746987,0.0014200967,0.07396415],"study_design_scores_gemma":[0.000029515926,0.00014179405,0.00016402907,0.00006583479,0.000023980609,0.00019579411,0.00018482358,0.77652,0.015505628,0.20158976,0.005530802,0.000048143902],"about_ca_topic_score_codex":0.00078680925,"about_ca_topic_score_gemma":0.0009218064,"teacher_disagreement_score":0.0030060187,"about_ca_system_score_codex":0.0013531226,"about_ca_system_score_gemma":0.0011382878,"threshold_uncertainty_score":0.015897572},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22971907,0.0025316174,0.7495805,0.0014435847,0.00030467904,0.00011106164,0.00012639251,0.00021698517,0.01596613],"genre_scores_gemma":[0.7873287,0.0025515908,0.1800488,0.00043002306,0.0003376067,0.00029078298,0.00036207028,0.00045602184,0.028194327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99767035,0.0010815426,0.00014242475,0.00028903887,0.00057828694,0.00023831465],"domain_scores_gemma":[0.98219115,0.0124356225,0.0009363444,0.0005734046,0.0021343448,0.0017291144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009445347,0.0022160015,0.0017299034,0.003266207,0.0015474926,0.0036631671,0.002543578,0.002104305,0.0031449776],"category_scores_gemma":[0.023795819,0.0011413525,0.0017795187,0.0011103197,0.005438135,0.005945236,0.0070597366,0.0062524304,0.00032597457],"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.00037141144,0.00014172014,0.0011423804,0.0002648196,0.000100377394,0.00020549585,0.0011243643,0.042253148,0.0064814114,0.9347749,0.0009347921,0.012205162],"study_design_scores_gemma":[0.00003938693,0.00022357413,0.0007151374,0.00007758302,0.000045014156,0.00020557034,0.00036491957,0.6039725,0.002999505,0.38914034,0.0021759488,0.00004058782],"about_ca_topic_score_codex":0.0037525124,"about_ca_topic_score_gemma":0.0022752145,"teacher_disagreement_score":0.009445347,"about_ca_system_score_codex":0.0036380363,"about_ca_system_score_gemma":0.001573865,"threshold_uncertainty_score":0.049952388},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014504191,0.00018824653,0.97695315,0.00040366722,0.000059296286,0.00007495932,0.000046436006,0.000100041354,0.00766998],"genre_scores_gemma":[0.31960148,0.0005883798,0.6636315,0.00039585974,0.00017978692,0.0005024292,0.00021152906,0.00038485785,0.014504178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910057,0.00045344193,0.000037136182,0.0001321474,0.00020438054,0.00007227351],"domain_scores_gemma":[0.99711967,0.0023280578,0.00013405047,0.0001555155,0.00015448048,0.00010823155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020649128,0.0013895796,0.0017752259,0.00070262694,0.0007249207,0.0018915226,0.0013955056,0.0022553885,0.0055143763],"category_scores_gemma":[0.00932856,0.0010559658,0.0012661532,0.0014131005,0.0020876105,0.0028721797,0.00350551,0.0028739064,0.0005570695],"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.00009633649,0.00015904605,0.00034179538,0.00027555486,0.000049543927,0.00008692784,0.00016225303,0.74042624,0.0013076735,0.21371503,0.0023671298,0.041012418],"study_design_scores_gemma":[0.000011700583,0.000029864128,0.00003389824,0.000012838155,0.000005879827,0.00001062343,0.000013222107,0.9350828,0.00017748134,0.06388531,0.00073098356,0.000005459984],"about_ca_topic_score_codex":0.0021512727,"about_ca_topic_score_gemma":0.0025716864,"teacher_disagreement_score":0.0055143763,"about_ca_system_score_codex":0.0007955218,"about_ca_system_score_gemma":0.0010105434,"threshold_uncertainty_score":0.018447459},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001337311,0.001197878,0.9937698,0.00020931836,0.000093205585,0.000020906129,0.000027051214,0.000057019406,0.0032874953],"genre_scores_gemma":[0.22783944,0.006885225,0.73439085,0.00051245635,0.0006924415,0.0006363503,0.00038416436,0.0006304614,0.02802865],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993649,0.00022860507,0.00004057849,0.00008882144,0.0002277377,0.000049222715],"domain_scores_gemma":[0.9990915,0.0005710181,0.00008088388,0.0000561804,0.0001601944,0.00004025395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001503366,0.0015663585,0.001991665,0.0016033296,0.0007394006,0.0014794349,0.0019041797,0.0016269857,0.0031852361],"category_scores_gemma":[0.003982896,0.00094088155,0.0014480567,0.0017895126,0.0015186121,0.0019866393,0.002744855,0.0031448577,0.000645425],"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.000080658014,0.00010460473,0.00023799707,0.00045617958,0.00014396409,0.000067508525,0.0001448666,0.47660044,0.0030860489,0.401125,0.0047791144,0.11317359],"study_design_scores_gemma":[0.000011816101,0.000017571334,0.00007500595,0.000026910368,0.000017230766,0.000015613668,0.000013415266,0.8992137,0.0003131276,0.09667166,0.0036137896,0.000010213526],"about_ca_topic_score_codex":0.005642211,"about_ca_topic_score_gemma":0.0048869057,"teacher_disagreement_score":0.005642211,"about_ca_system_score_codex":0.0009731227,"about_ca_system_score_gemma":0.001520129,"threshold_uncertainty_score":0.011218727},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4830273,0.0014267219,0.47213313,0.0003718286,0.00014414574,0.00008404236,0.00010328921,0.00016103088,0.042548433],"genre_scores_gemma":[0.9634433,0.00037095384,0.03094366,0.00008356787,0.00006221109,0.000042415497,0.00008743342,0.000039729446,0.0049266457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977946,0.00042133493,0.00016177355,0.00048023497,0.000926484,0.00021551723],"domain_scores_gemma":[0.9962353,0.0013811833,0.0003921592,0.0005171987,0.0009766119,0.00049764226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002768804,0.00049143203,0.00085268327,0.0011855474,0.00046185387,0.0015629184,0.0009188526,0.00054137036,0.0030754488],"category_scores_gemma":[0.008866468,0.0003180532,0.0008266282,0.0005081846,0.0020223553,0.0027364201,0.0036344184,0.0022766308,0.00022598683],"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.00023588873,0.00010824324,0.00389604,0.00021893655,0.000059190465,0.0009311723,0.00095644523,0.020055521,0.032880638,0.898233,0.0007176165,0.041707244],"study_design_scores_gemma":[0.000068340196,0.00056306494,0.007508087,0.00021087939,0.0001330398,0.0013580293,0.0006658318,0.41796058,0.042466488,0.5034466,0.025553936,0.00006512627],"about_ca_topic_score_codex":0.000628185,"about_ca_topic_score_gemma":0.0003012668,"teacher_disagreement_score":0.0030754488,"about_ca_system_score_codex":0.00092482875,"about_ca_system_score_gemma":0.00043675717,"threshold_uncertainty_score":0.0146430135},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47856194,0.0014054129,0.47648326,0.0007111939,0.0001128804,0.0000774553,0.00016106149,0.00012157814,0.04236516],"genre_scores_gemma":[0.9703081,0.00040452598,0.01936126,0.000048180766,0.00013908367,0.00007230383,0.00009822682,0.000040760173,0.009527564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999506,0.00011591993,0.00002364488,0.00012308151,0.00018140582,0.000050083952],"domain_scores_gemma":[0.9984219,0.00083588535,0.00022566912,0.00012463774,0.00020800027,0.00018382359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001115571,0.00039129204,0.00039075225,0.00095319934,0.00076552934,0.0013318292,0.0004748371,0.0004362805,0.0041090804],"category_scores_gemma":[0.002539903,0.00018594276,0.0007222098,0.00038821116,0.0021369103,0.0020649876,0.0010520557,0.0010900259,0.00030654515],"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.00002294095,0.000011584659,0.00042969474,0.000044192984,0.000014586815,0.00024388573,0.00050808175,0.0044703004,0.0068826764,0.983949,0.00015813563,0.0032648826],"study_design_scores_gemma":[0.000016064405,0.000092735136,0.00082115305,0.000019927527,0.000012962638,0.0003822092,0.00030897357,0.03909951,0.003218202,0.95223373,0.0037767186,0.000017879931],"about_ca_topic_score_codex":0.00062679214,"about_ca_topic_score_gemma":0.00037837503,"teacher_disagreement_score":0.0041090804,"about_ca_system_score_codex":0.0008190006,"about_ca_system_score_gemma":0.00031297398,"threshold_uncertainty_score":0.013746262},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041356962,0.0075600403,0.8966332,0.005665771,0.00068268046,0.000044945158,0.0003581639,0.00011250342,0.047585756],"genre_scores_gemma":[0.74581426,0.015411969,0.14778402,0.001290643,0.0018920363,0.00024664582,0.0010740015,0.000293142,0.08619329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995714,0.00016946424,0.000024013283,0.000075528624,0.0001129251,0.000046539248],"domain_scores_gemma":[0.9989229,0.00050748495,0.00015606917,0.000068597095,0.00022876714,0.00011616208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013011978,0.0011018687,0.0011314108,0.0012823414,0.0010234193,0.0025813363,0.0013523838,0.0017452278,0.0062796935],"category_scores_gemma":[0.004340535,0.0007175106,0.0010532793,0.0018440965,0.0030124106,0.00592532,0.0023775469,0.0047316262,0.0005027571],"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.000008461756,0.000008336704,0.00007753833,0.000025451822,0.000009446228,0.000030407624,0.000050724368,0.0064113783,0.00018396598,0.98865396,0.0011730402,0.0033673022],"study_design_scores_gemma":[0.0000072836765,0.000006752663,0.00009762381,0.000008645836,0.0000059013873,0.00003500285,0.000027820553,0.04184142,0.0000509002,0.95514745,0.0027638355,0.000007442742],"about_ca_topic_score_codex":0.005215559,"about_ca_topic_score_gemma":0.004913328,"teacher_disagreement_score":0.0062796935,"about_ca_system_score_codex":0.0015487197,"about_ca_system_score_gemma":0.0014491935,"threshold_uncertainty_score":0.021007717},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01439979,0.001089849,0.9513258,0.0017284,0.0002064486,0.00016639457,0.0006307157,0.0001108652,0.030341657],"genre_scores_gemma":[0.55542254,0.006147579,0.39749467,0.0015238334,0.0008759293,0.0012520548,0.0027603018,0.0008511902,0.033671826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986993,0.0005202153,0.00009550669,0.00018083569,0.00032285045,0.0001812843],"domain_scores_gemma":[0.9944417,0.003535861,0.00036386884,0.00019229607,0.0012594619,0.00020683704],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004027888,0.0017385266,0.0012554636,0.0015885351,0.00067567575,0.002785169,0.0011089642,0.0021624938,0.009574635],"category_scores_gemma":[0.013865754,0.0008289266,0.0009941075,0.0013314392,0.0018435972,0.0031356271,0.0023288713,0.003961751,0.0020979682],"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.00014530389,0.000084793326,0.00053198915,0.00036909356,0.00004114576,0.00024420768,0.00017411358,0.15807505,0.003924423,0.78896314,0.013242611,0.03420399],"study_design_scores_gemma":[0.00006375522,0.0001176489,0.0004839852,0.00013077319,0.000025804115,0.00020252288,0.00014145632,0.5878036,0.0017805052,0.40052757,0.008680287,0.000042086413],"about_ca_topic_score_codex":0.0033989989,"about_ca_topic_score_gemma":0.0022558942,"teacher_disagreement_score":0.009574635,"about_ca_system_score_codex":0.0013027039,"about_ca_system_score_gemma":0.0024278597,"threshold_uncertainty_score":0.032030284},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011389425,0.00019354782,0.9711365,0.0004708104,0.00008293675,0.00006736899,0.000078731464,0.00004371439,0.01653705],"genre_scores_gemma":[0.65876126,0.0011737086,0.31447315,0.00046348159,0.00030718368,0.0007086214,0.00041820703,0.0001302074,0.023564145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987986,0.0004957329,0.000051217885,0.00025833436,0.0002600414,0.00013610927],"domain_scores_gemma":[0.9995173,0.0002158782,0.000060471106,0.000040249106,0.000119159246,0.00004685107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014006444,0.0010291482,0.0011522636,0.0006125091,0.00057043065,0.0020160673,0.0012117772,0.0012826193,0.006815974],"category_scores_gemma":[0.0031982544,0.00028798278,0.0007931674,0.00089672353,0.001275704,0.0026109882,0.0019255027,0.0022560412,0.00063359743],"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.000034749133,0.00007071348,0.00026981282,0.0001781676,0.000045090375,0.00014865492,0.0001573285,0.14966087,0.0010081659,0.8148595,0.0024039417,0.031163037],"study_design_scores_gemma":[0.000015063979,0.00004194895,0.00010124174,0.000019786672,0.000010929552,0.000070814545,0.00007302469,0.41891927,0.0002581354,0.5765205,0.0039532194,0.00001604698],"about_ca_topic_score_codex":0.0013568087,"about_ca_topic_score_gemma":0.0015876852,"teacher_disagreement_score":0.006815974,"about_ca_system_score_codex":0.0009722446,"about_ca_system_score_gemma":0.0013075549,"threshold_uncertainty_score":0.022801697},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013229218,0.000495349,0.978519,0.00038932776,0.00010378589,0.00007558149,0.000022564796,0.00008017306,0.007084991],"genre_scores_gemma":[0.5371747,0.0018640471,0.4351607,0.00071410416,0.00039746982,0.0007759722,0.00014548183,0.00049406703,0.023273502],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99760264,0.0011246395,0.0001271883,0.0002631101,0.0007157936,0.00016669599],"domain_scores_gemma":[0.99394673,0.003483352,0.0005622794,0.0004761843,0.0010303262,0.00050122855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0064291623,0.0021357292,0.0013942643,0.0017453083,0.0011632284,0.002402302,0.0023236112,0.00229396,0.003523069],"category_scores_gemma":[0.018369297,0.0007567742,0.0020290501,0.00081845676,0.004165186,0.0049871937,0.00569927,0.0042679547,0.0006899951],"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.00009591612,0.00006234504,0.00039742462,0.00025497068,0.00007422306,0.00023086627,0.00037535658,0.071428485,0.007797216,0.89963204,0.0009700498,0.018681103],"study_design_scores_gemma":[0.000024132485,0.00012927843,0.00015274064,0.000050388262,0.000017161556,0.000111388224,0.000047915342,0.754617,0.0030864372,0.23921987,0.0025112322,0.000032590648],"about_ca_topic_score_codex":0.0010840849,"about_ca_topic_score_gemma":0.00081812456,"teacher_disagreement_score":0.0064291623,"about_ca_system_score_codex":0.0014861489,"about_ca_system_score_gemma":0.001950824,"threshold_uncertainty_score":0.034001112},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052929033,0.0028338367,0.9080394,0.0019751112,0.00013609928,0.000051954587,0.0003900156,0.00027925067,0.03336518],"genre_scores_gemma":[0.87623274,0.0051655984,0.109458596,0.0006206286,0.00040416897,0.00018979293,0.0005495613,0.00046839996,0.006910512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99647754,0.0013421229,0.00018132712,0.0005315868,0.0010297177,0.00043775587],"domain_scores_gemma":[0.98147994,0.013209899,0.0012029556,0.0016718932,0.0019978383,0.00043748406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052675013,0.0010017047,0.0013117534,0.0020645375,0.0015170324,0.002948214,0.001449745,0.0012388227,0.0035021484],"category_scores_gemma":[0.024411863,0.00066859246,0.0013622898,0.0018750447,0.007965287,0.0048784213,0.0028459595,0.0057339966,0.00057032576],"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.00007060988,0.000010225659,0.0005811544,0.00009104197,0.000020918493,0.00024592655,0.00021618787,0.034319393,0.0025552684,0.9493087,0.0012587586,0.011321921],"study_design_scores_gemma":[0.000015614332,0.000045785186,0.0011469758,0.000120954355,0.000024661782,0.00021263001,0.0001696656,0.15292591,0.0039244434,0.83307,0.008296776,0.000046687237],"about_ca_topic_score_codex":0.0037215815,"about_ca_topic_score_gemma":0.0014949946,"teacher_disagreement_score":0.0052675013,"about_ca_system_score_codex":0.0019304694,"about_ca_system_score_gemma":0.0012714596,"threshold_uncertainty_score":0.027857542},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002331394,0.00020381327,0.99654984,0.00006071961,0.000018734972,0.000013827285,0.000007429982,0.00008797313,0.0007261526],"genre_scores_gemma":[0.12998375,0.0006571963,0.8659523,0.000046262663,0.000051263512,0.00010953919,0.00004546575,0.00023935757,0.0029149659],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913675,0.0004527553,0.000040367995,0.000087112334,0.00024328445,0.000039722785],"domain_scores_gemma":[0.99441826,0.0039843847,0.00015445211,0.00034570714,0.0009668906,0.00013032567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032286886,0.00085264747,0.00119854,0.00046342696,0.0005109578,0.0014236226,0.0014031524,0.0015476973,0.0034341344],"category_scores_gemma":[0.011247742,0.0007378855,0.0009197876,0.00070710166,0.0011867739,0.0021617417,0.0016125084,0.0027138032,0.00096551294],"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.00035286858,0.00017728683,0.0005034915,0.00032142596,0.00008291709,0.00013741956,0.00040121193,0.6736961,0.0046596117,0.11917054,0.0031659198,0.19733119],"study_design_scores_gemma":[0.000012534962,0.00003647487,0.000024395647,0.000009196453,0.0000068435697,0.00002470851,0.000008264791,0.99135196,0.00074209,0.006789902,0.0009856028,0.000008031378],"about_ca_topic_score_codex":0.005174519,"about_ca_topic_score_gemma":0.0025334563,"teacher_disagreement_score":0.005174519,"about_ca_system_score_codex":0.00061647873,"about_ca_system_score_gemma":0.0011720369,"threshold_uncertainty_score":0.017075181},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02668675,0.0001915643,0.9712435,0.00013753244,0.00003451077,0.000051996278,0.000042997424,0.00018485988,0.0014263247],"genre_scores_gemma":[0.35065615,0.0004649781,0.6420283,0.000068043795,0.00007884657,0.00021428612,0.0002952776,0.00038790662,0.005806265],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899155,0.0004349057,0.00004163534,0.0001616673,0.00027597902,0.00009421655],"domain_scores_gemma":[0.9953566,0.0032934654,0.00026053644,0.00023171659,0.00056377763,0.00029389656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032727043,0.0016740065,0.0023311125,0.0023939824,0.00085787167,0.0020742824,0.0019344792,0.0023556824,0.0038789508],"category_scores_gemma":[0.014849747,0.0016104869,0.0010490293,0.0013453342,0.0021790173,0.0026977602,0.003305448,0.002781397,0.0009230926],"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.000392842,0.00020698972,0.0011410456,0.00040482698,0.00010816949,0.00016569397,0.0002742788,0.7614292,0.004592224,0.1262148,0.0026827427,0.102387175],"study_design_scores_gemma":[0.000026933145,0.00008904053,0.00016890897,0.000029610672,0.000016691301,0.000031953354,0.0000488529,0.917621,0.0021472913,0.078985214,0.0008217303,0.000012764512],"about_ca_topic_score_codex":0.0021087544,"about_ca_topic_score_gemma":0.0028406912,"teacher_disagreement_score":0.0038789508,"about_ca_system_score_codex":0.0013509633,"about_ca_system_score_gemma":0.0017157847,"threshold_uncertainty_score":0.017307878},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014598529,0.012363126,0.96795523,0.00228605,0.0013053606,0.000027609562,0.00013675058,0.00013731958,0.01432866],"genre_scores_gemma":[0.19519055,0.03031225,0.6406574,0.001817476,0.0054249023,0.0005737089,0.0007902846,0.0018116806,0.123421825],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983317,0.0008314659,0.0000897924,0.0002143984,0.00045822453,0.00007455526],"domain_scores_gemma":[0.99670756,0.0020289624,0.00014275376,0.00037311585,0.000598029,0.000149675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039390502,0.0017763501,0.0033962443,0.0019036724,0.00091077475,0.0032916367,0.0020522948,0.00283466,0.006758731],"category_scores_gemma":[0.0084883,0.0015173322,0.0018959318,0.0026963777,0.003842429,0.0034627588,0.003293324,0.0073316265,0.0022231042],"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.000016204285,0.000023409975,0.00013801965,0.0002006034,0.00010329025,0.000034016226,0.00010403555,0.02372897,0.0005585176,0.92359066,0.013907085,0.03759522],"study_design_scores_gemma":[0.000013880969,0.0000144874875,0.00021150988,0.00008157225,0.000042923493,0.00006652154,0.00003204426,0.18534675,0.00031476133,0.7813481,0.032505024,0.000022360817],"about_ca_topic_score_codex":0.0051875915,"about_ca_topic_score_gemma":0.0046868934,"teacher_disagreement_score":0.006758731,"about_ca_system_score_codex":0.001962303,"about_ca_system_score_gemma":0.0019088454,"threshold_uncertainty_score":0.022610188},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11292706,0.0010891338,0.85233855,0.0008527079,0.00022864575,0.000069929345,0.00015363497,0.00009969084,0.032240596],"genre_scores_gemma":[0.9174466,0.0008112772,0.070709236,0.0001343851,0.0001237709,0.0001389843,0.00012277455,0.000039778068,0.010473156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911577,0.00027198694,0.000043161996,0.0001449391,0.00033826957,0.00008594338],"domain_scores_gemma":[0.9991799,0.00027349585,0.00011624716,0.00014985596,0.0001765418,0.00010398974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00089514774,0.00038002254,0.00036084984,0.00039390722,0.0006177197,0.0016003158,0.0006577446,0.0005539424,0.0033269909],"category_scores_gemma":[0.0024873374,0.00024878548,0.00044063758,0.00035366273,0.002613136,0.003632114,0.0022184427,0.0014421304,0.00023009545],"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.000007915607,0.000005684551,0.000082155864,0.00002057131,0.0000041577323,0.000038979782,0.00010309234,0.0036833559,0.0006451723,0.9922449,0.00012156889,0.0030424383],"study_design_scores_gemma":[0.000012274286,0.000029370385,0.00019674118,0.0000149027355,0.000003554327,0.00010102856,0.000089446956,0.09387094,0.00074684934,0.9006894,0.004233961,0.000011435645],"about_ca_topic_score_codex":0.00049817294,"about_ca_topic_score_gemma":0.00052573445,"teacher_disagreement_score":0.0033269909,"about_ca_system_score_codex":0.00053571974,"about_ca_system_score_gemma":0.00067714165,"threshold_uncertainty_score":0.011129856},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022818323,0.0000751981,0.99661887,0.000077798,0.00004398858,0.00004494122,0.000014164206,0.000034321198,0.0008088771],"genre_scores_gemma":[0.11009389,0.0004027433,0.88232946,0.00017969364,0.00013364501,0.0005667147,0.00014638779,0.00012449817,0.00602296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928755,0.00023877973,0.000036243528,0.00017838227,0.00020427302,0.000054773976],"domain_scores_gemma":[0.99961394,0.00015751993,0.00002594818,0.00004601133,0.000105696716,0.000050941613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015605399,0.0011237449,0.000987448,0.0004129223,0.00069635443,0.0009909539,0.0015646145,0.0016151875,0.0053370357],"category_scores_gemma":[0.0022724085,0.00046837406,0.00089251524,0.0005158505,0.0013889433,0.0019156365,0.0029964224,0.0027336993,0.0006828184],"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.00019807521,0.00011511145,0.0006915321,0.0006670211,0.00014390537,0.00028105808,0.00048441734,0.35815576,0.020353405,0.4582575,0.0044588824,0.1561933],"study_design_scores_gemma":[0.000028321843,0.000080842474,0.00006418665,0.000019908404,0.000011605284,0.000064619046,0.000019344474,0.9685365,0.0016072018,0.025763975,0.003786596,0.000016799175],"about_ca_topic_score_codex":0.0021992538,"about_ca_topic_score_gemma":0.0017767975,"teacher_disagreement_score":0.0053370357,"about_ca_system_score_codex":0.0006207432,"about_ca_system_score_gemma":0.001445051,"threshold_uncertainty_score":0.017854154},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021835722,0.0001303129,0.9958448,0.00016932166,0.00010627048,0.00003966806,0.000045264514,0.00046560194,0.0010152415],"genre_scores_gemma":[0.10364589,0.00031070065,0.88475245,0.0002403557,0.00016462269,0.00035183685,0.00027082767,0.00035447106,0.009908902],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921894,0.0002555106,0.000042058586,0.000115982395,0.0002630636,0.000104446335],"domain_scores_gemma":[0.9977908,0.0012901747,0.000091905255,0.00022126357,0.00049615616,0.00010971082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024568487,0.0009959912,0.0018835722,0.0006798993,0.0009213853,0.0014294207,0.002209814,0.0025486967,0.009481959],"category_scores_gemma":[0.0070837294,0.00094656186,0.0006931739,0.0011419038,0.0011290293,0.0016780014,0.0018410848,0.0039237444,0.0022698327],"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.00055070914,0.00025705097,0.00079173956,0.000251925,0.00012702771,0.00016950382,0.00012355679,0.53255177,0.0047697215,0.10640673,0.009527692,0.34447265],"study_design_scores_gemma":[0.000030264628,0.000018593842,0.00003253579,0.0000093833005,0.000006344222,0.000010486392,0.000003671432,0.9911305,0.0005687779,0.007306987,0.0008758739,0.0000066807856],"about_ca_topic_score_codex":0.008764648,"about_ca_topic_score_gemma":0.011241285,"teacher_disagreement_score":0.009481959,"about_ca_system_score_codex":0.0008454271,"about_ca_system_score_gemma":0.0035230352,"threshold_uncertainty_score":0.03172034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11046802,0.002175282,0.8508651,0.0023047188,0.00039192825,0.0000417534,0.00031055495,0.00013154445,0.03331108],"genre_scores_gemma":[0.679154,0.0026105847,0.27731642,0.00060967676,0.0006064193,0.00015976769,0.0005582522,0.0002687866,0.038716022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880004,0.0003953986,0.000050132698,0.00022236993,0.000443234,0.00008876371],"domain_scores_gemma":[0.99642724,0.0020537602,0.00022890157,0.00033401488,0.00061986764,0.00033625067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017892196,0.00075756654,0.0012322342,0.002330987,0.0018937945,0.0029602142,0.0019144926,0.002539887,0.004660088],"category_scores_gemma":[0.007964873,0.00054279796,0.0009665834,0.0021746214,0.0031587025,0.0041677244,0.00357225,0.0047607613,0.00091880665],"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.00004522663,0.000023088094,0.0001628571,0.000030493322,0.000012903658,0.000022640927,0.0000716133,0.008044125,0.00091896934,0.9784012,0.0010858104,0.011181185],"study_design_scores_gemma":[0.000012491642,0.00004699573,0.00025777493,0.00002118308,0.000011420867,0.00014359683,0.000052627252,0.12076031,0.00071740284,0.872547,0.0054042595,0.000024919953],"about_ca_topic_score_codex":0.0021337792,"about_ca_topic_score_gemma":0.00096608355,"teacher_disagreement_score":0.004660088,"about_ca_system_score_codex":0.0021024635,"about_ca_system_score_gemma":0.0011645161,"threshold_uncertainty_score":0.015589595},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.062118724,0.0003318657,0.9047351,0.0006423343,0.0001392369,0.00004018782,0.0000758712,0.00017651757,0.031740196],"genre_scores_gemma":[0.73997223,0.0010322074,0.1813979,0.00060691335,0.00042555865,0.00026142056,0.00022864414,0.0004917527,0.07558342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995376,0.00016728537,0.000017345123,0.000058941056,0.00017768248,0.00004115365],"domain_scores_gemma":[0.99934465,0.0003145604,0.000080813,0.000075501266,0.000103682454,0.000080883394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011048007,0.0006388717,0.0005952116,0.00085483055,0.0006474374,0.0021543785,0.0007488268,0.0011851302,0.008043952],"category_scores_gemma":[0.0022304964,0.0004155017,0.0006781123,0.00067051983,0.0014522992,0.0033032938,0.0021664484,0.002615553,0.0013587853],"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.000021021639,0.000022730721,0.000052191856,0.000021186672,0.000006377891,0.00002735418,0.00010088788,0.0056442353,0.0021800702,0.98107946,0.0007991365,0.010045365],"study_design_scores_gemma":[0.000011590177,0.000030807554,0.000054026576,0.000008656782,0.0000059490503,0.000076524506,0.00004095327,0.1185263,0.0012118084,0.8765333,0.0034863786,0.000013734409],"about_ca_topic_score_codex":0.00021979258,"about_ca_topic_score_gemma":0.00027980973,"teacher_disagreement_score":0.008043952,"about_ca_system_score_codex":0.00070662337,"about_ca_system_score_gemma":0.0004486897,"threshold_uncertainty_score":0.02690965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07689332,0.016810467,0.73106587,0.0071586776,0.0017763848,0.000071341994,0.00031061686,0.00014264922,0.16577072],"genre_scores_gemma":[0.69237745,0.019415146,0.1340577,0.0021877417,0.00259946,0.00018450615,0.0005068931,0.0005254768,0.14814557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988544,0.0005080821,0.00004799397,0.00013905858,0.00029160513,0.0001588567],"domain_scores_gemma":[0.9968092,0.0019668357,0.00022019629,0.0002367368,0.00053363916,0.00023333564],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032018367,0.0018745299,0.0014371517,0.003701157,0.0021726277,0.0032168494,0.0015946035,0.0026902207,0.007723828],"category_scores_gemma":[0.009525481,0.0009422999,0.001417724,0.0031796228,0.006386502,0.008314099,0.003256276,0.0067775627,0.0016657662],"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.0000136372655,0.000008762201,0.00005975328,0.000020730333,0.000004543915,0.000022298635,0.00008219689,0.0021321645,0.00025489222,0.9921291,0.00085162837,0.00442031],"study_design_scores_gemma":[0.0000052812456,0.0000075524777,0.00011411588,0.000021003547,0.000004779606,0.00004567511,0.000039682578,0.01442787,0.00019237956,0.98069155,0.004435774,0.000014203257],"about_ca_topic_score_codex":0.0037831457,"about_ca_topic_score_gemma":0.002207038,"teacher_disagreement_score":0.007723828,"about_ca_system_score_codex":0.0030236836,"about_ca_system_score_gemma":0.0012281343,"threshold_uncertainty_score":0.025838792},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02232997,0.011412852,0.9375955,0.0032694456,0.00093643175,0.00009546582,0.00025517173,0.00031501334,0.02379017],"genre_scores_gemma":[0.54170287,0.020876788,0.36789238,0.0039512566,0.0033775463,0.0009704095,0.0018804901,0.0027665517,0.056581683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99093425,0.0036910127,0.00051365484,0.0011029048,0.0028444235,0.00091381633],"domain_scores_gemma":[0.9180068,0.067236766,0.002251999,0.0037180814,0.006469704,0.002316818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.023468144,0.00478363,0.0041607916,0.005353895,0.0018798053,0.0061306264,0.0055682906,0.0057789995,0.00823218],"category_scores_gemma":[0.08017739,0.0018028393,0.002826075,0.0043491926,0.007664478,0.012581091,0.010706866,0.015803507,0.0013915038],"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.00057719834,0.00021121516,0.0012977077,0.0009544217,0.00020965844,0.00025183544,0.00082611985,0.15005928,0.004131104,0.77710253,0.006931085,0.057447962],"study_design_scores_gemma":[0.000032802793,0.00011647215,0.0006401644,0.0003451558,0.000076283475,0.00009745552,0.00012673292,0.4832416,0.001990837,0.5081217,0.005153092,0.000057655143],"about_ca_topic_score_codex":0.005571954,"about_ca_topic_score_gemma":0.003056789,"teacher_disagreement_score":0.023468144,"about_ca_system_score_codex":0.005266225,"about_ca_system_score_gemma":0.0023211397,"threshold_uncertainty_score":0.124112904},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3430729,0.00069553644,0.6154563,0.0018685079,0.00021555912,0.0001232688,0.00029394732,0.00020275131,0.038071334],"genre_scores_gemma":[0.94443655,0.00046713033,0.04366884,0.00031100947,0.0002300394,0.000100220546,0.00025041797,0.00013635935,0.010399422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989184,0.00027692688,0.000078291516,0.00023965086,0.0003175585,0.00016918404],"domain_scores_gemma":[0.99745506,0.0008941993,0.00041101893,0.00023661609,0.00064515515,0.0003578423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017447792,0.0006474128,0.0008051524,0.0012222478,0.00086548034,0.0015943623,0.00068314164,0.0010915877,0.0028184552],"category_scores_gemma":[0.0062364996,0.00032753745,0.0013755929,0.00034097032,0.0028100824,0.0027365647,0.0025803016,0.0026889225,0.00032845177],"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.00002461758,0.000013664895,0.0004378425,0.000054901626,0.000012502858,0.00013380665,0.00018983059,0.0065163914,0.007667089,0.9815073,0.00047061482,0.002971406],"study_design_scores_gemma":[0.000032481916,0.00014021291,0.0014514661,0.000050380946,0.000022044276,0.00040803335,0.00025627413,0.17233065,0.0061628767,0.8127388,0.0063461247,0.00006069764],"about_ca_topic_score_codex":0.0017505869,"about_ca_topic_score_gemma":0.001411416,"teacher_disagreement_score":0.0028184552,"about_ca_system_score_codex":0.0013082486,"about_ca_system_score_gemma":0.0012576891,"threshold_uncertainty_score":0.00949204},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007964362,0.0001322508,0.9892565,0.00012971251,0.000058490437,0.000032906362,0.000032275377,0.00016550059,0.0022279834],"genre_scores_gemma":[0.17161867,0.00023800468,0.8218574,0.00011178622,0.0001024747,0.0002888072,0.00016024354,0.00026588765,0.0053566964],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936396,0.00029777587,0.000031700114,0.0000631399,0.00019485124,0.000048523634],"domain_scores_gemma":[0.99895453,0.0005283294,0.00008285256,0.00015346741,0.0002021549,0.00007859486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013801615,0.0010293768,0.0013993398,0.0008745335,0.00072884245,0.00143561,0.0012745272,0.0010660691,0.0042929747],"category_scores_gemma":[0.0039872983,0.0007106616,0.00078260415,0.0010448741,0.0010485947,0.002213302,0.0024566292,0.0023722777,0.0007021032],"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.0002330189,0.0002597562,0.00048824295,0.0002776809,0.00010238981,0.0001559972,0.00021517291,0.523475,0.006147037,0.2815288,0.0068368413,0.18028003],"study_design_scores_gemma":[0.0000109178245,0.000027145494,0.000029342349,0.000005391649,0.0000042535935,0.000011172034,0.000006561296,0.98040384,0.00029712913,0.018357912,0.0008416635,0.0000046642594],"about_ca_topic_score_codex":0.0017629997,"about_ca_topic_score_gemma":0.002708561,"teacher_disagreement_score":0.0042929747,"about_ca_system_score_codex":0.0006760661,"about_ca_system_score_gemma":0.0016024009,"threshold_uncertainty_score":0.0143613815},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39863425,0.0012334723,0.51032096,0.0020493441,0.00030578574,0.00030493946,0.00038392845,0.00037177102,0.08639556],"genre_scores_gemma":[0.9455496,0.00053792686,0.038236283,0.00026726295,0.00009023047,0.00024081612,0.00014236337,0.000073354044,0.014862183],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985947,0.00036557036,0.00012374751,0.00025367932,0.00046621225,0.0001960437],"domain_scores_gemma":[0.9961597,0.0020672127,0.00020473459,0.00034603654,0.00092747004,0.00029484477],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047240313,0.0003840496,0.0008941943,0.0010521886,0.00082439615,0.0016554963,0.0010584873,0.00088017585,0.0066099893],"category_scores_gemma":[0.007933047,0.00028230928,0.00096224964,0.00032018684,0.0026621835,0.0035391336,0.002433074,0.0018973796,0.0005939495],"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.000033939054,0.000019311961,0.00027672038,0.00006113926,0.000010804006,0.00029929166,0.00035386108,0.0015168587,0.004789409,0.9890531,0.000492551,0.003093108],"study_design_scores_gemma":[0.000054697917,0.00008766298,0.0005477186,0.00004170789,0.000015050208,0.00046367565,0.00031328417,0.027238593,0.004592314,0.9619361,0.0046746563,0.000034532863],"about_ca_topic_score_codex":0.0009938353,"about_ca_topic_score_gemma":0.0006480579,"teacher_disagreement_score":0.0066099893,"about_ca_system_score_codex":0.0010659066,"about_ca_system_score_gemma":0.0013001523,"threshold_uncertainty_score":0.024983346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003219482,0.00009847237,0.9945904,0.000085163694,0.000055551103,0.000026683723,0.000017830762,0.00016230534,0.0017441559],"genre_scores_gemma":[0.20845254,0.00030651648,0.7742078,0.00021258096,0.00015408355,0.00031176695,0.00014538878,0.00027610397,0.01593327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950826,0.00015775267,0.000023056728,0.000054711512,0.00022165815,0.000034568402],"domain_scores_gemma":[0.99937314,0.00027562512,0.00004129567,0.00007076161,0.00017844672,0.00006070192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013151423,0.0007802069,0.0013761865,0.0007131002,0.00061174773,0.0010765879,0.001931326,0.0015407637,0.006734354],"category_scores_gemma":[0.0021728333,0.00060086703,0.0006744473,0.0008422747,0.0009922184,0.001356719,0.0025764632,0.0014704227,0.0012078108],"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.00038677067,0.0002673699,0.000476783,0.0005092152,0.00009724958,0.00020996034,0.00015691282,0.6742942,0.012318633,0.07384793,0.0056472486,0.23178777],"study_design_scores_gemma":[0.000017960827,0.00005312855,0.000046809073,0.000008949186,0.000006757327,0.000029281084,0.0000068176946,0.99142087,0.000746396,0.0059908093,0.0016626822,0.000009502378],"about_ca_topic_score_codex":0.0014801212,"about_ca_topic_score_gemma":0.0019240453,"teacher_disagreement_score":0.006734354,"about_ca_system_score_codex":0.00049462327,"about_ca_system_score_gemma":0.0012988811,"threshold_uncertainty_score":0.022528589},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015324041,0.00021376109,0.9965419,0.000109629735,0.00001942544,0.000011479925,0.0000110533465,0.000045838446,0.0015143908],"genre_scores_gemma":[0.21876769,0.0010962893,0.7719165,0.00013188393,0.00012252181,0.00027160937,0.00013098608,0.00022180969,0.0073407413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996099,0.00016390994,0.000019330844,0.00005734508,0.0001287398,0.000020913967],"domain_scores_gemma":[0.9994343,0.00035136173,0.00004967765,0.000049200462,0.00009532138,0.000020078593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013094927,0.00095807546,0.0007065968,0.0006617331,0.00044654493,0.0008071762,0.0008942905,0.0010138917,0.0020833455],"category_scores_gemma":[0.0027385564,0.0005700877,0.0007062925,0.00063375506,0.0014532496,0.0014512616,0.0015148938,0.0018648178,0.00044954722],"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.000035854908,0.000017298427,0.00023284431,0.0001387103,0.00003610856,0.000041103536,0.00012751625,0.52333826,0.0019865572,0.39691874,0.0018459727,0.07528112],"study_design_scores_gemma":[0.000006074634,0.000022858578,0.000078985344,0.00001075139,0.000004121246,0.000022554166,0.000010860429,0.898791,0.00059409393,0.09764069,0.0028084028,0.0000096297845],"about_ca_topic_score_codex":0.002385948,"about_ca_topic_score_gemma":0.0015829259,"teacher_disagreement_score":0.002385948,"about_ca_system_score_codex":0.0009727339,"about_ca_system_score_gemma":0.0008495479,"threshold_uncertainty_score":0.0070577264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017790959,0.00007403029,0.9968777,0.000054626933,0.000020431582,0.00001800098,0.000008240759,0.000041229418,0.0011267466],"genre_scores_gemma":[0.18213056,0.0005360365,0.8019631,0.00013647575,0.000104265426,0.00037058702,0.00010467152,0.00013483957,0.014519478],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99949956,0.00020150932,0.00001685057,0.000064022635,0.00017905387,0.0000390371],"domain_scores_gemma":[0.9996673,0.00013228013,0.00003253774,0.000028678167,0.0000900981,0.000049131788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012766053,0.00083534856,0.0009864813,0.0008652882,0.00054581277,0.0009383525,0.0013031915,0.0013815016,0.003306251],"category_scores_gemma":[0.0014905405,0.00043651974,0.0008809772,0.00047515743,0.0012988404,0.0011721969,0.002111774,0.0016745628,0.0009241482],"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.000079772755,0.00009287291,0.0003041372,0.00026992257,0.000056450946,0.0001928233,0.00022015379,0.5796551,0.009067326,0.34432676,0.0018860982,0.063848495],"study_design_scores_gemma":[0.0000151673685,0.00006797757,0.000038129783,0.000018128294,0.000007698604,0.000033103126,0.000015165273,0.96834254,0.0009999821,0.026931204,0.0035172123,0.000013570617],"about_ca_topic_score_codex":0.0014654757,"about_ca_topic_score_gemma":0.0014403906,"teacher_disagreement_score":0.003306251,"about_ca_system_score_codex":0.00053320726,"about_ca_system_score_gemma":0.0014059605,"threshold_uncertainty_score":0.011060476},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11706677,0.0025297482,0.8060737,0.0012763147,0.00021298035,0.000056353187,0.00017875168,0.00020703133,0.07239831],"genre_scores_gemma":[0.9040061,0.0029103574,0.06801089,0.0003543636,0.00036788784,0.00013147603,0.00023043489,0.00011101842,0.023877459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992574,0.00024248962,0.000053866002,0.00011229316,0.0002506117,0.00008338761],"domain_scores_gemma":[0.9987006,0.0005259693,0.0001706563,0.00015305237,0.00035321157,0.00009647481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091754424,0.00080877077,0.00050161395,0.0012284892,0.000589347,0.0011232536,0.0006415062,0.0006927008,0.003858302],"category_scores_gemma":[0.0027958571,0.00031783586,0.00065715745,0.00072326325,0.002002185,0.0026550842,0.0016713246,0.0019901234,0.0004970737],"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.000046818637,0.000025360521,0.0007015041,0.000115697134,0.000016584161,0.00041413223,0.00026031237,0.018727392,0.006259914,0.946926,0.0012133494,0.025292944],"study_design_scores_gemma":[0.000012288323,0.00012933247,0.0009030163,0.00007755905,0.000018389626,0.0011645653,0.0002306489,0.16697505,0.0064608385,0.803223,0.020766823,0.00003855015],"about_ca_topic_score_codex":0.0005714913,"about_ca_topic_score_gemma":0.00048569788,"teacher_disagreement_score":0.003858302,"about_ca_system_score_codex":0.00070890994,"about_ca_system_score_gemma":0.00051399326,"threshold_uncertainty_score":0.012907267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2161723,0.001190439,0.7016481,0.0023623768,0.00011403162,0.00008345859,0.00030835054,0.00014292556,0.077977955],"genre_scores_gemma":[0.9363074,0.0007499095,0.052651264,0.0003728952,0.00014485484,0.00014386568,0.00016469478,0.00009238751,0.009372756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815947,0.00076763134,0.000102363236,0.00026243,0.00049000286,0.0002181451],"domain_scores_gemma":[0.98309326,0.012225612,0.0014592815,0.0009901924,0.001354173,0.00087740034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005769427,0.0007900876,0.0013003566,0.0015401198,0.0014506807,0.0034716919,0.0014897465,0.0011657431,0.007390211],"category_scores_gemma":[0.021146737,0.0008477831,0.0011205188,0.0014335574,0.0052972524,0.006878997,0.0034556463,0.0037972864,0.00043865023],"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.00003315878,0.000022462129,0.0002587446,0.00002539086,0.000014989855,0.000039206265,0.00006169447,0.007990904,0.00037046702,0.9876583,0.00047488135,0.0030498179],"study_design_scores_gemma":[0.000013941176,0.000020070525,0.00027893338,0.000013971256,0.0000067259325,0.00004672362,0.000040721672,0.030609641,0.00018100928,0.9682247,0.00055447133,0.00000903763],"about_ca_topic_score_codex":0.0013257975,"about_ca_topic_score_gemma":0.0011177182,"teacher_disagreement_score":0.007390211,"about_ca_system_score_codex":0.0012856115,"about_ca_system_score_gemma":0.0014446052,"threshold_uncertainty_score":0.030512035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11584662,0.0016511196,0.87176883,0.0012624615,0.00018803412,0.00013049334,0.000055999484,0.00011146667,0.008984935],"genre_scores_gemma":[0.8553526,0.0019162898,0.121333875,0.00030949828,0.0001833283,0.0003915071,0.0001413182,0.00022371678,0.020147849],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99755836,0.0012780799,0.00011459299,0.00030390066,0.0005613639,0.00018357039],"domain_scores_gemma":[0.9705287,0.022519374,0.0016916821,0.0007394508,0.0032894502,0.0012313031],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009780143,0.0021090605,0.0023660688,0.0028028493,0.0015605391,0.0028511877,0.0028375322,0.0036055897,0.0026176288],"category_scores_gemma":[0.04527501,0.00096604903,0.0019517962,0.001080659,0.006077539,0.0047886088,0.0062405816,0.0045164186,0.00023757185],"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.00029376845,0.00008378207,0.0014223006,0.00031432603,0.00010411833,0.0002506457,0.0007730104,0.27351353,0.0038956208,0.70790243,0.00066063367,0.010785768],"study_design_scores_gemma":[0.000016489297,0.000065292224,0.000142947,0.00003839376,0.000015680704,0.00005604129,0.000042732187,0.9211626,0.00052862,0.07745183,0.00045425468,0.000025117793],"about_ca_topic_score_codex":0.005120852,"about_ca_topic_score_gemma":0.002166935,"teacher_disagreement_score":0.009780143,"about_ca_system_score_codex":0.0027799704,"about_ca_system_score_gemma":0.0026868684,"threshold_uncertainty_score":0.051722944},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009641734,0.0029019492,0.97088766,0.0011746183,0.00015964906,0.0000261409,0.00008071685,0.00006607983,0.015061475],"genre_scores_gemma":[0.8045715,0.0065274225,0.16798958,0.0011359144,0.0010578639,0.00028282907,0.00017139227,0.000361335,0.017902141],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987122,0.0006553827,0.00004113649,0.00016950374,0.00034241608,0.00007936695],"domain_scores_gemma":[0.99644107,0.0027961365,0.00020945788,0.00018944069,0.0002645153,0.00009940471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003417708,0.0014106003,0.0014329862,0.0013624531,0.0005893905,0.0017673613,0.0014081802,0.0014281172,0.00239914],"category_scores_gemma":[0.009536699,0.00076577265,0.00180495,0.00121877,0.0023183466,0.003391849,0.003331532,0.0028311873,0.00028654686],"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.000041525658,0.000032376658,0.00048182576,0.0002554002,0.00016450505,0.00017851763,0.00014982185,0.24375282,0.0018767449,0.72233325,0.0031292674,0.027603896],"study_design_scores_gemma":[0.000007502476,0.000021378639,0.00020962191,0.000039435385,0.000024581332,0.000054802957,0.000015259868,0.44854572,0.00033740513,0.54862374,0.0021046293,0.000015969817],"about_ca_topic_score_codex":0.0015916137,"about_ca_topic_score_gemma":0.0009006024,"teacher_disagreement_score":0.003417708,"about_ca_system_score_codex":0.0009343392,"about_ca_system_score_gemma":0.00077715196,"threshold_uncertainty_score":0.01807481},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047809836,0.00055545015,0.98943394,0.0002472463,0.00006184967,0.000038863353,0.000097543074,0.00009597387,0.0046881507],"genre_scores_gemma":[0.19590595,0.0011162547,0.79058623,0.0002950886,0.00023728205,0.00046803057,0.00080006354,0.00039032203,0.010200796],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998162,0.0007120977,0.00008676333,0.00031570977,0.00058896065,0.00013453413],"domain_scores_gemma":[0.99610907,0.0029364428,0.00017604606,0.00022622295,0.00038351686,0.00016862138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034974073,0.0014522176,0.0018628184,0.0011143119,0.0008230382,0.0032534346,0.0022238079,0.001743192,0.006783388],"category_scores_gemma":[0.010850091,0.0015345783,0.0010861596,0.0018058429,0.0022829932,0.003757755,0.0029082804,0.0070482437,0.0007293087],"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.00023997936,0.00013957961,0.00031546014,0.00045877957,0.00009607083,0.00009451268,0.00024496016,0.20012757,0.0018952887,0.67645484,0.0066011953,0.11333177],"study_design_scores_gemma":[0.000039292772,0.000043096516,0.00010445786,0.000053307507,0.00002279661,0.000037670554,0.00003614704,0.48170835,0.00047334904,0.51359147,0.0038752,0.000014841861],"about_ca_topic_score_codex":0.0022962026,"about_ca_topic_score_gemma":0.0027786316,"teacher_disagreement_score":0.006783388,"about_ca_system_score_codex":0.0017611922,"about_ca_system_score_gemma":0.001054904,"threshold_uncertainty_score":0.02269274},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39599258,0.00044088447,0.59432495,0.00031622342,0.00007416227,0.000057217123,0.00014768043,0.00013468349,0.008511634],"genre_scores_gemma":[0.9312025,0.0004102956,0.06254442,0.000085017375,0.00005152666,0.000068912486,0.00018101787,0.00005209214,0.0054043448],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995727,0.00011257127,0.000026403366,0.000067734436,0.00014362497,0.00007696332],"domain_scores_gemma":[0.99867815,0.0005104099,0.00023834617,0.00018692097,0.00022562029,0.00016056362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010847326,0.0007085159,0.0006450886,0.0011771696,0.00059954554,0.0014395707,0.0007849023,0.0007704903,0.0012844892],"category_scores_gemma":[0.0042420644,0.00041504548,0.0006193382,0.00055389386,0.0015559122,0.0014228385,0.001647747,0.0009818624,0.00030268382],"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.00014768573,0.00007942635,0.0050460543,0.000101719306,0.00005692305,0.00050566375,0.0003860894,0.17423737,0.018140309,0.79006934,0.0006631142,0.010566332],"study_design_scores_gemma":[0.000015715148,0.00010670769,0.0021779446,0.000051019197,0.000024668685,0.00022839721,0.00020042507,0.80733085,0.007675334,0.17944756,0.0027135347,0.000027860346],"about_ca_topic_score_codex":0.001971891,"about_ca_topic_score_gemma":0.0015010587,"teacher_disagreement_score":0.001971891,"about_ca_system_score_codex":0.0013365452,"about_ca_system_score_gemma":0.0005958555,"threshold_uncertainty_score":0.009697378},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14794967,0.0020076314,0.8125564,0.0013613993,0.00021593942,0.00010271615,0.00009691001,0.00016232854,0.035547063],"genre_scores_gemma":[0.8460027,0.001831427,0.12547968,0.00042882154,0.00028920028,0.00025083157,0.00019150188,0.00020155749,0.025324311],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982729,0.00066133967,0.00010110413,0.00025575457,0.00054912904,0.00015971699],"domain_scores_gemma":[0.98929507,0.0071805282,0.00057458604,0.0006290935,0.0015740325,0.00074662827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051085767,0.0010315551,0.001339359,0.0023304694,0.0017522183,0.002869368,0.0019564861,0.0017227639,0.003397789],"category_scores_gemma":[0.015317794,0.0007943522,0.0016400989,0.0013883355,0.0064331144,0.005808967,0.0041848086,0.003973906,0.00038702996],"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.0001163526,0.00003079904,0.00038553533,0.00010777699,0.00002305044,0.00011491603,0.0005401809,0.010715424,0.0030109969,0.97836804,0.0004622115,0.006124753],"study_design_scores_gemma":[0.00003538237,0.000112555455,0.00042443848,0.000041093852,0.000017825425,0.00018250433,0.00016837315,0.16859229,0.0032032921,0.8247105,0.0024705094,0.000041188647],"about_ca_topic_score_codex":0.0014958526,"about_ca_topic_score_gemma":0.0011308064,"teacher_disagreement_score":0.0051085767,"about_ca_system_score_codex":0.0013931957,"about_ca_system_score_gemma":0.0012761987,"threshold_uncertainty_score":0.027017057},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040158257,0.00043688325,0.94948554,0.0004424333,0.00011835574,0.00003834124,0.00006877554,0.00011918292,0.009132192],"genre_scores_gemma":[0.7728089,0.00048370846,0.20485994,0.00034137405,0.00018058065,0.0001905223,0.0003064252,0.00043118364,0.020397436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99911124,0.00035026285,0.00002705415,0.00020573441,0.00022153166,0.000084213374],"domain_scores_gemma":[0.99840516,0.00089423795,0.00014955479,0.00013017186,0.0002710666,0.00014975875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003172404,0.0015833254,0.0017361483,0.00082341273,0.00030183402,0.002002122,0.0013605562,0.0020417667,0.0025448545],"category_scores_gemma":[0.0047199284,0.0005206373,0.00067621755,0.0004371308,0.0019190448,0.0020728912,0.0022801752,0.001698048,0.0004473069],"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.00035861228,0.00016932198,0.00074233656,0.00039658247,0.00010616452,0.00014739414,0.00016627932,0.66167223,0.016823284,0.26990688,0.0032031971,0.046307676],"study_design_scores_gemma":[0.000013680482,0.00012784447,0.00015598151,0.000017762746,0.000012036379,0.000047965546,0.000023325765,0.9755436,0.0018412685,0.021097457,0.0011035133,0.000015550526],"about_ca_topic_score_codex":0.00077452627,"about_ca_topic_score_gemma":0.0007090826,"teacher_disagreement_score":0.003172404,"about_ca_system_score_codex":0.0014311465,"about_ca_system_score_gemma":0.0010420459,"threshold_uncertainty_score":0.016777456},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0064094015,0.00038170023,0.99043536,0.00031106645,0.000079593716,0.00003317042,0.00004146576,0.00008402436,0.002224306],"genre_scores_gemma":[0.36239046,0.0010751183,0.6237135,0.00048455314,0.0002531004,0.0004872199,0.00040870573,0.0007504791,0.0104368655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986255,0.0007612934,0.000050344555,0.00011575135,0.00034248302,0.00010461242],"domain_scores_gemma":[0.9979328,0.0012879793,0.00012303377,0.0001810355,0.00034235485,0.0001328612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038769064,0.0016077085,0.0018966177,0.0010091157,0.0004475129,0.0016717472,0.0016095686,0.0024813465,0.0031057277],"category_scores_gemma":[0.008803337,0.00072589616,0.000934361,0.0008396023,0.0016922905,0.0027538487,0.0029369576,0.003288927,0.00056469813],"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.00021945804,0.00012103315,0.00029308748,0.00044141943,0.00007906059,0.00011471237,0.00017198327,0.49354932,0.0054666516,0.4387815,0.005232638,0.055529192],"study_design_scores_gemma":[0.000012676278,0.000023212522,0.00004249001,0.000023069733,0.0000057684133,0.000019630295,0.0000118402595,0.942836,0.00037427494,0.05553186,0.0011112727,0.000007889224],"about_ca_topic_score_codex":0.0013361927,"about_ca_topic_score_gemma":0.0012202599,"teacher_disagreement_score":0.0038769064,"about_ca_system_score_codex":0.0012352931,"about_ca_system_score_gemma":0.001564026,"threshold_uncertainty_score":0.020503283},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011095967,0.002030372,0.9708457,0.0013770121,0.00041609677,0.0000858002,0.00012235872,0.0001108068,0.013915935],"genre_scores_gemma":[0.329254,0.008351013,0.6050487,0.0017917828,0.0021767733,0.0012331384,0.0005039152,0.0006628604,0.050977908],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987986,0.00041791517,0.00007523539,0.00026887128,0.00032340613,0.000115965],"domain_scores_gemma":[0.99240935,0.005431783,0.0004653946,0.0002826148,0.00090706017,0.00050375913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073038493,0.0029954966,0.0024381864,0.005616861,0.0019321964,0.0035962092,0.0037265457,0.0031113739,0.0068043536],"category_scores_gemma":[0.020290788,0.0016443032,0.0045379554,0.003262933,0.004803995,0.010158552,0.005973647,0.00980283,0.00078425964],"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.000046604455,0.000043151962,0.00024120668,0.00015273027,0.00007446973,0.00012829428,0.00029015917,0.014516297,0.0015901419,0.96806157,0.0022922175,0.012563035],"study_design_scores_gemma":[0.00003886747,0.000075745615,0.00032569384,0.00006472536,0.00008030909,0.00019388994,0.0001101715,0.13255486,0.0009880759,0.85893285,0.0065851635,0.000049593586],"about_ca_topic_score_codex":0.0016901434,"about_ca_topic_score_gemma":0.0018787911,"teacher_disagreement_score":0.0073038493,"about_ca_system_score_codex":0.0027478025,"about_ca_system_score_gemma":0.0015859137,"threshold_uncertainty_score":0.03862691},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017734168,0.0008910305,0.96475005,0.0005527347,0.00009982091,0.00004088547,0.000056211036,0.00004586022,0.015829194],"genre_scores_gemma":[0.63697994,0.0027494996,0.3409069,0.0006132298,0.000318458,0.00030916004,0.00025984523,0.000082642175,0.017780302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993961,0.00021325467,0.000025429737,0.000083643965,0.00022967294,0.00005188438],"domain_scores_gemma":[0.99944776,0.00027573376,0.00005168507,0.000061040955,0.00012214275,0.000041588777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017995231,0.00048322012,0.0006690067,0.00070576364,0.00047546552,0.0009091699,0.0012601346,0.0008737697,0.0022415356],"category_scores_gemma":[0.0023243541,0.00022995574,0.00074710435,0.0007663223,0.0022504712,0.0024558944,0.0013634844,0.0020396109,0.00032580123],"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.000008258194,0.000008548612,0.000059406506,0.000039992767,0.000006955847,0.000029703806,0.000054363292,0.006240372,0.0016169345,0.9869529,0.00034712354,0.0046353946],"study_design_scores_gemma":[0.000017465563,0.000053421692,0.00019062238,0.00003116993,0.000009143969,0.000116758165,0.000045961246,0.15290524,0.0014659701,0.8362224,0.00892786,0.000014032088],"about_ca_topic_score_codex":0.0007748153,"about_ca_topic_score_gemma":0.000653467,"teacher_disagreement_score":0.0022415356,"about_ca_system_score_codex":0.00082211173,"about_ca_system_score_gemma":0.00093989645,"threshold_uncertainty_score":0.009516895},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026493212,0.00028649162,0.9923707,0.00037755887,0.000060231137,0.00005608878,0.00003493939,0.0002456206,0.003918977],"genre_scores_gemma":[0.06957828,0.0006723064,0.9182022,0.00035776175,0.00009607068,0.0003788102,0.00016786724,0.00036966722,0.010176985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977603,0.00072839175,0.00011877272,0.00031204798,0.000870958,0.00020943099],"domain_scores_gemma":[0.9969572,0.0013653042,0.00015341448,0.00058810314,0.00077667413,0.00015934471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003859539,0.0011013787,0.0012713433,0.0015378204,0.0010111579,0.0019060775,0.0020521025,0.0026429547,0.007490873],"category_scores_gemma":[0.011391625,0.00074369967,0.0009492782,0.0017993777,0.0025482993,0.0033408995,0.004495159,0.00414724,0.0033515352],"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.00021344633,0.00011433662,0.00066887407,0.00021169744,0.00007276382,0.00013206506,0.0003322898,0.13099481,0.005417937,0.62500805,0.00898194,0.2278517],"study_design_scores_gemma":[0.0000906744,0.00011269685,0.000259237,0.000080533435,0.000018104382,0.00026579367,0.000076630306,0.77882665,0.0061203716,0.19765103,0.016432462,0.00006576057],"about_ca_topic_score_codex":0.002987667,"about_ca_topic_score_gemma":0.0032246355,"teacher_disagreement_score":0.007490873,"about_ca_system_score_codex":0.0011596439,"about_ca_system_score_gemma":0.0035299724,"threshold_uncertainty_score":0.025059462},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039328826,0.00022264208,0.9940899,0.00011281885,0.000022591654,0.000012972985,0.000007446108,0.000055796252,0.0015429513],"genre_scores_gemma":[0.21316518,0.0004793401,0.7819083,0.00011880339,0.00008325989,0.00019336618,0.000059270158,0.00016525266,0.003827249],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990447,0.000448235,0.00006133255,0.00011334312,0.0002564906,0.00007585644],"domain_scores_gemma":[0.99881136,0.0007495114,0.00011936581,0.00011710463,0.00016481831,0.00003783958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021390417,0.0011199878,0.001762879,0.0009345582,0.0006204853,0.0019909013,0.0012969194,0.0015957541,0.0031195336],"category_scores_gemma":[0.0064416355,0.001101098,0.0011939115,0.001777294,0.00093671697,0.0022545755,0.00296954,0.002119254,0.00051060267],"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.000082883846,0.000094228504,0.00038792402,0.0002790082,0.00012331498,0.00006628235,0.000118978955,0.78898346,0.0016146114,0.09150153,0.0015690157,0.11517871],"study_design_scores_gemma":[0.0000085574775,0.000023226323,0.000030971103,0.000015096399,0.000009403859,0.000022551176,0.000014791213,0.9783155,0.0004219981,0.020277178,0.0008559694,0.0000049031078],"about_ca_topic_score_codex":0.0010675382,"about_ca_topic_score_gemma":0.001330614,"teacher_disagreement_score":0.0031195336,"about_ca_system_score_codex":0.00048059993,"about_ca_system_score_gemma":0.0009611777,"threshold_uncertainty_score":0.011312485},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009142098,0.0023813527,0.97170377,0.0022399882,0.00025233533,0.000036398007,0.00008726724,0.00003458625,0.014122323],"genre_scores_gemma":[0.46569896,0.010197393,0.49448934,0.0014647021,0.0018001965,0.0005879969,0.00053182227,0.0005164503,0.02471319],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99690175,0.0021212783,0.00014091209,0.00023177947,0.000495131,0.000109164794],"domain_scores_gemma":[0.9833083,0.013792633,0.0006573138,0.00050701614,0.0013715597,0.00036311778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0123094795,0.0016839604,0.0027202559,0.0022588444,0.0012749698,0.0035305745,0.002216277,0.0025911888,0.003923364],"category_scores_gemma":[0.034877352,0.0014247173,0.001690136,0.0025551794,0.005511647,0.008706605,0.0034487266,0.005687495,0.00045925667],"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.000025337411,0.000019562303,0.00013339652,0.00010745128,0.00002890112,0.00004075214,0.0000857416,0.034247827,0.00019665099,0.9586282,0.0014818847,0.0050043357],"study_design_scores_gemma":[0.000009011972,0.000017325963,0.000086333814,0.000045011628,0.0000100440175,0.0000157758,0.00001809667,0.12010367,0.00008943158,0.87801594,0.0015757306,0.000013586443],"about_ca_topic_score_codex":0.0023246417,"about_ca_topic_score_gemma":0.0021803074,"teacher_disagreement_score":0.0123094795,"about_ca_system_score_codex":0.0022907343,"about_ca_system_score_gemma":0.0024027058,"threshold_uncertainty_score":0.06509954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11136858,0.0017155997,0.8424796,0.0036417537,0.00021093052,0.00016460437,0.0003941693,0.00017149544,0.03985328],"genre_scores_gemma":[0.8324753,0.0024423033,0.12318926,0.00069040386,0.00034979926,0.00050840527,0.00075750425,0.0004213325,0.039165646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912065,0.00041307547,0.00005722231,0.00016559611,0.00017896073,0.00006453409],"domain_scores_gemma":[0.9971554,0.0013835274,0.00037058652,0.00012801969,0.0005285551,0.00043391556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037870295,0.001564759,0.0021098242,0.0015411628,0.001254536,0.0044633322,0.0014891402,0.0019866233,0.0035030658],"category_scores_gemma":[0.011294026,0.0010111376,0.0013316637,0.0015110371,0.003277807,0.00359447,0.0032445274,0.0034039628,0.00042403632],"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.00008131907,0.000050783747,0.0004518605,0.00017624756,0.00005509638,0.00014252629,0.00023115112,0.035545416,0.0015528591,0.95435375,0.0020533907,0.0053056846],"study_design_scores_gemma":[0.000032319007,0.000079032005,0.00033126897,0.000053150787,0.00003077637,0.00008591058,0.00015377652,0.272192,0.0005383383,0.7244409,0.0020377433,0.000024792462],"about_ca_topic_score_codex":0.002667732,"about_ca_topic_score_gemma":0.0021731788,"teacher_disagreement_score":0.0044633322,"about_ca_system_score_codex":0.0025198164,"about_ca_system_score_gemma":0.0024722174,"threshold_uncertainty_score":0.020027936},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.107137196,0.002284375,0.80469775,0.0056181075,0.00037510006,0.000067482055,0.00058463577,0.00031319883,0.07892211],"genre_scores_gemma":[0.8980037,0.0029513969,0.07508791,0.001426286,0.0010866616,0.00035865817,0.00089225377,0.00047608785,0.019717118],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978982,0.00055582693,0.00009539205,0.00040751838,0.0007355152,0.00030754137],"domain_scores_gemma":[0.98556745,0.010255973,0.00082361244,0.0008593037,0.0018380319,0.0006557437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004361442,0.0012782217,0.0011290385,0.0021496653,0.0009492315,0.003520431,0.0012143748,0.0012048263,0.008191884],"category_scores_gemma":[0.024825482,0.000449414,0.001159036,0.0011066193,0.0039792317,0.0057334746,0.002908004,0.0043212194,0.0013786717],"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.00011237917,0.000022148553,0.00062636146,0.00011946225,0.000028238233,0.00017892565,0.00017516245,0.010493733,0.0040570903,0.96943,0.0030496262,0.011706773],"study_design_scores_gemma":[0.000019638,0.00008447976,0.0016183177,0.0000882821,0.000022414344,0.00041273749,0.000099677134,0.12270221,0.0038007083,0.8639544,0.0071584894,0.000038668728],"about_ca_topic_score_codex":0.0005535985,"about_ca_topic_score_gemma":0.00035563263,"teacher_disagreement_score":0.008191884,"about_ca_system_score_codex":0.0015752998,"about_ca_system_score_gemma":0.000782988,"threshold_uncertainty_score":0.027404606},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008153311,0.000278201,0.98984736,0.00008574529,0.000023699262,0.000017833065,0.00000945498,0.00005233428,0.001532061],"genre_scores_gemma":[0.5663248,0.0007351094,0.42535466,0.00013481705,0.00006985111,0.00024867413,0.00007701287,0.00006941276,0.006985664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997217,0.00007938432,0.000017861088,0.000048420334,0.0000987949,0.000033773227],"domain_scores_gemma":[0.99961287,0.00018887398,0.000052347314,0.000035743247,0.00007136773,0.000038885828],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008245827,0.00079142174,0.0007973573,0.00061322347,0.00044335958,0.00079463574,0.0012340742,0.00091071666,0.0017314019],"category_scores_gemma":[0.0015950274,0.0003897359,0.0008218709,0.0003283444,0.0010448139,0.0014728092,0.0016457888,0.0011376549,0.00026387104],"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.000056222612,0.00004276029,0.0005991911,0.00022568177,0.00006928022,0.00014635843,0.00017424655,0.6383387,0.007253536,0.32104573,0.0006213936,0.031426966],"study_design_scores_gemma":[0.000007950197,0.000021398411,0.000043577347,0.00000934298,0.000007510969,0.00001753972,0.000010425054,0.9780316,0.0005764596,0.020417668,0.0008501325,0.0000063471603],"about_ca_topic_score_codex":0.0014695465,"about_ca_topic_score_gemma":0.0013698767,"teacher_disagreement_score":0.0017314019,"about_ca_system_score_codex":0.00067042845,"about_ca_system_score_gemma":0.0007219697,"threshold_uncertainty_score":0.0057920814},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14355978,0.0012940351,0.77169234,0.0022745987,0.00033168882,0.00014742892,0.0002528161,0.0001716056,0.08027568],"genre_scores_gemma":[0.8413387,0.001221086,0.10025222,0.0007918564,0.00038825712,0.00040670644,0.00019895697,0.0001074253,0.05529487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915767,0.00028981006,0.00004412281,0.00015006556,0.00026679542,0.00009154892],"domain_scores_gemma":[0.9985038,0.00055960496,0.00012444486,0.00010931687,0.00046937598,0.0002335456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024622115,0.000850323,0.00058855384,0.0012141567,0.0010765966,0.0012163527,0.00088562095,0.00085004757,0.004129122],"category_scores_gemma":[0.0045155077,0.0002678217,0.0010291389,0.00046824233,0.0026014242,0.0025151097,0.0029215878,0.002353318,0.00058394513],"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.000036130456,0.000013741984,0.00026834145,0.00004453834,0.000017126591,0.00007183432,0.00019698427,0.0028317731,0.0035875672,0.9871629,0.00071110425,0.0050579277],"study_design_scores_gemma":[0.000026111244,0.00018248372,0.00085374014,0.000041971576,0.000014237192,0.00035319722,0.00016318922,0.08986755,0.0048111356,0.8949353,0.008713608,0.0000375918],"about_ca_topic_score_codex":0.0009462351,"about_ca_topic_score_gemma":0.0006229378,"teacher_disagreement_score":0.004129122,"about_ca_system_score_codex":0.0010834876,"about_ca_system_score_gemma":0.0013984824,"threshold_uncertainty_score":0.013813257},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036123306,0.0010303372,0.89963186,0.0022060685,0.00037701483,0.00019841648,0.0007646231,0.00020449985,0.059463903],"genre_scores_gemma":[0.7220702,0.0026151447,0.21621193,0.0010728869,0.0009733116,0.0011618299,0.0019068433,0.0008495697,0.0531383],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99805546,0.00059424835,0.00013281369,0.00026539477,0.00057699945,0.0003751085],"domain_scores_gemma":[0.9893919,0.007350474,0.00061150786,0.00034369677,0.0018299499,0.00047245686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047772555,0.002258969,0.0022067819,0.0030329549,0.0014309278,0.0043245135,0.0019994427,0.0026885786,0.014400814],"category_scores_gemma":[0.013584559,0.0015907994,0.0022836407,0.0017163663,0.0027562878,0.006826806,0.002525809,0.006723403,0.0014598896],"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.00004634464,0.00008915776,0.00018598489,0.00013188343,0.000023277651,0.00011427151,0.00021944553,0.035933424,0.0016600945,0.9546223,0.0025996605,0.004374284],"study_design_scores_gemma":[0.00004783459,0.00006891814,0.00035490454,0.000073095514,0.000024313882,0.00007779166,0.00012355288,0.2966923,0.0015410302,0.696674,0.0042834384,0.00003885429],"about_ca_topic_score_codex":0.0042012087,"about_ca_topic_score_gemma":0.0057612406,"teacher_disagreement_score":0.014400814,"about_ca_system_score_codex":0.0028542464,"about_ca_system_score_gemma":0.00435049,"threshold_uncertainty_score":0.048175514},"labels":[],"label_agreement":null},{"id":"W2038913104","doi":"10.1007/s11228-009-0108-1","title":"A Weak Maximum Principle for Optimal Control Problems with Nonsmooth Mixed Constraints","year":2009,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Pacific Institute for the Mathematical Sciences","keywords":"Convexity; Maximum principle; Mathematics; Optimal control; Independence (probability theory); Mathematical optimization; Applied mathematics; Control (management); Computer science; Statistics; Economics","score_opus":0.011726069260553655,"score_gpt":0.24494637455897195,"score_spread":0.23322030529841828,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038913104","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002910848,0.00058962917,0.99102485,0.0003559327,0.00008797266,0.000040525603,0.00004461725,0.000041738083,0.0049039004],"genre_scores_gemma":[0.29187104,0.0032743989,0.6746754,0.00086947886,0.0009390829,0.0011157247,0.0003227245,0.00064891303,0.026283149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986469,0.0006676965,0.000058516856,0.00020816125,0.0003474127,0.00007131699],"domain_scores_gemma":[0.9979513,0.001360993,0.00013266905,0.00010372261,0.00030015077,0.0001511448],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043447143,0.0026660922,0.002314525,0.0017606171,0.0012022405,0.0022372738,0.0024773201,0.0025382035,0.0035955033],"category_scores_gemma":[0.0059901373,0.0019026496,0.0025127025,0.0012295212,0.0032283142,0.004062738,0.0061173686,0.0047020973,0.00065385294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009346423,0.000067138375,0.00012300341,0.0005044881,0.00014067594,0.000088547975,0.00018850912,0.086575754,0.008548253,0.87321216,0.002603332,0.027854564],"study_design_scores_gemma":[0.000025583395,0.00011532785,0.00012804073,0.00006686042,0.00004155296,0.000056409288,0.000028537072,0.40306622,0.0010652726,0.59032327,0.005054968,0.00002784835],"about_ca_topic_score_codex":0.00070562714,"about_ca_topic_score_gemma":0.0006944269,"teacher_disagreement_score":0.0043447143,"about_ca_system_score_codex":0.0010682243,"about_ca_system_score_gemma":0.0014985993,"threshold_uncertainty_score":0.022977352},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026275378,0.00010263629,0.9963062,0.00007905706,0.00002493039,0.000027787206,0.000007904655,0.000038685743,0.000785318],"genre_scores_gemma":[0.14744759,0.00052051153,0.8421146,0.00017986586,0.00013836086,0.000405815,0.00013135534,0.00013281261,0.008929139],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990313,0.00043229735,0.0000344259,0.00017815754,0.00026200202,0.00006186465],"domain_scores_gemma":[0.99850595,0.00090284465,0.00012241137,0.00010848295,0.00025285853,0.000107567816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030336673,0.0010644546,0.0013476812,0.0007591676,0.0005380769,0.0010945164,0.001740615,0.002251121,0.0026063293],"category_scores_gemma":[0.004858708,0.00062881847,0.0009137057,0.0008260364,0.0020801795,0.0017904054,0.001672727,0.0022746734,0.00061780715],"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.00008049968,0.00010222725,0.00039949527,0.0003011936,0.00006171918,0.000112334,0.00013034216,0.7146564,0.002477075,0.23710755,0.001788563,0.042782594],"study_design_scores_gemma":[0.00001516736,0.000059968796,0.000037047284,0.000012474618,0.0000043416608,0.00002671879,0.000008564934,0.97507995,0.00048326948,0.022796256,0.0014685816,0.00000762103],"about_ca_topic_score_codex":0.00094852096,"about_ca_topic_score_gemma":0.0008591753,"teacher_disagreement_score":0.0030336673,"about_ca_system_score_codex":0.0009758705,"about_ca_system_score_gemma":0.0014447978,"threshold_uncertainty_score":0.016043782},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10371235,0.0031467131,0.7571588,0.0060579916,0.0010354606,0.000095882926,0.00052559184,0.00038817964,0.1278791],"genre_scores_gemma":[0.81943464,0.00298408,0.11864003,0.002716458,0.0012381172,0.00026114716,0.0005087062,0.0002953922,0.053921435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991322,0.00020195247,0.0000640804,0.00026690876,0.00022643157,0.000108497065],"domain_scores_gemma":[0.9972728,0.0015322848,0.00019521979,0.0003639339,0.00042638867,0.00020928653],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023396395,0.0007690313,0.001262455,0.0023741922,0.0016179556,0.0022815263,0.0010687022,0.0013629834,0.008250381],"category_scores_gemma":[0.005574578,0.00054119463,0.002338995,0.0011825344,0.0035310744,0.005634191,0.004540847,0.00440506,0.0011060375],"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.000022199714,0.00001013569,0.00012834929,0.000042549716,0.000013035016,0.00006978842,0.00013750658,0.00048359146,0.0008217951,0.9925182,0.0010181277,0.004734594],"study_design_scores_gemma":[0.00002188151,0.000041716554,0.00017872264,0.000015545864,0.0000148568315,0.00024299552,0.00005981048,0.0073796497,0.0005507029,0.9847194,0.006762437,0.000012353648],"about_ca_topic_score_codex":0.0004435773,"about_ca_topic_score_gemma":0.0003182977,"teacher_disagreement_score":0.008250381,"about_ca_system_score_codex":0.0011777657,"about_ca_system_score_gemma":0.00060042366,"threshold_uncertainty_score":0.027600288},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13309985,0.008200293,0.7132963,0.008033039,0.0005350583,0.000060683185,0.0002742588,0.00017677818,0.13632374],"genre_scores_gemma":[0.902801,0.0041356557,0.06053607,0.0014072424,0.00087751023,0.00018870542,0.00020263389,0.00021543169,0.029635798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988865,0.00053643784,0.000042717536,0.00018716922,0.00026100595,0.00008614355],"domain_scores_gemma":[0.99696165,0.0020583686,0.00023178964,0.00024610828,0.00032097774,0.00018105468],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020722798,0.0008778475,0.0010347383,0.0014431649,0.0012543149,0.0025423465,0.0012320352,0.0012420417,0.0059681535],"category_scores_gemma":[0.008131344,0.0006510823,0.00097369734,0.0012606141,0.006053051,0.00555796,0.003056259,0.0035047121,0.00037580726],"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.000010201999,0.0000064364435,0.000050606228,0.000032829947,0.0000069032017,0.000034905293,0.00009105751,0.0014391461,0.00036429777,0.9934382,0.0007919842,0.0037334342],"study_design_scores_gemma":[0.0000029949751,0.0000028469744,0.000057344274,0.000007082075,0.0000024991903,0.00003077537,0.000019408282,0.0038622024,0.00008737555,0.994429,0.0014951047,0.0000033748513],"about_ca_topic_score_codex":0.00079427345,"about_ca_topic_score_gemma":0.0008576146,"teacher_disagreement_score":0.0059681535,"about_ca_system_score_codex":0.0011494593,"about_ca_system_score_gemma":0.0005386981,"threshold_uncertainty_score":0.01996547},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046960894,0.0011443375,0.87441486,0.005614507,0.00080396683,0.00012999077,0.00080631673,0.00015984016,0.06996535],"genre_scores_gemma":[0.75263214,0.0015586787,0.16727099,0.002607183,0.0014827639,0.0004741072,0.0011448463,0.00039813202,0.07243129],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714285,0.0011244022,0.0001671329,0.0006102041,0.0006360026,0.00031940898],"domain_scores_gemma":[0.99340534,0.00365854,0.00063371594,0.000760803,0.0010955156,0.0004460701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005466954,0.0010977194,0.0021218522,0.0015095011,0.0012613048,0.0024917722,0.0028622292,0.00323056,0.024121974],"category_scores_gemma":[0.01603518,0.00082282297,0.0015499591,0.0015007885,0.0035191854,0.008792704,0.0036972184,0.005938457,0.001651393],"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.000069881,0.000047973623,0.00014016304,0.00014691231,0.00001869261,0.00014875353,0.0001087245,0.01686569,0.0016068232,0.9700742,0.004005265,0.0067669405],"study_design_scores_gemma":[0.00005454846,0.00004828078,0.00039013135,0.000030491137,0.000014182642,0.00012804639,0.00004961113,0.15619028,0.00094749185,0.83619744,0.0059094015,0.000040129908],"about_ca_topic_score_codex":0.0026811552,"about_ca_topic_score_gemma":0.0018799807,"teacher_disagreement_score":0.024121974,"about_ca_system_score_codex":0.0018692715,"about_ca_system_score_gemma":0.0022033583,"threshold_uncertainty_score":0.08069605},"labels":[],"label_agreement":null},{"id":"W2041901627","doi":"10.1007/s11228-013-0238-3","title":"Restricted Normal Cones and the Method of Alternating Projections: Applications","year":2013,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Canada Research Chairs; Deutsche Forschungsgemeinschaft; Pacific Institute for the Mathematical Sciences","keywords":"Linear subspace; Convexity; Convex cone; Regular polygon; Cone (formal languages); Generalization; Convex analysis; Mathematics; Simple (philosophy); Convex set; Property (philosophy); Dual cone and polar cone; Subderivative; Convergence (economics); Space (punctuation); Convex optimization; Combinatorics; Mathematical optimization; Pure mathematics; Computer science; Algorithm; Mathematical analysis; Geometry","score_opus":0.013328227314322936,"score_gpt":0.2756673167549808,"score_spread":0.26233908944065787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041901627","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027612075,0.0010631472,0.9899418,0.0003213099,0.00013216773,0.000025628578,0.00004109277,0.00008582318,0.0056279176],"genre_scores_gemma":[0.13665251,0.004120881,0.8391251,0.00032488906,0.00058888015,0.0003064729,0.00020285408,0.0005688245,0.018109532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99854493,0.00092625094,0.000046239416,0.0001563755,0.00027725054,0.00004901596],"domain_scores_gemma":[0.99776924,0.001278305,0.00013901512,0.00015928801,0.00043616391,0.0002179804],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031283484,0.0015242551,0.0012682049,0.0014397167,0.00065892347,0.0018514134,0.0017491607,0.0013286397,0.0050617005],"category_scores_gemma":[0.0064592133,0.0008953772,0.0013096698,0.0014171711,0.0026759554,0.0026794027,0.0035227023,0.00424545,0.0009070314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005273159,0.000066692926,0.00013294397,0.00014985289,0.000040332085,0.00005198798,0.00010767363,0.03195897,0.0016416969,0.92309195,0.0029539063,0.039751306],"study_design_scores_gemma":[0.000024084746,0.000044127646,0.00009515152,0.000044565495,0.000013653105,0.00010325034,0.00003666578,0.36339444,0.0006542356,0.6278573,0.0076992805,0.00003318814],"about_ca_topic_score_codex":0.0018415169,"about_ca_topic_score_gemma":0.0016118246,"teacher_disagreement_score":0.0050617005,"about_ca_system_score_codex":0.0008254471,"about_ca_system_score_gemma":0.0014377416,"threshold_uncertainty_score":0.016933024},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20147507,0.0030379791,0.7493572,0.0028329042,0.00033241184,0.00010811394,0.00030388526,0.00013968599,0.042412788],"genre_scores_gemma":[0.8956579,0.0027143848,0.08511946,0.00077498634,0.0006831884,0.00019481493,0.0003462488,0.0002389498,0.014270062],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982749,0.0007926765,0.00009310802,0.00020675956,0.00047426976,0.00015838737],"domain_scores_gemma":[0.9819995,0.012688948,0.0011189037,0.00075221126,0.0024710272,0.0009694981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059799417,0.0010752728,0.00094964,0.0014886999,0.0009557916,0.0021778708,0.0011631697,0.0016797907,0.0037086848],"category_scores_gemma":[0.02074614,0.000745577,0.0013945072,0.0010627871,0.0035335484,0.00623322,0.0023854985,0.003138796,0.00041116765],"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.00013859838,0.00006070966,0.001021073,0.0002342369,0.000036468253,0.0003052043,0.00044349872,0.017559184,0.0071179797,0.9574126,0.0020175718,0.013652824],"study_design_scores_gemma":[0.000027988413,0.0001430398,0.0012066907,0.00005909346,0.000021436183,0.0002530295,0.0001444387,0.17799148,0.0017412491,0.81578237,0.002604171,0.000024963563],"about_ca_topic_score_codex":0.0010544288,"about_ca_topic_score_gemma":0.0009860224,"teacher_disagreement_score":0.0059799417,"about_ca_system_score_codex":0.0012405856,"about_ca_system_score_gemma":0.0008800149,"threshold_uncertainty_score":0.03162533},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3490739,0.0004337288,0.62666255,0.0023027672,0.00023593279,0.00011450009,0.00012827682,0.00014020564,0.02090811],"genre_scores_gemma":[0.91740024,0.00032799077,0.063766524,0.00028494428,0.00011698551,0.00022271751,0.00011661836,0.00005702245,0.01770695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995085,0.00018233352,0.000022501585,0.00009482251,0.00012485993,0.000066978435],"domain_scores_gemma":[0.9995017,0.00016781273,0.000086016844,0.000037655,0.000120503464,0.00008632543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008925577,0.0007457532,0.0008573826,0.0004909163,0.00065798406,0.0011443109,0.0006203271,0.0016168369,0.0027519881],"category_scores_gemma":[0.0018486987,0.00023167959,0.0007108878,0.0003152538,0.002131944,0.0013803284,0.0023257977,0.0014869049,0.00018031042],"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.00008077058,0.00003267101,0.00035612172,0.000103708415,0.00003150185,0.00055108307,0.00025919772,0.07112772,0.01547176,0.90458953,0.0012706718,0.006125272],"study_design_scores_gemma":[0.000051343686,0.00010065037,0.0002582869,0.000033493237,0.000010458235,0.00035814557,0.0003029711,0.45055965,0.0033691735,0.5421496,0.0027777,0.000028534743],"about_ca_topic_score_codex":0.001095728,"about_ca_topic_score_gemma":0.0006218342,"teacher_disagreement_score":0.0027519881,"about_ca_system_score_codex":0.000946268,"about_ca_system_score_gemma":0.001158579,"threshold_uncertainty_score":0.009206295},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07641554,0.0035078903,0.887441,0.0022225834,0.0003611766,0.00005016394,0.00026919908,0.00015018565,0.029582165],"genre_scores_gemma":[0.683676,0.0031901202,0.26823744,0.0008266157,0.00059136277,0.0001518467,0.0006037635,0.00036765184,0.04235515],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99815995,0.0008620474,0.00006562824,0.00021690529,0.00057206856,0.00012334518],"domain_scores_gemma":[0.9959674,0.0022498888,0.00033570934,0.0004748024,0.0007042318,0.0002679371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034437252,0.0009387057,0.0013563341,0.0030191878,0.0017731291,0.0028034493,0.0021718678,0.0025083118,0.0051762788],"category_scores_gemma":[0.013000089,0.0006314567,0.0006555486,0.0028415557,0.0033705987,0.0052177245,0.0034324068,0.00520216,0.0008188409],"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.00003382994,0.000014552172,0.00013263209,0.000028791106,0.000011109439,0.000015229019,0.00006121419,0.015584273,0.00037815666,0.9711674,0.0010247123,0.011548029],"study_design_scores_gemma":[0.000008882645,0.000023855762,0.00019730355,0.000019846726,0.0000066818384,0.00004584788,0.00004875448,0.11203061,0.00042344126,0.88306046,0.004114823,0.000019490642],"about_ca_topic_score_codex":0.0035678532,"about_ca_topic_score_gemma":0.002588687,"teacher_disagreement_score":0.0051762788,"about_ca_system_score_codex":0.002476121,"about_ca_system_score_gemma":0.0011141261,"threshold_uncertainty_score":0.018212318},"labels":[],"label_agreement":null},{"id":"W2045050460","doi":"10.1007/s11228-010-0138-8","title":"Optimal Control of Non-convex Measure-driven Differential Inclusions","year":2010,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Differential inclusion; Measure (data warehouse); Mathematics; Extension (predicate logic); Regular polygon; Differential (mechanical device); Mathematical optimization; Optimal control; Control theory (sociology); Applied mathematics; Computer science; Control (management); Artificial intelligence; Data mining; Engineering; Geometry","score_opus":0.007822943143118505,"score_gpt":0.2389375222410473,"score_spread":0.2311145790979288,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045050460","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.100943595,0.0014059985,0.8716522,0.0016516703,0.00032680266,0.00011165847,0.00017689822,0.00014370166,0.023587545],"genre_scores_gemma":[0.94829047,0.000621649,0.03239394,0.00020683685,0.0001124442,0.00017460699,0.000117738055,0.00009652154,0.017985849],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991849,0.00032427505,0.000028828295,0.00014717082,0.00019404534,0.00012074903],"domain_scores_gemma":[0.9980958,0.0010291615,0.00025787158,0.00007352192,0.00032756611,0.00021612862],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002000341,0.0013855848,0.0018536255,0.0011006503,0.00081384805,0.0027855956,0.0018760997,0.0020266906,0.0023365438],"category_scores_gemma":[0.005356989,0.0008079958,0.00095902296,0.0006823296,0.0026587117,0.0017336436,0.0036586414,0.0014757168,0.00018318449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014766688,0.00014525693,0.00037067058,0.00021719765,0.0000904273,0.00014708177,0.00020175257,0.54989815,0.0047601694,0.42845818,0.0015932836,0.01397019],"study_design_scores_gemma":[0.000017411061,0.000031604242,0.000097015385,0.000010322533,0.000008696838,0.000016662003,0.000026971047,0.9364307,0.00046066308,0.062281642,0.00060781266,0.0000106027865],"about_ca_topic_score_codex":0.005801569,"about_ca_topic_score_gemma":0.003514466,"teacher_disagreement_score":0.005801569,"about_ca_system_score_codex":0.0030887404,"about_ca_system_score_gemma":0.002397219,"threshold_uncertainty_score":0.022410512},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037136216,0.00066456414,0.91901743,0.0010754467,0.00020067708,0.000058116566,0.00005184041,0.00024086371,0.041554797],"genre_scores_gemma":[0.88002616,0.0010472937,0.09490817,0.00045822578,0.0002501957,0.0002662212,0.00011390033,0.00014497805,0.022784827],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99893886,0.00032200376,0.00007010511,0.00015600426,0.00038358,0.00012949164],"domain_scores_gemma":[0.99916804,0.00029393792,0.00009890267,0.00011599683,0.00020927573,0.00011395695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001734227,0.00097308884,0.0009370744,0.0013979864,0.0009171561,0.001867614,0.0009659473,0.0011789274,0.0033171535],"category_scores_gemma":[0.0044398247,0.0003162855,0.0006832773,0.00046467106,0.0031436414,0.0014051957,0.0030046157,0.0015967641,0.0005193972],"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.000030164281,0.00001496719,0.00010858329,0.000060032566,0.00001185011,0.0001383424,0.00009097461,0.022732444,0.004730017,0.96011597,0.00094881427,0.011017801],"study_design_scores_gemma":[0.000027217671,0.00009259088,0.00018750539,0.000042940614,0.000013958003,0.00011537955,0.000080599086,0.20864764,0.003379049,0.7792438,0.0081525445,0.000016699316],"about_ca_topic_score_codex":0.0005611446,"about_ca_topic_score_gemma":0.00037479543,"teacher_disagreement_score":0.0033171535,"about_ca_system_score_codex":0.0008210294,"about_ca_system_score_gemma":0.0007938789,"threshold_uncertainty_score":0.011096954},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040460795,0.00055609713,0.9512315,0.0004027882,0.00007004935,0.000028898363,0.00007534503,0.00005331285,0.007121289],"genre_scores_gemma":[0.6443924,0.0015178367,0.33223417,0.0001494099,0.00012968447,0.00020428807,0.00025032356,0.0002144838,0.02090741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995191,0.00022860547,0.000023267576,0.00008379806,0.000116656505,0.000028575041],"domain_scores_gemma":[0.9994721,0.0002374598,0.00006617456,0.000051327603,0.00010451506,0.00006850788],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001265469,0.0011347012,0.0012615476,0.0006977428,0.0005193828,0.0016755101,0.00084099715,0.0009597638,0.0013056807],"category_scores_gemma":[0.0016124892,0.00054022216,0.00067514664,0.00082764804,0.0015013044,0.0018745047,0.0023715522,0.0017139242,0.00028080415],"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.00015317326,0.00010346544,0.0004543345,0.00034922484,0.000090569374,0.00016701237,0.00013963459,0.22982916,0.015450309,0.718195,0.0020631342,0.03300497],"study_design_scores_gemma":[0.000013495699,0.00008849906,0.00022299301,0.000022060778,0.000023808116,0.000084207226,0.00005905623,0.7709007,0.0021684372,0.22357993,0.0028210087,0.000015787882],"about_ca_topic_score_codex":0.00075768743,"about_ca_topic_score_gemma":0.0009067217,"teacher_disagreement_score":0.0016755101,"about_ca_system_score_codex":0.0005738206,"about_ca_system_score_gemma":0.0006230596,"threshold_uncertainty_score":0.0066925287},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025403472,0.0044506635,0.85828686,0.0076556974,0.0008648488,0.00012410848,0.00036959592,0.00044147874,0.10240339],"genre_scores_gemma":[0.59789366,0.00805543,0.3171219,0.0038774202,0.0025604304,0.0010614333,0.00085686817,0.00094517716,0.06762766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910575,0.00025166926,0.0000466492,0.00020318214,0.00027223592,0.000120442295],"domain_scores_gemma":[0.99482155,0.003717865,0.00019310751,0.00020502934,0.00076037995,0.00030202762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030799564,0.001802515,0.0014669088,0.0026206009,0.0022615164,0.002203822,0.0021507016,0.0024042137,0.009582814],"category_scores_gemma":[0.008521836,0.0013063934,0.002029252,0.0014683218,0.0039405692,0.00707736,0.0061719627,0.0069776196,0.0013211941],"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.00007132749,0.000043066288,0.0002279917,0.00033489257,0.000039953484,0.00017840863,0.00034564576,0.006495725,0.0030001458,0.9670032,0.006753104,0.0155063635],"study_design_scores_gemma":[0.000045137313,0.00006030255,0.0003231011,0.00011112618,0.0000499513,0.00034289062,0.00013312245,0.07099158,0.0015858943,0.9111001,0.015221326,0.000035485016],"about_ca_topic_score_codex":0.0008942445,"about_ca_topic_score_gemma":0.0006597454,"teacher_disagreement_score":0.009582814,"about_ca_system_score_codex":0.001231037,"about_ca_system_score_gemma":0.0013007772,"threshold_uncertainty_score":0.032057703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48301494,0.00067013415,0.506491,0.00029085175,0.00008653142,0.00008883922,0.000057811638,0.000066048095,0.00923387],"genre_scores_gemma":[0.9561171,0.0002304656,0.038448986,0.000044548196,0.000057736528,0.00010675749,0.00006208579,0.000022619202,0.0049096206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862635,0.0004865182,0.000090258196,0.0002719652,0.00043721817,0.000087697925],"domain_scores_gemma":[0.99715614,0.0012531391,0.00049280934,0.0001527169,0.00064052513,0.0003046973],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027007626,0.00062185526,0.0008163591,0.0012749175,0.0007813932,0.0012191562,0.0007873478,0.00074381666,0.0021001017],"category_scores_gemma":[0.006042064,0.0003356359,0.0008374929,0.0005673795,0.0019585188,0.0020748847,0.0013886675,0.001116955,0.00017193954],"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.00015756754,0.00007143773,0.0019633542,0.0001274632,0.00006948179,0.00067304773,0.0013055485,0.06960803,0.014508393,0.89806706,0.00035462523,0.013094059],"study_design_scores_gemma":[0.000029148181,0.0003217473,0.001305621,0.00004551755,0.00002101019,0.0004934058,0.00049310643,0.5444373,0.0063140886,0.44397697,0.0025197926,0.00004228705],"about_ca_topic_score_codex":0.0008654428,"about_ca_topic_score_gemma":0.00042025078,"teacher_disagreement_score":0.0027007626,"about_ca_system_score_codex":0.0010094085,"about_ca_system_score_gemma":0.00064224406,"threshold_uncertainty_score":0.01428318},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037508756,0.00090328575,0.85899276,0.004173679,0.00087963016,0.00012986193,0.00038191924,0.0007351243,0.096294954],"genre_scores_gemma":[0.71115535,0.0010539994,0.25453046,0.002679284,0.0018714246,0.00029532163,0.00043631435,0.000755503,0.027222354],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907863,0.00024582216,0.000037597372,0.00019087733,0.00032471307,0.0001223024],"domain_scores_gemma":[0.99566513,0.0024168345,0.0002574571,0.00035667018,0.0007377765,0.00056617317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014915968,0.0006218022,0.00064910995,0.001697446,0.0012839846,0.0016115629,0.0013476035,0.0007090339,0.01602226],"category_scores_gemma":[0.0050957794,0.00038521676,0.0013966942,0.0006825461,0.003652995,0.0028979285,0.0056852577,0.0049420074,0.00095707184],"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.00003346048,0.00004162263,0.00026133377,0.00014708957,0.000025369745,0.00039014555,0.00033271202,0.0017033742,0.0065696174,0.9786588,0.0036537207,0.008182764],"study_design_scores_gemma":[0.000041966076,0.000069969385,0.0008908071,0.0000845462,0.000030748746,0.0007794799,0.0002107714,0.013343083,0.006754733,0.9244649,0.053279966,0.0000490876],"about_ca_topic_score_codex":0.0011419327,"about_ca_topic_score_gemma":0.0010413701,"teacher_disagreement_score":0.01602226,"about_ca_system_score_codex":0.00093044544,"about_ca_system_score_gemma":0.00082965917,"threshold_uncertainty_score":0.053599834},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030636268,0.0001825904,0.99197936,0.00023067131,0.000044484965,0.000010405269,0.000016419914,0.00013308525,0.0043393206],"genre_scores_gemma":[0.31511754,0.0011332752,0.6634849,0.00064202084,0.00020823754,0.0002239577,0.0002461677,0.0010180459,0.017925963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993643,0.00024462774,0.000030548872,0.000102589765,0.00020593141,0.000051976924],"domain_scores_gemma":[0.99902296,0.00045019266,0.00006313389,0.00018478115,0.00020211823,0.00007684137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018682247,0.0015492471,0.0019970255,0.00095253653,0.0005742405,0.0021652828,0.0012610615,0.0017691077,0.004112813],"category_scores_gemma":[0.005460308,0.001151722,0.000950499,0.001042456,0.0019805338,0.0027072139,0.0061210115,0.0036396317,0.0013408458],"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.00007708622,0.000061642975,0.00025257788,0.00015798218,0.00008085017,0.00005053538,0.00018968225,0.5311445,0.0023823443,0.37438744,0.0038199297,0.0873954],"study_design_scores_gemma":[0.000008822169,0.000027779322,0.00003149395,0.00002190781,0.00000991888,0.000019672432,0.00002557809,0.7894809,0.00040826574,0.20602757,0.0039300816,0.000007944826],"about_ca_topic_score_codex":0.0011238797,"about_ca_topic_score_gemma":0.0013526549,"teacher_disagreement_score":0.004112813,"about_ca_system_score_codex":0.0006976078,"about_ca_system_score_gemma":0.00081822084,"threshold_uncertainty_score":0.013758719},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033947352,0.00035392845,0.9609382,0.00039450775,0.0001131914,0.00006740429,0.000038796312,0.00038989913,0.003756651],"genre_scores_gemma":[0.51013684,0.00032742028,0.48300222,0.00018794814,0.00010523247,0.0001499747,0.00013634792,0.00025148166,0.0057025915],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993507,0.00026647616,0.000034962868,0.00008586429,0.00015171428,0.000110384906],"domain_scores_gemma":[0.9970319,0.0019840184,0.00013911098,0.00023503126,0.0003395484,0.00027034475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001979256,0.0007375916,0.0020878213,0.0012541058,0.0009601474,0.0019663058,0.0017944947,0.0025999523,0.0061115995],"category_scores_gemma":[0.0075100833,0.00097494863,0.0009709441,0.0017440636,0.0011258245,0.0019010467,0.0015772884,0.0023398197,0.00061588816],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035687353,0.0002534266,0.00051596033,0.00012939188,0.00006495599,0.00012641452,0.00012535421,0.8413992,0.0020403408,0.054201696,0.0031209236,0.09766543],"study_design_scores_gemma":[0.000023094972,0.000028418846,0.00003854365,0.000007606108,0.000008503501,0.000013527076,0.000010027689,0.98765635,0.00014791903,0.011667278,0.00039112882,0.0000075614907],"about_ca_topic_score_codex":0.0041524107,"about_ca_topic_score_gemma":0.0043360265,"teacher_disagreement_score":0.0061115995,"about_ca_system_score_codex":0.001142289,"about_ca_system_score_gemma":0.0018307021,"threshold_uncertainty_score":0.020445287},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015006737,0.001267913,0.9934948,0.00029833545,0.0000464174,0.00002416364,0.000027395723,0.000036842128,0.0033034617],"genre_scores_gemma":[0.30611622,0.007816604,0.67090666,0.00048477453,0.000624981,0.0012033511,0.00043891606,0.00016137029,0.0122471135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992524,0.00034306032,0.000034800527,0.00014816319,0.00016301994,0.000058523365],"domain_scores_gemma":[0.99817836,0.0014731219,0.0000938054,0.00006645369,0.00014410411,0.000044267497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019797564,0.0014956397,0.0015329309,0.0010458934,0.00058402447,0.0020159972,0.0015962793,0.0020746961,0.003704353],"category_scores_gemma":[0.004408453,0.0006192538,0.000855685,0.0019481491,0.0021271047,0.0022195883,0.0026414758,0.0027441983,0.00064166094],"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.000031987263,0.00004159975,0.00028555762,0.00028745603,0.000048732905,0.0000766204,0.000103783335,0.50792074,0.00040957268,0.4304144,0.0032740606,0.05710541],"study_design_scores_gemma":[0.000010088956,0.000021775024,0.000072420306,0.000029985153,0.00000660554,0.000029651617,0.000017194328,0.8290047,0.000095532014,0.16810381,0.002598632,0.000009557735],"about_ca_topic_score_codex":0.003243598,"about_ca_topic_score_gemma":0.0014903864,"teacher_disagreement_score":0.003704353,"about_ca_system_score_codex":0.0012069127,"about_ca_system_score_gemma":0.0012597811,"threshold_uncertainty_score":0.012392223},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009343852,0.0018406069,0.9613298,0.002490614,0.0002947591,0.00008136507,0.00011828165,0.00006449053,0.024436308],"genre_scores_gemma":[0.40773594,0.0107685225,0.49772605,0.0018594192,0.0021795565,0.0013790608,0.0004729095,0.00046637963,0.07741222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998998,0.0003923765,0.000052876647,0.00024864686,0.00022702188,0.000081125516],"domain_scores_gemma":[0.9957912,0.0029264172,0.0002446992,0.00019573844,0.00059210235,0.0002498064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0045877737,0.0023877998,0.0024760952,0.0036561794,0.0024342036,0.0031780575,0.0030558433,0.003842018,0.011499734],"category_scores_gemma":[0.011496601,0.0013121446,0.0047923233,0.003697289,0.005612346,0.009930257,0.005092875,0.007163813,0.0011517095],"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.00001254287,0.000019090932,0.00009612766,0.00006566888,0.000036224286,0.000057252182,0.000116560885,0.010596828,0.00040181517,0.98167795,0.0013063129,0.0056137494],"study_design_scores_gemma":[0.000015604186,0.000020442969,0.00008455575,0.000027999895,0.000022809303,0.000058141373,0.000045757228,0.037194476,0.0001761438,0.95907766,0.0032605554,0.000015755742],"about_ca_topic_score_codex":0.0024934497,"about_ca_topic_score_gemma":0.00211803,"teacher_disagreement_score":0.011499734,"about_ca_system_score_codex":0.002750528,"about_ca_system_score_gemma":0.0014825658,"threshold_uncertainty_score":0.038470447},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03203683,0.0006496175,0.94696456,0.00052311254,0.00004819189,0.000043188054,0.000065460204,0.00006397315,0.019604972],"genre_scores_gemma":[0.89535004,0.0008922182,0.08726633,0.000297946,0.0001262134,0.0002887767,0.00009260823,0.00012984397,0.01555594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956316,0.0001561278,0.000014382228,0.00008363362,0.00013401243,0.000048546826],"domain_scores_gemma":[0.9993105,0.0004747181,0.000067950794,0.000043882163,0.000066760666,0.00003628178],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014158235,0.00079399085,0.0008567803,0.0005526322,0.0004491568,0.001225358,0.0010429323,0.000980578,0.0030723698],"category_scores_gemma":[0.002000602,0.00038437615,0.0007574019,0.00042570214,0.0017634437,0.0018278778,0.0018309322,0.0016367019,0.0002938529],"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.00004752403,0.000020179172,0.00015798707,0.00012359791,0.00005138921,0.00007951183,0.00008193987,0.14695828,0.004051503,0.8363023,0.00073586556,0.011389903],"study_design_scores_gemma":[0.000016567665,0.00006809093,0.00024682324,0.000021881877,0.000014795854,0.00004344275,0.000029068116,0.61381894,0.0008226468,0.38327223,0.0016310138,0.0000145366575],"about_ca_topic_score_codex":0.0009844117,"about_ca_topic_score_gemma":0.000711824,"teacher_disagreement_score":0.0030723698,"about_ca_system_score_codex":0.00078751286,"about_ca_system_score_gemma":0.0007354292,"threshold_uncertainty_score":0.010278165},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39162892,0.002353657,0.5690642,0.001486468,0.00034251146,0.00013656684,0.00027041964,0.00020675406,0.03451057],"genre_scores_gemma":[0.9259227,0.001646506,0.041631326,0.00028883453,0.0004384406,0.00037211372,0.00041433223,0.00020629184,0.029079428],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988638,0.00031872862,0.00007366486,0.00022182071,0.00038767434,0.00013422617],"domain_scores_gemma":[0.9923505,0.0047386223,0.000671044,0.0003081142,0.0012965314,0.0006350933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00359138,0.0014508147,0.001424971,0.0032146026,0.0016397872,0.003580095,0.0015902574,0.00224547,0.0072303396],"category_scores_gemma":[0.00847833,0.0008223957,0.0020537504,0.0011293268,0.003056141,0.0049868952,0.0019111828,0.0028764424,0.00064750994],"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.00009013425,0.000060980437,0.0004967607,0.00008549787,0.000048371254,0.0004198023,0.00089402724,0.0058957958,0.006885834,0.97930187,0.0006981874,0.005122669],"study_design_scores_gemma":[0.000042201504,0.00017670837,0.0007430653,0.0000332105,0.000031335872,0.0004620274,0.00028175185,0.07222025,0.0018727002,0.9222054,0.0018831842,0.000048241567],"about_ca_topic_score_codex":0.00084162486,"about_ca_topic_score_gemma":0.0005097497,"teacher_disagreement_score":0.0072303396,"about_ca_system_score_codex":0.0014988782,"about_ca_system_score_gemma":0.0009678703,"threshold_uncertainty_score":0.024187922},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008530581,0.0007154283,0.98157525,0.00044520776,0.00021105711,0.000066744644,0.000062150764,0.00013848052,0.008255106],"genre_scores_gemma":[0.2283276,0.002007792,0.73983145,0.00089793245,0.00033569432,0.00057680794,0.00035754687,0.0009683287,0.026696874],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782556,0.0011824279,0.00006880364,0.00022338881,0.00057658216,0.00012324307],"domain_scores_gemma":[0.98716044,0.009523106,0.00036851972,0.0007324791,0.0016243887,0.0005910097],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007091102,0.0015097427,0.0017368227,0.0022571052,0.0010633953,0.002052832,0.002391178,0.0027354003,0.007272813],"category_scores_gemma":[0.02252868,0.00092621,0.001707917,0.0009797002,0.004109246,0.0031389943,0.0060602874,0.006000899,0.001032867],"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.00034742404,0.00011403447,0.00063855184,0.00045133915,0.00011847716,0.00017424919,0.00032911723,0.17817049,0.008321388,0.7529763,0.0046730665,0.053685553],"study_design_scores_gemma":[0.000025767016,0.000082283914,0.00014253947,0.00008022572,0.00002315541,0.00008484085,0.000026795451,0.8503836,0.001398545,0.1445598,0.0031627864,0.000029664474],"about_ca_topic_score_codex":0.0024850294,"about_ca_topic_score_gemma":0.0018693062,"teacher_disagreement_score":0.007272813,"about_ca_system_score_codex":0.0013120002,"about_ca_system_score_gemma":0.0015355174,"threshold_uncertainty_score":0.037501812},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6336613,0.0007996089,0.31094617,0.001601033,0.0002751655,0.000071545655,0.00029637563,0.0002883392,0.052060436],"genre_scores_gemma":[0.96093327,0.00045705124,0.024204161,0.0001985839,0.00026397288,0.00009529351,0.00034757578,0.00014416265,0.013356002],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908566,0.00022705739,0.000040156214,0.00014337302,0.00030563588,0.00019813365],"domain_scores_gemma":[0.9967553,0.0009879774,0.0003094821,0.00016827215,0.00059088663,0.0011879897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019479934,0.00090368744,0.0014917935,0.0027689845,0.0027677196,0.003996632,0.0013000241,0.0012134885,0.0036544774],"category_scores_gemma":[0.004940266,0.00060794,0.001035622,0.001218108,0.00431125,0.0039812317,0.0027471075,0.0035236296,0.00028925628],"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.000047850925,0.000025344916,0.00033339817,0.000018467714,0.000012895125,0.00010490369,0.00015280815,0.0012635223,0.0006724043,0.99508935,0.00049636257,0.0017826178],"study_design_scores_gemma":[0.000014466275,0.000024339277,0.00033373138,0.000013008285,0.000008255112,0.00017054586,0.00013657402,0.015148344,0.00043248577,0.9825883,0.0011149765,0.000014969832],"about_ca_topic_score_codex":0.0011464625,"about_ca_topic_score_gemma":0.0011779554,"teacher_disagreement_score":0.003996632,"about_ca_system_score_codex":0.0015404476,"about_ca_system_score_gemma":0.0010783544,"threshold_uncertainty_score":0.012225449},"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":"commentary","genre_gemma":"commentary","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"commentary","genre_consensus":"commentary","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007958101,0.06230736,0.35655734,0.3815944,0.13004604,0.00021362197,0.00083811604,0.00081685075,0.059668213],"genre_scores_gemma":[0.14681838,0.06595236,0.3300615,0.23406336,0.13812147,0.000504042,0.0012682568,0.0017732164,0.081437424],"study_design_codex":"not_applicable","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969591,0.001021028,0.00016543256,0.00057290157,0.0011041466,0.00017732184],"domain_scores_gemma":[0.9956274,0.002480659,0.00021986288,0.00038258306,0.00096177525,0.00032779566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060162377,0.0013943737,0.0009866158,0.0011511364,0.0019086319,0.0025423744,0.002874292,0.0028842527,0.0057875076],"category_scores_gemma":[0.010957231,0.0005139484,0.0014842461,0.001537046,0.0033877834,0.007993982,0.0035561097,0.008553974,0.0025671476],"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.00012025467,0.000086351196,0.0004850582,0.00066860416,0.00010262646,0.0006042706,0.0006229049,0.0013504089,0.0030025677,0.46645483,0.47806013,0.048441958],"study_design_scores_gemma":[0.000044022247,0.00008526297,0.00075496355,0.00023589053,0.00005642206,0.00051700283,0.00015639156,0.0043111844,0.0030480558,0.34863812,0.64203185,0.00012084047],"about_ca_topic_score_codex":0.0023013393,"about_ca_topic_score_gemma":0.0026638592,"teacher_disagreement_score":0.0060162377,"about_ca_system_score_codex":0.0014318062,"about_ca_system_score_gemma":0.0013433064,"threshold_uncertainty_score":0.031817317},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046985727,0.0014666512,0.92581964,0.0017456149,0.0004301627,0.000117828786,0.000284013,0.00010427927,0.023046106],"genre_scores_gemma":[0.76434445,0.0028955915,0.18964958,0.0017642338,0.00080878654,0.0006583146,0.00054003374,0.00028010033,0.03905896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816114,0.0007778435,0.00011062721,0.00029951555,0.0004640939,0.00018678447],"domain_scores_gemma":[0.99571383,0.0020940925,0.00046321482,0.00023704115,0.000908131,0.00058378663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005799894,0.0021883452,0.001341786,0.0017170954,0.0012093288,0.0034149594,0.002590415,0.0020044423,0.00785768],"category_scores_gemma":[0.0077943015,0.0010042005,0.0016812219,0.0013482223,0.0034725051,0.0066606505,0.004386381,0.0047672116,0.00057104946],"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.00008270699,0.000034806315,0.00027614197,0.00019155051,0.000046655394,0.00013272784,0.00023623643,0.009946124,0.0053373324,0.97717243,0.0011579571,0.005385371],"study_design_scores_gemma":[0.000035050947,0.000079913065,0.0005265774,0.000058108613,0.000030287209,0.0002032822,0.00015672368,0.29085776,0.0012085094,0.7045811,0.002220158,0.000042624444],"about_ca_topic_score_codex":0.001613651,"about_ca_topic_score_gemma":0.001905897,"teacher_disagreement_score":0.00785768,"about_ca_system_score_codex":0.002193479,"about_ca_system_score_gemma":0.0016246438,"threshold_uncertainty_score":0.030673087},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034650404,0.10684015,0.12940386,0.005578472,0.004239266,0.000054171982,0.000723689,0.00051964424,0.7491758],"genre_scores_gemma":[0.057439424,0.08974067,0.06819215,0.0023384837,0.0079413755,0.0002977803,0.0013072067,0.0009275638,0.77181536],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971384,0.00004097655,0.000009111836,0.00003392937,0.0001841884,0.000017909799],"domain_scores_gemma":[0.9997099,0.00015439262,0.000015248805,0.00002689512,0.00006978267,0.00002367457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035969494,0.0010924533,0.00092488027,0.001257861,0.0005038732,0.0026391302,0.0007551692,0.0007676935,0.026300445],"category_scores_gemma":[0.0011170104,0.00043772417,0.00054566993,0.002201289,0.00120048,0.0026679516,0.00081355416,0.0027122344,0.008954946],"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.000014207255,0.000029183104,0.0000597197,0.0003893252,0.000019966696,0.000039827337,0.00010427616,0.0023073026,0.0012744244,0.7361022,0.16703197,0.09262748],"study_design_scores_gemma":[0.000009653868,0.000016694872,0.0003922895,0.000182406,0.000010957182,0.00012938296,0.00004645361,0.0048613027,0.00045185885,0.66184664,0.3320356,0.000016752623],"about_ca_topic_score_codex":0.0008491922,"about_ca_topic_score_gemma":0.0013763733,"teacher_disagreement_score":0.026300445,"about_ca_system_score_codex":0.0010376786,"about_ca_system_score_gemma":0.0010146193,"threshold_uncertainty_score":0.08798379},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35977316,0.0007025281,0.34400845,0.0021729781,0.00044252613,0.00012141381,0.00060771493,0.00097613654,0.291195],"genre_scores_gemma":[0.882597,0.00024060071,0.08857902,0.00027007257,0.00011096372,0.00006964479,0.00020079335,0.00015914661,0.027772725],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998221,0.000022786524,0.000008107525,0.000029034163,0.00006874743,0.000049257353],"domain_scores_gemma":[0.9997558,0.00006921757,0.000039622126,0.000020002435,0.000048600705,0.000066822846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021891626,0.00056331203,0.0003919091,0.0008868487,0.0010042145,0.000944881,0.0007018985,0.0013579717,0.0127846375],"category_scores_gemma":[0.00060175336,0.0002600255,0.00041069114,0.00067383976,0.0012079817,0.0009528206,0.0010031707,0.0009463338,0.000996856],"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.00006595045,0.000022064609,0.0001345964,0.00007637928,0.0000072514754,0.0005312862,0.00015444052,0.0023482507,0.023157705,0.96517396,0.001946926,0.00638104],"study_design_scores_gemma":[0.00005040375,0.00007728991,0.00066945446,0.000023370232,0.0000136095505,0.0013566904,0.00020656649,0.055950034,0.009799647,0.91413146,0.017662836,0.000058594964],"about_ca_topic_score_codex":0.00086504297,"about_ca_topic_score_gemma":0.0010222207,"teacher_disagreement_score":0.0127846375,"about_ca_system_score_codex":0.00042056237,"about_ca_system_score_gemma":0.0005024375,"threshold_uncertainty_score":0.042768836},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045878854,0.00042596686,0.9484036,0.00023852866,0.00008979055,0.00007416913,0.000028152046,0.000038813898,0.004822048],"genre_scores_gemma":[0.5452687,0.00068660796,0.44378164,0.00025419146,0.00018885547,0.0003172204,0.000099343175,0.000056195902,0.009347263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994148,0.00018693795,0.000034921923,0.000116890216,0.00019572888,0.000050685652],"domain_scores_gemma":[0.9995946,0.00018046197,0.000057191122,0.000037997317,0.00007861605,0.000051102026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012343427,0.0009778911,0.00083435496,0.0005593496,0.0006779944,0.0009704761,0.0009576588,0.00118861,0.0014413162],"category_scores_gemma":[0.0016284814,0.00035680155,0.001099119,0.00037137093,0.0011632423,0.0019108925,0.002374616,0.0012245459,0.0001243319],"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.00010784281,0.00010848069,0.0011283731,0.00045737004,0.00010952678,0.00055346,0.00036559478,0.17248394,0.033931475,0.73687536,0.0011852939,0.05269327],"study_design_scores_gemma":[0.000016092476,0.00008586792,0.00017524624,0.000028374654,0.000020707574,0.00022418014,0.00005144963,0.90748,0.0049199956,0.08352146,0.0034579155,0.000018652328],"about_ca_topic_score_codex":0.0007088107,"about_ca_topic_score_gemma":0.0007428614,"teacher_disagreement_score":0.0014413162,"about_ca_system_score_codex":0.00053960894,"about_ca_system_score_gemma":0.00089373166,"threshold_uncertainty_score":0.0065279007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05711694,0.0035522052,0.91365755,0.0017760695,0.0001623959,0.000054188342,0.000119437806,0.00008090295,0.023480311],"genre_scores_gemma":[0.8483568,0.005649536,0.11644122,0.00038023572,0.00046983614,0.00030164866,0.00031816133,0.00018694244,0.02789565],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99813473,0.00093345693,0.00008283898,0.00014347116,0.0005208905,0.00018459928],"domain_scores_gemma":[0.9944247,0.003592831,0.00051376334,0.0001971093,0.00084994227,0.00042159358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004439178,0.0013593691,0.0017637282,0.0033915704,0.0016475063,0.005494765,0.0013011408,0.0017477835,0.003164232],"category_scores_gemma":[0.00904418,0.0010843793,0.0012016841,0.0032290646,0.0042577535,0.0047768313,0.0032112843,0.0027159618,0.00040069185],"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.000021896705,0.00002424586,0.00027872357,0.000060575087,0.000036430476,0.00002600499,0.000070800146,0.05852418,0.00039836537,0.9334309,0.00074549834,0.00638235],"study_design_scores_gemma":[0.000009013762,0.000023649243,0.00018704409,0.000022139104,0.000011851542,0.000018028855,0.00004886079,0.18936907,0.00016171238,0.8088733,0.0012623585,0.000012980709],"about_ca_topic_score_codex":0.002796066,"about_ca_topic_score_gemma":0.002596001,"teacher_disagreement_score":0.005494765,"about_ca_system_score_codex":0.003205293,"about_ca_system_score_gemma":0.0020140547,"threshold_uncertainty_score":0.023476899},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00910328,0.00066403736,0.9565957,0.002001996,0.0001844083,0.0001143049,0.0004626612,0.00009062938,0.03078299],"genre_scores_gemma":[0.5322267,0.0044500125,0.43631148,0.0015094428,0.00066148135,0.001490723,0.0019942222,0.00025589802,0.021100093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99580586,0.0017817039,0.0003182229,0.0006517646,0.0010263765,0.00041600864],"domain_scores_gemma":[0.9945781,0.0031560468,0.00061428425,0.00035298834,0.0010607627,0.00023777252],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048035095,0.0012423812,0.0015265608,0.0009829946,0.0013746585,0.0026922454,0.0012399779,0.0020367012,0.009382006],"category_scores_gemma":[0.015725194,0.00074248697,0.0010955699,0.0020010704,0.004182826,0.0046223714,0.0029440178,0.0040732855,0.0020887244],"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.000017735087,0.000021510514,0.00016775564,0.00015506135,0.000016053702,0.00014566608,0.00013861828,0.049425352,0.0004510759,0.9377631,0.0024929899,0.009205077],"study_design_scores_gemma":[0.000025026296,0.00003342373,0.00015344213,0.00008631097,0.000007929737,0.00007087853,0.00009351693,0.1221141,0.00042524972,0.86845934,0.008504531,0.000026202832],"about_ca_topic_score_codex":0.0030631355,"about_ca_topic_score_gemma":0.0020491155,"teacher_disagreement_score":0.009382006,"about_ca_system_score_codex":0.0016863542,"about_ca_system_score_gemma":0.0030217536,"threshold_uncertainty_score":0.03138596},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026247793,0.0026623367,0.0029666799,0.06352351,0.91413915,0.00004861581,0.0009958512,0.000397497,0.015003935],"genre_scores_gemma":[0.013579629,0.014514227,0.01299048,0.16081876,0.38581803,0.00040826979,0.0040741237,0.0023883046,0.40540823],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9958475,0.0007035255,0.0008448475,0.00063285034,0.0016825147,0.0002887604],"domain_scores_gemma":[0.9873526,0.003636419,0.0006066006,0.0011405675,0.0068179835,0.00044579455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035161017,0.0039712284,0.00432848,0.0051404936,0.0071136644,0.0046618474,0.0058666007,0.009850461,0.042670883],"category_scores_gemma":[0.03479857,0.0019596983,0.0025135058,0.0038110856,0.004446439,0.005543799,0.0023137135,0.012789459,0.024566425],"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.000036681384,0.000007767024,0.000021184638,0.00010148244,0.0000083989235,0.000088810666,0.00002557847,0.000054179636,0.000049752176,0.003517639,0.99241155,0.0036769598],"study_design_scores_gemma":[0.00006709522,0.000057781916,0.0006473716,0.00033303417,0.00006668434,0.00036693117,0.00013119842,0.0006648061,0.00039828784,0.010360483,0.98683447,0.00007193002],"about_ca_topic_score_codex":0.02058504,"about_ca_topic_score_gemma":0.028424792,"teacher_disagreement_score":0.042670883,"about_ca_system_score_codex":0.005061979,"about_ca_system_score_gemma":0.0039603096,"threshold_uncertainty_score":0.1427483},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2483659,0.0003438038,0.68473136,0.0010324571,0.00009813636,0.00016837938,0.00024275054,0.0001449106,0.06487219],"genre_scores_gemma":[0.9631856,0.00019554894,0.030363552,0.00017317738,0.00005619347,0.00014384306,0.00010097736,0.000029534713,0.005751649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99835986,0.00069854874,0.00008569657,0.00027393101,0.00034065137,0.00024133603],"domain_scores_gemma":[0.9983693,0.00053792243,0.00018828851,0.00016753853,0.00038935934,0.00034756033],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016783774,0.00045591895,0.00073757087,0.0006678604,0.0009921466,0.0019632846,0.000846859,0.00090286596,0.003410271],"category_scores_gemma":[0.004180298,0.00020372085,0.00068247,0.00043618717,0.0024403424,0.003514064,0.0025291294,0.0011225311,0.00033898605],"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.000026322525,0.000013790405,0.00022691923,0.00002074903,0.000008735523,0.00004515348,0.00016248612,0.002780897,0.000661823,0.9932201,0.00037353742,0.0024596418],"study_design_scores_gemma":[0.000021494447,0.00005930705,0.00034727252,0.000017052746,0.000011723365,0.00011038176,0.00018109576,0.074889965,0.00047826517,0.9208963,0.0029689989,0.000018253742],"about_ca_topic_score_codex":0.0012778741,"about_ca_topic_score_gemma":0.00073246186,"teacher_disagreement_score":0.003410271,"about_ca_system_score_codex":0.0011400741,"about_ca_system_score_gemma":0.0012039819,"threshold_uncertainty_score":0.011408508},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006988614,0.00068539585,0.983225,0.00077330717,0.00015804912,0.00007898053,0.000032314525,0.00007931385,0.00797895],"genre_scores_gemma":[0.2830981,0.002951618,0.6866438,0.0008214581,0.0007739906,0.00091086735,0.0001371971,0.00027877095,0.024384178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990445,0.00038422356,0.000039409006,0.0001304372,0.0003396049,0.00006176654],"domain_scores_gemma":[0.9981888,0.000923291,0.00013875561,0.00016167687,0.0004170109,0.00017050542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004019287,0.0015480416,0.0010986724,0.0010661472,0.001311689,0.0014270011,0.0016729524,0.0019989307,0.0025804155],"category_scores_gemma":[0.005553576,0.0005530503,0.0012889373,0.0005489063,0.0040154047,0.0027738146,0.003853714,0.0038166908,0.0010225923],"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.000046462028,0.00005697094,0.00019066295,0.00027670062,0.000045751818,0.00018305074,0.00027937736,0.040303487,0.0114423195,0.91750383,0.0021506343,0.027520774],"study_design_scores_gemma":[0.000028982115,0.00018139821,0.0002086393,0.00007136024,0.000021745054,0.00020138267,0.000048150894,0.3826382,0.004461796,0.60149616,0.010602755,0.00003939106],"about_ca_topic_score_codex":0.00043472848,"about_ca_topic_score_gemma":0.00045177096,"teacher_disagreement_score":0.004019287,"about_ca_system_score_codex":0.0006546448,"about_ca_system_score_gemma":0.0012094761,"threshold_uncertainty_score":0.021256268},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053760562,0.002921147,0.9124369,0.001403576,0.00031461407,0.000093295545,0.00008298226,0.00020364119,0.028783318],"genre_scores_gemma":[0.68782556,0.0024961696,0.2655696,0.00094262324,0.000454766,0.00033251487,0.00026091377,0.0006152637,0.04150249],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981894,0.0011075761,0.00004881381,0.0001654353,0.0003222781,0.0001665661],"domain_scores_gemma":[0.9897139,0.007383897,0.0003899527,0.00066474854,0.0013796423,0.00046789952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008053732,0.000981192,0.0015345475,0.0018563361,0.0013120257,0.001632398,0.0021029606,0.0019309638,0.004884889],"category_scores_gemma":[0.023924122,0.00051724014,0.0012065289,0.0012293608,0.003696648,0.0023852864,0.0041900417,0.002910646,0.0009628036],"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.0004204528,0.00008663045,0.001078465,0.00024502035,0.000073824005,0.00009959205,0.0002945057,0.18203083,0.0033264917,0.770641,0.0039759167,0.037727293],"study_design_scores_gemma":[0.00005238412,0.0001258569,0.00046941306,0.00008237949,0.000029741583,0.00008659997,0.00007110413,0.7847831,0.0016379751,0.20816854,0.004449004,0.000043867272],"about_ca_topic_score_codex":0.005089126,"about_ca_topic_score_gemma":0.0040338356,"teacher_disagreement_score":0.008053732,"about_ca_system_score_codex":0.0017960063,"about_ca_system_score_gemma":0.001971616,"threshold_uncertainty_score":0.042592704},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3539065,0.011275882,0.4712465,0.021725599,0.0014386767,0.00012331763,0.0009093094,0.00031545223,0.13905875],"genre_scores_gemma":[0.88223666,0.006576464,0.045836147,0.0014311286,0.002749,0.00024202955,0.0011542533,0.000539741,0.059234597],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99876416,0.00043412182,0.000055647244,0.00035766122,0.0002611799,0.00012729972],"domain_scores_gemma":[0.98954624,0.007646875,0.00041278434,0.00031715154,0.0011374339,0.00093962456],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024624576,0.0011999935,0.0016840477,0.0021838155,0.0018949972,0.0041455585,0.0015995982,0.0019121816,0.008990666],"category_scores_gemma":[0.013738237,0.00072064943,0.0012095695,0.0014699749,0.0073603643,0.008011592,0.0045634746,0.0076888297,0.0007035925],"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.00014684579,0.000046136625,0.00047063912,0.00019783416,0.000029722267,0.00025295795,0.0007898686,0.0062013585,0.0021866262,0.9757648,0.0038561483,0.010056994],"study_design_scores_gemma":[0.000026634578,0.000075207754,0.0007614868,0.000068367684,0.000018063685,0.0001406535,0.00028281324,0.020065783,0.00053975906,0.9732719,0.004721587,0.000027915885],"about_ca_topic_score_codex":0.0019904133,"about_ca_topic_score_gemma":0.001000808,"teacher_disagreement_score":0.008990666,"about_ca_system_score_codex":0.0016557038,"about_ca_system_score_gemma":0.00070849626,"threshold_uncertainty_score":0.030076802},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2680775,0.0029264665,0.68425936,0.00320958,0.00020457452,0.00031809098,0.00035434417,0.0001138153,0.040536303],"genre_scores_gemma":[0.842244,0.0024977827,0.13487442,0.00037521645,0.00015892027,0.00037017863,0.00034336373,0.00013982198,0.018996257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993937,0.00019307477,0.000038647002,0.000112181624,0.00013211598,0.00013027589],"domain_scores_gemma":[0.99628806,0.0023540854,0.0003146018,0.000086812615,0.00066994247,0.00028648562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024185313,0.0011770227,0.0011472731,0.0018469907,0.0016188032,0.0033713388,0.0015158614,0.002461898,0.0035616101],"category_scores_gemma":[0.012020028,0.0012801943,0.0012113474,0.0012607949,0.0028771043,0.0031064348,0.003103371,0.0027133643,0.00029237516],"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.00033363863,0.0002326924,0.00090598327,0.0003346089,0.000081772974,0.00037412537,0.000709367,0.07854883,0.014047121,0.8776476,0.0029716052,0.02381272],"study_design_scores_gemma":[0.00010832255,0.00013004373,0.00061194686,0.00011687523,0.00003876674,0.000212062,0.0005804429,0.4955733,0.0053179213,0.49422485,0.0030188113,0.00006667572],"about_ca_topic_score_codex":0.0026376157,"about_ca_topic_score_gemma":0.001862783,"teacher_disagreement_score":0.0035616101,"about_ca_system_score_codex":0.0013908368,"about_ca_system_score_gemma":0.0023700702,"threshold_uncertainty_score":0.012790561},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005917444,0.0002310576,0.99119204,0.000120461635,0.00004822527,0.000029281138,0.000027120297,0.0001997725,0.0022345984],"genre_scores_gemma":[0.24327093,0.00064315286,0.74782604,0.00019338391,0.000106752945,0.0002824492,0.00024458842,0.0003760323,0.0070565725],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951386,0.00020916417,0.000027858037,0.00005137936,0.00016049643,0.000037247613],"domain_scores_gemma":[0.9979717,0.0013709964,0.00011167971,0.0001773527,0.000286714,0.00008145991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018421559,0.0008159089,0.0012191416,0.0008653623,0.00052325946,0.00080988207,0.0014365976,0.0013660645,0.0048547834],"category_scores_gemma":[0.0073746443,0.00057319604,0.00082346227,0.0009959433,0.00090598204,0.0017073936,0.0021526283,0.0024050544,0.0009457691],"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.00041703598,0.00012099839,0.0006611308,0.00034743175,0.00006413808,0.00026622883,0.0002163123,0.6982238,0.007829021,0.10924796,0.0044781775,0.17812769],"study_design_scores_gemma":[0.0000148322415,0.000021690696,0.000045012843,0.000017401742,0.0000065675654,0.000032786666,0.000009982749,0.9796435,0.0008748966,0.018183937,0.0011435003,0.0000058865826],"about_ca_topic_score_codex":0.0017158516,"about_ca_topic_score_gemma":0.0017422622,"teacher_disagreement_score":0.0048547834,"about_ca_system_score_codex":0.0005436588,"about_ca_system_score_gemma":0.00081095204,"threshold_uncertainty_score":0.016240835},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11828731,0.011340989,0.7638265,0.0082625095,0.0010006134,0.00009225295,0.00040598656,0.00017255743,0.096611276],"genre_scores_gemma":[0.7888064,0.0092164,0.122495875,0.0019462382,0.0010455782,0.00023823907,0.00034649548,0.0003816419,0.07552325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993044,0.00021428253,0.000045076802,0.0001792627,0.00016506267,0.000091930546],"domain_scores_gemma":[0.99888676,0.0005182454,0.00011242507,0.00015817958,0.00021168604,0.000112726426],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002604955,0.00083077856,0.0013899514,0.0018666135,0.0011215669,0.0021325762,0.0013343596,0.0016657343,0.0047539067],"category_scores_gemma":[0.00415464,0.0005298066,0.0013786901,0.0010761316,0.003852517,0.0062470906,0.0036913953,0.0035382055,0.0007083066],"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.000031115826,0.000010772927,0.00013084871,0.00007260401,0.000024214665,0.000079803496,0.000113430775,0.002085623,0.0017980525,0.9888988,0.0012215502,0.005533233],"study_design_scores_gemma":[0.000014364724,0.000019154964,0.00021444494,0.000018442228,0.000013019519,0.00011237392,0.000028853847,0.011444221,0.00044760748,0.98311806,0.0045560207,0.000013518986],"about_ca_topic_score_codex":0.0014656013,"about_ca_topic_score_gemma":0.0007959719,"teacher_disagreement_score":0.0047539067,"about_ca_system_score_codex":0.0009681263,"about_ca_system_score_gemma":0.0009887805,"threshold_uncertainty_score":0.015903413},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83910996,0.00012028797,0.14525108,0.00043206481,0.00002495744,0.00003601732,0.00023756744,0.00013299257,0.0146551095],"genre_scores_gemma":[0.97773105,0.00008177478,0.018104065,0.000061518156,0.000013375159,0.00003288226,0.0002053764,0.000051982188,0.0037178528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996847,0.00006420578,0.000017062117,0.000076622884,0.00011554086,0.00004181214],"domain_scores_gemma":[0.9986822,0.00048186813,0.00018955124,0.0001805171,0.00023857591,0.00022727263],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062992395,0.00030941083,0.000417846,0.000734493,0.0005658417,0.0012229722,0.00044123485,0.0004918175,0.0022725912],"category_scores_gemma":[0.0019623851,0.00023879044,0.00043724812,0.00046274866,0.0015618146,0.0017617162,0.00089037226,0.0013926704,0.00018354412],"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.00011466857,0.00004774384,0.0022085614,0.0000373111,0.000019117935,0.0004055073,0.00023303789,0.015067401,0.0139961615,0.95793116,0.0010093072,0.00892995],"study_design_scores_gemma":[0.000019232439,0.000057935595,0.0026262444,0.000012446537,0.00000974134,0.00034512227,0.00020006823,0.12506051,0.009149372,0.85888255,0.0036185188,0.000018203142],"about_ca_topic_score_codex":0.0006737329,"about_ca_topic_score_gemma":0.00078948634,"teacher_disagreement_score":0.0022725912,"about_ca_system_score_codex":0.0006342711,"about_ca_system_score_gemma":0.00025554016,"threshold_uncertainty_score":0.007602632},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42960396,0.0021778438,0.54690456,0.0014948556,0.00013276559,0.000036994184,0.00017285705,0.00009662929,0.01937953],"genre_scores_gemma":[0.94702035,0.00095994637,0.04399616,0.00018667016,0.00028100438,0.00007420341,0.0001530606,0.000080901635,0.00724761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822325,0.00063613756,0.00011616577,0.00037206316,0.0004574574,0.0001949344],"domain_scores_gemma":[0.9923632,0.0048093074,0.00094025856,0.000387247,0.0007202708,0.00077961286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038562592,0.0008315718,0.0013871626,0.002016937,0.0013922467,0.0037384718,0.0018271358,0.0011816038,0.0019979503],"category_scores_gemma":[0.013846865,0.0007872142,0.0010290742,0.001491761,0.0037850707,0.007969712,0.0028882858,0.003232205,0.00014932934],"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.00003488071,0.000019440033,0.00041967395,0.000032234442,0.00002488444,0.000063738014,0.00015383064,0.0071493834,0.0010115474,0.9872701,0.00030032298,0.0035199693],"study_design_scores_gemma":[0.0000046451432,0.000016645023,0.00043306008,0.000008953918,0.000011914122,0.00005269084,0.000071880066,0.041303027,0.00029208232,0.9574551,0.00033799716,0.000011958813],"about_ca_topic_score_codex":0.0012750669,"about_ca_topic_score_gemma":0.0014057336,"teacher_disagreement_score":0.0038562592,"about_ca_system_score_codex":0.0014041153,"about_ca_system_score_gemma":0.00093833153,"threshold_uncertainty_score":0.020394087},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017451633,0.0015446312,0.93052775,0.001923901,0.00031823356,0.0000650554,0.00010841311,0.000056656896,0.048003722],"genre_scores_gemma":[0.62898284,0.0061014197,0.29264987,0.0021970044,0.0025202208,0.00042791138,0.00033802673,0.00039874588,0.06638394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992893,0.00032906624,0.000037484493,0.00010479632,0.0001679594,0.00007133503],"domain_scores_gemma":[0.99769115,0.0013150023,0.00019533765,0.00020964908,0.0003645544,0.0002244291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035040015,0.001972607,0.0011110409,0.0024501767,0.0014995807,0.0020852943,0.0022452413,0.0014399106,0.0059798933],"category_scores_gemma":[0.007890946,0.0005910153,0.0024189304,0.0020499397,0.0036110294,0.005499932,0.003769883,0.0044277073,0.0005416034],"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.000013818934,0.000029740211,0.000093903174,0.0000642244,0.000016961405,0.00008614386,0.00011022717,0.010702184,0.001139273,0.9806615,0.0014766529,0.0056053973],"study_design_scores_gemma":[0.0000047399953,0.000023672148,0.0001405566,0.000033146232,0.000013445961,0.000083386294,0.000046681667,0.10668633,0.00037903475,0.8883058,0.004269348,0.0000139506465],"about_ca_topic_score_codex":0.0018441464,"about_ca_topic_score_gemma":0.0018812025,"teacher_disagreement_score":0.0059798933,"about_ca_system_score_codex":0.0018806154,"about_ca_system_score_gemma":0.0014366878,"threshold_uncertainty_score":0.02000475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0057179113,0.00019359443,0.9895499,0.00030491207,0.000030131303,0.000030766903,0.000046934554,0.000038101633,0.0040877755],"genre_scores_gemma":[0.42687547,0.00071652274,0.56049937,0.00028706086,0.00011432505,0.00054893456,0.00022306234,0.00017652265,0.010558758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901056,0.0005558583,0.000026858834,0.000085792344,0.00021487527,0.00010605566],"domain_scores_gemma":[0.99808455,0.0013287202,0.00011494719,0.00017496124,0.00019872289,0.000098191354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029024207,0.0009993869,0.0012233328,0.0005518968,0.0005090051,0.0011597151,0.0013592559,0.0013230824,0.0032578458],"category_scores_gemma":[0.0067287264,0.0006367259,0.0013365772,0.0007549213,0.0011723159,0.0014668397,0.0021448908,0.0027190917,0.00034966986],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025409889,0.000026190395,0.00027756186,0.000037779326,0.000021002228,0.000053967597,0.000052555548,0.85346615,0.00028034585,0.13765655,0.000999154,0.0071032867],"study_design_scores_gemma":[0.000003100072,0.0000040516516,0.000019079736,0.0000041075896,0.0000017683768,0.00000471914,0.0000051085767,0.9793234,0.00004688589,0.020095356,0.00049058336,0.0000018150581],"about_ca_topic_score_codex":0.008717106,"about_ca_topic_score_gemma":0.007260925,"teacher_disagreement_score":0.008717106,"about_ca_system_score_codex":0.0019333306,"about_ca_system_score_gemma":0.0019789105,"threshold_uncertainty_score":0.017332733},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087700045,0.004321621,0.009447668,0.08005221,0.87741184,0.0000813705,0.0021822983,0.000753353,0.02487263],"genre_scores_gemma":[0.044057578,0.018490573,0.037554044,0.124306716,0.20980978,0.0004395365,0.008773435,0.0041926606,0.5523757],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975063,0.00046152924,0.0005113891,0.00041760897,0.0009484938,0.00015463769],"domain_scores_gemma":[0.98680115,0.0040066703,0.0005411603,0.0010266622,0.007262637,0.00036183032],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002866571,0.0021491058,0.0014114355,0.0027920178,0.0031864948,0.0026244235,0.0023049894,0.0038706241,0.05083478],"category_scores_gemma":[0.039127722,0.000825829,0.0011351802,0.0023876785,0.0016795397,0.003532922,0.0013437675,0.0059498474,0.027453175],"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.00006673382,0.000011708069,0.00007857259,0.00012489573,0.000008670696,0.00019373914,0.00003818677,0.00013362449,0.00010486425,0.005995889,0.9813674,0.011875717],"study_design_scores_gemma":[0.00005367198,0.000054328222,0.00052001746,0.00037600205,0.00004629683,0.0005308444,0.000100872785,0.0010121964,0.0008609896,0.013899174,0.98248863,0.000056977744],"about_ca_topic_score_codex":0.005819987,"about_ca_topic_score_gemma":0.0067507746,"teacher_disagreement_score":0.05083478,"about_ca_system_score_codex":0.0024394381,"about_ca_system_score_gemma":0.0024132025,"threshold_uncertainty_score":0.17005926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03404663,0.004239127,0.935228,0.0018262826,0.00012161441,0.000045736553,0.00014636171,0.00010921946,0.024237039],"genre_scores_gemma":[0.85112906,0.0044019027,0.12975965,0.00024951927,0.00044218058,0.0002400773,0.00027069388,0.00012479088,0.013382132],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978841,0.0011899127,0.00009324801,0.00025552357,0.00045178508,0.00012542639],"domain_scores_gemma":[0.9969081,0.0022082266,0.00031179542,0.00016597925,0.00027317792,0.00013257487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024224736,0.001393318,0.0011166013,0.0010365562,0.0006427722,0.0028777362,0.00068862573,0.0013422946,0.002537046],"category_scores_gemma":[0.006702349,0.0005767222,0.0008552831,0.0017303333,0.0028004635,0.0033461654,0.002304556,0.0024926055,0.00040964695],"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.000023692875,0.00002368086,0.00016038076,0.000078270605,0.000030052888,0.00006695607,0.00012964221,0.13241543,0.00074816623,0.8550168,0.00096373016,0.0103432415],"study_design_scores_gemma":[0.000008313735,0.000028178483,0.0000859376,0.00001932098,0.000006615372,0.000023824576,0.000034324934,0.33872342,0.00018510068,0.6586301,0.0022477892,0.000007164078],"about_ca_topic_score_codex":0.0021386386,"about_ca_topic_score_gemma":0.0014160055,"teacher_disagreement_score":0.0028777362,"about_ca_system_score_codex":0.001988726,"about_ca_system_score_gemma":0.0010227219,"threshold_uncertainty_score":0.014429271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062124515,0.00019795183,0.9896947,0.00031312957,0.000027017291,0.000039576924,0.000060781083,0.00007794441,0.0033764709],"genre_scores_gemma":[0.3267411,0.0007574775,0.66345876,0.00020581932,0.00008981064,0.0005216183,0.00033916094,0.00016172562,0.0077245026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928325,0.0003103224,0.000024690484,0.00013398181,0.00012477394,0.0001231164],"domain_scores_gemma":[0.9991487,0.00053210446,0.00006446117,0.00004072166,0.00014678732,0.00006725927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014829829,0.0011367784,0.0019724981,0.00077169645,0.0008839391,0.0028221083,0.0020030453,0.003226012,0.0052089156],"category_scores_gemma":[0.004035679,0.00095860177,0.0010581162,0.0018354807,0.0012007059,0.0024127248,0.002320782,0.0033650948,0.0008058544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028807515,0.000047563328,0.00012223377,0.00005845197,0.00001743627,0.000047773126,0.00005838456,0.94563395,0.00022992305,0.04219353,0.00097449595,0.010587415],"study_design_scores_gemma":[0.00001139418,0.0000119179485,0.000012498779,0.0000064877513,0.0000035038136,0.000008982611,0.000018329943,0.98290193,0.000061404564,0.016283605,0.0006759935,0.0000039329416],"about_ca_topic_score_codex":0.0072152033,"about_ca_topic_score_gemma":0.005176615,"teacher_disagreement_score":0.0072152033,"about_ca_system_score_codex":0.0015809692,"about_ca_system_score_gemma":0.0019779182,"threshold_uncertainty_score":0.017425537},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2210605,0.0015991536,0.7467536,0.0014217836,0.0002094875,0.00016035042,0.00024617647,0.0001824555,0.028366625],"genre_scores_gemma":[0.9071834,0.0013907754,0.056328155,0.00026416214,0.00017649564,0.00030844478,0.00030682486,0.00016327895,0.03387853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994123,0.0001636898,0.000040389525,0.00011725837,0.00016688167,0.0000994434],"domain_scores_gemma":[0.99731964,0.0014672178,0.00033740813,0.00010826048,0.0004539461,0.00031353705],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016917476,0.001024606,0.0013870278,0.0027988632,0.0015705999,0.0041888724,0.0017125526,0.0019440333,0.0055518434],"category_scores_gemma":[0.0075112353,0.00064848043,0.0009943566,0.0009268148,0.0028560152,0.003385421,0.0034574263,0.0019719407,0.00055848155],"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.00005161359,0.000043930984,0.00041748903,0.00008145887,0.000032702825,0.00015943807,0.00028919696,0.01861371,0.0020707194,0.97261816,0.0006872244,0.004934359],"study_design_scores_gemma":[0.000035810346,0.000045978544,0.00022175483,0.000030440751,0.000018787621,0.00008751486,0.0002482272,0.17800552,0.0006898745,0.8188227,0.0017722665,0.000021123247],"about_ca_topic_score_codex":0.0027943342,"about_ca_topic_score_gemma":0.0022588207,"teacher_disagreement_score":0.0055518434,"about_ca_system_score_codex":0.0022909716,"about_ca_system_score_gemma":0.0010726792,"threshold_uncertainty_score":0.018572748},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047261328,0.0019445748,0.89446485,0.004481969,0.0013140859,0.00011676592,0.00043858294,0.00011166699,0.04986619],"genre_scores_gemma":[0.75442994,0.0013698962,0.17736329,0.0025899394,0.0010135812,0.00024662528,0.00047256844,0.00023162471,0.06228255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991315,0.00035775217,0.000035332687,0.00018892657,0.0002171742,0.000069286776],"domain_scores_gemma":[0.99853754,0.0007167165,0.00009184791,0.00009827321,0.00032359554,0.00023201547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019439833,0.0012361647,0.00156093,0.0009837928,0.0011263035,0.002306166,0.0019190247,0.002564032,0.0076569533],"category_scores_gemma":[0.0036204585,0.00061140733,0.0011776541,0.0008053745,0.0023451932,0.0031529374,0.004105638,0.003858896,0.0004916649],"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.00005210273,0.000036891404,0.00020599346,0.00011723941,0.00003139074,0.00017546494,0.00007849411,0.013339971,0.002843679,0.97559035,0.0023890475,0.005139318],"study_design_scores_gemma":[0.00003103292,0.00008156966,0.00047426854,0.000046364326,0.00002874519,0.00022240957,0.0000695065,0.4651653,0.0006647399,0.528045,0.0051421407,0.000028911578],"about_ca_topic_score_codex":0.0027566918,"about_ca_topic_score_gemma":0.0031537844,"teacher_disagreement_score":0.0076569533,"about_ca_system_score_codex":0.0013971246,"about_ca_system_score_gemma":0.0016065914,"threshold_uncertainty_score":0.025615096},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028694605,0.00013454272,0.99516124,0.00007683733,0.000076002725,0.000020920992,0.000012596273,0.00007720099,0.001571236],"genre_scores_gemma":[0.12270837,0.000412424,0.86912906,0.00012665472,0.00013032023,0.00019622652,0.000056992667,0.00015222734,0.0070876926],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941874,0.0002245775,0.00001934212,0.00005749762,0.00024414065,0.000035848883],"domain_scores_gemma":[0.9993167,0.00038554778,0.000039084785,0.00006344039,0.00014951472,0.00004572901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015632667,0.0008829209,0.0016285635,0.0007856858,0.00075469114,0.0010262291,0.0014585402,0.0019897362,0.0028969296],"category_scores_gemma":[0.0033069032,0.0005930269,0.00083363854,0.0009259683,0.0013790401,0.0010427431,0.001883557,0.0025500208,0.00051347836],"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.00015160373,0.00012582363,0.00023180766,0.00028495266,0.000075835385,0.00015446403,0.00018044059,0.727278,0.0054680947,0.13428,0.0028982244,0.12887068],"study_design_scores_gemma":[0.000010530713,0.000029542902,0.00002642162,0.000011539139,0.000008822258,0.000020522753,0.000008330075,0.9848726,0.00053006114,0.0126362955,0.0018380564,0.000007275882],"about_ca_topic_score_codex":0.0025048398,"about_ca_topic_score_gemma":0.002679781,"teacher_disagreement_score":0.0028969296,"about_ca_system_score_codex":0.0005152183,"about_ca_system_score_gemma":0.0013138852,"threshold_uncertainty_score":0.009691238},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004662092,0.0007568466,0.9886796,0.00034780276,0.00035345514,0.00006661994,0.000045174394,0.00007756578,0.0050108638],"genre_scores_gemma":[0.15488029,0.0018397431,0.81488657,0.0004432225,0.00052743865,0.00039396484,0.00024488207,0.00028336537,0.026500527],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860007,0.0006597268,0.000082635386,0.0001467974,0.00042048722,0.0000903596],"domain_scores_gemma":[0.9972312,0.0015972961,0.00016855892,0.00035136155,0.0004510995,0.00020047605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046581444,0.0014369355,0.0013006614,0.0015507296,0.00086861436,0.0020699291,0.0028234653,0.0022511412,0.0053178724],"category_scores_gemma":[0.010932356,0.0008334292,0.0016682247,0.0012986659,0.0020210778,0.0036286816,0.0046427646,0.004690714,0.000960654],"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.000117641845,0.00009461771,0.00030032077,0.0001822898,0.000056310328,0.000084816464,0.000256802,0.08900188,0.0042420593,0.834349,0.0039502988,0.06736398],"study_design_scores_gemma":[0.000035050998,0.0000536611,0.00008584772,0.000041588894,0.000021339822,0.00006629459,0.000027975702,0.8193368,0.000799921,0.17000447,0.009504698,0.000022459886],"about_ca_topic_score_codex":0.001719979,"about_ca_topic_score_gemma":0.0024970828,"teacher_disagreement_score":0.0053178724,"about_ca_system_score_codex":0.0019054408,"about_ca_system_score_gemma":0.0012594452,"threshold_uncertainty_score":0.024634957},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019705651,0.014570635,0.88775057,0.007846191,0.0014091212,0.00006207458,0.00017034901,0.00010238194,0.068382986],"genre_scores_gemma":[0.58546,0.01651694,0.34181288,0.0033430012,0.0046981107,0.00055700087,0.00044028834,0.00048978743,0.046682045],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968671,0.0020737613,0.00013513242,0.00026496706,0.0005164361,0.00014254262],"domain_scores_gemma":[0.9926444,0.0056646075,0.00031954877,0.00043936115,0.0006039811,0.00032813213],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0065769735,0.0013651515,0.0022047637,0.002640462,0.0017810211,0.0047214045,0.0017927539,0.0019880608,0.005333326],"category_scores_gemma":[0.0147357015,0.0012258465,0.0019204911,0.0029502641,0.005402735,0.009085961,0.0046776845,0.008217388,0.00073018664],"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.000016520395,0.000017917982,0.000069777554,0.000050757328,0.000012816621,0.000018839519,0.000059598136,0.001574028,0.00010873514,0.9926581,0.0011575259,0.004255495],"study_design_scores_gemma":[0.0000064064575,0.000011316381,0.00004672428,0.00002712115,0.000007028022,0.000026597721,0.000019534651,0.013071686,0.00006789583,0.9833444,0.0033653306,0.0000058863006],"about_ca_topic_score_codex":0.0008787844,"about_ca_topic_score_gemma":0.0008118593,"teacher_disagreement_score":0.0065769735,"about_ca_system_score_codex":0.0019452225,"about_ca_system_score_gemma":0.0010787381,"threshold_uncertainty_score":0.034782767},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0038922383,0.0000806196,0.9946102,0.00007306185,0.000023672139,0.000018386263,0.00001754185,0.00015153197,0.0011327566],"genre_scores_gemma":[0.22463371,0.00025682227,0.7665942,0.0001770235,0.00008297415,0.0005424249,0.00024019582,0.00059115863,0.0068815285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990866,0.000437936,0.00004078201,0.00011207692,0.0002644044,0.000058192],"domain_scores_gemma":[0.9950782,0.0038042448,0.00018995319,0.00027029836,0.00044255747,0.0002147162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024249305,0.0011316135,0.0019058817,0.0008132217,0.0005901058,0.0014252566,0.0016829572,0.0020758417,0.0031285672],"category_scores_gemma":[0.007224151,0.0012298521,0.001096647,0.0007581334,0.0021335394,0.001950059,0.0028763355,0.0030870084,0.0005831748],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104508596,0.000099580626,0.0002872366,0.0002214051,0.00006678383,0.000062573585,0.00009585328,0.8686655,0.0020543667,0.09449921,0.0016800355,0.032162882],"study_design_scores_gemma":[0.000006353553,0.00000825925,0.000012774987,0.000004354636,0.000002284513,0.000004332408,0.0000034587247,0.9846347,0.00016472173,0.014925173,0.00023065446,0.0000030735032],"about_ca_topic_score_codex":0.002883131,"about_ca_topic_score_gemma":0.003469004,"teacher_disagreement_score":0.0031285672,"about_ca_system_score_codex":0.00075319706,"about_ca_system_score_gemma":0.0019652103,"threshold_uncertainty_score":0.012824357},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030380215,0.0020567107,0.7787853,0.007945832,0.0014317556,0.00013276545,0.0006488908,0.00083852344,0.17778005],"genre_scores_gemma":[0.679817,0.003075757,0.24599059,0.0037872638,0.0020368337,0.00044150866,0.0005502787,0.00087008765,0.06343066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99961853,0.00008285483,0.000018379826,0.000083116,0.00015854201,0.00003858491],"domain_scores_gemma":[0.9994223,0.00025664063,0.000042281405,0.00009866901,0.00011650913,0.00006355992],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073711947,0.001090791,0.0009759366,0.0012857144,0.0010410175,0.0012795525,0.0013712465,0.0016005017,0.017433105],"category_scores_gemma":[0.0024466235,0.0005363641,0.001474626,0.00074720685,0.0022801147,0.0034106667,0.003794479,0.0034920454,0.0025665492],"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.000014731927,0.000020498637,0.00006579487,0.0001173482,0.000019364088,0.00013910467,0.000083594205,0.0019269135,0.0029208774,0.97725487,0.0057942187,0.011642734],"study_design_scores_gemma":[0.00000894544,0.000014218864,0.0001285525,0.000013784051,0.000005439859,0.000099487,0.000013099481,0.004381941,0.0005144516,0.98578656,0.009022443,0.000010908679],"about_ca_topic_score_codex":0.0005087672,"about_ca_topic_score_gemma":0.00052721275,"teacher_disagreement_score":0.017433105,"about_ca_system_score_codex":0.0007014879,"about_ca_system_score_gemma":0.00047841537,"threshold_uncertainty_score":0.05831957},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025304307,0.00009138233,0.995685,0.00008432765,0.000031566407,0.00003306831,0.00002016185,0.00003948579,0.0014845971],"genre_scores_gemma":[0.10375334,0.00048655568,0.8869361,0.0001331418,0.00010245418,0.00039243064,0.00018280602,0.0003213806,0.0076918066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99930894,0.00032899933,0.00003102624,0.00009171589,0.00018699803,0.000052301213],"domain_scores_gemma":[0.99817204,0.0012454923,0.00008498482,0.000108436325,0.00025579482,0.00013324672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027903973,0.0015422358,0.0019908396,0.00088307075,0.0005661155,0.0015150756,0.0023514333,0.0016557628,0.005854008],"category_scores_gemma":[0.0054721306,0.0011066836,0.0017535682,0.00081874494,0.0018617086,0.002176171,0.0035160799,0.0048014354,0.0008279569],"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.0003704537,0.0003044771,0.00064618135,0.0008442571,0.00015575434,0.00032091266,0.0003357832,0.40150395,0.011262925,0.47118175,0.006214387,0.10685914],"study_design_scores_gemma":[0.00002846283,0.00006238989,0.000039351627,0.000024411855,0.000015400095,0.000045095443,0.000028361274,0.95757765,0.00072942296,0.040100776,0.0013353886,0.000013204119],"about_ca_topic_score_codex":0.0020560485,"about_ca_topic_score_gemma":0.0021817985,"teacher_disagreement_score":0.005854008,"about_ca_system_score_codex":0.00066240126,"about_ca_system_score_gemma":0.0020723243,"threshold_uncertainty_score":0.019583642},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030991185,0.00080018607,0.9632148,0.00047191628,0.0001633123,0.000018716233,0.00003374443,0.000074597745,0.004231505],"genre_scores_gemma":[0.9105719,0.0014136288,0.07618782,0.00022634114,0.0002765438,0.00006534403,0.00010781364,0.000047267957,0.011103237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998072,0.000040407336,0.000013593853,0.000055079734,0.00006243024,0.000021356458],"domain_scores_gemma":[0.9996512,0.00017831076,0.00007340701,0.000023716093,0.00005440827,0.000018950557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004871877,0.0006637476,0.0006233595,0.00016247237,0.0002786243,0.0009183331,0.0003289579,0.0008938092,0.0012760473],"category_scores_gemma":[0.0008776384,0.00017176944,0.00039013347,0.0002358323,0.0005940549,0.0008327394,0.0005948889,0.0006543501,0.00021955653],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025917124,0.00007198497,0.0014814774,0.0004831255,0.00013042653,0.0005692422,0.0003260424,0.5726045,0.031418126,0.30705413,0.0027914296,0.08281034],"study_design_scores_gemma":[0.0000040063373,0.000035124325,0.00022395956,0.000007943472,0.000007568056,0.00004243285,0.000024917785,0.9732143,0.0019379174,0.022965815,0.0015276708,0.000008344487],"about_ca_topic_score_codex":0.0014360121,"about_ca_topic_score_gemma":0.00096945127,"teacher_disagreement_score":0.0014360121,"about_ca_system_score_codex":0.0004130894,"about_ca_system_score_gemma":0.00033621528,"threshold_uncertainty_score":0.004268825},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31007695,0.0012951797,0.6377513,0.0010038747,0.00012723466,0.000081719416,0.00020497662,0.00032515815,0.049133714],"genre_scores_gemma":[0.9689774,0.00032589672,0.024427474,0.00009674416,0.00010774194,0.000051192477,0.00009184667,0.00009104035,0.005830698],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998611,0.0004032946,0.000085133186,0.0002991186,0.00046226117,0.00013925797],"domain_scores_gemma":[0.99735117,0.0008479557,0.0006493425,0.00026414383,0.00054920046,0.00033810633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020341247,0.0006668373,0.000717472,0.0020376192,0.00062847184,0.0023572766,0.000954242,0.000836356,0.005512993],"category_scores_gemma":[0.0043163556,0.0004293867,0.0007280344,0.00063280086,0.0027895323,0.0030418928,0.0024379,0.0019968457,0.00047374482],"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.00003167338,0.000021883674,0.0003670501,0.000056791116,0.000025992289,0.0001965444,0.0001590888,0.006655289,0.0048242398,0.98314923,0.0003365459,0.0041756346],"study_design_scores_gemma":[0.000013882231,0.00009117148,0.00072576926,0.00004037134,0.000015516964,0.0003735899,0.00020700377,0.07349965,0.004339242,0.9167553,0.0039112945,0.000027340046],"about_ca_topic_score_codex":0.00015190725,"about_ca_topic_score_gemma":0.00013264481,"teacher_disagreement_score":0.005512993,"about_ca_system_score_codex":0.0007956469,"about_ca_system_score_gemma":0.00031992138,"threshold_uncertainty_score":0.01844275},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047764365,0.0016655326,0.93677163,0.001915896,0.00017556526,0.000061391045,0.00013493406,0.00018153156,0.011329283],"genre_scores_gemma":[0.6887246,0.0034274731,0.2467386,0.0013189742,0.0007659084,0.00048993895,0.00089921657,0.00083120767,0.05680406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838424,0.0008073807,0.000091035945,0.00018770507,0.00041147263,0.00011824397],"domain_scores_gemma":[0.9932266,0.004250988,0.00046855054,0.00047363804,0.0009831742,0.00059701584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056871637,0.0015096642,0.0019365776,0.0019344102,0.00089194777,0.0028281142,0.0017777922,0.0026214486,0.002532991],"category_scores_gemma":[0.013415828,0.00096137734,0.0011621945,0.0013281128,0.0032670856,0.0036533284,0.003739479,0.0052366923,0.00044734613],"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.00018091919,0.00014052748,0.0005022869,0.00027548047,0.00007802318,0.00017275056,0.00028654293,0.10425344,0.00953769,0.8524627,0.0037898864,0.028319724],"study_design_scores_gemma":[0.000016398448,0.000053571075,0.00024576887,0.000036595553,0.000011247907,0.00006651311,0.00003794222,0.5407525,0.00073962257,0.4559911,0.0020302248,0.000018428202],"about_ca_topic_score_codex":0.002743229,"about_ca_topic_score_gemma":0.0022648985,"teacher_disagreement_score":0.0056871637,"about_ca_system_score_codex":0.0026109247,"about_ca_system_score_gemma":0.001768467,"threshold_uncertainty_score":0.030076921},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.49081346,0.00070322404,0.4683346,0.0006157838,0.00006873355,0.00013750323,0.00040337857,0.00012779873,0.038795587],"genre_scores_gemma":[0.9447803,0.00047079663,0.04705391,0.00014480142,0.00011728457,0.00012669072,0.0005801806,0.000080451144,0.0066456283],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986273,0.00031469695,0.000097586424,0.00021708447,0.0005598124,0.0001834988],"domain_scores_gemma":[0.9958306,0.0012089811,0.0006907866,0.00038401783,0.0011785973,0.0007070036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015951418,0.00067379675,0.0005798388,0.0019610054,0.0010234368,0.0030357924,0.0007629087,0.00048634343,0.003112961],"category_scores_gemma":[0.004510148,0.00037123237,0.0009249604,0.001121483,0.0035407618,0.0034832058,0.0019492991,0.0025901909,0.00033410083],"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.000034506596,0.000022253396,0.0010289582,0.00002442189,0.000007087005,0.00015084214,0.00022137286,0.0026356333,0.0014727168,0.9895085,0.00041503002,0.0044785766],"study_design_scores_gemma":[0.000013793438,0.00004625992,0.001172865,0.00002187706,0.000006559989,0.00028689372,0.00020596832,0.04548275,0.0013588615,0.94917774,0.002195252,0.00003123337],"about_ca_topic_score_codex":0.0010340549,"about_ca_topic_score_gemma":0.0010183918,"teacher_disagreement_score":0.003112961,"about_ca_system_score_codex":0.0010263617,"about_ca_system_score_gemma":0.00077511586,"threshold_uncertainty_score":0.010413945},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029525418,0.0020466042,0.9202509,0.0025071073,0.00043233804,0.00008933609,0.00022910749,0.00018255282,0.04473667],"genre_scores_gemma":[0.8225215,0.004152782,0.099774465,0.0015136226,0.0015496707,0.00066171767,0.0007800777,0.0009467113,0.068099365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990859,0.00035670752,0.000042917756,0.00015572678,0.0002659626,0.000092838876],"domain_scores_gemma":[0.9957021,0.0023269285,0.0002685986,0.0001675788,0.0012787553,0.00025604258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029925643,0.0021583503,0.0014038694,0.0023869413,0.0012599552,0.0024771057,0.0015263378,0.0015655309,0.008012009],"category_scores_gemma":[0.0077531743,0.00065410003,0.0015623665,0.00097555306,0.002774532,0.003757437,0.0041647707,0.004278499,0.0012212029],"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.00018708575,0.000059892995,0.0005168673,0.00024207508,0.00012578169,0.00014417408,0.00030162925,0.05958008,0.01166584,0.89544666,0.0056246375,0.026105288],"study_design_scores_gemma":[0.00002648042,0.000104995306,0.00032920504,0.00005193364,0.000039783074,0.00008249787,0.000103011465,0.45050797,0.0021962016,0.5419675,0.004555294,0.00003508989],"about_ca_topic_score_codex":0.0018907621,"about_ca_topic_score_gemma":0.0011656393,"teacher_disagreement_score":0.008012009,"about_ca_system_score_codex":0.001283882,"about_ca_system_score_gemma":0.0013809103,"threshold_uncertainty_score":0.026802778},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034324482,0.004334801,0.86551386,0.0023520272,0.000895752,0.000086340646,0.00039794954,0.00047702304,0.09161773],"genre_scores_gemma":[0.54137087,0.0074919467,0.3489782,0.0013186837,0.00231847,0.0005199596,0.0014693006,0.0010790799,0.09545356],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762696,0.0004768011,0.00015292254,0.00056089007,0.00084233907,0.00034009272],"domain_scores_gemma":[0.9965339,0.0018611744,0.00017913074,0.0003357555,0.0008150185,0.00027499147],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027073221,0.0011351764,0.0018950404,0.00561138,0.0051443777,0.006742052,0.0029770304,0.0022730096,0.016458021],"category_scores_gemma":[0.0075211595,0.001363502,0.0033496849,0.004857051,0.0040776404,0.018075103,0.011785066,0.0077044126,0.001620164],"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.000017299624,0.000013757322,0.00012043047,0.000036434074,0.000009221452,0.000042272528,0.00015501866,0.00028299287,0.00027410593,0.9884467,0.0011303361,0.009471357],"study_design_scores_gemma":[0.0000105221,0.000020085314,0.00012034959,0.000025795933,0.000024373583,0.00021264807,0.00012266957,0.0074666007,0.0009376529,0.9752476,0.015794136,0.000017535187],"about_ca_topic_score_codex":0.0019697186,"about_ca_topic_score_gemma":0.0011538024,"teacher_disagreement_score":0.016458021,"about_ca_system_score_codex":0.001950979,"about_ca_system_score_gemma":0.0010320201,"threshold_uncertainty_score":0.055057585},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22068793,0.0005756711,0.6756713,0.00062372105,0.00019493385,0.00010867193,0.00026146075,0.00017469075,0.101701595],"genre_scores_gemma":[0.8072724,0.0007902118,0.13240272,0.00027330668,0.00022373792,0.000125399,0.0003328152,0.00011334389,0.058466144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997416,0.000041292893,0.000016728416,0.00004698778,0.000112567424,0.000040769923],"domain_scores_gemma":[0.99969196,0.000054282158,0.000045827794,0.000035353216,0.00009020797,0.000082298066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000512907,0.0005839362,0.0002750304,0.0008664655,0.00045432738,0.0011245452,0.000433398,0.0005233106,0.005562788],"category_scores_gemma":[0.0010639922,0.00017776701,0.00049959746,0.0003258335,0.000971118,0.0020862282,0.001110312,0.0013424092,0.0006244277],"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.000010647191,0.000010011558,0.00006157583,0.000016073958,0.000001854872,0.000054185857,0.00008992264,0.0012390977,0.0019495686,0.99152935,0.00032287222,0.004714839],"study_design_scores_gemma":[0.0000097909415,0.000033486886,0.00013632642,0.000012826781,0.0000039348274,0.00014858661,0.00008432543,0.037288565,0.0017109204,0.95476466,0.005797775,0.000008909816],"about_ca_topic_score_codex":0.0005750325,"about_ca_topic_score_gemma":0.00048700895,"teacher_disagreement_score":0.005562788,"about_ca_system_score_codex":0.00069268927,"about_ca_system_score_gemma":0.0004934683,"threshold_uncertainty_score":0.018609345},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005128859,0.000060412644,0.9934029,0.00006601667,0.000029602974,0.000041279724,0.00001455345,0.00009308866,0.0011633482],"genre_scores_gemma":[0.17422852,0.000116225165,0.8195686,0.00009288025,0.000027012298,0.0003929695,0.00009249088,0.00018719252,0.0052941516],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994338,0.00020602824,0.00003824115,0.00006619083,0.0001994053,0.000056212783],"domain_scores_gemma":[0.9970945,0.0019135576,0.00015347044,0.0002004199,0.00048002778,0.0001580627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002589623,0.00085106347,0.0010926074,0.00078599097,0.00070764875,0.0013328119,0.0023436518,0.0019739799,0.0043655834],"category_scores_gemma":[0.0063212076,0.00085561327,0.0011581144,0.0005814443,0.001663613,0.0016063727,0.0037407225,0.0023325612,0.0007284637],"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.0003146472,0.00018852016,0.00087955163,0.00034569693,0.00011186463,0.00015878743,0.0004700254,0.65301245,0.008414709,0.22950387,0.00208593,0.10451386],"study_design_scores_gemma":[0.000014285882,0.000023442533,0.000029584808,0.0000097344355,0.0000050116705,0.000011512127,0.000013537629,0.98200953,0.0006999436,0.016493363,0.0006822424,0.000007818333],"about_ca_topic_score_codex":0.0042778123,"about_ca_topic_score_gemma":0.0052780933,"teacher_disagreement_score":0.0043655834,"about_ca_system_score_codex":0.0012107637,"about_ca_system_score_gemma":0.0017579426,"threshold_uncertainty_score":0.01460439},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027583323,0.0006871227,0.99260783,0.00031811825,0.00014688044,0.000039295155,0.00003329877,0.00007753938,0.003331669],"genre_scores_gemma":[0.24224804,0.0025549096,0.73037064,0.0006135898,0.00070210616,0.000688412,0.00034725465,0.00063230935,0.02184267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983113,0.0010286124,0.000068637455,0.00012726554,0.00035647786,0.00010780829],"domain_scores_gemma":[0.99641824,0.0023920613,0.00022762582,0.00025327492,0.0005683223,0.00014042878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00337733,0.0019592096,0.001816797,0.0014254914,0.0007469001,0.001662849,0.0023018399,0.0019756153,0.0038713417],"category_scores_gemma":[0.0109110875,0.0010286503,0.0020470552,0.0014361542,0.002587594,0.0019522179,0.004426646,0.003353262,0.0006512251],"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.00009652736,0.000044846427,0.00032428437,0.00039917056,0.00023478584,0.00011466537,0.00026235476,0.29244202,0.002534535,0.632809,0.004324427,0.06641344],"study_design_scores_gemma":[0.000022890708,0.000021612757,0.00007740453,0.0000346368,0.000021583877,0.000026448472,0.000021686465,0.7881898,0.00034528438,0.2075664,0.0036568858,0.000015306412],"about_ca_topic_score_codex":0.005738318,"about_ca_topic_score_gemma":0.0060181795,"teacher_disagreement_score":0.005738318,"about_ca_system_score_codex":0.0017092997,"about_ca_system_score_gemma":0.0021313194,"threshold_uncertainty_score":0.017861247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4133233,0.0007428574,0.5447266,0.00093456183,0.00008282009,0.00009385498,0.00027269253,0.00026405868,0.03955936],"genre_scores_gemma":[0.8974261,0.0004591809,0.09019026,0.00017144154,0.000074763106,0.00022058628,0.0004722705,0.0001816585,0.010803588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849665,0.00047483228,0.000051913376,0.00030894348,0.00042609748,0.00024151187],"domain_scores_gemma":[0.9977678,0.0010289779,0.00027227975,0.00021965809,0.00036329823,0.00034809907],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018044808,0.00063804444,0.000980934,0.0019218014,0.0024362633,0.002455287,0.0013913414,0.0012595016,0.005857364],"category_scores_gemma":[0.007274728,0.0005956012,0.00090690225,0.001028742,0.003896188,0.0026981798,0.0044715567,0.0021204695,0.0007321698],"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.00007189686,0.000022543041,0.0008927189,0.00003829325,0.000015508787,0.00008770997,0.00033391555,0.012842979,0.0011085746,0.98018575,0.0006088923,0.0037911474],"study_design_scores_gemma":[0.000031944008,0.00007106742,0.0009347942,0.00006690252,0.000015033018,0.00013379131,0.00047307284,0.2034834,0.0018066483,0.78936374,0.0035870569,0.000032474632],"about_ca_topic_score_codex":0.0025777663,"about_ca_topic_score_gemma":0.0018014078,"teacher_disagreement_score":0.005857364,"about_ca_system_score_codex":0.0019964827,"about_ca_system_score_gemma":0.0008789691,"threshold_uncertainty_score":0.019594908},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16778597,0.0014275302,0.79008037,0.0016586127,0.00018507,0.000074884876,0.0007159146,0.00025834038,0.037813324],"genre_scores_gemma":[0.892946,0.0021090037,0.07326857,0.0005043453,0.0004919101,0.00016530059,0.0012298502,0.00036978658,0.028915308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984628,0.0005511897,0.000089786125,0.00030740327,0.00041428127,0.00017452266],"domain_scores_gemma":[0.99599934,0.0015496413,0.00054299046,0.00022335944,0.0012835325,0.00040125102],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001970207,0.001153643,0.00067404535,0.0020385454,0.0007129972,0.0025779917,0.0006889642,0.00071067986,0.0042663785],"category_scores_gemma":[0.005085805,0.000410817,0.0008972432,0.0012173506,0.0026361032,0.00439697,0.0015664255,0.002087993,0.00079213665],"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.000043206936,0.000020951555,0.0007825912,0.0001167588,0.000020920766,0.00017330045,0.00029554163,0.009773332,0.0052182325,0.97360283,0.001600267,0.008352067],"study_design_scores_gemma":[0.000016040658,0.00023525648,0.0029488716,0.00011414373,0.0000411819,0.0006289117,0.0005821738,0.24182408,0.0068226918,0.725445,0.021259438,0.00008234647],"about_ca_topic_score_codex":0.0015122108,"about_ca_topic_score_gemma":0.00084858434,"teacher_disagreement_score":0.0042663785,"about_ca_system_score_codex":0.0017700132,"about_ca_system_score_gemma":0.0008875812,"threshold_uncertainty_score":0.014272451},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039056984,0.00010073241,0.99450207,0.00012602484,0.00006348758,0.000066034845,0.00004336283,0.00015629931,0.0010363334],"genre_scores_gemma":[0.07345555,0.00014758168,0.92183214,0.00014429184,0.000097461285,0.00030639215,0.00031955537,0.00022473987,0.0034722688],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988858,0.0004319688,0.000069807706,0.0001831237,0.00034344505,0.000085901476],"domain_scores_gemma":[0.9981351,0.0009399942,0.000059630805,0.00023553692,0.0004560558,0.00017364885],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027587581,0.0012728815,0.001973591,0.00075194315,0.00066769175,0.0014622806,0.0028085716,0.0021178145,0.008982886],"category_scores_gemma":[0.005600312,0.0012714742,0.0013786363,0.0010101045,0.0011899809,0.0023870787,0.0040118992,0.005189573,0.0015057542],"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.00077676226,0.00048388174,0.00075782416,0.00048983097,0.00023367537,0.00019415427,0.00032109415,0.41095653,0.013906,0.14886077,0.010508645,0.4125108],"study_design_scores_gemma":[0.000042739703,0.000059067308,0.000046757643,0.000014185768,0.000008757537,0.000024110632,0.000013074451,0.98213863,0.0006816144,0.01598565,0.0009779503,0.0000075053695],"about_ca_topic_score_codex":0.0025119702,"about_ca_topic_score_gemma":0.0028041773,"teacher_disagreement_score":0.008982886,"about_ca_system_score_codex":0.0007469901,"about_ca_system_score_gemma":0.0022825936,"threshold_uncertainty_score":0.030050755},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022543974,0.0010784868,0.9721993,0.0011290034,0.0001737218,0.000019315718,0.00005070179,0.00007572982,0.023019427],"genre_scores_gemma":[0.29634637,0.0052724257,0.63358146,0.0006112377,0.0010220882,0.00031785696,0.0002133359,0.00045080305,0.062184315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990113,0.00047785812,0.000043058568,0.00011330885,0.0002906602,0.00006371089],"domain_scores_gemma":[0.99918884,0.00049871625,0.00004319064,0.00007027529,0.00014260263,0.000056337878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015171177,0.0011882134,0.0019314804,0.00084086816,0.00094610755,0.00402841,0.002311068,0.0023005358,0.009134481],"category_scores_gemma":[0.005718788,0.0012452733,0.0012385,0.0024059962,0.0023431948,0.0044213287,0.0023316958,0.0053660213,0.0011409873],"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.000010116588,0.000028597216,0.000038172104,0.000054248736,0.000016168882,0.000030986204,0.000048534388,0.06542658,0.00014587537,0.9118339,0.0028629063,0.019504024],"study_design_scores_gemma":[0.000005515393,0.000007422643,0.000017548371,0.00001348292,0.000006080892,0.000016684422,0.000013220056,0.15209179,0.00007417643,0.84400094,0.0037445165,0.000008661825],"about_ca_topic_score_codex":0.0024356004,"about_ca_topic_score_gemma":0.0023409964,"teacher_disagreement_score":0.009134481,"about_ca_system_score_codex":0.0015494779,"about_ca_system_score_gemma":0.0013453536,"threshold_uncertainty_score":0.03055787},"labels":[],"label_agreement":null},{"id":"W2101393121","doi":"10.1007/s11228-011-0187-7","title":"Firmly Nonexpansive Mappings and Maximally Monotone Operators: Correspondence and Duality","year":2011,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; Okanagan College","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Iterated function; Monotone polygon; Mathematics; Duality (order theory); Fixed point; Dual (grammatical number); Convergence (economics); Pure mathematics; Monotonic function; Discrete mathematics; Mathematical analysis","score_opus":0.02664853637802502,"score_gpt":0.2432763106379922,"score_spread":0.21662777425996718,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2101393121","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13364431,0.0041030375,0.77906245,0.0065436577,0.00038150253,0.00006789726,0.00017550279,0.00008620178,0.07593539],"genre_scores_gemma":[0.9011373,0.0025081555,0.0716071,0.0007451293,0.0006399902,0.0001515397,0.00016195922,0.0000886981,0.022960043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827135,0.00085469475,0.00008045359,0.00033394573,0.00033582392,0.00012369963],"domain_scores_gemma":[0.99558324,0.002941884,0.000497032,0.00029319915,0.0003705522,0.00031409514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031377638,0.0007888716,0.0010484548,0.0016838834,0.0016526796,0.004903844,0.001452869,0.0025257599,0.004170393],"category_scores_gemma":[0.0104714725,0.00091937324,0.001139888,0.0018817873,0.0043229926,0.007835259,0.0034161701,0.0057702144,0.0003410142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000010884567,0.000012917906,0.000049444832,0.000013183572,0.0000047131007,0.000027865259,0.00007606255,0.0010148919,0.00020503599,0.99661154,0.0002062468,0.0017670463],"study_design_scores_gemma":[0.000005313367,0.000012523557,0.000071305745,0.0000069393946,0.000003457774,0.000044865348,0.00004317252,0.009345136,0.00011964047,0.9895682,0.0007753897,0.0000041873914],"about_ca_topic_score_codex":0.000694645,"about_ca_topic_score_gemma":0.00052483066,"teacher_disagreement_score":0.004903844,"about_ca_system_score_codex":0.0019047997,"about_ca_system_score_gemma":0.0012296119,"threshold_uncertainty_score":0.01659429},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024796126,0.00011547291,0.99584913,0.00015624214,0.000035778354,0.00005126328,0.000014280646,0.000092878494,0.001205356],"genre_scores_gemma":[0.159905,0.00024691518,0.83139694,0.00026974507,0.00012645288,0.00051174534,0.00016120383,0.00021883925,0.00716317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991341,0.0004116229,0.000037571142,0.00011501716,0.00023431968,0.0000674225],"domain_scores_gemma":[0.9986603,0.00083572866,0.00008025071,0.00008803124,0.00025425185,0.000081425904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021625124,0.0010554775,0.0011672426,0.00071974593,0.00046236484,0.0010060564,0.001474935,0.0017574581,0.0026660946],"category_scores_gemma":[0.0045678047,0.00061779184,0.0008362134,0.00066248875,0.0013443129,0.0012348855,0.0016782864,0.0022742513,0.00068792095],"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.0002373239,0.00013987276,0.0006926047,0.00024267688,0.000112822636,0.00015371425,0.0001891984,0.64833593,0.007896912,0.20998494,0.0044936994,0.12752022],"study_design_scores_gemma":[0.00001554147,0.00003494474,0.000035718847,0.000008336761,0.000003669041,0.000014051624,0.000004585243,0.98745084,0.00041467164,0.010861606,0.0011502311,0.0000058255223],"about_ca_topic_score_codex":0.0025573485,"about_ca_topic_score_gemma":0.0020336942,"teacher_disagreement_score":0.0026660946,"about_ca_system_score_codex":0.0011443481,"about_ca_system_score_gemma":0.0016807521,"threshold_uncertainty_score":0.011436641},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035006222,0.000031416712,0.9958689,0.000048483136,0.000017162598,0.000026935153,0.00000956879,0.00007865943,0.00041822568],"genre_scores_gemma":[0.07708817,0.00013931078,0.9186568,0.00008619049,0.000046668338,0.00024858385,0.00012001303,0.0002412176,0.003372987],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899954,0.0004029338,0.00004682631,0.00016733282,0.00030429472,0.00007918457],"domain_scores_gemma":[0.9981584,0.0010974982,0.000109862456,0.00017519724,0.00030026343,0.00015889807],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003248635,0.0015044879,0.0020530664,0.0009933766,0.00050522754,0.0016163366,0.0029595683,0.0018616113,0.0037589725],"category_scores_gemma":[0.004984644,0.0011423613,0.0020107,0.0006911232,0.0022513953,0.0028579198,0.004180757,0.0044170045,0.0011699733],"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.00097108824,0.00044483476,0.0013071235,0.0008279876,0.00035662405,0.0004365465,0.000656115,0.2933781,0.06944199,0.36370957,0.0050795423,0.26339036],"study_design_scores_gemma":[0.000042119707,0.00014872105,0.000066678695,0.0000173827,0.000019335517,0.000076550066,0.00003780807,0.9778886,0.003117015,0.01775036,0.000813805,0.000021689846],"about_ca_topic_score_codex":0.0009268792,"about_ca_topic_score_gemma":0.0008813252,"teacher_disagreement_score":0.0037589725,"about_ca_system_score_codex":0.00064532255,"about_ca_system_score_gemma":0.0018871382,"threshold_uncertainty_score":0.017180622},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06900696,0.0012705672,0.8879288,0.0008560264,0.00029740905,0.00004664695,0.00021430971,0.00022536877,0.040153794],"genre_scores_gemma":[0.796822,0.003031344,0.14097251,0.00096639013,0.00056511944,0.0002762835,0.0006672369,0.00028768528,0.05641145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948466,0.0001545785,0.000031819985,0.00010821442,0.0001392095,0.000081567916],"domain_scores_gemma":[0.9991517,0.00021566467,0.00012137955,0.00010015117,0.00029278998,0.00011835315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013287821,0.0010097418,0.00057598966,0.0010486606,0.00045142183,0.0017497122,0.00075606996,0.00091836817,0.005736678],"category_scores_gemma":[0.0019482967,0.00026670357,0.0008022457,0.0005126191,0.00128962,0.0018795863,0.0011318043,0.0019275848,0.0009825502],"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.00012063732,0.000071907896,0.0010624344,0.00014806162,0.000036162528,0.0004273499,0.00021282841,0.032064896,0.009289303,0.91739655,0.0039369394,0.035232827],"study_design_scores_gemma":[0.000023943736,0.00017242877,0.0018502146,0.000096598036,0.00003238988,0.000998102,0.00024823315,0.44432673,0.005045715,0.51446885,0.032677997,0.00005876992],"about_ca_topic_score_codex":0.0009841082,"about_ca_topic_score_gemma":0.00042135973,"teacher_disagreement_score":0.005736678,"about_ca_system_score_codex":0.00070354156,"about_ca_system_score_gemma":0.0005416653,"threshold_uncertainty_score":0.019191086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20174122,0.0027234226,0.7398705,0.002399528,0.00019714977,0.000050710245,0.00021268646,0.00011854572,0.052686207],"genre_scores_gemma":[0.9485744,0.0011768299,0.044264935,0.00017955014,0.00020475646,0.00003641356,0.00008398807,0.000040162093,0.005438862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920887,0.0001739146,0.00004397107,0.00012672663,0.0003597695,0.0000868926],"domain_scores_gemma":[0.9979317,0.00084419455,0.00024185795,0.00014026876,0.0005935313,0.00024848594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016714424,0.00042705153,0.00057926186,0.0011773603,0.000598115,0.0022444467,0.00067216804,0.00078288425,0.0018193073],"category_scores_gemma":[0.0041014575,0.0002699716,0.00062404043,0.00070582685,0.004006147,0.0031972271,0.0022574659,0.002228868,0.0001603246],"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.000026162761,0.000014681788,0.00027950865,0.000041914886,0.000008943875,0.00015201318,0.00012233277,0.0053685517,0.003210713,0.98530304,0.00034421225,0.0051279506],"study_design_scores_gemma":[0.000016198972,0.000054445045,0.0009722939,0.000045446046,0.000012049792,0.00056373305,0.0001349915,0.097734354,0.0024455148,0.8939225,0.004075988,0.000022541064],"about_ca_topic_score_codex":0.00083244545,"about_ca_topic_score_gemma":0.0004520807,"teacher_disagreement_score":0.0022444467,"about_ca_system_score_codex":0.0010383748,"about_ca_system_score_gemma":0.0006186999,"threshold_uncertainty_score":0.008839548},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27556798,0.0040265047,0.5888319,0.014956856,0.0011764042,0.000035441626,0.000104723644,0.00019066819,0.11510948],"genre_scores_gemma":[0.9499726,0.0012918225,0.031767473,0.0015189111,0.00077771774,0.000029181492,0.00004309588,0.00008573827,0.014513366],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992818,0.0003297395,0.000020863545,0.00011284148,0.0001845944,0.000070132126],"domain_scores_gemma":[0.998288,0.0009908966,0.00020104845,0.00012960662,0.00021291444,0.00017758425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017042097,0.000509651,0.00037356408,0.00072750734,0.00095561077,0.0014856141,0.0005604527,0.0010481173,0.0040769936],"category_scores_gemma":[0.0049109156,0.000159035,0.00058187556,0.00062216556,0.0041087684,0.0042521553,0.0017402463,0.0020573167,0.0005179792],"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.0000070276874,0.0000051620636,0.000090893314,0.000010737876,0.0000020367281,0.000025027006,0.000066773435,0.00046293516,0.00029617667,0.99655676,0.0004413697,0.0020351664],"study_design_scores_gemma":[0.0000036880065,0.000013516335,0.00009480079,0.000008123993,0.0000030605045,0.0000739886,0.00005017552,0.008147181,0.0005115321,0.98734087,0.003746983,0.0000060760544],"about_ca_topic_score_codex":0.00039044843,"about_ca_topic_score_gemma":0.00023093459,"teacher_disagreement_score":0.0040769936,"about_ca_system_score_codex":0.0009975976,"about_ca_system_score_gemma":0.00043703165,"threshold_uncertainty_score":0.013638854},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003159971,0.0007597351,0.98776287,0.000099711266,0.000121828954,0.000012626142,0.00004584105,0.00047435355,0.0075629884],"genre_scores_gemma":[0.10810857,0.0016417181,0.8693428,0.0001328291,0.00025716732,0.00010485814,0.00033169184,0.0011963755,0.018884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993593,0.00014854637,0.000034663568,0.00020385213,0.0002126161,0.000041017523],"domain_scores_gemma":[0.9992828,0.00034272316,0.000036076828,0.00020283321,0.000100006815,0.000035547975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011468444,0.0012285028,0.0026091572,0.0018754712,0.000743496,0.0018166215,0.0018789172,0.0010188902,0.008311454],"category_scores_gemma":[0.0035408796,0.000907343,0.0013950918,0.002158834,0.0016409266,0.0036459889,0.0023612194,0.002515295,0.002508275],"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.000056770034,0.000030750718,0.00022476506,0.00020403843,0.00012012372,0.00004250642,0.00010428998,0.07321979,0.0038659382,0.59597,0.0088321855,0.31732884],"study_design_scores_gemma":[0.000010011691,0.000025518786,0.00015874855,0.000021145528,0.00003841755,0.000049215723,0.00001602658,0.21051253,0.002382215,0.77393335,0.012833395,0.00001940136],"about_ca_topic_score_codex":0.0015820942,"about_ca_topic_score_gemma":0.0022725686,"teacher_disagreement_score":0.008311454,"about_ca_system_score_codex":0.0009923478,"about_ca_system_score_gemma":0.00053534075,"threshold_uncertainty_score":0.027804554},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45363894,0.002781652,0.5021375,0.003772805,0.00020934346,0.00006306153,0.0002424643,0.00013170706,0.037022553],"genre_scores_gemma":[0.96868914,0.0010806383,0.023044504,0.00016375813,0.0001904854,0.0000721258,0.00012148483,0.00003199873,0.0066056927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996138,0.00014416898,0.000021713411,0.00007508633,0.00009003436,0.000055172484],"domain_scores_gemma":[0.99843436,0.0007591827,0.00033212558,0.000104297666,0.00021879196,0.00015130625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010771634,0.00043081428,0.00054044207,0.0011203251,0.00094873784,0.0015438631,0.0007214332,0.00096831954,0.0036061294],"category_scores_gemma":[0.0029097593,0.0002841471,0.0007951826,0.0006736638,0.00225103,0.0027119943,0.0015405919,0.0012067495,0.00025883008],"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.000019418314,0.000011145492,0.00038307355,0.000076876255,0.0000106662055,0.00015589021,0.00018403774,0.008188353,0.0023629745,0.9861135,0.00050116284,0.0019928662],"study_design_scores_gemma":[0.000013483828,0.00006694356,0.00085383124,0.00002281264,0.000011752854,0.00024613438,0.0002522266,0.07211486,0.0010071164,0.9228527,0.002538784,0.00001939506],"about_ca_topic_score_codex":0.0009666152,"about_ca_topic_score_gemma":0.00061651453,"teacher_disagreement_score":0.0036061294,"about_ca_system_score_codex":0.0008825201,"about_ca_system_score_gemma":0.0003848636,"threshold_uncertainty_score":0.012063742},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009854377,0.00046507872,0.98157597,0.00039968564,0.000091218484,0.000046509136,0.00010564226,0.000055074328,0.0074064936],"genre_scores_gemma":[0.47579867,0.00087044353,0.50071853,0.00035914205,0.00019613915,0.00048100195,0.00033598888,0.00022503469,0.021015026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909365,0.00033229258,0.00004229161,0.00017357114,0.00027990516,0.00007835493],"domain_scores_gemma":[0.99910647,0.00056595093,0.00010143774,0.0000486945,0.00011981205,0.000057570833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018830308,0.0013316814,0.0016376355,0.00094184076,0.0006176676,0.0020469401,0.0015629653,0.0024672553,0.0036735719],"category_scores_gemma":[0.0037398306,0.00080787105,0.0009832226,0.0014247843,0.00089505425,0.0018741747,0.002389185,0.0015829719,0.00044267165],"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.00007960848,0.00009347372,0.00035362772,0.00028572368,0.00012022012,0.00025180826,0.000065184075,0.794762,0.004688161,0.14792965,0.0027221867,0.04864839],"study_design_scores_gemma":[0.000017728062,0.000039791594,0.0001356932,0.000024439469,0.000020886886,0.000057782192,0.000014282441,0.9533873,0.0011169934,0.042869207,0.0023048406,0.000010971236],"about_ca_topic_score_codex":0.0013258304,"about_ca_topic_score_gemma":0.0011916301,"teacher_disagreement_score":0.0036735719,"about_ca_system_score_codex":0.000953639,"about_ca_system_score_gemma":0.0009829374,"threshold_uncertainty_score":0.012289345},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016152589,0.0018006862,0.8954615,0.0035543237,0.00039056863,0.00021117274,0.000550579,0.00027923012,0.08159943],"genre_scores_gemma":[0.6925084,0.0065445704,0.26499358,0.0015985989,0.0010053983,0.001267814,0.0017126468,0.00074941333,0.029619504],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997017,0.00086310995,0.00023441396,0.0004464786,0.0009690768,0.00046984307],"domain_scores_gemma":[0.99323785,0.0041022548,0.00059511507,0.00031930924,0.0014130074,0.00033239592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004040911,0.0018857815,0.001690693,0.0031898818,0.0015726307,0.0039522843,0.0016831469,0.00329065,0.020456832],"category_scores_gemma":[0.019761156,0.001354755,0.0024114763,0.0016463107,0.0038857074,0.005698967,0.003917463,0.004649078,0.0028668353],"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.000024329434,0.000031947457,0.00017045606,0.00018350055,0.000025684705,0.0001840965,0.0001409061,0.031977195,0.0009928587,0.9549619,0.004157073,0.0071499255],"study_design_scores_gemma":[0.000025003867,0.00003931759,0.00020388042,0.00014516876,0.000013378464,0.00012605889,0.00011086932,0.17153636,0.001001024,0.818515,0.008253407,0.000030583684],"about_ca_topic_score_codex":0.0023714143,"about_ca_topic_score_gemma":0.0020567225,"teacher_disagreement_score":0.020456832,"about_ca_system_score_codex":0.0020276902,"about_ca_system_score_gemma":0.003020435,"threshold_uncertainty_score":0.068434894},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4524687,0.0004603975,0.5264988,0.00049528864,0.000044571767,0.000072022194,0.00025935422,0.00017035034,0.019530702],"genre_scores_gemma":[0.9161021,0.0006115415,0.068608746,0.00014839316,0.000052639127,0.00007814164,0.00026436942,0.00006778783,0.014066247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998068,0.00004499816,0.000009946316,0.000046555888,0.000059521535,0.000032272106],"domain_scores_gemma":[0.9992569,0.0002737881,0.00012714129,0.00007032218,0.0001333089,0.00013861402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063678354,0.00042342354,0.00032941892,0.0013701721,0.00043393293,0.0009511871,0.00048309992,0.00033317457,0.0027146807],"category_scores_gemma":[0.002212783,0.00025990256,0.00052147324,0.0005048638,0.0012669071,0.0014879863,0.0011258074,0.0012040943,0.00032855355],"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.000019359499,0.0000102897175,0.0006304449,0.000024659608,0.000005591041,0.00007291921,0.00015653307,0.006681404,0.0027989564,0.9830161,0.00039029375,0.0061935633],"study_design_scores_gemma":[0.000017585395,0.00008418062,0.0017762872,0.000024966916,0.000014872982,0.00020731699,0.00018891483,0.11328705,0.004204065,0.873948,0.006226326,0.000020484647],"about_ca_topic_score_codex":0.0015026304,"about_ca_topic_score_gemma":0.001812714,"teacher_disagreement_score":0.0027146807,"about_ca_system_score_codex":0.0009702196,"about_ca_system_score_gemma":0.0004224068,"threshold_uncertainty_score":0.0090815425},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42232016,0.012814616,0.38845712,0.010457409,0.00096726784,0.00012615738,0.0003182877,0.00046454323,0.16407447],"genre_scores_gemma":[0.87562203,0.0018251798,0.09651892,0.00025541623,0.00016569305,0.000077855366,0.00014305883,0.000068493966,0.025323324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999856,0.000045161425,0.000007888353,0.000017319535,0.00004744328,0.000026191075],"domain_scores_gemma":[0.999627,0.00018072408,0.00003952362,0.000017592727,0.000063697276,0.00007138562],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041210747,0.0005737402,0.00037748623,0.00087198155,0.0009942084,0.00074792426,0.0007359196,0.0017559087,0.004171783],"category_scores_gemma":[0.0020917312,0.00028788947,0.00038944217,0.00052812765,0.0011400019,0.000854657,0.0009550214,0.0013623675,0.00027408884],"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.00030644695,0.00010119551,0.00068057247,0.0005010984,0.000037352143,0.001603537,0.00078547804,0.04476402,0.017391827,0.898382,0.010953652,0.024492813],"study_design_scores_gemma":[0.00009922566,0.00014656717,0.0013099968,0.000121778285,0.000019097914,0.0014481563,0.00047900784,0.26813126,0.0062595885,0.6949288,0.026993627,0.00006290947],"about_ca_topic_score_codex":0.00077944034,"about_ca_topic_score_gemma":0.0011406944,"teacher_disagreement_score":0.004171783,"about_ca_system_score_codex":0.00044997915,"about_ca_system_score_gemma":0.00026501014,"threshold_uncertainty_score":0.01395601},"labels":[],"label_agreement":null},{"id":"W2120001232","doi":"10.1007/s11228-009-0110-7","title":"An Answer to S. Simons’ Question on the Maximal Monotonicity of the Sum of a Maximal Monotone Linear Operator and a Normal Cone Operator","year":2009,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Mathematics; Monotonic function; Pseudo-monotone operator; Monotone polygon; Operator (biology); Discrete mathematics; Combinatorics; Finite-rank operator; Linear map; Pure mathematics; Banach space; Mathematical analysis","score_opus":0.01171228963208809,"score_gpt":0.2598769770426923,"score_spread":0.2481646874106042,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120001232","genre_codex":"commentary","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069302216,0.014812126,0.16006975,0.5587717,0.009978272,0.000048638907,0.0010657745,0.00040156767,0.18554987],"genre_scores_gemma":[0.77697426,0.009654681,0.06795003,0.05431384,0.016855998,0.00017024216,0.00085702015,0.00053741335,0.072686434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988186,0.0003895453,0.000066090055,0.00029361804,0.00028126052,0.00015092196],"domain_scores_gemma":[0.9939856,0.004049773,0.00028156512,0.00032963694,0.0010169726,0.00033646685],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032915806,0.000617013,0.0015074083,0.0010752508,0.0018647023,0.002091002,0.0011631764,0.005216267,0.011460874],"category_scores_gemma":[0.016272224,0.0003731096,0.0007329304,0.0012166342,0.004285263,0.010881691,0.0025979101,0.005245085,0.0016017365],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069538524,0.000020762378,0.00016950569,0.00010017693,0.000016115737,0.00007650018,0.00014602982,0.00049447495,0.0005221401,0.9534015,0.036418293,0.008564977],"study_design_scores_gemma":[0.000019577088,0.00000869183,0.00012447049,0.000018803757,0.0000052689165,0.00008234068,0.0000695057,0.0014257198,0.00023074061,0.9805524,0.017450087,0.000012549128],"about_ca_topic_score_codex":0.0008269811,"about_ca_topic_score_gemma":0.00059551944,"teacher_disagreement_score":0.011460874,"about_ca_system_score_codex":0.0010709863,"about_ca_system_score_gemma":0.00089426537,"threshold_uncertainty_score":0.03834045},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01961544,0.0012153578,0.9340419,0.0016698618,0.00020964333,0.00027133097,0.0007638247,0.00026417474,0.04194848],"genre_scores_gemma":[0.56109715,0.0046244008,0.41462752,0.000830495,0.00068805326,0.0022788919,0.0017686221,0.00071224413,0.013372583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99594766,0.0011584786,0.00032806877,0.00058587745,0.0013889696,0.00059097225],"domain_scores_gemma":[0.9911376,0.0054349643,0.0008539076,0.00033503457,0.0018441414,0.00039440312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049587735,0.0020446156,0.0021836534,0.0026177382,0.0016294522,0.0036454205,0.0016221281,0.002455678,0.014767629],"category_scores_gemma":[0.019889167,0.0016605392,0.002093381,0.0017781631,0.0037679384,0.0048653525,0.0032446247,0.005791001,0.0024259281],"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.00008756568,0.00012254347,0.0005639935,0.0005161182,0.00005787958,0.00037798836,0.00033305734,0.12058614,0.0032073383,0.85258704,0.0064336234,0.015126616],"study_design_scores_gemma":[0.00006570199,0.00011055459,0.00041293798,0.0002717738,0.000032885557,0.00016007917,0.00016640933,0.32118422,0.0028329662,0.66735774,0.0073514925,0.000053231408],"about_ca_topic_score_codex":0.0014311683,"about_ca_topic_score_gemma":0.0017899522,"teacher_disagreement_score":0.014767629,"about_ca_system_score_codex":0.0020059224,"about_ca_system_score_gemma":0.0036335692,"threshold_uncertainty_score":0.049402595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21646197,0.0065048123,0.6975901,0.0044796974,0.0004470598,0.00008139297,0.00022291223,0.00011098046,0.07410113],"genre_scores_gemma":[0.9248703,0.002561919,0.053021178,0.00065723894,0.00028997677,0.00013079628,0.00011143877,0.000054300304,0.018302761],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99920624,0.00022241815,0.00003661012,0.00018200789,0.00019690185,0.00015590455],"domain_scores_gemma":[0.9989231,0.0004894634,0.00010840745,0.00013226688,0.00020138118,0.00014543504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001983908,0.0007145372,0.0008600738,0.0014314374,0.0009832578,0.001507,0.0010828442,0.0012473352,0.003221556],"category_scores_gemma":[0.0044116946,0.0003997573,0.0010873097,0.00089042657,0.0025843643,0.004267057,0.0032519752,0.002598512,0.00032671628],"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.000021114132,0.000014965152,0.00017950658,0.00004615336,0.000011473546,0.00015239902,0.00011638506,0.005483993,0.0012459306,0.98397726,0.00084813486,0.007902565],"study_design_scores_gemma":[0.000013090612,0.000037550486,0.00033381395,0.000021463391,0.0000079906,0.00019530037,0.00006817891,0.01571748,0.00062206,0.9776188,0.005347718,0.00001650742],"about_ca_topic_score_codex":0.0010605822,"about_ca_topic_score_gemma":0.00063625036,"teacher_disagreement_score":0.003221556,"about_ca_system_score_codex":0.0013896716,"about_ca_system_score_gemma":0.0008187294,"threshold_uncertainty_score":0.010777116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6266813,0.0007529726,0.3491847,0.0008917896,0.00006356703,0.000029530196,0.00007679577,0.00008724753,0.02223215],"genre_scores_gemma":[0.9825065,0.00034020326,0.013298205,0.00003890536,0.000049116486,0.000037497073,0.00006652175,0.000016915608,0.003646164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955565,0.00015431034,0.00001729611,0.00005933623,0.00012574534,0.00008768733],"domain_scores_gemma":[0.9988373,0.000624058,0.0001350991,0.000055157445,0.00015769489,0.00019076606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009895811,0.00039406514,0.0005111829,0.000941716,0.0010074573,0.001165596,0.0004861678,0.00058602315,0.0015457894],"category_scores_gemma":[0.0034406828,0.0002493925,0.0005275063,0.0003951674,0.0026661493,0.002249392,0.002051421,0.0011800027,0.000089028785],"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.00006965053,0.000019654135,0.0007827044,0.000035722507,0.000024417408,0.0001964959,0.00033167555,0.010800681,0.0023932897,0.9794958,0.00045448437,0.005395473],"study_design_scores_gemma":[0.000017818262,0.000050574625,0.0008365563,0.000022585049,0.000010951506,0.0003115395,0.000309278,0.11816897,0.0019474238,0.87574685,0.0025576255,0.000019984778],"about_ca_topic_score_codex":0.0006474803,"about_ca_topic_score_gemma":0.0003373972,"teacher_disagreement_score":0.0015457894,"about_ca_system_score_codex":0.00054506,"about_ca_system_score_gemma":0.00045469133,"threshold_uncertainty_score":0.0052334666},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009222586,0.13396756,0.8402208,0.0023341177,0.00065284135,0.00003206666,0.0001724297,0.00037969445,0.021318149],"genre_scores_gemma":[0.06688674,0.3492979,0.5561443,0.001595282,0.0056776847,0.00025185023,0.0008620612,0.0006364181,0.018647766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99870276,0.00037482308,0.00013999866,0.00021800089,0.00049156457,0.00007281253],"domain_scores_gemma":[0.9990765,0.0005096351,0.00004388398,0.00010962414,0.00021445093,0.00004590168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001578643,0.0012292601,0.002310185,0.0022455202,0.00067031215,0.004150532,0.001429981,0.0017508793,0.0046503227],"category_scores_gemma":[0.0031235758,0.0011996763,0.0013407673,0.0051750513,0.0013286036,0.0045055836,0.0023013745,0.004243394,0.0029845198],"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.00005459095,0.00010365727,0.00040370077,0.0015996625,0.000120737845,0.000088871944,0.00008994828,0.038314592,0.0010959296,0.5517302,0.019520262,0.38687783],"study_design_scores_gemma":[0.000015079058,0.000054828808,0.00026092705,0.00036940846,0.000046969537,0.00024210392,0.0000423845,0.09333689,0.0006794911,0.7284936,0.17640905,0.000049273152],"about_ca_topic_score_codex":0.0011759446,"about_ca_topic_score_gemma":0.001225355,"teacher_disagreement_score":0.0046503227,"about_ca_system_score_codex":0.0009787934,"about_ca_system_score_gemma":0.0014536054,"threshold_uncertainty_score":0.015556872},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01731029,0.0003413209,0.97824794,0.0010231412,0.00006860819,0.00003677782,0.00016177597,0.0001182352,0.0026919267],"genre_scores_gemma":[0.33966646,0.0018233773,0.646001,0.00041993643,0.0002929392,0.00025353584,0.00068186346,0.00021955934,0.010641424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825865,0.0005326008,0.000078281904,0.00045470145,0.0005533278,0.00012235071],"domain_scores_gemma":[0.9937318,0.0047093057,0.0002530149,0.00051585026,0.0006366761,0.00015331371],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020614404,0.0007101788,0.0011737797,0.00063248014,0.00070563855,0.0017893534,0.0010356205,0.0015257675,0.0072135744],"category_scores_gemma":[0.017524805,0.00044034029,0.00097320526,0.0010802215,0.0016266435,0.0034632164,0.0019214819,0.0028391774,0.0009111593],"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.00036380783,0.00010344906,0.0031489404,0.0010747265,0.00015223701,0.0004042163,0.0008063059,0.28631195,0.024061969,0.39097372,0.006517505,0.28608114],"study_design_scores_gemma":[0.000034610715,0.00018209741,0.0013813585,0.00011961423,0.000039648283,0.0004571923,0.00040105887,0.80227137,0.009629757,0.17100611,0.014427241,0.000049957445],"about_ca_topic_score_codex":0.004749485,"about_ca_topic_score_gemma":0.0041574477,"teacher_disagreement_score":0.0072135744,"about_ca_system_score_codex":0.00082945917,"about_ca_system_score_gemma":0.0013572708,"threshold_uncertainty_score":0.024131775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010286308,0.00012249617,0.98730904,0.00006618548,0.000020191437,0.00002510283,0.000016173883,0.00006828272,0.0020862306],"genre_scores_gemma":[0.29010728,0.00036922688,0.70215297,0.00012740016,0.000071859205,0.00018460737,0.00009101119,0.00021054552,0.00668516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945825,0.00022023618,0.000021643715,0.00008628473,0.0001703901,0.00004320822],"domain_scores_gemma":[0.9984602,0.0008496782,0.00017046835,0.0001776742,0.00022998123,0.00011205504],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002082714,0.0008917272,0.00083023094,0.0011067948,0.00051690574,0.0008665064,0.0012602846,0.00095298496,0.0025379078],"category_scores_gemma":[0.0051115733,0.00051832054,0.0008671861,0.0004725343,0.0015929472,0.0014742012,0.0018874076,0.0018174136,0.00046443543],"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.00015024176,0.00011691805,0.0007936693,0.00025125872,0.00005657919,0.00010291624,0.00023861746,0.24708557,0.011321388,0.64048594,0.001855393,0.0975415],"study_design_scores_gemma":[0.000017504704,0.00007209135,0.000085359905,0.000014931742,0.000009679829,0.00005007547,0.000020855161,0.8995347,0.0029217596,0.095398664,0.0018599342,0.000014492726],"about_ca_topic_score_codex":0.00070418953,"about_ca_topic_score_gemma":0.0009544166,"teacher_disagreement_score":0.0025379078,"about_ca_system_score_codex":0.0009783035,"about_ca_system_score_gemma":0.0012779515,"threshold_uncertainty_score":0.011014581},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025224943,0.002392719,0.785515,0.0065019233,0.0021569773,0.00011111774,0.0010891882,0.0003877092,0.17662041],"genre_scores_gemma":[0.6716967,0.0062068896,0.19836186,0.0061363857,0.0034372243,0.0004948882,0.0014177002,0.00037335113,0.11187508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99692243,0.00046269473,0.00026076863,0.000649625,0.0013183975,0.00038602226],"domain_scores_gemma":[0.994922,0.0021940663,0.00045612786,0.0003905334,0.0015741123,0.00046321694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022695907,0.0008408104,0.00091549905,0.001970331,0.002013336,0.0033247545,0.0012319731,0.0023918129,0.011126142],"category_scores_gemma":[0.009101725,0.00039547827,0.0014486057,0.0018147875,0.0036297282,0.0072440235,0.004379321,0.004350975,0.003189924],"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.000029856163,0.00002278768,0.00026105772,0.00007483945,0.00001726211,0.00011115201,0.00005694354,0.001397308,0.0023173417,0.9793635,0.0040586535,0.012289358],"study_design_scores_gemma":[0.0000147765,0.000045764576,0.0006551176,0.00005031233,0.000024039908,0.0003870827,0.000047195506,0.016857883,0.00193281,0.9622837,0.017655045,0.000046296704],"about_ca_topic_score_codex":0.0013732328,"about_ca_topic_score_gemma":0.0014059539,"teacher_disagreement_score":0.011126142,"about_ca_system_score_codex":0.0021130273,"about_ca_system_score_gemma":0.002764179,"threshold_uncertainty_score":0.037220597},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027622369,0.000121010395,0.9954596,0.00013693965,0.000026768877,0.00003750744,0.000014292101,0.00005083,0.0013908567],"genre_scores_gemma":[0.10102161,0.00032131813,0.89296985,0.00013570802,0.000087037704,0.00047290922,0.00010335085,0.00016120475,0.0047269757],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977723,0.001471088,0.0000610286,0.00020774543,0.00038483556,0.00010309577],"domain_scores_gemma":[0.9976922,0.0015680064,0.00016460253,0.00021351816,0.00022907788,0.000132636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035303817,0.0014992537,0.0011934465,0.0008279024,0.0007995345,0.0013826216,0.0015839564,0.0016299,0.003795494],"category_scores_gemma":[0.0065823155,0.0009105986,0.001475681,0.0007006737,0.002369804,0.0021180382,0.003903952,0.003503537,0.00079814636],"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.00020605844,0.000074889576,0.0005218619,0.00045377386,0.0001475864,0.00033962342,0.0003954747,0.47160664,0.0065830974,0.42626184,0.003743824,0.08966528],"study_design_scores_gemma":[0.000028780943,0.00008484325,0.00005637126,0.00003102373,0.000011958376,0.00009189933,0.00002923917,0.92839706,0.0012620154,0.06649967,0.0034844396,0.000022691624],"about_ca_topic_score_codex":0.0010711643,"about_ca_topic_score_gemma":0.0011028191,"teacher_disagreement_score":0.003795494,"about_ca_system_score_codex":0.000656503,"about_ca_system_score_gemma":0.0014547533,"threshold_uncertainty_score":0.018670678},"labels":[],"label_agreement":null},{"id":"W2132628835","doi":"10.1007/s11228-013-0239-2","title":"Restricted Normal Cones and the Method of Alternating Projections: Theory","year":2013,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":68,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Canada Research Chairs; Deutsche Forschungsgemeinschaft; Pacific Institute for the Mathematical Sciences","keywords":"Underpinning; Constraint (computer-aided design); Convergence (economics); Cone (formal languages); Mathematics; Computer science; Calculus (dental); Mathematical optimization; Applied mathematics; Algorithm; Engineering; Geometry; Economics","score_opus":0.01273990833924538,"score_gpt":0.2688874153341057,"score_spread":0.25614750699486033,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132628835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036352167,0.0008572647,0.98643005,0.00046718077,0.0001286141,0.000026202353,0.00004881794,0.00006767676,0.008339028],"genre_scores_gemma":[0.24857698,0.0037579038,0.7134413,0.00061627326,0.0009734131,0.00047454753,0.00032105081,0.00061856257,0.031219985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978759,0.0012876234,0.00006394723,0.0002293483,0.00045544372,0.00008766421],"domain_scores_gemma":[0.99621934,0.0023431468,0.00022182117,0.00030099342,0.00058377645,0.00033082385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040327995,0.0013285411,0.001217967,0.0017140092,0.00094895123,0.0028225887,0.0024905743,0.0014805954,0.0053987466],"category_scores_gemma":[0.00933586,0.0010981482,0.0015256541,0.0013167872,0.0040511643,0.004740644,0.004019776,0.0051609105,0.00080452854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008828587,0.000011913892,0.000036895995,0.00003339174,0.000010014409,0.000009982875,0.000036456026,0.0040511005,0.00020364822,0.9892545,0.0007584308,0.0055847582],"study_design_scores_gemma":[0.000009652429,0.000016758016,0.00004596944,0.00002199311,0.000006655398,0.000039811355,0.000019156261,0.08865977,0.00017898162,0.9079159,0.0030717717,0.000013567225],"about_ca_topic_score_codex":0.0015378073,"about_ca_topic_score_gemma":0.0012442073,"teacher_disagreement_score":0.0053987466,"about_ca_system_score_codex":0.0012669397,"about_ca_system_score_gemma":0.001755943,"threshold_uncertainty_score":0.021327794},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14847341,0.0043964153,0.7746467,0.001774675,0.00019718365,0.00013621036,0.00029326527,0.00013525895,0.069946885],"genre_scores_gemma":[0.8552384,0.0045467974,0.11888718,0.000744439,0.0010782162,0.0002420767,0.0003665449,0.00012597302,0.018770427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851686,0.00034627333,0.000105598236,0.00043441454,0.00045278863,0.00014413265],"domain_scores_gemma":[0.99588287,0.002139581,0.00058158085,0.00029152667,0.0007136491,0.00039078348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030553509,0.00091849203,0.0007819948,0.002834753,0.00095824385,0.0022585434,0.0011634412,0.0014153644,0.0034210063],"category_scores_gemma":[0.00804788,0.00045222102,0.0014439753,0.0015143896,0.0035301112,0.0068619023,0.0032458138,0.0034425687,0.0004563979],"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.000008661946,0.000015842079,0.00019512432,0.000043283428,0.000006998447,0.00011107589,0.00022200595,0.0012537765,0.0015805583,0.99215204,0.0003050365,0.0041055423],"study_design_scores_gemma":[0.000009514548,0.000048800764,0.00031297206,0.000036935984,0.000008739338,0.00039576206,0.00012724815,0.028234106,0.0009914576,0.96409875,0.005715997,0.000019594212],"about_ca_topic_score_codex":0.00028104841,"about_ca_topic_score_gemma":0.00016561551,"teacher_disagreement_score":0.0034210063,"about_ca_system_score_codex":0.0010468394,"about_ca_system_score_gemma":0.0005063813,"threshold_uncertainty_score":0.016158402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06540858,0.0015113691,0.8557984,0.0047935573,0.0004903091,0.00084211706,0.0028715546,0.0006046543,0.06767945],"genre_scores_gemma":[0.6946191,0.0034026613,0.2753664,0.0012521751,0.0013000994,0.002839418,0.0032719672,0.0008366755,0.017111475],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9969131,0.0008950287,0.00029032538,0.0005206287,0.00071122294,0.0006697059],"domain_scores_gemma":[0.9781713,0.015510968,0.001654787,0.00056668505,0.003358991,0.0007373525],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051715984,0.002365486,0.003312884,0.003083947,0.0020328618,0.0041788276,0.0028200105,0.0034912974,0.020524573],"category_scores_gemma":[0.026838528,0.0027427606,0.0023681181,0.002293721,0.0038651938,0.007826472,0.003378458,0.007892336,0.0024074225],"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.0002143957,0.000333973,0.00056474865,0.00050333457,0.00007765216,0.00036216626,0.0003443739,0.046381116,0.0035178484,0.9290426,0.0070264167,0.011631313],"study_design_scores_gemma":[0.00019487363,0.00011084361,0.00063045253,0.0001750812,0.00006808588,0.00014738421,0.00022158123,0.17218523,0.0021960395,0.8181465,0.005862906,0.00006092357],"about_ca_topic_score_codex":0.0031241328,"about_ca_topic_score_gemma":0.0038035454,"teacher_disagreement_score":0.020524573,"about_ca_system_score_codex":0.002320571,"about_ca_system_score_gemma":0.0049690967,"threshold_uncertainty_score":0.06866151},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61711055,0.0006625603,0.3522237,0.002562707,0.0001353703,0.00018149478,0.0010290443,0.00036238544,0.025732268],"genre_scores_gemma":[0.9467945,0.00024929913,0.040368367,0.00023094034,0.000104652165,0.000331463,0.00052130554,0.0001319627,0.011267467],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996117,0.00013920302,0.000010798893,0.00009117934,0.000025977039,0.00012110327],"domain_scores_gemma":[0.9985555,0.0007568793,0.00009683851,0.00018747282,0.00009288591,0.00031046802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006877034,0.00078132586,0.0013789212,0.0006484694,0.0008454436,0.00162999,0.0013463681,0.0010921354,0.0106370635],"category_scores_gemma":[0.0034322029,0.000647328,0.00042982612,0.0005546668,0.0012782417,0.0017982962,0.0018580043,0.000946268,0.0015758504],"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.0047996985,0.0012450118,0.007983093,0.00055225095,0.00020651151,0.00036400004,0.0018384252,0.35013893,0.013655695,0.29651275,0.041285284,0.28141838],"study_design_scores_gemma":[0.00055164,0.00037471455,0.004359724,0.000078812984,0.000060407954,0.0000817984,0.0011509891,0.5486535,0.0021334747,0.43764833,0.00487379,0.000032871376],"about_ca_topic_score_codex":0.001568964,"about_ca_topic_score_gemma":0.0014633219,"teacher_disagreement_score":0.0106370635,"about_ca_system_score_codex":0.0006952838,"about_ca_system_score_gemma":0.0008642693,"threshold_uncertainty_score":0.03558457},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24607916,0.002368977,0.6537601,0.0031568424,0.0002296931,0.000081464226,0.00030321485,0.00021200294,0.093808606],"genre_scores_gemma":[0.86110866,0.0016870793,0.1189427,0.0008412773,0.00045706853,0.00018946547,0.0003002046,0.00020438584,0.01626918],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978599,0.0006646022,0.00012757927,0.00043958452,0.00070108776,0.00020717386],"domain_scores_gemma":[0.99445677,0.003339027,0.00038828835,0.0003242062,0.0010788435,0.00041299348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004326442,0.0006273046,0.0008718863,0.0014528641,0.0011177964,0.0018721411,0.00096984435,0.00070101506,0.00445642],"category_scores_gemma":[0.0090244915,0.00041840124,0.0012042032,0.0010027809,0.003557377,0.006669497,0.0030562705,0.0030560829,0.00055893575],"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.00006224525,0.0000228894,0.0006932585,0.00010768644,0.00002108359,0.00017165071,0.00028299366,0.002625939,0.0054025026,0.9719091,0.0012364769,0.017464006],"study_design_scores_gemma":[0.000018179853,0.00010233666,0.0012226696,0.000050309194,0.000029057279,0.0007061808,0.00020909852,0.07237099,0.0066367583,0.911081,0.007540538,0.000032915315],"about_ca_topic_score_codex":0.0007942458,"about_ca_topic_score_gemma":0.0006399494,"teacher_disagreement_score":0.00445642,"about_ca_system_score_codex":0.00096210896,"about_ca_system_score_gemma":0.0010096394,"threshold_uncertainty_score":0.022880733},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.890602,0.00025506548,0.09351365,0.00027625271,0.00006086411,0.00004790779,0.00014639775,0.000109248875,0.0149886],"genre_scores_gemma":[0.9872629,0.00009672102,0.008298116,0.000027554373,0.0000330655,0.00005024314,0.00012635642,0.000029170518,0.004075917],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995265,0.00008888021,0.000031231266,0.00009394321,0.00017087074,0.0000885717],"domain_scores_gemma":[0.9984725,0.00066511706,0.0002742762,0.00013118064,0.00021932283,0.00023758729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091204786,0.00030109767,0.0005152885,0.0010035607,0.00096775685,0.0015167168,0.00047114026,0.00050098135,0.0033539874],"category_scores_gemma":[0.001996594,0.00028624377,0.0007607979,0.00026336787,0.0019519764,0.0016651208,0.0020173534,0.0009162448,0.00022863482],"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.00020475192,0.000044628003,0.0011621069,0.00006012162,0.0000248791,0.0006152815,0.0012074161,0.0058266125,0.008422108,0.97704005,0.00045588773,0.004936103],"study_design_scores_gemma":[0.000114910195,0.00022560827,0.0019029917,0.00005013309,0.000028469352,0.0004242554,0.0009829231,0.079418704,0.010077085,0.9021162,0.0046120374,0.0000466687],"about_ca_topic_score_codex":0.0008242595,"about_ca_topic_score_gemma":0.0003537961,"teacher_disagreement_score":0.0033539874,"about_ca_system_score_codex":0.0006864713,"about_ca_system_score_gemma":0.00054076436,"threshold_uncertainty_score":0.011220217},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020008773,0.0012556382,0.94594955,0.0015519628,0.00026118648,0.00004539134,0.0001701798,0.00010516138,0.030652065],"genre_scores_gemma":[0.7846328,0.003212899,0.17696199,0.0007013525,0.0008241454,0.00029443388,0.0005355618,0.00020391047,0.0326329],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990226,0.0004437642,0.000044910415,0.00014715506,0.0002470398,0.000094570925],"domain_scores_gemma":[0.9986733,0.0007028543,0.00013996729,0.00009010213,0.0002819915,0.00011176995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018038839,0.00080191623,0.00073631835,0.002175585,0.00084014254,0.0019340651,0.0011473845,0.0010988215,0.0075387494],"category_scores_gemma":[0.004106408,0.00030706488,0.0014995314,0.0013046713,0.002793557,0.002180132,0.0021982735,0.0024184173,0.0005177201],"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.000004168891,0.00000236517,0.000046072535,0.000026513053,0.000008246544,0.0000289812,0.000032991902,0.009323903,0.0002968337,0.9866149,0.0004916571,0.0031234678],"study_design_scores_gemma":[0.0000069497446,0.000021635355,0.000076471806,0.000023392326,0.00000755173,0.00004312107,0.00005036112,0.117891796,0.00023397381,0.87552464,0.006112589,0.000007590727],"about_ca_topic_score_codex":0.003045458,"about_ca_topic_score_gemma":0.0018053907,"teacher_disagreement_score":0.0075387494,"about_ca_system_score_codex":0.0020608716,"about_ca_system_score_gemma":0.0008510647,"threshold_uncertainty_score":0.02521956},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1787419,0.00062113925,0.7114796,0.0039918832,0.0010149732,0.00011473277,0.0005195889,0.00044152484,0.10307462],"genre_scores_gemma":[0.8240342,0.00069233205,0.12600343,0.002149895,0.0009132074,0.00027193734,0.00044834628,0.0003403622,0.045146346],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99898976,0.00019448037,0.000046142857,0.0002530293,0.0002803208,0.00023629863],"domain_scores_gemma":[0.99801886,0.0007462588,0.00018740603,0.00022340607,0.00045081179,0.00037335334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015773936,0.00089955056,0.0010972086,0.0014345769,0.0019956136,0.0020527109,0.0013876508,0.0019971689,0.009915958],"category_scores_gemma":[0.00415698,0.00060608494,0.0009698749,0.0009413908,0.0036971923,0.0056146937,0.003293227,0.0034217623,0.0006969201],"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.000036621586,0.000017987799,0.00010637643,0.0000530418,0.000012846709,0.00007411103,0.00011089114,0.00030580582,0.002686654,0.99039406,0.0012015122,0.005000115],"study_design_scores_gemma":[0.000020240868,0.000043422882,0.00025721992,0.000015449925,0.000007104874,0.00039166375,0.00012870671,0.0060466817,0.0016030264,0.9876272,0.0038373386,0.000021900045],"about_ca_topic_score_codex":0.0005559839,"about_ca_topic_score_gemma":0.00046421503,"teacher_disagreement_score":0.009915958,"about_ca_system_score_codex":0.0007067601,"about_ca_system_score_gemma":0.0007882573,"threshold_uncertainty_score":0.03317213},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11962809,0.0070444294,0.8119898,0.00225851,0.00043579322,0.00005175283,0.00022918392,0.00020132233,0.05816111],"genre_scores_gemma":[0.85278136,0.006901783,0.11959263,0.00046276802,0.0007647654,0.0001308534,0.00033698248,0.00015066506,0.01887818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99907696,0.00028322497,0.000060645518,0.00013745732,0.00031740026,0.00012437126],"domain_scores_gemma":[0.9981831,0.00083987357,0.00023966044,0.00025403657,0.00032692656,0.00015652127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019796442,0.0010323082,0.00059821334,0.0023375333,0.00077074,0.0025003573,0.0007631519,0.0008490381,0.0018705336],"category_scores_gemma":[0.0052088173,0.00049971795,0.0010155641,0.0018967377,0.0044570463,0.0050174156,0.001992027,0.0031221167,0.0003550884],"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.00002243956,0.0000061719625,0.0001741113,0.000045733592,0.000010677526,0.00007316722,0.00011485533,0.0030186388,0.0013231498,0.98649013,0.000821513,0.007899427],"study_design_scores_gemma":[0.0000048899683,0.000027787966,0.00061737996,0.000024399948,0.0000095685255,0.00017375681,0.00008566499,0.01906643,0.0010524676,0.9733314,0.00558843,0.000017807548],"about_ca_topic_score_codex":0.0010135266,"about_ca_topic_score_gemma":0.0008423698,"teacher_disagreement_score":0.0025003573,"about_ca_system_score_codex":0.0011802196,"about_ca_system_score_gemma":0.00084099633,"threshold_uncertainty_score":0.010469496},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8049145,0.0017900371,0.17617251,0.0005322785,0.00005883069,0.000035958263,0.00023440825,0.00015174755,0.016109694],"genre_scores_gemma":[0.9798585,0.0006391539,0.01501734,0.000098791454,0.000028717837,0.00003199145,0.00019836881,0.000039634957,0.004087498],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992654,0.00010549674,0.00006626607,0.00017727498,0.00025338022,0.00013221345],"domain_scores_gemma":[0.99681,0.0010990878,0.0007080851,0.00043713854,0.0005772304,0.00036838392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014553255,0.0006676195,0.0011616008,0.0014184903,0.0010665973,0.00227774,0.00074603717,0.000775039,0.0016305161],"category_scores_gemma":[0.003905482,0.00054465747,0.0011135096,0.00118204,0.003317707,0.003669851,0.0026932354,0.0018402219,0.0002563914],"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.00018397716,0.000023385901,0.004555759,0.00023181428,0.00007853061,0.00049182185,0.0007173752,0.00492754,0.01706995,0.95449847,0.0006229743,0.016598457],"study_design_scores_gemma":[0.000036803624,0.0003490502,0.013015915,0.00008978236,0.000100995094,0.0024679182,0.0009201564,0.03340138,0.023772156,0.909423,0.016338153,0.00008471096],"about_ca_topic_score_codex":0.00045990723,"about_ca_topic_score_gemma":0.00059790927,"teacher_disagreement_score":0.00227774,"about_ca_system_score_codex":0.0008590324,"about_ca_system_score_gemma":0.00051181664,"threshold_uncertainty_score":0.007696569},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10821348,0.0010418957,0.8453724,0.0014507759,0.00019648857,0.0000774892,0.00022257683,0.00022734677,0.043197457],"genre_scores_gemma":[0.8137488,0.0014189539,0.14608963,0.00057226064,0.00047394997,0.00021398463,0.00035872476,0.00038070494,0.036743008],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988709,0.0004030289,0.000046343746,0.0001700498,0.00034952836,0.00016015368],"domain_scores_gemma":[0.99680626,0.00152821,0.0003279035,0.00016335546,0.00046449626,0.00070982275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029486835,0.0014491673,0.0012629757,0.0023750463,0.0016988121,0.0047756233,0.0015689521,0.0015312429,0.004960889],"category_scores_gemma":[0.0063800807,0.00083795784,0.0015559219,0.0012389106,0.0029446557,0.0066662314,0.0028484548,0.0048508067,0.0004389451],"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.000010184163,0.000009690847,0.000039576586,0.000013904113,0.000003906464,0.000027509308,0.000074349264,0.0007963932,0.00045070818,0.99698526,0.0003057208,0.0012827523],"study_design_scores_gemma":[0.000007443468,0.000013509779,0.00007654409,0.000010349795,0.000004979007,0.000061314226,0.00005240034,0.026751364,0.00030979817,0.97163254,0.0010687467,0.000010994083],"about_ca_topic_score_codex":0.001366015,"about_ca_topic_score_gemma":0.0014188754,"teacher_disagreement_score":0.004960889,"about_ca_system_score_codex":0.0024448608,"about_ca_system_score_gemma":0.0011506687,"threshold_uncertainty_score":0.01773882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13636963,0.0030910058,0.64255726,0.0074636093,0.000922692,0.00010604185,0.0005077612,0.00060776505,0.20837419],"genre_scores_gemma":[0.88025665,0.0028008034,0.07648004,0.0021695732,0.0011670265,0.00021113858,0.0004507805,0.00036983215,0.036094163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986999,0.0003514729,0.000086663014,0.00027069476,0.00041670946,0.00017454613],"domain_scores_gemma":[0.9963276,0.0018202469,0.0002261039,0.00060935965,0.0007772856,0.00023948016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025466126,0.00078177865,0.0005922754,0.0016872028,0.0010311253,0.0016988914,0.0011010079,0.0009462621,0.011666479],"category_scores_gemma":[0.006249711,0.0002961513,0.00087819307,0.00079057197,0.004324649,0.006322639,0.0021535892,0.0031848322,0.0010606459],"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.00003144008,0.00001527263,0.0004380091,0.00008097889,0.0000091359825,0.0002673467,0.00027725633,0.0019809136,0.0014610437,0.98643327,0.0014590046,0.007546206],"study_design_scores_gemma":[0.000011671808,0.000095027746,0.0010676612,0.00007714289,0.000015306248,0.0006941579,0.00032520492,0.009331697,0.0037663016,0.95503104,0.029554812,0.000029875839],"about_ca_topic_score_codex":0.00054601073,"about_ca_topic_score_gemma":0.0004583555,"teacher_disagreement_score":0.011666479,"about_ca_system_score_codex":0.00078985165,"about_ca_system_score_gemma":0.00049736234,"threshold_uncertainty_score":0.039028227},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017094124,0.00084851694,0.9276854,0.0012296187,0.00029836665,0.00018786924,0.00075461826,0.00018015987,0.051721405],"genre_scores_gemma":[0.5720803,0.004136856,0.36709678,0.0012186599,0.000988147,0.001523729,0.0024055622,0.0010903254,0.0494595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981668,0.0005582462,0.000110663284,0.00026748775,0.00059974357,0.00029705773],"domain_scores_gemma":[0.9908896,0.0061956765,0.00063666765,0.0002827995,0.0016249655,0.00037020532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038102835,0.0025317543,0.0017646645,0.0024007221,0.0012590734,0.0045840335,0.0017555701,0.0022282838,0.013489046],"category_scores_gemma":[0.011548935,0.0013710904,0.0015850858,0.0018483346,0.0029922428,0.0053084376,0.0019321404,0.007761954,0.0020480743],"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.00004680292,0.00010933373,0.00013822594,0.00023326553,0.00002064206,0.00011454317,0.00023349319,0.057913348,0.0020742565,0.92510074,0.0043901247,0.009625213],"study_design_scores_gemma":[0.000035178215,0.00007441805,0.00021912578,0.00012298116,0.000020847554,0.00009686996,0.0001130139,0.31528082,0.002108454,0.6760441,0.005840315,0.000043889984],"about_ca_topic_score_codex":0.003477462,"about_ca_topic_score_gemma":0.0041834894,"teacher_disagreement_score":0.013489046,"about_ca_system_score_codex":0.0026041833,"about_ca_system_score_gemma":0.0043320837,"threshold_uncertainty_score":0.045125306},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010834661,0.0024902793,0.9481102,0.009486483,0.00041570255,0.00003570506,0.00011318383,0.000111087415,0.028402682],"genre_scores_gemma":[0.41028687,0.005512849,0.5302586,0.0036540045,0.002522022,0.00023408655,0.00028184708,0.00035882575,0.04689093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990907,0.0003240219,0.000026688629,0.00025301048,0.00021957855,0.000086043656],"domain_scores_gemma":[0.9987043,0.00079910154,0.000087554596,0.00014459947,0.00016464324,0.00009975808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017347537,0.0006599995,0.0009409918,0.00076819083,0.000927975,0.0022938617,0.0015188298,0.002516057,0.010199914],"category_scores_gemma":[0.0045837094,0.00035685068,0.00091993314,0.0009648744,0.0024375536,0.00766775,0.0019364874,0.0055384915,0.0007231585],"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.000020661128,0.000033497712,0.00015100265,0.0000652375,0.000018077071,0.00006919552,0.000090327194,0.016912287,0.0004928568,0.9612669,0.0039087147,0.016971258],"study_design_scores_gemma":[0.000012826466,0.000020774427,0.0001014493,0.000032374035,0.000008022304,0.000100133504,0.000082237835,0.113864295,0.0003513145,0.8673052,0.01810954,0.000011900909],"about_ca_topic_score_codex":0.0018277132,"about_ca_topic_score_gemma":0.0017182335,"teacher_disagreement_score":0.010199914,"about_ca_system_score_codex":0.0012115141,"about_ca_system_score_gemma":0.0009917897,"threshold_uncertainty_score":0.03412211},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13283047,0.0030078262,0.84562904,0.0011944628,0.0002077187,0.00015995145,0.00013863003,0.00019927477,0.01663268],"genre_scores_gemma":[0.9516438,0.0010847035,0.043787677,0.00019768863,0.00011563926,0.00014929195,0.000084833424,0.00011632615,0.0028200978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9938024,0.0035393029,0.00023941601,0.00043916155,0.0016516068,0.00032806],"domain_scores_gemma":[0.96506983,0.03081037,0.0014168995,0.0008692795,0.0012871253,0.0005464601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011297519,0.0016662729,0.0022218693,0.004517583,0.0011410585,0.003031917,0.0014901274,0.0024830597,0.0016816187],"category_scores_gemma":[0.050795183,0.0018567364,0.0021706293,0.0022677255,0.0036516923,0.0034008618,0.0046457932,0.0024818776,0.00017365206],"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.00010548324,0.000053308562,0.0009930519,0.00013601594,0.0001653188,0.00016916628,0.00018677721,0.91139144,0.0018088485,0.071319595,0.0005310719,0.013139945],"study_design_scores_gemma":[0.000009280013,0.000051687744,0.00056913676,0.000040071063,0.000027430897,0.00006773691,0.00004154411,0.88572365,0.0006151092,0.11248691,0.00033747806,0.00003004105],"about_ca_topic_score_codex":0.0016907429,"about_ca_topic_score_gemma":0.00075652514,"teacher_disagreement_score":0.011297519,"about_ca_system_score_codex":0.0026408564,"about_ca_system_score_gemma":0.000982087,"threshold_uncertainty_score":0.059747756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05602274,0.0010302722,0.93256515,0.0009129333,0.00019703126,0.00009167088,0.000054327287,0.00017359781,0.008952218],"genre_scores_gemma":[0.73637134,0.0014245792,0.23436359,0.0005609937,0.000501192,0.0004468475,0.00022902408,0.00049236807,0.02561017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99656254,0.001813951,0.00019109552,0.0004937072,0.00064290885,0.00029565685],"domain_scores_gemma":[0.9665387,0.026733022,0.0014997156,0.001096925,0.0030972667,0.0010343217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008931356,0.0023943207,0.0016020293,0.0022483873,0.0011271439,0.003177192,0.002623157,0.0026695912,0.005242871],"category_scores_gemma":[0.041090146,0.0011841434,0.001754354,0.0012199519,0.0043427097,0.0056026676,0.005880659,0.004003068,0.00051492814],"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.0004265834,0.00018511438,0.0014178453,0.00046880587,0.00020917015,0.00022426179,0.0005631315,0.27653417,0.0056503774,0.6763849,0.0024715753,0.035464138],"study_design_scores_gemma":[0.000025558686,0.00009150657,0.00021541721,0.000030779014,0.00002319328,0.00007716053,0.000059999627,0.8169302,0.0014599514,0.18040955,0.0006539137,0.00002276849],"about_ca_topic_score_codex":0.0015921823,"about_ca_topic_score_gemma":0.0014860004,"teacher_disagreement_score":0.008931356,"about_ca_system_score_codex":0.0021727486,"about_ca_system_score_gemma":0.0024519723,"threshold_uncertainty_score":0.04723406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021654248,0.00067644747,0.9661746,0.00021979575,0.00015432254,0.00010493087,0.000026915237,0.00007958759,0.010909175],"genre_scores_gemma":[0.46103263,0.0015214616,0.5174537,0.00025370758,0.00018005553,0.000613082,0.000107678556,0.0001665023,0.018671162],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840444,0.00075266935,0.00011633798,0.00023611468,0.00041257235,0.00007801205],"domain_scores_gemma":[0.9984561,0.0008255464,0.00014673315,0.00010622448,0.00035401274,0.00011134926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033088874,0.0012365163,0.0008743031,0.000975166,0.00069295696,0.0011892351,0.0009959495,0.0011321143,0.0029348417],"category_scores_gemma":[0.0064291805,0.0003850996,0.0013494215,0.0005718455,0.002448973,0.002876906,0.001732802,0.0025301015,0.0005992614],"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.00009877486,0.00005542348,0.00039731595,0.00031618026,0.00006250261,0.0002710922,0.0006464006,0.03732867,0.010649678,0.91406476,0.0008484557,0.035260648],"study_design_scores_gemma":[0.000042580577,0.0005503842,0.00037485868,0.00012019954,0.000033535634,0.0008272693,0.00021919512,0.39820665,0.015088573,0.5709373,0.013515105,0.000084349755],"about_ca_topic_score_codex":0.00043851623,"about_ca_topic_score_gemma":0.0004155409,"teacher_disagreement_score":0.0033088874,"about_ca_system_score_codex":0.0011250247,"about_ca_system_score_gemma":0.0011356609,"threshold_uncertainty_score":0.017499328},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011399791,0.00018475358,0.9861714,0.00033055557,0.00011305485,0.000022611506,0.00004289065,0.000054996108,0.011939708],"genre_scores_gemma":[0.28140283,0.0029031397,0.6650851,0.0010740398,0.0014493337,0.0005939902,0.0002899342,0.00058543804,0.046616297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992078,0.00033890104,0.000031423893,0.000115054165,0.0002327707,0.0000740589],"domain_scores_gemma":[0.99890506,0.00060136337,0.00006674096,0.00011453582,0.00024972466,0.00006260377],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017907941,0.0012552405,0.0010707353,0.0015773614,0.00077543274,0.0019973456,0.0014054258,0.0013121077,0.008535962],"category_scores_gemma":[0.004061374,0.00058656855,0.0014357743,0.0010478481,0.0023612496,0.0023778523,0.003383653,0.0047910702,0.0013052586],"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.000010118087,0.000040883402,0.00008999329,0.00006589296,0.000014605186,0.00005349508,0.00005392694,0.03591908,0.001168985,0.9480862,0.001986187,0.012510619],"study_design_scores_gemma":[0.000008681917,0.000036249876,0.00012488132,0.000033660333,0.000010293998,0.00010777913,0.00002971381,0.33474797,0.0014946879,0.64691955,0.016464582,0.000021917615],"about_ca_topic_score_codex":0.00095015636,"about_ca_topic_score_gemma":0.000892471,"teacher_disagreement_score":0.008535962,"about_ca_system_score_codex":0.0013202897,"about_ca_system_score_gemma":0.0010725709,"threshold_uncertainty_score":0.028555632},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003532933,0.000041777264,0.9947062,0.00008380675,0.000023450437,0.000059250193,0.000013565601,0.000105152205,0.0014338186],"genre_scores_gemma":[0.046881013,0.00006723625,0.94996196,0.00006929949,0.000028012879,0.00015562821,0.000053142474,0.00007084362,0.0027127643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977093,0.0006384202,0.00017934803,0.00054467533,0.0007530604,0.00017513562],"domain_scores_gemma":[0.9982311,0.00089348544,0.000104679966,0.00022695516,0.0004025446,0.00014118158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034575185,0.0008897065,0.00096928177,0.0018756345,0.0011895733,0.0023855756,0.0020133646,0.001987675,0.005036142],"category_scores_gemma":[0.008221202,0.0006689015,0.0015922391,0.0014003264,0.002408206,0.0041543143,0.0047805803,0.0041277735,0.0012510349],"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.00013199008,0.00010039906,0.00033334974,0.00016277566,0.00005657344,0.00014152908,0.0004088129,0.019082645,0.010367566,0.7991813,0.0015849667,0.16844806],"study_design_scores_gemma":[0.000121479934,0.00021838212,0.00021888461,0.00006281768,0.000035279318,0.00043257707,0.00013977135,0.46702603,0.017030006,0.50106853,0.013567527,0.00007864449],"about_ca_topic_score_codex":0.00074508437,"about_ca_topic_score_gemma":0.00087547855,"teacher_disagreement_score":0.005036142,"about_ca_system_score_codex":0.0013310506,"about_ca_system_score_gemma":0.0018543272,"threshold_uncertainty_score":0.018285334},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.064813726,0.0016172617,0.9110317,0.0006733082,0.000110221365,0.000047447957,0.00017310877,0.00012728028,0.021405859],"genre_scores_gemma":[0.75227374,0.002012745,0.21841036,0.00029323148,0.00033912397,0.00024856476,0.00042397736,0.00018439029,0.02581379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973869,0.0011181408,0.000112267175,0.0005100796,0.0007187837,0.0001539547],"domain_scores_gemma":[0.9977483,0.0011477052,0.000286435,0.00017569604,0.00040555315,0.0002362315],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025771887,0.00089202763,0.00073246425,0.0016473164,0.00089155434,0.002533307,0.0009049299,0.00077867275,0.0041872375],"category_scores_gemma":[0.0052220896,0.00048215038,0.0009631458,0.0009914299,0.0037429444,0.0045479247,0.0037111046,0.0023528277,0.00070473325],"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.000017697583,0.0000059784415,0.00009408841,0.000045060624,0.000012546915,0.000048265418,0.00019193997,0.0074522253,0.00093220716,0.9870073,0.0002758861,0.0039166794],"study_design_scores_gemma":[0.00001103963,0.00008253172,0.00022148795,0.000035982583,0.000012608736,0.00012243794,0.00018067427,0.059004452,0.0011342318,0.9304521,0.008719598,0.000022916789],"about_ca_topic_score_codex":0.00078743964,"about_ca_topic_score_gemma":0.0005887112,"teacher_disagreement_score":0.0041872375,"about_ca_system_score_codex":0.0015448049,"about_ca_system_score_gemma":0.00058988616,"threshold_uncertainty_score":0.014007688},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07804272,0.0013693395,0.8643325,0.0028090363,0.00015615375,0.0000748242,0.00053263275,0.00025694232,0.052425962],"genre_scores_gemma":[0.85731685,0.0018686131,0.09851426,0.0006617991,0.00031226093,0.0003118425,0.00058250123,0.00054438756,0.039887633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992705,0.00029776958,0.000040813564,0.00019128995,0.00011062001,0.00008893494],"domain_scores_gemma":[0.9965262,0.0023543113,0.00029962356,0.00026415903,0.00037772907,0.00017800645],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003998466,0.0010617195,0.0015356219,0.0011544434,0.00081188837,0.0024708654,0.0020916497,0.0016655695,0.0052891606],"category_scores_gemma":[0.014050008,0.00084123394,0.0014748655,0.0012715408,0.0025814443,0.0050595882,0.0030808395,0.004772685,0.00061269186],"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.0001303073,0.00003180586,0.00027018122,0.00014941285,0.000031675456,0.0000787337,0.00026504643,0.03505246,0.0024223565,0.9457087,0.002439449,0.013420051],"study_design_scores_gemma":[0.000018356492,0.00005368388,0.00026899835,0.00003749584,0.000016640646,0.00008441771,0.00007489344,0.18578313,0.00072075444,0.81117725,0.0017474026,0.000017016026],"about_ca_topic_score_codex":0.0014814762,"about_ca_topic_score_gemma":0.00071827444,"teacher_disagreement_score":0.0052891606,"about_ca_system_score_codex":0.0018427172,"about_ca_system_score_gemma":0.0011783656,"threshold_uncertainty_score":0.021146178},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20530504,0.00636215,0.7189598,0.002777661,0.00040039132,0.00011406821,0.00017792745,0.00013244389,0.065770544],"genre_scores_gemma":[0.8287209,0.004776075,0.14970636,0.0004910521,0.0006111041,0.00023558598,0.00024110722,0.000087183034,0.015130525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896777,0.00046423599,0.000061844556,0.00012942305,0.0002761141,0.00010059004],"domain_scores_gemma":[0.9965153,0.0024106272,0.00023737564,0.00017768968,0.0004885542,0.0001703784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033994608,0.0011042068,0.00082341913,0.001764815,0.0010662631,0.001243673,0.0006765385,0.0016348338,0.0032730242],"category_scores_gemma":[0.009693359,0.00039480795,0.00069495494,0.000944404,0.002897774,0.0040426943,0.0015044571,0.0023658562,0.00042254335],"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.000034712975,0.00002641106,0.00028120476,0.00008675071,0.000009987178,0.0002865364,0.00030362397,0.011843082,0.004113732,0.9719819,0.0006233965,0.010408715],"study_design_scores_gemma":[0.000019118379,0.00009203071,0.0006418248,0.00007811611,0.000007476947,0.00046162846,0.000174948,0.0767468,0.0016831389,0.91427296,0.0057926225,0.000029413492],"about_ca_topic_score_codex":0.0008369568,"about_ca_topic_score_gemma":0.0006552912,"teacher_disagreement_score":0.0033994608,"about_ca_system_score_codex":0.0008564126,"about_ca_system_score_gemma":0.0006559854,"threshold_uncertainty_score":0.01797831},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39133668,0.0028516161,0.58269364,0.00093571935,0.00008320631,0.00009922846,0.00067017326,0.00015997709,0.021169744],"genre_scores_gemma":[0.9302982,0.0016282634,0.062882684,0.00019723317,0.00021350328,0.00013541851,0.00046430607,0.00010621054,0.0040741954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998689,0.00031423863,0.00010040902,0.0003481381,0.0004143439,0.00013402745],"domain_scores_gemma":[0.99056995,0.005730989,0.0013036374,0.0009482912,0.0006307301,0.000816417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026135498,0.0007517257,0.0012542749,0.0021844287,0.0007261172,0.003907419,0.0010517937,0.00089901296,0.0021120543],"category_scores_gemma":[0.016287137,0.0009157451,0.00085543306,0.0013795294,0.0036256863,0.0054456713,0.002494939,0.002920638,0.00024241352],"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.00012852122,0.000047120968,0.0032969057,0.00020161364,0.000051969924,0.00021304823,0.00059358735,0.01669814,0.005282878,0.94849443,0.00090054714,0.024091257],"study_design_scores_gemma":[0.0000181624,0.00007617469,0.0032080228,0.00007252465,0.000030519706,0.00036626743,0.00034664673,0.059348777,0.0025212858,0.93080187,0.0031760822,0.000033661352],"about_ca_topic_score_codex":0.00037474593,"about_ca_topic_score_gemma":0.00030743663,"teacher_disagreement_score":0.003907419,"about_ca_system_score_codex":0.00078513264,"about_ca_system_score_gemma":0.00032991424,"threshold_uncertainty_score":0.0138219},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029015583,0.0003246972,0.99390763,0.00013401017,0.000070485046,0.000017987737,0.000027614582,0.000051698793,0.0025643383],"genre_scores_gemma":[0.31530958,0.0019796889,0.6538924,0.00033419137,0.00047043303,0.0004223809,0.00036183945,0.0005918387,0.026637662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990606,0.0005174261,0.000038280206,0.00009877807,0.0002212618,0.00006377051],"domain_scores_gemma":[0.99748164,0.0015389058,0.00010960582,0.00017043209,0.0005135111,0.0001858557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002815068,0.0015354602,0.0013892408,0.0008705511,0.0005553,0.0018937306,0.0014742827,0.0010566732,0.0035545118],"category_scores_gemma":[0.0065418645,0.00067881256,0.0011633553,0.00088884734,0.002195512,0.0022596172,0.0035984002,0.004129895,0.00062470214],"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.0001496189,0.00015889466,0.00049542176,0.00047647653,0.00013995993,0.0001022935,0.00037948645,0.2584654,0.0040876684,0.644117,0.003926601,0.08750125],"study_design_scores_gemma":[0.00000870324,0.000040104987,0.000064912885,0.000027301538,0.000017394907,0.000021113337,0.000027729384,0.8778135,0.0005978904,0.119011514,0.0023597316,0.000010137093],"about_ca_topic_score_codex":0.0028677653,"about_ca_topic_score_gemma":0.0022752276,"teacher_disagreement_score":0.0035545118,"about_ca_system_score_codex":0.0010538218,"about_ca_system_score_gemma":0.0016037342,"threshold_uncertainty_score":0.014887691},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015429601,0.00042058338,0.9793936,0.0005681578,0.000043893095,0.000048425725,0.00004311742,0.000045401433,0.0040072897],"genre_scores_gemma":[0.5272876,0.0021105835,0.4528218,0.0005676486,0.00031952735,0.0005414178,0.00037504887,0.0003744065,0.01560196],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981483,0.0009855536,0.00006359202,0.00024074361,0.0004271352,0.00013469598],"domain_scores_gemma":[0.99220335,0.005838123,0.00051518553,0.00033517275,0.0007427259,0.0003654075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052321213,0.0012814691,0.0013739531,0.0011248785,0.0008316883,0.0020188342,0.0011017743,0.0024732125,0.005390598],"category_scores_gemma":[0.019432308,0.0007136845,0.0011346153,0.0010005058,0.0034442458,0.003005563,0.003922054,0.0031436651,0.0007308209],"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.00030976447,0.00009559409,0.0012325487,0.0006013015,0.00008984534,0.0006218404,0.00038248944,0.45880523,0.004160598,0.5007553,0.0032861587,0.029659312],"study_design_scores_gemma":[0.000022775028,0.000114426315,0.00020638343,0.000054776043,0.000016611477,0.00016891916,0.00009332117,0.8481487,0.0010993489,0.14794612,0.002111056,0.000017573719],"about_ca_topic_score_codex":0.0009012497,"about_ca_topic_score_gemma":0.00050251844,"teacher_disagreement_score":0.005390598,"about_ca_system_score_codex":0.000756877,"about_ca_system_score_gemma":0.0011215471,"threshold_uncertainty_score":0.027670443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12945117,0.014724693,0.7466871,0.018751191,0.0021776466,0.00013872418,0.00045312766,0.0004981779,0.08711812],"genre_scores_gemma":[0.8452331,0.014914383,0.077484444,0.0047550206,0.004481175,0.00031490045,0.00063299254,0.0010176207,0.051166333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979202,0.0009535764,0.000109881395,0.0003968655,0.00038928556,0.00023023508],"domain_scores_gemma":[0.97846687,0.016705917,0.0009341007,0.0009334017,0.0019905677,0.00096906547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006654537,0.002175079,0.0030729512,0.0045467615,0.002343072,0.0045162044,0.0027624601,0.0043989033,0.0075955684],"category_scores_gemma":[0.047239613,0.00090086414,0.003431115,0.0030990543,0.007633008,0.012051037,0.0072311405,0.008709461,0.0009226302],"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.00013199382,0.000054417545,0.0006930262,0.00040916982,0.00006517892,0.0004196535,0.00070011086,0.0126649,0.0029993388,0.9696779,0.0037880496,0.008396281],"study_design_scores_gemma":[0.00002156384,0.000076591954,0.000779385,0.00008694821,0.000057994555,0.0002890178,0.00019472641,0.062204145,0.0007637281,0.9305206,0.0049628466,0.000042459393],"about_ca_topic_score_codex":0.002410911,"about_ca_topic_score_gemma":0.0009931439,"teacher_disagreement_score":0.0075955684,"about_ca_system_score_codex":0.0022286493,"about_ca_system_score_gemma":0.0012755266,"threshold_uncertainty_score":0.035192966},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039907828,0.024015576,0.6720459,0.0041497266,0.00063281896,0.000104592385,0.00045563205,0.0003761968,0.25831172],"genre_scores_gemma":[0.7304997,0.018899316,0.186448,0.0011472676,0.0020661396,0.0006375831,0.0010581772,0.00048121234,0.05876267],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822193,0.0005608268,0.00011544808,0.00032287283,0.0006412605,0.0001376355],"domain_scores_gemma":[0.99608743,0.002554005,0.00020171815,0.00019398528,0.0007045552,0.00025832496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002987163,0.0009988472,0.0011826606,0.0045390176,0.0021529172,0.004507933,0.0017266464,0.001235771,0.012438549],"category_scores_gemma":[0.007399168,0.0006895294,0.0016007457,0.003125854,0.0042652725,0.006741802,0.0059993314,0.005334252,0.0014119846],"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.000004543486,0.000005182335,0.00004571513,0.000036253703,0.0000061277274,0.000026247586,0.00007379444,0.00059034885,0.00012281991,0.99461764,0.0007351422,0.0037361828],"study_design_scores_gemma":[0.0000067080955,0.000008951444,0.00009154756,0.000038941864,0.00000694783,0.00009573756,0.000104342114,0.0091308355,0.00031640692,0.97923946,0.010952045,0.0000079896],"about_ca_topic_score_codex":0.0012671708,"about_ca_topic_score_gemma":0.00064669095,"teacher_disagreement_score":0.012438549,"about_ca_system_score_codex":0.0026334992,"about_ca_system_score_gemma":0.00093739724,"threshold_uncertainty_score":0.041611075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32032356,0.0012123311,0.6517212,0.0015470951,0.0001468823,0.000084479354,0.00009186533,0.00021551132,0.024657188],"genre_scores_gemma":[0.87565356,0.00081778,0.11353859,0.00044137848,0.0001743951,0.00013075348,0.0001289362,0.00016468792,0.008949881],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975925,0.0010494565,0.00010578015,0.000364173,0.000615314,0.0002727514],"domain_scores_gemma":[0.98846626,0.008173169,0.00086379563,0.0007616179,0.00095418486,0.00078093534],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076052863,0.0009392756,0.001355181,0.0019505834,0.0016162683,0.0017726894,0.0012278705,0.0021817312,0.002526649],"category_scores_gemma":[0.025073707,0.0006219518,0.0011039958,0.00078065833,0.006618543,0.0043661757,0.0041408446,0.003271948,0.00046632346],"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.000060640843,0.000026544549,0.0006310038,0.000068271416,0.000016647868,0.00016819652,0.0002932471,0.009574397,0.0024886362,0.98162377,0.0005739624,0.004474648],"study_design_scores_gemma":[0.000019632014,0.00006664348,0.00026183407,0.000035765464,0.000007877787,0.00016857979,0.00014062578,0.09731525,0.0013819449,0.8994903,0.0010873674,0.000024020957],"about_ca_topic_score_codex":0.0009758459,"about_ca_topic_score_gemma":0.0005500475,"teacher_disagreement_score":0.0076052863,"about_ca_system_score_codex":0.0009355632,"about_ca_system_score_gemma":0.0011627747,"threshold_uncertainty_score":0.040221095},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028015465,0.00086358574,0.95485604,0.0008008581,0.000044785298,0.000035564033,0.000080343765,0.000052123367,0.015251191],"genre_scores_gemma":[0.8141357,0.002381842,0.16938294,0.0003264099,0.00027350758,0.00043779082,0.0002390886,0.00016672905,0.012656021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995578,0.00018656733,0.000015822508,0.000080666054,0.00011221214,0.00004686387],"domain_scores_gemma":[0.9986461,0.000989087,0.00011706471,0.000050183564,0.00013122521,0.00006640765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015183259,0.0009286471,0.0009259158,0.0008043552,0.00061414496,0.0012086643,0.0010190061,0.0010734372,0.003190332],"category_scores_gemma":[0.002672978,0.00046841605,0.00094713975,0.0006930722,0.002339932,0.0018955655,0.0020530734,0.0022207808,0.00033225058],"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.000027950566,0.00002908551,0.00021320923,0.00010393397,0.000031131967,0.00009351475,0.000121767494,0.16192184,0.0022720369,0.8238636,0.00096269074,0.010359317],"study_design_scores_gemma":[0.00000844748,0.000042781892,0.00018959172,0.000023123757,0.0000062881136,0.00003887905,0.000036959023,0.4636758,0.0002876367,0.5343858,0.0012919739,0.000012739996],"about_ca_topic_score_codex":0.0011642078,"about_ca_topic_score_gemma":0.00069510494,"teacher_disagreement_score":0.003190332,"about_ca_system_score_codex":0.0008573405,"about_ca_system_score_gemma":0.0007798397,"threshold_uncertainty_score":0.010672748},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016792668,0.0020055668,0.9701351,0.00074832316,0.00009399597,0.00006894537,0.000114722316,0.0000814499,0.009959253],"genre_scores_gemma":[0.67273283,0.010088874,0.29181802,0.0011884851,0.00052233355,0.0013496729,0.0010375209,0.00060921843,0.020652946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974509,0.0012039075,0.00018442232,0.00033698248,0.0006306593,0.00019310342],"domain_scores_gemma":[0.9911164,0.0060647028,0.00052913727,0.0004781396,0.0015550978,0.00025647186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072821216,0.0022445815,0.0019603923,0.0025590323,0.0012487973,0.002578926,0.001892386,0.0018368572,0.003429262],"category_scores_gemma":[0.021515565,0.0007563337,0.0023431904,0.0019580706,0.003310559,0.004560337,0.003706638,0.0048244623,0.0004981423],"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.000093991046,0.00007806085,0.00089686754,0.00057275995,0.00011591952,0.00029111683,0.00043987078,0.22678126,0.006043669,0.73631465,0.002608416,0.025763422],"study_design_scores_gemma":[0.000009789022,0.00007929544,0.000344021,0.00009559002,0.000023366569,0.00011459954,0.00007997522,0.75029474,0.0015640658,0.24462599,0.0027429014,0.000025664916],"about_ca_topic_score_codex":0.002461728,"about_ca_topic_score_gemma":0.0013224183,"teacher_disagreement_score":0.0072821216,"about_ca_system_score_codex":0.0020726605,"about_ca_system_score_gemma":0.0019134487,"threshold_uncertainty_score":0.03851199},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16776857,0.00091435015,0.80920863,0.0012330422,0.0001163863,0.00014658953,0.00031577604,0.00020281471,0.020093892],"genre_scores_gemma":[0.5868878,0.001119256,0.39335737,0.00031958762,0.0001731862,0.00039489253,0.0006976096,0.00025826553,0.016792146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986972,0.0005939311,0.000057351983,0.00022974577,0.00033548084,0.00008621252],"domain_scores_gemma":[0.9973387,0.0013446055,0.0002948393,0.00023482348,0.00057353143,0.0002134875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002340727,0.0006289953,0.00083470525,0.001099454,0.0007807286,0.0014575718,0.0012845123,0.0013318539,0.0036903329],"category_scores_gemma":[0.008362379,0.000419897,0.00029905757,0.00086418114,0.0029288644,0.0028622632,0.0032474943,0.0007942985,0.0010023434],"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.0005286398,0.00007356738,0.003552493,0.0004959493,0.000056137585,0.0004402159,0.0005549343,0.1280533,0.020363081,0.7695657,0.0071453927,0.06917044],"study_design_scores_gemma":[0.00007956141,0.0005113871,0.0029080343,0.00013647937,0.000021612652,0.0008170766,0.001240825,0.53567344,0.025811682,0.41692236,0.015760694,0.00011682676],"about_ca_topic_score_codex":0.001291286,"about_ca_topic_score_gemma":0.0014126323,"teacher_disagreement_score":0.0036903329,"about_ca_system_score_codex":0.0011888676,"about_ca_system_score_gemma":0.0007641205,"threshold_uncertainty_score":0.01237911},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09374019,0.001037355,0.89074206,0.00067525957,0.00013276712,0.000045172725,0.00010185405,0.00009467495,0.013430703],"genre_scores_gemma":[0.9512573,0.00073116034,0.03952377,0.00005953167,0.000079762365,0.00012415656,0.00012962536,0.00005740314,0.008037365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971086,0.00009954998,0.000012531428,0.000062487845,0.000063728454,0.000050778814],"domain_scores_gemma":[0.9996008,0.00016982421,0.000085565465,0.00002715309,0.00006848013,0.000048130027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064687897,0.0010414554,0.00084545126,0.0006992732,0.00055276597,0.0010808696,0.0006531355,0.0007773048,0.0015497508],"category_scores_gemma":[0.0016768984,0.00032122302,0.0004955159,0.0004596094,0.0016268975,0.001222174,0.0019904037,0.000796788,0.00015702908],"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.000048064587,0.00003988884,0.00035060127,0.0001278029,0.000033629614,0.0001304147,0.00014358007,0.5332376,0.0048861275,0.4364388,0.0013073605,0.02325613],"study_design_scores_gemma":[0.0000063558778,0.000029702014,0.00011811621,0.00001237771,0.0000054682932,0.00002256324,0.000030984185,0.9003634,0.0007091702,0.0972505,0.0014429956,0.000008433961],"about_ca_topic_score_codex":0.0023058283,"about_ca_topic_score_gemma":0.0016270045,"teacher_disagreement_score":0.0023058283,"about_ca_system_score_codex":0.0011771797,"about_ca_system_score_gemma":0.0009139164,"threshold_uncertainty_score":0.008541048},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03146424,0.0010262852,0.9501447,0.0009495638,0.000048707512,0.000035785637,0.00008078195,0.00005136822,0.016198566],"genre_scores_gemma":[0.82789475,0.0025150324,0.15512532,0.00033566702,0.0002874553,0.0004260317,0.00022444323,0.00015580154,0.013035447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955064,0.00019814592,0.000015305055,0.00008186774,0.00010750746,0.000046628287],"domain_scores_gemma":[0.99864966,0.0010023263,0.00011325217,0.000047707894,0.000121878555,0.000065220156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015711654,0.0009713544,0.00094855303,0.0008182626,0.000630802,0.0011850151,0.0009938523,0.0010790295,0.0029529445],"category_scores_gemma":[0.002699272,0.00047776275,0.00094568345,0.0006806056,0.0025587755,0.0018226772,0.0020087527,0.0022541303,0.0003092622],"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.000024845147,0.000026373624,0.00020876517,0.00009352437,0.00003073891,0.00008382983,0.000121482946,0.15504576,0.0019177424,0.8323231,0.0009115637,0.009212298],"study_design_scores_gemma":[0.0000083136,0.00004230321,0.00020491281,0.000024136169,0.000006161056,0.000037183218,0.00003860445,0.45115516,0.00026189408,0.5468891,0.0013195677,0.000012661828],"about_ca_topic_score_codex":0.0012997425,"about_ca_topic_score_gemma":0.0007736436,"teacher_disagreement_score":0.0029529445,"about_ca_system_score_codex":0.00091812626,"about_ca_system_score_gemma":0.000809401,"threshold_uncertainty_score":0.009878576},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.071151055,0.011120491,0.22497837,0.0073381416,0.0015719068,0.00016909711,0.0014008749,0.00028615346,0.681984],"genre_scores_gemma":[0.777949,0.009254561,0.067412436,0.0024289466,0.002181231,0.00028095575,0.0017148938,0.0003513354,0.13842665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986687,0.00026162204,0.00007172329,0.00027819234,0.00054618996,0.00017368817],"domain_scores_gemma":[0.9979468,0.0005515767,0.00016683366,0.00014234034,0.0009458245,0.0002467107],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012927356,0.00084142725,0.0007415504,0.0021153651,0.0022703367,0.0030871914,0.0007786623,0.0009807621,0.010921241],"category_scores_gemma":[0.00395608,0.0003364455,0.0011383416,0.0013617948,0.0036671234,0.0035942104,0.0017162771,0.00347956,0.0019972478],"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.0000070946444,0.0000042146607,0.000076234035,0.000023175066,0.000003701633,0.000042932425,0.00008181043,0.00045136426,0.00016793967,0.99177176,0.003945866,0.0034238496],"study_design_scores_gemma":[0.000009565133,0.000023564597,0.00044400926,0.000054036132,0.0000072177672,0.00023972364,0.00014247328,0.00472387,0.00038144353,0.92465705,0.069301024,0.000016016918],"about_ca_topic_score_codex":0.004128146,"about_ca_topic_score_gemma":0.0021082738,"teacher_disagreement_score":0.010921241,"about_ca_system_score_codex":0.0021317767,"about_ca_system_score_gemma":0.0014260162,"threshold_uncertainty_score":0.036535203},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009621835,0.00005150145,0.9895738,0.000047284102,0.000013938923,0.00003900501,0.000007335195,0.000051487605,0.0005937883],"genre_scores_gemma":[0.20725113,0.00010436494,0.78975445,0.00007385058,0.000018837978,0.00035281418,0.000066787514,0.00004999106,0.0023278822],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994406,0.0001845169,0.000042433785,0.00008481776,0.00018810718,0.00005947443],"domain_scores_gemma":[0.9991467,0.00046103718,0.00007093704,0.00006954363,0.0001867572,0.00006490282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017667977,0.0005579043,0.0007839219,0.00039978817,0.0004500229,0.000575252,0.0013560621,0.0014379512,0.0016512807],"category_scores_gemma":[0.002341853,0.0003868179,0.0008703782,0.00025308374,0.00077576307,0.00090920756,0.0018779517,0.0013325436,0.00026251125],"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.00027001917,0.00018458984,0.0019418016,0.00034891863,0.00014437587,0.00037910248,0.00070442044,0.7357106,0.031152718,0.12662669,0.001098853,0.10143791],"study_design_scores_gemma":[0.000015510179,0.000051678555,0.00004847335,0.000006578486,0.0000048612906,0.000033450106,0.000010702434,0.99269366,0.0018081861,0.0047189244,0.0005993597,0.000008576985],"about_ca_topic_score_codex":0.002259772,"about_ca_topic_score_gemma":0.0022038596,"teacher_disagreement_score":0.002259772,"about_ca_system_score_codex":0.0006736526,"about_ca_system_score_gemma":0.0015257617,"threshold_uncertainty_score":0.0093438625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.066834055,0.0007596722,0.9240839,0.00029893292,0.00011344094,0.000089107234,0.000024112349,0.000070887836,0.0077259406],"genre_scores_gemma":[0.675953,0.0012030527,0.30167598,0.00014454569,0.000128153,0.00044905138,0.00012391234,0.00010973377,0.020212656],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831116,0.00065074523,0.00011143901,0.0001985668,0.0006330968,0.00009499315],"domain_scores_gemma":[0.9959202,0.0020137301,0.00044406886,0.00021724509,0.0011297846,0.00027499936],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047730175,0.0011366815,0.00097362907,0.001276429,0.0007626445,0.0019727375,0.0012886102,0.0014791123,0.0025552937],"category_scores_gemma":[0.015521788,0.00048561225,0.0010449124,0.0008020099,0.0027956367,0.0023429238,0.002392672,0.0020974542,0.00045815084],"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.0003891225,0.000060810602,0.0014657537,0.00030042243,0.000081320664,0.00033241906,0.0013411662,0.18639687,0.009297977,0.75441945,0.00078819937,0.045126565],"study_design_scores_gemma":[0.000033349916,0.00025814518,0.00037076158,0.00007944885,0.000026178946,0.00014081981,0.00016946826,0.8024101,0.0060368376,0.18744421,0.0029783521,0.00005239468],"about_ca_topic_score_codex":0.0017701826,"about_ca_topic_score_gemma":0.0012833452,"teacher_disagreement_score":0.0047730175,"about_ca_system_score_codex":0.0012699679,"about_ca_system_score_gemma":0.0012718339,"threshold_uncertainty_score":0.025242448},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025144016,0.00058784493,0.9592789,0.0008702686,0.00011772556,0.000081617916,0.00021598885,0.00009854027,0.013605135],"genre_scores_gemma":[0.7132001,0.0022830572,0.2663179,0.00058189785,0.000413794,0.00054878846,0.0008727178,0.0003548994,0.015426789],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988105,0.0004567929,0.00009305303,0.00021576422,0.00028802012,0.0001357614],"domain_scores_gemma":[0.99789524,0.0011477477,0.00025720385,0.00013055855,0.00044147804,0.00012781544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030740032,0.0010496471,0.0011074197,0.0009970132,0.00063264376,0.0017131927,0.0007112392,0.0012781522,0.0046332264],"category_scores_gemma":[0.0056256675,0.00055197807,0.0010784899,0.0006475766,0.0024231614,0.0024372323,0.0020004343,0.0026441591,0.0007475947],"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.00005721523,0.000036837642,0.00049833057,0.00023847616,0.000044356606,0.00024855413,0.00020652865,0.10958898,0.0077673625,0.86351174,0.0034404588,0.014361155],"study_design_scores_gemma":[0.00003565839,0.00011200692,0.0006732729,0.000076978875,0.000024587815,0.00012420403,0.000117610274,0.58003795,0.0027768645,0.41065374,0.0053346255,0.000032542666],"about_ca_topic_score_codex":0.0020311812,"about_ca_topic_score_gemma":0.0016995684,"teacher_disagreement_score":0.0046332264,"about_ca_system_score_codex":0.00095579296,"about_ca_system_score_gemma":0.0016079296,"threshold_uncertainty_score":0.016257107},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13357425,0.0025448455,0.8124052,0.0021633331,0.00037638762,0.00006405237,0.00028709008,0.00011593144,0.04846898],"genre_scores_gemma":[0.9161885,0.0018813714,0.055549975,0.0006286853,0.00038474434,0.0001950059,0.00036018447,0.00010566221,0.024705764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991111,0.0003091843,0.00005927117,0.00020311192,0.00018704892,0.00013021048],"domain_scores_gemma":[0.99905366,0.0003757602,0.00011123967,0.00005065714,0.00030279052,0.000105893065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011377161,0.0006057361,0.00052495726,0.0008601946,0.00071402016,0.0013022864,0.0005267413,0.00065870123,0.004016171],"category_scores_gemma":[0.0026699924,0.000218628,0.00054868025,0.0006812019,0.0012545963,0.0050842636,0.0017303283,0.0016471682,0.0004146915],"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.00011332179,0.000022610922,0.0008357494,0.00018503956,0.000027515536,0.00026556908,0.00027171837,0.011451165,0.011331726,0.9502051,0.0020020776,0.023288395],"study_design_scores_gemma":[0.000022615613,0.00024367953,0.0020572094,0.0000799597,0.000034007022,0.000728166,0.00031188747,0.257478,0.010360001,0.71057713,0.018046292,0.00006111255],"about_ca_topic_score_codex":0.0006431993,"about_ca_topic_score_gemma":0.00041724357,"teacher_disagreement_score":0.004016171,"about_ca_system_score_codex":0.0009403586,"about_ca_system_score_gemma":0.00065909995,"threshold_uncertainty_score":0.013435423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008020364,0.00019527742,0.989939,0.00009980322,0.00004097674,0.000037852788,0.000017646396,0.00006876293,0.0015803502],"genre_scores_gemma":[0.27016786,0.0004953088,0.72446185,0.00018579129,0.000091320806,0.00043198466,0.00027228412,0.00020920376,0.0036844676],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886924,0.00056468596,0.000043631113,0.0001516568,0.00026044223,0.0001103574],"domain_scores_gemma":[0.9982102,0.0009689134,0.00011928179,0.00015091895,0.00044056744,0.00011019313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004072127,0.0011728052,0.0014723851,0.0010199614,0.00050954876,0.0011039628,0.0013688391,0.0015686787,0.0026829524],"category_scores_gemma":[0.0066868495,0.000535931,0.0010996573,0.0007868393,0.0011190829,0.001547556,0.0021863615,0.0021222066,0.00047794543],"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.0001917469,0.00011176543,0.001423032,0.00022497971,0.00012305788,0.000110945926,0.00015196402,0.8016715,0.003256424,0.11699047,0.0024895861,0.07325454],"study_design_scores_gemma":[0.000008086942,0.000017852079,0.000048051083,0.0000064560136,0.0000033205179,0.000011942282,0.0000065637746,0.9936697,0.0001731662,0.0057097925,0.0003423401,0.0000027799265],"about_ca_topic_score_codex":0.0027926245,"about_ca_topic_score_gemma":0.0024985145,"teacher_disagreement_score":0.004072127,"about_ca_system_score_codex":0.0009110625,"about_ca_system_score_gemma":0.0017078926,"threshold_uncertainty_score":0.021535754},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14276743,0.003623699,0.81127197,0.0025625858,0.00022775758,0.00011407972,0.0004126545,0.0003111483,0.038708773],"genre_scores_gemma":[0.9265177,0.0037938324,0.046426233,0.00073569245,0.0004938553,0.0003496964,0.0005938025,0.00028106212,0.020808142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902,0.0002994207,0.00007125864,0.00020387194,0.0002985513,0.00010696678],"domain_scores_gemma":[0.99787545,0.00086815585,0.00028862638,0.00014383456,0.0006017978,0.00022223148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015084622,0.001121857,0.0008098339,0.0021023403,0.0006649253,0.0022420548,0.0009333262,0.001205081,0.0042695217],"category_scores_gemma":[0.0048739305,0.0004993646,0.0010706378,0.00113607,0.0015070009,0.0054570017,0.0017607546,0.0033010258,0.0005118967],"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.00006439511,0.00004146337,0.0008892864,0.0002829181,0.000041540865,0.00034882274,0.00061455776,0.023876408,0.012123517,0.9365613,0.0026015015,0.02255432],"study_design_scores_gemma":[0.000018556142,0.00018787746,0.0013902986,0.000100152865,0.0000394698,0.0005263822,0.0004196681,0.30387694,0.0073839226,0.67566913,0.010324745,0.000062846375],"about_ca_topic_score_codex":0.00049000565,"about_ca_topic_score_gemma":0.00023520824,"teacher_disagreement_score":0.0042695217,"about_ca_system_score_codex":0.0012948317,"about_ca_system_score_gemma":0.0005928769,"threshold_uncertainty_score":0.014282942},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021228272,0.0077186693,0.57993275,0.0069926153,0.0022200348,0.00030354553,0.00096968707,0.00045015317,0.3801842],"genre_scores_gemma":[0.40618792,0.010863463,0.4239168,0.0026347884,0.0023050425,0.0007466764,0.0011507925,0.00050440617,0.15169019],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960953,0.000099276716,0.000023998287,0.000076041266,0.00015043427,0.000040799692],"domain_scores_gemma":[0.99923754,0.0003658947,0.000057971618,0.000051612635,0.00024277427,0.000044250824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086315087,0.00050201005,0.0005788446,0.0008170059,0.0009629746,0.0013809614,0.0006177197,0.0011171423,0.017395467],"category_scores_gemma":[0.002735741,0.0003612164,0.00035569147,0.0010324749,0.0021540031,0.0023197278,0.00095286925,0.0018240928,0.0035256727],"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.000036753685,0.000018242,0.00007772568,0.00021608059,0.000004830248,0.00007141262,0.000116998184,0.00239054,0.002078895,0.91408914,0.024440149,0.056459323],"study_design_scores_gemma":[0.00001897838,0.000026789241,0.00037823644,0.00010506462,0.000008832479,0.00015679565,0.00013029459,0.009701635,0.0031931573,0.9000464,0.08620758,0.000026259568],"about_ca_topic_score_codex":0.0028303245,"about_ca_topic_score_gemma":0.003157866,"teacher_disagreement_score":0.017395467,"about_ca_system_score_codex":0.000950279,"about_ca_system_score_gemma":0.0016572926,"threshold_uncertainty_score":0.058193624},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0565777,0.00043308124,0.9189283,0.00042140807,0.000101680576,0.00009918004,0.00026740867,0.00015285579,0.023018414],"genre_scores_gemma":[0.84821886,0.00074819534,0.14253443,0.00025809734,0.00017981158,0.00038290943,0.0003988537,0.00018605344,0.007092711],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986546,0.0004573802,0.00011280593,0.00019937243,0.0003961717,0.00017959415],"domain_scores_gemma":[0.9972596,0.0017673045,0.00032978825,0.00019473619,0.00030921848,0.00013931721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034986008,0.0013265648,0.001299693,0.0014383134,0.0009826593,0.0027266818,0.0009820847,0.0011424446,0.005544635],"category_scores_gemma":[0.0062073986,0.00061651546,0.0019091261,0.00078134524,0.0024366677,0.0031234943,0.0021298372,0.0038960401,0.00046069457],"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.00017051227,0.0000948205,0.00077538844,0.0002681524,0.000043261054,0.0003905708,0.00039445856,0.123014875,0.010560267,0.8456449,0.0013856806,0.017257126],"study_design_scores_gemma":[0.00003098769,0.0001225178,0.00058173283,0.00008370308,0.000025596279,0.00025673644,0.0001210664,0.53407,0.0051349816,0.4556117,0.00390627,0.000054625394],"about_ca_topic_score_codex":0.00090196304,"about_ca_topic_score_gemma":0.00087388634,"teacher_disagreement_score":0.005544635,"about_ca_system_score_codex":0.0013390457,"about_ca_system_score_gemma":0.0014232756,"threshold_uncertainty_score":0.018548667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004184297,0.2060221,0.22540395,0.009611102,0.013250209,0.0008407222,0.007642503,0.002689009,0.53035605],"genre_scores_gemma":[0.030191408,0.21284477,0.2526406,0.004267772,0.009063543,0.001265463,0.015916249,0.0023329929,0.47147718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99862957,0.00015561053,0.00015945152,0.00031466107,0.0006090871,0.00013169681],"domain_scores_gemma":[0.9984706,0.000518156,0.00010353518,0.0002447206,0.00047715378,0.00018576693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013433057,0.0018523495,0.0017398422,0.0070571396,0.001315337,0.006671541,0.0019330942,0.001797407,0.06950574],"category_scores_gemma":[0.0041637146,0.00097127806,0.0020953324,0.009948096,0.0021814227,0.007964753,0.0021311338,0.0055832653,0.036394235],"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.000043845164,0.00007427692,0.0003354825,0.0017609672,0.000023687115,0.00011802842,0.00018648816,0.0014853061,0.0012822823,0.4623004,0.22498195,0.3074072],"study_design_scores_gemma":[0.000013162566,0.0000418699,0.00066069316,0.0006852131,0.000014183414,0.0008238699,0.00010553914,0.0025560893,0.00050740794,0.21634781,0.7782096,0.00003447785],"about_ca_topic_score_codex":0.0015523629,"about_ca_topic_score_gemma":0.0015972926,"teacher_disagreement_score":0.06950574,"about_ca_system_score_codex":0.0021655262,"about_ca_system_score_gemma":0.0020235905,"threshold_uncertainty_score":0.23251992},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014196566,0.00083078037,0.97189844,0.00078595517,0.000050966115,0.000026957,0.00003840581,0.00003013081,0.012141907],"genre_scores_gemma":[0.8044713,0.0025945143,0.18259028,0.0004947639,0.00041500607,0.00037154547,0.00013627083,0.00014055042,0.0087858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902415,0.00043438683,0.00003327291,0.00017559118,0.00025349937,0.00007907974],"domain_scores_gemma":[0.9960729,0.0032520213,0.00021919295,0.00011286379,0.00025304398,0.00008999264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027092912,0.00087047275,0.00095765834,0.0009047493,0.00077236886,0.0015177715,0.0013459508,0.0014501129,0.0033218344],"category_scores_gemma":[0.0066373385,0.0005395298,0.00085102697,0.0010088197,0.0038912059,0.0034466183,0.00269149,0.0029046948,0.0003097972],"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.0000183795,0.000019085537,0.0001296489,0.000060033628,0.000017060866,0.000050951294,0.00008716268,0.0621616,0.00058864086,0.92737687,0.00048360837,0.009006892],"study_design_scores_gemma":[0.000008665937,0.000035518984,0.00016285125,0.000026804924,0.0000060407815,0.00003572366,0.000026676778,0.25189328,0.0001969358,0.7464285,0.0011666375,0.000012402682],"about_ca_topic_score_codex":0.0011375367,"about_ca_topic_score_gemma":0.00065450754,"teacher_disagreement_score":0.0033218344,"about_ca_system_score_codex":0.0008972539,"about_ca_system_score_gemma":0.00082412356,"threshold_uncertainty_score":0.014328241},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2592509,0.0024863714,0.6934969,0.0046913777,0.0005110153,0.00006944538,0.0005934865,0.00019375341,0.038706817],"genre_scores_gemma":[0.91867733,0.002916675,0.055008624,0.00057394826,0.00068529026,0.0000978034,0.00057010114,0.00020926658,0.021260956],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906546,0.0003073047,0.000058141395,0.00018732225,0.00025333653,0.00012846406],"domain_scores_gemma":[0.9937926,0.0028691224,0.0005823289,0.0003553381,0.0013828496,0.0010177656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003300409,0.0011366762,0.0012989603,0.0022897818,0.0012406956,0.0038751275,0.001716524,0.0018365207,0.0031242217],"category_scores_gemma":[0.011274979,0.0006923381,0.0012496177,0.0013375577,0.003870977,0.0075789844,0.0025310644,0.0038890552,0.00024532783],"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.000067300185,0.00003192458,0.00058280595,0.000058455356,0.000020871821,0.00020109877,0.0001945669,0.0046453825,0.0024046262,0.98783946,0.0006666847,0.0032868553],"study_design_scores_gemma":[0.00002559412,0.00007010913,0.00091225014,0.000031293624,0.000016914984,0.00024844919,0.0001133108,0.12863639,0.00082222867,0.8670643,0.0020260464,0.00003307037],"about_ca_topic_score_codex":0.004099939,"about_ca_topic_score_gemma":0.0020974982,"teacher_disagreement_score":0.004099939,"about_ca_system_score_codex":0.002159585,"about_ca_system_score_gemma":0.001600616,"threshold_uncertainty_score":0.017454445},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52521104,0.000917792,0.4442505,0.0009577814,0.00011747602,0.00009128874,0.00025424137,0.00009332916,0.028106613],"genre_scores_gemma":[0.97023815,0.00050825835,0.016741475,0.00008407335,0.00016071141,0.000103757935,0.00019640192,0.000064138476,0.011903061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882597,0.00037754708,0.00007308973,0.00025832318,0.00032988595,0.00013507076],"domain_scores_gemma":[0.99162734,0.004982013,0.000967551,0.00043173,0.001186045,0.0008053791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025841936,0.0009615435,0.0012009111,0.001929258,0.0013984852,0.0034064564,0.0011499166,0.0011012423,0.0056287143],"category_scores_gemma":[0.0077950903,0.0005861997,0.0013073556,0.0010553785,0.0039679236,0.0051863687,0.002134433,0.0020889083,0.0003416279],"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.000097129254,0.000039317565,0.0005577533,0.000056467492,0.000028642406,0.0002828563,0.000837886,0.007353797,0.003856068,0.9829951,0.0003547139,0.0035401538],"study_design_scores_gemma":[0.000036150082,0.00011483161,0.000609684,0.00001927655,0.000020551703,0.00025530864,0.00045072564,0.102700405,0.0013739822,0.89334124,0.0010481209,0.000029744473],"about_ca_topic_score_codex":0.0012534866,"about_ca_topic_score_gemma":0.00093559484,"teacher_disagreement_score":0.0056287143,"about_ca_system_score_codex":0.0016070511,"about_ca_system_score_gemma":0.00089284865,"threshold_uncertainty_score":0.018829882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034304015,0.006158658,0.768328,0.0058187675,0.0004260795,0.00009966131,0.00035485133,0.00021666402,0.18429337],"genre_scores_gemma":[0.7942815,0.0044501815,0.16790701,0.0018870676,0.001016379,0.0003575778,0.00039495906,0.00023174156,0.029473543],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980421,0.000776599,0.000073398456,0.00033391232,0.0006285754,0.0001453894],"domain_scores_gemma":[0.9982218,0.0009515487,0.00013359234,0.00016811152,0.00039406214,0.00013071242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026918666,0.00085632975,0.00076808943,0.001364512,0.0008130714,0.001997357,0.0007003983,0.0005181153,0.0053584324],"category_scores_gemma":[0.004699349,0.0004662461,0.0012477986,0.0007614154,0.0036373965,0.0034034082,0.0027322203,0.003447827,0.00083244586],"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.000008726333,0.0000048943016,0.00006519646,0.00006287072,0.000015176168,0.000030406385,0.000048475402,0.0012354852,0.00072586734,0.99011856,0.001395007,0.0062893755],"study_design_scores_gemma":[0.000005313308,0.000013387342,0.0001973965,0.000037346534,0.00001074187,0.000108970286,0.000036926784,0.016596,0.0008072677,0.9733647,0.008814506,0.000007476576],"about_ca_topic_score_codex":0.000539073,"about_ca_topic_score_gemma":0.0005906741,"teacher_disagreement_score":0.0053584324,"about_ca_system_score_codex":0.0015121965,"about_ca_system_score_gemma":0.0008223425,"threshold_uncertainty_score":0.01792574},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46322247,0.0023268028,0.36357385,0.004116576,0.00031334095,0.00008549411,0.00049909885,0.00044938968,0.16541292],"genre_scores_gemma":[0.94454414,0.0010699411,0.030944513,0.00036473092,0.00039002052,0.00018246766,0.0004343661,0.00037489846,0.021694744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99886346,0.0003097536,0.000049128437,0.00022336197,0.00036138104,0.00019291161],"domain_scores_gemma":[0.99251294,0.0052232137,0.00055988773,0.0003958301,0.00050829514,0.0007998482],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026038354,0.0011765267,0.0016946879,0.0023719468,0.0016501029,0.0039718207,0.0021681716,0.0019474577,0.008348081],"category_scores_gemma":[0.011716635,0.00096877635,0.0011397196,0.0018156015,0.004447657,0.009365304,0.0028376442,0.0061730715,0.0004912466],"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.000029282633,0.00002352356,0.00011525996,0.00003445954,0.000004528565,0.000026223463,0.00013331808,0.0030012438,0.00032136295,0.99300635,0.00085157005,0.0024528191],"study_design_scores_gemma":[0.0000093775025,0.000010508114,0.00010812906,0.000016162438,0.000005075237,0.00003760306,0.000045309487,0.022488195,0.00020249582,0.97643924,0.0006304388,0.0000074960726],"about_ca_topic_score_codex":0.0011471197,"about_ca_topic_score_gemma":0.0011159829,"teacher_disagreement_score":0.008348081,"about_ca_system_score_codex":0.0028527796,"about_ca_system_score_gemma":0.00090999925,"threshold_uncertainty_score":0.0279271},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012959414,0.0006141911,0.9754519,0.0012382172,0.00018265822,0.00013644648,0.00037096548,0.00016952143,0.008876767],"genre_scores_gemma":[0.4677127,0.0024010607,0.50411814,0.0009895246,0.0008938903,0.0013828757,0.0015864185,0.0012029203,0.019712472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730116,0.0012485972,0.0001924417,0.00039393568,0.0005750187,0.00028884926],"domain_scores_gemma":[0.98796785,0.008518056,0.00066619035,0.0005995228,0.0016760415,0.00057235785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005314647,0.0030783375,0.002569642,0.002151468,0.0012012927,0.0029866432,0.0029253366,0.0038728572,0.009228438],"category_scores_gemma":[0.028287888,0.0019810314,0.0019779368,0.0012954033,0.0035205267,0.005572144,0.0044573867,0.007983258,0.0010453421],"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.00020968808,0.00022145236,0.0005723133,0.000613095,0.00006926857,0.00028993512,0.00029100772,0.13947019,0.005481736,0.81981087,0.0072229463,0.025747469],"study_design_scores_gemma":[0.000045459503,0.00006682299,0.0004013322,0.000111105546,0.000030402416,0.00009216218,0.00007843664,0.5579386,0.0019775855,0.43633372,0.0028856567,0.000038741517],"about_ca_topic_score_codex":0.0024394512,"about_ca_topic_score_gemma":0.0030642136,"teacher_disagreement_score":0.009228438,"about_ca_system_score_codex":0.0021030046,"about_ca_system_score_gemma":0.0031535535,"threshold_uncertainty_score":0.030872226},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004028014,0.0005450307,0.9921221,0.00038246426,0.000100304926,0.000033612843,0.000017741144,0.00003144907,0.0027392437],"genre_scores_gemma":[0.340858,0.0019750574,0.634842,0.0005895668,0.00039320963,0.00075412955,0.00020352034,0.00027311072,0.020111436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926454,0.0003780734,0.000029449595,0.00011074041,0.00015196574,0.00006517728],"domain_scores_gemma":[0.9987361,0.00072957494,0.00012202657,0.00006270837,0.00019147214,0.00015813265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024636223,0.0014137849,0.0012975743,0.0010535326,0.00080627686,0.0012337944,0.0014894755,0.0016883509,0.0027529295],"category_scores_gemma":[0.0049604396,0.0006532217,0.0017008843,0.0006581095,0.002076218,0.0031228915,0.0029208546,0.004214371,0.00038066122],"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.00016836185,0.00010486306,0.00072160905,0.00049255707,0.00011027696,0.00023325646,0.00036194202,0.22720367,0.008781203,0.72179675,0.0033341195,0.036691297],"study_design_scores_gemma":[0.00001525544,0.00006838481,0.00006721106,0.000030676438,0.000014795163,0.000045229528,0.000026732798,0.9251893,0.00058246736,0.07140491,0.0025396424,0.00001538034],"about_ca_topic_score_codex":0.001584427,"about_ca_topic_score_gemma":0.001139363,"teacher_disagreement_score":0.0027529295,"about_ca_system_score_codex":0.0010338805,"about_ca_system_score_gemma":0.0016390365,"threshold_uncertainty_score":0.013029039},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027707193,0.00007579824,0.9701635,0.00007407571,0.000018994975,0.00004890319,0.000016252889,0.00012290322,0.0017723322],"genre_scores_gemma":[0.26326317,0.000106293315,0.7312488,0.000065141765,0.000018663963,0.00011460092,0.00012590195,0.0001219661,0.0049355333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992836,0.00018560357,0.000057028858,0.0001095294,0.00024787732,0.00011634829],"domain_scores_gemma":[0.99841607,0.0006576411,0.00013873164,0.0002843796,0.0003617142,0.00014147555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024324753,0.00063985825,0.00085525704,0.0009331124,0.0010566808,0.0011876391,0.0011774786,0.00097109674,0.0029654345],"category_scores_gemma":[0.0055640275,0.00036989313,0.0008184435,0.0006702045,0.0016955965,0.0020659724,0.0021736368,0.0016132533,0.0005095874],"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.00042323305,0.00011616951,0.0029663371,0.00016947996,0.00005468167,0.00032770057,0.0006311773,0.2668355,0.011288125,0.45121405,0.0020255235,0.26394802],"study_design_scores_gemma":[0.00002742285,0.00011792379,0.00029104867,0.000027390572,0.000010754377,0.00011814307,0.00011113258,0.9154867,0.0067080418,0.074338175,0.002739581,0.00002370834],"about_ca_topic_score_codex":0.0031410588,"about_ca_topic_score_gemma":0.0036784846,"teacher_disagreement_score":0.0031410588,"about_ca_system_score_codex":0.0010675824,"about_ca_system_score_gemma":0.0019671135,"threshold_uncertainty_score":0.012864351},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11475085,0.003920022,0.6849353,0.022136657,0.0016288043,0.000096128,0.00024866266,0.0002100742,0.17207362],"genre_scores_gemma":[0.86469656,0.0019899893,0.085590705,0.0032914758,0.0018608556,0.00015122612,0.00019890796,0.00032197055,0.041898254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985464,0.0006757778,0.00006398543,0.00021201307,0.00033060735,0.00017113319],"domain_scores_gemma":[0.99727196,0.0012305893,0.00025048107,0.00039206183,0.00039788097,0.00045696044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040607853,0.00080438366,0.0017348255,0.0018006859,0.002429061,0.0033677632,0.00253372,0.003249943,0.008384845],"category_scores_gemma":[0.008544444,0.00063308916,0.0015391096,0.0012555126,0.0054735304,0.00836616,0.0049359286,0.006605104,0.000701523],"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.0000086849595,0.00000838994,0.0000328161,0.000013263053,0.0000040435098,0.00003380253,0.000042708605,0.00059534796,0.00015756206,0.9975478,0.0006013484,0.0009542111],"study_design_scores_gemma":[0.000007785405,0.000007868497,0.000045955734,0.000010415668,0.0000029730804,0.000062608065,0.00004809698,0.019723665,0.0000806649,0.97909224,0.0009127373,0.000005106465],"about_ca_topic_score_codex":0.0010219296,"about_ca_topic_score_gemma":0.0009019889,"teacher_disagreement_score":0.008384845,"about_ca_system_score_codex":0.0014760133,"about_ca_system_score_gemma":0.0015446123,"threshold_uncertainty_score":0.028050125},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110910855,0.017667402,0.6686686,0.0025105015,0.0007355112,0.000055442968,0.0004488558,0.00016026762,0.19884256],"genre_scores_gemma":[0.7686535,0.022291988,0.100471325,0.0007654468,0.0013041784,0.00013159537,0.0007332685,0.00037179308,0.10527689],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955577,0.0000959651,0.000024100294,0.00011180919,0.0001781479,0.000034232817],"domain_scores_gemma":[0.9991862,0.00043383296,0.000048757127,0.0001160691,0.00016780855,0.000047307713],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00087332434,0.00059566414,0.0005114738,0.0011918576,0.00035282437,0.0018202863,0.0004312139,0.00047178313,0.0032600563],"category_scores_gemma":[0.0024871815,0.00031914882,0.0006360842,0.0008610065,0.0020424235,0.0025488725,0.0012936477,0.0026051223,0.00089382794],"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.000007950007,0.0000037767406,0.000083377476,0.00006110583,0.00000542026,0.00004115453,0.00011576511,0.0023036797,0.0017211185,0.9786099,0.0016681628,0.015378626],"study_design_scores_gemma":[0.0000034149596,0.000022597429,0.0003670603,0.000033628225,0.000005772615,0.00021910942,0.00006197393,0.016482877,0.0017005255,0.9556997,0.02539462,0.000008823922],"about_ca_topic_score_codex":0.00032254195,"about_ca_topic_score_gemma":0.00020978585,"teacher_disagreement_score":0.0032600563,"about_ca_system_score_codex":0.0006655647,"about_ca_system_score_gemma":0.00036373967,"threshold_uncertainty_score":0.010905921},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03996646,0.0026073395,0.5999813,0.011155777,0.0017837099,0.00009548663,0.0007265428,0.00032000415,0.3433634],"genre_scores_gemma":[0.6749107,0.003824938,0.11257132,0.0050358935,0.0042894837,0.0003070966,0.00049956865,0.0006315971,0.19792935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993709,0.00016515788,0.00002677541,0.00017845977,0.00018030615,0.00007848251],"domain_scores_gemma":[0.99856746,0.00079549314,0.000094996874,0.00014874722,0.00026882187,0.00012453066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015245271,0.0006970077,0.0008883783,0.0014913426,0.0015973609,0.0013166983,0.001733707,0.0011036494,0.019667268],"category_scores_gemma":[0.0041969633,0.00041792588,0.0015981216,0.0012109783,0.0017237106,0.0035427022,0.0029779193,0.00253528,0.001946895],"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.00001630684,0.000015113296,0.0002373026,0.000050292256,0.000019637264,0.00006696799,0.000078601515,0.0006668575,0.0005994839,0.9853248,0.0041719163,0.008752642],"study_design_scores_gemma":[0.000017538097,0.000028988243,0.00057779107,0.000020125042,0.000019231418,0.00021666462,0.000036909234,0.009237223,0.00050311314,0.9696083,0.019720245,0.000013999282],"about_ca_topic_score_codex":0.0015554093,"about_ca_topic_score_gemma":0.0013844412,"teacher_disagreement_score":0.019667268,"about_ca_system_score_codex":0.0010453475,"about_ca_system_score_gemma":0.00080231176,"threshold_uncertainty_score":0.065793574},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03540043,0.0014664893,0.8240752,0.0015333804,0.0003557476,0.000038367813,0.00023494348,0.00038739695,0.13650793],"genre_scores_gemma":[0.47820488,0.004588067,0.24510764,0.0017788784,0.0014254777,0.00026913648,0.0010343625,0.0026221084,0.26496935],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928087,0.00024316135,0.000029011944,0.00013477371,0.00022611543,0.00008602696],"domain_scores_gemma":[0.9982658,0.0007845283,0.0001031391,0.00025396628,0.0003536335,0.00023888343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013997483,0.0015387601,0.0009521768,0.0018098776,0.0017373792,0.0023747468,0.0010667075,0.0014282804,0.008210035],"category_scores_gemma":[0.0049753576,0.00053162314,0.0012375448,0.0011968702,0.0030689556,0.0048245997,0.0036768909,0.004413106,0.0018702317],"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.000020576448,0.000012949771,0.00010623021,0.0000286577,0.0000060656052,0.000025132844,0.000116820476,0.0018691169,0.00081217533,0.98177594,0.0022295578,0.01299667],"study_design_scores_gemma":[0.000005647623,0.00002244008,0.00018309828,0.000028669974,0.000009422247,0.0000805838,0.00004592704,0.021570161,0.0005863868,0.96222675,0.01523083,0.000010068888],"about_ca_topic_score_codex":0.0011359656,"about_ca_topic_score_gemma":0.0008156527,"teacher_disagreement_score":0.008210035,"about_ca_system_score_codex":0.0012716601,"about_ca_system_score_gemma":0.0005522422,"threshold_uncertainty_score":0.027465284},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0856107,0.01217239,0.23926666,0.00980388,0.0010014023,0.00007801372,0.0022106292,0.00051817874,0.6493381],"genre_scores_gemma":[0.8282842,0.010940285,0.03135979,0.0015828473,0.0024120952,0.00033282072,0.0015220991,0.0005749255,0.12299093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989737,0.0002708457,0.00004718718,0.00017628315,0.0003488756,0.00018303524],"domain_scores_gemma":[0.9980957,0.000873927,0.00016936906,0.00023252738,0.00034009424,0.0002885511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012679066,0.0010596107,0.001460463,0.0027671552,0.0014628523,0.0044858265,0.0020507046,0.0013847431,0.024063837],"category_scores_gemma":[0.0058122613,0.0005004503,0.0007962969,0.0024617843,0.0036474701,0.00636452,0.0032703376,0.003644267,0.0030735985],"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.00001985141,0.000004546671,0.000030507688,0.000043238975,0.0000043334767,0.000009997912,0.000043362732,0.0013119937,0.00015826419,0.99140996,0.003104411,0.0038595228],"study_design_scores_gemma":[0.0000071038944,0.0000062993163,0.00007624271,0.000017417138,0.000004271527,0.000028950117,0.000026856005,0.0047958246,0.0001931957,0.9885944,0.0062407083,0.00000872708],"about_ca_topic_score_codex":0.002294842,"about_ca_topic_score_gemma":0.00094936223,"teacher_disagreement_score":0.024063837,"about_ca_system_score_codex":0.002340461,"about_ca_system_score_gemma":0.0011335938,"threshold_uncertainty_score":0.0805015},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018869774,0.0011733607,0.96989775,0.00035219206,0.00024675817,0.00004852983,0.00003846186,0.000072545605,0.009300571],"genre_scores_gemma":[0.42652175,0.001967349,0.547357,0.00047499465,0.00045337752,0.0002024685,0.0001382693,0.00018171188,0.022703093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925727,0.00019548838,0.000060131875,0.00017592972,0.00025538396,0.000055693887],"domain_scores_gemma":[0.99893576,0.00042323416,0.00010728835,0.00015750783,0.00027739347,0.00009883659],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026150942,0.00062211877,0.0008489402,0.00095361896,0.00052711606,0.0013578358,0.0013850301,0.0014017805,0.0036775512],"category_scores_gemma":[0.00484753,0.00027066414,0.0010395978,0.0005391542,0.0010499647,0.003040671,0.0016704847,0.002479591,0.00059200986],"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.000038908893,0.00004686224,0.00040077683,0.00017176398,0.0000195635,0.00043825933,0.0002288882,0.027760075,0.0147703905,0.9232376,0.001077772,0.031809088],"study_design_scores_gemma":[0.000020136284,0.00012947172,0.00028044626,0.00005138064,0.000019360057,0.00045624707,0.000055534158,0.43994135,0.0064189737,0.5402711,0.0123220235,0.00003401628],"about_ca_topic_score_codex":0.00038065505,"about_ca_topic_score_gemma":0.00038981935,"teacher_disagreement_score":0.0036775512,"about_ca_system_score_codex":0.00045723835,"about_ca_system_score_gemma":0.0005185535,"threshold_uncertainty_score":0.013830125},"labels":[],"label_agreement":null},{"id":"W2617461187","doi":"10.1007/s11228-017-0415-x","title":"Subgradient Projectors: Extensions, Theory, and Characterizations","year":2017,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Subgradient method; Mathematics; Projector; Convex optimization; Convex analysis; Projection (relational algebra); Regular polygon; Mathematical optimization; Computer science; Algorithm; Geometry; Computer vision","score_opus":0.018262609816990207,"score_gpt":0.27462198711813957,"score_spread":0.2563593773011494,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2617461187","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025919225,0.0018914397,0.9547668,0.0014608068,0.00012398706,0.00005167002,0.0001730299,0.00013098652,0.01548206],"genre_scores_gemma":[0.6261156,0.007909797,0.3273195,0.0010903399,0.0015979107,0.00046531082,0.0007506224,0.0006905055,0.03406048],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977156,0.0011310467,0.00011756117,0.00034368387,0.0005263583,0.00016573614],"domain_scores_gemma":[0.9925868,0.0040595653,0.0007188617,0.0006477464,0.001215215,0.0007719133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004705571,0.0012766266,0.0013326228,0.002181462,0.0008754998,0.003883427,0.0017000474,0.0013448008,0.0047712084],"category_scores_gemma":[0.014256313,0.0007528426,0.001254904,0.0022450758,0.0036743467,0.0076388875,0.0034041263,0.0057162726,0.00065300445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016131555,0.000022588407,0.00019205162,0.000041190855,0.000010734861,0.000022439826,0.00008354265,0.003387292,0.00033771296,0.98462856,0.0013060308,0.009951718],"study_design_scores_gemma":[0.000009543272,0.00003892294,0.00021945717,0.00003737928,0.000014282549,0.00011659673,0.00005367981,0.07873818,0.00043272218,0.9168059,0.0035196277,0.00001375915],"about_ca_topic_score_codex":0.0008881104,"about_ca_topic_score_gemma":0.0006847976,"teacher_disagreement_score":0.0047712084,"about_ca_system_score_codex":0.0016105897,"about_ca_system_score_gemma":0.0016068217,"threshold_uncertainty_score":0.024885774},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013905062,0.00012615012,0.99749976,0.000037973707,0.000017941631,0.000015416512,0.000010413531,0.000030216896,0.0008715053],"genre_scores_gemma":[0.112610795,0.00087851303,0.88218665,0.00011797959,0.000114586626,0.0002787294,0.000119445336,0.00017217606,0.003521117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993593,0.00023651727,0.000027682632,0.000082117585,0.00024477355,0.00004955237],"domain_scores_gemma":[0.99912494,0.0004972042,0.000067991845,0.00005595871,0.00022252077,0.00003135418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015305374,0.0011771712,0.00090750295,0.0011042351,0.0005033893,0.00090040424,0.0013905587,0.0009779022,0.0025003692],"category_scores_gemma":[0.0030337337,0.00047482396,0.0010654817,0.0008409082,0.0013278832,0.0015746482,0.0012616232,0.0021526322,0.00046532],"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.00008817028,0.00006257387,0.0004548898,0.00031626495,0.00008265834,0.000094101546,0.0002018799,0.27596813,0.01230553,0.565364,0.0030227625,0.14203909],"study_design_scores_gemma":[0.000014688824,0.000032223787,0.00006009623,0.000018760078,0.000012226897,0.00003188021,0.000019185136,0.9424912,0.0025129677,0.05044614,0.004348544,0.0000120527175],"about_ca_topic_score_codex":0.0014055376,"about_ca_topic_score_gemma":0.0014242167,"teacher_disagreement_score":0.0025003692,"about_ca_system_score_codex":0.0007749596,"about_ca_system_score_gemma":0.0010070624,"threshold_uncertainty_score":0.008364499},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0082548885,0.013335776,0.2385146,0.0028989187,0.0010627159,0.00003746477,0.00019281803,0.00023698255,0.7354658],"genre_scores_gemma":[0.20567079,0.01660516,0.12511969,0.0010872832,0.0016136114,0.00018323172,0.0003503242,0.0009951345,0.6483748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971634,0.00007571151,0.000011148082,0.000042008436,0.00012649197,0.000028224385],"domain_scores_gemma":[0.9997136,0.00014342729,0.000014277734,0.00004025137,0.00007220897,0.00001612651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068480993,0.00077588216,0.00091686606,0.0010331982,0.00070600276,0.0014583943,0.00083952147,0.0008926305,0.013300031],"category_scores_gemma":[0.0016282767,0.00045031193,0.0005797332,0.0010371513,0.0018544163,0.0026115505,0.00081196305,0.0024574157,0.003238722],"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.0000081944545,0.000011543387,0.000025428426,0.000064954445,0.0000061562796,0.00002725118,0.000057947753,0.0019816223,0.0005261749,0.94654846,0.016568251,0.034174033],"study_design_scores_gemma":[0.0000064517553,0.0000118421185,0.0001466399,0.00005519892,0.0000067526175,0.00012667614,0.00002939566,0.008699465,0.0006119665,0.91495687,0.075336486,0.000012296335],"about_ca_topic_score_codex":0.0012385407,"about_ca_topic_score_gemma":0.0015231633,"teacher_disagreement_score":0.013300031,"about_ca_system_score_codex":0.0009639068,"about_ca_system_score_gemma":0.0006779695,"threshold_uncertainty_score":0.04449302},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0063566677,0.0033435877,0.939901,0.0021794634,0.0006352059,0.00014258473,0.00047332537,0.0001592563,0.046808947],"genre_scores_gemma":[0.43006414,0.0076668533,0.533838,0.0020788193,0.002579659,0.0013885135,0.0014409163,0.000587297,0.020355817],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965011,0.0013968343,0.0002642189,0.00044006735,0.0011539231,0.00024388291],"domain_scores_gemma":[0.9944243,0.0039986814,0.0003590887,0.00036149737,0.0006913753,0.00016510782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004878352,0.0016693383,0.0015502652,0.0015448418,0.0010146516,0.0019861734,0.0016617547,0.0025596956,0.009548467],"category_scores_gemma":[0.015127375,0.00076937,0.0021232257,0.0013306976,0.0028827323,0.005213692,0.0025064014,0.005672825,0.0022284915],"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.00003638325,0.000040578925,0.00026740695,0.0004229518,0.000049524315,0.00025383194,0.00013324175,0.008224963,0.002339891,0.9649788,0.0066795,0.016572842],"study_design_scores_gemma":[0.000023635128,0.000086877364,0.00041074734,0.00012552971,0.000029046123,0.00027673497,0.00004342504,0.04481164,0.0018913919,0.9414735,0.0108038075,0.000023675193],"about_ca_topic_score_codex":0.00042376172,"about_ca_topic_score_gemma":0.00052375474,"teacher_disagreement_score":0.009548467,"about_ca_system_score_codex":0.00091474655,"about_ca_system_score_gemma":0.0015836994,"threshold_uncertainty_score":0.031942785},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0113484375,0.0003324787,0.983859,0.00008663285,0.00007006501,0.000056901372,0.000014470596,0.000056419052,0.004175628],"genre_scores_gemma":[0.2833755,0.0010961108,0.69997895,0.00012163652,0.00010701849,0.0004384602,0.00010224522,0.000094099785,0.01468601],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995652,0.00015486954,0.000027328435,0.0000585428,0.00015900901,0.000035098405],"domain_scores_gemma":[0.9995352,0.00021272004,0.000042204232,0.00004170801,0.0001358761,0.000032324933],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012160619,0.00073505536,0.0006171297,0.00082627265,0.00044255584,0.0008946626,0.0010470408,0.0009179159,0.0020047715],"category_scores_gemma":[0.0028892567,0.00033736666,0.0011113902,0.0005729825,0.0009239823,0.0009011325,0.0013900534,0.0015170989,0.0005277603],"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.00014860208,0.000089004454,0.0014690997,0.00034049788,0.00012757229,0.0002884451,0.0008419612,0.3304857,0.024336325,0.49500576,0.0020292706,0.14483783],"study_design_scores_gemma":[0.000010983892,0.00013445449,0.00011632861,0.000030106243,0.000015557827,0.000066812536,0.000037857528,0.97158676,0.0024950586,0.02090078,0.0045885835,0.000016660959],"about_ca_topic_score_codex":0.001809496,"about_ca_topic_score_gemma":0.0017745155,"teacher_disagreement_score":0.0020047715,"about_ca_system_score_codex":0.0007418193,"about_ca_system_score_gemma":0.00077677844,"threshold_uncertainty_score":0.006706655},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04495023,0.035460573,0.50183666,0.021767037,0.007548166,0.000088973735,0.005006972,0.0023819478,0.38095948],"genre_scores_gemma":[0.49118203,0.018432187,0.0767045,0.0018094294,0.0054335035,0.0002792935,0.005708367,0.003189752,0.39726093],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925953,0.00017683677,0.00005698095,0.00012365427,0.00031918957,0.00006377402],"domain_scores_gemma":[0.99718153,0.0013576967,0.00015030862,0.0006762453,0.0004188528,0.00021533406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017565874,0.000982233,0.0020841646,0.0037410548,0.0014627499,0.005616677,0.0018200859,0.0021291978,0.03132713],"category_scores_gemma":[0.0073516634,0.0010412273,0.0013203041,0.004067581,0.0026762865,0.0044799936,0.0026272596,0.0052446523,0.005502932],"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.000026574962,0.000021916492,0.00008907047,0.00008732953,0.000018587483,0.000029591061,0.0000709603,0.0032148117,0.00016187133,0.96212775,0.01990687,0.01424461],"study_design_scores_gemma":[0.000013068728,0.000009205177,0.000216379,0.0000663743,0.000013500892,0.000053094423,0.00003016851,0.018047346,0.000304783,0.94801205,0.03321963,0.000014443885],"about_ca_topic_score_codex":0.0027271332,"about_ca_topic_score_gemma":0.0025270635,"teacher_disagreement_score":0.03132713,"about_ca_system_score_codex":0.0032975886,"about_ca_system_score_gemma":0.0014454116,"threshold_uncertainty_score":0.10479969},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005023276,0.00013482115,0.9939043,0.00007383539,0.000015471958,0.000022914686,0.000012231007,0.00010114369,0.0007120801],"genre_scores_gemma":[0.40153238,0.0004885439,0.5938287,0.00013597395,0.000063809806,0.0003388698,0.00017310503,0.00023038105,0.0032082787],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995479,0.00016851506,0.000027668615,0.000069563204,0.00015164092,0.00003471663],"domain_scores_gemma":[0.99870133,0.0008528429,0.00012121451,0.00007982845,0.00019277842,0.000051981395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014647334,0.001067593,0.0010022689,0.000557862,0.00042317738,0.00067729136,0.0009622207,0.0009620397,0.0018932474],"category_scores_gemma":[0.003123472,0.0005733715,0.0006270784,0.0008025041,0.0012124775,0.0007245896,0.0010259359,0.0013999515,0.00035107712],"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.00002923012,0.000017238486,0.00027098294,0.00010434647,0.000028570681,0.000047013804,0.00004275874,0.9650271,0.0017004912,0.014244937,0.00038720996,0.01810021],"study_design_scores_gemma":[0.0000037076684,0.000008571474,0.000017050914,0.0000025996178,0.000001337976,0.000003135065,0.0000028292554,0.9959006,0.00022683745,0.0035833376,0.0002485688,0.000001489918],"about_ca_topic_score_codex":0.004044002,"about_ca_topic_score_gemma":0.0037619113,"teacher_disagreement_score":0.004044002,"about_ca_system_score_codex":0.0006734581,"about_ca_system_score_gemma":0.0016032853,"threshold_uncertainty_score":0.008040905},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001333681,0.00035953955,0.9911413,0.00020969856,0.00005171696,0.00005506292,0.00008307247,0.00007863021,0.006687361],"genre_scores_gemma":[0.10064453,0.0015577589,0.89057195,0.00040828384,0.00019039056,0.0005576756,0.00075677596,0.00026145272,0.0050512585],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99663335,0.001218629,0.00019062962,0.0005728217,0.0011385723,0.00024594745],"domain_scores_gemma":[0.9966455,0.0024129495,0.00021234107,0.0002192694,0.00041123564,0.000098718665],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003978512,0.0014970759,0.0010732424,0.0013483211,0.001007845,0.003639523,0.0014756437,0.0013767941,0.0087123485],"category_scores_gemma":[0.009546396,0.0009228644,0.0013859873,0.0020716123,0.002482768,0.002996042,0.0023320108,0.006263355,0.0014862395],"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.00007414896,0.0000580379,0.00019469696,0.00029238765,0.0000377071,0.00014530488,0.00019411146,0.13065504,0.0015227966,0.7986494,0.004097367,0.06407906],"study_design_scores_gemma":[0.00003318948,0.000060281494,0.0000966319,0.00013982851,0.00002071491,0.00012390153,0.000064497,0.30794066,0.0015314058,0.66574967,0.024214368,0.000024905348],"about_ca_topic_score_codex":0.0015744682,"about_ca_topic_score_gemma":0.0014448748,"teacher_disagreement_score":0.0087123485,"about_ca_system_score_codex":0.0018144378,"about_ca_system_score_gemma":0.0012576927,"threshold_uncertainty_score":0.029145718},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023603546,0.005545159,0.9481743,0.0027704106,0.0008365361,0.00011646691,0.00021594744,0.00027491432,0.018462727],"genre_scores_gemma":[0.6767276,0.00824735,0.26350096,0.002107661,0.002381102,0.00090764294,0.0012085816,0.0013914253,0.043527696],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937231,0.0025229545,0.00033551586,0.00081073283,0.0019338785,0.00067386596],"domain_scores_gemma":[0.9340242,0.052776463,0.0020656849,0.0022463133,0.00674092,0.0021464233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015140345,0.0054954137,0.003015834,0.004016856,0.0014505569,0.005108344,0.00477062,0.0051944735,0.008076945],"category_scores_gemma":[0.06723038,0.0017295536,0.0022795799,0.0021560623,0.00687944,0.009018012,0.010638389,0.011387361,0.0011436635],"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.00076146406,0.00021401749,0.0013886658,0.0009841998,0.0002470283,0.0002711055,0.00066112925,0.19376886,0.0068378053,0.7464794,0.005466385,0.042919815],"study_design_scores_gemma":[0.00003825442,0.00013483393,0.00040327688,0.0001661812,0.000059108457,0.000090338224,0.0001035084,0.75498784,0.0016591332,0.23996687,0.0023427864,0.000047809222],"about_ca_topic_score_codex":0.0038519183,"about_ca_topic_score_gemma":0.0026310107,"teacher_disagreement_score":0.015140345,"about_ca_system_score_codex":0.0043766936,"about_ca_system_score_gemma":0.0027684858,"threshold_uncertainty_score":0.080070734},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11641736,0.000462652,0.8639091,0.00053721445,0.00010979521,0.000046298108,0.00007453443,0.00007252129,0.018370377],"genre_scores_gemma":[0.9628505,0.00022193455,0.027919402,0.00009287136,0.000049829974,0.00011307991,0.000051033894,0.00003858572,0.008662679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99970824,0.00011225354,0.000010102346,0.00005375434,0.00008192947,0.000033735432],"domain_scores_gemma":[0.9996063,0.00018913337,0.000075356926,0.000021993683,0.000065130276,0.00004209215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007558527,0.00064854324,0.000600543,0.00043753957,0.00039053982,0.0012575489,0.0007023849,0.00067466294,0.0013849905],"category_scores_gemma":[0.0012556884,0.00041111317,0.0004957856,0.0002509192,0.0014847937,0.0009828334,0.0023031915,0.0008161814,0.00015133806],"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.00008844206,0.00004333808,0.00072225556,0.00007286773,0.0000554414,0.00016575029,0.00010047799,0.60598975,0.008207837,0.37311894,0.00064178277,0.010793182],"study_design_scores_gemma":[0.0000051983275,0.000017748436,0.00009034312,0.000004758349,0.0000038793833,0.000015081157,0.00001685161,0.9775524,0.0004969664,0.021420274,0.00037233648,0.0000042212714],"about_ca_topic_score_codex":0.0018445995,"about_ca_topic_score_gemma":0.0011986843,"teacher_disagreement_score":0.0018445995,"about_ca_system_score_codex":0.0008176437,"about_ca_system_score_gemma":0.0007107862,"threshold_uncertainty_score":0.0059324503},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035359457,0.004441925,0.9168801,0.0040865294,0.00034848874,0.000051418763,0.00034988642,0.0003584065,0.038123917],"genre_scores_gemma":[0.7137733,0.0068572164,0.21967904,0.0031518978,0.0016746115,0.0004133073,0.000832547,0.0011811052,0.052437026],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840933,0.0005760055,0.00007812247,0.00035499193,0.0004349002,0.00014676295],"domain_scores_gemma":[0.99284667,0.0049518016,0.00034553226,0.0006638469,0.0006901501,0.0005020733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004426892,0.0019823734,0.0013978487,0.0031643375,0.0014539646,0.004247357,0.0019358947,0.0024741585,0.006530331],"category_scores_gemma":[0.015538176,0.0011955366,0.0018823679,0.0014098341,0.0051095122,0.0077616163,0.004673817,0.0084783975,0.0009589375],"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.000011630601,0.000007749475,0.00011239793,0.00004814148,0.000013307096,0.000026207514,0.00008661137,0.001982052,0.0005291406,0.9921251,0.0013152033,0.0037424108],"study_design_scores_gemma":[0.0000064651053,0.000008968577,0.000093798924,0.000017400174,0.000008227856,0.000026902844,0.000021059332,0.010642881,0.00022595574,0.9866355,0.0023058455,0.0000070030437],"about_ca_topic_score_codex":0.0012458076,"about_ca_topic_score_gemma":0.0013036228,"teacher_disagreement_score":0.006530331,"about_ca_system_score_codex":0.0023707624,"about_ca_system_score_gemma":0.0009591175,"threshold_uncertainty_score":0.02341193},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028839588,0.00029576942,0.9667947,0.00028929042,0.00003840076,0.000056040393,0.000046567973,0.00011174326,0.0035279274],"genre_scores_gemma":[0.58602756,0.00094068784,0.3998027,0.00028467356,0.00010880153,0.00046308327,0.0003131254,0.0003371731,0.011722279],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761033,0.0010528535,0.00013632125,0.0003255943,0.00068538944,0.00018961813],"domain_scores_gemma":[0.9788263,0.014515947,0.00091109634,0.0014588507,0.0031844575,0.001103306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010065716,0.0012501375,0.0014157433,0.0024760764,0.00069041183,0.0027632997,0.002544403,0.0012622921,0.0035580264],"category_scores_gemma":[0.035158955,0.0006697544,0.0015515294,0.0011894426,0.0039127325,0.004069059,0.0050066225,0.0033295078,0.00059545727],"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.00012957795,0.000053548865,0.0009771258,0.0002424994,0.00007911889,0.00011105862,0.00023856954,0.18081702,0.003463639,0.7989694,0.0009016844,0.014016818],"study_design_scores_gemma":[0.000018529998,0.00008278111,0.00021970831,0.000038274073,0.00001611235,0.00004510222,0.000029039396,0.7932488,0.001954992,0.20351912,0.0008068432,0.000020854748],"about_ca_topic_score_codex":0.0018022062,"about_ca_topic_score_gemma":0.0014830212,"teacher_disagreement_score":0.010065716,"about_ca_system_score_codex":0.0018630631,"about_ca_system_score_gemma":0.002375417,"threshold_uncertainty_score":0.053233266},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042874003,0.00006291299,0.9947266,0.000043829506,0.00002138744,0.000034694986,0.000005077986,0.00003993437,0.00077803404],"genre_scores_gemma":[0.19311546,0.00017923789,0.80229986,0.00008023287,0.000031642794,0.00038612232,0.00005913841,0.000079349884,0.003768986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991223,0.00030835616,0.000053248612,0.00014865992,0.0003001232,0.00006733175],"domain_scores_gemma":[0.9988142,0.00056238857,0.000097894044,0.00011316923,0.00031520042,0.00009724197],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018582463,0.00070995145,0.00088940986,0.0006524088,0.00068465766,0.0009476217,0.0016041991,0.0015334695,0.0025289792],"category_scores_gemma":[0.003222904,0.00038032135,0.0011754793,0.0005085267,0.0015103035,0.0015304157,0.0023642234,0.0017654855,0.0004886644],"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.00027812496,0.00018066121,0.0011888521,0.0004486512,0.00014731393,0.00041178716,0.0008241734,0.33106115,0.024259564,0.49082014,0.0019508994,0.14842875],"study_design_scores_gemma":[0.000019703708,0.000119634184,0.0000788083,0.000017411443,0.000011348626,0.000085653344,0.000028156079,0.96342534,0.0026989589,0.031671613,0.0018236182,0.000019761554],"about_ca_topic_score_codex":0.00196331,"about_ca_topic_score_gemma":0.0016180412,"teacher_disagreement_score":0.0025289792,"about_ca_system_score_codex":0.00075406104,"about_ca_system_score_gemma":0.0016302096,"threshold_uncertainty_score":0.009827495},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003371903,0.00007185504,0.9938198,0.00013099966,0.000041335385,0.0000489637,0.000017084329,0.00014416243,0.0023540528],"genre_scores_gemma":[0.34038106,0.000300635,0.65133816,0.00028913427,0.00011144191,0.0005735592,0.00014222013,0.00019693463,0.006666871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990971,0.0003896086,0.000041210627,0.0001377844,0.00021365697,0.00012062032],"domain_scores_gemma":[0.9982653,0.0012768,0.00009285901,0.000074144875,0.00018566712,0.00010525265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016424975,0.00080498983,0.0011638391,0.0005440193,0.0004977925,0.0010449159,0.0012536412,0.0014354816,0.0042612953],"category_scores_gemma":[0.0044515445,0.00045511738,0.0005660475,0.00046055918,0.0011511035,0.0010353294,0.0018320933,0.0020351075,0.00088080176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010348334,0.00010039443,0.0004747786,0.000108215594,0.00005056947,0.00009247233,0.00013371983,0.80483395,0.0014770724,0.110973105,0.0024771828,0.079175],"study_design_scores_gemma":[0.000019804353,0.000025030393,0.000021465034,0.0000093164435,0.0000034024406,0.000016412576,0.0000075738676,0.9785499,0.00030372554,0.020134907,0.0009031077,0.000005353265],"about_ca_topic_score_codex":0.0023317346,"about_ca_topic_score_gemma":0.0020062192,"teacher_disagreement_score":0.0042612953,"about_ca_system_score_codex":0.000951654,"about_ca_system_score_gemma":0.0023794873,"threshold_uncertainty_score":0.0142554045},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009971638,0.00028571644,0.98776776,0.00009293422,0.000057667203,0.00007326945,0.00001519248,0.00005724649,0.0016785995],"genre_scores_gemma":[0.37403506,0.0009781477,0.61275035,0.00022594456,0.00022380812,0.000751087,0.00014856434,0.0001915609,0.010695512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979442,0.0008524076,0.00011850415,0.00029195295,0.0006655578,0.00012737827],"domain_scores_gemma":[0.99366957,0.0039544175,0.00042294164,0.00041195427,0.0012116985,0.00032955036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059676245,0.0015133864,0.0013375386,0.0013741696,0.00067784253,0.0014570325,0.0021632954,0.0018092694,0.0028158769],"category_scores_gemma":[0.018109644,0.00059258344,0.0017110899,0.0007116297,0.002551468,0.0033473757,0.0026629774,0.003571264,0.0005795192],"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.00026387148,0.000110267814,0.0011170511,0.00044760373,0.00018889831,0.00024372,0.0005210302,0.20222595,0.010929026,0.7272776,0.0011924665,0.055482537],"study_design_scores_gemma":[0.00003493067,0.00026364098,0.0002941338,0.00004979766,0.00003393063,0.00016767376,0.00004526067,0.8623982,0.003799221,0.13023868,0.0026324417,0.00004211671],"about_ca_topic_score_codex":0.0008312181,"about_ca_topic_score_gemma":0.00060917926,"teacher_disagreement_score":0.0059676245,"about_ca_system_score_codex":0.0012624785,"about_ca_system_score_gemma":0.001462188,"threshold_uncertainty_score":0.031560242},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037097685,0.019371338,0.51725936,0.10675576,0.029171513,0.000070700284,0.0008878765,0.0007233225,0.2886625],"genre_scores_gemma":[0.47976932,0.020303562,0.1691505,0.017701434,0.026863536,0.00018625021,0.0006546299,0.0008705525,0.2845003],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995685,0.00011110854,0.000024739635,0.00010625828,0.0001530652,0.000036174355],"domain_scores_gemma":[0.9978452,0.001256576,0.00008846928,0.00020249968,0.00041431136,0.00019293654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013014829,0.00074735284,0.0005143866,0.00065802294,0.0011000653,0.0019530999,0.00055215467,0.0012534824,0.010921024],"category_scores_gemma":[0.003912249,0.00027584398,0.00059780094,0.0007645328,0.0019505352,0.0036619855,0.0014607906,0.0049520396,0.0022199706],"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.000033233646,0.000023968321,0.0002894736,0.00008445374,0.0000070649967,0.00020648383,0.00031050507,0.0017603755,0.0026990608,0.89742345,0.06932976,0.027832154],"study_design_scores_gemma":[0.000013943948,0.00007380325,0.0010899651,0.00011104165,0.00001275182,0.00030956502,0.00022593465,0.010989523,0.0012626295,0.69169945,0.29416713,0.000044253346],"about_ca_topic_score_codex":0.002789421,"about_ca_topic_score_gemma":0.002310628,"teacher_disagreement_score":0.010921024,"about_ca_system_score_codex":0.0014704003,"about_ca_system_score_gemma":0.00086057914,"threshold_uncertainty_score":0.03653449},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008902666,0.00015090143,0.9874779,0.0001603553,0.00010463377,0.000048028753,0.000042471453,0.00022959588,0.002883357],"genre_scores_gemma":[0.0759359,0.00011125199,0.9138434,0.00012659693,0.00006722345,0.0001173474,0.00014412326,0.00025134656,0.009402809],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994758,0.0001796731,0.000027184695,0.000089764995,0.00014438503,0.00008326898],"domain_scores_gemma":[0.9990503,0.0003893332,0.000045423905,0.0001619623,0.00024029658,0.00011264762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021377658,0.00068488246,0.0013463559,0.0012060106,0.0012263948,0.0012079144,0.002226247,0.0022007392,0.008728226],"category_scores_gemma":[0.0039590592,0.00060625304,0.0010723022,0.00096614106,0.001232661,0.0018844177,0.0020585125,0.0022751724,0.0018602535],"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.0004463884,0.00023005503,0.001184994,0.00018793133,0.00008842352,0.00012704021,0.00020738202,0.25953233,0.0038892645,0.348693,0.013355737,0.37205747],"study_design_scores_gemma":[0.000048054415,0.000075076074,0.00015449483,0.000026322155,0.0000114815675,0.000042423082,0.000033377455,0.9278169,0.001179342,0.0635392,0.0070490805,0.000024175633],"about_ca_topic_score_codex":0.006515498,"about_ca_topic_score_gemma":0.007881691,"teacher_disagreement_score":0.008728226,"about_ca_system_score_codex":0.0011231407,"about_ca_system_score_gemma":0.0023560186,"threshold_uncertainty_score":0.029198885},"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":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4858188,0.0011165021,0.4728701,0.0013996296,0.00033808025,0.00009273353,0.00009737463,0.00016956156,0.038097303],"genre_scores_gemma":[0.9139686,0.0006396317,0.07480923,0.00029369694,0.00025265868,0.00010120819,0.000077831886,0.00006468583,0.009792419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959916,0.00011705826,0.000029841016,0.000073265415,0.00013667264,0.000044053737],"domain_scores_gemma":[0.99941385,0.00022052716,0.00011586327,0.000076197386,0.00008480263,0.000088709814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008972662,0.00043475293,0.00029644056,0.00054087496,0.00058449805,0.00085061224,0.00038025464,0.0007514292,0.001788054],"category_scores_gemma":[0.0018939134,0.0001908916,0.0006049786,0.0002159521,0.0015524544,0.0021773838,0.001542114,0.0014305845,0.00020022356],"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.00002346741,0.000018611989,0.00022463739,0.00005256353,0.0000070829055,0.00026741586,0.00022482964,0.0024593906,0.016691342,0.97318447,0.00034767613,0.0064985217],"study_design_scores_gemma":[0.0000181727,0.00013004603,0.00074959896,0.000023582554,0.000011341566,0.0010266186,0.0002603602,0.05035075,0.008396058,0.93255174,0.0064581702,0.00002355594],"about_ca_topic_score_codex":0.000075799806,"about_ca_topic_score_gemma":0.00008698785,"teacher_disagreement_score":0.001788054,"about_ca_system_score_codex":0.00031307485,"about_ca_system_score_gemma":0.0003245135,"threshold_uncertainty_score":0.005981624},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025322933,0.0008967372,0.9644661,0.00061003777,0.00007618502,0.00017863698,0.00004277278,0.000053884643,0.0083527295],"genre_scores_gemma":[0.5747766,0.002584893,0.4084165,0.0003209515,0.00018272334,0.00080993,0.00018628869,0.00022694879,0.0124952365],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989139,0.0006898449,0.000040531097,0.000092887,0.00016561174,0.000097213466],"domain_scores_gemma":[0.99292326,0.006032437,0.00022855127,0.00008349505,0.0005639594,0.00016824181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005641526,0.0022899548,0.002766742,0.0028597098,0.0013706518,0.002474083,0.0017713947,0.0034644227,0.003449512],"category_scores_gemma":[0.016868725,0.0013049839,0.0017686741,0.0021161647,0.0026137787,0.0022468197,0.0035683482,0.0023441892,0.0003136541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007856485,0.00009436471,0.00029708204,0.0001780084,0.000052934764,0.00009171927,0.00013975558,0.93636006,0.0006487203,0.047986545,0.0008055774,0.013266742],"study_design_scores_gemma":[0.000010401123,0.0000323958,0.000047427893,0.000018987004,0.000008252736,0.000008375602,0.000025554633,0.983723,0.0001198778,0.015749108,0.00024901732,0.0000075790604],"about_ca_topic_score_codex":0.0049121557,"about_ca_topic_score_gemma":0.00318896,"teacher_disagreement_score":0.005641526,"about_ca_system_score_codex":0.0012051975,"about_ca_system_score_gemma":0.0018762999,"threshold_uncertainty_score":0.029835582},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11382874,0.0030899444,0.8513661,0.0026270389,0.00027015354,0.0001136248,0.00013072122,0.00062902324,0.027944705],"genre_scores_gemma":[0.7127855,0.0014030793,0.27132216,0.0006652332,0.00025503171,0.00028859577,0.00042323765,0.0005659953,0.0122911865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99814856,0.0009051375,0.00005450604,0.00025306325,0.00045007217,0.00018873584],"domain_scores_gemma":[0.98890686,0.008566942,0.00043474894,0.0006307864,0.0009747424,0.0004859221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056514,0.0008588683,0.0013732604,0.0017197202,0.0012843516,0.002178105,0.002606115,0.0023408683,0.004048214],"category_scores_gemma":[0.03858908,0.0006071094,0.0007794868,0.001061758,0.0031812477,0.0029378529,0.0041823415,0.002996734,0.0007941251],"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.00053188455,0.0001217429,0.003965918,0.00026066953,0.00009839672,0.00016125022,0.0003384354,0.23868002,0.0030903348,0.67963165,0.00645532,0.06666436],"study_design_scores_gemma":[0.000025604768,0.000050467246,0.00033631054,0.000051528135,0.000010410593,0.000048563692,0.000040099698,0.89677393,0.00043391623,0.100860365,0.0013525342,0.000016288439],"about_ca_topic_score_codex":0.0059273625,"about_ca_topic_score_gemma":0.0045828717,"teacher_disagreement_score":0.0059273625,"about_ca_system_score_codex":0.0017218154,"about_ca_system_score_gemma":0.0019846407,"threshold_uncertainty_score":0.029887795},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004670939,0.00022099193,0.9927119,0.00005887144,0.000027808317,0.000024244322,0.000008361395,0.00013753722,0.0021392663],"genre_scores_gemma":[0.42799008,0.0008198835,0.56317246,0.00012062344,0.00008710148,0.00037232242,0.00014697753,0.00013807826,0.0071524433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994685,0.00010756815,0.000033989374,0.00009764907,0.00022820682,0.0000642178],"domain_scores_gemma":[0.9995962,0.00015363263,0.000041139145,0.000030767897,0.00016304741,0.000015361758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011400877,0.00081014563,0.0013976549,0.000811214,0.0006082614,0.0009069467,0.0012348185,0.0011076402,0.0018229472],"category_scores_gemma":[0.0016861494,0.00038834775,0.0010691833,0.00078520895,0.0006600523,0.0011150494,0.00079593284,0.001248289,0.00042455745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062285224,0.000033837092,0.0005394597,0.0001243617,0.000066491666,0.00007156894,0.00013487921,0.87567276,0.005223104,0.025481595,0.0016382599,0.09095129],"study_design_scores_gemma":[0.000012832469,0.000021160313,0.00008708711,0.000006666679,0.000007898725,0.00001930054,0.000005266299,0.9960679,0.0005822739,0.002381489,0.00080252823,0.0000056228278],"about_ca_topic_score_codex":0.007257581,"about_ca_topic_score_gemma":0.0039505106,"teacher_disagreement_score":0.007257581,"about_ca_system_score_codex":0.0008562881,"about_ca_system_score_gemma":0.0013602199,"threshold_uncertainty_score":0.014430702},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037408482,0.001985664,0.93978035,0.0010962975,0.00027798626,0.00006095051,0.00019293356,0.00011524711,0.019082135],"genre_scores_gemma":[0.55774003,0.0071066045,0.3775917,0.0009811618,0.0017891927,0.00062269566,0.0015463881,0.0012674311,0.051354863],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9937163,0.0034186307,0.00040348148,0.0006920601,0.0014036335,0.00036594583],"domain_scores_gemma":[0.9827732,0.012824862,0.00095836003,0.0008939985,0.0015332028,0.0010163576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008495162,0.0024836196,0.0027273758,0.0038191862,0.0014481043,0.005441641,0.002942375,0.0018503105,0.007734407],"category_scores_gemma":[0.030085625,0.0020965044,0.0024849453,0.0038447932,0.00467943,0.0120637715,0.007251149,0.006036494,0.00093795557],"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.000082080915,0.00004478923,0.0003846466,0.00012322614,0.00010351794,0.00007882322,0.00020985055,0.017318957,0.00083588855,0.9612811,0.0020745469,0.017462598],"study_design_scores_gemma":[0.000008143491,0.00003059816,0.00020564164,0.000041950396,0.000032276857,0.000091991446,0.000077766264,0.09539456,0.00031098974,0.902158,0.0016308401,0.000017177637],"about_ca_topic_score_codex":0.0010620833,"about_ca_topic_score_gemma":0.0011540321,"teacher_disagreement_score":0.008495162,"about_ca_system_score_codex":0.0017071669,"about_ca_system_score_gemma":0.001138565,"threshold_uncertainty_score":0.0449273},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20425782,0.0017445689,0.38518357,0.0045163934,0.00097604305,0.00006556703,0.00032836458,0.0006105743,0.4023171],"genre_scores_gemma":[0.8920012,0.000771283,0.062055785,0.0011777637,0.000448562,0.00010247677,0.00022440626,0.00030116233,0.04291737],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994394,0.000106214364,0.00003259025,0.00013678601,0.00016944898,0.00011554722],"domain_scores_gemma":[0.99957067,0.00014592346,0.000028134553,0.00006552743,0.00010944024,0.00008042428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001000625,0.00053667935,0.0005631182,0.0013069347,0.0013017303,0.0016709747,0.0010710122,0.00087841775,0.0074415933],"category_scores_gemma":[0.0020340541,0.00030207064,0.0009441197,0.00092920347,0.0024661336,0.0052563124,0.003124574,0.0026627888,0.0011122428],"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.00000838779,0.000008081404,0.0000752832,0.000012344984,0.000001971473,0.000036122205,0.0000841709,0.0002630977,0.00027152724,0.99544674,0.00068176066,0.0031106416],"study_design_scores_gemma":[0.000008870359,0.000011204174,0.00013223826,0.000014775469,0.000005146633,0.000049690232,0.00004489117,0.0053531863,0.00033764634,0.9882207,0.0058133667,0.000008304585],"about_ca_topic_score_codex":0.0014758334,"about_ca_topic_score_gemma":0.0015937937,"teacher_disagreement_score":0.0074415933,"about_ca_system_score_codex":0.0016343816,"about_ca_system_score_gemma":0.00055591745,"threshold_uncertainty_score":0.024894595},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01602288,0.0016273916,0.97288066,0.0014036419,0.00024738992,0.000026062049,0.00011605231,0.000060956478,0.007614948],"genre_scores_gemma":[0.67208993,0.006266849,0.26330194,0.0010400105,0.0016104148,0.0002781482,0.000929065,0.0007700446,0.053713553],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99862933,0.00069023663,0.00005901849,0.00019402977,0.00032567084,0.00010161232],"domain_scores_gemma":[0.9948279,0.0030603162,0.00041741118,0.00030139566,0.00094050396,0.00045236218],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030182148,0.0012003067,0.0013674266,0.0022632603,0.0006691588,0.002983904,0.0020072295,0.0021200418,0.0038592827],"category_scores_gemma":[0.011806671,0.00072359346,0.0010923945,0.0015009571,0.0032775528,0.003847104,0.0033218896,0.003742139,0.0006135368],"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.000022502905,0.000017528291,0.00021940275,0.00006231993,0.000029745397,0.00003262895,0.00005476366,0.03456193,0.0010935711,0.95077866,0.0014866012,0.011640353],"study_design_scores_gemma":[0.000007780008,0.000023266362,0.00021167191,0.000024586578,0.000010017815,0.000044582102,0.000029387495,0.32353747,0.00032916406,0.6725506,0.0032111197,0.000020386662],"about_ca_topic_score_codex":0.0029694834,"about_ca_topic_score_gemma":0.0026301288,"teacher_disagreement_score":0.0038592827,"about_ca_system_score_codex":0.0022375176,"about_ca_system_score_gemma":0.0016497658,"threshold_uncertainty_score":0.016234398},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026227394,0.00025777056,0.99489516,0.000088527035,0.000030416893,0.00003307853,0.00000929621,0.000021687347,0.0020412663],"genre_scores_gemma":[0.19517677,0.0012808555,0.79427475,0.00022291389,0.00017975291,0.00060328055,0.00011888252,0.00013578933,0.0080069965],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986682,0.0005286789,0.00009063038,0.00018626213,0.0004496602,0.000076627795],"domain_scores_gemma":[0.99869174,0.00069375546,0.00014728896,0.00013001192,0.00028066218,0.00005662958],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002430648,0.0016236217,0.0010415557,0.0008753964,0.0005934456,0.0011717025,0.0020508352,0.0018667671,0.0022597923],"category_scores_gemma":[0.0055995127,0.0005790943,0.0016193143,0.0007455305,0.002098949,0.0022267618,0.0031364453,0.0029481007,0.0004336065],"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.000036291633,0.00004969546,0.00045978435,0.00042000966,0.00010675691,0.00018142929,0.00040545597,0.24573752,0.007823068,0.70624363,0.0007444824,0.037791863],"study_design_scores_gemma":[0.000016624896,0.00004370767,0.00007711048,0.000038406408,0.000017438098,0.000084991574,0.00003867107,0.9022304,0.001440955,0.09232302,0.0036715434,0.0000172451],"about_ca_topic_score_codex":0.001831517,"about_ca_topic_score_gemma":0.0020353226,"teacher_disagreement_score":0.002430648,"about_ca_system_score_codex":0.0009916768,"about_ca_system_score_gemma":0.0015813231,"threshold_uncertainty_score":0.012854636},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018326256,0.0006438024,0.9712677,0.0008543963,0.00009879788,0.00016053341,0.0000729658,0.00006796019,0.008507627],"genre_scores_gemma":[0.5416451,0.0018351341,0.43876964,0.0009959973,0.00040181278,0.0017151951,0.00040346125,0.00035919267,0.013874449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99664766,0.0015825267,0.00014992846,0.00045906333,0.0009170096,0.00024385993],"domain_scores_gemma":[0.99098176,0.0061325557,0.00048271698,0.00040803503,0.0013633016,0.0006316749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009562262,0.002613304,0.0018522921,0.002063194,0.0015620526,0.0024642926,0.0027843586,0.0027223222,0.004971611],"category_scores_gemma":[0.021034434,0.0010044283,0.0033608656,0.0011063041,0.004649047,0.0056402986,0.008656666,0.007094144,0.00069528574],"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.000103011975,0.00006842485,0.0009141864,0.00044360198,0.00014306106,0.00028513616,0.0006652,0.057304993,0.004883055,0.9189431,0.0013639369,0.0148822265],"study_design_scores_gemma":[0.000043825326,0.00020168994,0.00029980936,0.00011230233,0.000036790698,0.00018886778,0.00015640214,0.6149144,0.0017483556,0.37906688,0.0031923356,0.000038244594],"about_ca_topic_score_codex":0.0014792623,"about_ca_topic_score_gemma":0.001350286,"teacher_disagreement_score":0.009562262,"about_ca_system_score_codex":0.0019300871,"about_ca_system_score_gemma":0.0026739505,"threshold_uncertainty_score":0.050570726},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40083852,0.0020948579,0.52430797,0.0015356534,0.00038722894,0.00014275835,0.0002989176,0.00042647132,0.06996772],"genre_scores_gemma":[0.9261701,0.0007239458,0.047190428,0.00014429979,0.00017894425,0.00021835192,0.00015056336,0.000059076112,0.025164178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923825,0.00025261287,0.000047043286,0.0001208806,0.00026273495,0.00007849515],"domain_scores_gemma":[0.9989195,0.00045648997,0.0001534351,0.00010361314,0.00018826046,0.00017881485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011485405,0.00034814642,0.0003765833,0.0007510923,0.00076151884,0.0014086579,0.00038423747,0.0003151126,0.0031761713],"category_scores_gemma":[0.0020232343,0.00023516138,0.00063050084,0.0003253133,0.002039306,0.0017072968,0.0015377532,0.0011235949,0.0004373638],"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.000033531138,0.000013210038,0.0001908297,0.00003653947,0.000009059674,0.00022447674,0.000866597,0.0019685838,0.005423163,0.9871136,0.00030973475,0.003810637],"study_design_scores_gemma":[0.000026854319,0.00006526194,0.00053442543,0.00001986817,0.000009451021,0.00032116345,0.0003911357,0.023332993,0.0031801658,0.9642342,0.007865493,0.00001888227],"about_ca_topic_score_codex":0.00072597817,"about_ca_topic_score_gemma":0.000669442,"teacher_disagreement_score":0.0031761713,"about_ca_system_score_codex":0.0007994941,"about_ca_system_score_gemma":0.00060341397,"threshold_uncertainty_score":0.010625362},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72585183,0.00073449564,0.26156825,0.00044403187,0.0000897782,0.00008473733,0.000120271776,0.00005080607,0.011055742],"genre_scores_gemma":[0.9750763,0.00019955031,0.020880515,0.000036981914,0.00007002584,0.0000994892,0.0000931398,0.000020650208,0.003523403],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989704,0.00032236453,0.000072232324,0.0002610209,0.00028104638,0.00009291653],"domain_scores_gemma":[0.9961599,0.0021151633,0.0005958399,0.00015542953,0.0005220559,0.00045153766],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029993667,0.0006090237,0.0006815523,0.0019129635,0.0009489938,0.0023675999,0.0007871985,0.00078458973,0.0030350664],"category_scores_gemma":[0.0048895427,0.00040484854,0.0010640656,0.00052470336,0.0026311583,0.0022241508,0.001618032,0.0013073942,0.00020767548],"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.00017504598,0.00008091609,0.0022390739,0.000113944894,0.000059426362,0.0007591029,0.0017042239,0.011077573,0.019617643,0.9588712,0.00033837167,0.004963478],"study_design_scores_gemma":[0.000059774407,0.00038144583,0.0029723113,0.00005504324,0.000045982764,0.0008750842,0.0011574407,0.19147746,0.008472165,0.7915049,0.00294482,0.000053616037],"about_ca_topic_score_codex":0.0003755662,"about_ca_topic_score_gemma":0.00021307803,"teacher_disagreement_score":0.0030350664,"about_ca_system_score_codex":0.00095118524,"about_ca_system_score_gemma":0.00040595036,"threshold_uncertainty_score":0.015862346},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013860594,0.0019238068,0.9689904,0.0018166669,0.00020815947,0.00004881905,0.00013201474,0.00011992518,0.0128995925],"genre_scores_gemma":[0.71123284,0.004942742,0.25471517,0.0019041635,0.0013514283,0.0007041322,0.00033775176,0.0004649897,0.024346758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997865,0.0009625262,0.00010735625,0.00042327616,0.00046806844,0.00017378226],"domain_scores_gemma":[0.9902282,0.007657627,0.00052753236,0.000448265,0.0008613717,0.0002770407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074375337,0.0016055477,0.0019493316,0.0013383714,0.0008607592,0.002472949,0.0020139778,0.002275458,0.004457302],"category_scores_gemma":[0.016427021,0.0006988192,0.0014504499,0.00091781263,0.0030398476,0.0058176285,0.0030557185,0.005604336,0.0006617227],"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.000055735683,0.00003613581,0.0002980289,0.00014722256,0.000067336194,0.00019806974,0.00012305094,0.0336716,0.001723435,0.9503882,0.002721046,0.010570174],"study_design_scores_gemma":[0.00004346407,0.00009592789,0.00035074548,0.00007837355,0.00003184421,0.00020459367,0.000038134636,0.265267,0.0012509114,0.7285378,0.0040713605,0.000029789118],"about_ca_topic_score_codex":0.0004845141,"about_ca_topic_score_gemma":0.00034026368,"teacher_disagreement_score":0.0074375337,"about_ca_system_score_codex":0.0015394344,"about_ca_system_score_gemma":0.0011610985,"threshold_uncertainty_score":0.03933388},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017586445,0.002271123,0.96721363,0.00048280784,0.0001682193,0.000045053017,0.00018184455,0.00010822797,0.0119426325],"genre_scores_gemma":[0.39926285,0.006520446,0.5541032,0.00034544512,0.00061603426,0.00021993191,0.00096989487,0.00044188683,0.037520226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994307,0.00026171212,0.000045192228,0.000101941274,0.00013349061,0.000026958938],"domain_scores_gemma":[0.99784124,0.0010091235,0.00015395449,0.0003991954,0.00046228693,0.00013429673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021029548,0.00074056594,0.0007879332,0.0011243835,0.00024012467,0.0013568973,0.00086065417,0.0006059732,0.005407218],"category_scores_gemma":[0.006999296,0.00039116168,0.0007558837,0.0014899842,0.0010029451,0.0025280926,0.001540361,0.003409226,0.0013876059],"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.00008129184,0.00003653377,0.00048653872,0.000194308,0.000020637703,0.00008896552,0.00032710502,0.023794867,0.005317298,0.83490545,0.0054520783,0.12929495],"study_design_scores_gemma":[0.000017594242,0.00012262612,0.00055221684,0.00007975858,0.00002015607,0.0002900176,0.0001545749,0.3980097,0.0027791953,0.5641112,0.033840455,0.000022507693],"about_ca_topic_score_codex":0.001042812,"about_ca_topic_score_gemma":0.0009032686,"teacher_disagreement_score":0.005407218,"about_ca_system_score_codex":0.00060034863,"about_ca_system_score_gemma":0.0003392201,"threshold_uncertainty_score":0.018088937},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018958211,0.00084690703,0.96374923,0.00034133036,0.00004826773,0.00008825306,0.00007518207,0.00029723975,0.015595503],"genre_scores_gemma":[0.19955936,0.00068210426,0.7941121,0.00009178414,0.00006258286,0.00025565326,0.00021781972,0.00032981668,0.0046887673],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985875,0.0006940724,0.00006891017,0.00014079544,0.00043410176,0.00007458005],"domain_scores_gemma":[0.9855334,0.012881086,0.00034338867,0.00048255228,0.00058154087,0.00017800744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034713259,0.0010623514,0.0012648839,0.001740881,0.0010077073,0.0024307661,0.0021942118,0.0016415047,0.0079156635],"category_scores_gemma":[0.026849072,0.0013807768,0.001349658,0.0019652897,0.0026687193,0.0044313977,0.0031639736,0.0034602175,0.0009809854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005374861,0.00017004783,0.0011226637,0.00062628166,0.000068263966,0.00010376671,0.00066140835,0.4236675,0.0035930513,0.42003316,0.0039859815,0.14543033],"study_design_scores_gemma":[0.000037425616,0.00006300332,0.00012762133,0.00010933388,0.000013999756,0.000057784946,0.000094570976,0.8454989,0.001165302,0.15020514,0.0026103768,0.000016535467],"about_ca_topic_score_codex":0.0015083997,"about_ca_topic_score_gemma":0.0016480719,"teacher_disagreement_score":0.0079156635,"about_ca_system_score_codex":0.00091940956,"about_ca_system_score_gemma":0.0011348699,"threshold_uncertainty_score":0.026480556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036495908,0.00015806979,0.9918092,0.00012974719,0.000087465676,0.00004841017,0.0000596769,0.00040929488,0.0036484355],"genre_scores_gemma":[0.08949235,0.00020181846,0.8999718,0.00015979442,0.00010259479,0.0001984199,0.00027477244,0.00050822075,0.009090288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990127,0.00039419087,0.00004258605,0.00018841418,0.00027844723,0.00008359824],"domain_scores_gemma":[0.99842215,0.0005529987,0.00007265302,0.00050338474,0.00034382625,0.000105045045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018389401,0.0009183288,0.0015346945,0.0010251387,0.0011433031,0.0014734524,0.00280494,0.002697315,0.010714774],"category_scores_gemma":[0.0056428397,0.0007642679,0.00114667,0.001581506,0.0010169235,0.002025155,0.0022342254,0.0019796847,0.0030601257],"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.00030585116,0.00023660506,0.00070112187,0.00016406801,0.00011894034,0.00010828949,0.00009903182,0.44435528,0.005695408,0.2236539,0.012970025,0.31159148],"study_design_scores_gemma":[0.000041318053,0.000033141692,0.00009688289,0.000012361878,0.000014363612,0.000042032927,0.000008858622,0.96118605,0.0012809066,0.03018596,0.0070805983,0.000017381628],"about_ca_topic_score_codex":0.0036693767,"about_ca_topic_score_gemma":0.00490731,"teacher_disagreement_score":0.010714774,"about_ca_system_score_codex":0.0012705033,"about_ca_system_score_gemma":0.0023420013,"threshold_uncertainty_score":0.035844445},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118658714,0.0069953664,0.78173786,0.010095162,0.0019285219,0.00015645023,0.000495626,0.00015340753,0.079778895],"genre_scores_gemma":[0.8276266,0.0027773613,0.081069194,0.0013386321,0.0012188256,0.0002862475,0.0003722982,0.00035638618,0.08495446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874735,0.0006057448,0.00008336302,0.0001962995,0.00024745293,0.00011983959],"domain_scores_gemma":[0.9964998,0.0023140062,0.0002635828,0.00018005737,0.00036882813,0.00037369825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036398568,0.0014713956,0.0023697002,0.0025220406,0.00165771,0.004322358,0.0022002368,0.00482604,0.006954678],"category_scores_gemma":[0.012369353,0.0011706008,0.0017078122,0.0016788442,0.004720719,0.0056792144,0.0057260753,0.0039569857,0.00041118768],"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.000033900527,0.00003252207,0.00016310909,0.00008915515,0.000033448712,0.00009318863,0.000060512884,0.03488405,0.00058797747,0.96120006,0.0008082694,0.0020138153],"study_design_scores_gemma":[0.000023829418,0.000024151645,0.00025174368,0.000038311115,0.000023597799,0.00011593265,0.0000710474,0.32519484,0.00039556113,0.67170054,0.0021347073,0.000025689364],"about_ca_topic_score_codex":0.0030951397,"about_ca_topic_score_gemma":0.0021832888,"teacher_disagreement_score":0.006954678,"about_ca_system_score_codex":0.0037563236,"about_ca_system_score_gemma":0.0016789824,"threshold_uncertainty_score":0.027254224},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010034311,0.00032006195,0.9716573,0.0011214928,0.00009508283,0.00007821152,0.00020976286,0.000047726648,0.016436018],"genre_scores_gemma":[0.4901711,0.0018434105,0.47808588,0.0011902844,0.00084960595,0.00095581904,0.001066013,0.0003813324,0.025456429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983505,0.00074486976,0.00008631617,0.00028056788,0.00041047833,0.00012729286],"domain_scores_gemma":[0.99795413,0.001089014,0.00024595537,0.00015516368,0.00036305017,0.00019271173],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036882854,0.0011786041,0.00090364827,0.00092565955,0.0006935225,0.0018755837,0.0013631618,0.0015588588,0.006647933],"category_scores_gemma":[0.007441611,0.0006074431,0.001193052,0.0009795228,0.00263246,0.0043726605,0.0029157654,0.0040539433,0.0006883413],"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.000006553867,0.000015571602,0.00008421285,0.000046500056,0.000009502132,0.000048656457,0.00006915543,0.020986736,0.0005942071,0.97372675,0.0009702703,0.0034420353],"study_design_scores_gemma":[0.000017544964,0.00003179489,0.00011487054,0.000036486657,0.000007710032,0.00005030594,0.000055154087,0.25358397,0.00037983764,0.7396365,0.006070443,0.00001529269],"about_ca_topic_score_codex":0.0015325579,"about_ca_topic_score_gemma":0.0017640389,"teacher_disagreement_score":0.006647933,"about_ca_system_score_codex":0.0015381507,"about_ca_system_score_gemma":0.0019138112,"threshold_uncertainty_score":0.022239566},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.072146416,0.0007227888,0.9074934,0.0011084024,0.00017782433,0.000088178815,0.00009559223,0.00010886658,0.018058484],"genre_scores_gemma":[0.6061878,0.0011226132,0.36834398,0.00065666554,0.00034912114,0.00039870277,0.00025615602,0.00023108664,0.022453945],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846065,0.0006464051,0.000070020644,0.00024957667,0.00041227072,0.00016107704],"domain_scores_gemma":[0.99881446,0.0005577504,0.00015433408,0.000100260295,0.00021443948,0.00015879718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026377663,0.0013905765,0.0009272365,0.001362359,0.0007138202,0.0020378898,0.0012876071,0.0021434154,0.0036869035],"category_scores_gemma":[0.005390319,0.00051703805,0.0014537063,0.0007069945,0.003719957,0.00314743,0.0037195452,0.0025782762,0.00036787038],"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.000019100466,0.000017758417,0.00016387468,0.00006709772,0.000021289057,0.00009533808,0.00012788415,0.017489897,0.0024166158,0.9731838,0.00068624335,0.005711035],"study_design_scores_gemma":[0.000016587317,0.000032268556,0.00007960257,0.000023293514,0.000007967232,0.00010181557,0.00008992161,0.16867414,0.000678095,0.8283574,0.0019174344,0.000021497315],"about_ca_topic_score_codex":0.0007306096,"about_ca_topic_score_gemma":0.0006334037,"teacher_disagreement_score":0.0036869035,"about_ca_system_score_codex":0.0010825967,"about_ca_system_score_gemma":0.0010061916,"threshold_uncertainty_score":0.01394999},"labels":[],"label_agreement":null},{"id":"W2951241939","doi":"10.1007/s11228-019-00519-y","title":"New Sharp Necessary Optimality Conditions for Mathematical Programs with Equilibrium Constraints","year":2019,"lang":"en","type":"preprint","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Austrian Science Fund","keywords":"Complementarity (molecular biology); Constraint (computer-aided design); Mathematical optimization; Parametric statistics; Mathematics; Mixed complementarity problem; Mathematical economics; Cone (formal languages); Applied mathematics; Computer science; Algorithm; Nonlinear system; Geometry; Physics","score_opus":0.03173994879061303,"score_gpt":0.2952924408431884,"score_spread":0.26355249205257536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951241939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016463386,0.0011896621,0.9495219,0.0016924859,0.0004521438,0.0002096165,0.0006730373,0.00027974986,0.029518023],"genre_scores_gemma":[0.46824068,0.003244269,0.49323776,0.0021207272,0.0013059606,0.0017211386,0.0013612256,0.0010256331,0.027742663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979499,0.0007000826,0.00015608751,0.00035743814,0.0005701037,0.0002664259],"domain_scores_gemma":[0.99318355,0.004694758,0.0004981432,0.00031122746,0.0008995639,0.00041282678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004734526,0.002705671,0.00199961,0.0035077427,0.0014040646,0.003535495,0.0029285983,0.0032679292,0.014865625],"category_scores_gemma":[0.020040281,0.0021433604,0.0025988123,0.0019261644,0.002874732,0.0077652824,0.0041187666,0.00933657,0.001809564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006058223,0.000066980254,0.00016524168,0.00024900094,0.000031110976,0.00012534244,0.00015421677,0.012680013,0.0027516629,0.96966773,0.003969637,0.010078597],"study_design_scores_gemma":[0.00004544754,0.000058673937,0.00025106932,0.00010387521,0.00003420156,0.00007896375,0.00006874708,0.10547859,0.0016836334,0.88697654,0.005187026,0.000033278906],"about_ca_topic_score_codex":0.00086845335,"about_ca_topic_score_gemma":0.0014239685,"teacher_disagreement_score":0.014865625,"about_ca_system_score_codex":0.002049811,"about_ca_system_score_gemma":0.0022838938,"threshold_uncertainty_score":0.04973048},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012740333,0.0007899126,0.9811249,0.000555442,0.000065343906,0.000081144855,0.000042583273,0.000081293576,0.0045190635],"genre_scores_gemma":[0.33742288,0.0015290465,0.6545823,0.0007639173,0.00014409595,0.0003588149,0.00032891694,0.00031323638,0.0045568347],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958752,0.0025979322,0.0001770159,0.00043063218,0.00067824393,0.0002410768],"domain_scores_gemma":[0.9822481,0.013125254,0.0010127467,0.0009924648,0.0022112734,0.00041012606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.013281703,0.0019252728,0.001964324,0.0024244436,0.0012513804,0.0017035316,0.00167531,0.0028015196,0.0024073],"category_scores_gemma":[0.037952516,0.0008981554,0.0016639204,0.0017385433,0.0046233786,0.003354161,0.0022812192,0.0031659745,0.0004878427],"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.00014636018,0.000075737924,0.0011393885,0.00029578005,0.00010634919,0.00015268434,0.000278399,0.65049165,0.0015355194,0.32128114,0.0023712046,0.022125822],"study_design_scores_gemma":[0.00002213276,0.00008015989,0.00017530534,0.0001064624,0.000015041975,0.00005330255,0.000052136715,0.92089343,0.00096398627,0.07641114,0.0012041465,0.000022796838],"about_ca_topic_score_codex":0.0043104943,"about_ca_topic_score_gemma":0.003768429,"teacher_disagreement_score":0.013281703,"about_ca_system_score_codex":0.0024446948,"about_ca_system_score_gemma":0.0027242145,"threshold_uncertainty_score":0.07024121},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029018862,0.00014210447,0.9674222,0.00018407601,0.000041882482,0.00001359375,0.000020520509,0.00010302338,0.0030536335],"genre_scores_gemma":[0.65788114,0.0006772439,0.3312221,0.00017139337,0.0001899123,0.00008159214,0.00009617608,0.00027092587,0.009409482],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903667,0.00038687597,0.000032541288,0.0001288616,0.00034759636,0.00006750239],"domain_scores_gemma":[0.9983302,0.0008335101,0.000145429,0.00022482441,0.00028714866,0.00017887817],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026487946,0.0006056565,0.0009250838,0.0013750048,0.0005452951,0.0015663324,0.0009279604,0.0010753957,0.0017149689],"category_scores_gemma":[0.005962835,0.00049637764,0.0009802511,0.0009148617,0.0021870078,0.0026045525,0.003051819,0.002090985,0.0003936527],"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.00007783326,0.000040177012,0.00041079192,0.00007170412,0.00004444485,0.00008547089,0.00023871938,0.14241536,0.006825739,0.82641923,0.0010932785,0.022277243],"study_design_scores_gemma":[0.000010778255,0.000051346728,0.0001411702,0.000010910279,0.000011641211,0.00005957205,0.000041342624,0.70191574,0.0019751,0.29391828,0.0018466482,0.00001742178],"about_ca_topic_score_codex":0.00067868805,"about_ca_topic_score_gemma":0.0005534321,"teacher_disagreement_score":0.0026487946,"about_ca_system_score_codex":0.00094665703,"about_ca_system_score_gemma":0.0006934865,"threshold_uncertainty_score":0.014008343},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007885088,0.0015842486,0.97307056,0.0008188215,0.00013052637,0.00005735134,0.00011940274,0.00011575239,0.016218219],"genre_scores_gemma":[0.3325648,0.011180438,0.6172868,0.0016570152,0.0012320599,0.00069855753,0.00077537855,0.0012209568,0.0333839],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973596,0.0015677637,0.00009447313,0.0003102524,0.00052717957,0.00014070253],"domain_scores_gemma":[0.995218,0.0031204093,0.00026193826,0.00044321438,0.00071297534,0.0002433959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004965948,0.0016518161,0.0013038495,0.0017033848,0.0010675641,0.0020993843,0.0012039572,0.0015095932,0.007419233],"category_scores_gemma":[0.016615586,0.00080919935,0.0011913888,0.0023598752,0.0041868063,0.0064617232,0.0046432824,0.0059260223,0.0018967052],"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.00003814517,0.000024313693,0.00022311341,0.00012648296,0.00001658578,0.00007557492,0.00015186844,0.016879505,0.0011718055,0.949951,0.0032451265,0.028096413],"study_design_scores_gemma":[0.000020214275,0.00006679168,0.00021103933,0.00007301418,0.000014185227,0.00014550712,0.000054806114,0.14455175,0.0012636236,0.84237814,0.011201824,0.000019128547],"about_ca_topic_score_codex":0.0012433574,"about_ca_topic_score_gemma":0.0008644406,"teacher_disagreement_score":0.007419233,"about_ca_system_score_codex":0.001175204,"about_ca_system_score_gemma":0.0013412833,"threshold_uncertainty_score":0.02626276},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06923375,0.0017672318,0.9048992,0.00081109634,0.00027912806,0.000058068938,0.0001150749,0.0001495593,0.02268693],"genre_scores_gemma":[0.72037953,0.002293433,0.25535244,0.00027328584,0.00040074834,0.00027157422,0.00027244037,0.0001886378,0.020567818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992029,0.00028889487,0.000046212863,0.00012881166,0.00023602514,0.00009707092],"domain_scores_gemma":[0.9992543,0.00022064045,0.00010429416,0.0001110394,0.00019075582,0.000118922995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014006263,0.0006342041,0.00052592985,0.0016140199,0.0008386844,0.001386559,0.0008987341,0.00039050408,0.0021943268],"category_scores_gemma":[0.0024807304,0.0003585361,0.00067007105,0.0009688354,0.002311434,0.0027126884,0.0021970982,0.0019679489,0.00037978892],"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.00001337771,0.000008327967,0.00012116735,0.00004296942,0.000008166322,0.000020577587,0.00007329378,0.0013664876,0.0015895093,0.9869381,0.00039542513,0.009422526],"study_design_scores_gemma":[0.000008627259,0.00004417711,0.00020911348,0.000026741469,0.00000743271,0.00008327341,0.00005641298,0.022782763,0.0025484385,0.9663766,0.007841143,0.000015273346],"about_ca_topic_score_codex":0.00047024668,"about_ca_topic_score_gemma":0.0004886192,"teacher_disagreement_score":0.0021943268,"about_ca_system_score_codex":0.0007489853,"about_ca_system_score_gemma":0.00061767467,"threshold_uncertainty_score":0.007407248},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27679396,0.0024619275,0.50863975,0.004865082,0.0012447906,0.00008135949,0.00038175305,0.00031471017,0.20521665],"genre_scores_gemma":[0.91127235,0.0010583838,0.026808785,0.000858167,0.0006318079,0.00006451801,0.00014445622,0.0002314234,0.058930065],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883145,0.0003888136,0.00004861684,0.000192131,0.00035340592,0.00018563957],"domain_scores_gemma":[0.99734205,0.00092135306,0.00029308812,0.0003323842,0.0005071077,0.00060407876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019428104,0.00079542893,0.00048453675,0.0015561129,0.0011412601,0.002886828,0.000633669,0.001151121,0.008470441],"category_scores_gemma":[0.0047056046,0.00048062074,0.00048543545,0.00064407126,0.0039214506,0.005803946,0.0034677826,0.0023054313,0.000734441],"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.00002080873,0.0000061433334,0.000057506106,0.00001309642,0.000001959909,0.000019696989,0.00006462915,0.00050202914,0.00061236916,0.99538356,0.0004596533,0.002858427],"study_design_scores_gemma":[0.0000075450703,0.000038081584,0.00015892589,0.000018753577,0.0000061143,0.00014766652,0.000112849986,0.008441368,0.0011775938,0.98375756,0.0061195125,0.000014025835],"about_ca_topic_score_codex":0.00037013035,"about_ca_topic_score_gemma":0.00033430854,"teacher_disagreement_score":0.008470441,"about_ca_system_score_codex":0.00071694946,"about_ca_system_score_gemma":0.00053822284,"threshold_uncertainty_score":0.028336465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40232298,0.0017134568,0.37138766,0.005280646,0.0006183668,0.00013877486,0.00075271446,0.00040837863,0.21737708],"genre_scores_gemma":[0.9359977,0.0006112412,0.0214381,0.00063860905,0.00044069948,0.000117873824,0.00053617806,0.00019201942,0.040027466],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782443,0.000661076,0.00009187584,0.00040095043,0.00059691974,0.00042482634],"domain_scores_gemma":[0.99582195,0.0021486818,0.0005152117,0.00056986336,0.00036425228,0.0005800337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022730248,0.000841054,0.0012813129,0.0022345304,0.0021394407,0.0037259634,0.0013710434,0.0015200865,0.014299451],"category_scores_gemma":[0.00703647,0.0007232571,0.001498047,0.0008790043,0.005034558,0.0049275486,0.004351372,0.0037636538,0.0012924843],"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.000047053425,0.000017416893,0.00008662649,0.00001680108,0.000007087702,0.000024852705,0.00007807914,0.0013599988,0.00042553217,0.99586475,0.0005885014,0.0014833543],"study_design_scores_gemma":[0.000020690684,0.000027106063,0.00015189001,0.000010355702,0.000005560978,0.0000760568,0.000061706916,0.006326337,0.000427884,0.99076813,0.002112834,0.000011457919],"about_ca_topic_score_codex":0.0006474621,"about_ca_topic_score_gemma":0.00044521948,"teacher_disagreement_score":0.014299451,"about_ca_system_score_codex":0.0011042799,"about_ca_system_score_gemma":0.00062461046,"threshold_uncertainty_score":0.047836423},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052922074,0.0034220226,0.866814,0.0054502627,0.0013865299,0.00007780539,0.00038006084,0.00032214273,0.06922514],"genre_scores_gemma":[0.7714682,0.0036047872,0.10037463,0.0020049566,0.003053505,0.00017540531,0.00056148384,0.0010084637,0.11774864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994741,0.00020402066,0.000021924143,0.000088940586,0.00014828032,0.00006263442],"domain_scores_gemma":[0.9983529,0.00065646693,0.00012797091,0.00019116316,0.00036420353,0.00030736913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013457476,0.0009464614,0.00089377305,0.0016997172,0.0013863728,0.0022342019,0.002058569,0.0015301584,0.015106857],"category_scores_gemma":[0.005904992,0.0006275785,0.0011859919,0.0008740365,0.0026042205,0.0062812115,0.0037567609,0.0027109822,0.0013027355],"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.000008209397,0.000011116258,0.00014680997,0.0000388833,0.000010901935,0.00004978636,0.000058830632,0.0038223092,0.00049467117,0.9910347,0.0018476888,0.002476228],"study_design_scores_gemma":[0.000005385337,0.000017134587,0.000270408,0.000027597167,0.000014406632,0.00007995983,0.00005075305,0.15404594,0.00029494552,0.84071195,0.004467964,0.000013522888],"about_ca_topic_score_codex":0.003214372,"about_ca_topic_score_gemma":0.0031452314,"teacher_disagreement_score":0.015106857,"about_ca_system_score_codex":0.0013958652,"about_ca_system_score_gemma":0.001068432,"threshold_uncertainty_score":0.050537467},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04153049,0.0031859097,0.9305743,0.0010000055,0.00023078102,0.000078905505,0.00018696865,0.000044291537,0.023168365],"genre_scores_gemma":[0.7292044,0.005619431,0.250924,0.0004927763,0.0006273614,0.00044619996,0.00049801945,0.00011556666,0.012072163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991879,0.00033865357,0.000060291346,0.00012104408,0.00022834472,0.00006382305],"domain_scores_gemma":[0.9988954,0.000655208,0.0001251498,0.00004407603,0.00023250183,0.00004754298],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002446946,0.0009243463,0.00077602704,0.0008453139,0.00045205897,0.0014017345,0.00057617883,0.00086679624,0.0015903247],"category_scores_gemma":[0.003404717,0.0004092016,0.00079467584,0.0007057784,0.0015506786,0.0023668648,0.0009895383,0.0021699734,0.00025742064],"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.000033922406,0.000036535068,0.00040156374,0.00027011908,0.000028071696,0.00014800797,0.000112975504,0.060455747,0.0031283018,0.9229214,0.0013064018,0.011156959],"study_design_scores_gemma":[0.000026256308,0.00012811366,0.0006028055,0.00009963372,0.00002051776,0.00021744432,0.00010425027,0.3901166,0.002820661,0.59680414,0.009036934,0.000022658218],"about_ca_topic_score_codex":0.0004213957,"about_ca_topic_score_gemma":0.00027631936,"teacher_disagreement_score":0.002446946,"about_ca_system_score_codex":0.0007693893,"about_ca_system_score_gemma":0.00084740424,"threshold_uncertainty_score":0.012940884},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03595137,0.004267819,0.058289114,0.3958158,0.017386032,0.000076321914,0.0009866683,0.0014594806,0.48576736],"genre_scores_gemma":[0.5486846,0.007070948,0.020206548,0.05169175,0.022662947,0.0003287926,0.001969977,0.0021321543,0.3452524],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990426,0.00029437226,0.00003531674,0.0002610649,0.00021937898,0.00014726415],"domain_scores_gemma":[0.9957873,0.0024720272,0.00015774592,0.0003705529,0.00083793217,0.00037444025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016132254,0.0007106253,0.0010504448,0.0011599797,0.0030882321,0.004474281,0.00093368243,0.0029580279,0.05851831],"category_scores_gemma":[0.008761375,0.00041515427,0.0011075004,0.0011932157,0.002571784,0.009652204,0.002594579,0.0056685614,0.010416081],"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.0001620262,0.000052919804,0.0003301475,0.00014150381,0.000017563312,0.00032842206,0.00047417037,0.00088783324,0.0009847491,0.7003593,0.2761218,0.02013955],"study_design_scores_gemma":[0.00004984238,0.00004328858,0.0010306069,0.00011232926,0.000021764581,0.00036628533,0.0003939307,0.0050733476,0.0011901851,0.7851703,0.20649882,0.000049327657],"about_ca_topic_score_codex":0.0035336977,"about_ca_topic_score_gemma":0.0021339455,"teacher_disagreement_score":0.05851831,"about_ca_system_score_codex":0.0024653913,"about_ca_system_score_gemma":0.0007009866,"threshold_uncertainty_score":0.19576323},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024441702,0.00028569627,0.9714787,0.00014205767,0.00004738574,0.000041847972,0.000025926594,0.00010856141,0.0034281365],"genre_scores_gemma":[0.5241323,0.0005588414,0.46720713,0.00017946401,0.00012771864,0.0003364365,0.00017257454,0.00022711857,0.0070583937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987123,0.00057331444,0.00007699468,0.0002150897,0.0003177444,0.00010457274],"domain_scores_gemma":[0.99540883,0.0030396793,0.00035839496,0.0004498065,0.00055434357,0.00018893246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032876502,0.0010293674,0.0006483875,0.00087866094,0.00041031154,0.0009823706,0.0010680895,0.00090273644,0.0027232922],"category_scores_gemma":[0.012166238,0.00042624952,0.0009725189,0.00052480015,0.0020016276,0.0017375943,0.0022803338,0.0015506691,0.00035402505],"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.00020964562,0.00008965658,0.001662125,0.00034218567,0.00012290709,0.00015962085,0.00026571917,0.50735027,0.010385755,0.4060119,0.0016524004,0.07174793],"study_design_scores_gemma":[0.000007944709,0.000046489702,0.00016004837,0.000017388873,0.000007138945,0.00003439141,0.0000147663895,0.9638084,0.0023262196,0.032733824,0.0008344817,0.000008956233],"about_ca_topic_score_codex":0.0011244987,"about_ca_topic_score_gemma":0.0012749715,"teacher_disagreement_score":0.0032876502,"about_ca_system_score_codex":0.0008308027,"about_ca_system_score_gemma":0.001212407,"threshold_uncertainty_score":0.017386913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29919463,0.0024319293,0.64057356,0.0057102977,0.000568196,0.000106025145,0.0002482847,0.0003211278,0.050845966],"genre_scores_gemma":[0.8852125,0.0019849383,0.07611137,0.0012779331,0.00050714007,0.00012733618,0.00033527683,0.000367448,0.034076124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820757,0.00076484756,0.000082026854,0.0002564955,0.00039638014,0.0002927218],"domain_scores_gemma":[0.98550874,0.009247985,0.0011385982,0.00097013026,0.001542383,0.0015920721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068582348,0.0013063716,0.0018244428,0.0029999814,0.002285298,0.0025803654,0.0017044296,0.0037573695,0.004255884],"category_scores_gemma":[0.030705443,0.0010175233,0.0012579305,0.0014482974,0.006688877,0.0066610957,0.0052925083,0.0049039023,0.0007020633],"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.00003896731,0.000020225674,0.00025995815,0.00005228948,0.00001215786,0.00008910439,0.00015661426,0.0070461906,0.0007272325,0.987656,0.00095351366,0.002987618],"study_design_scores_gemma":[0.000010006372,0.000022331695,0.0001992461,0.000021787831,0.0000065556264,0.000089357796,0.00007837178,0.03462027,0.00034710683,0.96348953,0.0010978023,0.000017689072],"about_ca_topic_score_codex":0.0017577867,"about_ca_topic_score_gemma":0.0011202386,"teacher_disagreement_score":0.0068582348,"about_ca_system_score_codex":0.0017563843,"about_ca_system_score_gemma":0.0016354239,"threshold_uncertainty_score":0.0362702},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003718698,0.00014684105,0.9938712,0.00016842669,0.00006456291,0.000040772906,0.000027290274,0.00004230148,0.0019199862],"genre_scores_gemma":[0.1208818,0.00044195622,0.8681399,0.00020259836,0.00016596705,0.00048445797,0.00021039149,0.00023838227,0.009234512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855024,0.00091750856,0.00004382566,0.000162162,0.00024652985,0.00007972972],"domain_scores_gemma":[0.9979361,0.0014160844,0.00010235204,0.00013929093,0.0002358633,0.0001702616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029921075,0.0014308671,0.0016005596,0.0009003274,0.0007321366,0.0016117648,0.0021421912,0.0022125347,0.0050067436],"category_scores_gemma":[0.0051688584,0.0013651861,0.0019124909,0.00072168384,0.002119505,0.002206157,0.004366808,0.004308653,0.0007889911],"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.00033431253,0.00014965389,0.00054020353,0.0008436553,0.00020560826,0.00026279732,0.00046111728,0.47248232,0.0061369007,0.4222063,0.005831568,0.09054562],"study_design_scores_gemma":[0.000025141644,0.00008936733,0.00006441222,0.000033498334,0.000017812223,0.00007593517,0.000035661993,0.94889206,0.0005956103,0.047640804,0.0025063148,0.00002337176],"about_ca_topic_score_codex":0.0018597754,"about_ca_topic_score_gemma":0.001678654,"teacher_disagreement_score":0.0050067436,"about_ca_system_score_codex":0.0007524015,"about_ca_system_score_gemma":0.0018070096,"threshold_uncertainty_score":0.016749203},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092538446,0.0063917735,0.814247,0.0049833497,0.00086502754,0.0001775269,0.0002704882,0.0006650248,0.07986133],"genre_scores_gemma":[0.6931373,0.0026953246,0.26626465,0.001381336,0.00062014576,0.000534492,0.00060754066,0.0009381424,0.033821147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982742,0.0009918945,0.000046760233,0.0001809581,0.000326732,0.00017941928],"domain_scores_gemma":[0.98687077,0.010462391,0.0004508583,0.0006564465,0.001066353,0.0004931878],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053123436,0.0010479544,0.0015658082,0.002333801,0.0016601225,0.0026741999,0.0033140604,0.0031029151,0.008695159],"category_scores_gemma":[0.040003955,0.00074135786,0.0010189853,0.0015183396,0.0039785006,0.0030765631,0.004375337,0.0035840317,0.0012501767],"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.0005011487,0.00011963324,0.0017796365,0.0003288545,0.00008009972,0.00010176106,0.00021236474,0.19236827,0.0015213998,0.74386406,0.009302389,0.049820397],"study_design_scores_gemma":[0.000041266325,0.00004966971,0.00034810943,0.000089794354,0.000016246753,0.000050145947,0.000047616708,0.8400255,0.0003681637,0.15656339,0.0023772565,0.00002289888],"about_ca_topic_score_codex":0.007529614,"about_ca_topic_score_gemma":0.00614977,"teacher_disagreement_score":0.008695159,"about_ca_system_score_codex":0.0019541383,"about_ca_system_score_gemma":0.0028523917,"threshold_uncertainty_score":0.0290882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045879185,0.0005676023,0.9407373,0.00044739762,0.000083358515,0.000025304436,0.000024731653,0.00005186729,0.012183259],"genre_scores_gemma":[0.8203348,0.00096966495,0.1651215,0.00031623957,0.00033260294,0.00009035728,0.00005911585,0.00014096666,0.012634803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984084,0.00059209124,0.00008070734,0.0002559713,0.0005119536,0.0001510438],"domain_scores_gemma":[0.9965166,0.0019936184,0.00026793123,0.00035063195,0.0005175266,0.00035370752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003918974,0.0012738239,0.0010493312,0.0013210375,0.0012459375,0.0024890075,0.001028865,0.0010247417,0.0023095817],"category_scores_gemma":[0.008253855,0.00043863896,0.0013951237,0.0011654866,0.003818544,0.0046814936,0.003589219,0.0033537336,0.00032215597],"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.000022415039,0.000023658704,0.00029698855,0.000034776873,0.000009160095,0.00013141437,0.00013878815,0.010539502,0.0018938988,0.97886217,0.0002432024,0.0078039635],"study_design_scores_gemma":[0.000008071176,0.000083601786,0.00035242309,0.000032537017,0.000018112047,0.00028513238,0.000087468405,0.29578432,0.003750265,0.6952461,0.0043298146,0.000022137654],"about_ca_topic_score_codex":0.0009218389,"about_ca_topic_score_gemma":0.00058785663,"teacher_disagreement_score":0.003918974,"about_ca_system_score_codex":0.0018625275,"about_ca_system_score_gemma":0.0011129974,"threshold_uncertainty_score":0.020725787},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38856456,0.0016889632,0.5463179,0.0017877701,0.00027582547,0.000101072656,0.00031822186,0.00022299161,0.060722608],"genre_scores_gemma":[0.9499733,0.00083896134,0.028379533,0.00021584296,0.0004337652,0.000183987,0.00026048024,0.000119056545,0.019595135],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936086,0.00018584303,0.00004032664,0.00013893127,0.00018380635,0.000090123416],"domain_scores_gemma":[0.99548763,0.0026683607,0.000420045,0.00026547417,0.0005709496,0.0005875242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018393594,0.00065922126,0.00096520764,0.0022930326,0.0014865474,0.0024684102,0.0009177375,0.0011611312,0.007898296],"category_scores_gemma":[0.0052879965,0.000471889,0.0015536915,0.00089551794,0.0031838634,0.0035509465,0.0022040883,0.0021806145,0.00053570163],"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.000022808928,0.000016916987,0.00020324087,0.000026122176,0.00001175822,0.00013545694,0.00036341837,0.0015730772,0.0019373794,0.99368757,0.00022036185,0.0018018133],"study_design_scores_gemma":[0.000012445106,0.000028368957,0.00025047277,0.000007740397,0.0000058018027,0.00010505533,0.00011775809,0.01147944,0.00028602683,0.9867776,0.0009184712,0.000010841086],"about_ca_topic_score_codex":0.0009782792,"about_ca_topic_score_gemma":0.00071429793,"teacher_disagreement_score":0.007898296,"about_ca_system_score_codex":0.0010232398,"about_ca_system_score_gemma":0.0006014228,"threshold_uncertainty_score":0.026422441},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057773188,0.01898579,0.7144444,0.008423519,0.0020177537,0.00011584537,0.0005756312,0.00022775386,0.19743608],"genre_scores_gemma":[0.60871804,0.011964032,0.32812327,0.0019091333,0.0025318298,0.00023279218,0.0005779217,0.0004241323,0.045518838],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822634,0.00050117075,0.00012315545,0.00035095698,0.0006139512,0.00018444797],"domain_scores_gemma":[0.99729365,0.0010713895,0.00031086474,0.0005221135,0.00050372054,0.0002981875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003160754,0.00075251475,0.00092935085,0.0023931956,0.0018168576,0.004081542,0.0008905517,0.0013140186,0.003895054],"category_scores_gemma":[0.0058274637,0.00043186898,0.0012642912,0.002218808,0.005897749,0.011483592,0.003358024,0.0040382156,0.0010882335],"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.0000049836467,0.0000047953413,0.000051997,0.000013256168,0.0000013577022,0.000012984902,0.000107543594,0.0002654677,0.00011389696,0.99561715,0.00038733202,0.0034193604],"study_design_scores_gemma":[0.0000048557777,0.000019881478,0.0000866826,0.000032723263,0.0000039816955,0.000058659876,0.00006395891,0.0021586218,0.00031413062,0.9764074,0.02083512,0.000013880608],"about_ca_topic_score_codex":0.0012744531,"about_ca_topic_score_gemma":0.0013044631,"teacher_disagreement_score":0.004081542,"about_ca_system_score_codex":0.0019017308,"about_ca_system_score_gemma":0.0014179392,"threshold_uncertainty_score":0.016715884},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051340733,0.0033844064,0.91885835,0.0021344735,0.00057058915,0.000120853874,0.00029058682,0.0007184463,0.022581588],"genre_scores_gemma":[0.6230777,0.0055329558,0.3332008,0.0011140993,0.00081280764,0.00057895255,0.0009537925,0.0018338786,0.032894872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99615794,0.0018852245,0.00016783387,0.00052571704,0.0009141785,0.00034921686],"domain_scores_gemma":[0.9723528,0.019735636,0.0010437786,0.0022533042,0.003762044,0.00085237424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011666292,0.0014269713,0.001247495,0.0022178402,0.00121048,0.0030106269,0.0023925242,0.002311973,0.0074197818],"category_scores_gemma":[0.05143667,0.00070287276,0.0009400581,0.0014815186,0.004005719,0.0057198126,0.0037749778,0.0043005804,0.0023721638],"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.0005111255,0.000099869634,0.0029258921,0.00051659864,0.00011312115,0.00016315238,0.0004906393,0.09395614,0.009668321,0.7911468,0.0069561577,0.093452096],"study_design_scores_gemma":[0.000060243754,0.00020410914,0.0016879134,0.00021166868,0.000049017544,0.00043951848,0.00020922939,0.68321013,0.012532508,0.29012376,0.011146517,0.00012538694],"about_ca_topic_score_codex":0.001998475,"about_ca_topic_score_gemma":0.0012508961,"teacher_disagreement_score":0.011666292,"about_ca_system_score_codex":0.00180822,"about_ca_system_score_gemma":0.0017057266,"threshold_uncertainty_score":0.06169802},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005937488,0.00013678371,0.99023235,0.00014067194,0.000103738224,0.000052997897,0.00006098211,0.00039643695,0.0029384021],"genre_scores_gemma":[0.05149468,0.00009057025,0.937384,0.00009744721,0.000056497764,0.000116702795,0.00019105803,0.00035121702,0.010217846],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992644,0.00022523491,0.00003993675,0.00014362205,0.00021581349,0.00011090548],"domain_scores_gemma":[0.99896574,0.0004072261,0.000046289177,0.00019731643,0.00026284045,0.000120613906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021817582,0.00077134464,0.0013446081,0.0012928119,0.0012895849,0.0014298714,0.0025418848,0.0021304595,0.012337384],"category_scores_gemma":[0.004213539,0.00072067557,0.0012573717,0.001000482,0.0012129927,0.001989224,0.002421773,0.0026237236,0.0027588462],"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.00043497217,0.0002366886,0.0011284698,0.00019277178,0.00008354445,0.00010293483,0.0001866937,0.17839818,0.0032755034,0.2550608,0.019318053,0.5415814],"study_design_scores_gemma":[0.000059359227,0.000090881425,0.00020047156,0.00003474549,0.000014185871,0.000050764356,0.000041053736,0.9197045,0.0015208705,0.06680498,0.011452195,0.000026012996],"about_ca_topic_score_codex":0.008355904,"about_ca_topic_score_gemma":0.011793676,"teacher_disagreement_score":0.012337384,"about_ca_system_score_codex":0.0012991707,"about_ca_system_score_gemma":0.002598695,"threshold_uncertainty_score":0.04127264},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39279938,0.0010232172,0.5876967,0.0006092336,0.00013026822,0.0000692623,0.00010411008,0.000111429836,0.017456457],"genre_scores_gemma":[0.9570744,0.00069270417,0.029558916,0.00007501316,0.000060423594,0.00007218907,0.0000753758,0.00005145097,0.012339439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99965465,0.00010535793,0.000020284087,0.0000556122,0.0001122167,0.000051921666],"domain_scores_gemma":[0.99937636,0.00025748022,0.00011225684,0.000049136044,0.00010491597,0.00009988026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009022094,0.0008312157,0.0006581371,0.0018787099,0.00054736895,0.0014604478,0.00088398287,0.0007735905,0.0020541481],"category_scores_gemma":[0.0022105942,0.0003379419,0.00089886814,0.0007906552,0.002044203,0.0017487354,0.0017182088,0.0012218015,0.0002245615],"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.00002415072,0.000015532056,0.0003099738,0.00006324512,0.000024788129,0.00023243127,0.00018651778,0.021760395,0.0045468165,0.9690288,0.0002936523,0.0035138223],"study_design_scores_gemma":[0.000036737933,0.00013003791,0.0007984824,0.00004665791,0.000025231195,0.00024952315,0.0001761965,0.31349373,0.0026370839,0.67997026,0.0024011151,0.000035038534],"about_ca_topic_score_codex":0.0023243863,"about_ca_topic_score_gemma":0.0017687861,"teacher_disagreement_score":0.0023243863,"about_ca_system_score_codex":0.0013719988,"about_ca_system_score_gemma":0.0008568093,"threshold_uncertainty_score":0.009954572},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020610509,0.006513187,0.15818222,0.0020592592,0.0010671279,0.000038294966,0.00024724533,0.0004492556,0.82938236],"genre_scores_gemma":[0.09871344,0.007647712,0.023940772,0.00063609704,0.0009159631,0.00012913671,0.0003619032,0.00028826017,0.86736673],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998338,0.000026152507,0.0000031999218,0.00003139923,0.0000899649,0.000015352698],"domain_scores_gemma":[0.99994636,0.000014477371,0.0000044108965,0.0000146392,0.000014439866,0.000005746275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016780148,0.00055556674,0.00043608283,0.0003660636,0.0003846256,0.0010636897,0.00045988575,0.0006000947,0.02748484],"category_scores_gemma":[0.00034315113,0.00023241586,0.00017604411,0.0005315198,0.0009181455,0.0009017492,0.000773884,0.0010428488,0.006407365],"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.00001559993,0.00003260987,0.000035574063,0.000109281325,0.000009478816,0.000016134314,0.000042209726,0.010941743,0.0013419183,0.70914876,0.123442456,0.1548642],"study_design_scores_gemma":[0.000010318516,0.000019786994,0.00021729514,0.00008677803,0.000006769288,0.000039654326,0.000028461196,0.023291126,0.0010972655,0.50488275,0.4703079,0.000011804699],"about_ca_topic_score_codex":0.0013336138,"about_ca_topic_score_gemma":0.0025759558,"teacher_disagreement_score":0.02748484,"about_ca_system_score_codex":0.001063678,"about_ca_system_score_gemma":0.000750433,"threshold_uncertainty_score":0.091945946},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011532544,0.002233254,0.81908023,0.0043381704,0.0007965248,0.00014665247,0.0009007781,0.00014993623,0.16082193],"genre_scores_gemma":[0.5685719,0.007547169,0.3402578,0.0059130485,0.0025437372,0.00102032,0.0019920128,0.0006141636,0.07153981],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99804,0.00054771977,0.00012169663,0.00029658043,0.0007989471,0.00019511695],"domain_scores_gemma":[0.99500906,0.0032929499,0.0003065875,0.0003388482,0.0008389533,0.00021361411],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004025771,0.0010553744,0.0008662645,0.0014602614,0.0013250785,0.002426608,0.0011984309,0.0015504165,0.017080186],"category_scores_gemma":[0.0082461145,0.00058347476,0.0015782139,0.0016024061,0.0038612336,0.004556886,0.0020313603,0.006366125,0.0017840662],"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.0000057841917,0.000006653653,0.00004500149,0.00005403934,0.0000035760036,0.000052626074,0.00007101238,0.0024114917,0.00030221406,0.99248004,0.0021476024,0.002419965],"study_design_scores_gemma":[0.000011646113,0.00002683099,0.00017720704,0.00006843998,0.00000588902,0.00008322526,0.000050359668,0.022636598,0.0005697088,0.9591466,0.017203087,0.000020323796],"about_ca_topic_score_codex":0.005510609,"about_ca_topic_score_gemma":0.003916142,"teacher_disagreement_score":0.017080186,"about_ca_system_score_codex":0.0024429802,"about_ca_system_score_gemma":0.002193163,"threshold_uncertainty_score":0.05713892},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020483343,0.00061403983,0.9714235,0.00051694614,0.000100454665,0.000095593874,0.000029791348,0.00009759669,0.0066387462],"genre_scores_gemma":[0.47511017,0.0016520853,0.5023595,0.0004330735,0.0001979862,0.00086874823,0.00027193315,0.0004927244,0.018613786],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99868804,0.0007092879,0.000046711993,0.00010412438,0.00034669685,0.00010517388],"domain_scores_gemma":[0.9856426,0.011697005,0.00042792477,0.00032044336,0.001483003,0.00042898612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0083728125,0.0014369383,0.0012222969,0.001562731,0.0010046976,0.0013779603,0.0017864769,0.002261976,0.004189228],"category_scores_gemma":[0.030718392,0.000540199,0.0012326321,0.0007369407,0.0031950455,0.0023441804,0.003736123,0.0031545204,0.00063558546],"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.0005329811,0.0002049626,0.0023051896,0.0005169273,0.00011797939,0.00026738516,0.000519788,0.5337045,0.009801339,0.3982565,0.0022464073,0.05152605],"study_design_scores_gemma":[0.000016667098,0.000061575796,0.000106898005,0.00003387501,0.000007286748,0.00003491094,0.000024863004,0.9625636,0.0006250216,0.035953734,0.00056036725,0.000011135532],"about_ca_topic_score_codex":0.0038993151,"about_ca_topic_score_gemma":0.0023930864,"teacher_disagreement_score":0.0083728125,"about_ca_system_score_codex":0.0012249873,"about_ca_system_score_gemma":0.0024757124,"threshold_uncertainty_score":0.04428017},"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":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15480599,0.04368737,0.24518861,0.40917748,0.007909814,0.000043684417,0.0009749869,0.0006948391,0.1375172],"genre_scores_gemma":[0.8794971,0.016145034,0.042831644,0.026493661,0.014244189,0.000108144064,0.0007739252,0.0003467088,0.01955961],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99761367,0.0008844205,0.00012421185,0.0005494454,0.0005961171,0.00023217649],"domain_scores_gemma":[0.99220663,0.0054553794,0.0003711133,0.00040481787,0.0012157933,0.00034624094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036754343,0.0007759095,0.00094419305,0.0009931541,0.0020212058,0.0023107633,0.0011194316,0.0035028842,0.0035139853],"category_scores_gemma":[0.016057193,0.000635889,0.0012413687,0.0014797886,0.0072375964,0.013529432,0.0023374988,0.005559995,0.00068111205],"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.000027692782,0.000010817793,0.00014919892,0.000054271673,0.000009571793,0.00008445842,0.00020807613,0.0005512499,0.00026590077,0.98210365,0.011927631,0.0046074865],"study_design_scores_gemma":[0.000011872895,0.000009457217,0.00014230967,0.000022257092,0.000004301579,0.000091182395,0.00012339403,0.0017867397,0.00025460433,0.98670805,0.010829221,0.000016608716],"about_ca_topic_score_codex":0.0014746035,"about_ca_topic_score_gemma":0.0007886716,"teacher_disagreement_score":0.0036754343,"about_ca_system_score_codex":0.0022463088,"about_ca_system_score_gemma":0.0008944375,"threshold_uncertainty_score":0.01943779},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014986533,0.0013680077,0.9628596,0.0010841702,0.00028386535,0.00011391626,0.0003045303,0.00008401092,0.01891545],"genre_scores_gemma":[0.6536904,0.0057739536,0.31062588,0.0009700601,0.00097142474,0.0008244122,0.001469842,0.0005332856,0.025140744],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971289,0.0008802446,0.0001774654,0.00036348533,0.0011370579,0.00031280157],"domain_scores_gemma":[0.99249345,0.004843833,0.000641624,0.0002810052,0.0013763846,0.0003637121],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00596327,0.0019003999,0.0015903981,0.002235581,0.00073352706,0.0031730551,0.0012787124,0.0019280951,0.0052476083],"category_scores_gemma":[0.01102896,0.000694599,0.0016931737,0.0013613462,0.0028541596,0.004254868,0.0024047557,0.0047118394,0.0010631162],"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.00004301055,0.00006567851,0.00045462995,0.00036573087,0.000047554196,0.00022896132,0.00018614672,0.09194842,0.0036140499,0.89034396,0.0030506058,0.009651245],"study_design_scores_gemma":[0.000027874363,0.000119362216,0.00048355717,0.00012616665,0.000026244243,0.00016078647,0.00013284602,0.66661984,0.0027522924,0.32142472,0.008077846,0.000048530324],"about_ca_topic_score_codex":0.001997802,"about_ca_topic_score_gemma":0.0019778258,"teacher_disagreement_score":0.00596327,"about_ca_system_score_codex":0.0018043872,"about_ca_system_score_gemma":0.0028009685,"threshold_uncertainty_score":0.031537116},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15106183,0.0007629839,0.82744914,0.00045430253,0.000112143185,0.00014220993,0.000053649943,0.00013885101,0.019824894],"genre_scores_gemma":[0.716476,0.0014091022,0.26854053,0.0002735358,0.00025107592,0.0003273798,0.00018028889,0.00018187331,0.012360111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977908,0.0006985968,0.00018201234,0.0004075956,0.00071631547,0.00020475248],"domain_scores_gemma":[0.9953549,0.0028064335,0.00056174264,0.0003106572,0.0006342818,0.00033202703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043254867,0.0009621961,0.00077033276,0.001483849,0.0014043421,0.0019781045,0.0006278687,0.001260924,0.0031079252],"category_scores_gemma":[0.012297484,0.0006377894,0.0014435299,0.00082817266,0.0039697387,0.004834766,0.0031269363,0.0021772212,0.0005213539],"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.00007952786,0.000038199607,0.0011290571,0.00007575022,0.000025289102,0.0005708798,0.00032724984,0.026334642,0.01020135,0.9519203,0.00029667284,0.009001067],"study_design_scores_gemma":[0.000048133483,0.00015195896,0.0005560272,0.0000660682,0.000041240142,0.00070890295,0.00034147702,0.35694817,0.01259699,0.62183005,0.006667849,0.000043178516],"about_ca_topic_score_codex":0.0008226485,"about_ca_topic_score_gemma":0.0006580744,"teacher_disagreement_score":0.0043254867,"about_ca_system_score_codex":0.0012106973,"about_ca_system_score_gemma":0.0010867873,"threshold_uncertainty_score":0.022875667},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0112310555,0.0001134971,0.9872601,0.000069581285,0.000034798126,0.000034970955,0.00001770799,0.000066136075,0.0011722118],"genre_scores_gemma":[0.18366048,0.00034671798,0.8130681,0.000120864264,0.000036770023,0.00014427396,0.00011619966,0.00019433336,0.0023122018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995819,0.00016594166,0.000025171394,0.000060451603,0.00012803708,0.000038546128],"domain_scores_gemma":[0.9991849,0.0003997543,0.00008285033,0.000079188016,0.00018041275,0.00007282268],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020837807,0.0009059747,0.0008504713,0.0010098751,0.0003449071,0.0008922925,0.0007552019,0.00075167377,0.0012673126],"category_scores_gemma":[0.004732421,0.0005348241,0.00091806886,0.0005107832,0.0012215449,0.0015295867,0.0014336865,0.0017417197,0.00043900913],"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.00023752936,0.00012032879,0.0016240065,0.00045764414,0.00009092452,0.00035138757,0.0005716876,0.46405756,0.036148194,0.3384742,0.0029692287,0.1548973],"study_design_scores_gemma":[0.000014653994,0.00013592123,0.00031856817,0.000040180046,0.0000114428185,0.00007055127,0.00003729851,0.95083374,0.0069374526,0.03810222,0.0034807688,0.000017286464],"about_ca_topic_score_codex":0.0016943032,"about_ca_topic_score_gemma":0.0019264193,"teacher_disagreement_score":0.0020837807,"about_ca_system_score_codex":0.0011517286,"about_ca_system_score_gemma":0.0012250545,"threshold_uncertainty_score":0.011020184},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54814804,0.0013714106,0.40377262,0.0014908316,0.00013796084,0.00021573371,0.0005911524,0.0001660305,0.044106286],"genre_scores_gemma":[0.94205743,0.0012341221,0.042383384,0.00028526856,0.00021451441,0.00039459116,0.00083832705,0.00014770916,0.012444772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989837,0.0003299708,0.000061062325,0.00026222802,0.00025380353,0.00010925473],"domain_scores_gemma":[0.99111205,0.0060421703,0.0010025954,0.00023765654,0.000820477,0.0007850995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020619566,0.0017515279,0.0020284469,0.005202984,0.0019458575,0.005112136,0.0025648326,0.0018010606,0.006440317],"category_scores_gemma":[0.010392619,0.0012957489,0.0019507757,0.0019976774,0.0037989444,0.00532198,0.004716876,0.003858049,0.0003430085],"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.00014543373,0.00011348491,0.0010150496,0.00015174813,0.00007847627,0.00014664221,0.00041760912,0.02474768,0.002887613,0.9623317,0.00081141025,0.007153204],"study_design_scores_gemma":[0.000043486867,0.00008082978,0.0010764089,0.00006691049,0.000044886332,0.000107465596,0.00023592035,0.22727937,0.0010411766,0.7688744,0.0011077656,0.000041433177],"about_ca_topic_score_codex":0.0018287766,"about_ca_topic_score_gemma":0.0014155869,"teacher_disagreement_score":0.006440317,"about_ca_system_score_codex":0.0021289487,"about_ca_system_score_gemma":0.0011350682,"threshold_uncertainty_score":0.021544993},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5571428,0.00058767566,0.41775948,0.0004937077,0.00004730763,0.00008406348,0.000091061054,0.00028771663,0.023506157],"genre_scores_gemma":[0.9064559,0.00046432068,0.08064284,0.000093682036,0.00008917116,0.0001454481,0.00015297381,0.00014767349,0.011808044],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99792945,0.0005166227,0.00011611541,0.0004679563,0.00071797887,0.00025195212],"domain_scores_gemma":[0.9956299,0.0021070035,0.0006788527,0.00043375112,0.00062409195,0.00052635744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027978069,0.00078943704,0.00073475594,0.0014210552,0.0013441836,0.0029789587,0.0012283325,0.0012299733,0.0044964114],"category_scores_gemma":[0.008718449,0.00087554695,0.0011136805,0.0006985538,0.0035376642,0.0053508338,0.0041838787,0.0028455846,0.000791788],"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.00017090156,0.00008141164,0.0016405979,0.00007731413,0.00004008714,0.00047872125,0.00045507343,0.008207047,0.012715166,0.9649782,0.00034656483,0.01080887],"study_design_scores_gemma":[0.000065375956,0.0002300099,0.001198202,0.00005455795,0.000055480567,0.00086392224,0.00067820546,0.14174484,0.021382354,0.82885593,0.0048175678,0.00005357781],"about_ca_topic_score_codex":0.00039303344,"about_ca_topic_score_gemma":0.0003322908,"teacher_disagreement_score":0.0044964114,"about_ca_system_score_codex":0.0012770705,"about_ca_system_score_gemma":0.00045640182,"threshold_uncertainty_score":0.015042067},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1949862,0.003040235,0.7613516,0.0015976923,0.00048412054,0.00007608745,0.0002439975,0.00023491072,0.037985288],"genre_scores_gemma":[0.8510844,0.00219904,0.11503092,0.00062906765,0.0009893273,0.00018955687,0.00021651192,0.00031138642,0.029349852],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987814,0.00043830936,0.00006734159,0.0002221998,0.00034279694,0.0001479941],"domain_scores_gemma":[0.9967636,0.0015092808,0.0004840714,0.00023269543,0.0005351043,0.00047530635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026873692,0.0012458309,0.0012408887,0.0025883461,0.001098448,0.0026070052,0.0018647575,0.0018730198,0.0054602507],"category_scores_gemma":[0.0093246205,0.0007817757,0.0013852108,0.0013350504,0.0029207603,0.0064465688,0.0026967225,0.0028645382,0.00046988734],"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.00001431745,0.000014429357,0.00009121504,0.00003043134,0.000020042924,0.000052016552,0.000098324395,0.003374547,0.00091522466,0.991872,0.0004420823,0.0030752672],"study_design_scores_gemma":[0.000005666625,0.000016371843,0.00014135872,0.000009212332,0.000007891073,0.000096753145,0.00003178144,0.04462321,0.00029060384,0.9539451,0.0008203522,0.00001162002],"about_ca_topic_score_codex":0.0005555257,"about_ca_topic_score_gemma":0.0005171941,"teacher_disagreement_score":0.0054602507,"about_ca_system_score_codex":0.0011669236,"about_ca_system_score_gemma":0.0008720277,"threshold_uncertainty_score":0.01826638},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009725522,0.00025056704,0.99509144,0.00007964018,0.00004787554,0.000017091123,0.000032121494,0.00009158288,0.0034170789],"genre_scores_gemma":[0.19546136,0.0020401753,0.7717804,0.00028677617,0.00022085331,0.00048167518,0.00048667655,0.00043910573,0.028803],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946123,0.00018752785,0.000029710885,0.000059459326,0.00021173184,0.000050339902],"domain_scores_gemma":[0.99925524,0.00033330012,0.0000717165,0.00006945567,0.00021876708,0.000051475814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011590829,0.001097515,0.0008315222,0.0008369878,0.00044956844,0.001228484,0.0014381298,0.0010435241,0.008436607],"category_scores_gemma":[0.0025548646,0.0003967499,0.00083374535,0.00068127207,0.0010473477,0.001771705,0.002151066,0.0018915172,0.0018945769],"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.000051696716,0.00007718275,0.00037058425,0.00032823428,0.000048045582,0.00010887865,0.00013515179,0.54700404,0.0030512938,0.34070417,0.0058158697,0.10230486],"study_design_scores_gemma":[0.000011198108,0.000022956634,0.00004575314,0.000024924562,0.0000051476354,0.00002904942,0.000016944457,0.94670457,0.0005319373,0.04281235,0.009784435,0.0000106838725],"about_ca_topic_score_codex":0.0023185937,"about_ca_topic_score_gemma":0.0029691516,"teacher_disagreement_score":0.008436607,"about_ca_system_score_codex":0.00049972866,"about_ca_system_score_gemma":0.0011213068,"threshold_uncertainty_score":0.028223336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007059847,0.0021248935,0.9787972,0.0007167728,0.00016280357,0.000021514732,0.000069729205,0.00003284342,0.011014398],"genre_scores_gemma":[0.68107116,0.0061104465,0.29081723,0.0006664294,0.00077092485,0.000282478,0.000362558,0.00011445728,0.019804357],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988715,0.00044542496,0.00004679924,0.0002483829,0.0002937888,0.0000940555],"domain_scores_gemma":[0.99908483,0.00051617547,0.0001041886,0.000060648188,0.000183393,0.00005074823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001537401,0.0008133352,0.00067005504,0.0007469224,0.0006342745,0.0017145909,0.0010689787,0.0011625317,0.003785285],"category_scores_gemma":[0.0034247474,0.0003012131,0.00075596734,0.00092094345,0.0025619576,0.0023845988,0.0016890431,0.002625029,0.00047996014],"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.0000069745884,0.000006756452,0.0001779398,0.000066782435,0.000019191673,0.0000453245,0.00008826099,0.038592935,0.00084213767,0.94920975,0.00063438196,0.010309524],"study_design_scores_gemma":[0.0000069739276,0.000029627648,0.00020456944,0.00003384739,0.000007657097,0.00006801008,0.000060719674,0.2637755,0.00039110513,0.7267708,0.0086369645,0.000014243292],"about_ca_topic_score_codex":0.0031450104,"about_ca_topic_score_gemma":0.0016286969,"teacher_disagreement_score":0.003785285,"about_ca_system_score_codex":0.0013729773,"about_ca_system_score_gemma":0.0011397321,"threshold_uncertainty_score":0.012663007},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018205114,0.00009771715,0.9750251,0.00021710119,0.000063193904,0.000071432914,0.000023248229,0.00016153483,0.006135519],"genre_scores_gemma":[0.6687952,0.00030470366,0.31802732,0.00024084903,0.00008256344,0.00032919957,0.00007192004,0.00024381778,0.011904373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918395,0.00031784535,0.000033314558,0.00011910655,0.00023157704,0.00011419245],"domain_scores_gemma":[0.9975777,0.0013002584,0.00028518683,0.00032414796,0.00028082673,0.00023188443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016284828,0.001059089,0.00073707657,0.0007534659,0.00066401524,0.0012855987,0.0010371478,0.0011310822,0.0044591795],"category_scores_gemma":[0.0072703594,0.00046730842,0.00079471833,0.0004068844,0.0018569344,0.0024002462,0.0022967008,0.0017344095,0.0007916345],"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.00010699283,0.00009415324,0.0005065905,0.00008949054,0.00004342408,0.00010680301,0.00023766766,0.47361767,0.0067729168,0.4849119,0.0016665221,0.03184583],"study_design_scores_gemma":[0.000015006523,0.0000555914,0.000058837297,0.000010410012,0.000005600137,0.000025480671,0.000024870575,0.87635744,0.0008713048,0.121218815,0.0013469418,0.000009780701],"about_ca_topic_score_codex":0.0015075067,"about_ca_topic_score_gemma":0.0013949841,"teacher_disagreement_score":0.0044591795,"about_ca_system_score_codex":0.0009827034,"about_ca_system_score_gemma":0.0011915244,"threshold_uncertainty_score":0.014917433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06472614,0.00059059705,0.9188471,0.0011498657,0.00009213107,0.000113925096,0.00015393278,0.00010894109,0.014217448],"genre_scores_gemma":[0.73388624,0.0014204622,0.24351773,0.00042795073,0.00019672148,0.00056207995,0.00070320326,0.00044138002,0.018844223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992447,0.00041918538,0.000026427393,0.00010107658,0.0001305857,0.0000780792],"domain_scores_gemma":[0.9939521,0.0047356947,0.000400859,0.00015807658,0.0005614849,0.00019176802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030974257,0.0013270646,0.0019875122,0.0019633248,0.0008170712,0.0024790673,0.0015529874,0.0022417349,0.0054409937],"category_scores_gemma":[0.015483151,0.0011096954,0.0012492922,0.0014310477,0.00269751,0.0026075544,0.002365083,0.0026071377,0.0004803158],"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.0000989393,0.000110360656,0.0005216349,0.00018959034,0.00006877229,0.000104769155,0.00017567666,0.5849396,0.00095240603,0.39947924,0.0020708714,0.011288148],"study_design_scores_gemma":[0.0000072352395,0.000023119252,0.00005911483,0.000022586344,0.000005760026,0.000011127014,0.000026990043,0.92964786,0.00015274154,0.069702245,0.00033508436,0.0000060832544],"about_ca_topic_score_codex":0.0044644447,"about_ca_topic_score_gemma":0.0034051037,"teacher_disagreement_score":0.0054409937,"about_ca_system_score_codex":0.0018467763,"about_ca_system_score_gemma":0.0023319863,"threshold_uncertainty_score":0.018201888},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018887786,0.00041834085,0.96641445,0.0007690882,0.00011595843,0.00007047368,0.00018767243,0.000089715344,0.013046488],"genre_scores_gemma":[0.6001406,0.0012734911,0.37830183,0.0007849745,0.0005586623,0.0005368101,0.00095711165,0.00055056944,0.016895942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859494,0.00050415157,0.000078197976,0.00024024455,0.00040990123,0.00017252854],"domain_scores_gemma":[0.9966085,0.0020850399,0.0003482295,0.0001839035,0.0005712873,0.00020306626],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025951602,0.0011389761,0.000889206,0.0011916425,0.0005681812,0.0012679622,0.0010375234,0.001307304,0.0059428494],"category_scores_gemma":[0.008951532,0.00054467435,0.00089857954,0.00071400485,0.0018508134,0.003491244,0.0018461164,0.0035568634,0.00054661214],"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.00006314176,0.00006908329,0.00067533524,0.0002264616,0.000025207819,0.00014117325,0.00013456336,0.15951887,0.0033454467,0.81086004,0.0031376502,0.021803113],"study_design_scores_gemma":[0.000017820628,0.0000562757,0.0003432264,0.000044310367,0.00000927599,0.000066290966,0.000049038495,0.77975667,0.0013057387,0.21502581,0.00330159,0.000023995719],"about_ca_topic_score_codex":0.0011477388,"about_ca_topic_score_gemma":0.0012245236,"teacher_disagreement_score":0.0059428494,"about_ca_system_score_codex":0.0010837265,"about_ca_system_score_gemma":0.0014100315,"threshold_uncertainty_score":0.019880831},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14361343,0.0056695547,0.7998375,0.0024003843,0.00022729099,0.00008632631,0.00034849741,0.00008067951,0.04773634],"genre_scores_gemma":[0.86641407,0.0050921123,0.11539083,0.00043218234,0.00069198187,0.0002655954,0.00065463973,0.00019595095,0.010862628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965688,0.0016752699,0.00015402542,0.0005229876,0.00077366055,0.00030523076],"domain_scores_gemma":[0.99028337,0.0069970614,0.00081131497,0.0002956197,0.00089995394,0.00071267417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041291905,0.0012931365,0.0010206165,0.0023478009,0.0012771514,0.0037797166,0.0010467068,0.0009961553,0.004653723],"category_scores_gemma":[0.013276705,0.0007081736,0.0010279665,0.0020039768,0.006251986,0.00698055,0.0039129737,0.004896745,0.000493753],"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.000027339225,0.000009731465,0.00033694707,0.000044471984,0.000009818805,0.00004960201,0.00017873615,0.0055174325,0.0007356397,0.9890652,0.0003579791,0.0036670538],"study_design_scores_gemma":[0.000010444552,0.000035977784,0.00037420506,0.000043179065,0.0000055356177,0.000066340275,0.00013652131,0.030398373,0.00038584892,0.9657759,0.0027533914,0.000014324177],"about_ca_topic_score_codex":0.0011460923,"about_ca_topic_score_gemma":0.00064978615,"teacher_disagreement_score":0.004653723,"about_ca_system_score_codex":0.001744521,"about_ca_system_score_gemma":0.0006021673,"threshold_uncertainty_score":0.021837473},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077202707,0.0005926411,0.98529875,0.0003154384,0.000070077134,0.000092539485,0.000027767725,0.000055041008,0.0058274386],"genre_scores_gemma":[0.38231802,0.0022116993,0.6003074,0.00041116227,0.000301142,0.0011535032,0.00020744462,0.00040943956,0.012680147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9962309,0.0016793414,0.00020022398,0.0005100181,0.0011280427,0.00025140142],"domain_scores_gemma":[0.99279565,0.004234235,0.00045018722,0.00036915296,0.0017603209,0.00039037835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.010881359,0.0019541848,0.0016863558,0.0032591221,0.0015621284,0.0026593062,0.002689856,0.0025060782,0.003350957],"category_scores_gemma":[0.0208856,0.0006378405,0.0036911042,0.0015050246,0.0044318037,0.0050203498,0.0065642465,0.0057221754,0.00060896965],"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.000038320773,0.000035175446,0.0003849713,0.00018408764,0.000082171966,0.0001640526,0.0004959914,0.03363953,0.0023449273,0.9475534,0.0008579616,0.0142194545],"study_design_scores_gemma":[0.000033265635,0.00016802613,0.00025329765,0.0001322003,0.000051610263,0.00027882715,0.0002240109,0.5277264,0.0029308822,0.46164602,0.006501866,0.00005354931],"about_ca_topic_score_codex":0.0033825068,"about_ca_topic_score_gemma":0.0018044723,"teacher_disagreement_score":0.010881359,"about_ca_system_score_codex":0.0024895095,"about_ca_system_score_gemma":0.0024994286,"threshold_uncertainty_score":0.057546854},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12127715,0.014538458,0.43647325,0.01887522,0.004664227,0.000057585177,0.0003545794,0.0004047833,0.40335482],"genre_scores_gemma":[0.84829915,0.0050231353,0.06803897,0.002871123,0.0017959098,0.000060457296,0.00014214494,0.00032021003,0.07344891],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993693,0.0001195437,0.000028104241,0.00017803622,0.00020741146,0.000097545744],"domain_scores_gemma":[0.9995753,0.00012906999,0.00003695185,0.00008112117,0.000099985926,0.00007755991],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009436259,0.0005988868,0.0004058395,0.0009919116,0.0012360151,0.0019897872,0.00054157834,0.001052911,0.0032471113],"category_scores_gemma":[0.0028184124,0.00030540134,0.0007498154,0.0006095161,0.0043439963,0.0042848885,0.0025433686,0.0032430307,0.00085497426],"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.000011546629,0.0000053132303,0.00007323351,0.000016654934,0.0000025131767,0.000029992552,0.000090262096,0.00040830814,0.0004693249,0.9923286,0.0014682638,0.0050959294],"study_design_scores_gemma":[0.0000084326175,0.000019503856,0.00012249075,0.000016286634,0.0000037775599,0.00010147472,0.000039040402,0.0024139911,0.0008978394,0.9759,0.020464316,0.000012800543],"about_ca_topic_score_codex":0.00078098825,"about_ca_topic_score_gemma":0.00057853654,"teacher_disagreement_score":0.0032471113,"about_ca_system_score_codex":0.0011249407,"about_ca_system_score_gemma":0.00055178296,"threshold_uncertainty_score":0.0108626485},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06830971,0.0039243973,0.8980989,0.0035110419,0.00031294872,0.00012955976,0.00015966472,0.00041651767,0.025137259],"genre_scores_gemma":[0.4919531,0.0036481177,0.47994477,0.0017056658,0.00037373826,0.00041101058,0.00067182066,0.001352956,0.019938864],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9942926,0.0037628305,0.00016447905,0.00048304943,0.000947346,0.00034956096],"domain_scores_gemma":[0.9364835,0.053959087,0.0019990592,0.0016512865,0.0045488924,0.0013581493],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.017487742,0.0019057982,0.0017063771,0.0025904113,0.0019453899,0.0028443336,0.002573793,0.0036129153,0.004799499],"category_scores_gemma":[0.06325123,0.0009295226,0.0014589778,0.0018357324,0.004762623,0.005099419,0.002958928,0.0040636463,0.0007808272],"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.00080647395,0.0002518075,0.003571867,0.00042336286,0.00012524801,0.00022606467,0.00056962034,0.40467006,0.0046697664,0.5344492,0.008448157,0.04178842],"study_design_scores_gemma":[0.0000317523,0.00007799018,0.00030006203,0.0000996649,0.000015689653,0.000053583568,0.00005191873,0.9446926,0.0007627441,0.05307677,0.0008088,0.000028350369],"about_ca_topic_score_codex":0.010993763,"about_ca_topic_score_gemma":0.007656431,"teacher_disagreement_score":0.017487742,"about_ca_system_score_codex":0.0032840944,"about_ca_system_score_gemma":0.0049876054,"threshold_uncertainty_score":0.09248519},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06969336,0.064535424,0.6186622,0.01060273,0.001280028,0.00008135456,0.0007403635,0.00013762606,0.23426694],"genre_scores_gemma":[0.8597663,0.03377946,0.06706388,0.0019353402,0.002413425,0.00016075833,0.0004524848,0.00023543161,0.034193013],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914193,0.0002549807,0.00005248518,0.00017432155,0.00025200407,0.00012423283],"domain_scores_gemma":[0.99898845,0.00048773404,0.00012334423,0.000093926574,0.00023086849,0.00007560395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012233066,0.0007329167,0.0006597202,0.0020103105,0.0009797879,0.0023051086,0.00081115105,0.0007763,0.0037105621],"category_scores_gemma":[0.002875015,0.0003756887,0.00093442015,0.0017560432,0.0042420225,0.0050926665,0.0012824129,0.0023181734,0.0007210617],"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.000006873964,0.0000036724373,0.00023183608,0.000050564227,0.000007887038,0.000063118845,0.00012972309,0.0023088332,0.0002575685,0.98434734,0.0017936084,0.010799036],"study_design_scores_gemma":[0.0000033037838,0.00001833566,0.0007221016,0.00007339603,0.000010514935,0.0003010698,0.0002026251,0.012278993,0.0004467064,0.94231427,0.043614298,0.0000143762145],"about_ca_topic_score_codex":0.003098838,"about_ca_topic_score_gemma":0.0015861968,"teacher_disagreement_score":0.0037105621,"about_ca_system_score_codex":0.0021893731,"about_ca_system_score_gemma":0.000732748,"threshold_uncertainty_score":0.015885055},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01485148,0.0004806541,0.97406197,0.00044954635,0.00010664198,0.00001895166,0.00005243546,0.00013716286,0.009841138],"genre_scores_gemma":[0.5707726,0.001672647,0.38767555,0.0005574891,0.0005590136,0.00022341298,0.0003574098,0.00067691604,0.037505034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986778,0.0003732478,0.00005423935,0.00033088966,0.00044546663,0.00011824974],"domain_scores_gemma":[0.9961935,0.001768272,0.000291527,0.000516979,0.00087701646,0.00035261177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00375215,0.00088427303,0.0009800438,0.0014999134,0.0010939206,0.001822588,0.0013589775,0.0015345709,0.0050124717],"category_scores_gemma":[0.013825278,0.00044960075,0.0009910597,0.0010942823,0.0028716268,0.0036814006,0.0029214558,0.003510991,0.00090090925],"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.000064464926,0.000017818094,0.00044516913,0.00009978955,0.000029843937,0.0000906848,0.00013785463,0.08747535,0.0027972797,0.88438255,0.0027438672,0.021715352],"study_design_scores_gemma":[0.000008161379,0.000075967255,0.00044559088,0.000044821325,0.00002001403,0.000109068045,0.00005500067,0.6098457,0.0022334983,0.3774716,0.009657559,0.00003306875],"about_ca_topic_score_codex":0.003371305,"about_ca_topic_score_gemma":0.0027928012,"teacher_disagreement_score":0.0050124717,"about_ca_system_score_codex":0.0022848165,"about_ca_system_score_gemma":0.0013552468,"threshold_uncertainty_score":0.019843519},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019485853,0.00016004476,0.9950655,0.00009114719,0.000052292035,0.000025868889,0.000032749027,0.000029647033,0.002594182],"genre_scores_gemma":[0.116518326,0.00090052263,0.8692087,0.00019083466,0.0001785733,0.00040183688,0.0002607341,0.00021711686,0.012123377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994778,0.00025541912,0.000020549365,0.00007207925,0.00012488788,0.00004935727],"domain_scores_gemma":[0.9993073,0.00035882334,0.00004244808,0.00005061494,0.0001678974,0.00007299981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015394416,0.00135274,0.0011516743,0.0009594973,0.0005405724,0.0011575685,0.0011365326,0.0011517083,0.004660639],"category_scores_gemma":[0.0030448444,0.0005771349,0.0013163477,0.0008972141,0.0008970517,0.0013633987,0.0019863388,0.0025808404,0.0009776773],"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.00010948345,0.00016024782,0.0004256449,0.00030437257,0.00012479197,0.00014274134,0.00016488948,0.29337817,0.0074102688,0.5716353,0.009958633,0.1161854],"study_design_scores_gemma":[0.000015004508,0.000024982355,0.000064865395,0.000023696124,0.0000148737645,0.000034340916,0.000019012208,0.9158112,0.00031989708,0.080700085,0.0029627716,0.000009221839],"about_ca_topic_score_codex":0.0021185805,"about_ca_topic_score_gemma":0.0027453483,"teacher_disagreement_score":0.004660639,"about_ca_system_score_codex":0.0007653127,"about_ca_system_score_gemma":0.0012537536,"threshold_uncertainty_score":0.015591383},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014677543,0.0008428069,0.97602296,0.0006110186,0.000109132285,0.00007362111,0.000036100137,0.00010641846,0.0075203143],"genre_scores_gemma":[0.30595976,0.0021269633,0.6833779,0.00054897205,0.00018948875,0.0005244809,0.00023436123,0.00040076225,0.0066373567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99695337,0.0018561125,0.00012719914,0.00022445913,0.0006249084,0.00021397807],"domain_scores_gemma":[0.971693,0.023929864,0.0007008903,0.001049062,0.00200114,0.0006260625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014553903,0.0014283131,0.0013684318,0.0019815415,0.001589091,0.0018537747,0.0021110103,0.0022390885,0.0033461493],"category_scores_gemma":[0.046169963,0.0006275369,0.0017166253,0.0012353755,0.0064426214,0.0037949693,0.0032765048,0.0046847654,0.00068956456],"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.00015663076,0.000060035916,0.0008086937,0.00018526398,0.000043412696,0.00017816713,0.00030514906,0.24151714,0.0021585762,0.72608227,0.0022314934,0.02627314],"study_design_scores_gemma":[0.00003203255,0.00008301634,0.00021377478,0.00011701968,0.0000135386745,0.000089161345,0.0000640619,0.7631803,0.0019467814,0.23189406,0.002323463,0.000042735595],"about_ca_topic_score_codex":0.00335703,"about_ca_topic_score_gemma":0.0033696732,"teacher_disagreement_score":0.014553903,"about_ca_system_score_codex":0.0015160186,"about_ca_system_score_gemma":0.0024765946,"threshold_uncertainty_score":0.076969326},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019844085,0.000881448,0.96387786,0.00077294314,0.000088871966,0.000069741574,0.00015732493,0.00006202601,0.014245706],"genre_scores_gemma":[0.7276432,0.0028562807,0.2595618,0.0007517583,0.00036633632,0.00063808507,0.0007465453,0.00024363217,0.007192467],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971073,0.0016474831,0.00016464479,0.00028262645,0.0005575612,0.00024035564],"domain_scores_gemma":[0.99421304,0.0039669387,0.00045213822,0.00020680467,0.0008163067,0.00034463848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068343533,0.0012291546,0.0014218106,0.0017249723,0.00075731275,0.0027725524,0.0012381049,0.0013145286,0.003457218],"category_scores_gemma":[0.013492486,0.0006775348,0.0013096394,0.0014309761,0.0029107414,0.0038843104,0.0032661962,0.0033766944,0.000629311],"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.000054804575,0.000062729516,0.0005033754,0.000364042,0.000037356942,0.00020970208,0.00016126437,0.06191998,0.0028969913,0.91725373,0.0020914248,0.014444587],"study_design_scores_gemma":[0.0000331093,0.00010440469,0.00037592227,0.00014344355,0.000019428939,0.00013690299,0.00013892038,0.44737822,0.0019424253,0.54525894,0.004437024,0.00003137932],"about_ca_topic_score_codex":0.0007427283,"about_ca_topic_score_gemma":0.00046378645,"teacher_disagreement_score":0.0068343533,"about_ca_system_score_codex":0.0010175753,"about_ca_system_score_gemma":0.001778946,"threshold_uncertainty_score":0.03614396},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.074729964,0.0016171979,0.8836574,0.0027772197,0.00030585798,0.00030979345,0.0012308045,0.00029193368,0.035079803],"genre_scores_gemma":[0.80750644,0.0026810763,0.17610085,0.0007809571,0.0007178166,0.00094283826,0.0019663344,0.0003463778,0.008957271],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973333,0.0010018847,0.00021810115,0.00040849746,0.00069165684,0.00034654498],"domain_scores_gemma":[0.9886015,0.006948214,0.0010902241,0.0004057465,0.0023487734,0.0006054866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049816384,0.0018624425,0.0017601195,0.0016994148,0.00097277144,0.0025678703,0.0014514454,0.0021294379,0.009142547],"category_scores_gemma":[0.016614676,0.0011441992,0.0015767937,0.0013928502,0.0027955608,0.004176949,0.0025209195,0.0047433986,0.0012985151],"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.00014849224,0.00016473376,0.0006925273,0.00046011878,0.00008976977,0.00030902433,0.0003145776,0.062037706,0.0075219204,0.91116,0.006551063,0.010550062],"study_design_scores_gemma":[0.00009378591,0.00023235404,0.0009076365,0.00018802844,0.000050018964,0.00020226407,0.0002126193,0.4328104,0.0038779262,0.5526662,0.008689472,0.000069373025],"about_ca_topic_score_codex":0.0016742129,"about_ca_topic_score_gemma":0.0014516037,"teacher_disagreement_score":0.009142547,"about_ca_system_score_codex":0.0013879825,"about_ca_system_score_gemma":0.0028804757,"threshold_uncertainty_score":0.030584872},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17204812,0.000739093,0.8153198,0.00034805233,0.00021632362,0.00007475196,0.000035278317,0.000086261716,0.011132366],"genre_scores_gemma":[0.9136268,0.00038069082,0.071844585,0.00010134879,0.00007680114,0.0001268324,0.000041712912,0.000045404293,0.013755958],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987213,0.0005360014,0.00007570579,0.00019402282,0.0003883213,0.00008460078],"domain_scores_gemma":[0.997306,0.0011738763,0.00026704153,0.00019172966,0.000843095,0.00021834784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024416277,0.00071854895,0.0007292316,0.00079091254,0.00039913587,0.0013977814,0.0011091104,0.00094246067,0.0019751377],"category_scores_gemma":[0.006691561,0.00028052184,0.0006990983,0.0004513786,0.0019114554,0.0015837816,0.001747123,0.00134549,0.00025098355],"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.00041558762,0.00006769481,0.002341919,0.00034618782,0.00013615597,0.00054825144,0.00069519156,0.21145661,0.02799456,0.72189534,0.0009914843,0.033110887],"study_design_scores_gemma":[0.000027189553,0.00021114922,0.00049493625,0.000034639135,0.000016844697,0.00013270664,0.0000715208,0.8950348,0.0047677876,0.097546674,0.0016267655,0.00003507795],"about_ca_topic_score_codex":0.0013160362,"about_ca_topic_score_gemma":0.0006154493,"teacher_disagreement_score":0.0024416277,"about_ca_system_score_codex":0.00076642423,"about_ca_system_score_gemma":0.0008871002,"threshold_uncertainty_score":0.01291275},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08314609,0.0007466876,0.90349007,0.0006134053,0.00007608801,0.000062092935,0.00008571277,0.0000391274,0.0117406435],"genre_scores_gemma":[0.84651023,0.00091488496,0.13937286,0.00016351927,0.00016256611,0.0002374814,0.00013455887,0.00007510199,0.012428851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99940443,0.00027365363,0.000030540537,0.00011378418,0.00011837416,0.000059232843],"domain_scores_gemma":[0.9992254,0.00037835506,0.00013112114,0.000041274212,0.00014448975,0.000079295576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018334244,0.0008574438,0.0007251716,0.00076805835,0.00040795057,0.0015675162,0.0006317207,0.0007866031,0.0028670495],"category_scores_gemma":[0.0032944211,0.00034372983,0.0006320938,0.0007714616,0.0015978797,0.0024062146,0.0016039297,0.0013455092,0.00020941693],"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.0000341995,0.000024620387,0.0002716954,0.000091333226,0.0000306224,0.0000861512,0.00010808894,0.07917727,0.0027316061,0.90600705,0.0006206556,0.010816671],"study_design_scores_gemma":[0.000022816495,0.000075588374,0.00040898868,0.000043749154,0.000016054037,0.00007537092,0.000100615136,0.46503258,0.0012347962,0.52991146,0.0030552002,0.00002271673],"about_ca_topic_score_codex":0.0010248916,"about_ca_topic_score_gemma":0.00085956004,"teacher_disagreement_score":0.0028670495,"about_ca_system_score_codex":0.0012406742,"about_ca_system_score_gemma":0.00093927066,"threshold_uncertainty_score":0.009696186},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12849234,0.0017394918,0.8159684,0.0010740609,0.00017421886,0.00011507599,0.00021632484,0.00013544495,0.052084707],"genre_scores_gemma":[0.80909103,0.001881006,0.16022499,0.0003057997,0.00018961116,0.00033750143,0.00024878132,0.00025418817,0.02746704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991246,0.00035082133,0.00003909837,0.00018806044,0.0001781266,0.00011924245],"domain_scores_gemma":[0.99872524,0.0005233559,0.00020544343,0.000121992074,0.0001953325,0.000228576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016758611,0.0010523564,0.0009932715,0.0020532766,0.0015931134,0.0026381186,0.0011436212,0.0013356622,0.006110064],"category_scores_gemma":[0.0051482785,0.00058062305,0.0010348654,0.0017608275,0.0033409265,0.004119545,0.0034305379,0.0022423004,0.0008039085],"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.000014827518,0.0000117842255,0.0001713296,0.000024560246,0.0000067057335,0.000035052395,0.00006736169,0.004678877,0.0003339114,0.9893497,0.00039148587,0.0049144346],"study_design_scores_gemma":[0.000006646717,0.00003102222,0.00011393359,0.000023405704,0.0000066038474,0.0000823796,0.00008199029,0.054437146,0.00046804873,0.94153446,0.003204219,0.000010135225],"about_ca_topic_score_codex":0.0012514998,"about_ca_topic_score_gemma":0.00092693843,"teacher_disagreement_score":0.006110064,"about_ca_system_score_codex":0.0016362049,"about_ca_system_score_gemma":0.0011421987,"threshold_uncertainty_score":0.02044022},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002121439,0.0009517859,0.9844407,0.0012282755,0.0003047798,0.000027470576,0.00006200197,0.000032383563,0.010831165],"genre_scores_gemma":[0.23081273,0.0042976984,0.68268776,0.001486516,0.0019979426,0.00059337285,0.00032980723,0.00055659673,0.077237494],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903595,0.0005795459,0.000035506197,0.00010111668,0.00018855391,0.000059448423],"domain_scores_gemma":[0.9983734,0.0010732465,0.00009546216,0.000092445,0.00024650941,0.00011897089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029108895,0.001308068,0.0013027963,0.001716859,0.000975951,0.002364814,0.002530057,0.0026332051,0.0070466385],"category_scores_gemma":[0.006566165,0.0012000719,0.0014378635,0.0016264453,0.0029533487,0.002914896,0.0033314356,0.004043643,0.0011133241],"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.0000062017975,0.000013699452,0.000053674717,0.00004167303,0.000016198928,0.000017504162,0.000047252048,0.02168806,0.00030424405,0.9703466,0.0016721372,0.005792778],"study_design_scores_gemma":[0.000008738143,0.00001323015,0.00006428449,0.000027455555,0.000009691707,0.00002160693,0.000023423276,0.21017566,0.00010102111,0.78286594,0.0066749873,0.000013907033],"about_ca_topic_score_codex":0.0043472564,"about_ca_topic_score_gemma":0.004379766,"teacher_disagreement_score":0.0070466385,"about_ca_system_score_codex":0.0021938486,"about_ca_system_score_gemma":0.0023621302,"threshold_uncertainty_score":0.023573339},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047653904,0.0004163432,0.9925599,0.00019472203,0.000025639765,0.0000286398,0.000017950348,0.00006347936,0.0019278926],"genre_scores_gemma":[0.2817257,0.00166025,0.7081799,0.00037122777,0.00016706732,0.0002726779,0.00021477374,0.0002004066,0.007208112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99858534,0.00061453227,0.00007043272,0.00015217286,0.000488907,0.00008856674],"domain_scores_gemma":[0.9966311,0.0025079444,0.000208474,0.00021483398,0.00033759858,0.00010002072],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037870852,0.0008905466,0.0014539169,0.0009368311,0.0004743209,0.0012732884,0.00096332387,0.0014647997,0.001650058],"category_scores_gemma":[0.012107245,0.00046017187,0.00052206434,0.0011072055,0.002291182,0.0026305704,0.0018263315,0.0022612023,0.0005680204],"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.00011149941,0.00007505052,0.0004372107,0.00017726912,0.00003603124,0.00016466227,0.00014387544,0.48384738,0.0027888068,0.43648514,0.0021756003,0.07355748],"study_design_scores_gemma":[0.0000125820725,0.000039312512,0.00007489702,0.000024016203,0.0000029127486,0.00005049564,0.000010925699,0.91866726,0.0005539669,0.0791631,0.0013885336,0.000011898728],"about_ca_topic_score_codex":0.0017451413,"about_ca_topic_score_gemma":0.0012019193,"teacher_disagreement_score":0.0037870852,"about_ca_system_score_codex":0.00077324634,"about_ca_system_score_gemma":0.0012606622,"threshold_uncertainty_score":0.020028234},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35969102,0.0017150147,0.62367564,0.0011052046,0.00011858262,0.00008338365,0.00018924996,0.000088428715,0.013333546],"genre_scores_gemma":[0.9680882,0.0005977385,0.028467884,0.00006679441,0.00006804624,0.00007506947,0.00009991824,0.000026275724,0.0025100212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944574,0.00014573068,0.00004447932,0.00012690474,0.0001572281,0.00007994382],"domain_scores_gemma":[0.9989016,0.00037182117,0.0002647523,0.0000971536,0.0002579587,0.000106721294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015327528,0.00067559816,0.0009495233,0.0012051701,0.000954779,0.0017999945,0.0009139164,0.0011827203,0.0020506636],"category_scores_gemma":[0.0036058465,0.00030589057,0.0010431535,0.0004713691,0.0022351162,0.0030526025,0.0022542174,0.0011461469,0.00014462513],"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.000047509955,0.000019002613,0.0010297189,0.00014286634,0.000049240825,0.00018659727,0.00021208785,0.039079037,0.008827779,0.9443476,0.0003470267,0.0057113525],"study_design_scores_gemma":[0.000025517145,0.0001319852,0.0013727875,0.000058096834,0.000025005113,0.00031366773,0.00027981223,0.47567815,0.004679614,0.5146359,0.0027532026,0.000046278656],"about_ca_topic_score_codex":0.00076736696,"about_ca_topic_score_gemma":0.00048602113,"teacher_disagreement_score":0.0020506636,"about_ca_system_score_codex":0.0013510617,"about_ca_system_score_gemma":0.0004869421,"threshold_uncertainty_score":0.0098026395},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013367709,0.00014929006,0.9824514,0.00017517927,0.000025473451,0.000024802215,0.00004389262,0.000117053234,0.0036452136],"genre_scores_gemma":[0.4073761,0.00097643037,0.5819298,0.00019192172,0.00011530584,0.00016183054,0.00027181418,0.0005326857,0.008444021],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993755,0.00022378594,0.000026172323,0.00012517103,0.00019215757,0.00005715923],"domain_scores_gemma":[0.9988877,0.0005080673,0.00011027318,0.0001522198,0.00021819789,0.00012358022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013696613,0.000676751,0.0005028428,0.0012646442,0.00056270347,0.0024095122,0.0007411085,0.00092760724,0.004479862],"category_scores_gemma":[0.006076983,0.0006695923,0.00077847316,0.0007028412,0.002330984,0.0032571617,0.0032002693,0.0018946426,0.0007970534],"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.000047293535,0.000024499413,0.00047734173,0.00009076717,0.00001938984,0.000076974495,0.00030793954,0.10669194,0.0040143207,0.8313394,0.001762552,0.055147532],"study_design_scores_gemma":[0.000008757861,0.00004423519,0.0003003847,0.000032370375,0.000007919081,0.000089030975,0.00008559429,0.5077659,0.0027940895,0.48261246,0.006239929,0.000019319006],"about_ca_topic_score_codex":0.0015881236,"about_ca_topic_score_gemma":0.0013738543,"teacher_disagreement_score":0.004479862,"about_ca_system_score_codex":0.0009585881,"about_ca_system_score_gemma":0.0010359525,"threshold_uncertainty_score":0.014986634},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039275944,0.00045724405,0.95059186,0.0002875484,0.00005061165,0.000051822546,0.000119743905,0.00015196062,0.009013253],"genre_scores_gemma":[0.7000355,0.0013029955,0.2777197,0.00019858665,0.00014802685,0.00021027385,0.00038563466,0.0005418113,0.019457422],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99903524,0.00040361876,0.000044187804,0.00016253113,0.0002416412,0.000112786634],"domain_scores_gemma":[0.9946296,0.0033477023,0.0005079411,0.00044480097,0.0007063836,0.0003634198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002632812,0.0017121035,0.0016805425,0.0027140845,0.0011483036,0.0027781865,0.003698784,0.0017357648,0.0036503302],"category_scores_gemma":[0.014288817,0.0012736323,0.0017393758,0.001331864,0.002574741,0.003608189,0.0045360927,0.0038351608,0.00036292936],"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.00015196178,0.000067396686,0.0011280456,0.0002513026,0.00006418868,0.00018990783,0.00046278152,0.3261893,0.003489955,0.64434516,0.0009848039,0.022675185],"study_design_scores_gemma":[0.000004658641,0.000044106855,0.00013047695,0.000040074432,0.000024100113,0.0000403701,0.000067222994,0.90935373,0.0007267377,0.08851533,0.0010392767,0.000013936519],"about_ca_topic_score_codex":0.005841027,"about_ca_topic_score_gemma":0.003739106,"teacher_disagreement_score":0.005841027,"about_ca_system_score_codex":0.002666805,"about_ca_system_score_gemma":0.0013399675,"threshold_uncertainty_score":0.019349098},"labels":[],"label_agreement":null},{"id":"W3153160857","doi":"10.1007/s11228-021-00584-2","title":"Resolvents and Yosida Approximations of Displacement Mappings of Isometries","year":2021,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"","keywords":"Mathematics; Monotone polygon; Pure mathematics; Class (philosophy); Operator theory; Subderivative; Displacement (psychology); Set (abstract data type); Algebra over a field; Regular polygon; Convex optimization; Computer science; Geometry","score_opus":0.014195760703829751,"score_gpt":0.24893897843207535,"score_spread":0.2347432177282456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3153160857","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17739512,0.0016620407,0.7951637,0.0008752428,0.0005172617,0.000059477123,0.000177238,0.00012190537,0.024027964],"genre_scores_gemma":[0.82721263,0.0014365739,0.1400992,0.0001937162,0.00023503033,0.00012642074,0.00030767897,0.00020556111,0.03018315],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996119,0.00012303259,0.000022419941,0.000079557634,0.00011038734,0.000052800366],"domain_scores_gemma":[0.99944097,0.00019848881,0.00007714776,0.00005677127,0.00013519905,0.000091324575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009697736,0.00088297355,0.0009187891,0.0013818357,0.00071956764,0.0020270613,0.0011868746,0.001115866,0.002851421],"category_scores_gemma":[0.0038485113,0.0006015271,0.0008015113,0.0007268507,0.0017346992,0.0022515943,0.0021257023,0.00219113,0.00048583563],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004378143,0.000022704196,0.00030087715,0.000057529305,0.000016773625,0.000056991204,0.00022252693,0.021335226,0.002557702,0.9660661,0.00059054425,0.008729193],"study_design_scores_gemma":[0.000018726447,0.000056808432,0.00039983622,0.00003772323,0.000014049144,0.00007962662,0.00029921657,0.50187236,0.0013257662,0.49117845,0.0046889493,0.000028428403],"about_ca_topic_score_codex":0.001911802,"about_ca_topic_score_gemma":0.0016589897,"teacher_disagreement_score":0.002851421,"about_ca_system_score_codex":0.000977627,"about_ca_system_score_gemma":0.0007479189,"threshold_uncertainty_score":0.009538949},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0102256285,0.005591258,0.92151964,0.003822449,0.0029324312,0.00017264785,0.000773664,0.0003076422,0.054654643],"genre_scores_gemma":[0.2766978,0.01469239,0.6439864,0.0068496307,0.004695365,0.0012699874,0.0018333507,0.0014428901,0.048532158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971506,0.0010092438,0.00029214952,0.00046314433,0.00082917005,0.00025577078],"domain_scores_gemma":[0.9959365,0.0014660209,0.000664241,0.00041263094,0.001120983,0.00039961535],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005003597,0.0021587743,0.0010444277,0.003273617,0.0022155957,0.005339304,0.0031099054,0.0022559133,0.010940738],"category_scores_gemma":[0.009122912,0.0006902148,0.0016870623,0.0050825225,0.00578228,0.009119926,0.0030495452,0.0077881347,0.0029246898],"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.000009665186,0.000011446123,0.000047177924,0.00005819083,0.0000027128808,0.00009682064,0.00023020824,0.00079569564,0.0006039869,0.9910885,0.0026213597,0.004434195],"study_design_scores_gemma":[0.000017635288,0.00011062535,0.0003125126,0.00016751245,0.000019785952,0.0003024694,0.00038354206,0.011568483,0.0010762834,0.9025218,0.08345809,0.00006140416],"about_ca_topic_score_codex":0.002528368,"about_ca_topic_score_gemma":0.0022636575,"teacher_disagreement_score":0.010940738,"about_ca_system_score_codex":0.0018092943,"about_ca_system_score_gemma":0.001070047,"threshold_uncertainty_score":0.03660041},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025659915,0.0033629665,0.94815916,0.0010301153,0.00015646548,0.000055081706,0.000049760656,0.0001544027,0.021372097],"genre_scores_gemma":[0.5028864,0.00527238,0.4719297,0.00086556043,0.00035799446,0.00024891307,0.000115168485,0.00024017885,0.018083615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991098,0.00038791477,0.000045580753,0.00015539228,0.00024084706,0.000060379618],"domain_scores_gemma":[0.9982639,0.00078046345,0.0002020477,0.00018298333,0.00042449863,0.00014616582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023752374,0.0007960166,0.0006962771,0.0017671452,0.0011241598,0.0009804248,0.0009340632,0.0011991474,0.0038046278],"category_scores_gemma":[0.0057329745,0.00042404237,0.00094711717,0.001034827,0.0025203438,0.00253027,0.002677883,0.0023585015,0.0006499834],"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.000020958974,0.000016491069,0.00034965924,0.00007564161,0.000009089125,0.00006261575,0.00016112949,0.014061406,0.0029666892,0.95626366,0.0007285944,0.025284111],"study_design_scores_gemma":[0.000016389304,0.00009678098,0.00036016636,0.00010011995,0.000011992592,0.000204926,0.00009924611,0.19904485,0.0038458838,0.7766522,0.01953693,0.000030593153],"about_ca_topic_score_codex":0.0015870793,"about_ca_topic_score_gemma":0.0011441087,"teacher_disagreement_score":0.0038046278,"about_ca_system_score_codex":0.0013451447,"about_ca_system_score_gemma":0.0009028814,"threshold_uncertainty_score":0.012727737},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023222854,0.028386641,0.858808,0.0028156983,0.0017490229,0.000057202546,0.0005014934,0.0004004481,0.0840587],"genre_scores_gemma":[0.41336784,0.023193337,0.45934707,0.0014584728,0.0024452268,0.00022360186,0.0010975165,0.0009655985,0.09790134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950516,0.0001348886,0.000038325154,0.00012512306,0.0001617751,0.000034691584],"domain_scores_gemma":[0.99917275,0.00032365348,0.000072987066,0.00007702224,0.00027533525,0.00007810544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013503496,0.00087009295,0.0007695855,0.0020305358,0.0008353003,0.0021788182,0.0009234555,0.0011447356,0.008891015],"category_scores_gemma":[0.003274786,0.00034275223,0.0008747618,0.0029043343,0.0018176594,0.0023340252,0.0012060399,0.0022019907,0.0025159866],"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.000015287014,0.000018581022,0.00018392826,0.000099617326,0.000008665057,0.000088486304,0.00011308334,0.005877417,0.0010986986,0.9527026,0.004970003,0.034823738],"study_design_scores_gemma":[0.0000074756067,0.00003229291,0.00027013806,0.00004553123,0.0000075760645,0.00020772537,0.000065261724,0.07364457,0.0009305895,0.8838877,0.040870216,0.000030963405],"about_ca_topic_score_codex":0.0027181196,"about_ca_topic_score_gemma":0.0017311804,"teacher_disagreement_score":0.008891015,"about_ca_system_score_codex":0.0016733627,"about_ca_system_score_gemma":0.0008144613,"threshold_uncertainty_score":0.029743433},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004253782,0.029918788,0.94165623,0.005327473,0.0007342019,0.000043939748,0.0001293575,0.000109348875,0.017826928],"genre_scores_gemma":[0.26269588,0.11398288,0.56070775,0.005113734,0.012144543,0.0006276798,0.0007131794,0.00072911015,0.043285206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992854,0.000313685,0.000045442477,0.00014402365,0.0001705001,0.000041073756],"domain_scores_gemma":[0.9988618,0.00075672375,0.00007496898,0.00009341649,0.00017063844,0.000042418793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019206911,0.0010768443,0.0009976565,0.0012853422,0.00059513014,0.0019336224,0.000898372,0.0017598834,0.004031815],"category_scores_gemma":[0.0034802957,0.0005266982,0.0014660801,0.0016486329,0.0030848505,0.0038417843,0.0014439464,0.003858685,0.0010687882],"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.0000105607605,0.000017758062,0.00009974237,0.00024890678,0.000025120524,0.000049653,0.00009553694,0.0060563423,0.0009269371,0.9631869,0.0034738437,0.02580861],"study_design_scores_gemma":[0.000009608324,0.00004928221,0.00026638256,0.00010722617,0.000017518536,0.0000936007,0.000040632065,0.04663485,0.000793686,0.9242823,0.027681377,0.000023443152],"about_ca_topic_score_codex":0.0011863179,"about_ca_topic_score_gemma":0.00061735563,"teacher_disagreement_score":0.004031815,"about_ca_system_score_codex":0.0009304535,"about_ca_system_score_gemma":0.000694597,"threshold_uncertainty_score":0.013487756},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03684481,0.0019216144,0.88972676,0.003136137,0.00034661006,0.00006514769,0.0001897041,0.000066150336,0.06770304],"genre_scores_gemma":[0.8066768,0.0029612256,0.13947578,0.0014126885,0.00049524195,0.0003080102,0.00029253992,0.00020665815,0.04817113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993293,0.00016600467,0.000026420332,0.00016939429,0.00020942334,0.000099420926],"domain_scores_gemma":[0.99895084,0.0005441406,0.00010599067,0.000047124395,0.00023922684,0.00011265574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018063559,0.00081370265,0.0007908616,0.00081497413,0.00086621125,0.0019586233,0.00097493414,0.0015124492,0.0051842504],"category_scores_gemma":[0.0043105497,0.00035174613,0.0009169622,0.00055524387,0.0028813768,0.0025917313,0.0023204663,0.0027084306,0.0006170474],"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.000025642947,0.000020572721,0.0002158736,0.00005750064,0.000016374996,0.000106283616,0.000089766305,0.0124754,0.006542049,0.9743541,0.0011696195,0.0049267975],"study_design_scores_gemma":[0.000031354353,0.000075453994,0.00063839264,0.000078216784,0.000033615477,0.00033904094,0.000103572,0.38160902,0.0035862632,0.60399425,0.009463944,0.00004679294],"about_ca_topic_score_codex":0.0034606005,"about_ca_topic_score_gemma":0.0022510043,"teacher_disagreement_score":0.0051842504,"about_ca_system_score_codex":0.002302624,"about_ca_system_score_gemma":0.002080036,"threshold_uncertainty_score":0.017343104},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15044844,0.010651777,0.57418174,0.0014067987,0.00081453944,0.00011156434,0.0008864998,0.00018647216,0.26131225],"genre_scores_gemma":[0.85854375,0.008112675,0.10080589,0.00071449054,0.001144207,0.00023884942,0.0013037833,0.00023909828,0.028897192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821705,0.00060362753,0.000089087385,0.0002984659,0.0005310717,0.0002606199],"domain_scores_gemma":[0.9973693,0.0012555282,0.00036514405,0.00015045797,0.0005448128,0.0003148327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017183414,0.000952047,0.00058305,0.0025746685,0.0012229559,0.003386621,0.000679576,0.00067907845,0.008976771],"category_scores_gemma":[0.0059533883,0.0004650734,0.000617879,0.0018019171,0.0032170345,0.0046142875,0.0027516505,0.0029936573,0.0014565152],"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.000021345204,0.000004674783,0.00026193412,0.000029189629,0.0000035411508,0.00003284987,0.0000959835,0.0013191724,0.00037994084,0.98934084,0.00086387584,0.0076465528],"study_design_scores_gemma":[0.000011726848,0.000048577283,0.0005959203,0.00007657176,0.0000055980327,0.00012831396,0.00026381193,0.008810866,0.00047729374,0.9717382,0.01782615,0.000017013781],"about_ca_topic_score_codex":0.0010668102,"about_ca_topic_score_gemma":0.00067813555,"teacher_disagreement_score":0.008976771,"about_ca_system_score_codex":0.0010104785,"about_ca_system_score_gemma":0.00040225795,"threshold_uncertainty_score":0.03003025},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035980446,0.000109469234,0.99548644,0.000055275632,0.000025815469,0.000016589538,0.000007448467,0.000089477166,0.00061140134],"genre_scores_gemma":[0.22820373,0.0005274713,0.76692605,0.0000877519,0.000095731535,0.00022913958,0.000065987035,0.00014510263,0.0037189675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999574,0.00013275798,0.000018156692,0.000067034394,0.00017253372,0.000035531793],"domain_scores_gemma":[0.9995505,0.00020396037,0.000033991124,0.000052155847,0.00012411071,0.000035241577],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090057583,0.00082845567,0.0011539876,0.00047180356,0.0005077447,0.0006339152,0.0010012902,0.00062475156,0.0019486406],"category_scores_gemma":[0.0016421182,0.00034492405,0.0006252227,0.0006996425,0.0008153054,0.0007244784,0.0010966256,0.0013127376,0.00041621507],"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.00011064514,0.000057975536,0.00026103813,0.0001814316,0.000052595467,0.000116296644,0.000086386426,0.84884924,0.006818867,0.059250813,0.0014935021,0.082721315],"study_design_scores_gemma":[0.00000923333,0.000025168974,0.000029089491,0.000003269414,0.000004614378,0.000017177374,0.00000412465,0.99064624,0.0010722072,0.0073573855,0.00082809076,0.000003381303],"about_ca_topic_score_codex":0.0027839947,"about_ca_topic_score_gemma":0.0023234389,"teacher_disagreement_score":0.0027839947,"about_ca_system_score_codex":0.00052973366,"about_ca_system_score_gemma":0.001525583,"threshold_uncertainty_score":0.0065189004},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29839042,0.0030881222,0.5861007,0.0041076834,0.000540802,0.00007017844,0.00034763102,0.0004917217,0.10686278],"genre_scores_gemma":[0.8850886,0.0024481043,0.05722647,0.00081734714,0.000608523,0.0001807091,0.0005275942,0.0004136291,0.052689075],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991007,0.000361154,0.000032184238,0.000114358816,0.00025643822,0.00013519131],"domain_scores_gemma":[0.991028,0.0049764663,0.0007850326,0.00044517388,0.0017320521,0.0010332682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033785577,0.001033273,0.0009355458,0.0029518984,0.0010145719,0.00194058,0.0015359693,0.0017951988,0.008998857],"category_scores_gemma":[0.020491224,0.00067010714,0.0006597611,0.00093857606,0.002693275,0.0037195098,0.0023093817,0.0026154635,0.0010163598],"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.000060684488,0.00003709611,0.0005764367,0.00006640404,0.000012117433,0.000080509286,0.00014172951,0.012188882,0.002144295,0.9761155,0.0015791232,0.0069971103],"study_design_scores_gemma":[0.000025224319,0.00006482013,0.0011161352,0.00006593992,0.000012040685,0.00021793021,0.0001569959,0.23297203,0.0010252558,0.7611154,0.0031949307,0.000033362598],"about_ca_topic_score_codex":0.0021346493,"about_ca_topic_score_gemma":0.0016998621,"teacher_disagreement_score":0.008998857,"about_ca_system_score_codex":0.0018147368,"about_ca_system_score_gemma":0.0009245437,"threshold_uncertainty_score":0.03010422},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06123763,0.00256951,0.9202683,0.0009180237,0.00018581827,0.00013379203,0.00010180369,0.00007504258,0.014510105],"genre_scores_gemma":[0.74563456,0.0039058502,0.2337917,0.0004545004,0.00046389492,0.00073257956,0.00027997085,0.00020757648,0.014529394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734616,0.00118116,0.0001548156,0.00048233353,0.00064103585,0.00019447358],"domain_scores_gemma":[0.9957188,0.0023578391,0.0003604574,0.00019292919,0.0010860234,0.000284029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0076274443,0.002230716,0.0016684518,0.00391208,0.0013853454,0.0019745775,0.0018842402,0.0017865993,0.0027604247],"category_scores_gemma":[0.013305753,0.0006022568,0.0032920016,0.0018875037,0.003833811,0.0060633267,0.0044759056,0.0039822226,0.00027133618],"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.000043509153,0.000029062201,0.00033352594,0.00017996176,0.0001027935,0.00019574628,0.00048480232,0.019056058,0.003727037,0.9650334,0.0006215642,0.010192335],"study_design_scores_gemma":[0.0000396727,0.00019495563,0.0005270674,0.00011336091,0.000059383026,0.00032931555,0.0003304558,0.26764053,0.0029938747,0.723091,0.0046298075,0.00005049225],"about_ca_topic_score_codex":0.002735906,"about_ca_topic_score_gemma":0.0014024036,"teacher_disagreement_score":0.0076274443,"about_ca_system_score_codex":0.0022282158,"about_ca_system_score_gemma":0.0017280186,"threshold_uncertainty_score":0.040338278},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004264007,0.0003707894,0.99265844,0.00029205275,0.000043136362,0.000050296116,0.00002277716,0.00010808663,0.0021904728],"genre_scores_gemma":[0.09871628,0.00046077184,0.8953657,0.00036226393,0.000121671495,0.0002692235,0.00018495892,0.00021168143,0.004307391],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972566,0.0013739837,0.00013122997,0.00028708566,0.00075018575,0.00020094363],"domain_scores_gemma":[0.994816,0.0036757956,0.00029423405,0.00042030396,0.0005924979,0.00020119648],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008198039,0.0014533645,0.0019307781,0.0018329385,0.001097236,0.0015478287,0.00268501,0.0025555003,0.0032008155],"category_scores_gemma":[0.01662317,0.0009592381,0.0014310974,0.0016218325,0.003178287,0.0022083605,0.0041802684,0.0032801523,0.0008060817],"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.00021161376,0.00008623315,0.0013781078,0.0002143041,0.00011224229,0.00023929818,0.00029344225,0.5525469,0.0017164802,0.36558414,0.0040185913,0.07359859],"study_design_scores_gemma":[0.000030276315,0.000045071025,0.00008115601,0.000037543283,0.000007775681,0.0000354861,0.000021075606,0.8897933,0.00036971507,0.107476115,0.0020879481,0.000014682519],"about_ca_topic_score_codex":0.0059183193,"about_ca_topic_score_gemma":0.0063017095,"teacher_disagreement_score":0.008198039,"about_ca_system_score_codex":0.0016035662,"about_ca_system_score_gemma":0.003210561,"threshold_uncertainty_score":0.043355882},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014614226,0.00042279254,0.97953874,0.0002689099,0.00007472175,0.000080770056,0.000034584726,0.000071452065,0.0048938855],"genre_scores_gemma":[0.39241347,0.0012976467,0.5925978,0.0002851268,0.00016855155,0.0008161147,0.00021661297,0.00022185907,0.011982916],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901855,0.00041239723,0.000066604334,0.00017137255,0.00026461395,0.00006652669],"domain_scores_gemma":[0.99726355,0.0016987512,0.00013251392,0.00013946055,0.0006361159,0.00012951362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005108715,0.0012881971,0.0008284612,0.0016005542,0.0008260498,0.0014175093,0.0013540193,0.0012316849,0.0035002423],"category_scores_gemma":[0.00941491,0.00039031985,0.0016904194,0.00068805605,0.0023453436,0.0023468875,0.002635528,0.0027568084,0.00057993556],"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.00011347871,0.00006405539,0.0009159936,0.00032657242,0.00009349436,0.00015569373,0.00037048635,0.118274614,0.009998125,0.8193515,0.0015643284,0.048771672],"study_design_scores_gemma":[0.000029015653,0.00017120223,0.0004047442,0.00008179453,0.000027701375,0.0001525169,0.00010373478,0.7483176,0.006677165,0.23965853,0.004337305,0.00003873891],"about_ca_topic_score_codex":0.0011360457,"about_ca_topic_score_gemma":0.00082015287,"teacher_disagreement_score":0.005108715,"about_ca_system_score_codex":0.0011879841,"about_ca_system_score_gemma":0.0011974775,"threshold_uncertainty_score":0.027017772},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20651975,0.0004383025,0.77309835,0.00040223854,0.00006354628,0.0001033367,0.00013954732,0.00016880478,0.019066121],"genre_scores_gemma":[0.98385394,0.00013384022,0.012059724,0.000052907,0.000010219076,0.000090680165,0.000031859767,0.000011815002,0.00375514],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989116,0.00046678336,0.000038445378,0.00015688756,0.000229492,0.00019683853],"domain_scores_gemma":[0.99812895,0.0012967277,0.00028874155,0.00004626536,0.00014143581,0.00009782166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013593173,0.0009980258,0.00083659595,0.0005454742,0.0005855486,0.0014665868,0.00090418477,0.001134678,0.0024521835],"category_scores_gemma":[0.0039339475,0.00039567435,0.00065548765,0.00038209662,0.0018722303,0.0011671298,0.0010432111,0.0009898145,0.00016019243],"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.00011885707,0.000062468695,0.0008816437,0.00012238197,0.0000647806,0.00033807056,0.00020193796,0.7510757,0.0034397389,0.2392197,0.00033294593,0.0041417065],"study_design_scores_gemma":[0.000031064814,0.00005169833,0.00018429363,0.000009572829,0.00001001295,0.00003513845,0.00005962814,0.9471402,0.0004165118,0.051622182,0.0004266437,0.000012995316],"about_ca_topic_score_codex":0.00569844,"about_ca_topic_score_gemma":0.0030682727,"teacher_disagreement_score":0.00569844,"about_ca_system_score_codex":0.0019696953,"about_ca_system_score_gemma":0.0009909642,"threshold_uncertainty_score":0.014291227},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11812103,0.00026379203,0.87854964,0.00034127818,0.000049230955,0.00004881859,0.000011545908,0.00006313234,0.0025515633],"genre_scores_gemma":[0.7924993,0.00025917086,0.20289432,0.000082500366,0.000039375635,0.00016538442,0.00004015845,0.000045571243,0.0039742338],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991148,0.00040564945,0.000039311326,0.00011347047,0.00024741463,0.00007937093],"domain_scores_gemma":[0.9972696,0.0016830511,0.0002213706,0.00014020684,0.00045581814,0.0002300312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033334533,0.0008262234,0.0008733906,0.00069006387,0.00080773555,0.0012814874,0.001308782,0.0014421832,0.0010869711],"category_scores_gemma":[0.0077083185,0.00032320715,0.0012157324,0.0003145339,0.0026254621,0.001500675,0.002892172,0.0022083803,0.000121948666],"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.0002959496,0.0001459263,0.0026116516,0.00038799286,0.0001705957,0.0003660936,0.0009370172,0.44631025,0.03978312,0.4762149,0.0006990008,0.03207749],"study_design_scores_gemma":[0.000010724041,0.00007923019,0.000117842734,0.000017922159,0.0000056253834,0.000049201008,0.00004944098,0.9775146,0.00258487,0.019161008,0.00040088216,0.000008702376],"about_ca_topic_score_codex":0.0022653996,"about_ca_topic_score_gemma":0.001027473,"teacher_disagreement_score":0.0033334533,"about_ca_system_score_codex":0.0014016525,"about_ca_system_score_gemma":0.0012038901,"threshold_uncertainty_score":0.017629147},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.043292295,0.0043963855,0.93290997,0.0012946823,0.00022589049,0.000058235313,0.00014111795,0.00009307929,0.017588312],"genre_scores_gemma":[0.79338026,0.0073854183,0.1747546,0.0011767064,0.0007052153,0.00021746276,0.00041153657,0.00040074135,0.02156798],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978194,0.00085698755,0.00009797475,0.0003900234,0.00057612563,0.00025942302],"domain_scores_gemma":[0.99002063,0.0063812872,0.00043085642,0.00062458246,0.0018357848,0.00070685416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007596704,0.0014312897,0.0013040972,0.0036530923,0.00095142913,0.00234738,0.0016756257,0.0014836625,0.004932702],"category_scores_gemma":[0.018257862,0.00083709636,0.0022205145,0.0011438178,0.004311475,0.005437196,0.0044025574,0.0059757796,0.00085012853],"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.00006099449,0.000022139544,0.0006581038,0.00021797227,0.000030806325,0.00015908625,0.00035436617,0.012520457,0.0040469402,0.9701545,0.00087854936,0.010896131],"study_design_scores_gemma":[0.00001799465,0.00023873767,0.0017610431,0.00023683079,0.00006025611,0.00050709356,0.00027682265,0.3079671,0.008332482,0.66476583,0.01575418,0.000081655824],"about_ca_topic_score_codex":0.0017700343,"about_ca_topic_score_gemma":0.0010946998,"teacher_disagreement_score":0.007596704,"about_ca_system_score_codex":0.0021792692,"about_ca_system_score_gemma":0.0011739704,"threshold_uncertainty_score":0.040175676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040486115,0.00021335587,0.99216026,0.000084242885,0.000040276343,0.000037822057,0.000012236751,0.000044510987,0.0033587045],"genre_scores_gemma":[0.33602408,0.0010272478,0.64732474,0.00022254161,0.000111711626,0.0005586533,0.00018442971,0.00012793203,0.014418652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993855,0.00023676222,0.000042660242,0.000092111426,0.00017948785,0.000063459396],"domain_scores_gemma":[0.999238,0.0003760346,0.00008570114,0.00006869606,0.00017822057,0.00005346046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016580746,0.00072932016,0.0007064864,0.0006841335,0.0005095473,0.0007989789,0.0014644517,0.0013794506,0.0039358614],"category_scores_gemma":[0.0033276286,0.00032587483,0.0010438747,0.00044064262,0.0010959061,0.0014383107,0.002268086,0.0017605376,0.00064922596],"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.000081701735,0.000078511184,0.00050292345,0.00031236373,0.000055192708,0.00014554105,0.00037534817,0.3351794,0.006695898,0.5975171,0.0023039046,0.056752205],"study_design_scores_gemma":[0.0000133052645,0.000040562652,0.00004584688,0.000018338813,0.0000061125616,0.000043569198,0.000026072987,0.9600197,0.0008932707,0.035927225,0.0029544625,0.00001153639],"about_ca_topic_score_codex":0.0013661953,"about_ca_topic_score_gemma":0.0016549188,"teacher_disagreement_score":0.0039358614,"about_ca_system_score_codex":0.0007968514,"about_ca_system_score_gemma":0.00087344635,"threshold_uncertainty_score":0.013166785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07025137,0.0020213984,0.9074439,0.0006719165,0.00012149402,0.00008712065,0.00013039118,0.0002374884,0.019034997],"genre_scores_gemma":[0.8035427,0.0022642661,0.18083186,0.00037507387,0.00022327885,0.00038960917,0.00030943108,0.0004985026,0.0115652755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99803144,0.00068775355,0.0001001285,0.00035029417,0.0005269841,0.00030336645],"domain_scores_gemma":[0.9915342,0.004781519,0.0008508523,0.0006511025,0.0012326015,0.0009498803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00445,0.002283646,0.0014480622,0.003110497,0.0013617954,0.0023809886,0.0020036604,0.0017140695,0.0047653834],"category_scores_gemma":[0.021490972,0.00079360127,0.0014751091,0.0013290624,0.0046598073,0.006856024,0.0054472336,0.0042555872,0.0006001736],"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.000036585254,0.000026543463,0.0005924407,0.00011027359,0.000025968699,0.00008221625,0.000166441,0.0441186,0.002631448,0.94532925,0.0006192047,0.0062608984],"study_design_scores_gemma":[0.000008889459,0.00007585579,0.00042044214,0.00009931604,0.000020810647,0.00010638364,0.00007656944,0.4117337,0.0029019723,0.5814907,0.003028281,0.0000371572],"about_ca_topic_score_codex":0.001360275,"about_ca_topic_score_gemma":0.0016191492,"teacher_disagreement_score":0.0047653834,"about_ca_system_score_codex":0.0031202827,"about_ca_system_score_gemma":0.0012478462,"threshold_uncertainty_score":0.02353412},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12056327,0.0016540609,0.860644,0.0017503826,0.00011471918,0.00010619954,0.00013941307,0.000136132,0.014891838],"genre_scores_gemma":[0.8686553,0.0028017731,0.11881957,0.00031201923,0.00018446443,0.00025664314,0.00020790788,0.00014832402,0.008613972],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991781,0.00032116318,0.000037508282,0.00019319942,0.00015932896,0.00011057286],"domain_scores_gemma":[0.99521625,0.0031004467,0.00055884436,0.00019338357,0.00054232066,0.00038879394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032107397,0.0015539794,0.0012898509,0.0016722041,0.0011147403,0.001891086,0.0010986981,0.0020766517,0.0041245716],"category_scores_gemma":[0.010615928,0.00054269604,0.0016738264,0.0008329616,0.0049169594,0.003168716,0.003738882,0.0032722608,0.00029374703],"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.00020649607,0.00006803617,0.0009978373,0.00044349712,0.00008192317,0.00039411688,0.00080440636,0.105073385,0.0123243965,0.8636053,0.0016179862,0.01438256],"study_design_scores_gemma":[0.000052802297,0.00015545115,0.00057183683,0.0000836868,0.00004280459,0.00019498315,0.0002713232,0.71583515,0.0042860205,0.27635103,0.002110759,0.000044103585],"about_ca_topic_score_codex":0.0010013226,"about_ca_topic_score_gemma":0.00048045127,"teacher_disagreement_score":0.0041245716,"about_ca_system_score_codex":0.0010334969,"about_ca_system_score_gemma":0.00084144156,"threshold_uncertainty_score":0.01698023},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008828743,0.0006294365,0.96647257,0.0006621539,0.000252349,0.000026420374,0.000107580425,0.00025012603,0.022770563],"genre_scores_gemma":[0.42227492,0.0033037688,0.47490236,0.001938505,0.0009943695,0.000213541,0.0005244326,0.0012572615,0.094590925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988174,0.0003059486,0.00004662208,0.00026798062,0.00041507985,0.00014696973],"domain_scores_gemma":[0.99861646,0.00036537516,0.00011304932,0.00023145787,0.0004772365,0.00019638368],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017836891,0.0010704476,0.0010476006,0.0014807082,0.0011709745,0.0021901515,0.0013501286,0.0017077504,0.0117570935],"category_scores_gemma":[0.005441579,0.0004488022,0.0010758656,0.0011294478,0.0024615184,0.0037782968,0.0034243977,0.0027986264,0.003966885],"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.000033751814,0.00002013463,0.00017428985,0.000076629665,0.000027004002,0.000073850504,0.000108144435,0.029835287,0.0031087864,0.92739964,0.0053294604,0.03381301],"study_design_scores_gemma":[0.000011605205,0.000094564275,0.00023628076,0.00004546434,0.000022739318,0.00023003883,0.0000585925,0.19223325,0.0031719438,0.7726847,0.031161916,0.000048873906],"about_ca_topic_score_codex":0.0012692714,"about_ca_topic_score_gemma":0.0015064153,"teacher_disagreement_score":0.0117570935,"about_ca_system_score_codex":0.0011427324,"about_ca_system_score_gemma":0.0013872433,"threshold_uncertainty_score":0.039331436},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014143,0.0005961673,0.9815766,0.00028938422,0.000109010965,0.00016539708,0.000029565872,0.000094521776,0.0029962454],"genre_scores_gemma":[0.1526907,0.001138743,0.838049,0.00028416928,0.00012980944,0.0006195866,0.0001488477,0.00027005657,0.006669107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890494,0.00049346365,0.00006567466,0.00015014956,0.00029282487,0.00009285225],"domain_scores_gemma":[0.99732983,0.0014532519,0.00015611509,0.00025729995,0.00061857636,0.00018491344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004726471,0.0017134618,0.0018872747,0.0018761756,0.0012006887,0.0014350018,0.0016404954,0.0021087644,0.002195935],"category_scores_gemma":[0.009684108,0.0009097439,0.0022533122,0.0013014978,0.0034825325,0.0024498282,0.0040866393,0.0050609033,0.00069383945],"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.00038624066,0.0002201774,0.0017271567,0.0006372655,0.00021060569,0.00019805282,0.0016421936,0.18353315,0.016673991,0.55088896,0.0033255816,0.2405566],"study_design_scores_gemma":[0.000050893817,0.00026305308,0.0003857525,0.000077351106,0.000039640192,0.00014255404,0.00016919286,0.8665493,0.0057475613,0.12122559,0.0052793543,0.00006973936],"about_ca_topic_score_codex":0.0033508788,"about_ca_topic_score_gemma":0.002155777,"teacher_disagreement_score":0.004726471,"about_ca_system_score_codex":0.0012738106,"about_ca_system_score_gemma":0.002195653,"threshold_uncertainty_score":0.02499628},"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":"other","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030340503,0.017620798,0.34253022,0.004997637,0.0015827359,0.000083160965,0.0005948573,0.0003003714,0.62925625],"genre_scores_gemma":[0.30879262,0.050876178,0.24602045,0.0041134735,0.005380229,0.00086081773,0.0012204126,0.0014892169,0.38124666],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99955004,0.00009248345,0.000020947547,0.00007535196,0.00021518639,0.000045903296],"domain_scores_gemma":[0.999466,0.00034594265,0.000027418211,0.000046147907,0.00009494888,0.000019574776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065653486,0.0009785827,0.0011349401,0.00085010944,0.0006441625,0.0021689383,0.0009319321,0.0015577667,0.01718982],"category_scores_gemma":[0.0026711025,0.0008101055,0.00062687194,0.0009281376,0.0026644003,0.0026821843,0.000976931,0.0033246928,0.0043238443],"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.000009874237,0.000013239792,0.00002188127,0.00013808909,0.0000051960874,0.00001923067,0.0000592121,0.002791721,0.00051510317,0.9599404,0.018818293,0.017667701],"study_design_scores_gemma":[0.000006198417,0.000008372025,0.00010179722,0.00008983136,0.0000060789107,0.000044329718,0.000029743176,0.0059577683,0.00045613988,0.93378055,0.05951047,0.000008897266],"about_ca_topic_score_codex":0.0018232212,"about_ca_topic_score_gemma":0.0017546789,"teacher_disagreement_score":0.01718982,"about_ca_system_score_codex":0.0012973425,"about_ca_system_score_gemma":0.0015529032,"threshold_uncertainty_score":0.057505727},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006960828,0.00014110249,0.9975616,0.00007445797,0.000068383175,0.000023040433,0.000014383793,0.000046466583,0.0013745574],"genre_scores_gemma":[0.13009946,0.0010075152,0.8464835,0.0005442215,0.00041072487,0.0004964674,0.00020285214,0.00029749054,0.020457676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993697,0.0002074329,0.00003073914,0.00010908327,0.0002468211,0.000036213718],"domain_scores_gemma":[0.999532,0.00020941767,0.00002637335,0.00002992131,0.00016364898,0.000038731316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014654414,0.0007961828,0.0007390199,0.00081459095,0.00047677985,0.0007362082,0.0013885993,0.0010553538,0.0045960075],"category_scores_gemma":[0.0015736874,0.00035054836,0.0010129677,0.00040948685,0.00093562953,0.0015012923,0.0016767372,0.0023097235,0.0010381166],"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.00023382378,0.00014989024,0.00057928707,0.0014298317,0.000195585,0.00034866447,0.0004425268,0.19544858,0.0760502,0.4764909,0.010619135,0.23801158],"study_design_scores_gemma":[0.000019271647,0.000110202935,0.00010275668,0.000032790806,0.000018869508,0.00010990958,0.000018904128,0.9682049,0.0040928572,0.017822262,0.0094372295,0.00002997331],"about_ca_topic_score_codex":0.0014731537,"about_ca_topic_score_gemma":0.0016736749,"teacher_disagreement_score":0.0045960075,"about_ca_system_score_codex":0.00068852963,"about_ca_system_score_gemma":0.0009926434,"threshold_uncertainty_score":0.015375137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05734585,0.00032515824,0.9398477,0.00022012579,0.000032236538,0.00004579141,0.000024455341,0.00003826278,0.0021204285],"genre_scores_gemma":[0.5774428,0.0006344227,0.41302282,0.00016075419,0.00007875104,0.00028833174,0.00021828237,0.00009153446,0.008062245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884015,0.00048958755,0.00006925535,0.00023016662,0.00027504418,0.0000957186],"domain_scores_gemma":[0.99639755,0.0022614123,0.000329866,0.00019964899,0.0005187402,0.000292877],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004147575,0.0012191805,0.0012695107,0.0016460944,0.00087195577,0.0014807725,0.0015877148,0.0018058505,0.0016504445],"category_scores_gemma":[0.009834735,0.0004324249,0.0015958257,0.0007047367,0.002583224,0.00328539,0.0038660034,0.0021468727,0.00017016665],"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.000111450056,0.00006646107,0.0016488909,0.00026199172,0.00008066915,0.00020500872,0.00042947748,0.22498658,0.0049753054,0.74113715,0.00070556125,0.0253915],"study_design_scores_gemma":[0.000008673682,0.00006201808,0.00018028327,0.000027835173,0.000009302282,0.00010712586,0.00010052991,0.87235034,0.0015201882,0.12461982,0.0009962661,0.000017592665],"about_ca_topic_score_codex":0.0019885008,"about_ca_topic_score_gemma":0.0015716067,"teacher_disagreement_score":0.004147575,"about_ca_system_score_codex":0.0015688862,"about_ca_system_score_gemma":0.0010457953,"threshold_uncertainty_score":0.021934748},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013029622,0.00037384804,0.9838944,0.00021982947,0.0000468319,0.000060619375,0.00003070049,0.00009462108,0.00224956],"genre_scores_gemma":[0.4363431,0.0012450845,0.5532237,0.0005436475,0.0003398881,0.0007521814,0.00026626803,0.00038187866,0.006904281],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9936619,0.0035685445,0.00026613433,0.000898511,0.0012249233,0.00037990324],"domain_scores_gemma":[0.98786074,0.007837649,0.0008902089,0.0010872401,0.001737345,0.00058688404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009863305,0.0022334207,0.0022462714,0.0020012236,0.0011880265,0.002473356,0.0026672778,0.0024713192,0.0033506304],"category_scores_gemma":[0.03438664,0.000937061,0.001906769,0.0014798075,0.0040472415,0.0051756063,0.005885355,0.0041313185,0.000570201],"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.00028434853,0.000070225855,0.00086790323,0.00044908788,0.00018533216,0.0001761648,0.000353811,0.28487745,0.00523673,0.6674645,0.0016189968,0.0384154],"study_design_scores_gemma":[0.000043319043,0.00016697515,0.00020258849,0.00006237907,0.00002934156,0.000089248795,0.000060844053,0.7515962,0.0015911928,0.24411367,0.0020162284,0.000028002425],"about_ca_topic_score_codex":0.0011626297,"about_ca_topic_score_gemma":0.00092841353,"teacher_disagreement_score":0.009863305,"about_ca_system_score_codex":0.0014611378,"about_ca_system_score_gemma":0.0019306752,"threshold_uncertainty_score":0.052162766},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0753328,0.0002918063,0.8913726,0.0013422226,0.00009614872,0.00016699803,0.00067664334,0.00026911212,0.030451573],"genre_scores_gemma":[0.82574815,0.00084691605,0.16076036,0.00067252765,0.00013752462,0.00079254835,0.0012346659,0.00031410187,0.0094931545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977489,0.0005309614,0.00021278526,0.00048739466,0.00071095896,0.00030901344],"domain_scores_gemma":[0.99435,0.0029619802,0.00059323094,0.0004234109,0.0013002488,0.000371115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033981719,0.0008784587,0.0010344534,0.0012737621,0.00084688474,0.002101381,0.00093432225,0.0014717277,0.00904869],"category_scores_gemma":[0.01662369,0.00066780404,0.0016659533,0.0006838363,0.0028521924,0.003809328,0.0025444357,0.0034932755,0.0009138606],"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.000059344817,0.00004785976,0.0009773987,0.00011930718,0.000020123909,0.00018912122,0.00015451647,0.044425398,0.005280196,0.9387411,0.001727677,0.008258021],"study_design_scores_gemma":[0.000049676033,0.00012262898,0.0008598656,0.00007254662,0.00001628245,0.00016212222,0.00014843712,0.31882492,0.0041907323,0.66919136,0.0063197017,0.000041815616],"about_ca_topic_score_codex":0.001874032,"about_ca_topic_score_gemma":0.0017646278,"teacher_disagreement_score":0.00904869,"about_ca_system_score_codex":0.0015498365,"about_ca_system_score_gemma":0.0021802003,"threshold_uncertainty_score":0.030270934},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02958025,0.0028150415,0.95682806,0.0020159583,0.00018370384,0.000029864565,0.00008677787,0.0001500968,0.008310199],"genre_scores_gemma":[0.66183364,0.006040482,0.29854837,0.00075408915,0.0007022113,0.00022571965,0.0003202569,0.00053817284,0.031037042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972421,0.0015704469,0.00010986684,0.00032442916,0.0005572686,0.000195862],"domain_scores_gemma":[0.99253815,0.005488495,0.00038820464,0.0005286263,0.00062742777,0.00042908217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005283243,0.001208837,0.0021584404,0.002279877,0.0010492796,0.0040634302,0.001915374,0.0024716365,0.0029368266],"category_scores_gemma":[0.017792651,0.001356425,0.0012499195,0.0017908274,0.003766013,0.0077169496,0.004459846,0.005144036,0.00045251683],"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.00004553246,0.000041358024,0.000283346,0.00011099619,0.000040101095,0.000031125208,0.00015687193,0.038411878,0.00057554006,0.9401772,0.0017091951,0.018416839],"study_design_scores_gemma":[0.0000087664275,0.00002967237,0.00014768595,0.00002748017,0.000015313188,0.00004046942,0.000050594692,0.1807508,0.00032018422,0.81709343,0.0015048229,0.000010787231],"about_ca_topic_score_codex":0.0017142621,"about_ca_topic_score_gemma":0.0012095834,"teacher_disagreement_score":0.005283243,"about_ca_system_score_codex":0.002165832,"about_ca_system_score_gemma":0.0013648708,"threshold_uncertainty_score":0.02794075},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39000243,0.0011266299,0.5655621,0.0032569864,0.00014461206,0.00019310914,0.0006059403,0.00016528845,0.03894291],"genre_scores_gemma":[0.9440987,0.0005622841,0.044663254,0.00016329369,0.00011678301,0.00017509301,0.00042472442,0.0000935094,0.009702237],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934083,0.00021890957,0.00003490176,0.000116367715,0.00016440162,0.00012452685],"domain_scores_gemma":[0.9962251,0.002442642,0.00049717375,0.00010819087,0.00036636382,0.00036060117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018722872,0.0014628127,0.0012988064,0.0012466403,0.0012066483,0.0044788877,0.0012707883,0.0025757528,0.0032996533],"category_scores_gemma":[0.007751164,0.0007571977,0.0015905958,0.0009787962,0.0030682131,0.002707425,0.0019433693,0.0025865273,0.0001870012],"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.00023055592,0.00012149409,0.0015759501,0.00021629868,0.000091776965,0.00049914623,0.000559896,0.13593854,0.0036197577,0.8444707,0.0025340288,0.01014186],"study_design_scores_gemma":[0.000056638186,0.00010829672,0.00094239216,0.000029381039,0.000026589922,0.00018783675,0.00027200658,0.6928731,0.0011355879,0.3033783,0.0009353919,0.000054383392],"about_ca_topic_score_codex":0.003751571,"about_ca_topic_score_gemma":0.0019423742,"teacher_disagreement_score":0.0044788877,"about_ca_system_score_codex":0.0015258712,"about_ca_system_score_gemma":0.0020431178,"threshold_uncertainty_score":0.011070967},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20902258,0.0008216579,0.77281576,0.00040375665,0.000035470865,0.00007360417,0.00034212522,0.00021056247,0.016274478],"genre_scores_gemma":[0.87974226,0.0010523207,0.109159246,0.00019602601,0.00011012214,0.00023046396,0.0008794699,0.00015063844,0.00847955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982956,0.00044858156,0.000095475196,0.00038752367,0.0005553599,0.00021746733],"domain_scores_gemma":[0.9956696,0.0024083923,0.0005059917,0.0007027119,0.00047739563,0.00023589114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024529183,0.0012126612,0.0011898788,0.0021634127,0.00091743754,0.0017303086,0.0012045279,0.00084207684,0.0030211406],"category_scores_gemma":[0.009045796,0.0008447805,0.0011265486,0.0010927229,0.0035166228,0.0035914467,0.0037431295,0.0025121947,0.0003636374],"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.000083784966,0.000053461787,0.001086555,0.00012395081,0.000045990302,0.0002914496,0.0005303616,0.060362123,0.0050731283,0.91396654,0.0006663184,0.017716274],"study_design_scores_gemma":[0.00001603799,0.000078102596,0.0011117627,0.000066011664,0.00001671129,0.00026812294,0.00021641997,0.27604127,0.003149574,0.7162316,0.0027746835,0.00002975708],"about_ca_topic_score_codex":0.0020694851,"about_ca_topic_score_gemma":0.0012721828,"teacher_disagreement_score":0.0030211406,"about_ca_system_score_codex":0.0015780712,"about_ca_system_score_gemma":0.000653809,"threshold_uncertainty_score":0.012972474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007115017,0.0006887645,0.98550063,0.00030281907,0.00012071933,0.00007324498,0.00007861539,0.00013925594,0.0059809233],"genre_scores_gemma":[0.1869038,0.00092832395,0.7913823,0.0003240498,0.00012986014,0.0007438308,0.0003976463,0.00036559757,0.018824605],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996456,0.00014303412,0.000022358858,0.00004452106,0.00011364147,0.000030809704],"domain_scores_gemma":[0.99958676,0.00019840835,0.000022973438,0.00004045186,0.00011662414,0.000034782137],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010235591,0.00094645185,0.0013227264,0.0006374257,0.0006666391,0.0008909276,0.0014229971,0.0019364606,0.0039214897],"category_scores_gemma":[0.0016695975,0.0004993865,0.0009830733,0.00052867335,0.000955118,0.0010823775,0.0020630714,0.0021212718,0.0009116864],"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.00036484026,0.00026608718,0.0011416726,0.0011927553,0.00024061232,0.00035344323,0.0004081161,0.5662591,0.02434241,0.22036804,0.011222993,0.17383991],"study_design_scores_gemma":[0.000019736566,0.000026535467,0.00009840494,0.000024596053,0.000013554321,0.000032060063,0.000019062994,0.98436975,0.0009711261,0.0116171185,0.0027974434,0.000010606096],"about_ca_topic_score_codex":0.0033292277,"about_ca_topic_score_gemma":0.0046733487,"teacher_disagreement_score":0.0039214897,"about_ca_system_score_codex":0.00063696963,"about_ca_system_score_gemma":0.0020757606,"threshold_uncertainty_score":0.013118625},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008054309,0.00007441705,0.98997736,0.00011078942,0.000032531174,0.000043991306,0.000014586658,0.00009976884,0.0015920915],"genre_scores_gemma":[0.26100215,0.00015818578,0.73389804,0.00013660533,0.000047289654,0.0002632769,0.000095039046,0.0001536774,0.0042457986],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993494,0.00020070233,0.000030810712,0.00008505326,0.00028305,0.000050965253],"domain_scores_gemma":[0.9985714,0.0008374065,0.00011900402,0.00011774171,0.00024328411,0.000111101595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022667795,0.001011221,0.0009703439,0.0006073007,0.0006019495,0.00093325996,0.0014150519,0.0011685654,0.0021637196],"category_scores_gemma":[0.0043546306,0.00046462982,0.00079914945,0.00048460052,0.0018306953,0.0012966249,0.002152364,0.0021051674,0.00062313466],"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.00021428318,0.00011421081,0.0007571018,0.00026156905,0.00004560612,0.00019349216,0.00026839506,0.6855052,0.01118533,0.19242407,0.001749895,0.10728093],"study_design_scores_gemma":[0.000009088971,0.00003134833,0.000021177806,0.000008162996,0.0000018052882,0.00001991352,0.000007481741,0.9820942,0.0011635266,0.016107976,0.00053103775,0.0000042803667],"about_ca_topic_score_codex":0.001666591,"about_ca_topic_score_gemma":0.0013670262,"teacher_disagreement_score":0.0022667795,"about_ca_system_score_codex":0.00094391016,"about_ca_system_score_gemma":0.0016085651,"threshold_uncertainty_score":0.011988044},"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":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052527953,0.00055175053,0.9298298,0.0004995738,0.00013142145,0.0001581075,0.00006509868,0.00016674527,0.016069662],"genre_scores_gemma":[0.527862,0.0008122295,0.45659944,0.00024524072,0.00011556677,0.0002759078,0.00012681469,0.00013340643,0.013829333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99930584,0.00015868162,0.000052814816,0.00018674259,0.0002375322,0.000058386566],"domain_scores_gemma":[0.9987814,0.00050790404,0.00018090231,0.00014182688,0.00031664586,0.00007138736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002066291,0.00053942896,0.00046727795,0.00038388692,0.000992762,0.0013414385,0.0005792199,0.0007274037,0.004087763],"category_scores_gemma":[0.004871662,0.00040488923,0.00069940946,0.00040071612,0.0020592648,0.0027538654,0.0012836661,0.0012689794,0.0010002819],"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.00012927374,0.00006838467,0.002697388,0.00036576926,0.000066390516,0.00026858097,0.00041509868,0.062054776,0.01936106,0.8058576,0.001324438,0.1073912],"study_design_scores_gemma":[0.00003862583,0.000349903,0.0013575115,0.000103371625,0.000059153364,0.00080834446,0.0004453841,0.44978034,0.044027478,0.4767244,0.026241202,0.00006441621],"about_ca_topic_score_codex":0.0005953035,"about_ca_topic_score_gemma":0.0008015224,"teacher_disagreement_score":0.004087763,"about_ca_system_score_codex":0.0007535779,"about_ca_system_score_gemma":0.001300753,"threshold_uncertainty_score":0.013674974},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00075435854,0.000066139975,0.9984774,0.000055429653,0.000048734993,0.000015316964,0.000009587744,0.00006087983,0.00051204953],"genre_scores_gemma":[0.04198677,0.00032702382,0.949528,0.0001182712,0.00015335895,0.00015829167,0.00007318059,0.00030135323,0.007353624],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99914896,0.00031271484,0.000034936416,0.00012192879,0.00033455118,0.0000469396],"domain_scores_gemma":[0.9989936,0.00043606674,0.00006106992,0.00011706737,0.00026008766,0.00013213576],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018236005,0.0011488632,0.0020263281,0.0012048183,0.00080889603,0.0014332571,0.0018549724,0.0028248215,0.007424215],"category_scores_gemma":[0.0035451674,0.00095839857,0.0013213961,0.0012002124,0.0017429565,0.0020347782,0.0037689768,0.00276971,0.002267773],"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.00022751659,0.0002894699,0.00044387835,0.0006972473,0.00018240296,0.00033766055,0.00037878338,0.35606906,0.01802622,0.32874742,0.013189991,0.28141046],"study_design_scores_gemma":[0.000027766413,0.00010257993,0.0000708859,0.000026931539,0.00002215364,0.000100285026,0.000025665608,0.94062924,0.0016082287,0.05010099,0.0072610355,0.000024150811],"about_ca_topic_score_codex":0.0015075562,"about_ca_topic_score_gemma":0.0019372652,"teacher_disagreement_score":0.007424215,"about_ca_system_score_codex":0.0006390714,"about_ca_system_score_gemma":0.0015249824,"threshold_uncertainty_score":0.024836421},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007595911,0.009023921,0.9528235,0.0056455825,0.0009184564,0.000033839766,0.00008364663,0.0000717926,0.023803258],"genre_scores_gemma":[0.3639115,0.02515878,0.5629984,0.006870651,0.005477795,0.00061901094,0.000251051,0.0006057378,0.034107022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764293,0.0010086761,0.00013496896,0.00044916687,0.0006567272,0.000107450556],"domain_scores_gemma":[0.9902632,0.008228635,0.00036191067,0.00047858804,0.0004593617,0.0002082508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053015477,0.0014096703,0.0018225687,0.0011420932,0.0013279787,0.0017053094,0.0015837001,0.002116534,0.0045052096],"category_scores_gemma":[0.010909328,0.0007532107,0.0018564484,0.0012998855,0.0046752677,0.006738757,0.0034131228,0.010475253,0.00071081734],"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.000058024914,0.000031077077,0.00019857063,0.00042530088,0.000065691806,0.00037064846,0.00023417697,0.032352068,0.0031013025,0.93948007,0.004054721,0.019628327],"study_design_scores_gemma":[0.000025672782,0.00010004946,0.0002209607,0.00024868478,0.000044227472,0.0002606542,0.00005203875,0.08860564,0.0016259335,0.87617785,0.0325858,0.00005245555],"about_ca_topic_score_codex":0.0007243348,"about_ca_topic_score_gemma":0.00068385067,"teacher_disagreement_score":0.0053015477,"about_ca_system_score_codex":0.0012254985,"about_ca_system_score_gemma":0.0009849337,"threshold_uncertainty_score":0.028037608},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00431244,0.00012844392,0.9945523,0.00006414187,0.000018056931,0.000022269389,0.0000058764736,0.00003614834,0.0008602376],"genre_scores_gemma":[0.13498056,0.00028181428,0.862432,0.000087008506,0.00005093402,0.00017380777,0.000047708927,0.00007904374,0.0018671303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940777,0.00019931227,0.00003728535,0.00007943382,0.00022882821,0.000047293073],"domain_scores_gemma":[0.9989555,0.0005540143,0.00008240308,0.000080259124,0.00025823133,0.00006958604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00167151,0.0009149876,0.0009746375,0.0007035077,0.0004930398,0.0007681458,0.0010833829,0.0012475573,0.0016265265],"category_scores_gemma":[0.002974215,0.00040893955,0.0010200104,0.0006401678,0.0009806462,0.0013763609,0.0020096113,0.0020450144,0.0003342442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020575694,0.00018070954,0.000967441,0.0004964193,0.00010738877,0.00029022523,0.00044568733,0.62650084,0.02105398,0.18688966,0.0019025987,0.16095926],"study_design_scores_gemma":[0.000008194178,0.000022513532,0.000025644043,0.0000058241903,0.0000038184103,0.000036150755,0.000012954476,0.99042284,0.0012304569,0.0076013156,0.0006251559,0.000005171327],"about_ca_topic_score_codex":0.0011297044,"about_ca_topic_score_gemma":0.0009954561,"teacher_disagreement_score":0.00167151,"about_ca_system_score_codex":0.0005265892,"about_ca_system_score_gemma":0.0009932352,"threshold_uncertainty_score":0.008839905},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.063154995,0.0007083507,0.91247094,0.0010492158,0.00013844307,0.000098828954,0.00023050893,0.00009149742,0.022057211],"genre_scores_gemma":[0.8733272,0.0013262397,0.10609746,0.0005102505,0.00023384976,0.00045321524,0.00066433864,0.00010240457,0.01728506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921227,0.00023868249,0.00005436934,0.00016948351,0.00021722469,0.000107910426],"domain_scores_gemma":[0.9985298,0.00057323184,0.0002182408,0.00007229341,0.00043527715,0.00017120443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018304016,0.00077087217,0.00061053876,0.0009163888,0.0006196343,0.0013676865,0.000843577,0.0013103642,0.0037800593],"category_scores_gemma":[0.0036208802,0.0002631545,0.0008916189,0.00033043488,0.0013361126,0.0026629874,0.0018653611,0.0017418291,0.00039319572],"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.000050214563,0.0000546645,0.00070108357,0.0001824059,0.00003781332,0.0002972025,0.00018876573,0.061389737,0.012026421,0.9159805,0.0019096413,0.007181475],"study_design_scores_gemma":[0.00002004476,0.00012448098,0.00063414924,0.000034858534,0.000014848968,0.00032997536,0.00022912244,0.53590107,0.0040249364,0.454276,0.004370431,0.00004014302],"about_ca_topic_score_codex":0.000711802,"about_ca_topic_score_gemma":0.000570166,"teacher_disagreement_score":0.0037800593,"about_ca_system_score_codex":0.00069453183,"about_ca_system_score_gemma":0.0007223888,"threshold_uncertainty_score":0.012645602},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024167856,0.00017487502,0.9953719,0.00012351632,0.000060791273,0.00003604399,0.000023953846,0.000103538514,0.0016886223],"genre_scores_gemma":[0.15110302,0.0008977589,0.83892614,0.00033963867,0.00023400062,0.0004019041,0.00022038055,0.00031843118,0.0075586513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985228,0.00059751194,0.00008408035,0.0001750671,0.00050223124,0.00011839737],"domain_scores_gemma":[0.9974668,0.0013695867,0.00015592463,0.00024273866,0.00061264157,0.00015240404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033818237,0.0013125557,0.00085900904,0.0009811266,0.0006015217,0.0016216858,0.001984366,0.001206565,0.0061415723],"category_scores_gemma":[0.0069448315,0.0006298525,0.0011429883,0.0009064263,0.001959329,0.0031654087,0.0030122187,0.00400813,0.0013237793],"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.00025606752,0.00019791318,0.001203537,0.0006732597,0.00014120058,0.00020051825,0.00040538222,0.43104762,0.015584152,0.38857657,0.004989783,0.15672398],"study_design_scores_gemma":[0.000012828779,0.000042226886,0.00006531234,0.000017427099,0.0000057870066,0.00002942292,0.0000106231255,0.9809718,0.001359384,0.01629507,0.0011802538,0.000009763325],"about_ca_topic_score_codex":0.0016571119,"about_ca_topic_score_gemma":0.001767671,"teacher_disagreement_score":0.0061415723,"about_ca_system_score_codex":0.000834256,"about_ca_system_score_gemma":0.0016783279,"threshold_uncertainty_score":0.020545602},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016536897,0.000698835,0.96426046,0.00057255087,0.00013996335,0.00011007115,0.00014893508,0.00007016909,0.017462123],"genre_scores_gemma":[0.3921271,0.0032174652,0.5859326,0.0009236796,0.00061777094,0.0009519566,0.0006185892,0.0004065927,0.015204251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985025,0.0005207005,0.00009530047,0.00025820383,0.00045064758,0.00017265542],"domain_scores_gemma":[0.9955596,0.003095733,0.0003555404,0.00015279786,0.0006892905,0.00014700608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069156894,0.0022327078,0.0013037887,0.0019197434,0.00088440155,0.0015531686,0.001204611,0.0011529543,0.006116806],"category_scores_gemma":[0.00951585,0.00060912233,0.0019646175,0.0012909865,0.0027946678,0.0038443985,0.0027220761,0.0033836416,0.00091930485],"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.0001444789,0.0001434065,0.00052701065,0.00031033167,0.000051134088,0.00018850986,0.00024973048,0.1069563,0.0069492836,0.856411,0.0030753338,0.024993507],"study_design_scores_gemma":[0.000059819773,0.00027392776,0.00041207953,0.00013382245,0.000038836402,0.0001373002,0.00009114669,0.537662,0.004913576,0.4500664,0.006175749,0.000035379635],"about_ca_topic_score_codex":0.0018415888,"about_ca_topic_score_gemma":0.0015474124,"teacher_disagreement_score":0.0069156894,"about_ca_system_score_codex":0.0015721327,"about_ca_system_score_gemma":0.0025661977,"threshold_uncertainty_score":0.036574066},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052415244,0.00020078602,0.9926179,0.00007865548,0.00004111103,0.000044631004,0.000014397773,0.00004037709,0.0017205507],"genre_scores_gemma":[0.40058824,0.0009826374,0.5868817,0.0002446378,0.00014731579,0.0006295639,0.0001410565,0.0001555616,0.010229273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994898,0.00024343844,0.0000191443,0.00006895909,0.00014625103,0.000032457312],"domain_scores_gemma":[0.99946004,0.00027424126,0.00005560254,0.00002946772,0.00013775838,0.000042906326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016929342,0.0010198676,0.0011094227,0.0005307801,0.00040210286,0.0008348957,0.0010165859,0.0012901402,0.0021139092],"category_scores_gemma":[0.0020568196,0.0004913871,0.0007169699,0.00040644873,0.0008997113,0.0009097995,0.0011695403,0.0011142849,0.00044461427],"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.00007541002,0.00008647417,0.00030027042,0.00031676065,0.00006692709,0.00017295501,0.000087103195,0.91763973,0.007325053,0.037555754,0.00097457605,0.035398982],"study_design_scores_gemma":[0.0000047630947,0.000032640368,0.000027266819,0.0000051985817,0.000001941553,0.0000121381445,0.0000026667933,0.99737996,0.00028951967,0.0019080929,0.00033211894,0.0000036574006],"about_ca_topic_score_codex":0.0012348414,"about_ca_topic_score_gemma":0.0011002356,"teacher_disagreement_score":0.0021139092,"about_ca_system_score_codex":0.00047962653,"about_ca_system_score_gemma":0.0011863444,"threshold_uncertainty_score":0.008953214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004027338,0.000077988894,0.9947062,0.000043406777,0.000035813886,0.000020441725,0.000009643351,0.00010644103,0.000972781],"genre_scores_gemma":[0.33903727,0.00030993862,0.6552926,0.00011971932,0.000113609545,0.00027150084,0.00017392234,0.00013664528,0.004544863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995497,0.00012005832,0.000029054669,0.00008609952,0.00016307777,0.000051918938],"domain_scores_gemma":[0.99939084,0.00034625398,0.00004309913,0.000046780497,0.00012008676,0.000052888867],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010114893,0.0007756744,0.0007582245,0.00048290798,0.00039884905,0.0007445265,0.0013798231,0.0008461129,0.0025119747],"category_scores_gemma":[0.0026278207,0.0003502851,0.0006325765,0.00043467424,0.000805088,0.0010838851,0.0012655907,0.0012955138,0.00041494856],"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.00014225324,0.0000888744,0.000581537,0.00017835884,0.00009985026,0.00013411113,0.000089454246,0.7528546,0.0052969726,0.12983257,0.0013533332,0.109348126],"study_design_scores_gemma":[0.000008642004,0.000015918198,0.00001955585,0.0000027785682,0.0000031704474,0.0000124141525,0.0000022860324,0.9949645,0.00039058903,0.004160016,0.00041713857,0.0000030214994],"about_ca_topic_score_codex":0.0022150045,"about_ca_topic_score_gemma":0.0021255668,"teacher_disagreement_score":0.0025119747,"about_ca_system_score_codex":0.0006807285,"about_ca_system_score_gemma":0.0012961156,"threshold_uncertainty_score":0.00840342},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011415836,0.00038977162,0.9850617,0.00024713768,0.000095027775,0.000040112776,0.000026540954,0.00012361945,0.0026002636],"genre_scores_gemma":[0.38102514,0.0007390075,0.60692894,0.00024119351,0.00013823011,0.00024110463,0.00013432637,0.0002224296,0.010329679],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997435,0.000115773124,0.000015253491,0.000033568936,0.00006747348,0.000024378101],"domain_scores_gemma":[0.9997031,0.00010415887,0.000026280139,0.000023574308,0.000095119336,0.000047739093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010255954,0.0008609257,0.0010348073,0.0007164007,0.0005004861,0.0006608715,0.00084436877,0.0010845987,0.002829758],"category_scores_gemma":[0.0015552427,0.00032760928,0.0006742329,0.00035358418,0.0008483519,0.0015058954,0.0015071579,0.0012411044,0.00042218438],"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.00017380633,0.00014636449,0.0007508845,0.00036564175,0.00008270137,0.0003256349,0.00021025713,0.45652452,0.02450596,0.41694972,0.0033967132,0.096567824],"study_design_scores_gemma":[0.000014648905,0.00007021986,0.000061125065,0.000010824534,0.0000046232976,0.000034645116,0.000011406099,0.9775532,0.0010119468,0.019270536,0.0019474289,0.000009373403],"about_ca_topic_score_codex":0.0018644424,"about_ca_topic_score_gemma":0.0017552436,"teacher_disagreement_score":0.002829758,"about_ca_system_score_codex":0.0006299879,"about_ca_system_score_gemma":0.0007354026,"threshold_uncertainty_score":0.009466469},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034122851,0.001471567,0.9029301,0.00048111155,0.00017761212,0.00004617594,0.0002302717,0.0007651463,0.09048577],"genre_scores_gemma":[0.24080665,0.0052122893,0.5498161,0.00096289604,0.0004934068,0.00059769023,0.0014901862,0.0038167215,0.19680415],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993327,0.00013699711,0.000029645425,0.00025030208,0.00020154292,0.00004873475],"domain_scores_gemma":[0.9996228,0.00011011633,0.00003668201,0.0001531068,0.00005984089,0.000017434815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078216725,0.0017818004,0.001893506,0.0009653823,0.00067533035,0.0021045913,0.0010551006,0.0021308407,0.019795943],"category_scores_gemma":[0.0024867663,0.0010533525,0.0008629362,0.0011250929,0.001874122,0.0032959452,0.0030117533,0.002695043,0.010416682],"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.000066613706,0.000038986753,0.00021272943,0.0003390979,0.000070839415,0.00007113424,0.0001585042,0.11477913,0.011417714,0.6079749,0.025999239,0.23887117],"study_design_scores_gemma":[0.000020310852,0.000049009952,0.0002272196,0.00013857849,0.000052770494,0.00025135715,0.00007852829,0.14556313,0.009118633,0.7483668,0.0960905,0.000043126907],"about_ca_topic_score_codex":0.00048037004,"about_ca_topic_score_gemma":0.00064844306,"teacher_disagreement_score":0.019795943,"about_ca_system_score_codex":0.00082591793,"about_ca_system_score_gemma":0.000740674,"threshold_uncertainty_score":0.06622404},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021610423,0.00007337243,0.9965262,0.00003575017,0.000026558911,0.000026395488,0.000005775307,0.000109178836,0.0010356258],"genre_scores_gemma":[0.14020796,0.00023273357,0.85451996,0.00014142093,0.00006247009,0.0003045253,0.0000741695,0.00011845596,0.004338294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971396,0.0000878865,0.000019269095,0.000044824385,0.0001101021,0.00002389804],"domain_scores_gemma":[0.9997689,0.00008594537,0.000027040842,0.000023902794,0.00007281954,0.0000213386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008157701,0.0007132242,0.0006901175,0.000393657,0.00030764245,0.0004523355,0.0013350607,0.0007546192,0.002242215],"category_scores_gemma":[0.0013127463,0.0003259513,0.00046793267,0.00033998291,0.00046015848,0.00083380373,0.0008600525,0.0009168271,0.0005808826],"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.0001435994,0.00015578266,0.00092785916,0.0003021487,0.000105721614,0.00017471539,0.00018785043,0.5856605,0.020781428,0.11537423,0.0038097824,0.27237636],"study_design_scores_gemma":[0.000013146486,0.000036202262,0.000051549265,0.0000053885346,0.00000397051,0.00001832667,0.000003532014,0.99493176,0.0009907862,0.0024156326,0.0015239106,0.000005759076],"about_ca_topic_score_codex":0.0016187832,"about_ca_topic_score_gemma":0.0019885793,"teacher_disagreement_score":0.002242215,"about_ca_system_score_codex":0.00029119593,"about_ca_system_score_gemma":0.00088348053,"threshold_uncertainty_score":0.0075009465},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029350864,0.0007448756,0.9563536,0.0003719719,0.00007168169,0.00007131566,0.00010571611,0.000051727173,0.01287816],"genre_scores_gemma":[0.7574461,0.0020512599,0.22879167,0.0002633801,0.00014923012,0.0005823371,0.0003277327,0.00016345766,0.01022478],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987431,0.0005612063,0.00007995362,0.00018634753,0.0002921552,0.00013714773],"domain_scores_gemma":[0.9971323,0.0019135664,0.00027676276,0.00009657404,0.000433557,0.0001472987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031245276,0.0014289545,0.001308159,0.0013742455,0.00066086964,0.002087088,0.00096554833,0.0010853792,0.0023816966],"category_scores_gemma":[0.0078615695,0.0006417717,0.0012540574,0.0008571685,0.0027800351,0.003081012,0.0021845833,0.003256589,0.00036335847],"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.0000485338,0.000056867226,0.00036478075,0.0002532853,0.000047771377,0.00018271121,0.0001699355,0.12930094,0.0043434133,0.8516601,0.0011128118,0.012458866],"study_design_scores_gemma":[0.000021106282,0.000089669404,0.0003423035,0.00007382007,0.000021528826,0.00013101533,0.00010056009,0.5390599,0.002941149,0.45499665,0.0021841887,0.000038250655],"about_ca_topic_score_codex":0.0010307895,"about_ca_topic_score_gemma":0.00089623703,"teacher_disagreement_score":0.0031245276,"about_ca_system_score_codex":0.0012500992,"about_ca_system_score_gemma":0.0018387291,"threshold_uncertainty_score":0.016524255},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002033657,0.000065045366,0.9961092,0.00006202631,0.00007070513,0.000039819308,0.000018409248,0.00012799322,0.0014732562],"genre_scores_gemma":[0.055712987,0.000116698124,0.9383088,0.00013230051,0.00007461938,0.0002745273,0.00009610583,0.00013739849,0.0051465696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994481,0.0001314874,0.000036615522,0.000112901915,0.0002200513,0.00005086472],"domain_scores_gemma":[0.99925774,0.0003707924,0.00003843435,0.00005642882,0.00022067908,0.000055804925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001413614,0.0010524086,0.0014333983,0.0009602243,0.0007065207,0.0011484836,0.002195956,0.0021457705,0.006422915],"category_scores_gemma":[0.00271979,0.00070481526,0.000897439,0.00086586794,0.0008406955,0.001492133,0.0024511677,0.0017576372,0.001087706],"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.00026638084,0.00023866499,0.0006975435,0.00033534606,0.00016401922,0.00018874969,0.00016801695,0.46561554,0.012772915,0.12512046,0.007174554,0.3872577],"study_design_scores_gemma":[0.000038421815,0.000040853884,0.000054338838,0.000009990119,0.000011495619,0.000032592157,0.000008236314,0.986158,0.0007255394,0.0103231035,0.0025882542,0.000009204946],"about_ca_topic_score_codex":0.0027910594,"about_ca_topic_score_gemma":0.0040889783,"teacher_disagreement_score":0.006422915,"about_ca_system_score_codex":0.0007606956,"about_ca_system_score_gemma":0.0016247744,"threshold_uncertainty_score":0.02148676},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23828317,0.0016214937,0.7381837,0.0017236094,0.000105275045,0.00006150362,0.00014945545,0.00010943177,0.019762354],"genre_scores_gemma":[0.8679613,0.0011527521,0.121239275,0.0002072109,0.00012373283,0.00020282264,0.00014477121,0.00012225141,0.008845848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99867564,0.0006381491,0.00004742905,0.00017078538,0.00030771375,0.00016020698],"domain_scores_gemma":[0.99782395,0.0013417229,0.0002922189,0.000084532985,0.00024356751,0.00021393405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002573791,0.00088560785,0.001088654,0.0013467246,0.0009807798,0.0024882357,0.0012817101,0.0012641551,0.0030825066],"category_scores_gemma":[0.0070117926,0.000617436,0.0008867841,0.0010573504,0.0027961086,0.0041205664,0.0028775092,0.0025056303,0.0003506396],"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.000026527052,0.00001642575,0.00010337213,0.000056337038,0.000014888448,0.000030261637,0.00011940095,0.023684846,0.0015359878,0.97106373,0.00025907723,0.0030891798],"study_design_scores_gemma":[0.00002287214,0.000044019605,0.000112014306,0.0000280458,0.000005000165,0.000034565688,0.0001001904,0.16242112,0.00070456427,0.83551043,0.0009999748,0.000017292992],"about_ca_topic_score_codex":0.0014085029,"about_ca_topic_score_gemma":0.0012671148,"teacher_disagreement_score":0.0030825066,"about_ca_system_score_codex":0.002191414,"about_ca_system_score_gemma":0.0013039979,"threshold_uncertainty_score":0.015899837},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020828325,0.00079522276,0.9590806,0.00046987814,0.00012704394,0.00005610503,0.00017050594,0.000076875105,0.018395543],"genre_scores_gemma":[0.7243868,0.0018810219,0.24989048,0.0005680798,0.0003465932,0.0005301801,0.0005730209,0.0003097292,0.021514077],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988838,0.0003657334,0.000068052745,0.000120406694,0.00042756734,0.00013432695],"domain_scores_gemma":[0.9982747,0.00088568364,0.00021020365,0.00012694112,0.0003963573,0.000106097265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002880236,0.0014488562,0.0010215592,0.0017420084,0.0006052075,0.002173849,0.0008408841,0.0008451009,0.003052491],"category_scores_gemma":[0.0041061663,0.0005805793,0.001641697,0.0010415576,0.0019072917,0.0028032868,0.0018215429,0.0027229371,0.0004998737],"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.00003038441,0.000027474543,0.00036686545,0.00013669225,0.000040446244,0.00014065646,0.00011723997,0.06944568,0.0047093323,0.9154699,0.0014777448,0.0080376165],"study_design_scores_gemma":[0.000020501187,0.00007240139,0.00066449033,0.000052176172,0.000018824163,0.00017472878,0.000066368,0.48808762,0.0040037436,0.49961513,0.007193338,0.000030689058],"about_ca_topic_score_codex":0.00087500364,"about_ca_topic_score_gemma":0.0010534278,"teacher_disagreement_score":0.003052491,"about_ca_system_score_codex":0.0015618317,"about_ca_system_score_gemma":0.0011839094,"threshold_uncertainty_score":0.015232325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34923244,0.0009506763,0.62793434,0.00079170754,0.00003938779,0.00020134906,0.0003503909,0.00008179596,0.020417904],"genre_scores_gemma":[0.9285167,0.0010086822,0.06363127,0.000118253665,0.000059657177,0.0005692612,0.00057913584,0.00008694119,0.005429966],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855024,0.000530976,0.000113865746,0.00032263328,0.00034852224,0.00013370489],"domain_scores_gemma":[0.9915358,0.005390048,0.0011846067,0.00032775718,0.0010917033,0.00047013708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024969415,0.0011112154,0.0014142746,0.003131224,0.0012347632,0.0028638248,0.0014378101,0.0013586954,0.004269242],"category_scores_gemma":[0.012492129,0.0007258339,0.0010725361,0.0014643185,0.0033125407,0.004061418,0.0028457309,0.0018015888,0.0003329142],"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.00011361625,0.00009102884,0.0017843051,0.000280295,0.000095190386,0.0002793311,0.00050381117,0.060029183,0.0068381596,0.9162669,0.0006521708,0.013066055],"study_design_scores_gemma":[0.000064710504,0.00014713226,0.00186894,0.00013997626,0.000054419113,0.00024594495,0.00052899815,0.32337436,0.0058617448,0.66428554,0.003370399,0.000057785157],"about_ca_topic_score_codex":0.00048605868,"about_ca_topic_score_gemma":0.00041727794,"teacher_disagreement_score":0.004269242,"about_ca_system_score_codex":0.0012458059,"about_ca_system_score_gemma":0.00083590514,"threshold_uncertainty_score":0.014282048},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.052681226,0.00051313307,0.930508,0.00059344654,0.000049344722,0.00006577392,0.000090394395,0.0000529273,0.015445748],"genre_scores_gemma":[0.83055717,0.0012512932,0.15714006,0.00030747717,0.00013951006,0.00035844956,0.00033294025,0.0002417106,0.009671486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997104,0.0011784949,0.0002174123,0.00051074673,0.0006927876,0.00029663506],"domain_scores_gemma":[0.9951474,0.0024826822,0.00066671026,0.00039985622,0.0010534979,0.00024996675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0049804,0.0010826781,0.0011020777,0.0011575216,0.00061015604,0.0020662153,0.00081054715,0.0008466577,0.0033138918],"category_scores_gemma":[0.011300348,0.00054166326,0.000878794,0.0009422397,0.0036253193,0.005389984,0.0027256045,0.0018039072,0.00059554155],"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.000026384196,0.000024926629,0.00030944645,0.000079005644,0.000014482655,0.00006244367,0.00010285182,0.026500361,0.0024869905,0.9633358,0.00048266794,0.006574474],"study_design_scores_gemma":[0.000034969493,0.000116734525,0.00054630433,0.00006913931,0.000014564044,0.00013141548,0.00017115635,0.31396356,0.004455327,0.6749251,0.0055417414,0.00003001658],"about_ca_topic_score_codex":0.0007139359,"about_ca_topic_score_gemma":0.0004983081,"teacher_disagreement_score":0.0049804,"about_ca_system_score_codex":0.001358658,"about_ca_system_score_gemma":0.0016887175,"threshold_uncertainty_score":0.026339173},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.508601,0.0021961776,0.20633882,0.001730703,0.00029073766,0.00014767089,0.0009657695,0.0004363426,0.27929276],"genre_scores_gemma":[0.9387566,0.0005711589,0.019825557,0.00015010643,0.00009962531,0.000057423564,0.00042510385,0.00006297634,0.040051505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962234,0.00004155687,0.00001891226,0.00011335826,0.00013863695,0.000065197135],"domain_scores_gemma":[0.999686,0.000057354264,0.000049342554,0.000066703135,0.00007349685,0.000067132496],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040078163,0.0004550059,0.00035062555,0.0010137772,0.0012514144,0.0017677635,0.00055779767,0.0003864351,0.00909367],"category_scores_gemma":[0.00102561,0.00024065228,0.00046882208,0.00037030576,0.0022044154,0.0021224206,0.0022532223,0.0012700441,0.0012772237],"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.000013812536,0.000006188056,0.0003395532,0.000027407099,0.00000577007,0.00013397142,0.00028827676,0.00061994477,0.0013909404,0.9871796,0.00061305915,0.009381451],"study_design_scores_gemma":[0.000014535666,0.000035456687,0.0013274036,0.00003738813,0.0000128848515,0.00055874925,0.0005537802,0.008804032,0.004687459,0.94136226,0.0425878,0.00001830568],"about_ca_topic_score_codex":0.00074648275,"about_ca_topic_score_gemma":0.00045432136,"teacher_disagreement_score":0.00909367,"about_ca_system_score_codex":0.0009711157,"about_ca_system_score_gemma":0.00030949313,"threshold_uncertainty_score":0.030421376},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023268107,0.0007608879,0.95638686,0.0011138498,0.0000799803,0.00008092494,0.00021755835,0.00008013988,0.01801171],"genre_scores_gemma":[0.6656122,0.002556951,0.2986943,0.00090652093,0.00074859906,0.0010573579,0.0011683946,0.00089020166,0.028365547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99685466,0.0015085336,0.00020102054,0.0004511772,0.000681315,0.0003032718],"domain_scores_gemma":[0.98549336,0.010481511,0.0007363988,0.00061117444,0.002065042,0.0006125553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0079360455,0.0018065814,0.0021194376,0.002882761,0.0014420727,0.0040348745,0.0026032075,0.001925585,0.0070366263],"category_scores_gemma":[0.026040137,0.0017108113,0.0023846738,0.002128745,0.0041600014,0.0095887985,0.0053532277,0.0065935496,0.0010831368],"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.00004752161,0.00003157782,0.0001696627,0.000095232805,0.000030453766,0.000038897877,0.00013916122,0.00955307,0.0014410648,0.98305607,0.0010426327,0.004354709],"study_design_scores_gemma":[0.000019243605,0.00004223357,0.00027673255,0.00004037707,0.000026020465,0.000050518578,0.0000742359,0.064355575,0.0012965308,0.93172663,0.0020710235,0.000020940617],"about_ca_topic_score_codex":0.0010003457,"about_ca_topic_score_gemma":0.0010445516,"teacher_disagreement_score":0.0079360455,"about_ca_system_score_codex":0.0021344605,"about_ca_system_score_gemma":0.0018529898,"threshold_uncertainty_score":0.041970313},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.57852453,0.0017504939,0.363756,0.0023826112,0.00017307625,0.00008200695,0.00027872858,0.00017597862,0.052876562],"genre_scores_gemma":[0.96047205,0.0005125793,0.028739812,0.00019268451,0.00010202838,0.000068125126,0.00011684789,0.00009757674,0.009698419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993362,0.00014997476,0.000029929828,0.00017002456,0.00018429889,0.00012955068],"domain_scores_gemma":[0.9983486,0.00062894984,0.00023225228,0.00013139396,0.00031331446,0.00034551142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010757595,0.0005885673,0.0007863438,0.0022181144,0.0012352266,0.0022506423,0.00088211783,0.0013012901,0.0050714067],"category_scores_gemma":[0.0056637363,0.00041206586,0.0006011053,0.001151829,0.00408852,0.005616424,0.0029438804,0.0020694495,0.0004667099],"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.000016231552,0.000005351959,0.00018623298,0.000014378327,0.0000024247354,0.00004347307,0.00013967307,0.0007384123,0.00041158847,0.9951428,0.00024792552,0.0030515844],"study_design_scores_gemma":[0.0000068085906,0.000014382782,0.00018406063,0.0000083855775,0.0000017420161,0.00008246032,0.00009627698,0.006851114,0.00039457373,0.9910568,0.0012954784,0.000007948245],"about_ca_topic_score_codex":0.0009156172,"about_ca_topic_score_gemma":0.0004989245,"teacher_disagreement_score":0.0050714067,"about_ca_system_score_codex":0.0013142163,"about_ca_system_score_gemma":0.00072282227,"threshold_uncertainty_score":0.016965508},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012095276,0.0003342469,0.98175514,0.0002912705,0.0000342747,0.000047933463,0.000048742335,0.000046050012,0.005347089],"genre_scores_gemma":[0.6025583,0.0017233676,0.38466924,0.00029111298,0.00010869086,0.0007556314,0.00018950745,0.00010060087,0.009603431],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993,0.00030836012,0.000035934983,0.00013217541,0.00012967542,0.00009377728],"domain_scores_gemma":[0.9985947,0.0008899293,0.00020637263,0.000066999,0.00014578653,0.00009607667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001626275,0.00092228426,0.0009666414,0.0011847257,0.00065567385,0.0019187964,0.001434083,0.0015682135,0.0039427807],"category_scores_gemma":[0.0045607807,0.0004182541,0.00089624693,0.0012647983,0.0026306116,0.0033677567,0.002067792,0.0016797723,0.0005302133],"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.000014005044,0.000015559193,0.0002314007,0.000046854126,0.000012835705,0.00004462643,0.00005626137,0.075097896,0.00060419884,0.91860175,0.00044962016,0.0048249485],"study_design_scores_gemma":[0.000010614957,0.000020636257,0.0000934729,0.000025232017,0.0000053049166,0.00004430731,0.000034386496,0.46872643,0.00025225605,0.5295579,0.0012119317,0.000017640288],"about_ca_topic_score_codex":0.001789229,"about_ca_topic_score_gemma":0.0013711295,"teacher_disagreement_score":0.0039427807,"about_ca_system_score_codex":0.0013578598,"about_ca_system_score_gemma":0.0011305086,"threshold_uncertainty_score":0.013189912},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002825666,0.00076533423,0.99258834,0.00020192642,0.00008215467,0.000024800956,0.000028186025,0.00004684194,0.0034367878],"genre_scores_gemma":[0.38120335,0.005448208,0.57928944,0.00048346055,0.0005086567,0.0005028683,0.0004463391,0.00037086327,0.031746875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989851,0.00043492383,0.000058898248,0.0001536729,0.00029704848,0.00007031961],"domain_scores_gemma":[0.99937844,0.00026400358,0.000073131836,0.00006984707,0.00016431893,0.00005025745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012150013,0.0010216029,0.0010547633,0.0010075642,0.0004489911,0.001563467,0.0010267104,0.000703506,0.003182857],"category_scores_gemma":[0.0017723258,0.0004587618,0.0009530082,0.001185005,0.0015985287,0.0026950496,0.0019669263,0.0022504656,0.00074282],"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.000027712746,0.000038228383,0.00015224172,0.00021135136,0.00003326453,0.00005275275,0.00006962693,0.12342102,0.004060563,0.8090913,0.0022245764,0.06061736],"study_design_scores_gemma":[0.00000941561,0.00008237703,0.0001264928,0.00003626026,0.000012143152,0.000062253355,0.00003646976,0.6742695,0.0018616677,0.31221163,0.011267356,0.000024403607],"about_ca_topic_score_codex":0.0009999775,"about_ca_topic_score_gemma":0.0009566848,"teacher_disagreement_score":0.003182857,"about_ca_system_score_codex":0.0012601748,"about_ca_system_score_gemma":0.0010134199,"threshold_uncertainty_score":0.010647714},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008469348,0.00040732152,0.9821469,0.00048547925,0.00006586417,0.00004693885,0.00013940946,0.000075533026,0.008163084],"genre_scores_gemma":[0.58654755,0.0019494543,0.3924631,0.00064001186,0.00046035563,0.0005872381,0.00093641697,0.00044940299,0.01596648],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982376,0.00046539932,0.00010211305,0.00034158787,0.0006356185,0.00021768999],"domain_scores_gemma":[0.997065,0.0018305219,0.00023922561,0.00018614161,0.0005261611,0.00015289703],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004166183,0.0013139942,0.001163843,0.0014623572,0.0007874277,0.0020714842,0.0014225595,0.0016257361,0.0057951864],"category_scores_gemma":[0.0066916277,0.0007704139,0.0016231949,0.0007220901,0.0027425573,0.0038794097,0.0022066296,0.004227673,0.0007889836],"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.000022066957,0.00003063098,0.00031870793,0.00014990641,0.00002411921,0.00012085062,0.00015105231,0.07142277,0.004455521,0.91526973,0.0018556627,0.0061789597],"study_design_scores_gemma":[0.000015684793,0.000054458134,0.00036179487,0.000054675915,0.000014320036,0.00010724787,0.00008157183,0.59094423,0.002522871,0.39998195,0.005830001,0.00003111812],"about_ca_topic_score_codex":0.0015717519,"about_ca_topic_score_gemma":0.0019806195,"teacher_disagreement_score":0.0057951864,"about_ca_system_score_codex":0.001633498,"about_ca_system_score_gemma":0.0020133695,"threshold_uncertainty_score":0.022033155},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22328258,0.0008922242,0.7626583,0.0012064864,0.000045279176,0.00009208428,0.00015728266,0.00010048028,0.011565338],"genre_scores_gemma":[0.8947335,0.00083316,0.09590391,0.00011807428,0.00011371369,0.00031580497,0.0003740247,0.00009655211,0.0075112795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990097,0.00041751986,0.00004811716,0.00024501298,0.00018618905,0.00009343559],"domain_scores_gemma":[0.99639016,0.0027795767,0.00037090527,0.00009036761,0.00018106171,0.00018793748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024055429,0.0014487974,0.0013784578,0.0006842532,0.0005343581,0.0021846083,0.00094224286,0.0012345174,0.0015483762],"category_scores_gemma":[0.0061914753,0.000661461,0.0013125533,0.00063218415,0.0024189753,0.002675388,0.0025537251,0.0021711923,0.00019402361],"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.00038326377,0.00021499458,0.0015757799,0.000556769,0.00022991562,0.00069210876,0.00080457673,0.3232177,0.015208909,0.63409233,0.0016127239,0.021410963],"study_design_scores_gemma":[0.000042181724,0.00012995153,0.00029135853,0.000032971777,0.00001861135,0.00010427042,0.00011328479,0.8498975,0.0019480826,0.14651638,0.000890303,0.000015163453],"about_ca_topic_score_codex":0.0013980917,"about_ca_topic_score_gemma":0.0006349292,"teacher_disagreement_score":0.0024055429,"about_ca_system_score_codex":0.0011643831,"about_ca_system_score_gemma":0.0013824465,"threshold_uncertainty_score":0.012721837},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045941908,0.00047830577,0.9254555,0.0013793671,0.00014931484,0.000077361205,0.00040149718,0.00006198713,0.026054746],"genre_scores_gemma":[0.7380715,0.0015034021,0.22684838,0.0007795029,0.00044816034,0.00038608277,0.00068871997,0.00017335161,0.031100804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985084,0.0006183496,0.00008312224,0.0002561039,0.00040056,0.00013348856],"domain_scores_gemma":[0.9976829,0.0009718641,0.0003422998,0.00014590075,0.0005361585,0.00032083708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031771362,0.00095778296,0.0006321465,0.001181112,0.00076823623,0.0021067676,0.0007851185,0.00080501626,0.0072307847],"category_scores_gemma":[0.005044665,0.00056532875,0.0009520906,0.0008919095,0.0026786164,0.0049611246,0.0027884715,0.0034720947,0.000636294],"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.000012488415,0.000012008755,0.00015142484,0.000051554158,0.0000093636545,0.000037064292,0.000068949004,0.00686973,0.00091618235,0.9874165,0.000623914,0.0038307598],"study_design_scores_gemma":[0.000014549542,0.00007205937,0.00034208226,0.000036874902,0.000011187493,0.00016320025,0.00011093126,0.10712442,0.0010931526,0.8856822,0.0053269654,0.000022395854],"about_ca_topic_score_codex":0.00055735203,"about_ca_topic_score_gemma":0.0008925811,"teacher_disagreement_score":0.0072307847,"about_ca_system_score_codex":0.0012965284,"about_ca_system_score_gemma":0.0013633339,"threshold_uncertainty_score":0.024189413},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03197739,0.0009311754,0.94386834,0.0009677984,0.00013544186,0.00003076883,0.000103125945,0.00006294063,0.021923022],"genre_scores_gemma":[0.71382946,0.001766865,0.26928496,0.0005904701,0.00039844817,0.00025806195,0.00034646346,0.00019504022,0.013330343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830735,0.0009858102,0.00007013941,0.00020537392,0.00028869815,0.00014269205],"domain_scores_gemma":[0.9976273,0.0014256141,0.00028353563,0.00021947891,0.00026896223,0.00017505462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042077308,0.0010435013,0.0009801643,0.0009879961,0.00066460756,0.0024938246,0.0011329969,0.00090399233,0.0028232143],"category_scores_gemma":[0.006083848,0.0005038934,0.0012008157,0.0010772814,0.0034728353,0.004364626,0.003391896,0.003893339,0.00058855186],"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.00004432196,0.00003280687,0.00019676336,0.00007889769,0.000016682527,0.00008399152,0.00010146144,0.023826802,0.0010171536,0.96582806,0.0009240601,0.0078489175],"study_design_scores_gemma":[0.00001778591,0.000087589,0.00014922726,0.000045513912,0.000013088868,0.000124436,0.00007812937,0.21025962,0.0016504308,0.78401077,0.003544786,0.00001865258],"about_ca_topic_score_codex":0.00048768046,"about_ca_topic_score_gemma":0.0003343876,"teacher_disagreement_score":0.0042077308,"about_ca_system_score_codex":0.0011953721,"about_ca_system_score_gemma":0.0009750806,"threshold_uncertainty_score":0.022252858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049083553,0.00238255,0.91387725,0.004322755,0.00039293876,0.000107608146,0.00021944441,0.00006871359,0.029545262],"genre_scores_gemma":[0.877591,0.0013098625,0.10823152,0.00063657045,0.00015166939,0.00021344675,0.00014329603,0.000083067396,0.011639486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866116,0.000631054,0.000058027596,0.00022329629,0.00033196254,0.00009454789],"domain_scores_gemma":[0.9992055,0.00032174098,0.00016263171,0.000081463215,0.00014979791,0.000078874444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023687244,0.0006056611,0.00054388685,0.00043802365,0.00046723406,0.0012963674,0.0011771298,0.0010977606,0.0034782125],"category_scores_gemma":[0.00395348,0.00021924525,0.0008642183,0.00039306885,0.0017489818,0.0017212091,0.001563499,0.0018959768,0.00034397896],"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.000029488843,0.000036689595,0.0006524508,0.00017797368,0.000065002576,0.00007939197,0.00022798659,0.032317713,0.0039071855,0.94115376,0.0011824952,0.020169713],"study_design_scores_gemma":[0.000021020984,0.000150182,0.0012012069,0.000067888934,0.00003090141,0.00017073723,0.00018516126,0.13533053,0.0014573773,0.8531309,0.008225553,0.00002849963],"about_ca_topic_score_codex":0.0011227487,"about_ca_topic_score_gemma":0.00089734746,"teacher_disagreement_score":0.0034782125,"about_ca_system_score_codex":0.001266918,"about_ca_system_score_gemma":0.0009528347,"threshold_uncertainty_score":0.012527108},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025006609,0.0011614881,0.95926124,0.0005376881,0.00012297765,0.00006921869,0.00011251385,0.00006624689,0.013662028],"genre_scores_gemma":[0.66559947,0.0040282323,0.30277377,0.0005099116,0.0009107678,0.00043440025,0.0006215735,0.00018477466,0.024937147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925,0.0002380795,0.00004360514,0.00015400813,0.00024077247,0.0000735283],"domain_scores_gemma":[0.99928826,0.00040381245,0.00011459582,0.00003995028,0.000103397266,0.00005001491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012053634,0.0010216546,0.0009641135,0.0011267102,0.00060641574,0.0022045413,0.0008270252,0.0013522048,0.003049071],"category_scores_gemma":[0.002022367,0.00028735228,0.00087791524,0.0011679166,0.0011066003,0.0033028084,0.0013910679,0.0018921889,0.00025803348],"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.00008004121,0.00013446016,0.00088320166,0.0002883515,0.00006609369,0.00046111847,0.00014370079,0.19603471,0.005900378,0.73510927,0.0040351325,0.05686362],"study_design_scores_gemma":[0.000038002298,0.00008862417,0.00038683758,0.000038309598,0.000027038279,0.00030576825,0.00007814704,0.7723513,0.0013173693,0.20943737,0.015904581,0.000026724267],"about_ca_topic_score_codex":0.0007170126,"about_ca_topic_score_gemma":0.0005772779,"teacher_disagreement_score":0.003049071,"about_ca_system_score_codex":0.0007522685,"about_ca_system_score_gemma":0.0006759856,"threshold_uncertainty_score":0.010200202},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01380209,0.0003450654,0.97319883,0.00028908634,0.000052086205,0.00006384438,0.00006592619,0.000033389322,0.01214972],"genre_scores_gemma":[0.59129417,0.0016828134,0.3872503,0.00042140024,0.00016038066,0.0005627328,0.00036113983,0.00022503248,0.018042034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988343,0.00055299094,0.0000589329,0.00018942614,0.00026441884,0.00009985521],"domain_scores_gemma":[0.99861157,0.00093332765,0.00012212545,0.00007425226,0.00019281,0.00006580607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003236428,0.0015119439,0.00091535604,0.0008905936,0.0005762426,0.0018662465,0.0008415659,0.0011562979,0.0024963643],"category_scores_gemma":[0.004500225,0.0005795573,0.0012482824,0.0007433454,0.002397869,0.0022856775,0.0017485764,0.0028535502,0.0004772084],"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.00004442146,0.00005639942,0.00028438616,0.00020393438,0.000043664175,0.00012268471,0.00017718904,0.18979508,0.0038969398,0.78959906,0.0013337934,0.014442521],"study_design_scores_gemma":[0.0000219811,0.00008275068,0.00021810118,0.00005288473,0.000014950063,0.0000714958,0.00007219185,0.7120099,0.0028008323,0.28067657,0.003954267,0.000024095285],"about_ca_topic_score_codex":0.0012984829,"about_ca_topic_score_gemma":0.0015123816,"teacher_disagreement_score":0.003236428,"about_ca_system_score_codex":0.0014756874,"about_ca_system_score_gemma":0.0016364704,"threshold_uncertainty_score":0.01711607},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040758718,0.0022710508,0.9333011,0.0017533262,0.00028174944,0.00006886975,0.00018990863,0.00007322768,0.02130202],"genre_scores_gemma":[0.86054915,0.0041812155,0.101691686,0.00088392495,0.0005981831,0.00052996137,0.0005424809,0.00019361763,0.030829769],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983669,0.00061529473,0.0001143337,0.00027207533,0.00043142543,0.000199969],"domain_scores_gemma":[0.9955627,0.002107414,0.0004629089,0.00021407037,0.001258083,0.00039484835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003720063,0.0019783108,0.0013799525,0.0019776565,0.0011474403,0.003395786,0.0015211166,0.0019118012,0.0042662304],"category_scores_gemma":[0.008399901,0.0004913749,0.001342535,0.0010683811,0.00404142,0.0061078584,0.0036552434,0.004347349,0.00068288937],"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.00002865409,0.000025635216,0.0003239373,0.00012890794,0.00002827786,0.00013292396,0.00011457373,0.027422903,0.0024284401,0.9644251,0.00082233804,0.004118297],"study_design_scores_gemma":[0.0000086660575,0.00006462034,0.00028024244,0.000040426883,0.000012163567,0.000106863794,0.00012071413,0.322562,0.0013063,0.6731678,0.0022999248,0.000030249617],"about_ca_topic_score_codex":0.0018589452,"about_ca_topic_score_gemma":0.0013462476,"teacher_disagreement_score":0.0042662304,"about_ca_system_score_codex":0.0017763112,"about_ca_system_score_gemma":0.0016610341,"threshold_uncertainty_score":0.019673765},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013654582,0.00026300357,0.9832519,0.00021093024,0.000045994424,0.000038132173,0.000019366176,0.000066479144,0.0024496417],"genre_scores_gemma":[0.39743504,0.0006861429,0.57814646,0.0002574747,0.00010334585,0.00040263182,0.00012329848,0.00019554792,0.02265009],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995534,0.00019661142,0.00002633355,0.000095161064,0.00009096037,0.000037571357],"domain_scores_gemma":[0.9988833,0.00050883385,0.00013780208,0.00011393795,0.00019911156,0.0001570442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001536994,0.0005727174,0.0007390981,0.0007378532,0.0006437154,0.0007183573,0.001104838,0.001212344,0.002533725],"category_scores_gemma":[0.0044542435,0.000434459,0.0008006145,0.0005962597,0.001400427,0.0014351857,0.0019820547,0.0013318837,0.00044229373],"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.00014649899,0.00010777052,0.0026617695,0.00042900274,0.00014650486,0.00048580358,0.0005718758,0.34299996,0.010925549,0.551612,0.0031514692,0.08676174],"study_design_scores_gemma":[0.00001926267,0.000095735784,0.00040401134,0.000027014568,0.000015258094,0.00010743527,0.00005635444,0.908041,0.0009494833,0.08687643,0.0033860037,0.000022055672],"about_ca_topic_score_codex":0.0020769304,"about_ca_topic_score_gemma":0.0024351983,"teacher_disagreement_score":0.002533725,"about_ca_system_score_codex":0.00080555305,"about_ca_system_score_gemma":0.00094021746,"threshold_uncertainty_score":0.008476198},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009554831,0.0007887026,0.98572284,0.00026256524,0.00005565176,0.000042132768,0.000018666655,0.000025687126,0.0035288692],"genre_scores_gemma":[0.5237954,0.00403137,0.46142748,0.00028284744,0.0001799399,0.00041268312,0.00021805863,0.00019303766,0.009459257],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986565,0.0006689142,0.00007260136,0.00019025938,0.00029387348,0.00011770144],"domain_scores_gemma":[0.9960848,0.002840256,0.00021714783,0.00012458541,0.00059201376,0.00014106596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004905182,0.0012990946,0.0014140947,0.0012873417,0.0008263277,0.0019816528,0.0016636938,0.0017403449,0.0023321852],"category_scores_gemma":[0.012891898,0.0005789713,0.0013384854,0.0012725428,0.002820253,0.0034708092,0.0034039628,0.00348314,0.00041876934],"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.00009634391,0.00006121621,0.00048788995,0.00058152375,0.00006294895,0.00014757841,0.00054359477,0.1507609,0.005352248,0.8072854,0.0007625575,0.03385775],"study_design_scores_gemma":[0.000009650563,0.00007571604,0.000090657995,0.00006728013,0.000011564219,0.00005578751,0.00008729585,0.8736041,0.0010974397,0.12312456,0.0017569877,0.00001889593],"about_ca_topic_score_codex":0.0019168039,"about_ca_topic_score_gemma":0.0011764836,"teacher_disagreement_score":0.004905182,"about_ca_system_score_codex":0.0010488944,"about_ca_system_score_gemma":0.0014777073,"threshold_uncertainty_score":0.025941372},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020418383,0.0014737553,0.9623346,0.0005672066,0.000078802,0.00013145362,0.0002647385,0.00006635324,0.014664678],"genre_scores_gemma":[0.71358746,0.004578873,0.26851037,0.00051744375,0.0005023638,0.00091567426,0.0006811186,0.00013330777,0.010573358],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992061,0.00025849175,0.000047043028,0.0002076816,0.00019978182,0.00008086894],"domain_scores_gemma":[0.99913055,0.0005706302,0.00013086361,0.000035708155,0.00009759352,0.000034704583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018390233,0.0019548715,0.0013959642,0.0011435165,0.0006934409,0.0014606953,0.001123953,0.0020123501,0.0030669807],"category_scores_gemma":[0.0032272357,0.0003137549,0.001120933,0.0010675717,0.0017567648,0.001634139,0.0015683912,0.0018131273,0.00044037512],"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.000112961025,0.00012274041,0.0007113904,0.001155514,0.00015517129,0.0007863324,0.0002731188,0.4293339,0.019158741,0.5025286,0.0059434674,0.039718],"study_design_scores_gemma":[0.000024431167,0.00013080884,0.00066768297,0.000115974464,0.000044898567,0.00023679218,0.000109999244,0.8311483,0.0036243529,0.15810068,0.0057619656,0.00003403707],"about_ca_topic_score_codex":0.001134791,"about_ca_topic_score_gemma":0.0008122888,"teacher_disagreement_score":0.0030669807,"about_ca_system_score_codex":0.0008951644,"about_ca_system_score_gemma":0.0009550569,"threshold_uncertainty_score":0.010260105},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13843854,0.00085348537,0.8392976,0.00058487535,0.000043883014,0.00005545555,0.00010012805,0.00010428453,0.020521754],"genre_scores_gemma":[0.9123753,0.00062196475,0.07915386,0.00012633101,0.00006772163,0.0001219173,0.00013838327,0.00007295375,0.0073215473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995055,0.0001581368,0.000037138445,0.00009133796,0.00015527838,0.000052555628],"domain_scores_gemma":[0.9987398,0.00049717864,0.00016071831,0.00008548939,0.00039976032,0.00011704265],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014090074,0.0005072119,0.00047607097,0.0010788337,0.00045412284,0.000750795,0.0005438949,0.0005114965,0.0019908492],"category_scores_gemma":[0.0041122604,0.00023233057,0.0005516152,0.0003980622,0.0014451033,0.0015883831,0.0015106875,0.0009833369,0.00017079036],"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.00004284172,0.000024302119,0.0011058861,0.00012060593,0.000018333567,0.00015178586,0.0001650029,0.04716352,0.0154471025,0.91519713,0.0007504671,0.019813042],"study_design_scores_gemma":[0.000011475946,0.00010377294,0.0011084948,0.000038704333,0.000013290031,0.00024212874,0.000120403056,0.6621169,0.0068273665,0.32569668,0.003693667,0.000027140273],"about_ca_topic_score_codex":0.0009980272,"about_ca_topic_score_gemma":0.00074490445,"teacher_disagreement_score":0.0019908492,"about_ca_system_score_codex":0.0008491898,"about_ca_system_score_gemma":0.0007144439,"threshold_uncertainty_score":0.0074516535},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008517862,0.021417517,0.23734578,0.0030328403,0.003143437,0.000029644018,0.00028227275,0.0005823997,0.7256483],"genre_scores_gemma":[0.28599864,0.03381398,0.11449091,0.0032687841,0.00475979,0.00013196637,0.0005895761,0.0014612132,0.5554851],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946874,0.00007061023,0.000023611392,0.00013533981,0.00023922216,0.0000624368],"domain_scores_gemma":[0.99961793,0.0001641913,0.000022399045,0.00008005839,0.00008309455,0.000032334236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000511358,0.0006787999,0.0006021042,0.0008181051,0.0008616318,0.003212289,0.0005691341,0.0008162537,0.018978853],"category_scores_gemma":[0.0016356371,0.00029074016,0.00074427394,0.00090485485,0.0021777174,0.0046376446,0.0016343825,0.0023696306,0.006746846],"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.0000112752505,0.0000045707575,0.000022646245,0.00007661652,0.0000038813455,0.000045359815,0.00008392486,0.0004932334,0.0008472014,0.9554598,0.010457252,0.03249426],"study_design_scores_gemma":[0.000002560924,0.000020864081,0.0001188043,0.00007653331,0.000008103291,0.0004621429,0.000038424063,0.002414044,0.002102221,0.73770946,0.25703406,0.000012897211],"about_ca_topic_score_codex":0.0003655304,"about_ca_topic_score_gemma":0.00039388618,"teacher_disagreement_score":0.018978853,"about_ca_system_score_codex":0.0012097671,"about_ca_system_score_gemma":0.0006852879,"threshold_uncertainty_score":0.06349063},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037500628,0.000108868175,0.9954396,0.000066644534,0.00002617999,0.000021129305,0.0000053407966,0.00002641924,0.0005557161],"genre_scores_gemma":[0.27077058,0.00040306716,0.7241727,0.00015728484,0.0000952857,0.0003952357,0.00010219758,0.00013156261,0.0037720723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908686,0.00040356224,0.00004942801,0.0001463621,0.00024031888,0.00007346723],"domain_scores_gemma":[0.9985784,0.0008139653,0.00009635322,0.00008631374,0.00032319027,0.0001017884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035700134,0.0013154686,0.0015111996,0.0008998853,0.0006197111,0.0014367932,0.0017701322,0.0018145044,0.0021593843],"category_scores_gemma":[0.0048550577,0.0006785231,0.00092309923,0.00070041534,0.001667279,0.002020247,0.002784736,0.0028065906,0.00044992578],"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.00020726267,0.00012780109,0.0010050819,0.0003678353,0.00016183557,0.00019107739,0.00026484433,0.71108764,0.0066968626,0.19457376,0.001935753,0.08338022],"study_design_scores_gemma":[0.000012962438,0.000031445106,0.000029954064,0.000007407154,0.0000049382675,0.000023355029,0.0000100164325,0.9895573,0.00051635195,0.00932373,0.00047666323,0.0000058391474],"about_ca_topic_score_codex":0.0012352295,"about_ca_topic_score_gemma":0.0010252729,"teacher_disagreement_score":0.0035700134,"about_ca_system_score_codex":0.00093770673,"about_ca_system_score_gemma":0.0016534587,"threshold_uncertainty_score":0.018880308},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013933293,0.00024829732,0.98253113,0.00009941828,0.000029150866,0.000043846438,0.000018021932,0.000028894925,0.0030679053],"genre_scores_gemma":[0.45126107,0.00073788693,0.5350755,0.0001543318,0.00010773603,0.0005837306,0.00015614089,0.000115251256,0.011808302],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992199,0.00035909098,0.000031039308,0.00012898273,0.00018616537,0.0000747195],"domain_scores_gemma":[0.9990369,0.00055680727,0.00011112859,0.00006459992,0.00014812262,0.00008239526],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023416292,0.0012938973,0.0012915604,0.0012062036,0.00069788046,0.0014407947,0.0017760872,0.0014921211,0.0025101665],"category_scores_gemma":[0.004290992,0.0005834909,0.0011487828,0.00096733746,0.002484612,0.002504702,0.004196109,0.0016822441,0.00048471417],"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.00011632637,0.00006395068,0.001020296,0.00025502048,0.000095131334,0.00024553106,0.00035268674,0.3838424,0.0050519053,0.5582179,0.00090171077,0.049837146],"study_design_scores_gemma":[0.000011774508,0.000065104396,0.00012524,0.000024131488,0.00000923996,0.000058697173,0.00004071655,0.9121699,0.0008753084,0.085092805,0.0015131512,0.000014005234],"about_ca_topic_score_codex":0.0016563445,"about_ca_topic_score_gemma":0.0013535287,"teacher_disagreement_score":0.0025101665,"about_ca_system_score_codex":0.00090071827,"about_ca_system_score_gemma":0.0010216546,"threshold_uncertainty_score":0.012383878},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032017687,0.00037206698,0.9929034,0.00038280323,0.0001111156,0.00003770742,0.000048076432,0.00013125711,0.002811796],"genre_scores_gemma":[0.1051908,0.00053819263,0.8818964,0.0006435446,0.0001936084,0.00030097706,0.00021413888,0.00045052604,0.010571805],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986424,0.00066041516,0.000056948687,0.00020668778,0.00030957285,0.0001241101],"domain_scores_gemma":[0.99713373,0.0016282339,0.000108749984,0.00035502642,0.0006066715,0.00016750889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004527424,0.0013763536,0.0019408717,0.0015971259,0.0008205692,0.0016878543,0.0022194383,0.0027469755,0.0056588566],"category_scores_gemma":[0.00960623,0.0007995451,0.0013892408,0.0014182423,0.0022798325,0.0027413734,0.003806828,0.003927542,0.0009307563],"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.00029707825,0.000099225785,0.0005321281,0.00028278984,0.00011069204,0.00008240861,0.0002323144,0.19221082,0.0031388581,0.7026722,0.0078543415,0.092487045],"study_design_scores_gemma":[0.00005820551,0.00005637556,0.00010714836,0.000045681238,0.000015809523,0.000027032604,0.000025741465,0.79808444,0.00096253655,0.19480692,0.0057810973,0.000028959688],"about_ca_topic_score_codex":0.005298232,"about_ca_topic_score_gemma":0.0050518764,"teacher_disagreement_score":0.0056588566,"about_ca_system_score_codex":0.0014496193,"about_ca_system_score_gemma":0.00219164,"threshold_uncertainty_score":0.023943543},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030390343,0.0005144754,0.9417498,0.0007214632,0.000088927496,0.0002247004,0.00033268955,0.00011396649,0.02586366],"genre_scores_gemma":[0.76142114,0.0025118077,0.20333557,0.00040873868,0.0002746726,0.0015945982,0.0011051713,0.00043505756,0.028913226],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983719,0.0006649762,0.00012434537,0.00025566967,0.00032200242,0.00026102006],"domain_scores_gemma":[0.9965305,0.0022309516,0.00033516795,0.00015090025,0.00058221276,0.00017031048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043218783,0.002144048,0.0016087076,0.0017151501,0.0009494699,0.002700159,0.0014176241,0.0017086822,0.009361367],"category_scores_gemma":[0.011360108,0.0010358557,0.00158733,0.0010123473,0.002725895,0.0032123346,0.0031902168,0.0033454944,0.0014877943],"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.00009022974,0.000058892107,0.00034207833,0.00025394498,0.000057973266,0.00018142918,0.0003020014,0.0772457,0.0071069663,0.897769,0.0030281802,0.013563703],"study_design_scores_gemma":[0.00006225101,0.00012794488,0.0004685066,0.00015719997,0.000047644557,0.00008329574,0.00020745609,0.46205854,0.0049738255,0.5257633,0.0059973816,0.000052792264],"about_ca_topic_score_codex":0.0017602443,"about_ca_topic_score_gemma":0.0018309766,"teacher_disagreement_score":0.009361367,"about_ca_system_score_codex":0.0018639606,"about_ca_system_score_gemma":0.0025195505,"threshold_uncertainty_score":0.031316876},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085252084,0.0022902414,0.87690014,0.0011215556,0.0005850495,0.00009888895,0.00017591543,0.0002459831,0.033330128],"genre_scores_gemma":[0.86937344,0.0029212818,0.10446901,0.0006385417,0.0008126485,0.00024914293,0.00040530428,0.00021227688,0.020918394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838185,0.00033128375,0.00013889819,0.00036905037,0.0006142785,0.00016464926],"domain_scores_gemma":[0.99550027,0.0013830966,0.0007298771,0.00062265235,0.0010966533,0.00066744233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038199062,0.001094969,0.0009861524,0.0018184485,0.001009839,0.002048598,0.0019229221,0.0016676767,0.004273438],"category_scores_gemma":[0.013391066,0.00040169005,0.0019616147,0.0007470275,0.0028319587,0.0067005144,0.0037365346,0.0031768053,0.00045201695],"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.0000921347,0.000042983473,0.0018201512,0.00021120155,0.000049516115,0.00054694444,0.00035958042,0.018270887,0.003652538,0.9556004,0.0013855357,0.017968228],"study_design_scores_gemma":[0.000024758658,0.0002152698,0.0019233809,0.00008872642,0.00006086672,0.0012450778,0.00021963227,0.21492921,0.003394038,0.7696302,0.00818609,0.00008278134],"about_ca_topic_score_codex":0.0006950367,"about_ca_topic_score_gemma":0.0004164667,"teacher_disagreement_score":0.004273438,"about_ca_system_score_codex":0.0008456213,"about_ca_system_score_gemma":0.0009294447,"threshold_uncertainty_score":0.020201862},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043076444,0.00008277791,0.9942753,0.00005679522,0.000032536835,0.00003642171,0.000008956757,0.000042373555,0.0011571952],"genre_scores_gemma":[0.19137661,0.0002407687,0.80292577,0.00008041133,0.00005809087,0.0003313637,0.000093753595,0.0000818637,0.004811353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993212,0.00024128798,0.000049658433,0.00011166597,0.00023246855,0.00004374458],"domain_scores_gemma":[0.99920315,0.00046320847,0.0000661883,0.00005051569,0.00016678295,0.000050134808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018313698,0.00077939837,0.0010090033,0.0007393355,0.00061294937,0.0008837432,0.001327569,0.0017671931,0.0021857966],"category_scores_gemma":[0.0039293314,0.00047680188,0.00081692997,0.00067377556,0.0011801667,0.0015531013,0.0013676734,0.0018005832,0.0005237642],"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.00019755049,0.00011990045,0.0008384781,0.0002869049,0.00009620829,0.00013305544,0.00023348838,0.6207862,0.010722494,0.25667128,0.0011828413,0.10873161],"study_design_scores_gemma":[0.000010053077,0.000046964557,0.000049446706,0.000010378519,0.0000049342716,0.000025664678,0.000010114643,0.98613864,0.00072183873,0.011948594,0.0010259313,0.0000073456795],"about_ca_topic_score_codex":0.0020634593,"about_ca_topic_score_gemma":0.0022453002,"teacher_disagreement_score":0.0021857966,"about_ca_system_score_codex":0.0009632431,"about_ca_system_score_gemma":0.001379833,"threshold_uncertainty_score":0.009685338},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009437292,0.0002559325,0.9861369,0.00023664291,0.000056730474,0.0000653082,0.000020571277,0.000037841855,0.0037526926],"genre_scores_gemma":[0.44946614,0.0010149755,0.5370637,0.00042027456,0.00026032765,0.0010862416,0.00020271198,0.00028724677,0.010198434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99639916,0.0014302386,0.00019201184,0.0004913323,0.0012763262,0.0002109276],"domain_scores_gemma":[0.9922795,0.003989152,0.0005800693,0.0005519194,0.0020493194,0.00054996164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00940798,0.0019193463,0.0014703927,0.0022808893,0.0012411317,0.0018882755,0.0023552498,0.002215811,0.0032540234],"category_scores_gemma":[0.018379554,0.00068651285,0.0028236464,0.0009696102,0.005089148,0.0053206757,0.0063690236,0.004339781,0.00048256584],"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.000104621395,0.00006159943,0.00079344964,0.00033560616,0.00019621995,0.00027802653,0.0005293022,0.08377145,0.008639745,0.8768332,0.001589275,0.026867593],"study_design_scores_gemma":[0.000045395667,0.00017527891,0.00033793447,0.00006342693,0.00004022478,0.00023732815,0.00014554404,0.6987771,0.0048242426,0.29204825,0.003259096,0.000046173296],"about_ca_topic_score_codex":0.0013192319,"about_ca_topic_score_gemma":0.0008608059,"teacher_disagreement_score":0.00940798,"about_ca_system_score_codex":0.001312202,"about_ca_system_score_gemma":0.0019853248,"threshold_uncertainty_score":0.04975474},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089155714,0.0001252464,0.9978338,0.0000700168,0.000030734456,0.000039770643,0.000013669962,0.0000976847,0.00089756475],"genre_scores_gemma":[0.06581558,0.00047375064,0.93022394,0.00017016404,0.00013534624,0.00035477983,0.0001769458,0.00021533143,0.0024341308],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99762744,0.0010389498,0.00013541579,0.0002962405,0.000706536,0.00019540306],"domain_scores_gemma":[0.99547017,0.0027635847,0.0002484694,0.00039108522,0.0009805176,0.00014611057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047176774,0.0017283487,0.0013190825,0.0016408508,0.0008168505,0.001757899,0.0027653358,0.0020483218,0.005564352],"category_scores_gemma":[0.012598549,0.00073715666,0.0015818336,0.0010416053,0.001597682,0.0034094076,0.0032243289,0.0036494632,0.0012850601],"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.00012005435,0.00011558822,0.0005208844,0.00037153898,0.000078430276,0.000073442076,0.00017638954,0.2337259,0.0038336467,0.509699,0.003754381,0.24753079],"study_design_scores_gemma":[0.000031046962,0.00006391807,0.00007260821,0.000034827266,0.000011107052,0.00007264027,0.000019570563,0.8879168,0.001542497,0.10655183,0.003663406,0.000019764804],"about_ca_topic_score_codex":0.001400195,"about_ca_topic_score_gemma":0.0013335244,"teacher_disagreement_score":0.005564352,"about_ca_system_score_codex":0.0011814187,"about_ca_system_score_gemma":0.0016717049,"threshold_uncertainty_score":0.024949789},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032176156,0.037267603,0.6513156,0.007665562,0.002471118,0.000085067935,0.000562493,0.00039341883,0.26806292],"genre_scores_gemma":[0.46365267,0.05969175,0.20564461,0.0025854006,0.0068178065,0.00031259103,0.0018797639,0.0008233485,0.25859204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956113,0.00008372778,0.00002105485,0.00010912331,0.0001928342,0.00003215188],"domain_scores_gemma":[0.9988637,0.0005516432,0.000087302906,0.00012793994,0.00027302213,0.00009636972],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069917395,0.0014150505,0.0010199565,0.0016446053,0.00086533144,0.0018859296,0.0011784654,0.00081619347,0.014231707],"category_scores_gemma":[0.0027475934,0.0003776118,0.00069036183,0.0031914818,0.0015306569,0.0022646345,0.0018986941,0.0022732206,0.002493126],"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.000066054,0.00003812027,0.00015367554,0.0004060142,0.000034887405,0.00007654336,0.00013718136,0.011500879,0.0019587467,0.81732774,0.023650069,0.14465006],"study_design_scores_gemma":[0.000019569232,0.000037737598,0.00034251463,0.000070621616,0.000033539873,0.00019118929,0.00007446541,0.066929124,0.0017643555,0.85176766,0.07874875,0.000020499894],"about_ca_topic_score_codex":0.0015939228,"about_ca_topic_score_gemma":0.00156137,"teacher_disagreement_score":0.014231707,"about_ca_system_score_codex":0.0009248265,"about_ca_system_score_gemma":0.00059482537,"threshold_uncertainty_score":0.047609806},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015047076,0.0005978553,0.970959,0.0008653546,0.00009286238,0.00006273682,0.00011181893,0.00012361302,0.012139781],"genre_scores_gemma":[0.6702974,0.001576564,0.31312343,0.0007496532,0.00052802113,0.00067679555,0.00038735179,0.000424706,0.012236096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99825543,0.0006708654,0.000109926055,0.00031286423,0.0004500225,0.00020085447],"domain_scores_gemma":[0.99459416,0.003362971,0.00044005457,0.00029469884,0.0008594734,0.00044860592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058151027,0.0014801373,0.0014535597,0.0026563434,0.0009757013,0.0025038288,0.0014567184,0.0015423248,0.006703562],"category_scores_gemma":[0.016793447,0.0009862304,0.002036149,0.0013106082,0.0030824845,0.004683254,0.0044319723,0.005658985,0.00087712216],"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.000048596878,0.000035924448,0.0002591706,0.00013097578,0.00003622137,0.000116645686,0.00017738405,0.011626254,0.006411064,0.97228867,0.0012716498,0.0075975726],"study_design_scores_gemma":[0.000034695815,0.00014361253,0.0005379702,0.00012810456,0.000046735055,0.00019683286,0.00014866272,0.15240227,0.006438063,0.8324238,0.0074507827,0.000048397244],"about_ca_topic_score_codex":0.00058764435,"about_ca_topic_score_gemma":0.0006828376,"teacher_disagreement_score":0.006703562,"about_ca_system_score_codex":0.0014639866,"about_ca_system_score_gemma":0.0011091697,"threshold_uncertainty_score":0.030753553},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0054531125,0.00005659761,0.993666,0.000029530695,0.00002481174,0.000022230517,0.000005391635,0.000073295436,0.00066890265],"genre_scores_gemma":[0.19256678,0.000106178835,0.8024085,0.00008177812,0.000041362113,0.000319929,0.000061995255,0.00008424515,0.0043292716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996232,0.00011146454,0.000025664998,0.000079131154,0.00013272653,0.000027774362],"domain_scores_gemma":[0.99950945,0.00024361788,0.000036578364,0.000049496666,0.0001281573,0.00003262538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009657937,0.00064879854,0.00070577976,0.0004977287,0.00030070893,0.00061339966,0.0011839868,0.0012440438,0.0021636044],"category_scores_gemma":[0.0013602582,0.00036304284,0.00066808035,0.0003829218,0.0006771397,0.0008458791,0.0012206662,0.0009833899,0.0004390257],"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.00029787983,0.00013053534,0.001057603,0.00031678478,0.0002223085,0.0002529116,0.00020042303,0.7068648,0.044629507,0.06918204,0.0013922057,0.17545304],"study_design_scores_gemma":[0.00001804814,0.000097673365,0.00008647606,0.0000067006886,0.000009985768,0.000044538305,0.0000069851517,0.99309397,0.0020589964,0.0034595851,0.0011064882,0.000010613395],"about_ca_topic_score_codex":0.0009866802,"about_ca_topic_score_gemma":0.0010924574,"teacher_disagreement_score":0.0021636044,"about_ca_system_score_codex":0.00032201072,"about_ca_system_score_gemma":0.0006252287,"threshold_uncertainty_score":0.0072380304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059806585,0.0020038395,0.89660734,0.0007966718,0.0001760001,0.00006786955,0.00010377581,0.00021694097,0.04022105],"genre_scores_gemma":[0.8428463,0.0020172247,0.13884546,0.00046983024,0.00033612395,0.00021945927,0.00017322932,0.00026916136,0.014823266],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9970208,0.0009080391,0.0002062414,0.000982104,0.0006152541,0.00026750905],"domain_scores_gemma":[0.9941316,0.0030811783,0.00054864853,0.0011245572,0.00087410805,0.00023980066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005721549,0.0009529364,0.0011203021,0.0022370396,0.0012168068,0.0033068734,0.0010584232,0.0010530906,0.004080488],"category_scores_gemma":[0.009739589,0.0007600207,0.0015902498,0.00089982356,0.006853348,0.0069117285,0.005611502,0.0044657122,0.00052898587],"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.000016566124,0.000008334668,0.00025477353,0.00007726859,0.000024656705,0.00012448613,0.00025507377,0.0030843804,0.0012084012,0.98551905,0.00022193299,0.009205033],"study_design_scores_gemma":[0.000013962143,0.000102878694,0.00069964514,0.0000708152,0.00004193437,0.00030140273,0.00020980669,0.021972828,0.0044614356,0.9607191,0.01136277,0.000043422835],"about_ca_topic_score_codex":0.00072099094,"about_ca_topic_score_gemma":0.00051629124,"teacher_disagreement_score":0.005721549,"about_ca_system_score_codex":0.0012219598,"about_ca_system_score_gemma":0.0006710153,"threshold_uncertainty_score":0.030258834},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048148945,0.0010001227,0.94489163,0.00042271081,0.00004968053,0.00005401067,0.00004816883,0.00004242262,0.0053422176],"genre_scores_gemma":[0.8093364,0.0010008625,0.18248706,0.00014427443,0.00013838605,0.0002654142,0.00014012965,0.000038631362,0.0064488477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993166,0.0003059705,0.000032868455,0.0001147826,0.00014531067,0.00008444238],"domain_scores_gemma":[0.998686,0.00082525075,0.00017129167,0.00006808445,0.000173812,0.00007546115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019978867,0.0012080278,0.0011609697,0.00073092774,0.0006329661,0.0014966028,0.0014686078,0.0017309627,0.0017549979],"category_scores_gemma":[0.004476962,0.00038978367,0.0012379758,0.00060597114,0.0016349389,0.0025016633,0.0018662688,0.0016850309,0.00013756096],"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.00010795449,0.000065034365,0.0008896305,0.00042928618,0.00011742692,0.00030572654,0.00022978822,0.27159116,0.0052438397,0.70140636,0.0008016944,0.018812187],"study_design_scores_gemma":[0.000015058231,0.000050347466,0.00014806201,0.000026605567,0.000014537897,0.000087869616,0.000055994973,0.90384907,0.0007688997,0.09376049,0.0012121503,0.000010837268],"about_ca_topic_score_codex":0.0019389209,"about_ca_topic_score_gemma":0.0013237856,"teacher_disagreement_score":0.0019978867,"about_ca_system_score_codex":0.0010321833,"about_ca_system_score_gemma":0.00091395207,"threshold_uncertainty_score":0.010565996},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040192995,0.0004553916,0.9939021,0.0001306751,0.00009781374,0.000045079294,0.000026754407,0.00006869839,0.0012542201],"genre_scores_gemma":[0.19287151,0.00094371446,0.7994379,0.00019590533,0.00014748148,0.00028797425,0.0001789818,0.00013754837,0.005799091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899167,0.00049450714,0.00006958711,0.00013416976,0.00024775625,0.00006240211],"domain_scores_gemma":[0.99933857,0.00026757456,0.00007081566,0.00009870573,0.00015076368,0.00007360498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015530074,0.0012798273,0.0012230352,0.0005757863,0.0003117102,0.0010425498,0.001605842,0.0014409977,0.0018940701],"category_scores_gemma":[0.0036456578,0.0005845156,0.0011230807,0.00049229775,0.0009894897,0.0017571487,0.0016771348,0.0021913669,0.0005461096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044101442,0.00014092402,0.00055587525,0.00055458426,0.00019865342,0.00028923785,0.00029999748,0.6432675,0.019058691,0.19130509,0.0032785055,0.14060983],"study_design_scores_gemma":[0.000030031377,0.00011014362,0.00014124106,0.000022389884,0.000013175483,0.00008334209,0.000012661848,0.9821477,0.0021232783,0.012147095,0.0031430968,0.000025826941],"about_ca_topic_score_codex":0.0012100656,"about_ca_topic_score_gemma":0.0010016933,"teacher_disagreement_score":0.0018940701,"about_ca_system_score_codex":0.00058962253,"about_ca_system_score_gemma":0.0008586871,"threshold_uncertainty_score":0.008213222},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50817674,0.0005959894,0.47952068,0.00041571984,0.00013267944,0.00008917927,0.00012592015,0.00015228757,0.01079079],"genre_scores_gemma":[0.9570203,0.00035344108,0.03397553,0.00004598016,0.00004847454,0.00011114053,0.00013855493,0.00006648623,0.008240036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995221,0.00012538343,0.000039707455,0.000060912324,0.00018592479,0.00006612771],"domain_scores_gemma":[0.99640286,0.0019565725,0.00066596747,0.0002494186,0.0003998448,0.00032534412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001494226,0.0009198683,0.00072350795,0.0011931759,0.0006513424,0.0014258098,0.0009239532,0.0011570012,0.0018009756],"category_scores_gemma":[0.009160745,0.00045993595,0.0008301851,0.00036732174,0.0021636733,0.0016292188,0.002680175,0.0013647954,0.00018248663],"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.00021025076,0.0000742025,0.0034390923,0.00020773568,0.000108725835,0.0010320953,0.0007028445,0.5829413,0.008769096,0.38875613,0.00058796693,0.0131705515],"study_design_scores_gemma":[0.000011268054,0.00007464663,0.00046963102,0.000034914177,0.000011692733,0.00010387792,0.00010945381,0.9190876,0.0018829246,0.07766563,0.00053178525,0.000016607823],"about_ca_topic_score_codex":0.0020668535,"about_ca_topic_score_gemma":0.0013656288,"teacher_disagreement_score":0.0020668535,"about_ca_system_score_codex":0.00097439095,"about_ca_system_score_gemma":0.0007882114,"threshold_uncertainty_score":0.007902324},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027770104,0.00035791154,0.9663743,0.0001980091,0.000054276283,0.00007172037,0.000019723157,0.000089043366,0.0050649573],"genre_scores_gemma":[0.65739226,0.0006758596,0.32845175,0.000347774,0.00015859379,0.0005500037,0.00015167179,0.00021087004,0.012061187],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780184,0.00071438623,0.0001393337,0.00046826786,0.00064630574,0.00022980131],"domain_scores_gemma":[0.99464333,0.0033949302,0.0004229413,0.00045391073,0.0006762038,0.00040866248],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047077937,0.0018735745,0.0012894026,0.0014254921,0.0010923013,0.0018524113,0.0025928137,0.0017407442,0.003780819],"category_scores_gemma":[0.01409218,0.0007913984,0.0018383703,0.0007729163,0.0029885918,0.005024548,0.00521866,0.0030449284,0.0005158453],"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.0002180181,0.000093031245,0.0013008079,0.00032943886,0.00013909565,0.00023054414,0.000534909,0.18666837,0.007065666,0.7580445,0.001035817,0.044339914],"study_design_scores_gemma":[0.000032752854,0.0001687051,0.00026403196,0.000036259673,0.00002622191,0.00011473221,0.00008008583,0.8362732,0.0031013628,0.15783341,0.0020405408,0.000028608281],"about_ca_topic_score_codex":0.0010241303,"about_ca_topic_score_gemma":0.0010721858,"teacher_disagreement_score":0.0047077937,"about_ca_system_score_codex":0.0014441939,"about_ca_system_score_gemma":0.0012886979,"threshold_uncertainty_score":0.024897516},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013318511,0.0005805166,0.9709608,0.00048086667,0.0000555277,0.00011647638,0.00013550028,0.00007788298,0.014273899],"genre_scores_gemma":[0.69995856,0.003344569,0.27335742,0.00038681022,0.00022618995,0.0014665407,0.00081037893,0.0004970822,0.019952497],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9973194,0.0011912843,0.00018207874,0.00034238675,0.00062862085,0.00033638216],"domain_scores_gemma":[0.9936336,0.004582199,0.00040409985,0.00024679312,0.000938338,0.00019488417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007016588,0.002396309,0.0018854404,0.0019738108,0.00088435016,0.0032197544,0.0013988614,0.0016318508,0.0074988822],"category_scores_gemma":[0.01520472,0.0011634605,0.0020474342,0.0014666093,0.0028220639,0.004234506,0.0034599346,0.0035293417,0.0012315488],"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.000113486974,0.00009556661,0.0003826892,0.00047622444,0.000086645734,0.00020872314,0.0003150533,0.2526409,0.005307849,0.71235204,0.0033562784,0.024664544],"study_design_scores_gemma":[0.000048487196,0.00012665015,0.00033039248,0.00017538849,0.00003726765,0.00007356223,0.00014053589,0.6418967,0.003910288,0.3488145,0.004403578,0.000042607287],"about_ca_topic_score_codex":0.001455268,"about_ca_topic_score_gemma":0.0011673416,"teacher_disagreement_score":0.0074988822,"about_ca_system_score_codex":0.0017974166,"about_ca_system_score_gemma":0.0023282354,"threshold_uncertainty_score":0.037107706},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029801847,0.012392125,0.07913112,0.0017404379,0.0013858286,0.000019684634,0.00025399058,0.00033557817,0.901761],"genre_scores_gemma":[0.089116834,0.014611827,0.03110752,0.00086178875,0.002226573,0.000097864766,0.0006825175,0.0011018746,0.8601931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99977535,0.000040077884,0.0000065347585,0.00004697924,0.00010869173,0.000022369908],"domain_scores_gemma":[0.9998739,0.00004121589,0.000008894819,0.000029249224,0.000030395417,0.000016300028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003269556,0.001014672,0.0008662658,0.0014550409,0.0008699624,0.0024315906,0.000763017,0.0009644613,0.03673913],"category_scores_gemma":[0.0008513027,0.00045463783,0.0004685118,0.001383715,0.001368843,0.0024229218,0.0013562449,0.0030018988,0.012518514],"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.000009145487,0.000011058506,0.000024200806,0.00006517669,0.0000065274253,0.000014265804,0.00004506321,0.0010630087,0.00048050485,0.8817037,0.054580353,0.061996985],"study_design_scores_gemma":[0.0000037791472,0.000011363568,0.00016618762,0.0000811874,0.000008584463,0.00011437592,0.00003212894,0.005406417,0.00066816295,0.7472527,0.24624392,0.000011178923],"about_ca_topic_score_codex":0.0005259183,"about_ca_topic_score_gemma":0.0007140144,"teacher_disagreement_score":0.03673913,"about_ca_system_score_codex":0.0011095236,"about_ca_system_score_gemma":0.0004357496,"threshold_uncertainty_score":0.12290466},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001368384,0.00007494083,0.99760914,0.000047482616,0.000022331744,0.000021992317,0.0000066052,0.000037650247,0.0008113772],"genre_scores_gemma":[0.08733032,0.00022466967,0.90860695,0.0000857533,0.000066257744,0.0003937623,0.000057912795,0.00014558331,0.0030888491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860483,0.00052601565,0.0000748469,0.00016417421,0.00053572323,0.00009443947],"domain_scores_gemma":[0.997502,0.0015294597,0.0002252463,0.00016454182,0.00043867566,0.00014011601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024762354,0.0014345981,0.00141002,0.0012865253,0.00062603573,0.0014725141,0.0024803318,0.0023383943,0.0032334386],"category_scores_gemma":[0.006195063,0.00094189146,0.0019219458,0.0009527077,0.001406183,0.0022128713,0.003363945,0.0027393873,0.000833635],"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.00016994639,0.00013430936,0.00070104265,0.00043246098,0.00019448584,0.0002585488,0.00037823862,0.6827357,0.0109367715,0.16677414,0.0023233118,0.13496102],"study_design_scores_gemma":[0.00001548664,0.000031087344,0.000037723967,0.000017112909,0.000008892889,0.00004067117,0.000011744683,0.9854697,0.0012872659,0.011686361,0.0013793729,0.000014519368],"about_ca_topic_score_codex":0.0011818875,"about_ca_topic_score_gemma":0.0012099808,"teacher_disagreement_score":0.0032334386,"about_ca_system_score_codex":0.0006614733,"about_ca_system_score_gemma":0.0011713643,"threshold_uncertainty_score":0.0130957365},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014677435,0.00003673087,0.9977131,0.000027358952,0.000012402234,0.000026643798,0.0000065510617,0.000043316293,0.0006661491],"genre_scores_gemma":[0.073155284,0.00014311519,0.9233818,0.0000708444,0.00003858548,0.00034035835,0.00009803713,0.000107502405,0.0026644024],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908185,0.0002952152,0.00004955463,0.00016321563,0.00034506124,0.0000650894],"domain_scores_gemma":[0.9992853,0.00030243702,0.000053823238,0.000085621046,0.0002243756,0.00004839306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017599453,0.0010680672,0.0010234027,0.00084970344,0.00056609546,0.00086613983,0.0020172133,0.0016577541,0.002951193],"category_scores_gemma":[0.003128124,0.00051301066,0.0012376521,0.0008391053,0.0013681737,0.0017206095,0.0026012373,0.0018319235,0.0007205774],"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.00013646278,0.000083374594,0.00075392704,0.00034799482,0.00016309504,0.00026927333,0.00034824348,0.46320775,0.015726525,0.34703258,0.0029533897,0.16897742],"study_design_scores_gemma":[0.000025659263,0.000065556604,0.00007129443,0.000017169525,0.000013714899,0.00012666288,0.000021472613,0.9533039,0.0021463002,0.040726144,0.0034648334,0.000017272201],"about_ca_topic_score_codex":0.0011755629,"about_ca_topic_score_gemma":0.0010505329,"teacher_disagreement_score":0.002951193,"about_ca_system_score_codex":0.0006360136,"about_ca_system_score_gemma":0.0015358581,"threshold_uncertainty_score":0.009872735},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0022748753,0.0589989,0.1771362,0.0036501086,0.0033962817,0.000042989723,0.000648562,0.00043017507,0.7534219],"genre_scores_gemma":[0.058537968,0.06344253,0.07514844,0.0017359382,0.005206774,0.00023879406,0.0011031583,0.0015849127,0.79300153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995303,0.00009048527,0.000020218318,0.00010083317,0.00023144753,0.000026725289],"domain_scores_gemma":[0.99975973,0.000091687645,0.0000117071195,0.00005128389,0.00006632871,0.000019278947],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005579601,0.0015971215,0.0011907859,0.0014876443,0.0006895228,0.0033440557,0.0010168082,0.0009643027,0.029981665],"category_scores_gemma":[0.0013666684,0.00071825867,0.0008381962,0.0033709381,0.0021592365,0.0035545083,0.0015345124,0.0041302163,0.015682673],"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.000013233203,0.000019304556,0.00004217472,0.00020209704,0.000016197711,0.00003314113,0.00011912962,0.0019239954,0.0005902481,0.74034065,0.13800268,0.118697084],"study_design_scores_gemma":[0.0000068476556,0.000015695621,0.00026648236,0.00014486931,0.000017279744,0.00017403194,0.000050084982,0.003960137,0.0004353054,0.53755593,0.4573563,0.000016969425],"about_ca_topic_score_codex":0.0014687827,"about_ca_topic_score_gemma":0.0023519068,"teacher_disagreement_score":0.029981665,"about_ca_system_score_codex":0.0014247029,"about_ca_system_score_gemma":0.0009439578,"threshold_uncertainty_score":0.1002987},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1876392,0.0018759887,0.7824244,0.001295878,0.00023522104,0.00012652525,0.00017705737,0.00020113634,0.02602472],"genre_scores_gemma":[0.8760868,0.0021643178,0.0994063,0.00061216287,0.00032589684,0.0007022572,0.0003334769,0.00018457223,0.020184278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982343,0.00070267735,0.00013604743,0.00027768657,0.00047434162,0.00017496712],"domain_scores_gemma":[0.9915665,0.005501331,0.00056923105,0.00043231595,0.0013119805,0.0006186424],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0072875284,0.0017731587,0.0010931565,0.0032985336,0.0016420747,0.0027639014,0.0021689434,0.0014065043,0.0036369178],"category_scores_gemma":[0.012894981,0.00068548584,0.0023342064,0.0011649122,0.00395801,0.006848787,0.005266452,0.0039922404,0.000313953],"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.000102768005,0.000041778945,0.0006325273,0.00014220516,0.000090766254,0.00027861755,0.0005949356,0.014852216,0.0039851456,0.9712295,0.00055228866,0.0074972347],"study_design_scores_gemma":[0.00004628085,0.00018366403,0.0007744588,0.00010320427,0.000057021072,0.0003308479,0.00042917754,0.26198408,0.0021742794,0.7310879,0.0027818878,0.000047199963],"about_ca_topic_score_codex":0.0011319779,"about_ca_topic_score_gemma":0.0006877637,"teacher_disagreement_score":0.0072875284,"about_ca_system_score_codex":0.0021053476,"about_ca_system_score_gemma":0.0010546377,"threshold_uncertainty_score":0.0385406},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000045659363,0.0027091962,0.00013728967,0.017505826,0.97734195,0.000022760996,0.000038417187,0.00006117728,0.0021377215],"genre_scores_gemma":[0.0003893147,0.0025599895,0.000085496955,0.0084782,0.97545856,0.000019905072,0.000035730787,0.00004938463,0.0129233105],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99709284,0.00037328375,0.00028752012,0.00050346047,0.0014845101,0.00025844295],"domain_scores_gemma":[0.98973453,0.0022756446,0.00070087565,0.00028058857,0.004715092,0.0022933767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003199413,0.0037520987,0.0030552477,0.0034028825,0.0026129298,0.006862088,0.0025180972,0.007976448,0.031284183],"category_scores_gemma":[0.014352551,0.00088869577,0.0021045853,0.0011888598,0.0015896283,0.004333086,0.0013827928,0.01047045,0.028235478],"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.000030910578,0.00001258675,0.000024161154,0.00011237057,0.000008127902,0.00009329504,0.000007603036,0.000027359383,0.00007030087,0.00020456214,0.9945861,0.004822612],"study_design_scores_gemma":[0.000029253533,0.000031156327,0.00022797835,0.00019392127,0.00002147808,0.00038633912,0.000028950437,0.00014825967,0.0001348998,0.00066496345,0.99811757,0.000015293814],"about_ca_topic_score_codex":0.0008075713,"about_ca_topic_score_gemma":0.0019251974,"teacher_disagreement_score":0.031284183,"about_ca_system_score_codex":0.0023603837,"about_ca_system_score_gemma":0.0021176492,"threshold_uncertainty_score":0.10465604},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024016034,0.00041824355,0.96553284,0.0003818111,0.00012957162,0.00007530634,0.000047799702,0.00016964124,0.009228843],"genre_scores_gemma":[0.610267,0.00082738383,0.36716592,0.00049336976,0.00031140936,0.0006308304,0.0004089348,0.0005184024,0.01937667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992092,0.0003812684,0.00003505313,0.00008135048,0.00020123551,0.000091922055],"domain_scores_gemma":[0.9959805,0.0026506754,0.00025521155,0.00026452495,0.000558722,0.0002902696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031029903,0.001359496,0.001281347,0.0016632346,0.0010183244,0.0014401466,0.0021027965,0.0017243228,0.0046746642],"category_scores_gemma":[0.012285473,0.00080891215,0.0012812311,0.00084621937,0.0025295997,0.0025222157,0.00539555,0.0028097618,0.00059445814],"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.00017918886,0.00011284573,0.0009243868,0.00022301116,0.00011427309,0.00007858108,0.0002160716,0.58677423,0.0023521169,0.36782882,0.002854996,0.03834147],"study_design_scores_gemma":[0.000011557026,0.000044701417,0.00010581284,0.000012896446,0.0000060172956,0.000009636845,0.000018416613,0.94640774,0.00027037086,0.052395724,0.00070963206,0.0000075498488],"about_ca_topic_score_codex":0.0040389444,"about_ca_topic_score_gemma":0.00422934,"teacher_disagreement_score":0.0046746642,"about_ca_system_score_codex":0.001127204,"about_ca_system_score_gemma":0.0016602332,"threshold_uncertainty_score":0.01641035},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12435393,0.00082187983,0.848438,0.0007567318,0.00014938625,0.00017142545,0.000110881425,0.0001423815,0.025055358],"genre_scores_gemma":[0.86552876,0.0009192435,0.11482461,0.0004720079,0.00021729774,0.00045394892,0.00015977152,0.00009723162,0.017327078],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99849606,0.00039881218,0.000085613334,0.00025916874,0.00063771894,0.00012260994],"domain_scores_gemma":[0.9960931,0.0017187962,0.00047790894,0.00031314488,0.0010447234,0.00035229724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033212898,0.00090221624,0.00081263913,0.001745335,0.0011394738,0.00173235,0.0009980538,0.0012657075,0.0039293426],"category_scores_gemma":[0.0051928847,0.00037962224,0.001461535,0.00069959747,0.0034845187,0.0048525496,0.0029148837,0.0032187616,0.000690032],"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.000053816144,0.00002419644,0.0002498754,0.00008667153,0.000029023271,0.0002854105,0.00048536045,0.004511846,0.0058498657,0.9819759,0.0004061994,0.00604182],"study_design_scores_gemma":[0.000038555198,0.00020219985,0.0005755535,0.000036386962,0.000020131061,0.00044127036,0.0003023773,0.045688115,0.006329197,0.9416431,0.004686703,0.000036370933],"about_ca_topic_score_codex":0.0004038802,"about_ca_topic_score_gemma":0.00031189303,"teacher_disagreement_score":0.0039293426,"about_ca_system_score_codex":0.0009023039,"about_ca_system_score_gemma":0.000734751,"threshold_uncertainty_score":0.017564893},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004254078,0.000052824715,0.99500895,0.00003973036,0.000022245475,0.000025786825,0.0000051158495,0.000054220873,0.00053707906],"genre_scores_gemma":[0.17204253,0.00021411479,0.8231083,0.00011551255,0.0000803725,0.00028185284,0.000092704686,0.00009397734,0.0039705024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950576,0.00015413998,0.000035519843,0.00010997728,0.00015416114,0.000040405903],"domain_scores_gemma":[0.9993716,0.00029239312,0.00007168567,0.00007398562,0.0001370662,0.00005318272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014656278,0.00081926474,0.00087421644,0.000797757,0.0005921428,0.00064972206,0.001403489,0.0014045588,0.0026527087],"category_scores_gemma":[0.0029940086,0.0003527487,0.0008087083,0.0005693465,0.00109007,0.0019817508,0.0015346725,0.0019598494,0.00053968583],"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.00016942267,0.000112889225,0.0009444719,0.00024283216,0.00008177898,0.00018873626,0.00029905123,0.30695057,0.015687704,0.46994478,0.0020321815,0.20334572],"study_design_scores_gemma":[0.000014882841,0.00013216304,0.00008192679,0.000016046824,0.000008190518,0.00007469969,0.000017295148,0.952835,0.002779989,0.041746445,0.0022755573,0.000017746877],"about_ca_topic_score_codex":0.0008457159,"about_ca_topic_score_gemma":0.0009249142,"teacher_disagreement_score":0.0026527087,"about_ca_system_score_codex":0.0005180447,"about_ca_system_score_gemma":0.0010439652,"threshold_uncertainty_score":0.008874178},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023210165,0.00013829794,0.9966389,0.000045034794,0.000018290293,0.000022754239,0.000007683596,0.000036286416,0.0007716716],"genre_scores_gemma":[0.16874497,0.000547938,0.8268613,0.00011964716,0.0000722102,0.00032670947,0.00012012679,0.0001269139,0.0030801343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989096,0.0004982164,0.00006363391,0.00012291601,0.00031780198,0.00008791577],"domain_scores_gemma":[0.9988167,0.0006104022,0.000114004804,0.0001273256,0.00026155112,0.00007001683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002351013,0.0013891059,0.0011252868,0.0007820089,0.0004450576,0.00079902995,0.0016635814,0.0011355986,0.002781491],"category_scores_gemma":[0.0046561,0.0005939807,0.0012766368,0.0008578271,0.0011993805,0.0017568825,0.002595144,0.0024658309,0.00062260247],"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.00012694199,0.0000843858,0.0005299893,0.00034694196,0.00012292778,0.00018173076,0.00027042656,0.5897263,0.0064314934,0.27134678,0.002292988,0.12853907],"study_design_scores_gemma":[0.000012680738,0.000033028693,0.000038758008,0.000013956051,0.0000066793673,0.000046063647,0.000014615107,0.9690563,0.00091374706,0.028390476,0.0014676348,0.000006033103],"about_ca_topic_score_codex":0.0011571319,"about_ca_topic_score_gemma":0.0013089366,"teacher_disagreement_score":0.002781491,"about_ca_system_score_codex":0.0006176402,"about_ca_system_score_gemma":0.0010658797,"threshold_uncertainty_score":0.012433529},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011329141,0.00011543217,0.9874823,0.000050487626,0.00003640985,0.000032566,0.000006831545,0.00004891077,0.00089788606],"genre_scores_gemma":[0.39032468,0.0004304675,0.6030081,0.000068942485,0.00006828246,0.00025495506,0.000064576874,0.00007557906,0.0057043843],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995505,0.00016967482,0.0000364094,0.00007702492,0.00013345685,0.0000328934],"domain_scores_gemma":[0.99922454,0.00040897558,0.000075306816,0.00004742345,0.000189571,0.0000542839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013846655,0.00070018176,0.00080739165,0.0007319019,0.00056173565,0.0007915598,0.00088347425,0.0013112169,0.001361247],"category_scores_gemma":[0.00367975,0.0003517971,0.0005532074,0.0004997527,0.0012666984,0.0012623678,0.0011083342,0.001351135,0.00035911574],"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.0003060178,0.00013339266,0.0013408824,0.00043871932,0.00008090852,0.00021983872,0.00049166736,0.503394,0.03480656,0.31648704,0.001141204,0.1411597],"study_design_scores_gemma":[0.000010981204,0.00012999286,0.00007817111,0.000015240803,0.0000060052676,0.00004914268,0.000016465478,0.9802127,0.0026450055,0.015831714,0.0009921548,0.000012467827],"about_ca_topic_score_codex":0.0011838874,"about_ca_topic_score_gemma":0.0010092768,"teacher_disagreement_score":0.0013846655,"about_ca_system_score_codex":0.00068016956,"about_ca_system_score_gemma":0.0010600409,"threshold_uncertainty_score":0.007322848},"labels":[],"label_agreement":null},{"id":"W4238404478","doi":"10.1007/s11228-017-0466-z","title":"Preface","year":2017,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Philosophy","score_opus":0.021250713558395976,"score_gpt":0.2790753072660079,"score_spread":0.2578245937076119,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238404478","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017078634,0.017833978,0.016199984,0.058024816,0.31368375,0.0005062909,0.015111638,0.0016714501,0.57526016],"genre_scores_gemma":[0.008841677,0.005526488,0.0041903164,0.0095140785,0.034437027,0.00025890584,0.007520824,0.0010848609,0.92862576],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990607,0.000158034,0.00005230458,0.00017517645,0.0004775715,0.0000762419],"domain_scores_gemma":[0.9942152,0.0009505753,0.00019095327,0.00051009306,0.003217712,0.00091550424],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015464571,0.00089649804,0.0006603225,0.0026489508,0.0020974502,0.0033215233,0.0011715707,0.0010289797,0.39254096],"category_scores_gemma":[0.014684435,0.00024017229,0.00050173135,0.0016753728,0.00060097297,0.0023546617,0.0020455166,0.0028209933,0.25432774],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023247829,0.00001594001,0.000092155795,0.00007740664,0.0000024871224,0.000033259337,0.000049446182,0.00007766634,0.000100938625,0.009130236,0.9508025,0.039594766],"study_design_scores_gemma":[0.000004357628,0.00000748539,0.00018390786,0.00010688579,0.0000019850659,0.000036474496,0.00004873301,0.000045039174,0.00011156928,0.006390421,0.9930582,0.0000048300276],"about_ca_topic_score_codex":0.0034306147,"about_ca_topic_score_gemma":0.0052820207,"teacher_disagreement_score":0.60745907,"about_ca_system_score_codex":0.0022315406,"about_ca_system_score_gemma":0.0024274462,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12743156,0.0025462816,0.84267294,0.0015101766,0.000098966106,0.00006095299,0.00016310436,0.000061314924,0.025454665],"genre_scores_gemma":[0.93465114,0.0021155376,0.058933787,0.00023864461,0.000228861,0.00010577639,0.00014628957,0.00007253498,0.0035074458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990213,0.000546076,0.00004182893,0.00012285134,0.00015315758,0.00011485554],"domain_scores_gemma":[0.99601245,0.0029155612,0.00036662372,0.00014729628,0.00038716017,0.00017080198],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028196846,0.0007795016,0.0008670928,0.001197899,0.00058612094,0.0017360382,0.0006453069,0.00069096446,0.0018738697],"category_scores_gemma":[0.006916021,0.00035298,0.0009091084,0.00081710314,0.0030844514,0.0029297043,0.0013178217,0.0017908904,0.00017846774],"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.00003295372,0.000022305983,0.00048454007,0.000114905764,0.000027117307,0.00017174777,0.00018024899,0.03251197,0.002907837,0.9559734,0.00065863394,0.0069143698],"study_design_scores_gemma":[0.000012950047,0.0000890489,0.0011890223,0.00007259384,0.000018588196,0.00018738763,0.0001693,0.2656022,0.0020608515,0.7282559,0.0023122267,0.000029960469],"about_ca_topic_score_codex":0.00074190844,"about_ca_topic_score_gemma":0.0005822556,"teacher_disagreement_score":0.0028196846,"about_ca_system_score_codex":0.0009015352,"about_ca_system_score_gemma":0.0005937622,"threshold_uncertainty_score":0.014912128},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002934325,0.0044041076,0.65081114,0.0010796415,0.0022359176,0.000061881845,0.0004922085,0.001379753,0.33660102],"genre_scores_gemma":[0.06191081,0.005335546,0.23622668,0.0008170091,0.0012594826,0.0002524571,0.0015015479,0.0029315085,0.6897649],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996698,0.000068790796,0.000010601269,0.00008443437,0.00014571277,0.00002064905],"domain_scores_gemma":[0.9998739,0.00002391919,0.000006878663,0.000042993284,0.0000381659,0.000014189476],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00038399143,0.0012965655,0.00090390665,0.000943822,0.00056330126,0.0016270803,0.0007997047,0.00087679835,0.05139289],"category_scores_gemma":[0.00063333305,0.00042413455,0.00048700193,0.00089269463,0.0012445238,0.0019427477,0.0018556763,0.001967991,0.025042547],"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.000019272715,0.000025669116,0.000045950816,0.0001287774,0.000017934242,0.000033037406,0.0000752454,0.005600681,0.0037470486,0.71395046,0.08236735,0.19398853],"study_design_scores_gemma":[0.0000060520442,0.000027823105,0.00015699373,0.00007754932,0.000011629155,0.0001899465,0.00005468174,0.021978281,0.0029656165,0.6116105,0.36289164,0.000029390476],"about_ca_topic_score_codex":0.00035954482,"about_ca_topic_score_gemma":0.00067070965,"teacher_disagreement_score":0.9486071,"about_ca_system_score_codex":0.00046485398,"about_ca_system_score_gemma":0.00042443423,"threshold_uncertainty_score":0.17192632},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05959405,0.0020623698,0.918215,0.0007985988,0.00034160208,0.00009721171,0.00013011739,0.00019537518,0.018565726],"genre_scores_gemma":[0.81745166,0.0034211879,0.15328752,0.000492897,0.00048959465,0.00025671584,0.00039177024,0.0003425652,0.023866007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802715,0.00041477004,0.00016245153,0.00032703453,0.00090061914,0.00016795183],"domain_scores_gemma":[0.99443936,0.002387602,0.0005923408,0.00063556066,0.0014936446,0.00045145256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004594193,0.0016372124,0.0012011136,0.002104315,0.0011760399,0.0019239187,0.0016714361,0.0018953688,0.0036745544],"category_scores_gemma":[0.013556716,0.000427576,0.0024940914,0.0007308094,0.0038410786,0.00454227,0.003973474,0.003648304,0.0004519161],"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.00024267915,0.000100308716,0.0031121066,0.0006530164,0.0001723139,0.0009496137,0.001050365,0.118423976,0.011494635,0.8226053,0.0014996706,0.03969604],"study_design_scores_gemma":[0.000026912494,0.00033267232,0.0017006559,0.00021765853,0.00009594394,0.001154871,0.00043891207,0.5617976,0.014943027,0.41153193,0.0076565114,0.000103322585],"about_ca_topic_score_codex":0.0011451626,"about_ca_topic_score_gemma":0.0004446352,"teacher_disagreement_score":0.004594193,"about_ca_system_score_codex":0.0011237507,"about_ca_system_score_gemma":0.0009853138,"threshold_uncertainty_score":0.024296701},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020957035,0.00007094272,0.99711347,0.00006646414,0.00002532505,0.000023360719,0.00000957492,0.00006498012,0.0005300899],"genre_scores_gemma":[0.099864446,0.00027301622,0.89559525,0.00006751776,0.000053507403,0.0002059076,0.000087346896,0.00009978011,0.0037532875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995466,0.00017737069,0.000022045748,0.000069237605,0.00014903654,0.0000357048],"domain_scores_gemma":[0.9995689,0.00017258518,0.00003624865,0.000036636124,0.00014463153,0.000041060495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012576208,0.0010194032,0.0012245907,0.00074199995,0.0004267978,0.0007755506,0.001334638,0.0011314502,0.002612475],"category_scores_gemma":[0.002000164,0.00051802566,0.0007057953,0.0006305721,0.0011649915,0.0016361052,0.0011430575,0.0016013819,0.0006860064],"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.00010975038,0.00008866802,0.00042821316,0.00025332381,0.000068021865,0.000134553,0.00018161252,0.6408984,0.009317206,0.23303293,0.0029742157,0.11251305],"study_design_scores_gemma":[0.000014083967,0.000046744895,0.000032830132,0.0000066252724,0.0000034084242,0.000029189978,0.0000076088104,0.9830063,0.00082894927,0.014299873,0.0017173368,0.0000070855654],"about_ca_topic_score_codex":0.0032704775,"about_ca_topic_score_gemma":0.0031448072,"teacher_disagreement_score":0.0032704775,"about_ca_system_score_codex":0.001005242,"about_ca_system_score_gemma":0.0017033087,"threshold_uncertainty_score":0.008739591},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118263416,0.0012407033,0.85807496,0.00056047924,0.00012003122,0.000070005575,0.000108003216,0.00018488533,0.021377554],"genre_scores_gemma":[0.85739416,0.0017437424,0.13096698,0.00048746378,0.0002293838,0.00020228903,0.00021570819,0.00017799993,0.008582449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979699,0.00042715025,0.00017530422,0.0006233981,0.0006003056,0.00020380222],"domain_scores_gemma":[0.99716467,0.0009977976,0.00040885533,0.00046547758,0.00067241077,0.000290783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032384945,0.00072839006,0.0009726505,0.0015168288,0.0010219851,0.0019217299,0.000986691,0.0008275762,0.0024467795],"category_scores_gemma":[0.006232821,0.00049813994,0.0015983963,0.0014742006,0.003459576,0.0056683063,0.003698515,0.002847684,0.00029372322],"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.00006475451,0.000042467735,0.0013807869,0.00015601321,0.000035326957,0.00022456884,0.00056794274,0.007821709,0.008153584,0.96038723,0.0004303216,0.020735232],"study_design_scores_gemma":[0.000024410529,0.00030273994,0.0033384943,0.00010415423,0.000080647114,0.00092942815,0.0004337693,0.12673216,0.011503804,0.84512144,0.0113731045,0.000055941735],"about_ca_topic_score_codex":0.00093705126,"about_ca_topic_score_gemma":0.00065178453,"teacher_disagreement_score":0.0032384945,"about_ca_system_score_codex":0.0013044756,"about_ca_system_score_gemma":0.0013583765,"threshold_uncertainty_score":0.017127037},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031916987,0.00010203495,0.9664393,0.00012387568,0.000019558152,0.000034888162,0.00000859934,0.00004310678,0.0013115754],"genre_scores_gemma":[0.5317573,0.00022830244,0.46191216,0.00009430652,0.000047657224,0.00024364688,0.000043053893,0.00007596265,0.005597594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945766,0.00021760173,0.00003410804,0.000060723843,0.00018574002,0.000044163513],"domain_scores_gemma":[0.99850875,0.0008972943,0.00014933983,0.00011758082,0.00024477777,0.00008220105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019343356,0.0005786866,0.00060518936,0.00046207535,0.00039752206,0.00076039165,0.0012142094,0.0011937801,0.001305659],"category_scores_gemma":[0.005704947,0.00031412876,0.0006468987,0.00032440893,0.0015855536,0.0011373168,0.001447916,0.0011637615,0.0002363115],"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.00021390566,0.000062067455,0.001414775,0.00020123344,0.000060619663,0.0002694874,0.00054609415,0.63412535,0.017247725,0.288044,0.0007540027,0.0570608],"study_design_scores_gemma":[0.000012051153,0.00006345285,0.000060455266,0.000008282644,0.000004195039,0.000034501936,0.000012477923,0.98560035,0.0018221394,0.011945079,0.00042764287,0.000009444041],"about_ca_topic_score_codex":0.001981918,"about_ca_topic_score_gemma":0.001324883,"teacher_disagreement_score":0.001981918,"about_ca_system_score_codex":0.00057634193,"about_ca_system_score_gemma":0.0010645945,"threshold_uncertainty_score":0.010229886},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028446312,0.0042031687,0.6542672,0.0009405434,0.0017684825,0.000056307937,0.00040959136,0.0011739399,0.33433613],"genre_scores_gemma":[0.0603406,0.005061047,0.23486525,0.00071153266,0.0009952681,0.00022817486,0.0012293274,0.002431165,0.6941377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996873,0.000066230605,0.000009952974,0.000075340184,0.00014180262,0.00001934739],"domain_scores_gemma":[0.9998934,0.000020554578,0.000005895379,0.000035809277,0.00003269929,0.000011728008],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036129734,0.001219536,0.0008874129,0.00092116767,0.0005510295,0.001488719,0.0007796316,0.0008251935,0.04687505],"category_scores_gemma":[0.0005497149,0.0004130016,0.00045481184,0.0008901296,0.0012313015,0.0018312173,0.0017543413,0.0018412154,0.020927433],"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.000017464596,0.000024557003,0.00004578699,0.000116676674,0.000016855212,0.000033407072,0.0000771085,0.0058432333,0.0038243898,0.7054045,0.07657195,0.20802402],"study_design_scores_gemma":[0.000005642056,0.000026899395,0.0001667084,0.00007434304,0.000011167819,0.00020191428,0.000058892914,0.023390876,0.0031752065,0.6104467,0.36241186,0.000029845165],"about_ca_topic_score_codex":0.00039319944,"about_ca_topic_score_gemma":0.00077678467,"teacher_disagreement_score":0.04687505,"about_ca_system_score_codex":0.00045445282,"about_ca_system_score_gemma":0.0004169438,"threshold_uncertainty_score":0.15681267},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011602334,0.00013643142,0.9866614,0.00013531369,0.000026749844,0.000049007223,0.000010441428,0.000054071224,0.0013241831],"genre_scores_gemma":[0.3794836,0.0005973195,0.6126734,0.00021268996,0.0001125623,0.0006762087,0.00012623427,0.00016308065,0.005954955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859923,0.0006234736,0.00007549979,0.00019456125,0.00038183155,0.00012532885],"domain_scores_gemma":[0.99673766,0.0022197715,0.0001910376,0.00015204666,0.0005135452,0.00018589356],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003865908,0.0014661856,0.0014142664,0.0010472693,0.0007671659,0.0010575715,0.0014453518,0.0018865311,0.0022926247],"category_scores_gemma":[0.010993256,0.00060477736,0.0015361821,0.0006293239,0.0020440521,0.0016926877,0.0032162885,0.002800192,0.00045130157],"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.00030890258,0.00015124734,0.0017507749,0.00049573224,0.00015423866,0.000490917,0.0007036636,0.68513405,0.013279679,0.21016626,0.0018508155,0.085513696],"study_design_scores_gemma":[0.00001954622,0.000100663165,0.00008953108,0.000018645515,0.000011071929,0.00006158999,0.000024050105,0.98007214,0.0013029659,0.017619152,0.00066740456,0.000013288521],"about_ca_topic_score_codex":0.001981005,"about_ca_topic_score_gemma":0.0013587271,"teacher_disagreement_score":0.003865908,"about_ca_system_score_codex":0.000756168,"about_ca_system_score_gemma":0.0018772734,"threshold_uncertainty_score":0.020445168},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03189975,0.00037484564,0.9600174,0.0005436907,0.00006968226,0.000052724637,0.000030218538,0.000024972807,0.006986742],"genre_scores_gemma":[0.751806,0.0012297673,0.23847428,0.0002359285,0.000202283,0.00023936175,0.00006247257,0.000037539405,0.0077123144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993709,0.00029245345,0.000030876115,0.00007386811,0.0001939462,0.00003801186],"domain_scores_gemma":[0.99896634,0.00054404425,0.00013405945,0.00008860687,0.00018762241,0.00007922476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019096114,0.0007139188,0.0006255506,0.00054699444,0.000566997,0.0011185484,0.0009612184,0.0009908378,0.002199862],"category_scores_gemma":[0.0045808777,0.00027983641,0.0007025801,0.00042747598,0.0017114931,0.0022836037,0.0022746993,0.001652218,0.0001792379],"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.00002335974,0.000033200726,0.0002910178,0.00011464943,0.00001989009,0.00012376135,0.00022619875,0.049327403,0.005606629,0.9323567,0.00026313588,0.011613982],"study_design_scores_gemma":[0.000009365374,0.0000993497,0.00018186176,0.000032610526,0.0000090670055,0.00008743791,0.0001171127,0.6152097,0.0019010372,0.37909037,0.0032489696,0.0000131526685],"about_ca_topic_score_codex":0.00088194263,"about_ca_topic_score_gemma":0.00082966156,"teacher_disagreement_score":0.002199862,"about_ca_system_score_codex":0.00072036526,"about_ca_system_score_gemma":0.0008116559,"threshold_uncertainty_score":0.010099113},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014827635,0.00027859726,0.9832637,0.00016499513,0.00004188992,0.00003881622,0.0000069856496,0.0001031825,0.0012741813],"genre_scores_gemma":[0.56988513,0.00067078177,0.42475563,0.0002399832,0.000117584765,0.000294132,0.00007841803,0.00022543258,0.0037328664],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998946,0.00041133037,0.000058474405,0.00014578764,0.00035372292,0.00008470733],"domain_scores_gemma":[0.99698776,0.001943392,0.00030990582,0.00024956095,0.0003398353,0.00016958262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002408481,0.0013112181,0.0013790065,0.0008891793,0.00066914316,0.0013277745,0.0014280492,0.0015235556,0.0015183771],"category_scores_gemma":[0.008567265,0.0006013202,0.001054472,0.00047844453,0.0023447436,0.0025420445,0.0030909802,0.0025088463,0.000287848],"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.00023144104,0.000086362124,0.0010406518,0.00032002403,0.00013240027,0.00026827975,0.00041475747,0.75657505,0.017252998,0.1690669,0.000793291,0.053817842],"study_design_scores_gemma":[0.000005045423,0.000031005507,0.000032405947,0.000009570268,0.0000046990363,0.000021556752,0.000010095462,0.98850536,0.0011831473,0.009842463,0.000348807,0.0000056985914],"about_ca_topic_score_codex":0.0012191016,"about_ca_topic_score_gemma":0.0007803069,"teacher_disagreement_score":0.002408481,"about_ca_system_score_codex":0.00077057764,"about_ca_system_score_gemma":0.0010764438,"threshold_uncertainty_score":0.012737393},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006814511,0.0002322041,0.99142575,0.00007438192,0.00004443979,0.00003246241,0.000007906078,0.00005668843,0.0013116506],"genre_scores_gemma":[0.32298994,0.00055958756,0.67070675,0.0001448095,0.00008696706,0.0003105877,0.0000889651,0.00009904416,0.0050133555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928635,0.0003293912,0.00003747516,0.00007156548,0.00022377644,0.000051414958],"domain_scores_gemma":[0.99948007,0.00025420488,0.000040155937,0.000037439408,0.00014671087,0.000041544296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016537595,0.00094593223,0.00097631133,0.0008622816,0.00044024625,0.0006523041,0.0010687236,0.0008717983,0.0015282109],"category_scores_gemma":[0.0024002928,0.0003906977,0.00086600124,0.0005415017,0.00090850657,0.0012463471,0.0012465667,0.0014075368,0.0003283779],"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.00024700238,0.000111744775,0.0013957506,0.0004294944,0.00017305407,0.000264355,0.00030850925,0.61835116,0.0151165025,0.20859769,0.0018999394,0.15310475],"study_design_scores_gemma":[0.000008813858,0.000047759004,0.00006854542,0.000010669754,0.000005316088,0.000023215889,0.000008237591,0.9914743,0.001249338,0.0058511007,0.0012454938,0.0000073123338],"about_ca_topic_score_codex":0.0025677984,"about_ca_topic_score_gemma":0.0022481957,"teacher_disagreement_score":0.0025677984,"about_ca_system_score_codex":0.0006266931,"about_ca_system_score_gemma":0.0011076867,"threshold_uncertainty_score":0.008746028},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020066884,0.00010565649,0.99675035,0.00004319076,0.000034949,0.000029016212,0.000009080313,0.00005753698,0.00096361694],"genre_scores_gemma":[0.095681675,0.0003247428,0.90012956,0.00010322022,0.000076804696,0.0003707228,0.00009563806,0.00012101387,0.0030966054],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957377,0.00012765953,0.000027174763,0.000067764435,0.00016216868,0.000041491807],"domain_scores_gemma":[0.9995467,0.00019334388,0.00004952438,0.000039576982,0.00013378293,0.000036983787],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090788695,0.0007590529,0.0009238793,0.00079938595,0.0005484808,0.000659785,0.0016320669,0.001184541,0.003523849],"category_scores_gemma":[0.001768144,0.000442686,0.0009433041,0.0006134254,0.00069631886,0.0015213622,0.0015899485,0.001694016,0.00076593255],"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.00024811237,0.00016909065,0.0018535032,0.00082652393,0.00015911722,0.00050902093,0.0005236007,0.5303769,0.02509005,0.14436732,0.0061753048,0.28970143],"study_design_scores_gemma":[0.000022593948,0.000047033052,0.00007395303,0.000018266835,0.000008951248,0.00008474536,0.000016209948,0.9899352,0.0012969484,0.0055980906,0.0028844217,0.000013575872],"about_ca_topic_score_codex":0.0015953371,"about_ca_topic_score_gemma":0.0016077352,"teacher_disagreement_score":0.003523849,"about_ca_system_score_codex":0.00029979122,"about_ca_system_score_gemma":0.0012142758,"threshold_uncertainty_score":0.011788487},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031732311,0.0005362015,0.9941555,0.00015737435,0.00005170434,0.000027585642,0.000016433258,0.000040537325,0.0018413884],"genre_scores_gemma":[0.21083578,0.0014168015,0.7793324,0.00019389337,0.00011345166,0.00042356952,0.00013852693,0.00018351522,0.0073620547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941814,0.0002524671,0.000027962553,0.00009670704,0.00016257218,0.000042080817],"domain_scores_gemma":[0.9991673,0.00046308033,0.000054205575,0.000055643748,0.00020609375,0.000053772048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018741846,0.00082080107,0.00094019156,0.00093223795,0.00043316733,0.0007265765,0.0011099334,0.0012748756,0.0026102704],"category_scores_gemma":[0.0034925598,0.00043503838,0.0006977345,0.0011071286,0.0015483453,0.0012976057,0.00159847,0.0020520594,0.0005468336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019394793,0.00009787864,0.0006778249,0.000649241,0.00010176585,0.00017284627,0.00022555284,0.51935893,0.010329346,0.3481896,0.0050379774,0.11496513],"study_design_scores_gemma":[0.000012277523,0.000036289504,0.00007527252,0.000015308126,0.0000061899386,0.00003652477,0.000013292827,0.97838914,0.0008031336,0.018684065,0.0019174981,0.000010958977],"about_ca_topic_score_codex":0.0027271332,"about_ca_topic_score_gemma":0.0018403347,"teacher_disagreement_score":0.0027271332,"about_ca_system_score_codex":0.0005363789,"about_ca_system_score_gemma":0.0014272832,"threshold_uncertainty_score":0.009911716},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00036798572,0.002454173,0.0020679487,0.0061817993,0.029979253,0.0006355613,0.035973452,0.0022023267,0.92013735],"genre_scores_gemma":[0.0010362793,0.00087735517,0.0006038923,0.0018310704,0.0029759621,0.00031158814,0.010291769,0.0006938155,0.9813782],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984297,0.00023753881,0.000116594834,0.00024751038,0.0007833531,0.00018518323],"domain_scores_gemma":[0.9956754,0.00069440587,0.00020065946,0.00043157206,0.0017406441,0.001257222],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0016268695,0.0015202,0.001815059,0.0040868334,0.0017108758,0.008578406,0.0021936556,0.003144997,0.88732505],"category_scores_gemma":[0.0077331634,0.0005108894,0.0010525851,0.0029901098,0.0006264753,0.0034997864,0.0030230342,0.0022400846,0.8427458],"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.00004707976,0.000029218943,0.000030983116,0.0002618416,0.000002342629,0.000012480951,0.000008444357,0.000040951418,0.000110387504,0.0019960022,0.9669995,0.030460916],"study_design_scores_gemma":[0.00002246267,0.000022514872,0.00016197897,0.00012285162,0.0000036191525,0.000019127778,0.000017220626,0.000054108998,0.00012514951,0.0018710952,0.9975745,0.000005308048],"about_ca_topic_score_codex":0.0011112954,"about_ca_topic_score_gemma":0.0022700066,"teacher_disagreement_score":0.11267495,"about_ca_system_score_codex":0.001393702,"about_ca_system_score_gemma":0.002983155,"threshold_uncertainty_score":0.16071707},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00087917567,0.03452664,0.008479719,0.058945857,0.44671142,0.00038841148,0.0059500686,0.0016763094,0.44244248],"genre_scores_gemma":[0.0057366546,0.023129314,0.0036470585,0.016777478,0.11483623,0.00031477577,0.00836031,0.0016647985,0.8255334],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982875,0.00019538602,0.00014840672,0.0003931065,0.0008118755,0.00016370964],"domain_scores_gemma":[0.9957261,0.00088187953,0.0002406117,0.00044941212,0.0019002185,0.00080172013],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017097612,0.0015723349,0.0015511282,0.0022165934,0.0018446082,0.0067113796,0.002136519,0.0028814548,0.46737993],"category_scores_gemma":[0.009438384,0.00045516551,0.0010880568,0.0019260296,0.000853053,0.004352132,0.002548224,0.0045167254,0.3132864],"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.000015413443,0.000013201796,0.00004924298,0.00014167087,0.000003865846,0.00002774875,0.000025174057,0.00009139705,0.000098809156,0.003531987,0.9625498,0.033451777],"study_design_scores_gemma":[0.0000035910232,0.000011524726,0.00012842013,0.00011932495,0.0000021913877,0.000047544192,0.000032695563,0.00005607805,0.000047561833,0.0024332518,0.9971125,0.0000053622457],"about_ca_topic_score_codex":0.0012637886,"about_ca_topic_score_gemma":0.0015095077,"teacher_disagreement_score":0.5326201,"about_ca_system_score_codex":0.001803223,"about_ca_system_score_gemma":0.0024055978,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037828928,0.00038951755,0.99453,0.00006352565,0.000050838305,0.000023436894,0.000006692107,0.00006579688,0.0010873815],"genre_scores_gemma":[0.21758923,0.0014344405,0.77596843,0.00015942848,0.0001501509,0.00023108585,0.00008876299,0.00014202071,0.004236381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943036,0.00022099755,0.000048204816,0.000052682542,0.00020741366,0.00004025267],"domain_scores_gemma":[0.9995695,0.00019223391,0.000059716043,0.000048839225,0.00009141998,0.000038309056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012807376,0.0010729537,0.0009350935,0.0005763889,0.00037067643,0.00062218634,0.0012353548,0.00089269254,0.0016656631],"category_scores_gemma":[0.002114705,0.00042259833,0.0008074697,0.0005482903,0.0008376936,0.0013073288,0.0013221488,0.0016028982,0.00039288282],"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.00020443086,0.00012750436,0.00071914005,0.0007521829,0.0001414298,0.00023347606,0.00046572913,0.48996645,0.026376804,0.2581603,0.0022623742,0.22059019],"study_design_scores_gemma":[0.000014405226,0.00006703222,0.00012082623,0.000016678703,0.000008371531,0.00003763112,0.000011470311,0.9870754,0.0020467464,0.008079702,0.00250964,0.0000121418625],"about_ca_topic_score_codex":0.0013308034,"about_ca_topic_score_gemma":0.0017901721,"teacher_disagreement_score":0.0016656631,"about_ca_system_score_codex":0.00044115615,"about_ca_system_score_gemma":0.0007614488,"threshold_uncertainty_score":0.006773293},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07140394,0.00079464685,0.9196471,0.00061657385,0.00011208461,0.00006292769,0.000054897344,0.000041864027,0.0072659575],"genre_scores_gemma":[0.86214733,0.0010998558,0.11994552,0.0001900286,0.00013974024,0.00029303387,0.00012126842,0.00006973848,0.015993511],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99877685,0.00048132383,0.00008470075,0.00022902858,0.0002953692,0.00013272082],"domain_scores_gemma":[0.99872965,0.00075992267,0.00016206403,0.000053910513,0.00019570738,0.0000987237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002549953,0.0010494926,0.0012573524,0.0010271632,0.0007346618,0.0027094202,0.001264511,0.0018900541,0.0033834616],"category_scores_gemma":[0.0039894106,0.00048443076,0.0011086261,0.00071812933,0.0019278252,0.0045358213,0.0027249244,0.0016911413,0.00035652664],"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.00006566813,0.00006656283,0.00041164213,0.00025887747,0.0000827232,0.00027694763,0.0002193788,0.08302358,0.0071612545,0.8975753,0.00049327785,0.010364836],"study_design_scores_gemma":[0.000024435922,0.00013999816,0.00025766194,0.000039174978,0.000027873026,0.00022247624,0.00022911365,0.6646721,0.0019031678,0.33030212,0.0021447712,0.00003721775],"about_ca_topic_score_codex":0.00059831736,"about_ca_topic_score_gemma":0.00046670547,"teacher_disagreement_score":0.0033834616,"about_ca_system_score_codex":0.0010036764,"about_ca_system_score_gemma":0.000751898,"threshold_uncertainty_score":0.013485551},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003209548,0.00010155975,0.9953134,0.00011488544,0.000023891935,0.0000376411,0.000013373714,0.00003988688,0.0011456951],"genre_scores_gemma":[0.111614436,0.00021056028,0.88371366,0.00008990229,0.000071259376,0.00045590234,0.00010517221,0.00015440762,0.0035847856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998417,0.0007830821,0.000081819046,0.00022846447,0.0003634545,0.00012612206],"domain_scores_gemma":[0.9927711,0.0058666654,0.0002959,0.00024991075,0.0005928651,0.00022355758],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051399963,0.0017475521,0.0020774563,0.0012570873,0.000891997,0.0020718717,0.0035033056,0.0035641922,0.005916412],"category_scores_gemma":[0.0140939085,0.0017932208,0.0021221128,0.0016111357,0.002261087,0.003793751,0.0059971428,0.0042677782,0.0008802514],"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.00028818555,0.00014238016,0.00045074493,0.0004478382,0.00016502941,0.00015484962,0.00033449274,0.75558007,0.0030949186,0.15576334,0.0021139695,0.08146417],"study_design_scores_gemma":[0.00002351975,0.00003048594,0.00003326992,0.000015779575,0.00001112867,0.000017497741,0.000022120417,0.9747533,0.00042028914,0.02412983,0.0005353803,0.0000074154277],"about_ca_topic_score_codex":0.00271391,"about_ca_topic_score_gemma":0.0029667881,"teacher_disagreement_score":0.005916412,"about_ca_system_score_codex":0.0014356928,"about_ca_system_score_gemma":0.0019958199,"threshold_uncertainty_score":0.027183175},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021734104,0.00072898535,0.968291,0.00046060575,0.00015963745,0.00009515513,0.000058474066,0.00009612632,0.008375848],"genre_scores_gemma":[0.49056864,0.002322904,0.48655662,0.0009308836,0.0005034313,0.0009979088,0.00026988838,0.00028426325,0.017565398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788886,0.00057366013,0.00013596377,0.00050143583,0.00076751655,0.00013259852],"domain_scores_gemma":[0.9968131,0.0017281199,0.00024599745,0.00018251225,0.0007814056,0.00024886875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055964068,0.0016884119,0.0014667552,0.002353898,0.0014988284,0.0015449343,0.0016926844,0.0014992659,0.0030654971],"category_scores_gemma":[0.008371201,0.00051940215,0.0027540005,0.0010701386,0.00455795,0.0052844463,0.004261653,0.0039981944,0.00053417275],"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.00010153085,0.00005475716,0.0007441482,0.00044831875,0.00013882968,0.000397199,0.00070582656,0.0147232,0.015901702,0.93397,0.0013233756,0.031491067],"study_design_scores_gemma":[0.000046535373,0.0005651533,0.0011077571,0.0001436016,0.000113477494,0.0012266573,0.0002945696,0.18955193,0.017278336,0.77563745,0.013942744,0.0000919066],"about_ca_topic_score_codex":0.0006231854,"about_ca_topic_score_gemma":0.00036386837,"teacher_disagreement_score":0.0055964068,"about_ca_system_score_codex":0.0010513789,"about_ca_system_score_gemma":0.001258173,"threshold_uncertainty_score":0.029597044},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018320994,0.0029253922,0.961016,0.000878466,0.00019922493,0.000038069837,0.00007138796,0.000058111553,0.016492333],"genre_scores_gemma":[0.6162533,0.0053727757,0.36193794,0.00066235586,0.00045204314,0.00022588819,0.0001992107,0.00019803969,0.0146984095],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992118,0.00029650616,0.00005589674,0.00014657681,0.00023759206,0.00005162962],"domain_scores_gemma":[0.99900347,0.00044908377,0.00012286614,0.00006112821,0.00026420722,0.00009915674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002210564,0.0009606869,0.0008043177,0.0013957875,0.0008403018,0.0015071349,0.0006147666,0.0009803833,0.001984349],"category_scores_gemma":[0.003321888,0.00030692734,0.0008618449,0.0014755138,0.0018492178,0.0029775172,0.0017834998,0.0021670659,0.00031799407],"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.000026816006,0.000022175072,0.00041280538,0.00012497025,0.00001795835,0.00008520533,0.00012883042,0.019875212,0.0033735968,0.94878995,0.0010450098,0.02609749],"study_design_scores_gemma":[0.000018661416,0.00021240188,0.00093223306,0.00010159567,0.000045571836,0.0003719456,0.00020057365,0.3416458,0.004876518,0.62552685,0.025994135,0.0000737654],"about_ca_topic_score_codex":0.0009525865,"about_ca_topic_score_gemma":0.0006281961,"teacher_disagreement_score":0.002210564,"about_ca_system_score_codex":0.0014666317,"about_ca_system_score_gemma":0.00073180493,"threshold_uncertainty_score":0.011690676},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41636014,0.002571728,0.532751,0.00088409224,0.00015219113,0.00007980867,0.00037889494,0.00017280086,0.046649422],"genre_scores_gemma":[0.9092912,0.0009444474,0.083138525,0.0002199403,0.00013926867,0.00014143054,0.00021752059,0.00006874937,0.0058388417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990115,0.00022317769,0.00006405365,0.00023109523,0.00030395176,0.00016623431],"domain_scores_gemma":[0.9975364,0.0013067544,0.00036002175,0.00019057922,0.0002929817,0.00031317872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017825223,0.0007234418,0.00068209646,0.0021427947,0.0017095096,0.0017735132,0.0008293679,0.0013087784,0.0035272427],"category_scores_gemma":[0.0040439405,0.0003517086,0.0009212032,0.00093875796,0.0033777345,0.003817338,0.002631395,0.0017022792,0.00033419032],"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.000038266302,0.000015773263,0.00045791845,0.00007123334,0.00000957248,0.0001783986,0.00021900733,0.002312833,0.0062629026,0.9852738,0.0002976841,0.0048627094],"study_design_scores_gemma":[0.000018682791,0.0001271152,0.0011512522,0.00007375451,0.000020106754,0.0008719,0.0004163523,0.032614626,0.006713184,0.95189834,0.0060513807,0.00004333857],"about_ca_topic_score_codex":0.00043276884,"about_ca_topic_score_gemma":0.00033729832,"teacher_disagreement_score":0.0035272427,"about_ca_system_score_codex":0.0010460339,"about_ca_system_score_gemma":0.00039031537,"threshold_uncertainty_score":0.011799812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023546834,0.00006516302,0.99670404,0.00003187918,0.00002590553,0.000026555952,0.000006635785,0.000050253147,0.00073489005],"genre_scores_gemma":[0.10117631,0.00021937987,0.8938502,0.000066721026,0.00006011507,0.00037234076,0.000097988195,0.00009297221,0.004063935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99905103,0.0002851943,0.000052709227,0.0001411397,0.00038895273,0.000080899124],"domain_scores_gemma":[0.9988463,0.0005089307,0.00008369614,0.00009553898,0.00039474963,0.000070735776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017473924,0.00094624364,0.0011173689,0.0010497691,0.000561649,0.00087214774,0.0019393786,0.0016906528,0.0034618373],"category_scores_gemma":[0.003997889,0.0005138088,0.0010994031,0.0007957341,0.0011056403,0.0019269355,0.0019922983,0.0021473283,0.00072629337],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021544819,0.00012000993,0.00095107715,0.00040192445,0.00015639518,0.00029860117,0.0003978079,0.50048923,0.024391998,0.21695817,0.003388406,0.252231],"study_design_scores_gemma":[0.00002109872,0.000076616736,0.000056157864,0.000014964129,0.000009672465,0.00010456569,0.000015818012,0.9802199,0.0020438966,0.014816241,0.0026074012,0.000013607114],"about_ca_topic_score_codex":0.0013551377,"about_ca_topic_score_gemma":0.0012029891,"teacher_disagreement_score":0.0034618373,"about_ca_system_score_codex":0.0006858727,"about_ca_system_score_gemma":0.0014029571,"threshold_uncertainty_score":0.011581004},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039459234,0.00024422118,0.9949167,0.00005473442,0.000028479564,0.000026202148,0.000006908743,0.000039331906,0.0007375433],"genre_scores_gemma":[0.2562065,0.0007316021,0.73799986,0.00013861957,0.00007696028,0.0002793167,0.00007016649,0.00009283288,0.004404134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995022,0.00023540875,0.000028391963,0.00005170164,0.00015387563,0.000028469618],"domain_scores_gemma":[0.99968743,0.00013289657,0.00003516817,0.000030313737,0.00008163459,0.000032592838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014356257,0.00092431286,0.00090709835,0.00056710455,0.00034647668,0.00053121644,0.0009888154,0.00087934104,0.0012451658],"category_scores_gemma":[0.0014256027,0.00033815025,0.00085993484,0.00037445885,0.0008075009,0.0013090563,0.0013130477,0.0014802628,0.00029645837],"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.0001533646,0.00011155682,0.0010616262,0.000591229,0.00021125286,0.0002445632,0.0003516619,0.47566682,0.02867888,0.35119745,0.0016871636,0.14004433],"study_design_scores_gemma":[0.0000114021,0.0000779943,0.00008325159,0.000015109823,0.000009992071,0.000041917494,0.000013154136,0.98042357,0.0019249646,0.0153956115,0.0019929607,0.000010105478],"about_ca_topic_score_codex":0.0013981927,"about_ca_topic_score_gemma":0.0012720022,"teacher_disagreement_score":0.0014356257,"about_ca_system_score_codex":0.00047565182,"about_ca_system_score_gemma":0.00092980516,"threshold_uncertainty_score":0.00759238},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22689518,0.00083739025,0.7651423,0.0004148932,0.00008715527,0.00009337564,0.000037828115,0.000077335855,0.0064144805],"genre_scores_gemma":[0.8495015,0.0006460102,0.13662565,0.0000716697,0.000053356333,0.00023216533,0.00006593788,0.00005704832,0.012746682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888045,0.00049807684,0.000050851104,0.000162358,0.0003194125,0.00008888885],"domain_scores_gemma":[0.9980963,0.0011180604,0.00027458783,0.00009367522,0.00025581126,0.00016159605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003316805,0.00085445715,0.0008141117,0.001044773,0.0007689482,0.0016043306,0.0012446987,0.0012995135,0.0016059796],"category_scores_gemma":[0.0054694507,0.00046105793,0.0011652263,0.00043235277,0.0025756694,0.0019975929,0.0020153527,0.0016524681,0.00027946875],"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.00016084459,0.000056853878,0.0012363595,0.00019691404,0.000079204125,0.0003621201,0.0014252719,0.09586895,0.01787451,0.87381595,0.00029931118,0.008623714],"study_design_scores_gemma":[0.000033466396,0.00021631167,0.00037027025,0.000044503267,0.000016374837,0.00015746123,0.00020215567,0.81529963,0.0036494785,0.17848526,0.0014888288,0.00003635065],"about_ca_topic_score_codex":0.0017590835,"about_ca_topic_score_gemma":0.0010264609,"teacher_disagreement_score":0.003316805,"about_ca_system_score_codex":0.0017796414,"about_ca_system_score_gemma":0.0011327757,"threshold_uncertainty_score":0.01754117},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017213525,0.0003329492,0.98086035,0.00027739682,0.000077485936,0.000030703486,0.000013949777,0.00009634024,0.0010973632],"genre_scores_gemma":[0.599492,0.0008576943,0.39556178,0.00034099806,0.00010831673,0.0002019476,0.000082296916,0.00018813804,0.0031667377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892753,0.0005844164,0.00005114415,0.000101681246,0.00027874016,0.00005649028],"domain_scores_gemma":[0.9959401,0.0029297017,0.0002812621,0.00023231945,0.0005047608,0.00011180985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029688312,0.000951416,0.0010859956,0.00036034055,0.00046801593,0.0010461609,0.0012291202,0.0013594326,0.0012547133],"category_scores_gemma":[0.010472851,0.00048523417,0.0005981925,0.0003365082,0.0016707105,0.0015417697,0.0012822743,0.0016854159,0.00017492405],"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.00021190365,0.000052815147,0.0007099254,0.00023592218,0.000051117993,0.00019754928,0.00014174887,0.9202057,0.005972955,0.048210844,0.0010387741,0.022970753],"study_design_scores_gemma":[0.0000034119453,0.000019717309,0.00003313302,0.00000405506,0.0000029358355,0.000007860975,0.0000029431806,0.9983071,0.00043227454,0.0010168988,0.00016712245,0.000002472146],"about_ca_topic_score_codex":0.003223074,"about_ca_topic_score_gemma":0.002080337,"teacher_disagreement_score":0.003223074,"about_ca_system_score_codex":0.00065765146,"about_ca_system_score_gemma":0.0011444674,"threshold_uncertainty_score":0.015700877},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031151244,0.0011855729,0.93645304,0.0016309491,0.000116229996,0.000118012846,0.0002554609,0.00009592098,0.028993592],"genre_scores_gemma":[0.8329322,0.0023768193,0.1363713,0.00048907095,0.00025799868,0.0006184046,0.0005414239,0.00023940961,0.026173547],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852175,0.000488006,0.00010829261,0.0002658872,0.0003976288,0.00021844706],"domain_scores_gemma":[0.99567187,0.0029868444,0.00035485232,0.00014533599,0.00067697535,0.00016410575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040523186,0.0015890964,0.0015042401,0.0017402944,0.0010388037,0.0025351248,0.0013905705,0.0021667867,0.006247852],"category_scores_gemma":[0.009714126,0.00077542017,0.0018009252,0.0009283464,0.0028442456,0.0037691076,0.002286924,0.0038682593,0.00064401235],"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.00003749997,0.00003705898,0.00030038494,0.00020054732,0.000029047207,0.00014622223,0.0001725609,0.07874179,0.00392335,0.9098623,0.0015407198,0.005008503],"study_design_scores_gemma":[0.000029264353,0.00008354013,0.0006213082,0.00010734614,0.000027089298,0.00011738497,0.00015283276,0.62266165,0.0041634627,0.36669114,0.0052957432,0.00004918007],"about_ca_topic_score_codex":0.0031229476,"about_ca_topic_score_gemma":0.00310335,"teacher_disagreement_score":0.006247852,"about_ca_system_score_codex":0.0025471176,"about_ca_system_score_gemma":0.00326762,"threshold_uncertainty_score":0.021431029},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041331675,0.0017098392,0.9294149,0.0013044487,0.000130048,0.00012697911,0.00025077022,0.00008522415,0.025646202],"genre_scores_gemma":[0.7098145,0.002120853,0.27722317,0.00050292665,0.00024287726,0.00082626473,0.0003709813,0.00013033055,0.008768119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980046,0.00093491917,0.00012334925,0.00024540338,0.00047154128,0.0002202477],"domain_scores_gemma":[0.9962973,0.0026011686,0.00034765466,0.00014512165,0.00046274712,0.00014601748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048057004,0.0013810601,0.0017066451,0.0018067608,0.000973247,0.0029888647,0.0011615814,0.0018523072,0.0043743756],"category_scores_gemma":[0.013579678,0.0007937722,0.0015770707,0.0014884348,0.0027474498,0.004841252,0.0025395537,0.004266688,0.0005701812],"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.000056841047,0.000041240928,0.00032144165,0.00019846816,0.000047779944,0.00011526114,0.0001251106,0.068368524,0.002012559,0.9190087,0.0010451234,0.008659128],"study_design_scores_gemma":[0.00003443308,0.00008042349,0.00033839216,0.00009565474,0.000023266435,0.000114840426,0.00010084336,0.3321081,0.0019202116,0.66267407,0.0024729583,0.000036767324],"about_ca_topic_score_codex":0.0010056386,"about_ca_topic_score_gemma":0.00087986153,"teacher_disagreement_score":0.0048057004,"about_ca_system_score_codex":0.0016373744,"about_ca_system_score_gemma":0.0020011447,"threshold_uncertainty_score":0.025415242},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0067325686,0.000050414867,0.99182457,0.000049999784,0.000010232082,0.00003542589,0.000006544068,0.000043248187,0.0012470061],"genre_scores_gemma":[0.29181892,0.00010544854,0.7031936,0.00007640981,0.000027106542,0.00042532012,0.000058413323,0.00005998813,0.0042347936],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994741,0.00016198141,0.000028299311,0.00012397581,0.00015761961,0.00005391423],"domain_scores_gemma":[0.99934727,0.0003672394,0.000060648268,0.00004341568,0.0001283766,0.000053001884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016881765,0.0007364005,0.0008238146,0.00076810876,0.00065035245,0.00077221874,0.00153774,0.0015938241,0.0035483188],"category_scores_gemma":[0.0023124735,0.00042010102,0.0008869096,0.00050668715,0.0011696322,0.0012890999,0.002062662,0.0010508753,0.00042597635],"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.000101547106,0.00008084876,0.0010899907,0.00019186176,0.000109227214,0.0002029876,0.00033479417,0.7394985,0.007983609,0.17610013,0.0010455062,0.073261015],"study_design_scores_gemma":[0.0000139584645,0.000042419684,0.000059750986,0.000008749816,0.00000957313,0.000031979318,0.000024215531,0.98770034,0.0006584913,0.010628084,0.0008146887,0.000007789331],"about_ca_topic_score_codex":0.0024206801,"about_ca_topic_score_gemma":0.0025844872,"teacher_disagreement_score":0.0035483188,"about_ca_system_score_codex":0.0008500747,"about_ca_system_score_gemma":0.0012147676,"threshold_uncertainty_score":0.011870325},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006753556,0.00016281262,0.9920887,0.00007922868,0.000032408116,0.000035697853,0.000008539521,0.000037549857,0.00080154923],"genre_scores_gemma":[0.2205879,0.0009177228,0.7724812,0.000116116295,0.00015844977,0.00049201306,0.00014062619,0.00013372018,0.004972313],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945277,0.00023392412,0.000032078045,0.00011460168,0.0001399023,0.000026827553],"domain_scores_gemma":[0.9989976,0.0006576892,0.000053040567,0.000056235152,0.00017432231,0.00006106609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016098592,0.0009811424,0.0012300613,0.0005586777,0.000484262,0.0007018516,0.00077107386,0.0009934532,0.0020488736],"category_scores_gemma":[0.0037376548,0.00047613718,0.0008479717,0.00048547244,0.0011622078,0.00178974,0.0015678492,0.0018258318,0.0003265217],"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.0002079992,0.00013769708,0.0010857573,0.0005561919,0.000115356415,0.00031466753,0.0005251616,0.48584318,0.0279599,0.24166386,0.00263795,0.23895223],"study_design_scores_gemma":[0.000017302644,0.00013209909,0.00010786497,0.00001940878,0.000012363614,0.00007873483,0.00002933678,0.96460044,0.0018443221,0.030536383,0.0026085223,0.000013192389],"about_ca_topic_score_codex":0.0010355988,"about_ca_topic_score_gemma":0.00057852,"teacher_disagreement_score":0.0020488736,"about_ca_system_score_codex":0.00039347206,"about_ca_system_score_gemma":0.0009356447,"threshold_uncertainty_score":0.008513868},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.108649835,0.0001752797,0.88841593,0.000105395986,0.000012199959,0.00005687498,0.00010561805,0.00029189957,0.0021870143],"genre_scores_gemma":[0.40972525,0.00016274402,0.5874138,0.000049520317,0.000016054035,0.00015234694,0.00036061122,0.0001993799,0.0019202871],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99953854,0.00015162215,0.000026850563,0.000082125276,0.00013002081,0.00007096269],"domain_scores_gemma":[0.99888724,0.000742262,0.000101739904,0.00010101027,0.00010241228,0.000065457025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013106051,0.00070558203,0.00087580224,0.0010223853,0.00045888775,0.001412136,0.0009564757,0.0005200858,0.002806345],"category_scores_gemma":[0.0041138465,0.00046640506,0.00081187254,0.000657627,0.0013496702,0.0016914215,0.001153848,0.0012841773,0.00040070104],"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.0005132985,0.00016549998,0.0056147184,0.00033335923,0.000091543625,0.00015834284,0.0006274615,0.49098855,0.015197535,0.3303076,0.0015732547,0.1544289],"study_design_scores_gemma":[0.000018108485,0.000100367586,0.0008169124,0.00004486931,0.000009678236,0.000040229566,0.000080654085,0.81850725,0.005035415,0.17456758,0.0007656713,0.000013278734],"about_ca_topic_score_codex":0.0023308296,"about_ca_topic_score_gemma":0.0037607572,"teacher_disagreement_score":0.002806345,"about_ca_system_score_codex":0.0010931013,"about_ca_system_score_gemma":0.0011647802,"threshold_uncertainty_score":0.009388149},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003554304,0.000067534915,0.9956137,0.000045875655,0.000017250308,0.00002734044,0.000006419559,0.000041879477,0.0006256249],"genre_scores_gemma":[0.282523,0.000340031,0.7116775,0.00012037127,0.000060122846,0.00033895884,0.00007328762,0.000083618266,0.0047831233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995726,0.00014120327,0.000022781534,0.00007652856,0.0001439527,0.00004292912],"domain_scores_gemma":[0.9997129,0.00011876887,0.000023575261,0.000018570374,0.00008299401,0.00004320262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001184461,0.0010438265,0.001329232,0.0005160162,0.000504223,0.00078987196,0.0011504227,0.0012852044,0.0025415488],"category_scores_gemma":[0.0012177449,0.0004829938,0.0008147392,0.00044386912,0.00085114175,0.0013708241,0.0018155167,0.0016353646,0.000500588],"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.00018000031,0.00015652961,0.0007443727,0.00048054632,0.00012667634,0.00024181046,0.00025077804,0.7128476,0.018174905,0.13710341,0.0018736242,0.12781975],"study_design_scores_gemma":[0.000014480472,0.000057033954,0.00003834772,0.000006877105,0.0000059547724,0.00002519574,0.000011730435,0.9912043,0.0009032877,0.0070527853,0.0006728171,0.0000072079006],"about_ca_topic_score_codex":0.0017643791,"about_ca_topic_score_gemma":0.0015716231,"teacher_disagreement_score":0.0025415488,"about_ca_system_score_codex":0.0004839741,"about_ca_system_score_gemma":0.0014058161,"threshold_uncertainty_score":0.008502305},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004987088,0.00021687362,0.99307066,0.000100126395,0.000054864846,0.000042223324,0.00001964322,0.000101112746,0.0014072831],"genre_scores_gemma":[0.26085022,0.0005708823,0.7309748,0.00021727885,0.00015095517,0.00046197342,0.00027375654,0.00023188337,0.006268188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951327,0.00015669188,0.000036348476,0.00008650106,0.00014942537,0.000057746507],"domain_scores_gemma":[0.9994061,0.0002560522,0.00006561425,0.000055975688,0.00014968589,0.00006661416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010338613,0.001379138,0.0014062056,0.00077659264,0.00048692725,0.0010145163,0.0018616102,0.0013455445,0.003949044],"category_scores_gemma":[0.0031547367,0.0005717057,0.0007688697,0.0006765472,0.0008255057,0.0022083467,0.0017541568,0.0021979515,0.0007169682],"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.00050353806,0.00024952166,0.0007456882,0.00051752804,0.00012926632,0.00023772086,0.00030309366,0.54988986,0.008780605,0.17509069,0.0059184525,0.2576341],"study_design_scores_gemma":[0.000030415922,0.00008469794,0.00007135247,0.000011915863,0.0000062274007,0.000031501546,0.000013622068,0.9896209,0.00077832275,0.00806089,0.0012791672,0.000010921261],"about_ca_topic_score_codex":0.002117756,"about_ca_topic_score_gemma":0.0025540628,"teacher_disagreement_score":0.003949044,"about_ca_system_score_codex":0.0006636613,"about_ca_system_score_gemma":0.0012200222,"threshold_uncertainty_score":0.013210893},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016630002,0.00009241679,0.9973941,0.00002869009,0.00001873651,0.000020426362,0.0000054365178,0.000048805676,0.0007283195],"genre_scores_gemma":[0.07099553,0.0003148166,0.9262667,0.00005152795,0.00004330403,0.00023217552,0.000043858337,0.000056446523,0.0019956802],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928373,0.00028147688,0.000046159912,0.00008242899,0.00026571786,0.0000405772],"domain_scores_gemma":[0.9992329,0.0004277355,0.00004396173,0.000048362606,0.00021530385,0.000031771342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013029961,0.00085687946,0.00083246967,0.00066150987,0.00045762115,0.00057109114,0.0012338032,0.0010703492,0.0015313982],"category_scores_gemma":[0.002952067,0.0003714143,0.00092897326,0.0006349246,0.00082208315,0.0010853373,0.0012456041,0.0014288547,0.00041804882],"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.00012282407,0.00013673898,0.0008616469,0.0004796473,0.0002075278,0.00025502875,0.0004166354,0.45040724,0.019398995,0.25974706,0.0027906126,0.26517603],"study_design_scores_gemma":[0.00002248721,0.000101982456,0.000119006916,0.000024921426,0.000020360809,0.00013229127,0.000020271993,0.9614636,0.0028892632,0.030608838,0.0045756483,0.000021358896],"about_ca_topic_score_codex":0.0016793294,"about_ca_topic_score_gemma":0.0016760095,"teacher_disagreement_score":0.0016793294,"about_ca_system_score_codex":0.0004748414,"about_ca_system_score_gemma":0.0014119672,"threshold_uncertainty_score":0.006891012},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012480837,0.00015502145,0.9800795,0.00017269763,0.00003764238,0.0000652194,0.00009103721,0.000059234862,0.0068588494],"genre_scores_gemma":[0.67242754,0.00080112345,0.31369895,0.00026345334,0.00009078319,0.0008405964,0.00052548776,0.00021516076,0.0111369165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887615,0.0004426282,0.00006845254,0.00019530558,0.0003155111,0.00010182274],"domain_scores_gemma":[0.9974184,0.0016634787,0.0002358952,0.00009623872,0.00046828613,0.00011768834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028763823,0.0016424279,0.0011471339,0.0008366793,0.0004961854,0.0016237035,0.0009847155,0.0012879678,0.003933574],"category_scores_gemma":[0.0068400027,0.0005068134,0.0008348054,0.00062056485,0.0017477634,0.001983471,0.0014810708,0.0025200406,0.0005680291],"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.00008006693,0.00011773185,0.0003866107,0.00033830834,0.00004851287,0.0003024093,0.00022413423,0.37495577,0.008855332,0.5908768,0.0027172512,0.02109703],"study_design_scores_gemma":[0.000017087586,0.000075722404,0.00015724814,0.000035409168,0.000011155768,0.00008424178,0.00005472399,0.8625516,0.0024196461,0.13306615,0.0015057094,0.000021258116],"about_ca_topic_score_codex":0.0008547772,"about_ca_topic_score_gemma":0.0009071485,"teacher_disagreement_score":0.003933574,"about_ca_system_score_codex":0.0008326295,"about_ca_system_score_gemma":0.0016230528,"threshold_uncertainty_score":0.01521194},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003311846,0.02066229,0.001006799,0.037490357,0.9154418,0.000067593195,0.00046583026,0.00023855013,0.02429565],"genre_scores_gemma":[0.0028757409,0.018289827,0.00053900346,0.014625026,0.79997355,0.0000899122,0.0006706203,0.00037813574,0.16255815],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983852,0.00022116303,0.00012675433,0.00047943322,0.00061937625,0.00016808083],"domain_scores_gemma":[0.99451953,0.0013136667,0.0004267679,0.00030537852,0.0017499485,0.0016846689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014845611,0.0019392071,0.002048093,0.0022214793,0.001785739,0.005273529,0.0015591432,0.004093933,0.14471048],"category_scores_gemma":[0.0065798,0.00052603165,0.0010112552,0.000989683,0.0009769873,0.0034838116,0.0026333602,0.004387708,0.10624312],"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.000030446621,0.000015778727,0.000055652257,0.00017010745,0.000006498157,0.00006077446,0.000015910126,0.000039580955,0.00024835608,0.0010609868,0.9807226,0.017573318],"study_design_scores_gemma":[0.000008192734,0.000021930162,0.00019170313,0.00010764632,0.0000069379876,0.00020955534,0.000018171555,0.000070707894,0.00013266307,0.001003012,0.9982223,0.0000071570007],"about_ca_topic_score_codex":0.00055331,"about_ca_topic_score_gemma":0.0007891843,"teacher_disagreement_score":0.14471048,"about_ca_system_score_codex":0.0016500454,"about_ca_system_score_gemma":0.0018779883,"threshold_uncertainty_score":0.4841048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048764586,0.00008054426,0.99398875,0.000057535544,0.000015276955,0.000028370549,0.0000075860157,0.000043285305,0.0009021483],"genre_scores_gemma":[0.21181613,0.0005185309,0.78205806,0.00011091311,0.00008899523,0.00043751256,0.00014030092,0.00016177718,0.00466776],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913883,0.0003591845,0.00004130462,0.00016620684,0.00023964478,0.000054765565],"domain_scores_gemma":[0.9983335,0.0010049038,0.00010376243,0.00010625459,0.00034464922,0.00010689104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002206006,0.0009704715,0.0012600392,0.0007751354,0.0005732573,0.0008841235,0.0010196422,0.0011147356,0.0028518087],"category_scores_gemma":[0.0065347753,0.0004900115,0.00083802413,0.0006491814,0.0018216121,0.0020554967,0.002266852,0.00250173,0.00059866393],"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.00023403935,0.000114101545,0.00080264854,0.00043347856,0.00008738755,0.00030031925,0.0005513611,0.44394496,0.016899904,0.35517663,0.0023807923,0.17907439],"study_design_scores_gemma":[0.000024809353,0.00014248029,0.00009780889,0.000026806356,0.000011652865,0.00010879024,0.00004255991,0.92566085,0.0024400286,0.06908432,0.0023408665,0.00001914082],"about_ca_topic_score_codex":0.0009153089,"about_ca_topic_score_gemma":0.0005720799,"teacher_disagreement_score":0.0028518087,"about_ca_system_score_codex":0.00051127153,"about_ca_system_score_gemma":0.0013373782,"threshold_uncertainty_score":0.011666656},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036788299,0.0002586443,0.99380964,0.00015897091,0.00006166573,0.000021372858,0.000026946058,0.0000366154,0.0019472853],"genre_scores_gemma":[0.435015,0.0014042143,0.54545116,0.00029821854,0.0004306953,0.00043076862,0.00031310078,0.00039123077,0.016265646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984615,0.0008002871,0.000072991184,0.00023221075,0.00033767364,0.000095366195],"domain_scores_gemma":[0.9957688,0.0030185324,0.0003512854,0.00019223672,0.00048204348,0.0001871498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004371197,0.0019094078,0.0018149363,0.0012221914,0.00069036183,0.0025750005,0.0018331305,0.0021470657,0.002434051],"category_scores_gemma":[0.008898498,0.0007878326,0.0012434964,0.0009127246,0.0026356883,0.0027549095,0.004507894,0.003131226,0.00029704033],"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.00015656516,0.00010250448,0.00024985493,0.00038215975,0.00010550989,0.000070002185,0.00014999468,0.50804514,0.005288259,0.4573287,0.0013036942,0.026817631],"study_design_scores_gemma":[0.000008332269,0.000029163353,0.00004153068,0.00001954368,0.000008830821,0.00000779228,0.000008004159,0.95873904,0.00039724656,0.040187,0.00054489804,0.000008606714],"about_ca_topic_score_codex":0.0051356675,"about_ca_topic_score_gemma":0.0037347102,"teacher_disagreement_score":0.0051356675,"about_ca_system_score_codex":0.0013727243,"about_ca_system_score_gemma":0.0021834986,"threshold_uncertainty_score":0.023117363},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013926097,0.00034262636,0.9974807,0.00004372581,0.00006244205,0.000034633136,0.000009106425,0.000059807604,0.00057431817],"genre_scores_gemma":[0.04758914,0.0013819054,0.9473121,0.00009052841,0.00016106683,0.00037923965,0.000093388015,0.00010776515,0.0028848555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988319,0.00033241473,0.00011253979,0.00021541807,0.000437514,0.0000702394],"domain_scores_gemma":[0.9988815,0.00052572956,0.0000965546,0.000094644005,0.00034726338,0.000054358028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023466628,0.0016454448,0.0014238899,0.0013064862,0.0006610117,0.0012291933,0.0019904284,0.0018600632,0.002321461],"category_scores_gemma":[0.0056793005,0.00079177856,0.00156762,0.0010881547,0.0012001032,0.00291963,0.0019118265,0.0029053574,0.0006729926],"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.00012977488,0.00013538085,0.0011198957,0.0012668454,0.00024645883,0.00037134223,0.00063453574,0.37070313,0.017955314,0.28296492,0.0037328503,0.32073957],"study_design_scores_gemma":[0.00004519499,0.00009800895,0.00015612946,0.00006431122,0.00003979477,0.0002961068,0.000040282757,0.9430304,0.0051382584,0.041722868,0.009320165,0.000048566653],"about_ca_topic_score_codex":0.00088475255,"about_ca_topic_score_gemma":0.00084406795,"teacher_disagreement_score":0.0023466628,"about_ca_system_score_codex":0.0005349044,"about_ca_system_score_gemma":0.0013245259,"threshold_uncertainty_score":0.0124105215},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16851607,0.0010653688,0.8154108,0.00044038575,0.000081891594,0.00005885074,0.00012438343,0.000099455974,0.014202799],"genre_scores_gemma":[0.9223695,0.0013499659,0.06940441,0.00013940078,0.00019758182,0.00007282214,0.00015582248,0.00011821102,0.006192241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994123,0.00024894672,0.000030581905,0.00009666056,0.00014985792,0.00006160571],"domain_scores_gemma":[0.9985262,0.0005544492,0.00027358712,0.00012659152,0.000379644,0.00013959677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018062262,0.0010246168,0.00047782745,0.0013375742,0.00050176674,0.001688736,0.0005480058,0.00037667,0.0012537732],"category_scores_gemma":[0.002892256,0.00020182574,0.00040945562,0.0008205962,0.0031844538,0.0042589265,0.0010953445,0.0012689546,0.00026831956],"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.000064157735,0.000022743756,0.0012554124,0.00010760334,0.000014148718,0.00017141327,0.00030435683,0.03275395,0.009253982,0.9375617,0.000512969,0.017977595],"study_design_scores_gemma":[0.000012446158,0.00021571861,0.002097454,0.000064885964,0.000016823133,0.0004026831,0.0004162533,0.37890872,0.008092543,0.6014195,0.008285614,0.00006734325],"about_ca_topic_score_codex":0.0007948751,"about_ca_topic_score_gemma":0.0005389225,"teacher_disagreement_score":0.0018062262,"about_ca_system_score_codex":0.00083492405,"about_ca_system_score_gemma":0.00048075643,"threshold_uncertainty_score":0.00955236},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012087072,0.00008623844,0.9853147,0.0001317702,0.00004561863,0.000038843402,0.000012153772,0.00006565037,0.0022179529],"genre_scores_gemma":[0.34705022,0.00025665667,0.64596635,0.00019181649,0.00012835061,0.0003648768,0.000119363314,0.00013395943,0.0057884217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995332,0.00014903142,0.000029501312,0.00005588172,0.00018123834,0.00005118609],"domain_scores_gemma":[0.99939954,0.000292699,0.00004582208,0.000044124823,0.00013593177,0.00008183632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017235604,0.00069927785,0.0007633072,0.0004613351,0.0004841501,0.0006937674,0.0012003822,0.0011311328,0.0022296517],"category_scores_gemma":[0.0022792968,0.0003129334,0.0007083832,0.0002944087,0.0011085353,0.0011013316,0.002198285,0.001624954,0.0003610947],"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.00032792886,0.00022243861,0.0010184789,0.00037747456,0.00009609499,0.00028439483,0.0004344805,0.5385971,0.03627777,0.28939885,0.0030570326,0.12990795],"study_design_scores_gemma":[0.000017309138,0.00007640151,0.000074214135,0.000010742192,0.000004665196,0.000031135718,0.000012438518,0.9826481,0.0015557241,0.014581215,0.0009805982,0.000007488545],"about_ca_topic_score_codex":0.0014028697,"about_ca_topic_score_gemma":0.0011191379,"teacher_disagreement_score":0.0022296517,"about_ca_system_score_codex":0.000489188,"about_ca_system_score_gemma":0.0012338196,"threshold_uncertainty_score":0.0091151595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21892355,0.0021598914,0.7374775,0.0028653424,0.00016449734,0.00008837338,0.00021800402,0.00009722574,0.03800556],"genre_scores_gemma":[0.9542252,0.0012926132,0.025371324,0.00017999641,0.00017034633,0.00017475408,0.0002135599,0.00005568833,0.0183164],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991078,0.00033454888,0.000035577494,0.00014951624,0.0002758064,0.000096629075],"domain_scores_gemma":[0.99827635,0.0009983794,0.00020247285,0.000072480485,0.00035957567,0.00009069441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013198942,0.0007302552,0.0007163713,0.0007874434,0.0005082512,0.0015482103,0.0005262932,0.0005706814,0.0037480674],"category_scores_gemma":[0.004675077,0.00029396164,0.00064691005,0.0005805643,0.0014817528,0.001425186,0.002317975,0.0014784836,0.00020751197],"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.000080228034,0.00004445291,0.0011474132,0.00016485478,0.000051373518,0.0003424439,0.00043613344,0.18995968,0.0068671517,0.7730924,0.0024384405,0.025375508],"study_design_scores_gemma":[0.000012977507,0.0000287626,0.0005373741,0.00002461308,0.000008642328,0.00006603961,0.00009677348,0.7581769,0.0014508596,0.23714548,0.002438677,0.000012904101],"about_ca_topic_score_codex":0.0026096127,"about_ca_topic_score_gemma":0.001145281,"teacher_disagreement_score":0.0037480674,"about_ca_system_score_codex":0.0015217548,"about_ca_system_score_gemma":0.000896967,"threshold_uncertainty_score":0.012538493},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033711605,0.0012778068,0.9257675,0.0012351288,0.00013714939,0.00008759673,0.00023667593,0.000096377735,0.037450105],"genre_scores_gemma":[0.730638,0.0033827135,0.24507971,0.00045932565,0.00036862984,0.000729135,0.0005348587,0.00024731757,0.018560303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984479,0.00070412795,0.00009078182,0.00020599703,0.0003291462,0.0002220502],"domain_scores_gemma":[0.9955076,0.0031479532,0.00039498243,0.000172721,0.0005157018,0.00026103554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037771482,0.0014090448,0.0014338121,0.0017900041,0.0010542776,0.003118656,0.0013385001,0.0014304775,0.0053557185],"category_scores_gemma":[0.0108628925,0.0007309316,0.0012422298,0.0016904998,0.004271555,0.0053756065,0.0029609376,0.005318069,0.00077802374],"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.000021604696,0.000028181543,0.00009671497,0.000091406306,0.000011586426,0.00006646413,0.00006775634,0.026731817,0.0007742368,0.96593314,0.0008806372,0.0052964557],"study_design_scores_gemma":[0.000016302485,0.00003355472,0.0001244655,0.00005144318,0.000008499064,0.000073086994,0.00007025135,0.16674802,0.0008123929,0.83024746,0.0017909048,0.000023649389],"about_ca_topic_score_codex":0.001318649,"about_ca_topic_score_gemma":0.0010520798,"teacher_disagreement_score":0.0053557185,"about_ca_system_score_codex":0.0018955664,"about_ca_system_score_gemma":0.0025280819,"threshold_uncertainty_score":0.019975722},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001841068,0.00007317642,0.9968466,0.000040181705,0.000028825058,0.00002590049,0.000009259506,0.00004792729,0.0010869995],"genre_scores_gemma":[0.109916165,0.00037936214,0.8835535,0.00009851327,0.0001010413,0.00033933026,0.00008029224,0.00011883863,0.005412944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999094,0.00025720455,0.00004641656,0.000117865355,0.00042800696,0.000056404835],"domain_scores_gemma":[0.99925846,0.00037413213,0.000052908592,0.00007768898,0.00019571916,0.000041118343],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015047165,0.0008672002,0.0010430481,0.00055219093,0.0005692442,0.00072620966,0.0014403227,0.0009915082,0.0020933014],"category_scores_gemma":[0.002602069,0.00044850327,0.00093802175,0.0006129862,0.0011361099,0.0012740071,0.001686949,0.0018850493,0.0004985373],"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.00018085052,0.0001372329,0.0009368297,0.00036866704,0.00018561022,0.00038001226,0.00025123567,0.540638,0.026726065,0.2240844,0.0024931408,0.20361802],"study_design_scores_gemma":[0.000015367294,0.00005466436,0.000058225327,0.000010694258,0.00001121696,0.00007819189,0.000009284123,0.97349,0.0024855684,0.020538623,0.003237478,0.00001062361],"about_ca_topic_score_codex":0.0021265047,"about_ca_topic_score_gemma":0.0021472047,"teacher_disagreement_score":0.0021265047,"about_ca_system_score_codex":0.00061610865,"about_ca_system_score_gemma":0.0012871443,"threshold_uncertainty_score":0.007957816},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15789375,0.00096329924,0.8260319,0.0007787495,0.0000532283,0.00007188737,0.00007574927,0.00011614548,0.014015259],"genre_scores_gemma":[0.9731502,0.00042230327,0.021504525,0.00008553346,0.00005817476,0.00016104101,0.0000703245,0.00004857217,0.004499463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959654,0.00014611453,0.000014020997,0.000090779446,0.000107811284,0.00004468212],"domain_scores_gemma":[0.99882454,0.0007012082,0.00017417812,0.00004714181,0.00018703932,0.00006588259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010295925,0.0008340028,0.0006134073,0.00058813574,0.0005450589,0.0013532548,0.0006708535,0.00082353054,0.001846771],"category_scores_gemma":[0.003069116,0.00023505828,0.000709823,0.00028613955,0.0015032872,0.0012156322,0.0017704666,0.0012360553,0.00017711527],"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.00033069245,0.00010560709,0.0022422136,0.00041291802,0.00016234674,0.00048412764,0.0004839564,0.53014094,0.038897432,0.38449627,0.0021386826,0.0401047],"study_design_scores_gemma":[0.000010429595,0.00007486876,0.00027050954,0.000014419329,0.000007569565,0.00005999591,0.000044084576,0.9675075,0.0017685408,0.029624965,0.00060704834,0.000010038847],"about_ca_topic_score_codex":0.0011344256,"about_ca_topic_score_gemma":0.00047733102,"teacher_disagreement_score":0.001846771,"about_ca_system_score_codex":0.000559517,"about_ca_system_score_gemma":0.00055651413,"threshold_uncertainty_score":0.0061780214},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002629565,0.00018025874,0.9948382,0.000084673185,0.000028162784,0.000034501285,0.000016353895,0.000057482877,0.0021307697],"genre_scores_gemma":[0.2103196,0.000990137,0.77729386,0.00014671429,0.00018140343,0.0008350042,0.00017296567,0.0002978535,0.009762455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990953,0.0003281563,0.000039591003,0.0001290422,0.0003410067,0.00006696818],"domain_scores_gemma":[0.9988601,0.00065258885,0.000113013404,0.00009770063,0.00022855584,0.000048073773],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019780188,0.0018080359,0.0014108293,0.0010554584,0.00061706477,0.00095359987,0.0019331282,0.0015654236,0.0031216058],"category_scores_gemma":[0.004718732,0.00069636106,0.0014115471,0.0011814298,0.0014736657,0.0014393321,0.002603278,0.001955572,0.00073932],"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.000051384402,0.00005083897,0.00032986864,0.00017481472,0.00010320278,0.00012741656,0.0001195675,0.82734615,0.0025159582,0.1146485,0.0011717175,0.0533606],"study_design_scores_gemma":[0.000008837924,0.000023465978,0.000031579937,0.000008477323,0.000006933574,0.000022744765,0.0000070845676,0.97751904,0.0005235132,0.020649191,0.0011925619,0.0000065016106],"about_ca_topic_score_codex":0.0034795133,"about_ca_topic_score_gemma":0.003236103,"teacher_disagreement_score":0.0034795133,"about_ca_system_score_codex":0.0010491837,"about_ca_system_score_gemma":0.0014816257,"threshold_uncertainty_score":0.010460913},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031480836,0.00017972375,0.9953642,0.000065665554,0.000047619375,0.000027260414,0.000012621115,0.000071059105,0.0010837292],"genre_scores_gemma":[0.22239146,0.00082350953,0.76839596,0.00022416584,0.0002268247,0.00032890754,0.00018551473,0.00027034484,0.0071532535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999411,0.0002302606,0.000039514478,0.00007233458,0.00019698014,0.000049960698],"domain_scores_gemma":[0.9993513,0.00028732346,0.00007380618,0.00006935862,0.00016492361,0.000053203756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001461405,0.0013411472,0.0011532475,0.00059346436,0.00035618639,0.0007367153,0.0014307683,0.00085869804,0.0025004526],"category_scores_gemma":[0.0032467921,0.00043360237,0.00062787643,0.00050468196,0.00072358834,0.0019601432,0.001341694,0.0018605129,0.00057070423],"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.00022074493,0.00013206316,0.00039526468,0.00035799204,0.000099795034,0.00018677623,0.00019496777,0.5217358,0.010054362,0.30033842,0.003979881,0.1623039],"study_design_scores_gemma":[0.000021124457,0.00006482289,0.00008228979,0.000010685984,0.000006474649,0.000031077485,0.000007963468,0.9769548,0.0013987918,0.018786656,0.0026243485,0.000010834232],"about_ca_topic_score_codex":0.0014349929,"about_ca_topic_score_gemma":0.0018640406,"teacher_disagreement_score":0.0025004526,"about_ca_system_score_codex":0.0005356077,"about_ca_system_score_gemma":0.0010587238,"threshold_uncertainty_score":0.008364797},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018779681,0.026746968,0.24299765,0.00206511,0.0018909355,0.000043208634,0.00037285467,0.000671358,0.72333395],"genre_scores_gemma":[0.026811304,0.016208934,0.05253341,0.00068676705,0.0013016413,0.00010787247,0.0005595277,0.0009445039,0.900846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99985075,0.000020646978,0.000004482288,0.000028637676,0.00008807525,0.0000073530096],"domain_scores_gemma":[0.9998965,0.00004090789,0.000004779696,0.000019432997,0.000029267967,0.000009022181],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022590539,0.001259669,0.0009983102,0.00083606085,0.00051634584,0.0012316885,0.0006998482,0.000712845,0.032854717],"category_scores_gemma":[0.0005026921,0.00053143926,0.00039509617,0.0012749345,0.0008338328,0.0014958348,0.0008339384,0.0018221231,0.01353022],"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.000013550266,0.00004439001,0.000071411385,0.00025796238,0.00002023446,0.000033956345,0.00007703076,0.008139366,0.001622692,0.41613322,0.28741008,0.28617612],"study_design_scores_gemma":[0.00000559905,0.000019649726,0.00035839967,0.0001164456,0.000014933391,0.000114742106,0.000031663716,0.023813376,0.0011643033,0.38235867,0.59198624,0.000016035681],"about_ca_topic_score_codex":0.0012863636,"about_ca_topic_score_gemma":0.0036404151,"teacher_disagreement_score":0.032854717,"about_ca_system_score_codex":0.0007342936,"about_ca_system_score_gemma":0.00053101365,"threshold_uncertainty_score":0.10990995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01492971,0.0020590534,0.96943194,0.0007876116,0.00041180046,0.00007212021,0.00008544019,0.000111340254,0.012110972],"genre_scores_gemma":[0.46891272,0.0077940635,0.48922107,0.0014683965,0.0017702347,0.001021162,0.00036732957,0.00054112927,0.028903974],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982436,0.0005921617,0.00011755722,0.00037304423,0.0005617393,0.00011183271],"domain_scores_gemma":[0.99484575,0.003037366,0.0004073067,0.00034466217,0.0011411172,0.00022387292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0073851203,0.0012438578,0.0011913049,0.0026018077,0.0012131816,0.0018154504,0.0019012892,0.001482011,0.0031640143],"category_scores_gemma":[0.012306882,0.00043794975,0.0029232774,0.0011209074,0.0027785616,0.006016902,0.002567172,0.005049876,0.00052078825],"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.000045255394,0.000032203396,0.0004400801,0.00024965446,0.00008113123,0.0002741202,0.00032839744,0.011268791,0.0039474173,0.96140504,0.001574483,0.0203533],"study_design_scores_gemma":[0.000027026703,0.00014509993,0.0008517633,0.00012236643,0.00007071929,0.0006860009,0.00012801384,0.18716554,0.004679068,0.78945774,0.016598295,0.00006841705],"about_ca_topic_score_codex":0.00075279415,"about_ca_topic_score_gemma":0.00062173756,"teacher_disagreement_score":0.0073851203,"about_ca_system_score_codex":0.0014924826,"about_ca_system_score_gemma":0.001080694,"threshold_uncertainty_score":0.03905672},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072034067,0.000073531024,0.99167514,0.000032206517,0.00002111903,0.000021779719,0.0000041292333,0.000046207548,0.00092239265],"genre_scores_gemma":[0.2729139,0.00035541644,0.7228379,0.00011194964,0.00008034415,0.00033838282,0.000092573944,0.00011425797,0.0031552042],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992924,0.000255194,0.000044371154,0.00009250636,0.00024928007,0.000066243854],"domain_scores_gemma":[0.9984706,0.00086878636,0.00016602947,0.0001183922,0.00027814275,0.00009793272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025050796,0.0007223279,0.0008687704,0.0007737406,0.0005022704,0.0006823016,0.0010882507,0.0009777588,0.0026249515],"category_scores_gemma":[0.0053071934,0.00037085422,0.0005491742,0.00053119287,0.0014006803,0.001740644,0.0016385528,0.0015904163,0.0005497665],"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.00028449047,0.00015472539,0.0009063703,0.0003342894,0.00005992344,0.00017163991,0.00043511685,0.42114198,0.0153346835,0.42742658,0.0016471407,0.13210304],"study_design_scores_gemma":[0.000020190426,0.00018319371,0.00008036472,0.00002383201,0.0000071499776,0.00004893799,0.000028864742,0.9645148,0.0022891585,0.030680692,0.002110626,0.000012205142],"about_ca_topic_score_codex":0.000670149,"about_ca_topic_score_gemma":0.0006835011,"teacher_disagreement_score":0.0026249515,"about_ca_system_score_codex":0.00043884828,"about_ca_system_score_gemma":0.0009979582,"threshold_uncertainty_score":0.013248265},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005164898,0.0026739554,0.010937631,0.0031795036,0.005005626,0.000115856055,0.0018652821,0.00091057125,0.974795],"genre_scores_gemma":[0.002185789,0.001819581,0.0027323232,0.0011811475,0.0008745891,0.00007872855,0.0015164042,0.00029195636,0.9893194],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99945277,0.000055944143,0.000018846617,0.00012337485,0.00028654753,0.00006260012],"domain_scores_gemma":[0.99923325,0.00011040762,0.000029614725,0.00012459612,0.0003611251,0.00014088408],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005864685,0.00093535683,0.0005196084,0.0014652447,0.0011849852,0.003357322,0.0014947334,0.0015019709,0.47306702],"category_scores_gemma":[0.002207517,0.00029104523,0.00048216167,0.0013232273,0.00060943246,0.002676751,0.0021015753,0.0016559339,0.3703451],"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.000028817416,0.000034134435,0.000102306236,0.00016145516,0.0000030296671,0.00005129271,0.00011643284,0.00020572923,0.00056664745,0.07646705,0.72674936,0.19551378],"study_design_scores_gemma":[0.0000016278691,0.0000058022406,0.00006097627,0.000047326193,0.000001026787,0.00003713039,0.000026280797,0.000041569197,0.00012381,0.007652486,0.9919993,0.0000026733778],"about_ca_topic_score_codex":0.0014600055,"about_ca_topic_score_gemma":0.0022230453,"teacher_disagreement_score":0.47306702,"about_ca_system_score_codex":0.0011041036,"about_ca_system_score_gemma":0.0015344949,"threshold_uncertainty_score":0.7516059},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024966064,0.00007603066,0.996801,0.00005183733,0.00003448605,0.000024828476,0.00000985002,0.00006232338,0.00044294674],"genre_scores_gemma":[0.05383653,0.0001627089,0.94289935,0.00009352412,0.00007465052,0.0001926321,0.00006939982,0.00009379127,0.0025773717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990996,0.00026699476,0.000077749115,0.00014432354,0.00033392585,0.000077416014],"domain_scores_gemma":[0.99815375,0.0009861086,0.00016220399,0.00014088012,0.0003606142,0.00019636739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022582503,0.0011185415,0.0014489127,0.0016624129,0.00060729776,0.0017031553,0.0025673124,0.0021000376,0.0026329933],"category_scores_gemma":[0.007392335,0.0006627391,0.0011689038,0.00083213573,0.0015589559,0.0031005326,0.0031623319,0.0027731208,0.0006362346],"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.00026858438,0.00019818502,0.0016071155,0.00035110244,0.00016168681,0.00023916087,0.0003488492,0.22419399,0.011739939,0.4560041,0.0036106275,0.30127656],"study_design_scores_gemma":[0.000035422632,0.00009706,0.00018570737,0.0000233046,0.000013431829,0.00012935391,0.000030116773,0.94532734,0.0023308056,0.048334684,0.00345767,0.000035039102],"about_ca_topic_score_codex":0.0012078442,"about_ca_topic_score_gemma":0.001656869,"teacher_disagreement_score":0.0026329933,"about_ca_system_score_codex":0.0007415596,"about_ca_system_score_gemma":0.0013020198,"threshold_uncertainty_score":0.011942923},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043345485,0.00022570121,0.9935464,0.000075070435,0.00004196865,0.000038546958,0.000010350393,0.00008071637,0.0016467621],"genre_scores_gemma":[0.15380292,0.00067185983,0.8409611,0.0001697612,0.00012489849,0.00030871353,0.00007663056,0.00015076701,0.0037333225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999438,0.00023111803,0.00003892262,0.00006803703,0.00018761739,0.000036195856],"domain_scores_gemma":[0.9989918,0.00057834707,0.00007224759,0.0001119964,0.00018782628,0.00005778793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001519559,0.00083387335,0.0007387833,0.0005174608,0.00047250208,0.0006516907,0.0010899834,0.0009434479,0.0022006189],"category_scores_gemma":[0.0034503152,0.00037043338,0.00095529953,0.0005055392,0.00097616616,0.0013363645,0.001672485,0.0024884595,0.0004884497],"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.0001837671,0.00020060792,0.0011756059,0.00059991644,0.00012646295,0.00020533729,0.00043721878,0.461824,0.024790691,0.2835792,0.00253385,0.22434334],"study_design_scores_gemma":[0.000014107137,0.000051196483,0.00007561394,0.000016413298,0.000007947299,0.000034766974,0.000011197819,0.978035,0.0019416137,0.018011963,0.0017903437,0.000009762367],"about_ca_topic_score_codex":0.0012783757,"about_ca_topic_score_gemma":0.001382469,"teacher_disagreement_score":0.0022006189,"about_ca_system_score_codex":0.00034185304,"about_ca_system_score_gemma":0.001111675,"threshold_uncertainty_score":0.008036315},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009136016,0.002022818,0.96809936,0.0009490666,0.00021447618,0.00014651929,0.00031508916,0.00010158837,0.019015124],"genre_scores_gemma":[0.4571192,0.00882562,0.509023,0.0020735143,0.0009489588,0.0018403671,0.0020340325,0.00093976274,0.017195472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984213,0.00061653444,0.00010403385,0.00030439429,0.00036857324,0.00018517938],"domain_scores_gemma":[0.991912,0.00593808,0.00053751114,0.00020451141,0.0011827732,0.00022506533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058165095,0.0032583089,0.0017552827,0.0026750155,0.0009366531,0.002279322,0.0010153034,0.002754752,0.0052130856],"category_scores_gemma":[0.0124219125,0.00085733685,0.0020993704,0.0016787507,0.0031591407,0.0025669825,0.0033591238,0.0045340993,0.0013567253],"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.00013366206,0.000094313975,0.00069918064,0.0008117485,0.000074548894,0.00037552934,0.00027539817,0.3157558,0.0052067474,0.6326498,0.010839391,0.033083893],"study_design_scores_gemma":[0.00005397037,0.00021432774,0.0005305113,0.0003155321,0.000051697687,0.00018080129,0.00014465454,0.69187605,0.0026305139,0.2913936,0.0125404345,0.00006800129],"about_ca_topic_score_codex":0.0023698143,"about_ca_topic_score_gemma":0.0018379549,"teacher_disagreement_score":0.0058165095,"about_ca_system_score_codex":0.0014313387,"about_ca_system_score_gemma":0.0024850338,"threshold_uncertainty_score":0.030761003},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007431552,0.00014997879,0.9911624,0.00011427241,0.000024734833,0.000036938716,0.0000043374794,0.00003236832,0.0010433905],"genre_scores_gemma":[0.21026644,0.00035672338,0.7859713,0.0001090339,0.00006815285,0.0002887322,0.000038730836,0.00007146568,0.0028294867],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988914,0.00047995316,0.00006539079,0.00018419913,0.0003089869,0.00007007317],"domain_scores_gemma":[0.9972024,0.001987119,0.00021349455,0.0001306041,0.00032694443,0.00013952835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033173617,0.001217637,0.0014990831,0.0011765346,0.0008487416,0.001213248,0.0015704063,0.0023367552,0.0017057355],"category_scores_gemma":[0.008828196,0.0005302115,0.0013919213,0.0008055752,0.0021144073,0.002880844,0.00255137,0.002046836,0.00026507178],"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.00015427716,0.00014106916,0.0010736323,0.00029654807,0.0001451297,0.000348394,0.0005279744,0.40808707,0.008552305,0.49944618,0.0009048541,0.08032257],"study_design_scores_gemma":[0.00002130084,0.00008404151,0.00006914081,0.000025762984,0.000015979249,0.00006610399,0.000027780447,0.949112,0.0011970113,0.047801483,0.0015618532,0.000017600523],"about_ca_topic_score_codex":0.001254889,"about_ca_topic_score_gemma":0.0010715537,"teacher_disagreement_score":0.0033173617,"about_ca_system_score_codex":0.0010314805,"about_ca_system_score_gemma":0.0013986409,"threshold_uncertainty_score":0.01754409},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09009529,0.0014372307,0.8990862,0.0010305669,0.00013548619,0.000099173645,0.000037439397,0.000057290825,0.008021345],"genre_scores_gemma":[0.83123314,0.0014776665,0.14639275,0.0003209039,0.00016610089,0.00035338535,0.00010998677,0.00007829665,0.019867828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954104,0.0001810537,0.000022962027,0.0000754483,0.000136009,0.000043480206],"domain_scores_gemma":[0.99950457,0.0002362775,0.00008286119,0.000028318369,0.00008585506,0.0000620778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001621387,0.00088954245,0.0009855367,0.0008067991,0.0007182097,0.0011437056,0.001025247,0.0020894422,0.0012631989],"category_scores_gemma":[0.0021324828,0.00039155828,0.0010131868,0.00035673133,0.0018051466,0.0017234096,0.0020163197,0.001756912,0.00017881829],"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.0002043924,0.00017935745,0.0013601796,0.000807919,0.00012507204,0.0003798313,0.00044990887,0.217697,0.049300425,0.70603406,0.0010058489,0.022456037],"study_design_scores_gemma":[0.000022875576,0.00012750652,0.00034175726,0.000036808127,0.000012817823,0.00009890796,0.00008549368,0.9380928,0.0025305492,0.057018243,0.0016104345,0.000021777707],"about_ca_topic_score_codex":0.0014446244,"about_ca_topic_score_gemma":0.0012073088,"teacher_disagreement_score":0.0020894422,"about_ca_system_score_codex":0.0009317789,"about_ca_system_score_gemma":0.001262327,"threshold_uncertainty_score":0.008574784},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045346916,0.000087870496,0.99447155,0.000054271182,0.000022916354,0.000026920403,0.000005160413,0.00006248845,0.0007341466],"genre_scores_gemma":[0.29560646,0.0004227208,0.69932413,0.00017397452,0.00013066849,0.00046047624,0.000102193706,0.00012458621,0.003654731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981852,0.0005603459,0.0001275301,0.00036300303,0.0005981895,0.0001656158],"domain_scores_gemma":[0.99814844,0.000916017,0.00019362362,0.0001725223,0.00039447233,0.00017504487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002932879,0.0013156396,0.0012673289,0.0012042037,0.0007972866,0.0014112056,0.0017815756,0.0016300924,0.0023759978],"category_scores_gemma":[0.006550426,0.0006146649,0.001196171,0.00084592664,0.0021278497,0.0032181893,0.004236173,0.0026230237,0.00043991653],"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.00022315134,0.00015845084,0.0013087863,0.00034164026,0.00013592863,0.00018656073,0.0005484771,0.31244865,0.0077183093,0.4761698,0.0016568893,0.19910336],"study_design_scores_gemma":[0.000024885612,0.00010749524,0.00016983425,0.00001796782,0.000012253422,0.00006638708,0.000038580216,0.9502776,0.0023143918,0.045550484,0.0013958092,0.00002423791],"about_ca_topic_score_codex":0.0012197839,"about_ca_topic_score_gemma":0.0008683016,"teacher_disagreement_score":0.002932879,"about_ca_system_score_codex":0.0008462117,"about_ca_system_score_gemma":0.0018313184,"threshold_uncertainty_score":0.015510738},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015623459,0.00011822794,0.9968695,0.000067760826,0.00006968494,0.000041786905,0.000011074941,0.00007103835,0.0011885095],"genre_scores_gemma":[0.03018669,0.00028157557,0.965592,0.0001316342,0.00010189835,0.00026621667,0.00007478306,0.000094049145,0.0032709942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925596,0.00020439849,0.000044310254,0.00012347802,0.000321868,0.000049978727],"domain_scores_gemma":[0.9993186,0.0003629327,0.00003870045,0.000059785376,0.00017541996,0.00004450259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014291308,0.0009689692,0.0010725443,0.0010176959,0.000500989,0.00082154677,0.0017465599,0.0019854882,0.003640645],"category_scores_gemma":[0.0032465914,0.00040746783,0.00083327445,0.0010502603,0.0010097255,0.0018763276,0.0021226197,0.0021746247,0.000927841],"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.00019053975,0.00019674437,0.0008348505,0.00037188968,0.0001538637,0.0003331157,0.00028098896,0.32638365,0.017227773,0.3313963,0.005748203,0.31688213],"study_design_scores_gemma":[0.00007034814,0.00010759997,0.00013633572,0.000034245637,0.00001617779,0.00015742841,0.000015683492,0.95119804,0.00223668,0.03585798,0.010143125,0.000026308022],"about_ca_topic_score_codex":0.0018988901,"about_ca_topic_score_gemma":0.0019195342,"teacher_disagreement_score":0.003640645,"about_ca_system_score_codex":0.00057588617,"about_ca_system_score_gemma":0.0012312569,"threshold_uncertainty_score":0.012179196},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016103296,0.0014544592,0.944921,0.0017745354,0.00034608,0.0000801765,0.0002305471,0.000070089285,0.03501974],"genre_scores_gemma":[0.57338387,0.0047067213,0.35092008,0.002129927,0.0009808916,0.00086748373,0.0010696553,0.0005905795,0.065350756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99822336,0.00047744322,0.000102275524,0.0004571208,0.00062575814,0.00011400729],"domain_scores_gemma":[0.9984666,0.0006614441,0.0001418828,0.00017296316,0.00044926468,0.00010795049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040100436,0.0016559244,0.0013858797,0.00165731,0.0010229899,0.001521247,0.0025707593,0.001400127,0.005432683],"category_scores_gemma":[0.0045289197,0.0005513902,0.002255086,0.0010635665,0.0030937467,0.0036129807,0.0036235838,0.0037731205,0.000969043],"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.00001559556,0.000010169344,0.00013034773,0.000098871344,0.00003883462,0.000121015015,0.00009399928,0.0057427743,0.0018050212,0.98366416,0.0013655518,0.0069136904],"study_design_scores_gemma":[0.000023646948,0.00008015819,0.00070306595,0.00004731264,0.000040404324,0.00036526014,0.00008151466,0.090313464,0.00266846,0.8853543,0.020284656,0.000037858306],"about_ca_topic_score_codex":0.00260455,"about_ca_topic_score_gemma":0.0024021594,"teacher_disagreement_score":0.005432683,"about_ca_system_score_codex":0.0017631028,"about_ca_system_score_gemma":0.0012849278,"threshold_uncertainty_score":0.021207333},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13071436,0.004805329,0.7608982,0.009695684,0.0013575176,0.00008373551,0.00026593357,0.0004753087,0.091704026],"genre_scores_gemma":[0.86047745,0.0035057117,0.096517704,0.0016808899,0.001224509,0.00017342926,0.00022816443,0.00017568926,0.036016352],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991273,0.00028032545,0.000049958853,0.0002385282,0.00023192991,0.00007207198],"domain_scores_gemma":[0.9974305,0.0016887904,0.00013253358,0.00023556131,0.00039117545,0.00012143259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002889625,0.00061589055,0.00077137665,0.0010788697,0.000941247,0.0011223182,0.0010917749,0.0011733068,0.006137696],"category_scores_gemma":[0.004163843,0.00024473117,0.0010758548,0.0005253389,0.0026955954,0.0033452685,0.002161824,0.0027623444,0.00066310115],"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.00004367143,0.000016842423,0.00035907162,0.0001581087,0.000025432539,0.0005510983,0.0004345869,0.003340259,0.0054318467,0.9772749,0.002065534,0.010298638],"study_design_scores_gemma":[0.000024461653,0.00021354978,0.0007706181,0.000059061447,0.000033306293,0.0007636004,0.0002239712,0.018058427,0.004504893,0.95184964,0.023456704,0.000041718115],"about_ca_topic_score_codex":0.0006959106,"about_ca_topic_score_gemma":0.00030291622,"teacher_disagreement_score":0.006137696,"about_ca_system_score_codex":0.00034751455,"about_ca_system_score_gemma":0.00029467326,"threshold_uncertainty_score":0.020532668},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008242672,0.003470184,0.016030878,0.001192658,0.0006497343,0.00002268559,0.0002701391,0.00018768413,0.9773516],"genre_scores_gemma":[0.013596403,0.0042315647,0.0077954596,0.0006050931,0.0005557674,0.00005513795,0.0004028122,0.00027149223,0.97248626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9998141,0.000022966065,0.00000621646,0.000038963753,0.00010212646,0.000015680265],"domain_scores_gemma":[0.9998808,0.000035649802,0.0000058721253,0.000021214186,0.000042281237,0.000014160024],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020927882,0.0007210723,0.00047650313,0.00090300274,0.0007336969,0.0017900697,0.00052411755,0.0005984651,0.11775714],"category_scores_gemma":[0.00060863746,0.000303117,0.00039382683,0.0010370782,0.00084492133,0.0023367316,0.00086346676,0.0017065655,0.04032233],"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.0000128471465,0.000023322444,0.00003485509,0.0001546096,0.000005000273,0.000028939789,0.00012723189,0.00028166693,0.0011980467,0.6240661,0.23718148,0.13688591],"study_design_scores_gemma":[0.000004707323,0.000011643351,0.00014496114,0.00007623683,0.000004648215,0.00014468573,0.000047186746,0.0007427178,0.00065105135,0.24964269,0.7485218,0.000007655678],"about_ca_topic_score_codex":0.00058189995,"about_ca_topic_score_gemma":0.0011157608,"teacher_disagreement_score":0.11775714,"about_ca_system_score_codex":0.0008149935,"about_ca_system_score_gemma":0.0006265398,"threshold_uncertainty_score":0.39393687},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036331948,0.0007211527,0.9580999,0.00041331747,0.00003283279,0.000063053056,0.00006335516,0.00006833648,0.004206168],"genre_scores_gemma":[0.8553144,0.0027028709,0.13426228,0.00030999817,0.00018516979,0.00044302395,0.00020077519,0.0001653571,0.0064161634],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979377,0.0010968434,0.00010046159,0.00031598398,0.00037922233,0.00016988591],"domain_scores_gemma":[0.9901805,0.007681318,0.00074337784,0.00033325082,0.0007315598,0.00032990245],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007461311,0.0014896175,0.0012284723,0.0028339983,0.00076470175,0.0025434436,0.0012391295,0.001577664,0.002033038],"category_scores_gemma":[0.02129626,0.0009126832,0.001746402,0.0013192854,0.0042556273,0.0047167395,0.0033985206,0.0035374004,0.00019187994],"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.00006933199,0.000051065686,0.0009931647,0.00028442766,0.00011258567,0.00034862617,0.00028313592,0.23677692,0.006634856,0.73658127,0.0005797421,0.017284846],"study_design_scores_gemma":[0.000007637317,0.00008215816,0.0007861955,0.000071796094,0.000023592265,0.00011490952,0.000071152295,0.70583117,0.0015337087,0.29068258,0.0007538434,0.000041291474],"about_ca_topic_score_codex":0.0011814022,"about_ca_topic_score_gemma":0.00063668523,"teacher_disagreement_score":0.007461311,"about_ca_system_score_codex":0.0014004009,"about_ca_system_score_gemma":0.0010949852,"threshold_uncertainty_score":0.039459646},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04994754,0.0035654698,0.9091619,0.0014649581,0.00017469651,0.000053047523,0.00005322164,0.000049158592,0.03552999],"genre_scores_gemma":[0.828495,0.0035998558,0.15160376,0.0006973414,0.0004676068,0.00018783541,0.00008827916,0.00004881202,0.01481137],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991684,0.0002442812,0.000057238693,0.0001749087,0.00027161994,0.00008358114],"domain_scores_gemma":[0.9990357,0.00039956658,0.00014199792,0.000105920255,0.00020004362,0.00011682894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017529055,0.0005578532,0.00069700606,0.0012396041,0.00093988026,0.0018946545,0.0010801891,0.0012053268,0.0023236268],"category_scores_gemma":[0.002155011,0.00037596904,0.0010994624,0.00083279895,0.003624622,0.0045179925,0.003164437,0.0021826148,0.00025453203],"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.000009710519,0.000015773066,0.000203128,0.000062228544,0.0000091624,0.00013320443,0.00022438593,0.006258439,0.0017679114,0.98658156,0.00013892927,0.004595518],"study_design_scores_gemma":[0.000011601425,0.00008015075,0.0004327742,0.00009321941,0.000020571933,0.00024105805,0.0002433928,0.10725159,0.001337975,0.8799583,0.0103071295,0.000022197113],"about_ca_topic_score_codex":0.0010095008,"about_ca_topic_score_gemma":0.0009805145,"teacher_disagreement_score":0.0023236268,"about_ca_system_score_codex":0.0015585485,"about_ca_system_score_gemma":0.0010531794,"threshold_uncertainty_score":0.011308074},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010898219,0.00017837105,0.9869582,0.00009032546,0.00004094041,0.00004215621,0.000010654086,0.00004753743,0.0017335468],"genre_scores_gemma":[0.38463843,0.0004351096,0.6070309,0.00022340799,0.00010933466,0.0005376703,0.00014559593,0.00014711842,0.006732509],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924564,0.00026556104,0.000046347162,0.00012982675,0.00024249093,0.000070092334],"domain_scores_gemma":[0.99816006,0.0010380215,0.00013101047,0.00015455644,0.00036794445,0.00014845954],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002296089,0.00096769334,0.000954896,0.0009948963,0.00069649576,0.00082467386,0.0017324819,0.0016648386,0.0023259802],"category_scores_gemma":[0.0057089324,0.000457648,0.0010253834,0.0006478347,0.0016737961,0.0016146969,0.0029121314,0.0019688865,0.00036136276],"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.00030319105,0.000096375275,0.0014298571,0.0004289839,0.00014484451,0.00029889785,0.00049823953,0.4055021,0.013035721,0.4268609,0.0032183786,0.14818262],"study_design_scores_gemma":[0.000015069043,0.000082040184,0.00007029023,0.00001586377,0.000009022352,0.00006828368,0.000021750513,0.96820694,0.0015331088,0.028384777,0.0015770895,0.000015731941],"about_ca_topic_score_codex":0.0021819398,"about_ca_topic_score_gemma":0.0018175608,"teacher_disagreement_score":0.0023259802,"about_ca_system_score_codex":0.0010056477,"about_ca_system_score_gemma":0.0015388818,"threshold_uncertainty_score":0.012143016},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005759005,0.00045586246,0.98961824,0.0002745698,0.00007898204,0.000104177976,0.000027687782,0.00021662046,0.0034648057],"genre_scores_gemma":[0.35723853,0.0020890404,0.62789464,0.00048994983,0.00027700173,0.0011386308,0.00031711435,0.0006654528,0.009889597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99766636,0.0009724529,0.000094374656,0.00030376812,0.0007665156,0.00019650243],"domain_scores_gemma":[0.9938385,0.0040634484,0.0002185153,0.00030562785,0.0013018929,0.00027207093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0056001577,0.0021495905,0.0014935149,0.0012415438,0.0008843467,0.0017795695,0.0016668314,0.0020010131,0.0041406085],"category_scores_gemma":[0.014399494,0.0008205132,0.0013868172,0.00083935476,0.0022691211,0.0027323621,0.004209433,0.00512519,0.0011010871],"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.0005167227,0.00031102909,0.0019727412,0.0012078836,0.00023930926,0.0004151785,0.00070634217,0.64727825,0.028311335,0.1650419,0.00632772,0.14767165],"study_design_scores_gemma":[0.0000142904255,0.000052798066,0.00008374435,0.00001838795,0.000009102609,0.000041308504,0.000016154458,0.99030393,0.002134809,0.0067500495,0.00056416367,0.000011256999],"about_ca_topic_score_codex":0.004129071,"about_ca_topic_score_gemma":0.0017005331,"teacher_disagreement_score":0.0056001577,"about_ca_system_score_codex":0.0009782754,"about_ca_system_score_gemma":0.0026047581,"threshold_uncertainty_score":0.029616773},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03074492,0.00032712787,0.9642776,0.00017556116,0.00003506535,0.00004264859,0.000015757752,0.00007757073,0.0043037133],"genre_scores_gemma":[0.7414527,0.00048666282,0.2503004,0.00013014424,0.00007974867,0.00020595042,0.00007220106,0.00008793747,0.007184247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992487,0.0003058485,0.00003738629,0.00008379888,0.00026550563,0.000058765985],"domain_scores_gemma":[0.9981962,0.00084235525,0.00024885373,0.00009584994,0.00047568386,0.00014113166],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018822656,0.0007726151,0.000735956,0.0007999513,0.00042072017,0.0010059127,0.0010655574,0.001267565,0.0015141245],"category_scores_gemma":[0.006211015,0.0003396217,0.0007513389,0.00046059888,0.0017223081,0.0015213984,0.001269275,0.0011099064,0.00030327137],"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.00010770393,0.000045837725,0.0009982159,0.00017316226,0.000079744896,0.00018250203,0.00022448903,0.41182047,0.008139411,0.55733126,0.0005809463,0.020316282],"study_design_scores_gemma":[0.000004702917,0.00006284859,0.00009214317,0.000013314432,0.00000553148,0.00004618687,0.000014509246,0.9573439,0.0012420937,0.04041071,0.00075165555,0.000012516295],"about_ca_topic_score_codex":0.001032508,"about_ca_topic_score_gemma":0.00062447594,"teacher_disagreement_score":0.0018822656,"about_ca_system_score_codex":0.0010150762,"about_ca_system_score_gemma":0.0010058034,"threshold_uncertainty_score":0.009954512},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018291526,0.00030878946,0.9965952,0.00007769621,0.00006227789,0.00004906879,0.000013792736,0.00007207907,0.0009919517],"genre_scores_gemma":[0.08295324,0.0008323493,0.9123955,0.00016494501,0.00012323441,0.0003266117,0.00013637527,0.00012086051,0.002946875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992017,0.0003166562,0.000050781568,0.00009795855,0.0002747866,0.000058104815],"domain_scores_gemma":[0.99929965,0.00031942225,0.000065983426,0.000063021784,0.00019322881,0.00005862143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017912254,0.0013949908,0.0013604416,0.00089293247,0.00042809785,0.0008259345,0.0019883458,0.0015436764,0.0020723902],"category_scores_gemma":[0.0038261118,0.0005170676,0.0010994095,0.0008309081,0.0007751845,0.0017416517,0.0015007971,0.0025458168,0.00065434695],"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.0002185669,0.0001965826,0.0008222098,0.0009010887,0.00015261571,0.00024265533,0.0002821068,0.51746535,0.010164548,0.16973905,0.0057070414,0.2941081],"study_design_scores_gemma":[0.000018527515,0.0000591013,0.000087739034,0.000020137164,0.000008165821,0.00006408769,0.000010097627,0.98645884,0.0013247883,0.008900373,0.0030373489,0.000010800142],"about_ca_topic_score_codex":0.0014639414,"about_ca_topic_score_gemma":0.0017367747,"teacher_disagreement_score":0.0020723902,"about_ca_system_score_codex":0.00053328095,"about_ca_system_score_gemma":0.0013838902,"threshold_uncertainty_score":0.009473026},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32717067,0.004182783,0.6149505,0.002322221,0.00014151623,0.00008117004,0.000055947137,0.000073733616,0.051021475],"genre_scores_gemma":[0.92557055,0.001080571,0.06847272,0.00027644844,0.00015687647,0.00006794899,0.000026256925,0.0000352734,0.0043133628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985435,0.0006636731,0.00006773934,0.0002284529,0.00038935154,0.00010734507],"domain_scores_gemma":[0.99748504,0.0014465963,0.00033272905,0.0002645741,0.00030925035,0.00016182441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033961667,0.00051961903,0.0005095971,0.00090157986,0.00071907474,0.0014772711,0.0008272912,0.0011010042,0.0018008094],"category_scores_gemma":[0.0061083734,0.00029467102,0.0006742721,0.0005550917,0.0032687185,0.0031896494,0.0025827202,0.0021437113,0.00016948815],"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.000028602153,0.000025149404,0.0005869036,0.00007832249,0.0000140297725,0.00030447138,0.00032779007,0.007983029,0.00657219,0.9699295,0.00029771373,0.013852253],"study_design_scores_gemma":[0.000014414188,0.000115546165,0.00087736105,0.00006112435,0.000012543966,0.0009240375,0.0002971648,0.13427822,0.0040644775,0.85532033,0.0040155356,0.000019182065],"about_ca_topic_score_codex":0.00034009846,"about_ca_topic_score_gemma":0.0002062106,"teacher_disagreement_score":0.0033961667,"about_ca_system_score_codex":0.0005615965,"about_ca_system_score_gemma":0.00051390775,"threshold_uncertainty_score":0.017960846},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008906275,0.00018495544,0.9877208,0.00012170532,0.00003858534,0.00003485922,0.000013086713,0.00005423133,0.002925575],"genre_scores_gemma":[0.54573876,0.0007894313,0.43893388,0.00018486968,0.000097563076,0.0004984263,0.000111354464,0.00015354641,0.013492218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996313,0.00012872292,0.000014567277,0.000059250982,0.00012989395,0.000036304296],"domain_scores_gemma":[0.9997228,0.00014189178,0.000023424798,0.000020568637,0.000056695826,0.000034515335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093230413,0.0007751121,0.0010619188,0.00046565387,0.00058088894,0.0008677701,0.0010581253,0.0009400061,0.0035018893],"category_scores_gemma":[0.0013577958,0.00047941512,0.0006507347,0.00041901733,0.0012964723,0.0013899998,0.0023478833,0.0017546011,0.00052337645],"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.00016946647,0.000116981326,0.00060413464,0.00033553469,0.00011121972,0.00028219575,0.00021684954,0.6347223,0.008732463,0.2974526,0.0014625464,0.05579376],"study_design_scores_gemma":[0.000012590262,0.00003043949,0.000028681532,0.0000069273215,0.0000038868616,0.000029215642,0.000019511468,0.96909565,0.00066748785,0.029259091,0.0008408473,0.0000056296117],"about_ca_topic_score_codex":0.0011649816,"about_ca_topic_score_gemma":0.001237157,"teacher_disagreement_score":0.0035018893,"about_ca_system_score_codex":0.0004172919,"about_ca_system_score_gemma":0.0009532896,"threshold_uncertainty_score":0.011714995},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037692692,0.00009112867,0.99399084,0.0000835382,0.000029490104,0.000023858822,0.00001356733,0.00010043627,0.0018979041],"genre_scores_gemma":[0.27533388,0.0005065762,0.71584314,0.0002292472,0.00013950783,0.00030485072,0.00016597025,0.0002395334,0.0072373394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917907,0.0003698004,0.0000332854,0.000085407264,0.0002843875,0.000048065187],"domain_scores_gemma":[0.9993254,0.00027597253,0.000055028526,0.00007349388,0.00022269791,0.000047431222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017041642,0.00081078784,0.0011122958,0.0005981948,0.00035598507,0.000808545,0.00074386765,0.00082910835,0.0032566213],"category_scores_gemma":[0.0028040425,0.00043665167,0.0006767952,0.0005719341,0.00089473155,0.0014037336,0.0013761872,0.0013535938,0.0007145995],"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.000109801746,0.00006927467,0.00034076863,0.00022557202,0.0000608935,0.0001128588,0.00010317526,0.7125184,0.008690044,0.1724393,0.0028336383,0.10249624],"study_design_scores_gemma":[0.000007086573,0.000040604766,0.000026456948,0.0000060592824,0.000003671231,0.000014947735,0.0000032400756,0.98879725,0.0007458702,0.009334214,0.0010172349,0.0000033653532],"about_ca_topic_score_codex":0.0013984245,"about_ca_topic_score_gemma":0.0010068896,"teacher_disagreement_score":0.0032566213,"about_ca_system_score_codex":0.0006028423,"about_ca_system_score_gemma":0.0015065832,"threshold_uncertainty_score":0.010894477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04976192,0.0009554369,0.93782496,0.0011282574,0.00008552634,0.000101365324,0.00009943451,0.000097887605,0.009945316],"genre_scores_gemma":[0.7606693,0.002507782,0.21891108,0.00041645332,0.00023339712,0.0008698633,0.00046622413,0.00032932608,0.015596505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984353,0.00066530576,0.00007761832,0.00023197204,0.00050989655,0.00007990026],"domain_scores_gemma":[0.9955428,0.0029633194,0.00035445424,0.0001656061,0.00079578726,0.00017802286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038692604,0.0012950358,0.0009928964,0.0023261276,0.0010433975,0.0026093023,0.0011863399,0.0013638065,0.0027514112],"category_scores_gemma":[0.012098316,0.0005651103,0.0015537441,0.0008278658,0.0033607811,0.003097963,0.0029948102,0.003304831,0.0004396591],"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.000057707723,0.000035377594,0.0005318394,0.00021443797,0.00007521475,0.00009304938,0.00041238387,0.10213362,0.006735639,0.87402564,0.0008872194,0.014797859],"study_design_scores_gemma":[0.000011613476,0.000048362686,0.00024443716,0.00006203251,0.000017620921,0.000066322755,0.00010651878,0.68020326,0.003359513,0.3137775,0.002078023,0.000024848487],"about_ca_topic_score_codex":0.0011868717,"about_ca_topic_score_gemma":0.0005070171,"teacher_disagreement_score":0.0038692604,"about_ca_system_score_codex":0.002173523,"about_ca_system_score_gemma":0.0015705737,"threshold_uncertainty_score":0.02046287},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004641818,0.00026760553,0.99422365,0.0000763471,0.00004170053,0.000022317128,0.000006491912,0.000023980765,0.0006960346],"genre_scores_gemma":[0.19632703,0.0005820602,0.79946905,0.000078046374,0.0000832738,0.00019910159,0.000040673487,0.00006185227,0.0031589814],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995443,0.00017200911,0.000025050807,0.00006292213,0.00016648133,0.000029246945],"domain_scores_gemma":[0.9996953,0.00014442857,0.00004490869,0.00003242973,0.000052800184,0.000030105104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014564416,0.00079221785,0.0010004377,0.00066542765,0.00044897487,0.0007631439,0.0013535158,0.0011963693,0.000818463],"category_scores_gemma":[0.0021787414,0.0004139989,0.0012099474,0.000501149,0.0011608531,0.0013415042,0.0015443923,0.001920884,0.00017865673],"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.00009786778,0.000082060644,0.00088167907,0.00036331476,0.00015518349,0.00026962245,0.00032360433,0.3926362,0.03562347,0.49241722,0.0008200032,0.076329745],"study_design_scores_gemma":[0.000015664618,0.000060598883,0.000070131675,0.000015805266,0.00001539271,0.00006334038,0.000012569517,0.95773584,0.002013875,0.037231836,0.002751827,0.000013242697],"about_ca_topic_score_codex":0.001077203,"about_ca_topic_score_gemma":0.00083511777,"teacher_disagreement_score":0.0014564416,"about_ca_system_score_codex":0.00055016886,"about_ca_system_score_gemma":0.00088176836,"threshold_uncertainty_score":0.00770247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006776434,0.000744186,0.9842063,0.00048705985,0.00006306582,0.000058273257,0.000018056173,0.000095102216,0.0075515443],"genre_scores_gemma":[0.26958638,0.0020047547,0.7092997,0.00055270054,0.0002943452,0.00061693194,0.00016740922,0.00055747654,0.0169203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990903,0.00047726603,0.00003324951,0.00012074323,0.00021681696,0.0000617052],"domain_scores_gemma":[0.99567884,0.0033491154,0.00031469832,0.00022053008,0.0003142008,0.00012272135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029680156,0.0014789187,0.000877009,0.000931809,0.0005618623,0.0013029911,0.0013677347,0.0020168908,0.0028373203],"category_scores_gemma":[0.0082211,0.0005666078,0.0011877137,0.00075699855,0.0028250713,0.0018009278,0.0018965707,0.0034434618,0.00054278114],"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.000056964796,0.00013049894,0.0005217156,0.00037199561,0.00006648804,0.00009642775,0.00021343686,0.50728595,0.004081599,0.4401729,0.0020026667,0.044999268],"study_design_scores_gemma":[0.0000071083405,0.000027930517,0.000043968495,0.00002957383,0.000005409401,0.000015826485,0.000012920687,0.9742939,0.00038421957,0.023757005,0.0014145558,0.0000075933626],"about_ca_topic_score_codex":0.0028440806,"about_ca_topic_score_gemma":0.002267402,"teacher_disagreement_score":0.0029680156,"about_ca_system_score_codex":0.0012973376,"about_ca_system_score_gemma":0.0015950857,"threshold_uncertainty_score":0.015696526},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0072012353,0.0019206891,0.2699995,0.0017497082,0.0018413434,0.000055475888,0.0006260465,0.00029135117,0.7163146],"genre_scores_gemma":[0.24450663,0.005401511,0.11137616,0.0023516468,0.0030476425,0.00038066987,0.0022988233,0.0017444467,0.6288924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990452,0.00020021347,0.000049192047,0.00025300522,0.00038090092,0.00007150237],"domain_scores_gemma":[0.99924785,0.00017800812,0.00004563516,0.0001323783,0.00033153032,0.000064546795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067091396,0.00090859534,0.00060101994,0.0017399034,0.0010856588,0.0029738122,0.0010044666,0.0008327775,0.047776658],"category_scores_gemma":[0.0024405734,0.00030390956,0.0006541802,0.0011104415,0.0017380285,0.004039071,0.001915198,0.0032474634,0.009608082],"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.000007710954,0.000010331522,0.0000129187765,0.00002831754,0.0000039423685,0.00000897239,0.00004725424,0.00023725137,0.00030315467,0.97419995,0.007585817,0.017554326],"study_design_scores_gemma":[0.0000037812079,0.0000089970545,0.000036658494,0.000014663196,0.0000052400337,0.000060436352,0.000041135085,0.0013816629,0.0004908401,0.9397061,0.058245096,0.000005429104],"about_ca_topic_score_codex":0.0005802781,"about_ca_topic_score_gemma":0.0005771465,"teacher_disagreement_score":0.047776658,"about_ca_system_score_codex":0.00082607375,"about_ca_system_score_gemma":0.0005023707,"threshold_uncertainty_score":0.1598289},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042958505,0.0035418435,0.9354442,0.0011369765,0.00007913023,0.00008706923,0.00006309641,0.00012251933,0.016566608],"genre_scores_gemma":[0.55566186,0.0043774135,0.4275745,0.00014163551,0.00018788887,0.00023720885,0.00012547302,0.00010514251,0.011588835],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837565,0.0009948242,0.00006250153,0.00015764787,0.00029811275,0.00011127056],"domain_scores_gemma":[0.99671316,0.002382175,0.00023423081,0.00018355553,0.0003135592,0.0001734081],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029797943,0.00080795534,0.00083875505,0.00095207104,0.00082548684,0.0013335027,0.00095447974,0.002600562,0.0023668602],"category_scores_gemma":[0.008247377,0.00037330418,0.0009254964,0.0019815434,0.0023436751,0.0018463352,0.0016346757,0.002154033,0.00039324313],"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.00015557629,0.00011986812,0.0016593521,0.0003020856,0.000054851578,0.0007889492,0.00033589915,0.42223564,0.0013767696,0.52198285,0.0034339747,0.0475542],"study_design_scores_gemma":[0.00003239428,0.00011964386,0.0004110623,0.000033382577,0.000019190342,0.00038650917,0.00010442104,0.91925067,0.0009864442,0.07409115,0.0045415736,0.000023438706],"about_ca_topic_score_codex":0.0034659524,"about_ca_topic_score_gemma":0.0024675394,"teacher_disagreement_score":0.0034659524,"about_ca_system_score_codex":0.0007632523,"about_ca_system_score_gemma":0.0009379458,"threshold_uncertainty_score":0.015758872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014788393,0.00029655045,0.9806862,0.0004949626,0.0001259639,0.00004649752,0.000058645277,0.000378291,0.0031244464],"genre_scores_gemma":[0.37903565,0.00039037302,0.60091484,0.00021774194,0.00022996948,0.0005007152,0.00027565626,0.00073545997,0.01769946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894136,0.00036950552,0.000044684526,0.00019705533,0.00032937172,0.00011805737],"domain_scores_gemma":[0.99657047,0.0023140358,0.00012847155,0.00031086337,0.0005139622,0.00016232554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025116354,0.0010661549,0.0016445928,0.00077017536,0.0010531719,0.0021712966,0.001984045,0.0020342234,0.006045648],"category_scores_gemma":[0.007164813,0.0010175727,0.0013069559,0.00086320343,0.0015533987,0.0019300368,0.0020858818,0.0031976523,0.0010080184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013600402,0.000051663897,0.00030811687,0.00006529284,0.000033750144,0.000054042812,0.000060628074,0.9309371,0.0010244086,0.04560214,0.0010217588,0.020705147],"study_design_scores_gemma":[0.000009529917,0.0000042032393,0.000020765308,0.0000022770707,0.0000016493717,0.000002841454,0.0000029481682,0.99439186,0.00015554688,0.005092344,0.0003145764,0.0000014847922],"about_ca_topic_score_codex":0.019716045,"about_ca_topic_score_gemma":0.01934121,"teacher_disagreement_score":0.019716045,"about_ca_system_score_codex":0.0023997084,"about_ca_system_score_gemma":0.0020123722,"threshold_uncertainty_score":0.03920257},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30061176,0.0024123562,0.6536698,0.0025942554,0.0002457485,0.00007920159,0.00028615954,0.0001657573,0.03993494],"genre_scores_gemma":[0.91820025,0.0016252142,0.07057031,0.00025249142,0.00022864627,0.00018092376,0.000330091,0.00011394277,0.008498079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991437,0.00021750745,0.000048873204,0.00021529922,0.0002514955,0.0001230207],"domain_scores_gemma":[0.99424404,0.0039040614,0.0006250523,0.00025901585,0.00044595497,0.0005217868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021205603,0.0011863563,0.0005557884,0.0016347163,0.00072394003,0.0019940168,0.0010526583,0.0009180243,0.004460278],"category_scores_gemma":[0.0125785805,0.0005743401,0.00045194005,0.0006498759,0.0030105724,0.0038764917,0.0024290208,0.0023456942,0.00045697083],"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.00012148509,0.000032496668,0.0017077443,0.00015982904,0.000029483546,0.00013127645,0.00015608773,0.027419886,0.012585477,0.9394907,0.0013994103,0.01676629],"study_design_scores_gemma":[0.000016371423,0.00009141868,0.0019573923,0.000092994975,0.000027635435,0.0001879525,0.00027127334,0.27485615,0.009132588,0.70891935,0.0043938966,0.000052884156],"about_ca_topic_score_codex":0.000584265,"about_ca_topic_score_gemma":0.00060915895,"teacher_disagreement_score":0.004460278,"about_ca_system_score_codex":0.0015115343,"about_ca_system_score_gemma":0.00087915675,"threshold_uncertainty_score":0.014921129},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019882677,0.0005438811,0.97466403,0.0005194562,0.0000952133,0.00008585757,0.000050138005,0.00010557954,0.004053162],"genre_scores_gemma":[0.5576172,0.0015256825,0.42165154,0.0005825167,0.000394952,0.0008183096,0.000355194,0.0006742513,0.016380304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9935548,0.0043597,0.00024576293,0.00059385,0.0008669839,0.00037885134],"domain_scores_gemma":[0.96911645,0.024174836,0.0012751477,0.0017561488,0.0024323938,0.0012449593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.016296973,0.0034629658,0.0032572714,0.0025883855,0.0010870524,0.003050711,0.004082157,0.004420808,0.0041900417],"category_scores_gemma":[0.06070603,0.0019494143,0.002603122,0.0017947057,0.0063276356,0.005811766,0.0111683,0.0062627792,0.0008904104],"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.0007351154,0.00016152192,0.0008071061,0.0004596849,0.00022841869,0.0001659371,0.0004041333,0.6631858,0.0031175688,0.2984458,0.0021028805,0.030186024],"study_design_scores_gemma":[0.000046862453,0.00015903333,0.00014087303,0.000045873683,0.000028718494,0.000061034476,0.00004836741,0.90491253,0.00078550976,0.09300383,0.00073847605,0.000028861818],"about_ca_topic_score_codex":0.0018110133,"about_ca_topic_score_gemma":0.0011359103,"teacher_disagreement_score":0.016296973,"about_ca_system_score_codex":0.0015330599,"about_ca_system_score_gemma":0.003084595,"threshold_uncertainty_score":0.08618766},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003209185,0.00017925532,0.99538934,0.00009770977,0.00005022009,0.000029084316,0.000008754501,0.00005992654,0.0009765114],"genre_scores_gemma":[0.16343005,0.00061209645,0.8319342,0.00016317864,0.0001313778,0.00026145295,0.00007767549,0.00013168665,0.0032583573],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943167,0.0002831059,0.00003511407,0.00004985122,0.00016493561,0.000035282785],"domain_scores_gemma":[0.9993056,0.0003274135,0.000082936305,0.00007448734,0.00015435136,0.000055202363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017059109,0.0012068707,0.0009500273,0.00074381696,0.0003288613,0.00057715253,0.0013727256,0.0010661844,0.00198119],"category_scores_gemma":[0.0038119347,0.00040150934,0.0006886766,0.00061989325,0.00089209224,0.0013456772,0.0014069531,0.0015866372,0.00043319789],"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.00019918525,0.0001310585,0.00061044516,0.00044861433,0.000087640634,0.00031173433,0.00023063053,0.60066175,0.018916797,0.23376594,0.0033452474,0.14129096],"study_design_scores_gemma":[0.000011640578,0.000052279618,0.00008837431,0.00001162693,0.0000039568376,0.000030336665,0.0000069817056,0.98902285,0.0013554889,0.008039283,0.00136662,0.000010490631],"about_ca_topic_score_codex":0.001371347,"about_ca_topic_score_gemma":0.0018606164,"teacher_disagreement_score":0.00198119,"about_ca_system_score_codex":0.00049443945,"about_ca_system_score_gemma":0.0009453474,"threshold_uncertainty_score":0.009021819},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068515386,0.00011142058,0.9922692,0.000063423264,0.000023203369,0.000021582033,0.000004333065,0.000026416319,0.00062880147],"genre_scores_gemma":[0.31735379,0.00028050644,0.67843294,0.000088739194,0.000044696764,0.00027452013,0.000042279073,0.00005903575,0.0034235409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99935895,0.0002059046,0.00004182603,0.00013773813,0.0002039417,0.000051619198],"domain_scores_gemma":[0.9994336,0.00026084945,0.0000836034,0.000048784917,0.00011779977,0.000055285986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001777762,0.0007734571,0.0011003588,0.00082425907,0.00063828344,0.000938872,0.0016165159,0.0014929532,0.0010233124],"category_scores_gemma":[0.0024734584,0.00047183144,0.0014487747,0.00044478933,0.0013984685,0.00196478,0.0021005236,0.0016380682,0.0001587827],"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.00015579282,0.000115194656,0.0018136255,0.0003665226,0.00022458314,0.0004189272,0.0006259433,0.48766962,0.036079455,0.40091044,0.00071655645,0.07090331],"study_design_scores_gemma":[0.000013082995,0.00006198855,0.00007161275,0.000016916161,0.000016803624,0.00006338605,0.000021180944,0.98281604,0.0020868462,0.013463519,0.0013529613,0.000015651009],"about_ca_topic_score_codex":0.0018365425,"about_ca_topic_score_gemma":0.0012890772,"teacher_disagreement_score":0.0018365425,"about_ca_system_score_codex":0.000780292,"about_ca_system_score_gemma":0.0011721043,"threshold_uncertainty_score":0.009401858},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008838959,0.00022014113,0.98888344,0.000102747406,0.00006255346,0.000055966666,0.000012852719,0.000080364436,0.0017429086],"genre_scores_gemma":[0.46566948,0.00065493636,0.5251961,0.00019605228,0.00014039889,0.00040518196,0.000103413724,0.000118533775,0.007515835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996718,0.000120794044,0.000025059977,0.000041007468,0.00010870692,0.000032690667],"domain_scores_gemma":[0.9997297,0.00012385898,0.000027996279,0.00002488191,0.0000649524,0.000028592076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012768686,0.0009697755,0.0009025206,0.0005500485,0.00035414522,0.0005560939,0.00094757794,0.00079079525,0.00194815],"category_scores_gemma":[0.0013326419,0.0003703114,0.00084516767,0.00034667063,0.00067011063,0.00085617765,0.0010427997,0.0011979521,0.00025540157],"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.00021705641,0.00013360885,0.00094375334,0.0005222474,0.0001225291,0.000330048,0.0002849773,0.68998396,0.024746543,0.1316519,0.0024062565,0.14865711],"study_design_scores_gemma":[0.000007960009,0.000037206886,0.00005622853,0.0000067531946,0.0000038536164,0.000014363505,0.0000050963004,0.9960737,0.00081379025,0.002345137,0.00063179026,0.0000041989206],"about_ca_topic_score_codex":0.0027493043,"about_ca_topic_score_gemma":0.0026477189,"teacher_disagreement_score":0.0027493043,"about_ca_system_score_codex":0.0005643459,"about_ca_system_score_gemma":0.0010919283,"threshold_uncertainty_score":0.006752789},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004080097,0.00013925004,0.994866,0.000048734317,0.00003294018,0.000027950584,0.0000067417586,0.00005426631,0.00074402377],"genre_scores_gemma":[0.20892356,0.00042482407,0.7862891,0.000090277514,0.000088576664,0.0003859209,0.00009224914,0.00010310459,0.003602304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994711,0.00018440658,0.000029853618,0.00007928665,0.00018118785,0.00005401417],"domain_scores_gemma":[0.99899143,0.00044800594,0.00010894324,0.000111003625,0.00027343986,0.00006712348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012824861,0.000930864,0.00086264266,0.0005596339,0.0005077941,0.0006914905,0.0014891047,0.0011023812,0.0030940878],"category_scores_gemma":[0.0032724768,0.00039683463,0.0009088451,0.00059383945,0.00092349784,0.0011589625,0.0017475504,0.0020064702,0.0004531399],"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.00021266112,0.000097936274,0.0007927449,0.0003348371,0.00009724355,0.00020544704,0.00033694328,0.60980356,0.008875846,0.19785959,0.0029923818,0.17839073],"study_design_scores_gemma":[0.000016186252,0.000049971077,0.00005141832,0.000009290242,0.000006751309,0.000044831817,0.000014572331,0.9850064,0.001251294,0.012020891,0.0015173454,0.00001102401],"about_ca_topic_score_codex":0.0016311475,"about_ca_topic_score_gemma":0.0017757777,"teacher_disagreement_score":0.0030940878,"about_ca_system_score_codex":0.00051676016,"about_ca_system_score_gemma":0.0014733031,"threshold_uncertainty_score":0.010350704},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004272792,0.0001861103,0.9949037,0.00006715361,0.000029076311,0.000017070683,0.0000037403267,0.000042641328,0.0004776122],"genre_scores_gemma":[0.20419508,0.00072496035,0.7909614,0.00008180389,0.000116473406,0.00024909273,0.00006576701,0.000099362056,0.003506109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999435,0.00020228725,0.00003122209,0.000090887,0.00020882877,0.000031779622],"domain_scores_gemma":[0.99930847,0.00035968426,0.000058287522,0.000047029724,0.00019556795,0.00003094833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016285263,0.001008428,0.0013986662,0.0008124131,0.0004896692,0.00061072153,0.0011321823,0.0015414248,0.0016906486],"category_scores_gemma":[0.0025107886,0.00044683687,0.0010486785,0.0006928771,0.00093128846,0.001092035,0.001178007,0.0017276971,0.000311082],"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.00013395105,0.00008156286,0.0005922464,0.00026742872,0.00012057199,0.00023409138,0.00020386119,0.7508008,0.016990388,0.09851622,0.0016576579,0.13040122],"study_design_scores_gemma":[0.000010279839,0.00004424035,0.00005625031,0.000006010238,0.0000066445346,0.000053473625,0.0000068837894,0.9914205,0.0009551779,0.006351543,0.0010801748,0.000008916096],"about_ca_topic_score_codex":0.0014840864,"about_ca_topic_score_gemma":0.0011138837,"teacher_disagreement_score":0.0016906486,"about_ca_system_score_codex":0.00046180366,"about_ca_system_score_gemma":0.0007592693,"threshold_uncertainty_score":0.008612633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34694198,0.0010224384,0.6132847,0.007849054,0.0001606304,0.0002539549,0.0009432969,0.0002779412,0.029265944],"genre_scores_gemma":[0.90990156,0.0005546902,0.08513507,0.0002964534,0.00015262181,0.0002769286,0.0004631073,0.00012993078,0.0030896326],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99619055,0.0016562751,0.00017967219,0.00058841717,0.0009202121,0.0004648065],"domain_scores_gemma":[0.97671276,0.019796558,0.0011186788,0.0011902018,0.00067764486,0.00050410785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003513735,0.00076263974,0.0015537936,0.0006848805,0.0010522747,0.0038324143,0.0016508735,0.0017271264,0.0033349],"category_scores_gemma":[0.020278824,0.0007831081,0.0014204335,0.0012435325,0.0018028687,0.006616816,0.0023108656,0.0038294573,0.0002744107],"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.00051761017,0.00023092996,0.0036090568,0.00033434536,0.00010130812,0.00041435516,0.00032741405,0.7072367,0.0026058902,0.25545025,0.0032874832,0.025884656],"study_design_scores_gemma":[0.00003772672,0.000027465732,0.00040802546,0.00001761092,0.000013875789,0.0000778369,0.00006395597,0.76471746,0.00053908693,0.23328769,0.000796027,0.000013246683],"about_ca_topic_score_codex":0.0020701913,"about_ca_topic_score_gemma":0.0019311374,"teacher_disagreement_score":0.0038324143,"about_ca_system_score_codex":0.0026071079,"about_ca_system_score_gemma":0.002258551,"threshold_uncertainty_score":0.018915951},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015372112,0.00009439461,0.9973883,0.0000629241,0.000021561556,0.000021888447,0.000007643299,0.000031132815,0.0008349774],"genre_scores_gemma":[0.10740521,0.0004520084,0.8852922,0.00016454006,0.00010215238,0.00023791287,0.00010673508,0.00012951554,0.0061097937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928385,0.0002960116,0.00002606986,0.00011026895,0.00023998812,0.00004381183],"domain_scores_gemma":[0.9995499,0.00016724452,0.000034591645,0.00005010302,0.00014510126,0.000053005857],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014919313,0.0010090484,0.0010665745,0.0008420869,0.00069932884,0.0007238628,0.0017292423,0.0016487513,0.0029991814],"category_scores_gemma":[0.001859516,0.0005034548,0.00096620544,0.00087931374,0.0011791779,0.001580198,0.0020625766,0.0024760102,0.00085318304],"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.00015478628,0.00013308373,0.00044692977,0.00043979037,0.00012460233,0.00022205737,0.0003483972,0.5443277,0.018574804,0.2331224,0.0044184444,0.19768701],"study_design_scores_gemma":[0.000012244785,0.000065447566,0.00006107259,0.000012877808,0.000008962193,0.000058060803,0.000016469961,0.97642994,0.0015065458,0.01897199,0.0028401571,0.000016356089],"about_ca_topic_score_codex":0.0015329344,"about_ca_topic_score_gemma":0.0014199284,"teacher_disagreement_score":0.0029991814,"about_ca_system_score_codex":0.0006664393,"about_ca_system_score_gemma":0.0015733248,"threshold_uncertainty_score":0.01003325},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02148288,0.0002690605,0.97400814,0.00021664529,0.000039554172,0.000041831438,0.000011302909,0.000024937515,0.0039057322],"genre_scores_gemma":[0.6079707,0.0007969506,0.37888172,0.00020027044,0.00011927349,0.00037136598,0.000096218355,0.00008259155,0.011480803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991757,0.00037386292,0.000038160753,0.0001473089,0.00019787846,0.0000670974],"domain_scores_gemma":[0.999209,0.0004916695,0.000072095885,0.00004388122,0.00012752171,0.000055818702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023274114,0.0009146293,0.0008988262,0.00066574867,0.0007414575,0.0009838392,0.0008975599,0.0014042318,0.0030279444],"category_scores_gemma":[0.003533649,0.0003636173,0.0009838701,0.0004929082,0.0025528532,0.0028291673,0.0021753523,0.0022028426,0.00035420497],"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.00004725335,0.000044469612,0.0003763095,0.00017083334,0.000030126743,0.00025112863,0.00041076963,0.21333478,0.0061071096,0.75757563,0.0005653348,0.021086177],"study_design_scores_gemma":[0.000021829797,0.00008195114,0.00014158443,0.000027652115,0.000008871698,0.00012527451,0.0001371497,0.74545115,0.0019490999,0.24979998,0.0022351793,0.000020208488],"about_ca_topic_score_codex":0.0011304219,"about_ca_topic_score_gemma":0.00088434806,"teacher_disagreement_score":0.0030279444,"about_ca_system_score_codex":0.0007435009,"about_ca_system_score_gemma":0.0009287573,"threshold_uncertainty_score":0.012308657},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075951978,0.0015483722,0.98154944,0.00045858487,0.00015780567,0.000033922566,0.000056013672,0.0000348206,0.008565798],"genre_scores_gemma":[0.48294973,0.0069122366,0.47911987,0.0007108591,0.00084503234,0.00034915993,0.00027432106,0.00022519265,0.028613582],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984028,0.0007217129,0.00010681142,0.00020918487,0.00047015477,0.00008946568],"domain_scores_gemma":[0.9975746,0.001343008,0.00018909598,0.00017940524,0.0005349007,0.00017899183],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004678737,0.0012447278,0.0011255714,0.0016570464,0.00062967336,0.0020369785,0.0009277588,0.0007693164,0.0029363488],"category_scores_gemma":[0.005604437,0.00052061,0.001690326,0.001376857,0.0028081401,0.0029349155,0.002939345,0.0038732637,0.0005012201],"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.000014606263,0.000016210966,0.00011762218,0.000097152144,0.000025824342,0.000063290136,0.00011298105,0.013446313,0.001780233,0.9729514,0.0007803406,0.010593879],"study_design_scores_gemma":[0.000014552282,0.000114434944,0.00033381567,0.00004871079,0.000021193566,0.0001448526,0.00006216133,0.20492673,0.0013579265,0.7808544,0.012100118,0.000021137976],"about_ca_topic_score_codex":0.0011515443,"about_ca_topic_score_gemma":0.0010147396,"teacher_disagreement_score":0.004678737,"about_ca_system_score_codex":0.0015032822,"about_ca_system_score_gemma":0.0013754155,"threshold_uncertainty_score":0.024743855},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005257656,0.00006398459,0.99364674,0.000049097445,0.000020890266,0.00002745277,0.000008247551,0.000065661865,0.0008602305],"genre_scores_gemma":[0.17274995,0.00016226122,0.8234316,0.000115486866,0.00004075597,0.0002904375,0.00008966387,0.000068586705,0.0030513448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999366,0.0002505631,0.000035749283,0.00008393638,0.00023013697,0.000033645854],"domain_scores_gemma":[0.99935335,0.00029240927,0.000073271294,0.000071468516,0.00017038376,0.00003910382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012237016,0.00068154477,0.0007611144,0.00045878018,0.00029126313,0.000610359,0.0017841342,0.0012184127,0.001640215],"category_scores_gemma":[0.0021516166,0.0004615196,0.0009881727,0.00041004817,0.0008698757,0.0008385661,0.0012423458,0.0010726552,0.00040833224],"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.000120290184,0.000064380314,0.0005869779,0.00023098127,0.00012998658,0.00013332393,0.00020680558,0.84203213,0.023172224,0.039537363,0.0012535171,0.09253204],"study_design_scores_gemma":[0.000008942154,0.00004418604,0.00004004657,0.000005073349,0.0000036274812,0.000023701343,0.000004373016,0.9969566,0.0009900356,0.0014069586,0.00050880865,0.000007692513],"about_ca_topic_score_codex":0.0023227702,"about_ca_topic_score_gemma":0.0015595069,"teacher_disagreement_score":0.0023227702,"about_ca_system_score_codex":0.00045819953,"about_ca_system_score_gemma":0.0010079368,"threshold_uncertainty_score":0.006471634},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01406252,0.00014421898,0.9820711,0.00014619298,0.000037215817,0.000045038614,0.000010318466,0.000030283554,0.0034531385],"genre_scores_gemma":[0.44491237,0.00031410815,0.5482279,0.000106531945,0.00006230164,0.00035455695,0.00006491413,0.000061465274,0.005895946],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956805,0.00017132527,0.00002420177,0.000051773583,0.00014817779,0.000036371865],"domain_scores_gemma":[0.99958915,0.00021175752,0.000054582106,0.00004374525,0.000059429687,0.000041276402],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019672334,0.00055768364,0.000621024,0.00050865836,0.00048691678,0.0007825039,0.0012968879,0.0012367318,0.00177639],"category_scores_gemma":[0.0026443428,0.0003014429,0.0006867504,0.00030073102,0.0014711482,0.0012693971,0.002202849,0.0014461336,0.0002626209],"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.0000777741,0.000047928712,0.00045086307,0.00012826108,0.000033507215,0.00008554246,0.0002875505,0.35569417,0.010647226,0.60174596,0.00054564216,0.030255461],"study_design_scores_gemma":[0.000010310061,0.00005052037,0.000060466056,0.00000983869,0.0000029631676,0.000014515701,0.000014818128,0.9777374,0.00072678423,0.020124547,0.0012393561,0.000008360856],"about_ca_topic_score_codex":0.0017127922,"about_ca_topic_score_gemma":0.001447313,"teacher_disagreement_score":0.0019672334,"about_ca_system_score_codex":0.000823775,"about_ca_system_score_gemma":0.000992738,"threshold_uncertainty_score":0.010403872},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049206298,0.00066319713,0.9446821,0.00034528988,0.000042371696,0.000036415902,0.000049304843,0.00005543899,0.004919501],"genre_scores_gemma":[0.78640646,0.0016701845,0.20525132,0.00028926093,0.00012413356,0.00022022627,0.000216976,0.000119228345,0.00570228],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987179,0.00047177234,0.0001079651,0.00018817023,0.00043371023,0.000080413934],"domain_scores_gemma":[0.99832517,0.00070256006,0.00026595785,0.000112947484,0.00048712207,0.0001062683],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025736047,0.000759692,0.00086584775,0.0011053187,0.0005444434,0.0016921889,0.00079322135,0.00064122817,0.0014507725],"category_scores_gemma":[0.0072483076,0.00038283676,0.0008734588,0.00088806596,0.0016552417,0.002622245,0.00211746,0.0018186624,0.00017795847],"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.000077403325,0.0000525106,0.00093847624,0.00032832244,0.00005976271,0.000117636155,0.00041737553,0.079145215,0.01858285,0.8538364,0.000814784,0.04562926],"study_design_scores_gemma":[0.000015784119,0.0002121384,0.0006539251,0.00007639164,0.00002488178,0.00017308579,0.00017419693,0.57183015,0.0067418762,0.4161835,0.0038826894,0.000031329157],"about_ca_topic_score_codex":0.0005855101,"about_ca_topic_score_gemma":0.00040639137,"teacher_disagreement_score":0.0025736047,"about_ca_system_score_codex":0.00083935313,"about_ca_system_score_gemma":0.0009980852,"threshold_uncertainty_score":0.013610721},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031770861,0.00024075204,0.99574924,0.000097585085,0.000030388966,0.000019956997,0.000004739262,0.000044123266,0.00063606806],"genre_scores_gemma":[0.19469227,0.00088674505,0.80117285,0.00014295994,0.0001520505,0.00016778485,0.000057046185,0.000109236236,0.002619107],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953985,0.00013905545,0.00002864155,0.00008179257,0.00017385396,0.000036869256],"domain_scores_gemma":[0.99867874,0.0007572211,0.0002028773,0.00009670371,0.00018300876,0.00008151769],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016114071,0.0009771702,0.00086923904,0.0010598908,0.0005465947,0.0008373529,0.0010966894,0.0011778168,0.0020873027],"category_scores_gemma":[0.0056613362,0.00045344213,0.00069999567,0.0007620295,0.0016726094,0.0022509957,0.0017701817,0.0018250515,0.00029993072],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019245173,0.00008912768,0.000699018,0.00032270045,0.00007167514,0.00014070954,0.00031888613,0.4277189,0.011380943,0.30170888,0.002280795,0.2550759],"study_design_scores_gemma":[0.000014708985,0.000069559515,0.00008608225,0.000017336843,0.0000096126205,0.00006334252,0.000021919019,0.9688399,0.002099131,0.026949026,0.0018081063,0.000021310407],"about_ca_topic_score_codex":0.0012608027,"about_ca_topic_score_gemma":0.0011210862,"teacher_disagreement_score":0.0020873027,"about_ca_system_score_codex":0.0005402106,"about_ca_system_score_gemma":0.0008239191,"threshold_uncertainty_score":0.008522034},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4404925,0.0039990274,0.4977426,0.001828433,0.00020652369,0.00010554286,0.00032295095,0.00018421444,0.055118226],"genre_scores_gemma":[0.95303863,0.0022806837,0.03606757,0.0001894465,0.00026458222,0.00011184744,0.00022730631,0.000078676116,0.007741224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986407,0.00020596727,0.000065423024,0.0003055802,0.00056818215,0.00021407282],"domain_scores_gemma":[0.99334526,0.0043646083,0.0006296536,0.00041110427,0.000819459,0.00043001096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002348633,0.0007874093,0.0015395903,0.0032052181,0.0022291213,0.003312399,0.0013146608,0.0017959516,0.0032004367],"category_scores_gemma":[0.009851917,0.0006380776,0.0017263152,0.0015515338,0.0056771496,0.0061396426,0.003973802,0.0034679063,0.00022904786],"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.000043339915,0.000022840099,0.0007914002,0.00011426258,0.000038020804,0.00026338417,0.00032047692,0.0061413203,0.003760944,0.9824441,0.00031857786,0.005741247],"study_design_scores_gemma":[0.00004446017,0.00017064581,0.0019410055,0.00010240804,0.00007732163,0.0009245107,0.00026914262,0.049984187,0.0047199354,0.93449426,0.007199447,0.000072680676],"about_ca_topic_score_codex":0.00132793,"about_ca_topic_score_gemma":0.0006264503,"teacher_disagreement_score":0.003312399,"about_ca_system_score_codex":0.0015650241,"about_ca_system_score_gemma":0.0007239184,"threshold_uncertainty_score":0.012420893},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021868953,0.000070364316,0.99658835,0.000060821116,0.000032752414,0.00004393504,0.000019934138,0.00010577843,0.0008912293],"genre_scores_gemma":[0.11269408,0.00015866822,0.88356495,0.00023168401,0.00008801603,0.0004826228,0.00025410496,0.00017035089,0.0023556259],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99875915,0.00042963485,0.00008953611,0.0002220326,0.0003811403,0.000118484255],"domain_scores_gemma":[0.9985089,0.0007215659,0.000120356555,0.00016304597,0.00037315153,0.000113038644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020810498,0.0009259281,0.001237879,0.0009162176,0.00060938654,0.0008672531,0.0022792015,0.0015584988,0.0069051953],"category_scores_gemma":[0.004932131,0.00058540684,0.0009277022,0.0010575394,0.0010132882,0.0021259382,0.0025119642,0.0026668531,0.0012553451],"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.0005058416,0.00019939974,0.00070880173,0.00043360566,0.00008809108,0.00021394082,0.00023335281,0.62457186,0.010258857,0.107199565,0.0079652,0.24762145],"study_design_scores_gemma":[0.00007985657,0.000114985014,0.00010215262,0.000017727745,0.000010246313,0.00006111702,0.00001997496,0.98487073,0.0012443414,0.011010227,0.0024468654,0.000021825554],"about_ca_topic_score_codex":0.003164142,"about_ca_topic_score_gemma":0.0022332433,"teacher_disagreement_score":0.0069051953,"about_ca_system_score_codex":0.0005260384,"about_ca_system_score_gemma":0.0021947937,"threshold_uncertainty_score":0.023100197},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014608587,0.00009370333,0.9975802,0.00003703401,0.000020334304,0.000023522049,0.000006999116,0.000048206515,0.0007290455],"genre_scores_gemma":[0.13621865,0.0007160047,0.85828,0.00015705079,0.00010597482,0.0003893489,0.00012498717,0.00008169279,0.003926197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962187,0.000113036716,0.00001798613,0.000063019856,0.0001565173,0.00002754686],"domain_scores_gemma":[0.9997638,0.00010887867,0.000020026455,0.000018521989,0.00006782968,0.000020999114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007102269,0.0006816117,0.0007895262,0.00041291874,0.0003948642,0.0005224536,0.00104314,0.000718923,0.00205901],"category_scores_gemma":[0.0009810205,0.00038489388,0.0007377836,0.0005594671,0.00059459667,0.0008996543,0.0013573924,0.0013614097,0.00052130374],"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.00013637675,0.00012768,0.0009936794,0.0005939787,0.00020431266,0.0002513733,0.00019197754,0.5587026,0.024432184,0.12942044,0.00421621,0.28072914],"study_design_scores_gemma":[0.000013162429,0.000041854135,0.000058641817,0.000008918155,0.000008532426,0.000053045653,0.0000067837527,0.9924744,0.0011760525,0.004568683,0.0015819488,0.000007885977],"about_ca_topic_score_codex":0.0022986599,"about_ca_topic_score_gemma":0.0019578245,"teacher_disagreement_score":0.0022986599,"about_ca_system_score_codex":0.00029606605,"about_ca_system_score_gemma":0.0014691848,"threshold_uncertainty_score":0.0068880916},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036287107,0.00038746945,0.9535377,0.00030024038,0.000021200827,0.00004098197,0.000053700616,0.000040466603,0.0093310755],"genre_scores_gemma":[0.774447,0.0009142854,0.21352777,0.00020575678,0.00010352931,0.00033219228,0.00026287496,0.00011648209,0.010090173],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986487,0.00060263503,0.000050235893,0.00016961682,0.00040309396,0.0001257083],"domain_scores_gemma":[0.99715376,0.0021064493,0.00024908982,0.00015874178,0.00022262993,0.00010937164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025192555,0.00082677073,0.0009318281,0.0009734037,0.0007177712,0.0020460044,0.0011543812,0.0010480044,0.0037151973],"category_scores_gemma":[0.008121985,0.00039530452,0.0010108203,0.0011283755,0.0019516365,0.003550383,0.0027044974,0.0022803943,0.0002985428],"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.000050855422,0.00004052101,0.00047795576,0.00010654952,0.000032990225,0.000062564875,0.00017516273,0.13876945,0.0019588843,0.8426737,0.00048779903,0.015163556],"study_design_scores_gemma":[0.0000099074,0.00007306203,0.00016972324,0.00003623396,0.000014502384,0.00004509716,0.00007023742,0.61514735,0.0014086608,0.38069686,0.0023171806,0.000011142929],"about_ca_topic_score_codex":0.0008073344,"about_ca_topic_score_gemma":0.00073146744,"teacher_disagreement_score":0.0037151973,"about_ca_system_score_codex":0.0014736833,"about_ca_system_score_gemma":0.00073251314,"threshold_uncertainty_score":0.013323247},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005364522,0.00007666271,0.9935163,0.000050113304,0.000025599351,0.000040361945,0.0000068345807,0.000039397153,0.0008801591],"genre_scores_gemma":[0.22165719,0.00023401066,0.77392,0.00010011429,0.000052844836,0.000506022,0.00008067649,0.00008302195,0.0033661833],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997023,0.00008195726,0.000018982857,0.00004929905,0.00012253126,0.000025031457],"domain_scores_gemma":[0.999607,0.00018501407,0.00004103865,0.0000309199,0.00009538624,0.000040764007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012144159,0.0008865974,0.000947545,0.00061594014,0.00056488306,0.00052655936,0.00154968,0.0012658228,0.0018047033],"category_scores_gemma":[0.0016577677,0.00044277,0.00070532423,0.00036340833,0.0009352098,0.0012492868,0.0017749167,0.0012678782,0.0003449436],"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.00021586822,0.00020725126,0.0011607856,0.00048671756,0.0000974572,0.0002563546,0.00037851813,0.65655273,0.033771906,0.15993263,0.0019359061,0.14500391],"study_design_scores_gemma":[0.00001254313,0.000053394007,0.00004207106,0.000008635447,0.0000054832267,0.000024651881,0.000011057487,0.9913123,0.0011359901,0.006669461,0.0007176324,0.000006708625],"about_ca_topic_score_codex":0.0015211978,"about_ca_topic_score_gemma":0.0017131494,"teacher_disagreement_score":0.0018047033,"about_ca_system_score_codex":0.0003876542,"about_ca_system_score_gemma":0.0011213762,"threshold_uncertainty_score":0.0064225197},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011167843,0.0015475049,0.97708285,0.0004085444,0.00011176697,0.000044840282,0.000048729402,0.000028982944,0.009559015],"genre_scores_gemma":[0.44511133,0.0050616777,0.5303147,0.000493879,0.000536499,0.00033767355,0.000169842,0.00017486543,0.01779955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982774,0.0006092191,0.00014697967,0.00023516154,0.00062699936,0.00010418535],"domain_scores_gemma":[0.9979054,0.001186388,0.00015997703,0.00019332558,0.00042652368,0.00012851048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051086564,0.00092654896,0.0011382906,0.0022318445,0.00093698426,0.0022134536,0.0010116155,0.0008252583,0.002098819],"category_scores_gemma":[0.0068080863,0.0004286624,0.002086845,0.0017326016,0.003194207,0.003422519,0.0025239862,0.0034780507,0.00036737658],"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.000004124897,0.000009484933,0.00009706802,0.00003797843,0.000012696964,0.000043322005,0.00010394074,0.0069905613,0.0006625152,0.9850679,0.00022308457,0.006747186],"study_design_scores_gemma":[0.000006922636,0.000029577071,0.00017476645,0.000027354397,0.000014308607,0.00008867525,0.000052635438,0.09055965,0.0006360054,0.90204084,0.006355489,0.000013747389],"about_ca_topic_score_codex":0.0011525847,"about_ca_topic_score_gemma":0.0008986387,"teacher_disagreement_score":0.0051086564,"about_ca_system_score_codex":0.00185061,"about_ca_system_score_gemma":0.0012205946,"threshold_uncertainty_score":0.027017474},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039055215,0.00022514001,0.99453944,0.00019011793,0.000025780975,0.000029590214,0.000015665311,0.000026894038,0.0010418559],"genre_scores_gemma":[0.4667074,0.0011241226,0.5249774,0.00024887905,0.00016772187,0.00052910304,0.00017537903,0.00014552125,0.005924487],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991091,0.00042603345,0.000040647723,0.00014276731,0.00021840137,0.00006308161],"domain_scores_gemma":[0.9987582,0.0007866797,0.00011979828,0.00007439274,0.000192644,0.00006835365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00224426,0.0013163979,0.0011704994,0.0006434752,0.00041799524,0.0011011232,0.001320518,0.0015131019,0.0018553972],"category_scores_gemma":[0.0049496577,0.00056400633,0.000932951,0.0006304032,0.0014034765,0.0021949522,0.001930136,0.0023110623,0.00033775877],"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.000120860896,0.00006607925,0.0005826265,0.00035420794,0.00006848415,0.00019219771,0.00019580968,0.7235742,0.004700701,0.2287972,0.002176154,0.03917141],"study_design_scores_gemma":[0.0000062371805,0.000018904908,0.00003081805,0.000007068258,0.0000028424063,0.000014726206,0.000007915379,0.9880022,0.0002997291,0.011184815,0.0004216868,0.0000030311035],"about_ca_topic_score_codex":0.0019991742,"about_ca_topic_score_gemma":0.0011064411,"teacher_disagreement_score":0.00224426,"about_ca_system_score_codex":0.0007779014,"about_ca_system_score_gemma":0.0011513338,"threshold_uncertainty_score":0.011868954},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01361008,0.00012851972,0.98531705,0.000060557788,0.000011250928,0.0000150001415,0.0000053397857,0.000017281829,0.0008349705],"genre_scores_gemma":[0.6278958,0.00037967588,0.36706895,0.00006247526,0.00004344228,0.00021946958,0.000057679412,0.000064106796,0.004208455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913317,0.00029886002,0.000044329747,0.00018534357,0.00027682612,0.000061495644],"domain_scores_gemma":[0.9990828,0.0005230247,0.00013159862,0.00006522972,0.00014295318,0.000054368204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025341408,0.0011534524,0.0012102553,0.00080535805,0.0004738265,0.0009897071,0.0014540671,0.001694083,0.0015064477],"category_scores_gemma":[0.003947414,0.00047575767,0.001186878,0.0006244081,0.0018402307,0.0019881355,0.0028518506,0.0014546729,0.00019854205],"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.0001009406,0.00005361278,0.00091350224,0.00028586652,0.00008828984,0.00029289583,0.0003465153,0.78021854,0.008919471,0.1712763,0.0004573958,0.037046712],"study_design_scores_gemma":[0.00000480128,0.00003058737,0.000050998133,0.00000944495,0.0000047749418,0.000028586033,0.000023481221,0.98367983,0.0010258264,0.01483923,0.00029691524,0.0000055464084],"about_ca_topic_score_codex":0.0011464068,"about_ca_topic_score_gemma":0.0007422288,"teacher_disagreement_score":0.0025341408,"about_ca_system_score_codex":0.0007948588,"about_ca_system_score_gemma":0.000837868,"threshold_uncertainty_score":0.013401926},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029727514,0.00035943254,0.9953707,0.000069752175,0.000067611996,0.000029515331,0.000012609972,0.00009738347,0.0010203681],"genre_scores_gemma":[0.27228376,0.0015497816,0.72049254,0.00025069618,0.00023312718,0.00028596754,0.000232357,0.0002466695,0.004425177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992768,0.0002703412,0.00006280944,0.00009444121,0.0002266093,0.00006905047],"domain_scores_gemma":[0.999424,0.00024366954,0.0000568442,0.00006438,0.00016732857,0.000043934928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014962801,0.001396854,0.001522265,0.0006415536,0.0003959613,0.001266395,0.0017126456,0.0010455238,0.0019957304],"category_scores_gemma":[0.0032122412,0.0005608815,0.0009079908,0.0007796877,0.0008501751,0.0019113536,0.0015506992,0.0021276767,0.0006519212],"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.00020848111,0.00010506409,0.00056423055,0.0004740234,0.00010311168,0.00012660777,0.00020877158,0.7081899,0.0069025694,0.088406965,0.0033818,0.19132847],"study_design_scores_gemma":[0.0000110556775,0.00003295071,0.00004682561,0.000009360461,0.0000043161867,0.000013223108,0.0000068958066,0.99350643,0.00056829385,0.0045330115,0.0012616009,0.0000060419948],"about_ca_topic_score_codex":0.002757827,"about_ca_topic_score_gemma":0.0023163059,"teacher_disagreement_score":0.002757827,"about_ca_system_score_codex":0.0005691401,"about_ca_system_score_gemma":0.0012189146,"threshold_uncertainty_score":0.007913232},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07572009,0.00064043363,0.91358644,0.0005678494,0.00006664641,0.00010532456,0.000097314856,0.00012936325,0.009086526],"genre_scores_gemma":[0.9367571,0.0008137323,0.056820057,0.00028854143,0.000081831175,0.00033627736,0.00014579402,0.00016607414,0.0045906017],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979547,0.0008175305,0.00010522493,0.00032642906,0.00058770063,0.00020843161],"domain_scores_gemma":[0.98351884,0.012717637,0.000990154,0.0005166767,0.0017466551,0.0005100364],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005219885,0.0012254874,0.0012926193,0.002870966,0.0010950759,0.0025287769,0.0011766461,0.0016086111,0.0028257847],"category_scores_gemma":[0.028721852,0.0006856906,0.0011449493,0.0010307054,0.004382838,0.004735908,0.0031457923,0.0037750225,0.00021094519],"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.00012009811,0.000058972775,0.0011320192,0.00020762971,0.000059992763,0.00025511434,0.0004944464,0.11114663,0.011785797,0.8586597,0.0006926428,0.015387037],"study_design_scores_gemma":[0.000010637714,0.00007159141,0.00052105344,0.000049567883,0.000012683722,0.00010155743,0.0000947434,0.69290656,0.0041693263,0.30115628,0.00086774986,0.000038325787],"about_ca_topic_score_codex":0.0023180887,"about_ca_topic_score_gemma":0.0009375705,"teacher_disagreement_score":0.005219885,"about_ca_system_score_codex":0.001942499,"about_ca_system_score_gemma":0.001581823,"threshold_uncertainty_score":0.027605772},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035714738,0.0008077464,0.95561117,0.0004248045,0.000030512389,0.000032946384,0.00006711986,0.0000634862,0.0072474834],"genre_scores_gemma":[0.82510346,0.001353727,0.16607106,0.00015356488,0.0000906254,0.00013745566,0.000121959565,0.00014712241,0.00682113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988103,0.00051638886,0.00004921107,0.0001309521,0.00036962374,0.00012360435],"domain_scores_gemma":[0.99538994,0.0032506534,0.00043553195,0.0003841771,0.0003603693,0.00017939293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036459195,0.0008370684,0.001010478,0.0009244978,0.00042132623,0.0020231756,0.001087246,0.0008338812,0.0016923767],"category_scores_gemma":[0.00920763,0.0004122169,0.00085197063,0.0009436926,0.0031030243,0.0026550803,0.0019918298,0.0017987167,0.00024523944],"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.000053509724,0.000030481366,0.00051553897,0.00014726176,0.000028537595,0.000104302504,0.00014258378,0.25268593,0.003929241,0.7323295,0.0005004016,0.0095327385],"study_design_scores_gemma":[0.000010823613,0.00005345172,0.0002205459,0.000027073633,0.000008916841,0.00003862583,0.000027151822,0.7823519,0.0013644431,0.2149382,0.00094331085,0.00001553436],"about_ca_topic_score_codex":0.0015715694,"about_ca_topic_score_gemma":0.0010725023,"teacher_disagreement_score":0.0036459195,"about_ca_system_score_codex":0.0016785932,"about_ca_system_score_gemma":0.00080504693,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.111505784,0.0006024295,0.87356025,0.00056547474,0.000051031824,0.000054493965,0.000046092246,0.000071739385,0.013542634],"genre_scores_gemma":[0.96676487,0.00054467114,0.026592473,0.00007401924,0.00006166075,0.0001249335,0.000052799212,0.00003502211,0.0057496163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996301,0.00016322781,0.000018498595,0.00006114479,0.00008688091,0.00004012602],"domain_scores_gemma":[0.99952865,0.00020814824,0.00008788949,0.000027030423,0.00011447874,0.00003369237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093926623,0.0006779866,0.00049469614,0.00058826304,0.00052746484,0.0009129733,0.00056162296,0.0005299167,0.0016216084],"category_scores_gemma":[0.0020206296,0.0002208389,0.00054385053,0.00030075395,0.001602851,0.0016957459,0.0018883384,0.0007453585,0.00017963756],"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.00007743169,0.000028699687,0.0005903011,0.00015601808,0.000036907015,0.00013356826,0.00019705293,0.24381167,0.013866416,0.72533923,0.00064651296,0.015116119],"study_design_scores_gemma":[0.000009240444,0.000053484568,0.00019774999,0.00000998514,0.000005694779,0.000047774654,0.000061229664,0.87252784,0.0016897864,0.12450837,0.00087673037,0.000012213834],"about_ca_topic_score_codex":0.0008138166,"about_ca_topic_score_gemma":0.00036725626,"teacher_disagreement_score":0.0016216084,"about_ca_system_score_codex":0.0006399659,"about_ca_system_score_gemma":0.0005607853,"threshold_uncertainty_score":0.0054247975},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1224315,0.0057727955,0.8201489,0.004493774,0.00024800026,0.00012978054,0.0005316447,0.000115677154,0.046127915],"genre_scores_gemma":[0.85921836,0.005435952,0.117860034,0.0012239324,0.00045177614,0.00042783664,0.0011905384,0.0003721334,0.013819419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696296,0.0016072871,0.00017353462,0.000491156,0.0005388471,0.00022621788],"domain_scores_gemma":[0.9781231,0.017725967,0.00078194967,0.0009528527,0.0016837924,0.00073225755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0088978205,0.00129282,0.0016652588,0.0021528362,0.0010420732,0.0033713966,0.0016086226,0.0014653312,0.0031596932],"category_scores_gemma":[0.032035436,0.0008867655,0.0014559889,0.0016593839,0.0059928293,0.005689021,0.00422014,0.0071050553,0.00037429322],"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.00017771931,0.0000615046,0.0010163592,0.0002651798,0.000036237125,0.0001764029,0.00039656376,0.04116116,0.0020782824,0.9359232,0.0022737207,0.016433662],"study_design_scores_gemma":[0.000020377642,0.00009662613,0.00066975947,0.00012286151,0.000012422864,0.0001279046,0.00009416408,0.23290853,0.0011453994,0.7623264,0.0024508515,0.000024736413],"about_ca_topic_score_codex":0.0019910566,"about_ca_topic_score_gemma":0.0010662067,"teacher_disagreement_score":0.0088978205,"about_ca_system_score_codex":0.0019210852,"about_ca_system_score_gemma":0.0017397652,"threshold_uncertainty_score":0.047056794},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023788916,0.0006828239,0.9588917,0.0005895093,0.00013074234,0.00010589837,0.000116906216,0.00007170925,0.015621836],"genre_scores_gemma":[0.68925875,0.0016292532,0.28060466,0.0007148319,0.00029605147,0.00087290927,0.0004909691,0.00046704357,0.025665533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987081,0.0007513332,0.000050791343,0.00015587827,0.00023135796,0.00010253375],"domain_scores_gemma":[0.99352163,0.005354517,0.0003275741,0.00012786336,0.00041978693,0.00024867035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035474675,0.0019325662,0.0023462432,0.0012583559,0.00070872356,0.0025571613,0.0018439586,0.002619625,0.0045241066],"category_scores_gemma":[0.008492319,0.0013548016,0.0014513439,0.001258474,0.0024249917,0.0020355657,0.0033990443,0.0027304578,0.0003856027],"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.00009841335,0.00013003143,0.0003677598,0.00027781815,0.00008750944,0.00016722277,0.00012477566,0.87741446,0.0014804016,0.10428321,0.0014862503,0.014082148],"study_design_scores_gemma":[0.0000064383917,0.00003562377,0.00005634223,0.00001928579,0.0000070490914,0.000014005056,0.000013703769,0.9768519,0.00012335085,0.022532338,0.0003337863,0.0000061877913],"about_ca_topic_score_codex":0.0032365937,"about_ca_topic_score_gemma":0.0023649943,"teacher_disagreement_score":0.0045241066,"about_ca_system_score_codex":0.0013712837,"about_ca_system_score_gemma":0.0015105229,"threshold_uncertainty_score":0.018761039},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13342862,0.0030910852,0.78623885,0.0010270384,0.0002172372,0.00006800281,0.00010874127,0.00030519644,0.07551524],"genre_scores_gemma":[0.88545495,0.0022013886,0.1014074,0.0002334701,0.0003016806,0.00009142018,0.00011338334,0.000111533125,0.010084735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994104,0.00024715572,0.000026576608,0.00007440257,0.00018120692,0.00006026292],"domain_scores_gemma":[0.998264,0.00096165476,0.00019787201,0.00011527152,0.0002730144,0.00018824085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013024911,0.0005237712,0.0003825019,0.0007950167,0.0005992096,0.00096441986,0.00035800022,0.00038871294,0.0028327736],"category_scores_gemma":[0.00352446,0.00018762221,0.0006339916,0.00058109744,0.002191883,0.0016302554,0.0014628537,0.001302689,0.00024609015],"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.000020658594,0.000017234055,0.00034837515,0.000050272603,0.0000053134595,0.00014675809,0.00025495232,0.013714458,0.0043504373,0.9678045,0.0007560005,0.012531171],"study_design_scores_gemma":[0.0000144356345,0.00015082295,0.0009963005,0.000058671874,0.000009910071,0.00042286215,0.000314774,0.18060176,0.0041166455,0.80085593,0.012424965,0.00003289104],"about_ca_topic_score_codex":0.0009184574,"about_ca_topic_score_gemma":0.0006756181,"teacher_disagreement_score":0.0028327736,"about_ca_system_score_codex":0.0004931262,"about_ca_system_score_gemma":0.000292879,"threshold_uncertainty_score":0.0094765425},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13711837,0.002425823,0.8330597,0.0012208016,0.00010099747,0.00009327636,0.00032176278,0.00011467411,0.025544638],"genre_scores_gemma":[0.89043486,0.0023121429,0.10057046,0.00017674798,0.00019134211,0.00024762595,0.00032753154,0.00017243855,0.0055666766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987055,0.0004460691,0.000072257884,0.00028791375,0.0003373298,0.00015093581],"domain_scores_gemma":[0.99441975,0.0035435893,0.00061226886,0.00030796474,0.0007735037,0.0003429231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033090257,0.00091501896,0.0011839032,0.0022862158,0.0008997696,0.0036453337,0.001146723,0.0013427193,0.0021778054],"category_scores_gemma":[0.013362025,0.0005927512,0.0011678654,0.0013036366,0.0033311946,0.005047667,0.0019270842,0.0027404947,0.0002976768],"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.000055217446,0.00004051431,0.0011513793,0.00022616664,0.00006360588,0.0003358261,0.00027316235,0.044645116,0.0035807753,0.9335473,0.00096597243,0.015114877],"study_design_scores_gemma":[0.00001182841,0.000065670254,0.001677735,0.00011680704,0.000034147542,0.00047885947,0.0002010079,0.24639635,0.0031164337,0.7443702,0.003489924,0.000041079646],"about_ca_topic_score_codex":0.0005039121,"about_ca_topic_score_gemma":0.00033216635,"teacher_disagreement_score":0.0036453337,"about_ca_system_score_codex":0.0015445357,"about_ca_system_score_gemma":0.00072020525,"threshold_uncertainty_score":0.017500043},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014841452,0.001384817,0.9761872,0.00029592004,0.00009032216,0.000037068243,0.000049679722,0.000027673404,0.007085939],"genre_scores_gemma":[0.45730114,0.003762325,0.5226295,0.0003533043,0.00039485237,0.00026744118,0.00015738694,0.00013844279,0.014995616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990042,0.0003506153,0.00008303118,0.0001269002,0.00038107275,0.000054225988],"domain_scores_gemma":[0.9984048,0.0009187263,0.00010644567,0.00012447512,0.00031750512,0.00012812387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003336804,0.00071316847,0.0009399864,0.0015670155,0.000700394,0.0015324828,0.00066934567,0.000587143,0.0017793485],"category_scores_gemma":[0.004057491,0.00033083992,0.001417431,0.0010232842,0.002017671,0.0022561967,0.0020969224,0.0026374576,0.0002518441],"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.000008468971,0.000016050864,0.00015055553,0.000061558065,0.000016914204,0.000066749635,0.00012208402,0.012733465,0.0020304052,0.97561395,0.00026522359,0.008914499],"study_design_scores_gemma":[0.000009431615,0.000048002137,0.0002163299,0.000035403402,0.000015648424,0.000107437845,0.00004959764,0.1445119,0.0011365514,0.84811,0.0057447637,0.000014810233],"about_ca_topic_score_codex":0.0007203059,"about_ca_topic_score_gemma":0.0007543047,"teacher_disagreement_score":0.003336804,"about_ca_system_score_codex":0.0011837713,"about_ca_system_score_gemma":0.0009549277,"threshold_uncertainty_score":0.017646909},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045786807,0.00027214878,0.99414563,0.000048439135,0.00003568072,0.000027533277,0.0000067057827,0.000048226873,0.00083694723],"genre_scores_gemma":[0.33881184,0.0010525377,0.65580016,0.00014213292,0.00014129163,0.00029136674,0.00009341248,0.00011142052,0.003555808],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99946076,0.00025118384,0.000035978726,0.000056973076,0.00015910235,0.000036100224],"domain_scores_gemma":[0.9995747,0.0002207996,0.000056829736,0.00003673948,0.00008430476,0.000026553818],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012403292,0.0010949334,0.00087084196,0.0005646424,0.00030158836,0.00052680686,0.0012003165,0.000745231,0.0010685439],"category_scores_gemma":[0.0023080069,0.00038249078,0.00068459526,0.00047373035,0.00067381596,0.0011361489,0.0010523123,0.0011474983,0.00024912774],"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.00018051501,0.00009435764,0.00062111666,0.0004244181,0.000103735125,0.00015159744,0.0002249114,0.72624147,0.015573564,0.09529706,0.0016907474,0.15939654],"study_design_scores_gemma":[0.000007651325,0.000035054665,0.000060666494,0.0000063973616,0.0000035052508,0.000012435587,0.000004447445,0.9954503,0.0008100134,0.0029116045,0.0006928289,0.0000051193924],"about_ca_topic_score_codex":0.0014217165,"about_ca_topic_score_gemma":0.0015992846,"teacher_disagreement_score":0.0014217165,"about_ca_system_score_codex":0.00043299145,"about_ca_system_score_gemma":0.000774351,"threshold_uncertainty_score":0.0065595508},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028413402,0.00023655038,0.96887535,0.000092854076,0.000055643017,0.000055789355,0.000012752413,0.000063877036,0.0021938698],"genre_scores_gemma":[0.39934468,0.0006447251,0.5916171,0.000103697435,0.000076072494,0.00024938857,0.00007242735,0.00008610867,0.0078058117],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994431,0.00018571925,0.000051551127,0.00013840749,0.00012956097,0.00005167369],"domain_scores_gemma":[0.99924195,0.00028286816,0.00010387894,0.00005373895,0.0002410968,0.00007649027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001477777,0.0007664268,0.0006457283,0.00090218056,0.0005336562,0.0009940034,0.001019714,0.00074924185,0.0015170368],"category_scores_gemma":[0.0037955157,0.00035114054,0.00087226735,0.0005915891,0.0011800105,0.0014652447,0.0016670496,0.0010495106,0.00026525787],"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.00010375594,0.00007856986,0.0013341834,0.0003088779,0.00007317868,0.0003571807,0.00074268266,0.11067275,0.035265986,0.7300095,0.0012195888,0.11983379],"study_design_scores_gemma":[0.000029652376,0.00043752659,0.00041562304,0.000056912013,0.000029098655,0.00042496,0.00011392247,0.80228674,0.010594856,0.17859168,0.006966782,0.000052331197],"about_ca_topic_score_codex":0.0007007773,"about_ca_topic_score_gemma":0.0004965064,"teacher_disagreement_score":0.0015170368,"about_ca_system_score_codex":0.0007051404,"about_ca_system_score_gemma":0.0008385929,"threshold_uncertainty_score":0.007815301},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0182032,0.000806992,0.9679815,0.0002922122,0.00011752452,0.00007613228,0.000027450576,0.00007163988,0.012423344],"genre_scores_gemma":[0.4946092,0.0028263247,0.47456968,0.00034003958,0.00033024244,0.0006474287,0.00013070457,0.00024015365,0.026306225],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982577,0.00072207616,0.00008612694,0.00025874068,0.0005387622,0.00013660759],"domain_scores_gemma":[0.9971673,0.0016870451,0.00018870879,0.00022537309,0.00055351097,0.00017804283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005467659,0.0015283689,0.0014043387,0.0019368017,0.0010063517,0.0013466189,0.0016895256,0.0010527296,0.0022133074],"category_scores_gemma":[0.010552609,0.00048558682,0.0024650006,0.000857805,0.0041375323,0.0030068147,0.0031867975,0.002744761,0.000495124],"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.000071307964,0.000028734741,0.000396295,0.00017087697,0.000077851735,0.000101739526,0.00026309543,0.033593394,0.003456372,0.94379306,0.0005318862,0.017515507],"study_design_scores_gemma":[0.000043779328,0.00020582037,0.0003148283,0.00007512298,0.000046877212,0.00013663562,0.000101418,0.47480455,0.004902898,0.5140169,0.005293575,0.000057468853],"about_ca_topic_score_codex":0.0020648066,"about_ca_topic_score_gemma":0.00185741,"teacher_disagreement_score":0.005467659,"about_ca_system_score_codex":0.0015215012,"about_ca_system_score_gemma":0.0015042768,"threshold_uncertainty_score":0.02891606},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055776006,0.0003806692,0.99098223,0.0003048948,0.000040441937,0.000032885615,0.000020719404,0.00008313751,0.0025775048],"genre_scores_gemma":[0.13805495,0.0005906005,0.85477316,0.00033903043,0.00012602018,0.00021508241,0.00017264305,0.00024655065,0.005481964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99814403,0.0009542679,0.0000725911,0.00017927616,0.00053329713,0.000116529685],"domain_scores_gemma":[0.9971481,0.0019586233,0.0001618526,0.0002624135,0.00033431835,0.00013475568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005751583,0.0010898863,0.0014973411,0.0014277168,0.0009629944,0.0013626199,0.0021158012,0.0019889162,0.002460871],"category_scores_gemma":[0.011713101,0.0007465428,0.0009862464,0.0012686242,0.0032662475,0.0020238997,0.0037439335,0.0027836768,0.00061571476],"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.00012993945,0.000052261705,0.0009377472,0.00014831855,0.00006520769,0.00014781387,0.00024064239,0.37840715,0.0018358012,0.5686714,0.0028914814,0.04647229],"study_design_scores_gemma":[0.0000187472,0.000033520057,0.00007704986,0.000029331244,0.000005223365,0.000026675601,0.000021314245,0.8329314,0.0004156835,0.16427837,0.0021501111,0.000012516479],"about_ca_topic_score_codex":0.004254785,"about_ca_topic_score_gemma":0.004225813,"teacher_disagreement_score":0.005751583,"about_ca_system_score_codex":0.0014822263,"about_ca_system_score_gemma":0.0022727132,"threshold_uncertainty_score":0.030417621},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04376959,0.0002257074,0.94813335,0.00026872137,0.00006167985,0.000046290712,0.00007753145,0.00009841055,0.007318686],"genre_scores_gemma":[0.6894129,0.0009028044,0.28955403,0.00033607098,0.0002552459,0.00021489801,0.00029277877,0.00021830965,0.018813014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99916303,0.00021249043,0.00006138814,0.0002108726,0.00027551697,0.00007676058],"domain_scores_gemma":[0.9984884,0.00049399084,0.00016137767,0.00021880215,0.00042964128,0.00020767913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00205834,0.00060938596,0.00069719675,0.0011501784,0.0006269935,0.0014473447,0.00078283314,0.0008169949,0.0033907471],"category_scores_gemma":[0.0046057315,0.00033585582,0.0010981456,0.0006199335,0.0019262019,0.0027752393,0.0024122533,0.0023479718,0.00070883293],"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.00003827196,0.000034553155,0.0006697177,0.00009950962,0.000018495077,0.00016578918,0.000279659,0.015122822,0.009078922,0.94977486,0.0010669813,0.023650523],"study_design_scores_gemma":[0.000022705053,0.000198797,0.0006630916,0.000037982703,0.000019880941,0.00048683857,0.00013698841,0.24377762,0.009168488,0.73372823,0.01172175,0.00003756999],"about_ca_topic_score_codex":0.0003026815,"about_ca_topic_score_gemma":0.0002295113,"teacher_disagreement_score":0.0033907471,"about_ca_system_score_codex":0.0006241555,"about_ca_system_score_gemma":0.00062918745,"threshold_uncertainty_score":0.011343241},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01219226,0.00037920935,0.9712359,0.00080762594,0.00006869408,0.000085568645,0.00052986544,0.00006588138,0.014635015],"genre_scores_gemma":[0.5502586,0.002511018,0.42787147,0.00087146234,0.0004951901,0.0009127888,0.002931386,0.000313127,0.013835007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968657,0.001296152,0.00021967139,0.0005149577,0.00077922764,0.00032426306],"domain_scores_gemma":[0.9947173,0.0033376634,0.00053521304,0.00030256735,0.00087562535,0.00023159692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0041547045,0.0012888979,0.0009281774,0.0009790726,0.00070789934,0.001897562,0.0010092297,0.0014692344,0.0064140293],"category_scores_gemma":[0.012460579,0.000637546,0.0010432956,0.0013023447,0.0023383854,0.0031808987,0.002151639,0.0040372033,0.0008326878],"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.00004905369,0.000040479736,0.00060770847,0.00021809363,0.000030305377,0.0001612903,0.00013282683,0.19476822,0.002323184,0.78403735,0.0032847696,0.014346722],"study_design_scores_gemma":[0.00002830933,0.000061040366,0.0004661708,0.000092070695,0.000014792747,0.000082035614,0.00008774219,0.65654045,0.0017720665,0.33406198,0.0067639933,0.000029414765],"about_ca_topic_score_codex":0.003361249,"about_ca_topic_score_gemma":0.0025317722,"teacher_disagreement_score":0.0064140293,"about_ca_system_score_codex":0.0014688317,"about_ca_system_score_gemma":0.0019206034,"threshold_uncertainty_score":0.021972418},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006844456,0.00029009386,0.988932,0.0002262919,0.000042469994,0.00005434632,0.000019803569,0.00004912338,0.0035413557],"genre_scores_gemma":[0.45642188,0.0009046478,0.53132033,0.0002976748,0.00016491751,0.0008221887,0.00017565409,0.00013420338,0.009758531],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99827874,0.0007048881,0.0000769589,0.00025802807,0.0005679973,0.000113381684],"domain_scores_gemma":[0.9980877,0.0011068244,0.00015650899,0.0001386281,0.00038902427,0.00012122971],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063588447,0.0014524403,0.0012397546,0.0015737354,0.0011134545,0.0014562107,0.0022001883,0.0016005262,0.0025476485],"category_scores_gemma":[0.0073597967,0.0005267655,0.0018636414,0.0008595802,0.003233156,0.0024337638,0.0038543714,0.0027835604,0.00034596934],"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.000060068985,0.000038258568,0.00069806585,0.00024849226,0.00014508351,0.0001848553,0.00027341605,0.16234194,0.0060462393,0.80853873,0.0011751732,0.020249642],"study_design_scores_gemma":[0.000021788786,0.0000923262,0.00018886472,0.00003425775,0.000023028277,0.00009297253,0.00003199923,0.8687352,0.0013211215,0.12648365,0.002953558,0.000021295644],"about_ca_topic_score_codex":0.002269095,"about_ca_topic_score_gemma":0.0018324082,"teacher_disagreement_score":0.0063588447,"about_ca_system_score_codex":0.0015865903,"about_ca_system_score_gemma":0.0022133347,"threshold_uncertainty_score":0.03362918},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015461242,0.00021202504,0.98015803,0.00012750586,0.00010112791,0.00006934046,0.000011824804,0.00006285597,0.0037961195],"genre_scores_gemma":[0.48737475,0.0004180295,0.49996436,0.00012456073,0.000058455083,0.0003670538,0.00007536819,0.000071465656,0.011545946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995672,0.00014717408,0.000037235928,0.00007466304,0.00013921742,0.00003461356],"domain_scores_gemma":[0.9997482,0.00006940787,0.000022632874,0.000032437478,0.000095534735,0.00003177833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010205023,0.0006481749,0.0006126988,0.0003346488,0.00047477806,0.0006196881,0.00093404547,0.0008084525,0.0020924022],"category_scores_gemma":[0.0012528815,0.0002490425,0.000645353,0.00025490578,0.0007290137,0.0010951019,0.0011874292,0.0013239546,0.000287429],"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.0003614242,0.00018916398,0.0017350024,0.00048746826,0.00013816923,0.00039864753,0.00086007325,0.4619888,0.056443814,0.29771128,0.003284783,0.17640135],"study_design_scores_gemma":[0.000031286618,0.00014529086,0.00013531212,0.000016536003,0.000012435312,0.00008482075,0.00003691337,0.97725916,0.0045816554,0.01384449,0.0038309665,0.000021147005],"about_ca_topic_score_codex":0.0017849079,"about_ca_topic_score_gemma":0.0015147178,"teacher_disagreement_score":0.0020924022,"about_ca_system_score_codex":0.0004547002,"about_ca_system_score_gemma":0.0010606206,"threshold_uncertainty_score":0.006999731},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012557384,0.0016801329,0.9788482,0.00075395475,0.000057030287,0.0000834288,0.00007497512,0.0000865842,0.005858175],"genre_scores_gemma":[0.8272792,0.0046469877,0.15718308,0.0007597033,0.00030426975,0.0006720951,0.00029246326,0.00035216758,0.008510037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953648,0.0026938983,0.00017066098,0.00066422025,0.0007648852,0.00034160897],"domain_scores_gemma":[0.9719303,0.024424016,0.0011186538,0.00068443717,0.0013155891,0.00052697083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.012269778,0.0026626291,0.0024795518,0.0034584142,0.0010170557,0.0029009462,0.001644769,0.002058818,0.0030346094],"category_scores_gemma":[0.034355793,0.0012110283,0.0029812155,0.0016733451,0.0039148293,0.0045911907,0.003945821,0.004693505,0.00021729444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009466988,0.00008315146,0.0010502366,0.00044868616,0.00019744187,0.00034718003,0.00030258976,0.639031,0.0041098846,0.33781758,0.0012156463,0.015301902],"study_design_scores_gemma":[0.000005619534,0.000046668796,0.0002774818,0.00007995599,0.000030368632,0.00006604323,0.000045728797,0.8803369,0.0011802275,0.11679614,0.0011055216,0.000029388542],"about_ca_topic_score_codex":0.0019349644,"about_ca_topic_score_gemma":0.0008639988,"teacher_disagreement_score":0.012269778,"about_ca_system_score_codex":0.0031532957,"about_ca_system_score_gemma":0.0016314829,"threshold_uncertainty_score":0.06488955},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019300219,0.0010247813,0.9721604,0.00030023765,0.00014881152,0.00018424272,0.000041539635,0.00012480201,0.0067149815],"genre_scores_gemma":[0.24530955,0.0016954546,0.73893785,0.0002598361,0.00014086494,0.0005896198,0.00019256744,0.00024434563,0.012629973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917823,0.0002547294,0.000043599808,0.00012887863,0.0003114059,0.00008323403],"domain_scores_gemma":[0.9987821,0.00051577186,0.00008047296,0.00017552989,0.00036048522,0.00008562153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002192898,0.0012766789,0.0010900721,0.0014825417,0.0010599323,0.0011635016,0.0014410595,0.0013207626,0.0025941],"category_scores_gemma":[0.0055322545,0.000575263,0.0014090596,0.0011148481,0.0027343885,0.0017216777,0.0034873313,0.0033876963,0.0006138664],"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.00021804242,0.00012580174,0.001619064,0.00046053348,0.000120113335,0.00016770612,0.0011372824,0.16089532,0.0144502735,0.488895,0.0041775904,0.3277332],"study_design_scores_gemma":[0.000052678726,0.00020590282,0.0006815675,0.00007430868,0.00003763131,0.00022343248,0.00015248431,0.87363034,0.0098445695,0.10334349,0.011680223,0.00007334552],"about_ca_topic_score_codex":0.007014588,"about_ca_topic_score_gemma":0.004515291,"teacher_disagreement_score":0.007014588,"about_ca_system_score_codex":0.0016049913,"about_ca_system_score_gemma":0.0019719407,"threshold_uncertainty_score":0.0139475465},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048066206,0.0020984327,0.9035212,0.0021695488,0.0001763628,0.00006928395,0.00022557036,0.000075587384,0.043597855],"genre_scores_gemma":[0.77911216,0.0053797965,0.1716872,0.0014872734,0.0008693525,0.00037857157,0.0008648383,0.00023499093,0.03998588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995432,0.0001710293,0.00001881628,0.00010097919,0.00012776657,0.000038249895],"domain_scores_gemma":[0.99933165,0.00031698955,0.00008717371,0.00003912087,0.00012994421,0.00009502806],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010185151,0.0011514702,0.00067519484,0.00063527847,0.00049830996,0.0010139506,0.00076322356,0.0008288409,0.0032842252],"category_scores_gemma":[0.002353038,0.00030284288,0.00046770464,0.00071714044,0.0017569035,0.0022253448,0.0016835261,0.002166739,0.00044535488],"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.00003442203,0.000027642318,0.0002963042,0.0001121154,0.00002118513,0.000109686946,0.00009115404,0.040368203,0.0019258767,0.937723,0.0034966301,0.015793853],"study_design_scores_gemma":[0.000013255572,0.00009587656,0.00036890156,0.00003728898,0.000011838501,0.00014648512,0.00007245816,0.30883288,0.00082518795,0.681669,0.007910063,0.000016637729],"about_ca_topic_score_codex":0.0007877879,"about_ca_topic_score_gemma":0.00047857975,"teacher_disagreement_score":0.0032842252,"about_ca_system_score_codex":0.0006853796,"about_ca_system_score_gemma":0.0006616205,"threshold_uncertainty_score":0.010986805},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076709064,0.00014278997,0.98794055,0.00011207585,0.000074154304,0.00003382921,0.000041217743,0.00013777062,0.0038467795],"genre_scores_gemma":[0.19328554,0.00025280518,0.7991673,0.00015499706,0.00012849267,0.0005106201,0.00028112848,0.00042430617,0.0057948153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991129,0.0003408862,0.000050766983,0.00010959887,0.0003012884,0.00008452957],"domain_scores_gemma":[0.9971794,0.0016998086,0.0001904774,0.00035643502,0.00041609706,0.00015791041],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020097012,0.0010393858,0.001215322,0.0014096334,0.0008000291,0.0014317954,0.0023052974,0.001529289,0.0105192885],"category_scores_gemma":[0.008597259,0.0010125431,0.0009768407,0.0012476161,0.0015427317,0.0028248066,0.004018692,0.0027434442,0.0016476874],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046162476,0.00024028252,0.0010379754,0.0002767685,0.00008368344,0.00014180063,0.00032354292,0.52025545,0.0035351543,0.28938755,0.0051223547,0.17913383],"study_design_scores_gemma":[0.00004226558,0.00005046871,0.00007797322,0.000017018327,0.000009061892,0.000022246411,0.000020409647,0.9477969,0.0004688255,0.049547546,0.0019385429,0.000008788249],"about_ca_topic_score_codex":0.0013265212,"about_ca_topic_score_gemma":0.002510249,"teacher_disagreement_score":0.0105192885,"about_ca_system_score_codex":0.000581041,"about_ca_system_score_gemma":0.0011058658,"threshold_uncertainty_score":0.035190523},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059288014,0.0020668495,0.8897599,0.0016768213,0.00014901708,0.00007074211,0.00019670687,0.00009696883,0.046694998],"genre_scores_gemma":[0.8070073,0.0038284338,0.15156619,0.0011254213,0.00040557186,0.00031410987,0.00075424445,0.00026495592,0.034733765],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941254,0.00024698826,0.00002672474,0.00012188968,0.00014617,0.000045781133],"domain_scores_gemma":[0.9990345,0.00048192093,0.00011365304,0.00006562408,0.00018081412,0.00012355854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013480997,0.0010523996,0.00078329473,0.00072164705,0.00050201267,0.0011125373,0.00063291815,0.00060411834,0.0038312788],"category_scores_gemma":[0.0026999267,0.00027620557,0.0006065738,0.00069827924,0.0018398874,0.0023774111,0.0017655417,0.0020767772,0.00046539446],"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.000035389938,0.000025784493,0.00027242073,0.00011210906,0.00002343754,0.00011336979,0.00010670581,0.035326105,0.0024044681,0.9460531,0.0020172694,0.013509819],"study_design_scores_gemma":[0.0000125802535,0.00008917831,0.00032576857,0.000036265403,0.0000103781895,0.00013079778,0.0000970446,0.24731615,0.0008832734,0.744845,0.006240368,0.000013311684],"about_ca_topic_score_codex":0.00079684606,"about_ca_topic_score_gemma":0.0006439246,"teacher_disagreement_score":0.0038312788,"about_ca_system_score_codex":0.00076662295,"about_ca_system_score_gemma":0.00056642044,"threshold_uncertainty_score":0.012816846},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032985497,0.002287295,0.904322,0.0021991155,0.00041146483,0.00027821198,0.00094524835,0.00013655855,0.05643455],"genre_scores_gemma":[0.68421423,0.0058491407,0.28487608,0.0014674378,0.0012365265,0.0011669945,0.0026539718,0.00032841775,0.01820717],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847347,0.0005231087,0.00011394834,0.00026013106,0.00049508706,0.00013437374],"domain_scores_gemma":[0.996985,0.001970882,0.000203577,0.000096960815,0.00061541743,0.00012815879],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024351,0.00138386,0.001081908,0.0010168349,0.0006023317,0.0018459986,0.0012321714,0.0017050139,0.0060135718],"category_scores_gemma":[0.0064373096,0.00045009865,0.0006745935,0.0012087673,0.0018854135,0.003050286,0.0017108561,0.003960114,0.0009517119],"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.00007970449,0.00007634285,0.00044911177,0.000553518,0.000043630414,0.00038300906,0.00019418953,0.066774,0.0040191445,0.89746416,0.007239385,0.022723809],"study_design_scores_gemma":[0.00006930046,0.00017280933,0.0006470245,0.00020098436,0.00002852952,0.00027161665,0.00016417762,0.34776518,0.0028614497,0.6341999,0.013580017,0.000039000326],"about_ca_topic_score_codex":0.001124872,"about_ca_topic_score_gemma":0.00090267195,"teacher_disagreement_score":0.0060135718,"about_ca_system_score_codex":0.0010174443,"about_ca_system_score_gemma":0.0012940858,"threshold_uncertainty_score":0.020117402},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23084767,0.00036003138,0.759361,0.00035707958,0.000112081754,0.000106079955,0.000024320863,0.00007230024,0.008759391],"genre_scores_gemma":[0.84975266,0.00025885616,0.1411094,0.00007918706,0.00005063353,0.00020222108,0.000040673858,0.000063879575,0.008442444],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99865484,0.0004920109,0.00009826245,0.00023749747,0.00039325826,0.00012417379],"domain_scores_gemma":[0.996986,0.001335349,0.00031548578,0.00017758623,0.0008402539,0.00034538258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038363482,0.0007909774,0.0008438512,0.0015909426,0.0008802762,0.0016260574,0.0009347248,0.0011594269,0.0017924682],"category_scores_gemma":[0.006232393,0.00030495907,0.0015385139,0.00042742197,0.0033586817,0.001830825,0.002699484,0.0018083388,0.00015070415],"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.00018107692,0.00011384276,0.003336254,0.00020394569,0.0001119936,0.00060174253,0.000928264,0.09899468,0.023678463,0.84854335,0.0004448697,0.022861587],"study_design_scores_gemma":[0.000031910757,0.0005099171,0.0011527743,0.00005493529,0.00003419009,0.00049504143,0.00037282024,0.7975481,0.011113143,0.185849,0.0027771373,0.000061034298],"about_ca_topic_score_codex":0.00095913163,"about_ca_topic_score_gemma":0.000773759,"teacher_disagreement_score":0.0038363482,"about_ca_system_score_codex":0.0011343716,"about_ca_system_score_gemma":0.0013839515,"threshold_uncertainty_score":0.020288765},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034420996,0.00016693065,0.9945838,0.00006891789,0.000054550004,0.000037133803,0.000015636308,0.000063362626,0.0015675696],"genre_scores_gemma":[0.21259493,0.0007455307,0.7782053,0.00019604717,0.00017622324,0.0003296019,0.0002266306,0.00017650261,0.0073492383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996031,0.00013654679,0.000031008218,0.000054849774,0.00013851165,0.000036126858],"domain_scores_gemma":[0.9997688,0.00007886895,0.000018531837,0.000024857483,0.00007823869,0.000030775707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094421906,0.0010362358,0.0009628935,0.0005285159,0.0003766788,0.0007448913,0.0011342262,0.00088454055,0.0029842714],"category_scores_gemma":[0.0010879127,0.00043790968,0.0009077983,0.0004107618,0.0006552341,0.0014260345,0.0013166593,0.0015648446,0.00060265075],"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.0002615977,0.00017988788,0.0011022065,0.0007775913,0.00017050978,0.0003889017,0.00040313962,0.57024866,0.034994245,0.1425188,0.0050526476,0.24390177],"study_design_scores_gemma":[0.000014969528,0.00007743285,0.000072746145,0.000010952923,0.00000749772,0.00003728487,0.000012892313,0.99168384,0.0015368684,0.0037850144,0.0027496202,0.000010808152],"about_ca_topic_score_codex":0.0019823536,"about_ca_topic_score_gemma":0.0020048458,"teacher_disagreement_score":0.0029842714,"about_ca_system_score_codex":0.0003541658,"about_ca_system_score_gemma":0.0009605881,"threshold_uncertainty_score":0.00998342},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16321294,0.0016936756,0.8031767,0.0013439835,0.000085293366,0.00014561399,0.00026431863,0.00013884225,0.029938586],"genre_scores_gemma":[0.86662394,0.0018065651,0.11427828,0.00046037746,0.00039993325,0.0006173434,0.00073021353,0.0004385016,0.014644862],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99818486,0.0008824206,0.0001032504,0.0002969654,0.00041342524,0.000119070544],"domain_scores_gemma":[0.98449165,0.0119654,0.00094359653,0.0007126805,0.0012318114,0.0006548824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00369799,0.0015419562,0.0017543514,0.0038734216,0.0013084436,0.003301018,0.0022490143,0.0017325917,0.0060054935],"category_scores_gemma":[0.021862034,0.0013258461,0.0015743476,0.0024211947,0.004315612,0.0058811526,0.0039580027,0.003861639,0.00045620737],"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.0000350598,0.00003639601,0.00025744858,0.00007173169,0.000023987452,0.000038301874,0.00026148508,0.012186877,0.00080612855,0.97997195,0.00049402344,0.0058164736],"study_design_scores_gemma":[0.000014286998,0.000030245199,0.0002576696,0.000032385542,0.00001594006,0.000034790537,0.00006673329,0.05430632,0.00044131433,0.943444,0.0013457948,0.000010582279],"about_ca_topic_score_codex":0.0008397472,"about_ca_topic_score_gemma":0.00079787447,"teacher_disagreement_score":0.0060054935,"about_ca_system_score_codex":0.0016570702,"about_ca_system_score_gemma":0.00088395044,"threshold_uncertainty_score":0.020090401},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16689909,0.0007390391,0.81221783,0.0013090976,0.0000464126,0.00013422851,0.00032925792,0.00016330523,0.018161664],"genre_scores_gemma":[0.8653143,0.0012560624,0.11992387,0.00030607564,0.0001588519,0.00070900284,0.0009907644,0.00030424102,0.011036786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864477,0.0005326442,0.00009240322,0.00024577117,0.00035417906,0.00013028918],"domain_scores_gemma":[0.9966658,0.0017772213,0.00052886066,0.000127647,0.00053440005,0.000366103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023033372,0.0018924734,0.0016995935,0.0027950385,0.0012010782,0.0027322073,0.0014847012,0.0019378241,0.0037457426],"category_scores_gemma":[0.008879178,0.0009306188,0.0014350285,0.0010330776,0.0030015877,0.0037147792,0.0036958961,0.0032349357,0.0004930962],"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.00003940058,0.000044616743,0.0005681042,0.00012940026,0.000046345827,0.00016591887,0.0003257127,0.06012248,0.0033686534,0.92577136,0.0011383721,0.0082797455],"study_design_scores_gemma":[0.000018066692,0.000078915764,0.00051139656,0.00006360404,0.000018155524,0.0000963801,0.00018129821,0.43915138,0.0017001175,0.5559593,0.002182372,0.000039047885],"about_ca_topic_score_codex":0.0011423641,"about_ca_topic_score_gemma":0.00065019686,"teacher_disagreement_score":0.0037457426,"about_ca_system_score_codex":0.0019438585,"about_ca_system_score_gemma":0.0011377269,"threshold_uncertainty_score":0.014103711},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053249635,0.00022082358,0.9927411,0.0000983204,0.000031111296,0.000041580806,0.000014799013,0.000038281894,0.0014889296],"genre_scores_gemma":[0.31026477,0.0005784783,0.680461,0.00015513418,0.000077186065,0.00066418125,0.00013381275,0.00013896897,0.0075264503],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957734,0.00015058056,0.000024710354,0.00006306371,0.00014458077,0.000039762628],"domain_scores_gemma":[0.99936134,0.00035477852,0.00005419584,0.0000332996,0.00013754536,0.000058737984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018043161,0.0011988037,0.0013308743,0.0008824272,0.00064540503,0.0007489356,0.0015782928,0.0016381533,0.0021158494],"category_scores_gemma":[0.0021912532,0.00048254424,0.0012653243,0.0004725719,0.0012783775,0.0012787258,0.002162109,0.0019502243,0.00032258962],"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.0001369867,0.00013489393,0.0012797677,0.0004792518,0.00013569919,0.00038314486,0.00045151004,0.685579,0.018351058,0.210352,0.0017505392,0.080966175],"study_design_scores_gemma":[0.000008523812,0.000027494374,0.00003932082,0.000010363812,0.0000054362517,0.000027034162,0.000013224115,0.98721606,0.0006088424,0.011192053,0.0008450119,0.000006540427],"about_ca_topic_score_codex":0.0033745656,"about_ca_topic_score_gemma":0.0027037645,"teacher_disagreement_score":0.0033745656,"about_ca_system_score_codex":0.0007563845,"about_ca_system_score_gemma":0.0016125744,"threshold_uncertainty_score":0.009542286},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049934573,0.0012172238,0.9433013,0.00029746912,0.000052412564,0.000026611066,0.000056750676,0.000029304234,0.0050843526],"genre_scores_gemma":[0.8775809,0.0014696635,0.11317699,0.00012397407,0.0001453957,0.00016076719,0.00017354553,0.000046197427,0.007122583],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941206,0.00024086618,0.000032867145,0.00012463957,0.00014640932,0.000043148],"domain_scores_gemma":[0.9992428,0.00038982343,0.0001417558,0.000045927885,0.00013755253,0.00004210145],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012033512,0.00095234375,0.0009771032,0.0005919752,0.00037533,0.0011325798,0.0007813076,0.0008110026,0.0012583396],"category_scores_gemma":[0.0025304877,0.0002492216,0.0007858591,0.00063785625,0.0013189467,0.0019664331,0.0010702371,0.0012532723,0.00012838506],"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.000036670524,0.000032244778,0.00085486367,0.00024051241,0.00010354337,0.00021687007,0.00016758541,0.32910496,0.0057803043,0.6392534,0.000712292,0.023496851],"study_design_scores_gemma":[0.0000044601234,0.000052258805,0.00033863948,0.000013965141,0.000009845421,0.000050735624,0.000055025856,0.87645257,0.0006920256,0.12081613,0.0015049473,0.000009462571],"about_ca_topic_score_codex":0.0013501341,"about_ca_topic_score_gemma":0.00089459866,"teacher_disagreement_score":0.0013501341,"about_ca_system_score_codex":0.00084240275,"about_ca_system_score_gemma":0.00051505305,"threshold_uncertainty_score":0.0063640475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01966549,0.00018552458,0.9782009,0.00012531415,0.000024251312,0.000039825874,0.000009807999,0.000028813542,0.0017200538],"genre_scores_gemma":[0.45924544,0.00044979402,0.533088,0.00010804893,0.00008022052,0.00046382693,0.00008553057,0.0000874744,0.00639168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989485,0.0004719463,0.000051284915,0.00014108444,0.00031192362,0.00007529248],"domain_scores_gemma":[0.9979006,0.0014168917,0.00017577432,0.00009690781,0.00029220426,0.00011760428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030863918,0.0011963386,0.0009325271,0.0009485404,0.00050819333,0.0009377474,0.0014331677,0.0018579644,0.0016559473],"category_scores_gemma":[0.0074192053,0.00045696145,0.0013474636,0.00054770557,0.0024653277,0.0019311071,0.00334555,0.0018457981,0.00026256155],"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.00013946685,0.000090990434,0.0009660038,0.00047804558,0.00014884416,0.00033779396,0.00070142414,0.4291086,0.016140094,0.4951398,0.00091607234,0.055832785],"study_design_scores_gemma":[0.000012792742,0.00006596255,0.000080918726,0.000021732858,0.000007629169,0.000060793576,0.000051585244,0.94386685,0.002453622,0.05264856,0.00072096154,0.000008697276],"about_ca_topic_score_codex":0.0009877336,"about_ca_topic_score_gemma":0.00093341916,"teacher_disagreement_score":0.0030863918,"about_ca_system_score_codex":0.0008269811,"about_ca_system_score_gemma":0.0012538581,"threshold_uncertainty_score":0.016322553},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009098706,0.0017729158,0.9683658,0.0011655265,0.00043363514,0.00003744064,0.00008438562,0.000054690223,0.018986866],"genre_scores_gemma":[0.42625225,0.006402415,0.5332585,0.0018009844,0.0018871273,0.0002250362,0.00029872477,0.00069848594,0.02917662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831605,0.0005615262,0.00011003111,0.00028289863,0.0006394827,0.00009000206],"domain_scores_gemma":[0.9951981,0.0031689745,0.00022294937,0.0005234416,0.0006550215,0.00023159067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005593568,0.0009636103,0.0009612591,0.0015367519,0.0008780813,0.0017028538,0.0012584386,0.0013106881,0.0036366517],"category_scores_gemma":[0.011157348,0.00060728425,0.0017136763,0.0012792996,0.0037507801,0.0049047633,0.0029458615,0.0070233354,0.0007006473],"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.000020170073,0.000011153248,0.00018161292,0.00007995073,0.000010598183,0.00014185812,0.00012921465,0.0060247397,0.0024149711,0.97873104,0.0017210023,0.010533583],"study_design_scores_gemma":[0.000012082071,0.00011306156,0.0004939546,0.000071629416,0.000018964127,0.00040328127,0.000057065216,0.096073575,0.0028119306,0.86968035,0.030223925,0.000040115945],"about_ca_topic_score_codex":0.0011772958,"about_ca_topic_score_gemma":0.0010307545,"teacher_disagreement_score":0.005593568,"about_ca_system_score_codex":0.001088514,"about_ca_system_score_gemma":0.0009558303,"threshold_uncertainty_score":0.029581964},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0372632,0.00084304623,0.9534141,0.00048400857,0.000040518466,0.00006248183,0.00003323455,0.00007105158,0.0077884537],"genre_scores_gemma":[0.79981905,0.0018957737,0.18553387,0.00022013098,0.0001822642,0.0004418618,0.00018625046,0.00017329767,0.011547417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839103,0.0008118141,0.00007117473,0.00026157204,0.0003484999,0.00011590972],"domain_scores_gemma":[0.99568534,0.0029721942,0.00041521713,0.00015970747,0.00061588374,0.00015167016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004013534,0.0013301794,0.0010800837,0.0013285683,0.00078512594,0.0019285062,0.0010792732,0.0013482396,0.0028622604],"category_scores_gemma":[0.010724766,0.00059453124,0.001122663,0.00085590105,0.0025873112,0.0029291916,0.0031774412,0.002503699,0.0004051516],"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.000090669426,0.00006035671,0.0006330507,0.00026856677,0.00006711621,0.000113242684,0.00043364838,0.18020098,0.006822429,0.7866252,0.0008338902,0.023850858],"study_design_scores_gemma":[0.000015833544,0.00012792916,0.00020770241,0.00004192518,0.000016729122,0.00007242426,0.00008342781,0.8460354,0.0021545656,0.14872447,0.0025006705,0.000018909346],"about_ca_topic_score_codex":0.00088735373,"about_ca_topic_score_gemma":0.00042521747,"teacher_disagreement_score":0.004013534,"about_ca_system_score_codex":0.0012017344,"about_ca_system_score_gemma":0.0010418454,"threshold_uncertainty_score":0.02122587},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016307764,0.00021158486,0.9817032,0.000100336976,0.00004990553,0.00003874231,0.000012967362,0.00011189951,0.0014634832],"genre_scores_gemma":[0.4385776,0.00049489783,0.55398434,0.00015510253,0.00011512378,0.0003761198,0.00014379004,0.00040133853,0.0057517523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99662054,0.0012248445,0.00024073644,0.00046724625,0.0012831986,0.00016339078],"domain_scores_gemma":[0.9892462,0.0074309087,0.00067502,0.00088601344,0.0013168264,0.00044508048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0070450446,0.0016454479,0.0022432767,0.0012040351,0.00074134517,0.0021104077,0.0019938764,0.0021499894,0.002684443],"category_scores_gemma":[0.024500249,0.00078647636,0.0013959369,0.0006033375,0.0031673065,0.0031702344,0.0047547305,0.0037481566,0.0004648841],"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.00048565117,0.00014663003,0.0017775312,0.00047222787,0.00017405143,0.00040640935,0.0007318452,0.68783534,0.008188001,0.24065661,0.00088011206,0.058245517],"study_design_scores_gemma":[0.0000074423147,0.000092594564,0.00008253616,0.000031169428,0.000010835808,0.000057749407,0.000023739374,0.9761041,0.0020706316,0.020803764,0.00070416107,0.000011266437],"about_ca_topic_score_codex":0.0010333487,"about_ca_topic_score_gemma":0.0006719665,"teacher_disagreement_score":0.0070450446,"about_ca_system_score_codex":0.0009830433,"about_ca_system_score_gemma":0.0012118523,"threshold_uncertainty_score":0.037258208},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10887081,0.0025813032,0.83144754,0.0039443877,0.00017368626,0.000085126114,0.00023173355,0.00017752824,0.052487876],"genre_scores_gemma":[0.9197546,0.0020792834,0.06603938,0.0010143046,0.0002552083,0.00019867056,0.00027177687,0.00024502727,0.010141633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981171,0.0007083607,0.0000883866,0.00043217803,0.0005137926,0.00014015628],"domain_scores_gemma":[0.98874474,0.0076558567,0.0009523034,0.0008396173,0.0012268911,0.0005807119],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053063105,0.00077915704,0.0009821936,0.0013871106,0.0010254034,0.0027448314,0.0015169977,0.0014126605,0.0033685153],"category_scores_gemma":[0.026668184,0.0004530123,0.0009583923,0.00076129136,0.0059459684,0.005389082,0.003196677,0.006579148,0.00036027408],"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.00003594517,0.000019655365,0.00035854767,0.000089589914,0.000008796837,0.0000803599,0.00022030344,0.017581092,0.001603312,0.9736235,0.00061648485,0.0057625123],"study_design_scores_gemma":[0.000011837639,0.00008224618,0.00046556903,0.00008657072,0.000008359966,0.00007846003,0.00007618666,0.21538219,0.001639049,0.77974063,0.002407651,0.000021236443],"about_ca_topic_score_codex":0.0018114462,"about_ca_topic_score_gemma":0.0008642174,"teacher_disagreement_score":0.0053063105,"about_ca_system_score_codex":0.0028738885,"about_ca_system_score_gemma":0.0011095554,"threshold_uncertainty_score":0.02806276},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00955671,0.00010482147,0.98709315,0.00009325923,0.00011167588,0.00005421036,0.00001932917,0.00013470669,0.002832147],"genre_scores_gemma":[0.2162453,0.00017663403,0.77598757,0.00021563904,0.00016595448,0.00054132653,0.00013848083,0.0001937252,0.006335346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991974,0.00025518704,0.00006499928,0.0001163781,0.00028984787,0.00007613404],"domain_scores_gemma":[0.9986725,0.0006356156,0.00009702162,0.00014376959,0.00032775005,0.00012343348],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021443653,0.0010288542,0.0014491976,0.0012999969,0.0008367957,0.0011132233,0.0025113537,0.0020469842,0.0047541168],"category_scores_gemma":[0.0044371802,0.00073479797,0.0011552266,0.00076865766,0.0014668138,0.0018553468,0.0037065872,0.0017524692,0.00082330534],"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.00062397134,0.00047688396,0.0013837601,0.0005049153,0.00014551534,0.00030460948,0.000463413,0.46686107,0.013515801,0.27085882,0.0041466337,0.24071467],"study_design_scores_gemma":[0.000026982616,0.00014058701,0.00006294346,0.000012120265,0.000009168928,0.000026513342,0.0000111918525,0.98828876,0.00064035633,0.009430469,0.0013413883,0.000009591367],"about_ca_topic_score_codex":0.0018193516,"about_ca_topic_score_gemma":0.0026950252,"teacher_disagreement_score":0.0047541168,"about_ca_system_score_codex":0.0005668884,"about_ca_system_score_gemma":0.0016657804,"threshold_uncertainty_score":0.015904129},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.047304537,0.0002959339,0.932591,0.00076335785,0.00022306968,0.000081019796,0.00013062714,0.00023330662,0.018377027],"genre_scores_gemma":[0.6493099,0.0012358746,0.29463285,0.0009943416,0.000531668,0.0004150499,0.00043808704,0.00060356583,0.051838692],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990854,0.00021210546,0.000039825507,0.00025134417,0.0002945565,0.00011685983],"domain_scores_gemma":[0.99785244,0.0007267222,0.00017736702,0.00021217203,0.00055907195,0.00047220485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015529512,0.0011093139,0.0011094707,0.0018226365,0.0010875915,0.0021397185,0.0012733715,0.0013663729,0.0050861235],"category_scores_gemma":[0.0055177137,0.00063478516,0.0011603129,0.0007192858,0.0025656705,0.0032132585,0.00487681,0.0048677707,0.0011662635],"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.000064733984,0.00006308456,0.00030602192,0.00011023862,0.000049220816,0.00011756426,0.00032216185,0.0075528054,0.006901031,0.9611106,0.0020769648,0.021325527],"study_design_scores_gemma":[0.00002898565,0.00017235673,0.00041110595,0.000026537058,0.00002737335,0.00040282545,0.00016280556,0.09081586,0.0036909862,0.89432436,0.009900395,0.000036354384],"about_ca_topic_score_codex":0.00043985763,"about_ca_topic_score_gemma":0.00026722104,"teacher_disagreement_score":0.0050861235,"about_ca_system_score_codex":0.0007997753,"about_ca_system_score_gemma":0.0010069697,"threshold_uncertainty_score":0.017014802},"labels":[],"label_agreement":null},{"id":"W4385644730","doi":"10.1007/s11228-023-00683-2","title":"Relaxed Constant Positive Linear Dependence Constraint Qualification for Disjunctive Systems","year":2023,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Constraint (computer-aided design); Piecewise; Mathematics; Constant (computer programming); Upper and lower bounds; Piecewise linear function; Mathematical optimization; Set (abstract data type); Regular polygon; Property (philosophy); Computer science; Mathematical analysis","score_opus":0.029383924758906967,"score_gpt":0.2904096471752086,"score_spread":0.2610257224163017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385644730","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011015613,0.00026046115,0.9743033,0.00061372685,0.00006561805,0.00006583059,0.00032878685,0.00012103042,0.013225733],"genre_scores_gemma":[0.6745759,0.00061379164,0.293257,0.00079314836,0.00022722705,0.0003569258,0.0012836645,0.00043001826,0.028462254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99713814,0.0010376547,0.00011235816,0.00064862915,0.0007991285,0.00026407454],"domain_scores_gemma":[0.9942602,0.0038172156,0.00028409535,0.00046253766,0.0009607128,0.00021516421],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038211222,0.0010765904,0.0012882021,0.000732407,0.0007219383,0.0024763271,0.002592461,0.001618331,0.011809942],"category_scores_gemma":[0.010463841,0.0010481571,0.0010542892,0.0010384776,0.0021456347,0.00373051,0.002996411,0.0044377577,0.00092686195],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015750881,0.0001105265,0.00038036736,0.00048693732,0.00009179981,0.00025394018,0.0002945381,0.35557127,0.006257281,0.5890943,0.007432314,0.039869223],"study_design_scores_gemma":[0.000022715583,0.000034303397,0.00016529587,0.00003733477,0.00001683797,0.0000694941,0.00004666659,0.78903514,0.0014137725,0.20590661,0.0032328367,0.00001899171],"about_ca_topic_score_codex":0.004554423,"about_ca_topic_score_gemma":0.005323401,"teacher_disagreement_score":0.011809942,"about_ca_system_score_codex":0.0023385866,"about_ca_system_score_gemma":0.002037375,"threshold_uncertainty_score":0.039508224},"labels":[],"label_agreement":null},{"id":"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0074141542,0.0006617333,0.9749953,0.0010148683,0.0001025662,0.000044076376,0.00019082306,0.000043155364,0.015533251],"genre_scores_gemma":[0.48401815,0.003475651,0.48670596,0.001252869,0.0006727314,0.0006983348,0.0012930116,0.00019961143,0.021683643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971077,0.001368205,0.00023846274,0.00038281822,0.0007369067,0.00016589773],"domain_scores_gemma":[0.9976064,0.0012856973,0.00025711663,0.00018763398,0.00053975097,0.00012338192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00440561,0.0010854711,0.00069893576,0.0010498156,0.00080065365,0.0022519545,0.001038643,0.0011008825,0.004206754],"category_scores_gemma":[0.0062388107,0.00041507438,0.00097507023,0.0016957952,0.0036466278,0.0050357836,0.0019372855,0.0031034637,0.0008013407],"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.0000035366747,0.000005687812,0.000058348545,0.00004724799,0.000007260745,0.000023975535,0.00006672795,0.009299513,0.00038338383,0.98445964,0.0007862134,0.004858617],"study_design_scores_gemma":[0.000011402309,0.000031557993,0.00019564974,0.00006141791,0.0000075171415,0.000060944363,0.0001097369,0.09837243,0.0006460501,0.88497657,0.015506024,0.000020625324],"about_ca_topic_score_codex":0.0025244877,"about_ca_topic_score_gemma":0.0022363255,"teacher_disagreement_score":0.00440561,"about_ca_system_score_codex":0.0022004114,"about_ca_system_score_gemma":0.001557049,"threshold_uncertainty_score":0.023299336},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0077782697,0.0011044359,0.97695446,0.0011236356,0.00012244664,0.00005578581,0.0002173881,0.00003640216,0.012607078],"genre_scores_gemma":[0.5236306,0.005366327,0.44453168,0.0012419584,0.0009791111,0.00082792016,0.0017274519,0.000206641,0.021488363],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967534,0.0015845445,0.00024398632,0.00040640758,0.00083126244,0.00018036857],"domain_scores_gemma":[0.9973513,0.0013858291,0.0003784913,0.00020803002,0.00053223746,0.00014415673],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0050026616,0.001542476,0.00080630253,0.0011713833,0.000894827,0.002502144,0.0010380904,0.0015482258,0.0047489237],"category_scores_gemma":[0.0075965133,0.0004989065,0.0011468355,0.002095436,0.0036984975,0.0055472804,0.0022915418,0.0033577988,0.00087880617],"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.0000066394477,0.000010414562,0.00013140938,0.00009810583,0.000015475636,0.000035845107,0.00007944791,0.018168796,0.00062488037,0.97076875,0.0012306208,0.008829622],"study_design_scores_gemma":[0.000012368462,0.000039689563,0.00026996367,0.00007251285,0.000010497718,0.00008386974,0.00010323299,0.13574229,0.00072923704,0.8483144,0.014601136,0.000020888678],"about_ca_topic_score_codex":0.0020509153,"about_ca_topic_score_gemma":0.0018073054,"teacher_disagreement_score":0.0050026616,"about_ca_system_score_codex":0.0022717835,"about_ca_system_score_gemma":0.0014584563,"threshold_uncertainty_score":0.026456952},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033142827,0.00018727679,0.9957131,0.000089773304,0.000018965475,0.000017569244,0.000013011778,0.000047664784,0.00059826876],"genre_scores_gemma":[0.36208376,0.00069096184,0.6318569,0.00019802239,0.000113307346,0.00035581712,0.00016784239,0.00016649037,0.0043668714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945694,0.0002407633,0.000022256192,0.00010031197,0.00014228029,0.000037457154],"domain_scores_gemma":[0.9993055,0.0003672069,0.00006301175,0.00004863847,0.00016041813,0.000055146684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015166381,0.0014339965,0.0012174514,0.000633468,0.00035845852,0.000724737,0.0010722659,0.001081791,0.0012709203],"category_scores_gemma":[0.002419103,0.0003352878,0.0008638452,0.00055295177,0.0010451081,0.0012526087,0.0014898097,0.001611072,0.00026873458],"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.00006594628,0.000036616773,0.00047307304,0.00025287655,0.000107400185,0.00013569136,0.00006562068,0.8381033,0.0048092976,0.11531036,0.0017862637,0.038853433],"study_design_scores_gemma":[0.0000036084127,0.000016681028,0.000059080467,0.0000040281407,0.0000044519047,0.000012492833,0.000003042529,0.99116,0.00027082372,0.007995253,0.0004657838,0.0000048287925],"about_ca_topic_score_codex":0.0022545464,"about_ca_topic_score_gemma":0.0018507369,"teacher_disagreement_score":0.0022545464,"about_ca_system_score_codex":0.00075933867,"about_ca_system_score_gemma":0.0012612519,"threshold_uncertainty_score":0.008020878},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037900165,0.0005287168,0.9916596,0.00028774413,0.00006909495,0.000018901186,0.000022566639,0.00004461165,0.00357876],"genre_scores_gemma":[0.44564742,0.00315613,0.5256033,0.0005579269,0.00063189905,0.00039805684,0.00030903466,0.0005736131,0.023122529],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976768,0.001306223,0.000096799435,0.0002787724,0.00051764975,0.00012383056],"domain_scores_gemma":[0.9979665,0.0011793486,0.00023968112,0.00020801209,0.00030534712,0.000101040045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036325231,0.0013569975,0.00093439355,0.00092507416,0.00047927347,0.002426719,0.0009942572,0.0012228511,0.0027990658],"category_scores_gemma":[0.005492485,0.00042326818,0.001119918,0.00093309814,0.003236337,0.0027706507,0.002793488,0.0033535936,0.0007034068],"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.000045924637,0.00003128597,0.00026652688,0.00028524108,0.00004585453,0.00010140754,0.00013658896,0.26392525,0.0035825935,0.70004886,0.001802212,0.029728204],"study_design_scores_gemma":[0.000010291036,0.000085396816,0.00021917926,0.0000569727,0.000015142779,0.000096703145,0.000044648586,0.77088565,0.0018511002,0.21671638,0.009991248,0.000027229022],"about_ca_topic_score_codex":0.0007809783,"about_ca_topic_score_gemma":0.0006732993,"teacher_disagreement_score":0.0036325231,"about_ca_system_score_codex":0.0011942646,"about_ca_system_score_gemma":0.0008078618,"threshold_uncertainty_score":0.019210875},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24659102,0.0012480065,0.73210347,0.0021174566,0.00045646584,0.000039958715,0.000086376866,0.00029312854,0.017064026],"genre_scores_gemma":[0.90284544,0.0009969079,0.08972895,0.00037017147,0.00029585208,0.00005845708,0.00009184756,0.00021189133,0.0054004006],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99852645,0.0003230086,0.00008812905,0.00042450582,0.00047003053,0.00016788562],"domain_scores_gemma":[0.9976283,0.0008993753,0.0004011942,0.0003039269,0.00041958952,0.00034776735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022789955,0.0005484858,0.00071943563,0.0009806373,0.0009597697,0.0024624832,0.00083832716,0.0013302839,0.0036187442],"category_scores_gemma":[0.009567927,0.00057761173,0.00062806025,0.0006196883,0.004006745,0.009303066,0.0025835999,0.0019333187,0.0006049544],"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.00017744036,0.000037627535,0.0019442571,0.00013581762,0.00006053599,0.00043534485,0.00046984453,0.008632233,0.021002721,0.92825806,0.0007532454,0.038092848],"study_design_scores_gemma":[0.000016396923,0.00013826959,0.001583741,0.00005740133,0.000036182126,0.0009567489,0.00047419383,0.061258435,0.016149467,0.9128428,0.0064259465,0.000060428676],"about_ca_topic_score_codex":0.00029510676,"about_ca_topic_score_gemma":0.00018762882,"teacher_disagreement_score":0.0036187442,"about_ca_system_score_codex":0.00047100935,"about_ca_system_score_gemma":0.00050825655,"threshold_uncertainty_score":0.012105942},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002726143,0.00008210646,0.99622935,0.00008361869,0.000017059083,0.000031531057,0.0000082768765,0.000098759825,0.00072306657],"genre_scores_gemma":[0.22364359,0.00032723325,0.76953685,0.00018238495,0.00009778724,0.00050195813,0.00014755102,0.00028246312,0.0052802223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894065,0.0005834016,0.000049424452,0.000118401746,0.0002323645,0.000075861564],"domain_scores_gemma":[0.9979348,0.0013331306,0.00012480216,0.0001542851,0.00033586376,0.000117149575],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031521705,0.0017271686,0.001786432,0.00096776936,0.0006332144,0.0011648517,0.0019364201,0.0017810363,0.0026390096],"category_scores_gemma":[0.0067936955,0.00087205844,0.0010847977,0.0007726954,0.0015968333,0.0013293694,0.0024402274,0.0028552169,0.0010393992],"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.00017886145,0.00010022459,0.0005105437,0.00019923772,0.00010464912,0.00015179123,0.00015879785,0.83411777,0.0027514545,0.100350104,0.0027332297,0.058643404],"study_design_scores_gemma":[0.000016971018,0.000036735477,0.000029758292,0.000008438715,0.00000505115,0.000021036807,0.000006830739,0.9846126,0.00051796634,0.014053057,0.0006844081,0.000007195198],"about_ca_topic_score_codex":0.0017904191,"about_ca_topic_score_gemma":0.0013742854,"teacher_disagreement_score":0.0031521705,"about_ca_system_score_codex":0.0008216998,"about_ca_system_score_gemma":0.0018489618,"threshold_uncertainty_score":0.016670525},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014941879,0.008432155,0.25432807,0.0033824153,0.00090201903,0.000049067352,0.00057930633,0.0002957391,0.71708935],"genre_scores_gemma":[0.50701684,0.010820873,0.0815092,0.0012608627,0.0013592211,0.00020631167,0.0010658007,0.00033839094,0.39642254],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9998154,0.000042900832,0.000007671454,0.000036373647,0.00007973913,0.000018003979],"domain_scores_gemma":[0.9998541,0.00003335137,0.000008482878,0.00001841288,0.000068253205,0.000017402084],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003216781,0.00049397425,0.00037181037,0.0008694196,0.00045250024,0.001442596,0.00049443776,0.0006020571,0.019494718],"category_scores_gemma":[0.00051150407,0.00014483255,0.00032143563,0.0005513303,0.000829752,0.0012449162,0.00078508817,0.0010930633,0.0033947246],"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.0000018176895,0.000003893553,0.000021595142,0.00003053488,0.0000029357893,0.00001593269,0.000032006017,0.00088073354,0.0004945462,0.9856001,0.0045275115,0.008388404],"study_design_scores_gemma":[0.0000023759098,0.000013230874,0.00016640854,0.00004437508,0.0000041024527,0.00009867883,0.000053294396,0.014110779,0.0004099117,0.9022042,0.082886085,0.0000065311765],"about_ca_topic_score_codex":0.00068908534,"about_ca_topic_score_gemma":0.00055606477,"teacher_disagreement_score":0.019494718,"about_ca_system_score_codex":0.00079683436,"about_ca_system_score_gemma":0.00030069117,"threshold_uncertainty_score":0.0652163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024610205,0.0003245542,0.96958476,0.00039670404,0.000036075744,0.00009174635,0.00007258655,0.00005886439,0.004824517],"genre_scores_gemma":[0.36629713,0.0014599721,0.61775744,0.00032310604,0.0001326464,0.0011804614,0.00056494656,0.00032085954,0.011963516],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977848,0.00086828694,0.000089303954,0.0004701201,0.00062673294,0.0001608109],"domain_scores_gemma":[0.99564725,0.0025011294,0.0004344509,0.0002447145,0.00080040994,0.000372085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005278321,0.001582223,0.0015502637,0.0022698187,0.0016019378,0.0021660568,0.0019312993,0.0021637885,0.0051994068],"category_scores_gemma":[0.012523144,0.0007716593,0.0018377482,0.0014611712,0.0043490813,0.0066416734,0.0057416214,0.0042846566,0.0006762826],"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.000078725665,0.000037846,0.00032687144,0.00015713548,0.000052233656,0.00011561123,0.00029221215,0.032465234,0.0022859445,0.9514667,0.00090515683,0.011816329],"study_design_scores_gemma":[0.00003842609,0.00023648886,0.00025491873,0.00008949163,0.000021417529,0.00017512222,0.00015393966,0.26088336,0.0017533972,0.7318173,0.0045388695,0.00003731253],"about_ca_topic_score_codex":0.0011038086,"about_ca_topic_score_gemma":0.0007716755,"teacher_disagreement_score":0.005278321,"about_ca_system_score_codex":0.0018204969,"about_ca_system_score_gemma":0.0018546942,"threshold_uncertainty_score":0.027914762},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002874309,0.0000951774,0.9963081,0.00006587517,0.0000231432,0.00002372472,0.0000059958606,0.000035443576,0.00056829525],"genre_scores_gemma":[0.21279216,0.00043997265,0.7818758,0.00015680619,0.00013365662,0.00042519413,0.00009728957,0.00009374762,0.003985401],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992804,0.00030867298,0.000029954314,0.00010605112,0.00022441027,0.000050547784],"domain_scores_gemma":[0.9990748,0.00061667623,0.00006014498,0.00005398142,0.0001325561,0.000061795225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017869676,0.00091814244,0.0011412286,0.00041937135,0.0004461531,0.0006697308,0.0012867752,0.0010444381,0.0018794324],"category_scores_gemma":[0.0030617802,0.00048808343,0.00073922734,0.00060724973,0.0010796027,0.0011785221,0.0017955233,0.0021077974,0.00034783842],"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.00011979456,0.0001227414,0.0005379891,0.00020325607,0.00008364986,0.00015444942,0.00014137989,0.7131233,0.0060055265,0.14998353,0.0013763682,0.12814802],"study_design_scores_gemma":[0.0000092047885,0.00003372461,0.000027938024,0.000004208504,0.000002362597,0.00001804236,0.0000025441173,0.9930647,0.00034785023,0.006011133,0.00047410672,0.0000043485816],"about_ca_topic_score_codex":0.0020204566,"about_ca_topic_score_gemma":0.0014957722,"teacher_disagreement_score":0.0020204566,"about_ca_system_score_codex":0.0005281941,"about_ca_system_score_gemma":0.0016151929,"threshold_uncertainty_score":0.009450495},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015083076,0.00012227961,0.99738663,0.000053830932,0.000018551313,0.00003418206,0.000009691457,0.000058532147,0.0008079389],"genre_scores_gemma":[0.047290485,0.0004006882,0.94902635,0.000087592045,0.000034551613,0.0003358241,0.00011275963,0.000109514076,0.0026022617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988181,0.0004582926,0.00006523638,0.00015198435,0.00043740805,0.00006888837],"domain_scores_gemma":[0.9989446,0.0004562431,0.00009438119,0.000103582744,0.00033508998,0.00006612317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002101985,0.0013600348,0.001184961,0.000947549,0.00063847937,0.0012136862,0.0016628229,0.0017008351,0.0031915803],"category_scores_gemma":[0.0040574274,0.00070662005,0.0011224609,0.0011334821,0.0012950783,0.0026487226,0.0023751638,0.0035332378,0.0010983684],"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.0001603327,0.00015099141,0.00057184714,0.00044309234,0.00012229488,0.0001369963,0.0003582264,0.5656555,0.0122289965,0.18764843,0.004780562,0.22774272],"study_design_scores_gemma":[0.000020774614,0.000046201,0.000068134745,0.000017730585,0.000007400991,0.000049034403,0.000024691248,0.97868747,0.0019248573,0.01644904,0.0026874223,0.00001722399],"about_ca_topic_score_codex":0.0013512283,"about_ca_topic_score_gemma":0.0016444807,"teacher_disagreement_score":0.0031915803,"about_ca_system_score_codex":0.0005971296,"about_ca_system_score_gemma":0.001958503,"threshold_uncertainty_score":0.011116505},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01380876,0.0002995801,0.9799478,0.00043494973,0.000074841046,0.000044710905,0.000110584595,0.00004490585,0.0052338517],"genre_scores_gemma":[0.6002731,0.0016490931,0.3854288,0.00038308298,0.00033354887,0.00036327238,0.0005881929,0.0002241895,0.010756735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984388,0.0005129041,0.000086939974,0.0003914525,0.00045712962,0.00011284965],"domain_scores_gemma":[0.9977089,0.0008093569,0.00035355505,0.00017923562,0.0006839143,0.00026499486],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003037529,0.0013724001,0.0012415141,0.0015842234,0.00063338707,0.002216162,0.0019126175,0.0013644671,0.0018817164],"category_scores_gemma":[0.006399726,0.0005539295,0.0010374439,0.0010855704,0.003650171,0.0038422132,0.003088203,0.0033190586,0.00041227878],"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.00007379671,0.000053544616,0.0009717065,0.00015224115,0.000032125714,0.00020334304,0.00020514967,0.17701377,0.006408149,0.7865516,0.0017905788,0.026543926],"study_design_scores_gemma":[0.000009582257,0.0000969356,0.00028047824,0.00003662753,0.000006557592,0.00014504773,0.0000815608,0.7879284,0.0017543011,0.20550998,0.004113962,0.00003652846],"about_ca_topic_score_codex":0.0028220813,"about_ca_topic_score_gemma":0.0016357345,"teacher_disagreement_score":0.003037529,"about_ca_system_score_codex":0.0015005649,"about_ca_system_score_gemma":0.0016503251,"threshold_uncertainty_score":0.016064167},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018030831,0.06820227,0.061282787,0.002981026,0.0044098403,0.000088369874,0.0006344399,0.00044696475,0.8601513],"genre_scores_gemma":[0.023881113,0.055582866,0.035127476,0.0016051818,0.0029828672,0.00021733638,0.00096267107,0.0008182766,0.87882227],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995384,0.000058214984,0.000026373393,0.000098444165,0.00025336584,0.000025319783],"domain_scores_gemma":[0.9997545,0.00009350284,0.0000111181525,0.000032642714,0.00008927635,0.000019070112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040003713,0.0012821734,0.0007012188,0.0011712773,0.0008288524,0.0027615894,0.0006851733,0.0007185404,0.039221056],"category_scores_gemma":[0.0009835811,0.00043841073,0.00066797464,0.001387797,0.0011436293,0.0026338364,0.001208434,0.0024294471,0.018938705],"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.000021337504,0.000038564634,0.00009089683,0.000648026,0.000018638717,0.00016878961,0.00047276952,0.0020239144,0.0016929131,0.5911252,0.23818062,0.16551828],"study_design_scores_gemma":[0.0000022686029,0.000011568964,0.000114358234,0.00018150797,0.000005369995,0.0002346756,0.000048076898,0.00071775576,0.00045738646,0.14988992,0.84832823,0.0000089607065],"about_ca_topic_score_codex":0.0010208645,"about_ca_topic_score_gemma":0.001269275,"teacher_disagreement_score":0.039221056,"about_ca_system_score_codex":0.0011866525,"about_ca_system_score_gemma":0.00088959496,"threshold_uncertainty_score":0.13120747},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012392085,0.011564736,0.7611081,0.0012105358,0.00234913,0.00009458575,0.00055823015,0.0017072756,0.22016813],"genre_scores_gemma":[0.03367652,0.013165169,0.6104938,0.001352313,0.0013704188,0.00019454065,0.0024572646,0.0036436727,0.3336462],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993924,0.00011749916,0.000027044221,0.0001142981,0.00029678326,0.000051993407],"domain_scores_gemma":[0.99969876,0.00010669274,0.000008342385,0.000065835,0.00010303598,0.000017320841],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000731057,0.0011209138,0.00115418,0.00096199533,0.0010307747,0.0019617502,0.0017105923,0.0013823181,0.047585104],"category_scores_gemma":[0.002393937,0.00045449456,0.00079035084,0.0017188084,0.00080206373,0.0018311954,0.0010842114,0.0022172863,0.026103005],"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.000043066062,0.00006236184,0.00011694173,0.0003264834,0.000027508313,0.000053355816,0.000071912335,0.022342328,0.0015044167,0.39775476,0.18833165,0.38936514],"study_design_scores_gemma":[0.000017768669,0.000027328784,0.00023273328,0.00022478364,0.000022439563,0.0002552382,0.00003511804,0.074171305,0.0032317317,0.26240003,0.6593431,0.000038386],"about_ca_topic_score_codex":0.0033767954,"about_ca_topic_score_gemma":0.0056123803,"teacher_disagreement_score":0.047585104,"about_ca_system_score_codex":0.0011807948,"about_ca_system_score_gemma":0.0018610707,"threshold_uncertainty_score":0.15918803},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028169933,0.07461708,0.14477876,0.0046150885,0.0045644343,0.000088713394,0.0015446555,0.00060843077,0.7663658],"genre_scores_gemma":[0.036403272,0.09296028,0.055955157,0.0026680126,0.005926746,0.00027068827,0.0020292785,0.0015573195,0.8022292],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99958915,0.000038497437,0.000018427461,0.00008231401,0.00023539037,0.000036297366],"domain_scores_gemma":[0.99971896,0.00011354948,0.000011984154,0.000033830645,0.00010472817,0.000016814613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004414597,0.0012682158,0.0008512147,0.001246204,0.0008684443,0.003508913,0.0007491694,0.0010268522,0.035959892],"category_scores_gemma":[0.0010811373,0.0005376214,0.0009406817,0.0023605453,0.0013967415,0.002737546,0.00092065125,0.0030443524,0.016101861],"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.00003190371,0.000029874964,0.00009408867,0.0006164771,0.000017790922,0.00007659238,0.0002744497,0.004323071,0.0027324848,0.60215837,0.2437768,0.14586806],"study_design_scores_gemma":[0.0000027916142,0.000014243786,0.00022236217,0.00026534803,0.000008381863,0.00017686107,0.000053469368,0.0019818624,0.0010693078,0.1872581,0.8089319,0.000015406491],"about_ca_topic_score_codex":0.0021039424,"about_ca_topic_score_gemma":0.0018160647,"teacher_disagreement_score":0.035959892,"about_ca_system_score_codex":0.0015614466,"about_ca_system_score_gemma":0.0011187482,"threshold_uncertainty_score":0.12029785},"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":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0075928727,0.023703692,0.5818994,0.007019166,0.0026769373,0.00006743908,0.00076944917,0.0003252291,0.37594584],"genre_scores_gemma":[0.18076693,0.036939565,0.43076357,0.0035880583,0.005181832,0.00038736837,0.0013444964,0.0020481658,0.33898005],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993494,0.00013793517,0.00004156098,0.00012427972,0.00030369087,0.000043077947],"domain_scores_gemma":[0.99943405,0.00032453134,0.000030494559,0.00004824197,0.00013529845,0.000027360236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012013551,0.0010927379,0.00081184,0.0009561814,0.00086270226,0.0019422616,0.0010672087,0.0010124997,0.015052198],"category_scores_gemma":[0.0028794487,0.00050553994,0.0010274197,0.0009036891,0.0015265552,0.003475551,0.0013532077,0.0033259538,0.0035882504],"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.000015021518,0.000013832797,0.000066824694,0.00018706683,0.00001795582,0.0000342147,0.00006453559,0.0049890904,0.0011310562,0.9270784,0.03107921,0.03532262],"study_design_scores_gemma":[0.000003840841,0.000016619791,0.0001478737,0.0001198713,0.00001761484,0.00009683064,0.000038175924,0.010919259,0.0017131933,0.8993853,0.08752334,0.000018093668],"about_ca_topic_score_codex":0.0017244042,"about_ca_topic_score_gemma":0.0021128494,"teacher_disagreement_score":0.015052198,"about_ca_system_score_codex":0.0018818831,"about_ca_system_score_gemma":0.0014461062,"threshold_uncertainty_score":0.0503546},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035574513,0.059449308,0.10548711,0.004427187,0.004036587,0.00007021012,0.0007680523,0.0004944987,0.82170975],"genre_scores_gemma":[0.063960396,0.12151564,0.065988,0.0023079268,0.008304707,0.00019815503,0.0021037955,0.001313245,0.7343081],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9997491,0.000025392717,0.000011318569,0.00003644714,0.00015455202,0.000023091596],"domain_scores_gemma":[0.99973947,0.00007942184,0.000012165816,0.00001990413,0.00012591585,0.000023017981],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028743088,0.000952498,0.0005531655,0.0013894876,0.0008352065,0.0031131434,0.00059392944,0.00077682396,0.034562096],"category_scores_gemma":[0.000849117,0.00038384303,0.0005236978,0.0015570363,0.0008686897,0.0025607515,0.0009225013,0.0026877644,0.015657673],"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.000018666233,0.000025930602,0.00006443116,0.0004077496,0.000007792806,0.00007631291,0.00019800634,0.0013436188,0.002497924,0.72316283,0.15220067,0.119995974],"study_design_scores_gemma":[0.00000351099,0.000015450714,0.00017535199,0.00026390652,0.0000059368062,0.00026769724,0.0000997136,0.001201368,0.0013169604,0.29090497,0.7057295,0.00001565558],"about_ca_topic_score_codex":0.0008802816,"about_ca_topic_score_gemma":0.0008296283,"teacher_disagreement_score":0.034562096,"about_ca_system_score_codex":0.0007756696,"about_ca_system_score_gemma":0.0007163911,"threshold_uncertainty_score":0.115621686},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019214954,0.00009942705,0.99666214,0.00006931039,0.000016587477,0.00003233821,0.000009600003,0.000055028777,0.0011339964],"genre_scores_gemma":[0.13290262,0.00046466728,0.86217123,0.00014759935,0.00007812247,0.00032793975,0.00011483774,0.00015435963,0.0036386063],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981761,0.0007767084,0.000078847384,0.00026920435,0.00051995023,0.00017910454],"domain_scores_gemma":[0.9972723,0.0017090417,0.00017340927,0.00018803179,0.0005410213,0.000116097835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033716145,0.0015115703,0.0015283645,0.0015432229,0.0010220829,0.0018486574,0.0020969652,0.001717706,0.004132537],"category_scores_gemma":[0.010285952,0.00087922375,0.0013207556,0.001389102,0.0022228719,0.0031755974,0.0026512207,0.003590389,0.0008383536],"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.00011744283,0.0001137352,0.00046898884,0.00017881271,0.00006628152,0.0000711734,0.00022852441,0.45534477,0.0023955766,0.451605,0.001974432,0.08743521],"study_design_scores_gemma":[0.000025782292,0.000051503128,0.00004263013,0.00002022153,0.0000124310645,0.000025897745,0.0000290462,0.88051885,0.0013251314,0.11499906,0.0029342298,0.000015222814],"about_ca_topic_score_codex":0.0029182448,"about_ca_topic_score_gemma":0.0026645977,"teacher_disagreement_score":0.004132537,"about_ca_system_score_codex":0.001927573,"about_ca_system_score_gemma":0.0021791044,"threshold_uncertainty_score":0.017830968},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038515635,0.00035411216,0.95475674,0.00032462602,0.000034469944,0.00008549148,0.00007143435,0.00008624849,0.0057713133],"genre_scores_gemma":[0.75122184,0.000733066,0.24077296,0.000272399,0.000111391164,0.00048488713,0.00022769222,0.00014482359,0.0060308906],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9967506,0.001133604,0.00021996927,0.000752466,0.0007920816,0.0003513222],"domain_scores_gemma":[0.98471826,0.011209258,0.001382137,0.0008850419,0.0012844253,0.00052086514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006202894,0.0012869763,0.0015319648,0.0021980747,0.0012934573,0.0033836982,0.0020395787,0.002050123,0.005203586],"category_scores_gemma":[0.031365186,0.00085308106,0.0023328864,0.0009202759,0.004728887,0.006520785,0.004012585,0.0051130354,0.00071079977],"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.00010718094,0.000089693036,0.001600351,0.00032070908,0.000064741005,0.00024451138,0.0005846367,0.09674634,0.0063508335,0.87179404,0.00062184955,0.021475097],"study_design_scores_gemma":[0.00003082328,0.00018843036,0.00051240664,0.00011301924,0.0000309067,0.00015127714,0.0001747634,0.32828665,0.0041149324,0.6640994,0.002258199,0.000039225863],"about_ca_topic_score_codex":0.0006625736,"about_ca_topic_score_gemma":0.0004277185,"teacher_disagreement_score":0.006202894,"about_ca_system_score_codex":0.0015411818,"about_ca_system_score_gemma":0.0014233413,"threshold_uncertainty_score":0.03280443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.059879784,0.000999486,0.9235017,0.00055152574,0.00014498681,0.00012866895,0.000086585824,0.000102757134,0.014604421],"genre_scores_gemma":[0.73747694,0.0027826563,0.24660347,0.00046686712,0.00048142317,0.0005748415,0.0002530281,0.00019077463,0.011169976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961124,0.001090601,0.00031300588,0.0012158524,0.0010189533,0.00024915696],"domain_scores_gemma":[0.9900221,0.0062388564,0.00089115783,0.0010054437,0.0012395171,0.00060281623],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059580095,0.0010674273,0.0011045134,0.0020709499,0.0013597013,0.0028070936,0.0014761342,0.0015047037,0.0048323353],"category_scores_gemma":[0.019893741,0.0008197348,0.0016395163,0.001239388,0.006246316,0.0083703585,0.005843985,0.0045367386,0.0005147426],"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.000062970226,0.000039878327,0.0007640658,0.0001703366,0.0000679498,0.00025429527,0.00064255856,0.0135433115,0.0033677695,0.95512015,0.0006071074,0.025359755],"study_design_scores_gemma":[0.000022894432,0.00030936176,0.001885357,0.00009493389,0.000054748416,0.00083596684,0.0004388164,0.079428725,0.006472857,0.90132254,0.0090633165,0.00007057316],"about_ca_topic_score_codex":0.00026435603,"about_ca_topic_score_gemma":0.00025008444,"teacher_disagreement_score":0.0059580095,"about_ca_system_score_codex":0.0011260745,"about_ca_system_score_gemma":0.00092516886,"threshold_uncertainty_score":0.03150934},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018310254,0.00042742258,0.9637636,0.00048815238,0.00008885838,0.0000524434,0.00009280097,0.00004381142,0.016732657],"genre_scores_gemma":[0.6493762,0.0014913767,0.32597855,0.0007488321,0.00042921648,0.00046006116,0.00045514203,0.00020810177,0.02085255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998271,0.00074257207,0.00009553314,0.00021855117,0.0005217547,0.00015060104],"domain_scores_gemma":[0.9981645,0.0009694161,0.00019497852,0.00013888741,0.0003414993,0.00019066776],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040558884,0.0011857158,0.0009195677,0.0014214341,0.00074643537,0.0031922522,0.0011339113,0.0010582065,0.0039510904],"category_scores_gemma":[0.0046183146,0.00059766055,0.0016922358,0.00093070447,0.0020283966,0.0040629227,0.0031568543,0.0046747485,0.0005286867],"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.000020541733,0.00003525147,0.00018700153,0.00007667622,0.000022628794,0.00006249816,0.0000916599,0.012523587,0.0012310456,0.98038036,0.0004341866,0.00493452],"study_design_scores_gemma":[0.000022020566,0.000108725595,0.00028855968,0.00005344441,0.00002105795,0.00020949714,0.00010107132,0.25991657,0.0022890551,0.7299221,0.007041781,0.00002604504],"about_ca_topic_score_codex":0.0004322279,"about_ca_topic_score_gemma":0.0004847063,"teacher_disagreement_score":0.0040558884,"about_ca_system_score_codex":0.0015898849,"about_ca_system_score_gemma":0.0013446728,"threshold_uncertainty_score":0.021449864},"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":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025207583,0.00021485378,0.96253204,0.0006018014,0.000065284745,0.00004624122,0.00021781806,0.00005477368,0.011059673],"genre_scores_gemma":[0.8143782,0.0008453608,0.16987595,0.00046999607,0.00022741208,0.00038398046,0.00084667216,0.00012020724,0.012852282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99857104,0.00051076064,0.00008966579,0.00027253586,0.000378301,0.00017764782],"domain_scores_gemma":[0.99733883,0.0014906289,0.00031306833,0.00017227486,0.0004873242,0.00019787968],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026932468,0.0007286449,0.0008488395,0.00054931943,0.0007326136,0.001461782,0.0008875461,0.0010240303,0.005307007],"category_scores_gemma":[0.0058330437,0.00037472544,0.00071493495,0.0005979534,0.0018998021,0.0030023356,0.002062191,0.0022085905,0.00046213198],"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.000035226985,0.000031273856,0.0004801081,0.00015543615,0.00002350693,0.00029690505,0.00022754418,0.1304685,0.004364688,0.8530565,0.0016066507,0.00925362],"study_design_scores_gemma":[0.000019547437,0.00006228268,0.0003922549,0.000041406,0.000008565735,0.00009149034,0.000071772294,0.80648845,0.001029371,0.18768448,0.004089355,0.00002100815],"about_ca_topic_score_codex":0.004272742,"about_ca_topic_score_gemma":0.0030182623,"teacher_disagreement_score":0.005307007,"about_ca_system_score_codex":0.0011884725,"about_ca_system_score_gemma":0.0016166168,"threshold_uncertainty_score":0.01775372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.110900424,0.0020245996,0.83963615,0.0025719546,0.00020345263,0.00013443318,0.0002573899,0.00008129637,0.044190355],"genre_scores_gemma":[0.92472434,0.0013316168,0.061092988,0.00043533056,0.00019159634,0.00027668523,0.00015506936,0.00003570992,0.011756645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99918824,0.00032758646,0.000046187957,0.00016716216,0.00016635412,0.00010437801],"domain_scores_gemma":[0.9990758,0.00047774884,0.00014371632,0.00004969176,0.00017661232,0.000076350894],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017475985,0.0009652844,0.0006514228,0.00072641205,0.0006768974,0.0011632356,0.0007943696,0.0010132437,0.004108269],"category_scores_gemma":[0.0038909249,0.00033357026,0.00072197587,0.0005079744,0.0022387125,0.003211057,0.0015731758,0.0016539554,0.00024205992],"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.000020374471,0.000013810204,0.00030587497,0.00008208892,0.000023742245,0.00012699216,0.00011259221,0.022623716,0.0017017294,0.9705151,0.00061764824,0.0038564089],"study_design_scores_gemma":[0.00002885707,0.000034714914,0.00038105287,0.00004350611,0.000014029986,0.00008804347,0.000116221476,0.18388465,0.00071746996,0.8109655,0.0037089894,0.000016948916],"about_ca_topic_score_codex":0.0028590749,"about_ca_topic_score_gemma":0.0029550805,"teacher_disagreement_score":0.004108269,"about_ca_system_score_codex":0.0013491933,"about_ca_system_score_gemma":0.0014425815,"threshold_uncertainty_score":0.013743579},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20462017,0.019201145,0.17289403,0.10603222,0.002112991,0.000061502775,0.00048886787,0.00020988662,0.49437922],"genre_scores_gemma":[0.9224726,0.004463079,0.015239801,0.008489361,0.0023354006,0.00007714774,0.00025334832,0.00021309506,0.04645613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998917,0.00043396658,0.00003212215,0.00019895505,0.00026781595,0.0001501601],"domain_scores_gemma":[0.99505424,0.003916109,0.00016674335,0.00022032448,0.00044114873,0.00020137752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029309178,0.0005285988,0.00081727485,0.0013716324,0.001706472,0.0025199421,0.0010349147,0.0017236598,0.005227877],"category_scores_gemma":[0.011724688,0.00040712673,0.00086779706,0.00095701584,0.0063652503,0.0053443,0.0024902155,0.0054037776,0.0004415007],"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.000023076327,0.0000123288955,0.00020840102,0.000027529286,0.0000044631693,0.00011507165,0.00013537628,0.0012791312,0.00019930571,0.9879758,0.006237029,0.0037824211],"study_design_scores_gemma":[0.0000070673505,0.0000055269916,0.00028290183,0.00002864224,0.000003704473,0.00006093439,0.00006988068,0.0038399063,0.00021997649,0.9879488,0.007524214,0.000008477214],"about_ca_topic_score_codex":0.0035366104,"about_ca_topic_score_gemma":0.0018532383,"teacher_disagreement_score":0.005227877,"about_ca_system_score_codex":0.0029215005,"about_ca_system_score_gemma":0.0007707282,"threshold_uncertainty_score":0.02119714},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03150597,0.000387769,0.9642794,0.00010617435,0.000029982313,0.00003688021,0.000012055795,0.000028758903,0.0036129327],"genre_scores_gemma":[0.8863948,0.00083222584,0.106669374,0.00007175532,0.00007346108,0.00018233573,0.000039643757,0.000042242278,0.0056942375],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938715,0.00023813423,0.00003715484,0.00011259902,0.00017569453,0.000049262788],"domain_scores_gemma":[0.9989889,0.0005372465,0.00015862148,0.000051849493,0.00021426738,0.00004904538],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016643314,0.0008322079,0.0005771454,0.000668459,0.00042924203,0.0009412249,0.00067157444,0.000755311,0.0010236689],"category_scores_gemma":[0.003804491,0.00019696928,0.00090430846,0.00033834437,0.0015295983,0.0009363207,0.0013383287,0.00089788676,0.0001344227],"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.00005592163,0.000028064616,0.0011509187,0.00022942411,0.00009210717,0.00031928052,0.00053186936,0.35211968,0.014170343,0.5978464,0.00049592083,0.03296007],"study_design_scores_gemma":[0.00000578874,0.00006245607,0.00022408481,0.000019868921,0.000012283653,0.000106484586,0.000052738178,0.8840176,0.0021488334,0.11204829,0.0012867543,0.000014943766],"about_ca_topic_score_codex":0.00092464546,"about_ca_topic_score_gemma":0.00042402415,"teacher_disagreement_score":0.0016643314,"about_ca_system_score_codex":0.00065537775,"about_ca_system_score_gemma":0.00089766737,"threshold_uncertainty_score":0.0088018775},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008325363,0.00014122763,0.98982275,0.00006032894,0.000048825867,0.000050223418,0.000011674059,0.00006575818,0.0014739245],"genre_scores_gemma":[0.20173803,0.00033951623,0.7925601,0.00007472571,0.000039475442,0.000231022,0.00007251316,0.00005386388,0.004890764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996025,0.00010717164,0.000034780896,0.000055119428,0.00016866335,0.000031865344],"domain_scores_gemma":[0.99964666,0.000119532066,0.000031762564,0.000049243074,0.00011241374,0.000040397226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010087192,0.0005807569,0.0007284002,0.00045060882,0.00042085216,0.00060039276,0.0015278858,0.0009959859,0.0018005068],"category_scores_gemma":[0.0014084004,0.00031217144,0.0009474471,0.00038615338,0.0006892866,0.00113776,0.001420186,0.0013949702,0.00036869542],"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.00018985286,0.000115249575,0.0019126792,0.00060772966,0.00013166484,0.00030877188,0.00080397696,0.5485375,0.052079257,0.21394788,0.0021089825,0.17925642],"study_design_scores_gemma":[0.00001657968,0.0000923754,0.00007940764,0.000013703088,0.000011137303,0.00006307763,0.000023429911,0.9872363,0.0031801688,0.0065610376,0.002703365,0.000019446303],"about_ca_topic_score_codex":0.0020072516,"about_ca_topic_score_gemma":0.0017599988,"teacher_disagreement_score":0.0020072516,"about_ca_system_score_codex":0.00049123465,"about_ca_system_score_gemma":0.0010393808,"threshold_uncertainty_score":0.006023288},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09147475,0.00050437,0.9005963,0.00060902,0.00013581682,0.00007371961,0.00012504875,0.0004304189,0.0060506025],"genre_scores_gemma":[0.7470673,0.00021120916,0.24893075,0.000094196526,0.000055524677,0.00022524604,0.00024718323,0.00014500365,0.003023548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960655,0.0001766588,0.000019213445,0.000043605643,0.00011603136,0.000037998754],"domain_scores_gemma":[0.99826694,0.001079895,0.00014819081,0.00010819313,0.00029187085,0.00010486908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013126463,0.0005756851,0.0010347451,0.00048761122,0.00047177478,0.0008073097,0.00088875246,0.0012315992,0.002335656],"category_scores_gemma":[0.005161834,0.00035879322,0.0003765266,0.0004944887,0.0009236641,0.0009162901,0.0011536272,0.0010912518,0.00031759447],"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.00007234697,0.000025777294,0.00037172282,0.00006463992,0.00001557329,0.00006159344,0.000032928594,0.97663635,0.0013887451,0.013405576,0.0005257758,0.007398914],"study_design_scores_gemma":[0.0000050792783,0.0000045684806,0.000025089434,0.0000016213879,7.5212876e-7,0.000002729458,0.0000019223287,0.9987226,0.00012003771,0.0010341929,0.00008017708,0.0000011538201],"about_ca_topic_score_codex":0.0042420044,"about_ca_topic_score_gemma":0.0037913043,"teacher_disagreement_score":0.0042420044,"about_ca_system_score_codex":0.0006774182,"about_ca_system_score_gemma":0.0012843973,"threshold_uncertainty_score":0.008434653},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011000451,0.0067859283,0.9652756,0.0016891077,0.00026663573,0.000082214574,0.000098307544,0.00030535902,0.014496458],"genre_scores_gemma":[0.4515147,0.01207099,0.51500416,0.0019227428,0.0012337039,0.00092921435,0.000566802,0.0010326765,0.01572505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99445796,0.0032456082,0.00018514694,0.0005475517,0.0012125552,0.0003511284],"domain_scores_gemma":[0.9726293,0.022199145,0.00084840733,0.0012573624,0.0026598484,0.00040598417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018510275,0.0025370473,0.0014165113,0.0020374884,0.0008852645,0.0018667653,0.002202454,0.0020055987,0.00436453],"category_scores_gemma":[0.047505967,0.00083864806,0.001742656,0.0015026904,0.0046464773,0.004405744,0.004176737,0.007846321,0.0011961352],"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.0006577002,0.00012591104,0.0018919766,0.0012151345,0.00021976832,0.00044543654,0.0006372849,0.33624002,0.0072605656,0.5641035,0.00967906,0.07752373],"study_design_scores_gemma":[0.000028767037,0.00013997804,0.00023017151,0.00016060396,0.000037372298,0.00014743948,0.000060996532,0.90293497,0.0027222023,0.090119004,0.0033859573,0.000032525248],"about_ca_topic_score_codex":0.0025889322,"about_ca_topic_score_gemma":0.0015553819,"teacher_disagreement_score":0.018510275,"about_ca_system_score_codex":0.0020100637,"about_ca_system_score_gemma":0.0015342933,"threshold_uncertainty_score":0.09789282},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046474654,0.00014224341,0.993891,0.00006593909,0.000040830837,0.000043142703,0.000010875059,0.000098516364,0.0010599633],"genre_scores_gemma":[0.25331584,0.00028750364,0.739836,0.00018195872,0.00007865093,0.0003932213,0.00013624427,0.00011498176,0.005655608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941075,0.00019324844,0.000043300257,0.00012265415,0.00017892907,0.000051114457],"domain_scores_gemma":[0.9995983,0.00015427133,0.000040722192,0.000030004448,0.00013349162,0.00004314563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013979112,0.0012044545,0.0014891742,0.00075951277,0.0005386162,0.00081643654,0.0019323934,0.001450706,0.0028954574],"category_scores_gemma":[0.0015827678,0.0005708245,0.00083263865,0.00048738418,0.0007410806,0.0016342074,0.0016641967,0.0013510063,0.00052039995],"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.00026453385,0.00013921256,0.0008911486,0.00045016257,0.00015683078,0.00028149225,0.0002284156,0.7588994,0.010439414,0.061009917,0.0029795486,0.16426],"study_design_scores_gemma":[0.000021676426,0.000050494218,0.00005427623,0.000007757043,0.000005879031,0.00003581362,0.000008024946,0.9950858,0.00064108346,0.0031093506,0.00097156555,0.000008295571],"about_ca_topic_score_codex":0.0026052475,"about_ca_topic_score_gemma":0.0028585885,"teacher_disagreement_score":0.0028954574,"about_ca_system_score_codex":0.0006855188,"about_ca_system_score_gemma":0.0013532,"threshold_uncertainty_score":0.009686232},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005178217,0.00018558813,0.9923592,0.00014898807,0.00006300098,0.000045893066,0.000016075403,0.0000708758,0.0019321877],"genre_scores_gemma":[0.20593181,0.00065036636,0.7842479,0.00022647601,0.00013636405,0.00056107424,0.00020226275,0.00018246309,0.007861325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934417,0.00024118632,0.00005213887,0.00008642516,0.00021378054,0.00006234768],"domain_scores_gemma":[0.99850756,0.00086191186,0.00009832379,0.00014068968,0.00027593636,0.00011563749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002000299,0.0013797818,0.0012569047,0.0013861887,0.0008978337,0.0014006444,0.0015022762,0.001979732,0.0035478938],"category_scores_gemma":[0.005297245,0.00055933284,0.0013345623,0.0012158956,0.0018669608,0.0026276393,0.0026786956,0.003246624,0.0005783199],"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.00018205275,0.00020347051,0.0010260259,0.00028867737,0.0001242994,0.0001811824,0.0003292182,0.556313,0.005050878,0.2880482,0.002426354,0.1458267],"study_design_scores_gemma":[0.0000124178205,0.000052946107,0.000051823197,0.00001669817,0.000007452487,0.00002455392,0.00002520163,0.9645033,0.0011398675,0.03273329,0.0014221959,0.00001035548],"about_ca_topic_score_codex":0.002281636,"about_ca_topic_score_gemma":0.003154969,"teacher_disagreement_score":0.0035478938,"about_ca_system_score_codex":0.00081846537,"about_ca_system_score_gemma":0.0016005253,"threshold_uncertainty_score":0.011868954},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13375318,0.0005884114,0.85577327,0.0010105425,0.00007235599,0.000098102704,0.00008224185,0.000061786275,0.008560118],"genre_scores_gemma":[0.8804586,0.0007861493,0.11281256,0.00015553669,0.00007539878,0.00037167835,0.00014393535,0.00007151055,0.0051247096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991571,0.00035864767,0.000062753956,0.00017271459,0.00015854834,0.00009027052],"domain_scores_gemma":[0.9977956,0.0012697775,0.00031224033,0.0000882357,0.0003868762,0.00014722571],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024746456,0.001013951,0.0010724401,0.00084418425,0.0006990334,0.0018915397,0.0006904267,0.0013513622,0.0019357676],"category_scores_gemma":[0.009702876,0.00048248837,0.0009798734,0.00040422342,0.0019734239,0.0017315734,0.0028832064,0.001626759,0.00024804534],"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.00025862156,0.00012914915,0.002040198,0.00063977076,0.00019255851,0.00044513433,0.00077863364,0.3867529,0.03183624,0.55477864,0.0011387035,0.021009386],"study_design_scores_gemma":[0.000034067965,0.00020595166,0.00035028948,0.00008547844,0.000019373725,0.00012281304,0.0003193732,0.83742213,0.0046796952,0.15478253,0.0019514449,0.000026832166],"about_ca_topic_score_codex":0.0006155449,"about_ca_topic_score_gemma":0.00039672077,"teacher_disagreement_score":0.0024746456,"about_ca_system_score_codex":0.000703131,"about_ca_system_score_gemma":0.0011045886,"threshold_uncertainty_score":0.013087332},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023885842,0.0005591376,0.96379393,0.0004291503,0.000079083926,0.00010902774,0.00017507827,0.00004410491,0.010924615],"genre_scores_gemma":[0.65245426,0.0029233256,0.3284969,0.00035630362,0.00033409282,0.0006429186,0.0010839199,0.00022142424,0.013486887],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982527,0.0005905306,0.0001508917,0.00029030655,0.00057134096,0.0001442697],"domain_scores_gemma":[0.9970395,0.0014424162,0.00032991078,0.0001398023,0.0008972609,0.0001510966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036560264,0.0018504075,0.0013567138,0.0015238683,0.0006325479,0.002436633,0.0010355973,0.0010121264,0.0030972487],"category_scores_gemma":[0.0064302743,0.0006417142,0.0013868217,0.0009369579,0.0021345783,0.004482297,0.0017021099,0.003417276,0.0004919427],"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.00006415651,0.000085677835,0.0006475526,0.00031623305,0.0000388099,0.00024478158,0.000180739,0.18412012,0.006902052,0.78453964,0.002003155,0.020857077],"study_design_scores_gemma":[0.000019837122,0.000110284294,0.00037462637,0.00006938331,0.000015211579,0.000119263954,0.00012498684,0.7279609,0.0028017238,0.2643089,0.0040649367,0.000029886563],"about_ca_topic_score_codex":0.0015608692,"about_ca_topic_score_gemma":0.0011806452,"teacher_disagreement_score":0.0036560264,"about_ca_system_score_codex":0.001127029,"about_ca_system_score_gemma":0.002010541,"threshold_uncertainty_score":0.01933515},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01175599,0.00026565156,0.9864654,0.000103329214,0.000045269702,0.00004315161,0.000008438404,0.0000564323,0.0012562553],"genre_scores_gemma":[0.46927935,0.0005413536,0.5257175,0.00017622036,0.00009015807,0.00036138162,0.000061012437,0.00008804899,0.003684913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999683,0.00012021056,0.000023041719,0.000041469997,0.00010257288,0.000029711811],"domain_scores_gemma":[0.9996532,0.00020455717,0.000038902162,0.000026478721,0.000047439902,0.000029523435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095222576,0.0009976394,0.0010006117,0.0005626978,0.00029492084,0.00052139367,0.0010502868,0.0010265455,0.0012654715],"category_scores_gemma":[0.0014291205,0.00039272764,0.00079121365,0.00041052495,0.0008191484,0.001054575,0.0011109001,0.0012288913,0.00015641413],"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.000158884,0.00011018858,0.00082541717,0.0003600263,0.00010307422,0.00025388983,0.0001904273,0.7963381,0.01702036,0.09931164,0.000944155,0.08438387],"study_design_scores_gemma":[0.000009227869,0.000032481697,0.000032301912,0.000005319418,0.0000034493178,0.000011781854,0.0000046898954,0.9962547,0.0006037923,0.0026032734,0.00043503093,0.000003970564],"about_ca_topic_score_codex":0.0016304634,"about_ca_topic_score_gemma":0.0017924552,"teacher_disagreement_score":0.0016304634,"about_ca_system_score_codex":0.00046370222,"about_ca_system_score_gemma":0.00093717314,"threshold_uncertainty_score":0.005035937},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02437961,0.00027000645,0.9716573,0.00022894877,0.000023661556,0.000038961974,0.00004202529,0.000033584536,0.0033258444],"genre_scores_gemma":[0.7708161,0.00093303074,0.22316642,0.00020160133,0.00006097772,0.000386938,0.0002172898,0.0001341746,0.0040834555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902,0.0005176526,0.000053354477,0.000116978495,0.00021326105,0.00007876735],"domain_scores_gemma":[0.99738246,0.0017594865,0.00032240996,0.0001349404,0.00031936174,0.00008124823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038737182,0.0012111116,0.0012491994,0.00082383666,0.0004309256,0.0013161153,0.0006463884,0.0012788489,0.001522376],"category_scores_gemma":[0.009188578,0.00054368284,0.0008789075,0.00054264226,0.0017238591,0.0017412258,0.001968867,0.0012998123,0.00022496609],"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.00007148053,0.00004197281,0.0006465267,0.0002395978,0.00005738344,0.00019767637,0.00015135936,0.6711608,0.0053992704,0.30754304,0.0005848831,0.013905968],"study_design_scores_gemma":[0.000006681342,0.000045429442,0.00012137426,0.000035962883,0.0000073351493,0.000032614582,0.000033235243,0.9536931,0.0010984258,0.044337384,0.0005793972,0.000009033546],"about_ca_topic_score_codex":0.00071550446,"about_ca_topic_score_gemma":0.00048672006,"teacher_disagreement_score":0.0038737182,"about_ca_system_score_codex":0.00061156205,"about_ca_system_score_gemma":0.00086559326,"threshold_uncertainty_score":0.020486414},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018162752,0.0002887801,0.9711728,0.00044691708,0.00004797627,0.000051380586,0.00009089279,0.00005607042,0.00968242],"genre_scores_gemma":[0.772542,0.0009895705,0.2126227,0.00046795295,0.00017489426,0.00064415246,0.00040968214,0.00025344975,0.011895662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899656,0.00036993707,0.000059270933,0.00020656243,0.00024345037,0.00012423003],"domain_scores_gemma":[0.99814,0.0012271248,0.00017461588,0.00011312908,0.00025884886,0.000086254695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025274795,0.0012016961,0.0014418784,0.0007163569,0.0006128951,0.0017927762,0.0011192925,0.0016686582,0.0036214686],"category_scores_gemma":[0.0063189077,0.00056161045,0.0011117879,0.00061404315,0.0023130686,0.0025548914,0.0025724962,0.0022454197,0.00043258406],"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.000034583398,0.000038592418,0.0002781011,0.00022738073,0.00004474025,0.0002162906,0.00014459003,0.24966344,0.0028434538,0.73621684,0.0010513187,0.009240662],"study_design_scores_gemma":[0.000015993819,0.00004659843,0.00015245908,0.00003791769,0.000008612808,0.00005807482,0.00004865446,0.7370192,0.00073302357,0.26027426,0.001590367,0.000014876491],"about_ca_topic_score_codex":0.0013819535,"about_ca_topic_score_gemma":0.0010518202,"teacher_disagreement_score":0.0036214686,"about_ca_system_score_codex":0.0009992679,"about_ca_system_score_gemma":0.0015036216,"threshold_uncertainty_score":0.013366699},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014052692,0.0035149409,0.023454865,0.001924025,0.00084567163,0.00034095632,0.9179098,0.01510183,0.022855252],"genre_scores_gemma":[0.017266972,0.00065269513,0.02527747,0.0004460602,0.000095959316,0.0004357447,0.95073396,0.0013150058,0.0037760527],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99831855,0.0003811731,0.00012956139,0.0004903474,0.000454905,0.00022552143],"domain_scores_gemma":[0.9976816,0.0009478199,0.00012498532,0.0006900849,0.0004174548,0.00013800446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018803853,0.004489893,0.0021283966,0.0021365606,0.0009618757,0.0032845545,0.0052828826,0.0034952795,0.036515735],"category_scores_gemma":[0.009286522,0.00093334896,0.002925658,0.004497067,0.0007508508,0.002066283,0.0019412745,0.0043578674,0.029997354],"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.00027274244,0.00026039392,0.00088951545,0.0012626876,0.00011984924,0.00012375406,0.000028755974,0.041409228,0.0002786472,0.005130374,0.92781186,0.022412235],"study_design_scores_gemma":[0.0013884876,0.00025459344,0.0036063981,0.00086710026,0.00011705977,0.00078594894,0.00025154636,0.27485627,0.004144513,0.05009234,0.663496,0.00013976084],"about_ca_topic_score_codex":0.008126253,"about_ca_topic_score_gemma":0.016612338,"teacher_disagreement_score":0.036515735,"about_ca_system_score_codex":0.0020590043,"about_ca_system_score_gemma":0.0021024705,"threshold_uncertainty_score":0.122157335},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0109420195,0.0007011893,0.9780496,0.0006478935,0.00010765533,0.00008254039,0.00020911846,0.00011194692,0.009148011],"genre_scores_gemma":[0.5584807,0.0026884999,0.4238704,0.0005218766,0.00034234385,0.0009918648,0.0009295604,0.0005512928,0.011623528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975758,0.0009749553,0.00014666292,0.00023750663,0.0007288347,0.00033624668],"domain_scores_gemma":[0.995161,0.0031394649,0.00033633478,0.00021108701,0.0009223552,0.00022972836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059042,0.0017967478,0.0025011993,0.0022868381,0.0009210474,0.00401873,0.0015669231,0.0022864083,0.005887392],"category_scores_gemma":[0.017498553,0.001561979,0.0018720111,0.001367281,0.003055547,0.0040377993,0.0027212014,0.004222233,0.0010780955],"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.0000909311,0.00009444497,0.00047306414,0.0005478103,0.00004084792,0.0002865902,0.00023537647,0.32443488,0.0026532358,0.6530818,0.0030804724,0.014980569],"study_design_scores_gemma":[0.00001577647,0.00005613433,0.00012449671,0.000079603444,0.000009152698,0.000050451534,0.00006262386,0.8142184,0.0011231706,0.18255295,0.0016872492,0.000020096159],"about_ca_topic_score_codex":0.002494667,"about_ca_topic_score_gemma":0.0026338024,"teacher_disagreement_score":0.0059042,"about_ca_system_score_codex":0.0019849024,"about_ca_system_score_gemma":0.003977229,"threshold_uncertainty_score":0.031224728},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025317394,0.0002919218,0.9959478,0.00015931354,0.000026112995,0.000025974154,0.000011510946,0.000030264373,0.0009754672],"genre_scores_gemma":[0.25112748,0.0016180661,0.73842245,0.0003309262,0.00013293947,0.0004895537,0.0001675267,0.000197221,0.0075138314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987815,0.0006775936,0.000060813,0.0001427793,0.00026789127,0.00006939369],"domain_scores_gemma":[0.998336,0.0009761105,0.00015210193,0.000120014585,0.00033283985,0.00008293435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034954438,0.0014491148,0.001355248,0.00085792074,0.0005401663,0.0012067712,0.0013436921,0.0017748567,0.002110234],"category_scores_gemma":[0.006068329,0.00066599046,0.0010340381,0.0007836583,0.0016565511,0.0032802538,0.0019815492,0.0032017513,0.0005138573],"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.00008862784,0.00006521846,0.00037888676,0.00038597587,0.000072536,0.00011680215,0.00026056168,0.6311228,0.004529058,0.32502955,0.0017828018,0.036167163],"study_design_scores_gemma":[0.000005624998,0.00003030808,0.000036885755,0.000012037248,0.0000032758644,0.000014416622,0.000011421074,0.9782637,0.00034642353,0.020335501,0.00093537616,0.000005108249],"about_ca_topic_score_codex":0.0026139836,"about_ca_topic_score_gemma":0.0018352702,"teacher_disagreement_score":0.0034954438,"about_ca_system_score_codex":0.0011992982,"about_ca_system_score_gemma":0.0016139762,"threshold_uncertainty_score":0.018485904},"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005690486,0.004836828,0.0003553794,0.01862589,0.9732858,0.000023687362,0.00009098124,0.00009259325,0.0026320135],"genre_scores_gemma":[0.00030742155,0.0031849158,0.00010359021,0.0045808,0.98512405,0.000019159337,0.000049891187,0.000047522677,0.0065826387],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9953843,0.000533512,0.00057727395,0.00091518543,0.0021655485,0.00042423187],"domain_scores_gemma":[0.986528,0.0042082015,0.0010769364,0.00064349326,0.005236612,0.0023068239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0043525225,0.0048416657,0.004650989,0.0041570235,0.0026262703,0.009577371,0.0041061,0.010110473,0.052583072],"category_scores_gemma":[0.015547793,0.0012620896,0.0050115394,0.0017409498,0.0024291095,0.005384688,0.0017704715,0.013804969,0.035064816],"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.000040334355,0.000021039647,0.000036032354,0.00024382886,0.000022112177,0.00007955872,0.0000075177095,0.00007072375,0.00011614084,0.0007258256,0.9915891,0.007047679],"study_design_scores_gemma":[0.00004124405,0.000048706213,0.00027035316,0.00023177543,0.000035493376,0.00023305499,0.000018901892,0.00034496764,0.0001817123,0.0016977814,0.9968777,0.000018337472],"about_ca_topic_score_codex":0.00059005484,"about_ca_topic_score_gemma":0.001051709,"teacher_disagreement_score":0.052583072,"about_ca_system_score_codex":0.0028553011,"about_ca_system_score_gemma":0.002414903,"threshold_uncertainty_score":0.17590791},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0058546783,0.000121640456,0.99302614,0.00008924794,0.000023923118,0.000046252586,0.0000074840063,0.000069969385,0.0007607396],"genre_scores_gemma":[0.16655591,0.0002945279,0.82931525,0.00013305682,0.00004221753,0.00037441347,0.00007004751,0.00007045075,0.003144083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99956614,0.00017388555,0.000017723289,0.00006546717,0.00014505602,0.00003177527],"domain_scores_gemma":[0.99960333,0.00020123024,0.000029887024,0.000028683198,0.000098974444,0.00003781516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012396354,0.0006893987,0.0010546288,0.00039969367,0.00043561353,0.0006794682,0.0012370364,0.0013919479,0.0020016942],"category_scores_gemma":[0.0016752157,0.00046725475,0.0005799275,0.00051409734,0.00091418327,0.0011516727,0.0014344265,0.0019341368,0.00040385866],"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.00018960373,0.00014825702,0.0006043388,0.0002855367,0.00008110755,0.00018999001,0.00021581003,0.7683498,0.013120823,0.06589359,0.0025153963,0.14840575],"study_design_scores_gemma":[0.000009807283,0.000025915602,0.000025725672,0.0000038409025,0.0000018182909,0.000015119579,0.0000047711496,0.9973616,0.00044104402,0.001745885,0.00036038578,0.000004068619],"about_ca_topic_score_codex":0.0029783326,"about_ca_topic_score_gemma":0.002412858,"teacher_disagreement_score":0.0029783326,"about_ca_system_score_codex":0.00047704694,"about_ca_system_score_gemma":0.0017878432,"threshold_uncertainty_score":0.0066963434},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029718592,0.000054724667,0.9966138,0.000028956181,0.000010012257,0.000013507547,0.0000042456304,0.000045463068,0.00025733083],"genre_scores_gemma":[0.12203184,0.00018741071,0.8760467,0.00007500101,0.00003222205,0.00015018975,0.00007783765,0.00008095826,0.0013178719],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996699,0.000089020294,0.000024181858,0.000058137197,0.00013437128,0.000024383144],"domain_scores_gemma":[0.9996159,0.00014521553,0.000038775226,0.000054463817,0.000111327005,0.000034318266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00067525695,0.00075916795,0.00069825264,0.0003451043,0.00031552173,0.0005136134,0.0011267912,0.00097526726,0.001637762],"category_scores_gemma":[0.0011476125,0.00030091888,0.0006654908,0.0005134416,0.0006129234,0.0009469408,0.0010833937,0.0013293023,0.00042500495],"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.00020630105,0.00012295248,0.00067551294,0.00024688648,0.0000744288,0.00022050159,0.00026090673,0.57358676,0.06105141,0.05190608,0.0025715553,0.30907658],"study_design_scores_gemma":[0.00000920786,0.000030684907,0.00004219863,0.0000035273088,0.000002850349,0.000043901942,0.000007871808,0.99387264,0.0020096584,0.003031134,0.00094113976,0.0000052875635],"about_ca_topic_score_codex":0.0010232028,"about_ca_topic_score_gemma":0.0009131686,"teacher_disagreement_score":0.001637762,"about_ca_system_score_codex":0.0003258745,"about_ca_system_score_gemma":0.00077597384,"threshold_uncertainty_score":0.005478859},"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":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00026769948,0.010048631,0.002477469,0.09698644,0.84907234,0.000078120436,0.0018976572,0.00046885098,0.03870283],"genre_scores_gemma":[0.009005614,0.0157981,0.006528188,0.08449997,0.16463192,0.00033128646,0.0032596348,0.0016494875,0.71429574],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9931471,0.0012933129,0.0007381715,0.0010745901,0.0032476839,0.0004991373],"domain_scores_gemma":[0.9859016,0.0033042936,0.0005514997,0.0007370197,0.008997365,0.00050823094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037374173,0.0032745448,0.0033991055,0.0058781113,0.0048466516,0.0043690144,0.0049252138,0.0070254444,0.0948319],"category_scores_gemma":[0.028533323,0.0015027033,0.002859007,0.0043984777,0.003004036,0.0047374503,0.002836565,0.008025383,0.05589792],"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.000021701375,0.000009375763,0.000027673303,0.00009622101,0.000009507493,0.00007112107,0.00002173068,0.000054967273,0.00003439039,0.0036669038,0.9928034,0.0031830159],"study_design_scores_gemma":[0.00003018926,0.000022312875,0.000942455,0.00020492235,0.000033056866,0.00018282542,0.000057802936,0.00048361177,0.00022979321,0.0135077275,0.9842464,0.000058859412],"about_ca_topic_score_codex":0.05151918,"about_ca_topic_score_gemma":0.07746123,"teacher_disagreement_score":0.0948319,"about_ca_system_score_codex":0.00862833,"about_ca_system_score_gemma":0.0042348094,"threshold_uncertainty_score":0.3172443},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057605796,0.00077520567,0.90831524,0.0005526586,0.00010514014,0.00006123034,0.0001532189,0.000089437795,0.032342132],"genre_scores_gemma":[0.760883,0.0015486301,0.2035028,0.0004989335,0.0003018605,0.00026847213,0.00055021956,0.0001545063,0.032291587],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992798,0.00013498311,0.000039488572,0.00012289065,0.00035839505,0.000064501975],"domain_scores_gemma":[0.9986745,0.00044743327,0.00022968117,0.000102678736,0.00038967308,0.00015606327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015682479,0.0006883971,0.00041248873,0.00088786887,0.0007232167,0.0015826607,0.0008336337,0.0005034563,0.0032973285],"category_scores_gemma":[0.003010356,0.00026759913,0.0008536966,0.00041410292,0.0019606012,0.0036858015,0.0025138943,0.0028432682,0.0004886313],"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.000024654635,0.000018289455,0.00030157564,0.000069127505,0.00001170984,0.000098037526,0.00016627215,0.008568365,0.003901786,0.97813696,0.00078052614,0.0079226745],"study_design_scores_gemma":[0.000022170316,0.000083694635,0.0007669781,0.000045911725,0.00001634484,0.00036164376,0.00021271377,0.19499841,0.0049111885,0.78737456,0.011176987,0.000029338114],"about_ca_topic_score_codex":0.0008645946,"about_ca_topic_score_gemma":0.00077215733,"teacher_disagreement_score":0.0032973285,"about_ca_system_score_codex":0.000997281,"about_ca_system_score_gemma":0.00075566873,"threshold_uncertainty_score":0.011030674},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6457214,0.00046466087,0.34207007,0.00027545792,0.00004051115,0.000045998047,0.00021657778,0.00012819307,0.0110372165],"genre_scores_gemma":[0.97108036,0.00019699053,0.025770111,0.000024966339,0.000033078682,0.000029798497,0.0001751547,0.000030029889,0.002659532],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993843,0.00009462412,0.000030746683,0.00012765931,0.00028490962,0.000077784396],"domain_scores_gemma":[0.99898046,0.0004595708,0.00019608988,0.000106812506,0.00012595806,0.0001309633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005635443,0.00065242464,0.0007090711,0.00087549485,0.00046284354,0.0018866712,0.0010124963,0.00047660538,0.001643958],"category_scores_gemma":[0.0031984933,0.00032135594,0.0005831375,0.00046945596,0.001619817,0.0023840293,0.0014413381,0.001476317,0.00014393477],"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.00029843234,0.00005658877,0.002760385,0.00015212524,0.00008460361,0.0010442943,0.0005716108,0.13577686,0.016724616,0.82133234,0.00070877944,0.020489303],"study_design_scores_gemma":[0.00001876972,0.000083863655,0.0015258102,0.00003612783,0.000019278395,0.00046288362,0.0003230393,0.7654028,0.0031076032,0.22711447,0.0018806902,0.000024658453],"about_ca_topic_score_codex":0.0011613248,"about_ca_topic_score_gemma":0.0006930174,"teacher_disagreement_score":0.0018866712,"about_ca_system_score_codex":0.00093936466,"about_ca_system_score_gemma":0.00033506603,"threshold_uncertainty_score":0.0068156123},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02294254,0.0005624232,0.954057,0.00073204853,0.00012924401,0.000045190918,0.000080852,0.000057126454,0.021393616],"genre_scores_gemma":[0.5275801,0.0012710639,0.44906697,0.0003386278,0.00032443998,0.00026140639,0.00022797313,0.00013682112,0.020792635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988226,0.00039015853,0.0000811906,0.00016963211,0.00043252972,0.00010380011],"domain_scores_gemma":[0.99891126,0.00047954064,0.00010591473,0.00010560831,0.00025527165,0.0001424824],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034813972,0.00067190157,0.0007651402,0.0014015409,0.001039881,0.0018703741,0.0009561363,0.0007399786,0.0026980347],"category_scores_gemma":[0.0040028114,0.00034777127,0.0013082923,0.0007227286,0.0031956956,0.003406225,0.0022037756,0.0029007543,0.00039039893],"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.0000021986093,0.000005186022,0.000028793615,0.000011168707,0.0000023609555,0.000014005079,0.00005687445,0.0015819492,0.00035967605,0.99614954,0.00016086582,0.0016274002],"study_design_scores_gemma":[0.000005144934,0.000015243108,0.000046863726,0.0000098309865,0.0000033081556,0.000032711443,0.000036548394,0.026287073,0.00054230593,0.97008395,0.0029307115,0.00000618467],"about_ca_topic_score_codex":0.00057257933,"about_ca_topic_score_gemma":0.0006244266,"teacher_disagreement_score":0.0034813972,"about_ca_system_score_codex":0.0012112141,"about_ca_system_score_gemma":0.00090947485,"threshold_uncertainty_score":0.018411636},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10402403,0.00024304455,0.88513494,0.00023464933,0.000019520863,0.00006776022,0.00006331119,0.000059553862,0.0101531735],"genre_scores_gemma":[0.81173867,0.0006207505,0.17415212,0.0001332954,0.00005971057,0.00028290282,0.00024473626,0.0001274015,0.012640379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989015,0.00040929724,0.00008595249,0.00019669655,0.00025576042,0.00015074073],"domain_scores_gemma":[0.9977581,0.0010808803,0.00035659768,0.00022423448,0.00038416532,0.0001960568],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021530525,0.0008982393,0.0007769853,0.0010113275,0.0005771341,0.0016665363,0.0007429531,0.0008532156,0.004324949],"category_scores_gemma":[0.0062802555,0.0005103518,0.00083305046,0.0008270749,0.0023468416,0.003719082,0.0023302021,0.001409055,0.00038338735],"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.00005146795,0.00004249786,0.0009290628,0.00009340062,0.000029539773,0.0000728562,0.0002883864,0.029263716,0.004424761,0.9520765,0.00033037423,0.012397461],"study_design_scores_gemma":[0.000032469095,0.00022978641,0.000992004,0.000059773993,0.000029984163,0.00012863631,0.00042504957,0.30652124,0.00742038,0.6792462,0.0048777275,0.000036742793],"about_ca_topic_score_codex":0.00045661526,"about_ca_topic_score_gemma":0.00039013923,"teacher_disagreement_score":0.004324949,"about_ca_system_score_codex":0.0008230061,"about_ca_system_score_gemma":0.0009368303,"threshold_uncertainty_score":0.014468372},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017786941,0.00017256125,0.99710554,0.000040896735,0.000044226283,0.000031602878,0.0000040181926,0.000044232438,0.0007781544],"genre_scores_gemma":[0.10413071,0.00051080476,0.8912661,0.000070872346,0.000072893075,0.00038968396,0.000046060464,0.000071728486,0.0034410257],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996712,0.00010903327,0.000022267885,0.000059270078,0.00011531574,0.00002284261],"domain_scores_gemma":[0.99971586,0.00014089218,0.000024103603,0.000026977898,0.00007698756,0.000015182798],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010479221,0.0009075108,0.0009186666,0.0008473639,0.0006875854,0.00065273134,0.0013931872,0.0014913717,0.0026271723],"category_scores_gemma":[0.0016487482,0.0003940184,0.00098065,0.0006499856,0.000770317,0.0009392778,0.0012826523,0.0015203485,0.0006469868],"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.00009798905,0.00008577908,0.0007564345,0.000385651,0.00011441449,0.00018802022,0.00024936223,0.50950795,0.017048877,0.20769848,0.002014917,0.26185212],"study_design_scores_gemma":[0.000015862734,0.00006938086,0.000058186888,0.000022437924,0.0000092530845,0.000056381556,0.000010629616,0.9796036,0.0011491432,0.015006661,0.0039875414,0.000010945637],"about_ca_topic_score_codex":0.0015520797,"about_ca_topic_score_gemma":0.0010910601,"teacher_disagreement_score":0.0026271723,"about_ca_system_score_codex":0.0005634846,"about_ca_system_score_gemma":0.0009324729,"threshold_uncertainty_score":0.0087887645},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33138287,0.0009782254,0.54544395,0.0023348676,0.00011399531,0.00013324352,0.0013794992,0.0004093951,0.11782387],"genre_scores_gemma":[0.93218637,0.00043189235,0.04015844,0.00041530124,0.0002554652,0.00011639777,0.0011850864,0.00021749306,0.025033686],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99897814,0.00017658663,0.000050902607,0.00029949954,0.00031015958,0.00018490736],"domain_scores_gemma":[0.9958883,0.0021272243,0.00043254453,0.0002830913,0.000554503,0.00071435363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015547681,0.0008759838,0.0011407395,0.0028584674,0.0020084316,0.00351374,0.0022991411,0.0008397028,0.0102682635],"category_scores_gemma":[0.006050868,0.0008017971,0.001001721,0.0018969607,0.0032831675,0.004793895,0.00399489,0.0030334163,0.0007707921],"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.00004276597,0.000024701218,0.00033656685,0.000051485542,0.000009704071,0.00003851234,0.00018543642,0.0017161405,0.0012117648,0.9909696,0.0010595203,0.0043538623],"study_design_scores_gemma":[0.000014641322,0.000026202437,0.0005877492,0.000020224803,0.000012994349,0.00009878536,0.00010165379,0.017254697,0.0012538949,0.97737896,0.003235796,0.000014427505],"about_ca_topic_score_codex":0.0015196233,"about_ca_topic_score_gemma":0.001376642,"teacher_disagreement_score":0.0102682635,"about_ca_system_score_codex":0.002444289,"about_ca_system_score_gemma":0.0008429061,"threshold_uncertainty_score":0.034350812},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024766779,0.00043765086,0.90835416,0.001276952,0.00009553646,0.00013482966,0.000306415,0.0000980714,0.0645296],"genre_scores_gemma":[0.5851703,0.0015416822,0.37467715,0.0010809912,0.00026513071,0.0009019861,0.00081465545,0.00045926616,0.035088833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924576,0.0002566854,0.000037233043,0.00014767906,0.00016203108,0.00015063342],"domain_scores_gemma":[0.99905175,0.0004893224,0.00011443493,0.000085586835,0.00017390268,0.00008495287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024340474,0.00093238766,0.00091177365,0.00083340897,0.00064232846,0.0022005842,0.00088023924,0.001577957,0.012945991],"category_scores_gemma":[0.0053783963,0.00052479515,0.0013437996,0.00081317173,0.0022701467,0.00408364,0.0020982819,0.0031309682,0.001487004],"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.000008744961,0.000021852346,0.000064708394,0.00004088813,0.0000043794307,0.000024770667,0.000063607506,0.022570573,0.00040755866,0.9710271,0.0011321544,0.0046336497],"study_design_scores_gemma":[0.000028802915,0.00005315825,0.00012555618,0.000070808725,0.000007399642,0.00003213314,0.0000613127,0.24187605,0.0007599417,0.7498819,0.0070855264,0.00001746309],"about_ca_topic_score_codex":0.0016847502,"about_ca_topic_score_gemma":0.0016024252,"teacher_disagreement_score":0.012945991,"about_ca_system_score_codex":0.001713311,"about_ca_system_score_gemma":0.001427319,"threshold_uncertainty_score":0.043308616},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013450773,0.00083339686,0.98005015,0.00054349116,0.00009294939,0.00002225036,0.000060663093,0.00004818161,0.0048981733],"genre_scores_gemma":[0.61948866,0.0037265606,0.3539809,0.00045240656,0.00026411552,0.00022311948,0.00038589328,0.0005167089,0.020961674],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990128,0.00047817433,0.00004572112,0.00011999441,0.00028696767,0.000056221797],"domain_scores_gemma":[0.99770075,0.0014607733,0.00018899584,0.00013801383,0.0003734273,0.0001380549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037680762,0.0010195631,0.0012616412,0.0011195281,0.00045934902,0.002721125,0.0009619688,0.0014954305,0.0020793325],"category_scores_gemma":[0.008735849,0.0006698374,0.0008135708,0.00096508575,0.0017633715,0.0025327166,0.0020542596,0.0024950635,0.00033341223],"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.00012292144,0.00008927387,0.0007641714,0.00032090466,0.00006685271,0.00011281734,0.00017826793,0.19223092,0.008551318,0.73976356,0.0034151438,0.054383952],"study_design_scores_gemma":[0.000012834828,0.0000573396,0.00023267142,0.000045259883,0.000020138421,0.00008272397,0.000037042664,0.79370284,0.0013245231,0.2007016,0.0037600014,0.00002301486],"about_ca_topic_score_codex":0.0014087537,"about_ca_topic_score_gemma":0.0012879506,"teacher_disagreement_score":0.0037680762,"about_ca_system_score_codex":0.001235695,"about_ca_system_score_gemma":0.0016292506,"threshold_uncertainty_score":0.01992768},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09043998,0.0013418866,0.8893869,0.0016138762,0.00010367457,0.000075390904,0.00014616847,0.00028810414,0.016604023],"genre_scores_gemma":[0.89491916,0.0022990338,0.08382294,0.0003906166,0.0002933585,0.00026259242,0.00036700896,0.0002461214,0.017399171],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989895,0.00045752313,0.000044656947,0.00018132261,0.000191562,0.00013536164],"domain_scores_gemma":[0.97903216,0.01743144,0.0011655255,0.00088558276,0.0009399617,0.00054526195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004156749,0.0011467143,0.0016802129,0.0024033801,0.001165863,0.0030310769,0.0026578861,0.002783023,0.0064436197],"category_scores_gemma":[0.029762106,0.0010732245,0.0017924603,0.0016367268,0.004303908,0.005031951,0.0034336466,0.003645966,0.00041712425],"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.000055439046,0.000106197855,0.0013903602,0.00013467546,0.00007113716,0.00013877597,0.00020012233,0.16106099,0.0013513122,0.8240167,0.0014379014,0.010036379],"study_design_scores_gemma":[0.000009318481,0.000015115077,0.0003012462,0.00002358321,0.000018790399,0.000040263767,0.000041938223,0.79383373,0.00023942636,0.20509872,0.00036021043,0.00001771914],"about_ca_topic_score_codex":0.0028165958,"about_ca_topic_score_gemma":0.0022915832,"teacher_disagreement_score":0.0064436197,"about_ca_system_score_codex":0.0014864341,"about_ca_system_score_gemma":0.0015544151,"threshold_uncertainty_score":0.021983266},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004820063,0.00013095656,0.99394196,0.000051019364,0.000040159757,0.000021002483,0.00000502712,0.00012822561,0.00086166244],"genre_scores_gemma":[0.3359135,0.0003638888,0.6596155,0.00018210428,0.00013187798,0.00033903628,0.00009699084,0.00013986648,0.0032172913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995826,0.00009747561,0.00003356782,0.00007912629,0.00016373424,0.000043523378],"domain_scores_gemma":[0.9994413,0.00024508938,0.00006645179,0.000067146284,0.0001402483,0.000039733037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007765094,0.00067633577,0.0009564962,0.00057283096,0.00043621068,0.0007392975,0.0014313665,0.0011556448,0.0017323442],"category_scores_gemma":[0.0021033129,0.00045957218,0.0006882613,0.00060856354,0.00070860295,0.0011034454,0.0013058523,0.0012482282,0.00042834174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014983099,0.00012790693,0.0012697396,0.0002470559,0.00014512936,0.00014000134,0.00016463893,0.7416918,0.011120057,0.02975707,0.0022491748,0.21293764],"study_design_scores_gemma":[0.000014265041,0.000032131837,0.000054435608,0.0000046709497,0.000005498887,0.000020415204,0.00000353873,0.9975777,0.000539744,0.0010506256,0.00069078204,0.000006138554],"about_ca_topic_score_codex":0.001612312,"about_ca_topic_score_gemma":0.0013304105,"teacher_disagreement_score":0.0017323442,"about_ca_system_score_codex":0.0002976359,"about_ca_system_score_gemma":0.00071849045,"threshold_uncertainty_score":0.0057953},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034376043,0.0012519938,0.9911283,0.00028983701,0.00020273501,0.00010234397,0.00003275439,0.00005828287,0.0034961838],"genre_scores_gemma":[0.15248163,0.00334327,0.82301205,0.0005642405,0.00052987627,0.0012134496,0.00030751977,0.0004973546,0.018050622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976349,0.0013503333,0.00012728074,0.00022023518,0.00053218147,0.00013512588],"domain_scores_gemma":[0.9887726,0.008759416,0.0003294453,0.00039676734,0.001442207,0.00029969687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008420137,0.0030442683,0.0026452157,0.0022284342,0.0010831795,0.002013909,0.00394197,0.0044185626,0.0047227824],"category_scores_gemma":[0.021571329,0.0013915249,0.0029120897,0.0020445923,0.0039508,0.0029699788,0.0062466,0.0054079923,0.00085231604],"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.00040465503,0.0002254691,0.000995731,0.001154871,0.0003975141,0.0003414376,0.00066455035,0.6066045,0.0067576454,0.28845724,0.0042931666,0.08970316],"study_design_scores_gemma":[0.000019626696,0.00007164223,0.00008639997,0.000052107313,0.00001955303,0.00002037085,0.00002472805,0.9676579,0.0004000819,0.029757965,0.0018710304,0.00001857256],"about_ca_topic_score_codex":0.010041991,"about_ca_topic_score_gemma":0.0077323876,"teacher_disagreement_score":0.010041991,"about_ca_system_score_codex":0.0019890452,"about_ca_system_score_gemma":0.0027321475,"threshold_uncertainty_score":0.04453051},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006432725,0.00028548867,0.9912298,0.00006421593,0.00004060579,0.0000308599,0.0000051463435,0.00006942134,0.0018417625],"genre_scores_gemma":[0.31384018,0.0006407715,0.6821047,0.00009554831,0.00008239844,0.0002635772,0.000048126705,0.000075907985,0.0028488229],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999225,0.0003014685,0.000052078332,0.00010886733,0.00025334922,0.00005921589],"domain_scores_gemma":[0.9983311,0.000969676,0.00012997985,0.00014228873,0.0003573047,0.000069715345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020980202,0.00082212506,0.0010455083,0.0007945506,0.00060081464,0.00097395096,0.0015586532,0.0018066706,0.0013019906],"category_scores_gemma":[0.0050348113,0.00030643964,0.0010566058,0.00062906544,0.0012702207,0.0011759845,0.0014102209,0.0011344202,0.00028879583],"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.00021488855,0.00010036406,0.001680821,0.0005432319,0.00018816412,0.0003619198,0.0004968754,0.63560516,0.017622674,0.19567272,0.0016299513,0.14588326],"study_design_scores_gemma":[0.0000098423925,0.00004504047,0.00007617978,0.000016019885,0.000010027542,0.000087416534,0.000013100075,0.9885634,0.0017290271,0.008400544,0.0010364057,0.000012958276],"about_ca_topic_score_codex":0.0019260341,"about_ca_topic_score_gemma":0.0012623371,"teacher_disagreement_score":0.0020980202,"about_ca_system_score_codex":0.0006510889,"about_ca_system_score_gemma":0.0014922603,"threshold_uncertainty_score":0.011095524},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030792812,0.00020967674,0.9958417,0.000048957678,0.000043913555,0.000038675196,0.0000066350785,0.00006492367,0.00066622265],"genre_scores_gemma":[0.089892,0.0004738416,0.9063993,0.0000680595,0.00007996602,0.00034413024,0.00007405804,0.00009657535,0.002572099],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991322,0.00030614872,0.000057956608,0.00013598526,0.0003096001,0.0000581261],"domain_scores_gemma":[0.99877256,0.00046105098,0.00012582297,0.00013170223,0.0004216212,0.000087267974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020705548,0.0013089217,0.0011479099,0.0008268436,0.0005895169,0.00086676405,0.0019064068,0.0016241156,0.0028799607],"category_scores_gemma":[0.004054906,0.00053625903,0.0015504513,0.0006417891,0.0009571221,0.0016463546,0.0016855733,0.002996411,0.00064153684],"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.00017973549,0.00018182363,0.000990716,0.00059929886,0.00019672781,0.00019571927,0.00046355472,0.5542866,0.014056444,0.19268696,0.0033661686,0.23279625],"study_design_scores_gemma":[0.000027411204,0.000074443116,0.00010564006,0.00001927413,0.000015902819,0.00008230262,0.000021252436,0.98307496,0.0022693197,0.011665121,0.0026235161,0.000020903699],"about_ca_topic_score_codex":0.001237905,"about_ca_topic_score_gemma":0.0014284867,"teacher_disagreement_score":0.0028799607,"about_ca_system_score_codex":0.000624601,"about_ca_system_score_gemma":0.001593592,"threshold_uncertainty_score":0.010950327},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023672688,0.000098932906,0.99660575,0.00004029693,0.000032889708,0.000020925,0.0000056793942,0.00006839302,0.0007597594],"genre_scores_gemma":[0.12445866,0.00040617172,0.87051153,0.0001278726,0.00016003063,0.00029819226,0.000062234416,0.00012816487,0.0038470663],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991253,0.00025403398,0.00006160188,0.000120418,0.0003626432,0.000075995515],"domain_scores_gemma":[0.99916553,0.00043487299,0.00010066332,0.00007243719,0.00014951063,0.0000770089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017702804,0.00095948897,0.001127197,0.0011812943,0.0005321821,0.0010233418,0.0018422602,0.001249641,0.0030017004],"category_scores_gemma":[0.0038141173,0.00053526345,0.0008792996,0.00082953234,0.0013983054,0.0021044852,0.0025397916,0.00210975,0.00049803715],"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.0001380792,0.00012221232,0.00051491207,0.0003451929,0.00008758059,0.00011686285,0.00033328982,0.37911212,0.007317647,0.41490147,0.0022632454,0.19474734],"study_design_scores_gemma":[0.000035505087,0.00009931511,0.00009989997,0.000022244678,0.000011546838,0.000049908485,0.000022758453,0.9514532,0.0019932922,0.04184453,0.004344822,0.000023013528],"about_ca_topic_score_codex":0.00086729194,"about_ca_topic_score_gemma":0.0009898697,"teacher_disagreement_score":0.0030017004,"about_ca_system_score_codex":0.0006524505,"about_ca_system_score_gemma":0.0011947778,"threshold_uncertainty_score":0.010041654},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05124478,0.0024889233,0.8881647,0.002485465,0.0004200565,0.00015982114,0.00034011435,0.000086134685,0.054610007],"genre_scores_gemma":[0.7880701,0.003431946,0.18823436,0.0010186047,0.0007314634,0.000542824,0.00058878184,0.00022366423,0.017158236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806625,0.0010188257,0.00011869883,0.00025759236,0.0003420961,0.0001965332],"domain_scores_gemma":[0.9921308,0.005888054,0.00061852863,0.00020176944,0.00081836496,0.00034249126],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0074170777,0.0019961,0.0018542954,0.0025673832,0.0009842466,0.0045870654,0.0016043595,0.0024577815,0.0046555097],"category_scores_gemma":[0.01917115,0.0009885111,0.0019834447,0.001655851,0.0037867455,0.005313783,0.0037873227,0.0059435703,0.0004564623],"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.00016500845,0.00014353063,0.00034202967,0.00026441476,0.00005820604,0.00025023211,0.0002542013,0.09444431,0.0019446444,0.88914174,0.0019621996,0.011029529],"study_design_scores_gemma":[0.00005569501,0.00012540608,0.00033104344,0.00012505877,0.000030393165,0.00016957315,0.00015973963,0.4543734,0.00090863917,0.54091644,0.0027674916,0.000037129903],"about_ca_topic_score_codex":0.0015090046,"about_ca_topic_score_gemma":0.0007441378,"teacher_disagreement_score":0.0074170777,"about_ca_system_score_codex":0.0017843184,"about_ca_system_score_gemma":0.0019559183,"threshold_uncertainty_score":0.039225757},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001790819,0.00007680241,0.9962507,0.00006782581,0.00004740372,0.000045286335,0.000014771072,0.000121611745,0.0015848401],"genre_scores_gemma":[0.114668116,0.00018987784,0.88010025,0.00022624114,0.0000827246,0.00034495894,0.00011640787,0.00019217635,0.004079162],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994357,0.00017560089,0.000032976244,0.000086701555,0.00022559494,0.000043392203],"domain_scores_gemma":[0.9996308,0.00016609894,0.000021204554,0.00004418148,0.00010002056,0.000037671613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008563575,0.00093326846,0.0008446693,0.00067034195,0.00032653945,0.0007928692,0.0016001057,0.001281092,0.0037066012],"category_scores_gemma":[0.0018829905,0.00039705692,0.00070891576,0.00049416546,0.0008522381,0.001180214,0.0014742216,0.001863691,0.0008354059],"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.00027615344,0.00024218077,0.00059426145,0.00038605253,0.00015251093,0.00019959088,0.00020502557,0.42785424,0.024082452,0.22443503,0.0074587394,0.31411365],"study_design_scores_gemma":[0.00003548694,0.000056916182,0.00006293759,0.000010531659,0.0000069160847,0.000034794917,0.0000071351756,0.9844812,0.0017218329,0.010641459,0.0029262032,0.000014430589],"about_ca_topic_score_codex":0.0017162199,"about_ca_topic_score_gemma":0.0022290123,"teacher_disagreement_score":0.0037066012,"about_ca_system_score_codex":0.00056397653,"about_ca_system_score_gemma":0.0009957445,"threshold_uncertainty_score":0.012399852},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035934045,0.00011136318,0.99488986,0.00006339186,0.000036005033,0.000029903758,0.000013393698,0.00006257456,0.0012001009],"genre_scores_gemma":[0.22706456,0.0003414423,0.76529735,0.00013945188,0.00008911464,0.00043788413,0.00012472307,0.0001951331,0.0063103554],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939895,0.00028048325,0.000025819385,0.000080746744,0.00016464498,0.00004937729],"domain_scores_gemma":[0.9995585,0.00018779219,0.000055752662,0.00004615293,0.000107787855,0.000043939162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001219313,0.0010022527,0.0010966068,0.0005522288,0.00036351176,0.00071322726,0.0018349559,0.0013579961,0.0024343913],"category_scores_gemma":[0.0019202352,0.00047886383,0.0011015371,0.00028892056,0.0010526868,0.0011402663,0.0015639472,0.0015957442,0.0006054574],"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.00017822195,0.00010936555,0.000563272,0.0004738397,0.000110304085,0.0003126634,0.00027783331,0.74236536,0.022822915,0.17705351,0.0021708587,0.053561892],"study_design_scores_gemma":[0.000013144844,0.00004287178,0.00003510678,0.000009978377,0.0000042192646,0.000029754188,0.0000065930794,0.9920941,0.0008651448,0.0056397878,0.0012494838,0.000009789187],"about_ca_topic_score_codex":0.0018988756,"about_ca_topic_score_gemma":0.0012428375,"teacher_disagreement_score":0.0024343913,"about_ca_system_score_codex":0.00049833965,"about_ca_system_score_gemma":0.0009882372,"threshold_uncertainty_score":0.008143902},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069075455,0.00028266266,0.9897237,0.00022651971,0.000047629863,0.000030603645,0.000026740876,0.000032055403,0.0027225057],"genre_scores_gemma":[0.5420441,0.0009790254,0.4351076,0.0002584453,0.00012988583,0.0005690547,0.00021203654,0.00018424125,0.020515596],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993862,0.00030115477,0.000023847682,0.00006474236,0.00017574933,0.000048392634],"domain_scores_gemma":[0.999246,0.00043149947,0.000065246284,0.000041062263,0.00015428831,0.0000619149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013917437,0.0007811814,0.00084590935,0.00063200796,0.00039656422,0.00090804184,0.0009585087,0.0008627817,0.002448718],"category_scores_gemma":[0.0023018704,0.0003307018,0.0005799234,0.00041071913,0.0009966989,0.0012353036,0.0014182599,0.0013397858,0.0003615466],"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.00011396299,0.00007125721,0.00042176104,0.00039484273,0.00008249034,0.00017264954,0.00015561067,0.42349985,0.012047101,0.5291263,0.00190698,0.032007255],"study_design_scores_gemma":[0.000010783,0.00003360207,0.000056001176,0.000014787991,0.0000049445684,0.000025823005,0.000011534596,0.9573911,0.00056594686,0.039915975,0.0019617006,0.000007816601],"about_ca_topic_score_codex":0.0012643358,"about_ca_topic_score_gemma":0.0010375289,"teacher_disagreement_score":0.002448718,"about_ca_system_score_codex":0.0007271265,"about_ca_system_score_gemma":0.00087944075,"threshold_uncertainty_score":0.008191764},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00686782,0.00022047515,0.99053216,0.00008069096,0.0001724488,0.00003428182,0.000016918922,0.00016885,0.0019063283],"genre_scores_gemma":[0.13562922,0.00027505463,0.8560569,0.00017238256,0.00014830969,0.00020441787,0.00011665199,0.00017513291,0.007221926],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995264,0.00016214134,0.00003853024,0.00008054168,0.00015339775,0.000039078375],"domain_scores_gemma":[0.99936897,0.0002038537,0.000060338974,0.00009785804,0.00018849934,0.00008063397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010030488,0.0009865885,0.0010574693,0.000750038,0.00040881225,0.0009652605,0.0017050008,0.0015655205,0.0024880038],"category_scores_gemma":[0.002402117,0.0004883038,0.00073312735,0.0006943888,0.0007030576,0.0015628166,0.0018197604,0.0012435248,0.0007440779],"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.00057396194,0.00034037072,0.00111239,0.0004950381,0.0002149419,0.00022762916,0.00027852415,0.4024889,0.02391905,0.12991309,0.0075464477,0.43288973],"study_design_scores_gemma":[0.000033386714,0.00007479428,0.00013458003,0.0000102270715,0.000009603743,0.00006412404,0.00000803704,0.9897764,0.0017447119,0.00558002,0.0025492543,0.000014846989],"about_ca_topic_score_codex":0.0008305839,"about_ca_topic_score_gemma":0.001253027,"teacher_disagreement_score":0.0024880038,"about_ca_system_score_codex":0.00039441712,"about_ca_system_score_gemma":0.00081402104,"threshold_uncertainty_score":0.008323252},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0016472366,0.00009591895,0.99704,0.00007111605,0.000032752447,0.000052131432,0.000019011224,0.000065361775,0.00097649876],"genre_scores_gemma":[0.06635028,0.00023741667,0.9303377,0.00018092463,0.00009184016,0.0004853669,0.00020352557,0.00015558291,0.001957319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987041,0.0004201281,0.000096327676,0.00021077978,0.00042124186,0.00014744228],"domain_scores_gemma":[0.9976004,0.0012898541,0.00023849028,0.00020304769,0.0004931502,0.00017508779],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003621646,0.0012936107,0.0014321213,0.0011936164,0.00060201145,0.0017261665,0.0032755458,0.0020759504,0.0058029834],"category_scores_gemma":[0.009496211,0.00091942225,0.0012483811,0.0011824262,0.001414193,0.0028394852,0.0033110974,0.0037231587,0.0008130818],"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.00020529339,0.00018289164,0.00068704004,0.0004670796,0.00009967411,0.0001281062,0.0004083909,0.5337777,0.0043971296,0.2549254,0.0047904593,0.19993077],"study_design_scores_gemma":[0.000037122943,0.00005718249,0.00008417427,0.0000293097,0.0000077600625,0.000028035607,0.000023556959,0.98188376,0.00067362987,0.014871343,0.0022868582,0.000017249651],"about_ca_topic_score_codex":0.0035164726,"about_ca_topic_score_gemma":0.0036358521,"teacher_disagreement_score":0.0058029834,"about_ca_system_score_codex":0.0010151564,"about_ca_system_score_gemma":0.0026855282,"threshold_uncertainty_score":0.019412935},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035650588,0.00039373245,0.99020267,0.00018430898,0.00027991016,0.00008102077,0.000024574014,0.000107109714,0.005161633],"genre_scores_gemma":[0.08795537,0.00045019627,0.8951981,0.00022601632,0.00022258356,0.0005388904,0.00007962799,0.00020592075,0.015123231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915254,0.00034306696,0.00004220989,0.00009301265,0.00026782422,0.00010130658],"domain_scores_gemma":[0.9984273,0.00095517805,0.00012458731,0.0001237245,0.00024682432,0.00012240966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001576549,0.0018266722,0.0016168546,0.0014248481,0.00088859064,0.0013739406,0.0026645686,0.0031753215,0.0048266836],"category_scores_gemma":[0.0041788695,0.00079703593,0.0015233271,0.0013715344,0.0015451286,0.0016011595,0.0024194815,0.0026949032,0.00080607476],"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.00018232586,0.0002844772,0.00031463814,0.00033232648,0.00014272935,0.00015756613,0.0001497278,0.6719092,0.003942485,0.15669782,0.0062748175,0.15961178],"study_design_scores_gemma":[0.000031226024,0.00005437523,0.000070041926,0.000018703182,0.000015743202,0.000042638763,0.000016399528,0.98493147,0.00044993244,0.012201465,0.0021446722,0.000023390467],"about_ca_topic_score_codex":0.0037004221,"about_ca_topic_score_gemma":0.006600491,"teacher_disagreement_score":0.0048266836,"about_ca_system_score_codex":0.0008901156,"about_ca_system_score_gemma":0.0015072074,"threshold_uncertainty_score":0.016146898},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056717753,0.006150874,0.8876045,0.00334257,0.00037951596,0.00008045662,0.00027767345,0.00016579722,0.045280904],"genre_scores_gemma":[0.7686985,0.00514974,0.20980157,0.001098103,0.00079470046,0.00024370356,0.00023646322,0.00014002489,0.013837112],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988996,0.00024336894,0.000057773497,0.00035735645,0.00033463674,0.0001073254],"domain_scores_gemma":[0.9975647,0.0014646101,0.00018150451,0.00027039403,0.00037647903,0.00014238304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027108532,0.0007306304,0.0010192066,0.0025127036,0.0014577453,0.0016116635,0.0016110934,0.0014592953,0.00359109],"category_scores_gemma":[0.005997023,0.00045640813,0.002345837,0.0015005384,0.00434245,0.0045209276,0.003115811,0.0037352657,0.0004123183],"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.000011699126,0.00000681014,0.00031947845,0.000054999062,0.000013658412,0.000066968234,0.00015729998,0.002965198,0.0007279184,0.9891651,0.00054068543,0.0059700636],"study_design_scores_gemma":[0.000019046929,0.00006476336,0.0008514018,0.00004357238,0.000016879521,0.0003621354,0.00010199936,0.042704582,0.0009724788,0.9366445,0.018181827,0.000036854486],"about_ca_topic_score_codex":0.0030412872,"about_ca_topic_score_gemma":0.0013871071,"teacher_disagreement_score":0.00359109,"about_ca_system_score_codex":0.0023861784,"about_ca_system_score_gemma":0.00093989243,"threshold_uncertainty_score":0.017313063},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03540282,0.0012223929,0.95177424,0.000437814,0.000051994048,0.000056508212,0.000104026534,0.0000675335,0.010882577],"genre_scores_gemma":[0.80194026,0.0035626357,0.18285547,0.00030942884,0.0002629721,0.00046321086,0.00049618556,0.00022047832,0.009889303],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99816656,0.0008108251,0.00014064995,0.00030586534,0.00044588363,0.00013024056],"domain_scores_gemma":[0.99403894,0.0035794321,0.0009388067,0.0002852319,0.0010217091,0.0001358353],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040741195,0.001237829,0.0011871143,0.0013634904,0.0005081565,0.0017934231,0.0010998369,0.001597828,0.0039623794],"category_scores_gemma":[0.013003594,0.0006291982,0.0013278744,0.0008320355,0.00217876,0.0040715565,0.0021017792,0.0020154142,0.00067419145],"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.00014677654,0.000060054226,0.00062603486,0.0007788975,0.000116459014,0.00041493826,0.00040731695,0.154383,0.026083324,0.7829539,0.001497639,0.03253166],"study_design_scores_gemma":[0.000060860075,0.00036509495,0.0007916003,0.0001976296,0.000055100652,0.0004643736,0.0002500271,0.68198097,0.015617942,0.2925686,0.0075641433,0.000083635845],"about_ca_topic_score_codex":0.0002685653,"about_ca_topic_score_gemma":0.00018123293,"teacher_disagreement_score":0.0040741195,"about_ca_system_score_codex":0.0005539184,"about_ca_system_score_gemma":0.00054762175,"threshold_uncertainty_score":0.021546304},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011596156,0.00016723004,0.9973953,0.00009391049,0.000045326735,0.00003756396,0.000019687204,0.00010212872,0.0009792555],"genre_scores_gemma":[0.058059577,0.0004199412,0.93760026,0.00015276349,0.00010824622,0.00044876657,0.00018949418,0.00032089674,0.0027000771],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981651,0.0006986916,0.000115800416,0.00026842358,0.0006183778,0.00013362197],"domain_scores_gemma":[0.9905668,0.007844383,0.00026782308,0.00036109958,0.00079119403,0.00016868113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004789359,0.0021235733,0.0021634735,0.0015848322,0.0008714391,0.0022498297,0.0032883377,0.0032680565,0.005577978],"category_scores_gemma":[0.015310926,0.0015046463,0.0017044303,0.0019981063,0.0019560822,0.0030592605,0.0033475207,0.006207622,0.0013036565],"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.00020229023,0.00024936962,0.00047239906,0.00047818775,0.000114602866,0.00006855765,0.00020540548,0.5370786,0.0023521048,0.26308772,0.0047923275,0.19089848],"study_design_scores_gemma":[0.00003896371,0.000025662974,0.000036204365,0.000023872322,0.000011332794,0.000014788364,0.000014325954,0.9504068,0.0004704966,0.047700115,0.0012483938,0.000009056608],"about_ca_topic_score_codex":0.0032435267,"about_ca_topic_score_gemma":0.0035628425,"teacher_disagreement_score":0.005577978,"about_ca_system_score_codex":0.0019197123,"about_ca_system_score_gemma":0.0024683634,"threshold_uncertainty_score":0.025328815},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012657779,0.00041634453,0.9740491,0.00032923208,0.00011088907,0.00007120547,0.00017927293,0.00007176948,0.012114406],"genre_scores_gemma":[0.7267656,0.0015045587,0.24696843,0.000622106,0.00033833494,0.00070715917,0.0007055391,0.0003780893,0.022010246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988871,0.00033347838,0.00006656332,0.00014405524,0.00043782472,0.00013089138],"domain_scores_gemma":[0.99851865,0.000749952,0.00015042294,0.00007437043,0.00042465352,0.00008185641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025921084,0.0015364541,0.0010363196,0.0010992131,0.0005738799,0.0016898706,0.0007426596,0.0012380223,0.004423319],"category_scores_gemma":[0.0037124169,0.0006375165,0.0011269937,0.0005104912,0.0013673049,0.0015414475,0.0015061672,0.0022322722,0.000673764],"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.00011185798,0.00006765172,0.001028826,0.00070176105,0.00008671308,0.00047241195,0.00038293516,0.39326084,0.03669041,0.5400533,0.0052216616,0.02192165],"study_design_scores_gemma":[0.000018369528,0.00008970117,0.00045138685,0.00006043037,0.000013078163,0.00009276004,0.00006647831,0.9277006,0.005209263,0.060937777,0.00533369,0.000026548356],"about_ca_topic_score_codex":0.0019123262,"about_ca_topic_score_gemma":0.0018403542,"teacher_disagreement_score":0.004423319,"about_ca_system_score_codex":0.0008889858,"about_ca_system_score_gemma":0.0015635852,"threshold_uncertainty_score":0.014797509},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3000729,0.00018910153,0.6821903,0.0003230221,0.00004968433,0.000061331135,0.00011026514,0.00033940937,0.016664037],"genre_scores_gemma":[0.9030382,0.00014618639,0.09006768,0.000075653326,0.000021331207,0.000069151356,0.000118160206,0.00010584481,0.0063577974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99963427,0.000070057366,0.000015947917,0.00008545693,0.00013433673,0.00005992347],"domain_scores_gemma":[0.99894553,0.00041185302,0.0002128108,0.00013237157,0.00016565963,0.00013183262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006974024,0.0005324264,0.00048645958,0.0007494208,0.00056943577,0.0013106806,0.0010507066,0.00068585627,0.0027334148],"category_scores_gemma":[0.0027500049,0.00036263312,0.00055465434,0.0003294635,0.0016293366,0.00087321375,0.0016029372,0.00081013946,0.00033432513],"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.00017974852,0.00010156459,0.0013605026,0.00011676209,0.000028508233,0.00043007577,0.00045232318,0.73557204,0.070820495,0.15415725,0.0011668123,0.03561391],"study_design_scores_gemma":[0.000011736211,0.00009516532,0.00037215333,0.000010606687,0.000005712299,0.00010513708,0.000048284637,0.97467005,0.008101076,0.014458336,0.0021038859,0.000017824219],"about_ca_topic_score_codex":0.0021088738,"about_ca_topic_score_gemma":0.0010006936,"teacher_disagreement_score":0.0027334148,"about_ca_system_score_codex":0.0011141521,"about_ca_system_score_gemma":0.0005733313,"threshold_uncertainty_score":0.009144187},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004607302,0.000109869754,0.99343455,0.00006644709,0.000031398788,0.000035644833,0.000009528646,0.00004356232,0.0016617295],"genre_scores_gemma":[0.33758897,0.00033679744,0.64957726,0.00016608457,0.00008939705,0.00049059174,0.00009123644,0.0001485369,0.011511192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952483,0.00020662711,0.000023564082,0.00006914082,0.00013628205,0.00003946275],"domain_scores_gemma":[0.9994412,0.00026847472,0.00004627099,0.000052350955,0.00014146803,0.000050333325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015945922,0.00097061304,0.0010000046,0.0008134589,0.00046612034,0.0008697688,0.0015372927,0.001373656,0.0026375805],"category_scores_gemma":[0.0022835275,0.000414125,0.0010541315,0.00044278143,0.0010953894,0.0013025426,0.0025467654,0.0015692485,0.0005339539],"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.000107234555,0.00010441694,0.0010037797,0.000352586,0.00012746216,0.00029869942,0.0003463086,0.6105528,0.013876989,0.2951511,0.0020689624,0.076009594],"study_design_scores_gemma":[0.0000072550806,0.000037330054,0.00003846343,0.000010815731,0.000005953666,0.000033684715,0.000015218901,0.9856834,0.0006811847,0.012121048,0.0013585121,0.000007145572],"about_ca_topic_score_codex":0.0020045082,"about_ca_topic_score_gemma":0.0021367618,"teacher_disagreement_score":0.0026375805,"about_ca_system_score_codex":0.000587051,"about_ca_system_score_gemma":0.001253496,"threshold_uncertainty_score":0.008823633},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09786687,0.0006961124,0.88951695,0.0011726525,0.00010146014,0.00004018109,0.00012570567,0.000048162066,0.010431877],"genre_scores_gemma":[0.9070471,0.0008665893,0.08332867,0.00020850831,0.00018125626,0.00014796865,0.00023277424,0.000065906424,0.007921241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986475,0.0006836032,0.00008549519,0.0001781066,0.0002820084,0.0001232926],"domain_scores_gemma":[0.998154,0.0009813748,0.00026438368,0.00008271892,0.00037807846,0.00013952385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027569328,0.0010350992,0.00086175295,0.0010756862,0.0005549605,0.0019750935,0.0008361309,0.00089822855,0.0025342675],"category_scores_gemma":[0.0049338792,0.00033922287,0.00076606096,0.0011253817,0.0020184808,0.0032392608,0.001893625,0.0021692014,0.0002479354],"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.00004915221,0.000031202013,0.0003564427,0.00008548247,0.000038197584,0.0001166582,0.00007975848,0.10867577,0.0028451975,0.8793891,0.0007758098,0.0075572133],"study_design_scores_gemma":[0.000023675671,0.00010570794,0.00039464893,0.000035663863,0.000018790271,0.00007969748,0.00012685424,0.6027402,0.0015774475,0.3927759,0.002093847,0.000027537457],"about_ca_topic_score_codex":0.0014681044,"about_ca_topic_score_gemma":0.00085037,"teacher_disagreement_score":0.0027569328,"about_ca_system_score_codex":0.0012215176,"about_ca_system_score_gemma":0.00084997143,"threshold_uncertainty_score":0.01458025},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018598158,0.00019400333,0.9744391,0.0004883529,0.00002978016,0.00009122928,0.00024095019,0.00016686917,0.005751589],"genre_scores_gemma":[0.78219473,0.0005976403,0.20370337,0.00050798454,0.00012850537,0.0005547664,0.0005548931,0.000250047,0.011508096],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99396414,0.0028681252,0.00041892965,0.0010139234,0.0013257986,0.00040902343],"domain_scores_gemma":[0.98888177,0.006250055,0.0014005796,0.0014749969,0.0015727088,0.00041989045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008488405,0.0017829405,0.0014411659,0.0011559448,0.00056512514,0.0023836487,0.0016533982,0.0026719372,0.0051077986],"category_scores_gemma":[0.026485693,0.00048401236,0.0011638795,0.0010350281,0.0022273147,0.0038116628,0.0023956308,0.0025886206,0.0007850007],"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.00008728905,0.00008707613,0.0012314914,0.00026158863,0.00009914199,0.00019044294,0.00018914715,0.19015399,0.0073585943,0.75530875,0.0022358843,0.042796526],"study_design_scores_gemma":[0.000020146183,0.00014716572,0.0007271214,0.00007156468,0.000024756468,0.00011247929,0.00008795062,0.58405554,0.0021771486,0.40960193,0.0029258763,0.000048342565],"about_ca_topic_score_codex":0.00090442004,"about_ca_topic_score_gemma":0.0005124335,"teacher_disagreement_score":0.008488405,"about_ca_system_score_codex":0.0017652888,"about_ca_system_score_gemma":0.0014137513,"threshold_uncertainty_score":0.044891477},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43033633,0.0009794298,0.53232306,0.0009442707,0.00012344333,0.000108595326,0.0003595372,0.00033065182,0.03449466],"genre_scores_gemma":[0.93384093,0.0006186622,0.049815413,0.00021889545,0.0000907424,0.00019095113,0.00045756044,0.00024571465,0.014521098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993268,0.00015476014,0.00002755754,0.0001759579,0.00019973509,0.00011515547],"domain_scores_gemma":[0.99628615,0.0017688532,0.00056380173,0.0002789842,0.00043379952,0.0006683063],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011471316,0.0013557883,0.00066945865,0.0011435584,0.0011740463,0.0020083436,0.0012745521,0.0013170299,0.0038600396],"category_scores_gemma":[0.010246561,0.0006588331,0.00094907737,0.00036096477,0.00340534,0.003642756,0.0050255205,0.0022252726,0.00069968385],"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.0003431826,0.00009789256,0.002650624,0.00027419112,0.000054816945,0.0006806174,0.001017721,0.08832583,0.013883483,0.8782477,0.0016888118,0.012735165],"study_design_scores_gemma":[0.00006613761,0.0004933404,0.002537312,0.00020367332,0.000053722906,0.00070053944,0.0007675073,0.5758485,0.010149751,0.40052703,0.00855345,0.00009910854],"about_ca_topic_score_codex":0.00089916104,"about_ca_topic_score_gemma":0.0006771504,"teacher_disagreement_score":0.0038600396,"about_ca_system_score_codex":0.0014167575,"about_ca_system_score_gemma":0.00044623174,"threshold_uncertainty_score":0.012913048},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032623153,0.0002635308,0.9646763,0.00008683621,0.000041075007,0.000041905198,0.0000065136533,0.00005462269,0.0022059965],"genre_scores_gemma":[0.66791326,0.00057379145,0.32493776,0.00006111092,0.000029231938,0.0002219574,0.000032290376,0.00005894487,0.0061715897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995664,0.00016915871,0.000030063982,0.00006383084,0.00012639002,0.00004418765],"domain_scores_gemma":[0.9994593,0.00024396557,0.000056053992,0.000050950006,0.00015249861,0.000037252365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015173184,0.00097581337,0.00089556404,0.0005896866,0.0006191166,0.00077180273,0.0009521174,0.0014330066,0.00091071875],"category_scores_gemma":[0.0026630699,0.0003415921,0.0010176998,0.0004259597,0.0012814923,0.0012177681,0.001475532,0.001301087,0.00017313259],"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.00009285192,0.000041977677,0.0014579176,0.00017787483,0.00006297732,0.0003416089,0.00039099393,0.8199502,0.018198442,0.13662036,0.00043698505,0.02222783],"study_design_scores_gemma":[0.0000055231744,0.00003192195,0.00006151246,0.0000074905997,0.000005498227,0.00003876332,0.00001576255,0.99278885,0.0014755115,0.005148639,0.00041164097,0.000008873583],"about_ca_topic_score_codex":0.0031268497,"about_ca_topic_score_gemma":0.001658062,"teacher_disagreement_score":0.0031268497,"about_ca_system_score_codex":0.0005880718,"about_ca_system_score_gemma":0.0010504373,"threshold_uncertainty_score":0.008024454},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20197265,0.003018252,0.7636109,0.010698586,0.00018797087,0.00016961587,0.0008274455,0.00091949,0.018595025],"genre_scores_gemma":[0.9239944,0.0014414457,0.06668358,0.0008698673,0.00044073522,0.00029055018,0.00068704295,0.00053818215,0.005054272],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99573237,0.0018348215,0.00017520566,0.0008069343,0.0009859037,0.00046474516],"domain_scores_gemma":[0.89956254,0.08773628,0.003544946,0.0059789345,0.0015613844,0.0016159042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006744658,0.0013259547,0.0024703508,0.0010261509,0.0011756287,0.0030824477,0.0030944305,0.002112399,0.0050496263],"category_scores_gemma":[0.05838774,0.0008236973,0.0015213325,0.0011184248,0.0053382884,0.009356691,0.0046730516,0.006890225,0.00077675213],"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.0011336141,0.00025947014,0.005852971,0.00093143765,0.000202499,0.0003452033,0.0007458888,0.4724578,0.0045300866,0.47134367,0.0075782533,0.034619078],"study_design_scores_gemma":[0.000054676795,0.00009703648,0.0010160198,0.000038089394,0.000022555383,0.00006279592,0.000070102295,0.64750004,0.0010442607,0.34903663,0.0010340455,0.00002371538],"about_ca_topic_score_codex":0.0014307628,"about_ca_topic_score_gemma":0.0012915732,"teacher_disagreement_score":0.006744658,"about_ca_system_score_codex":0.0022367195,"about_ca_system_score_gemma":0.0015102121,"threshold_uncertainty_score":0.035669565},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010234954,0.00024803847,0.98691607,0.00020339715,0.000025558582,0.000035728728,0.00007560692,0.00010618498,0.0021544213],"genre_scores_gemma":[0.793162,0.0007440794,0.19984935,0.00019073654,0.000086177075,0.0004700666,0.0004012727,0.00014938651,0.0049469285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990351,0.00039447384,0.00003497894,0.00021078892,0.00020748294,0.000117150186],"domain_scores_gemma":[0.9969208,0.0023206405,0.00028591565,0.000101057645,0.00028968597,0.00008182391],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022820113,0.0015492397,0.0014919995,0.00048948743,0.00045285063,0.0014975722,0.00095215003,0.0015152834,0.0023364516],"category_scores_gemma":[0.0040295986,0.0006416903,0.0009087736,0.00086482614,0.0012002147,0.0011059289,0.00117222,0.0026428867,0.00027460387],"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.000028931263,0.000018008786,0.00009797098,0.00007479071,0.000014284707,0.000038829006,0.000026234562,0.98946303,0.0004555489,0.005738794,0.00024390522,0.003799771],"study_design_scores_gemma":[0.000003340281,0.000012327558,0.000014405065,0.0000029731636,0.0000017657527,0.0000044433077,0.000004316885,0.9983682,0.00009981776,0.0014144524,0.00007242883,0.0000015488233],"about_ca_topic_score_codex":0.008768352,"about_ca_topic_score_gemma":0.0048633055,"teacher_disagreement_score":0.008768352,"about_ca_system_score_codex":0.0013144792,"about_ca_system_score_gemma":0.0019297674,"threshold_uncertainty_score":0.017434597},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3074304,0.0007529296,0.6802409,0.00072811614,0.000023785899,0.00014082527,0.00030668124,0.000114700415,0.010261676],"genre_scores_gemma":[0.8772372,0.0011519489,0.11573423,0.00009664859,0.000046564077,0.0005308636,0.0005714933,0.00012240303,0.004508652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999035,0.0003728401,0.00004978659,0.00018481739,0.00026767957,0.00008980159],"domain_scores_gemma":[0.99470747,0.004005048,0.00051255594,0.00013052305,0.00037504293,0.00026926855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019298475,0.0009936729,0.001192534,0.002924188,0.0013447617,0.0027192016,0.001240412,0.0011290455,0.0033155002],"category_scores_gemma":[0.008387264,0.0007188791,0.0013065303,0.0016487129,0.0026576119,0.0035558091,0.002248031,0.002171063,0.00018553702],"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.000107590764,0.00006210217,0.0014853453,0.00022200122,0.00008922055,0.00022217704,0.0005047908,0.103506565,0.004010537,0.8769872,0.0005987674,0.012203742],"study_design_scores_gemma":[0.000021737198,0.000081970255,0.0008374249,0.000053435593,0.000030217008,0.000112379064,0.00017264098,0.42572424,0.0016203271,0.56978333,0.0015366384,0.000025587751],"about_ca_topic_score_codex":0.0013111806,"about_ca_topic_score_gemma":0.0009612422,"teacher_disagreement_score":0.0033155002,"about_ca_system_score_codex":0.0019761033,"about_ca_system_score_gemma":0.0010505444,"threshold_uncertainty_score":0.0143377185},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72986424,0.001636729,0.23372804,0.0014982432,0.00014812958,0.000088565575,0.00031458118,0.000094408024,0.032627013],"genre_scores_gemma":[0.97184044,0.00048689707,0.022475172,0.00012353118,0.00013762772,0.00008829301,0.00010636548,0.000031841977,0.00470983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998771,0.0003831306,0.000082190265,0.00031980788,0.00030253344,0.00014136465],"domain_scores_gemma":[0.99404776,0.0033851422,0.0006680096,0.0003808118,0.0008001021,0.00071817945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027887723,0.00060026255,0.00064926705,0.0012029003,0.0008351229,0.002142822,0.00085387926,0.00083779177,0.0023180996],"category_scores_gemma":[0.010475139,0.00046871082,0.00088594964,0.0006249237,0.0027530065,0.0056170155,0.0033564796,0.0024792335,0.00015683663],"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.0004196819,0.00009252658,0.0025286921,0.00020166037,0.000073317584,0.0006938177,0.0010108894,0.02534611,0.011793321,0.9408457,0.00078720757,0.01620702],"study_design_scores_gemma":[0.00006186411,0.0002685902,0.0045260065,0.0001316468,0.00004238066,0.00095235754,0.000521091,0.14847775,0.0062461006,0.8328445,0.005872928,0.000054894255],"about_ca_topic_score_codex":0.00052739267,"about_ca_topic_score_gemma":0.0003517773,"teacher_disagreement_score":0.0027887723,"about_ca_system_score_codex":0.0011511791,"about_ca_system_score_gemma":0.0005800151,"threshold_uncertainty_score":0.014748573},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022681195,0.00014473843,0.9758365,0.00018715314,0.000014997223,0.00003737876,0.00016139133,0.0003634524,0.00057311804],"genre_scores_gemma":[0.6059785,0.00019729575,0.38939866,0.00045919383,0.000052577867,0.0002893827,0.0012299704,0.00073052815,0.0016637672],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967937,0.0018928458,0.000116555195,0.00063403626,0.00039295573,0.00016984399],"domain_scores_gemma":[0.97618973,0.020409893,0.00085636426,0.0015889966,0.00064244354,0.0003125481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011658657,0.0007278104,0.0017202088,0.0013237906,0.00071430847,0.0014814741,0.002341921,0.0011048707,0.0023977617],"category_scores_gemma":[0.03577618,0.001151512,0.0016337523,0.000871972,0.0017347323,0.0015476908,0.0035187737,0.002233323,0.00033549353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017525846,0.0000510238,0.0041451547,0.00016259184,0.00032630807,0.00024718046,0.0001302085,0.8971755,0.006166493,0.067080796,0.0017279577,0.02261153],"study_design_scores_gemma":[0.000028266497,0.00001722807,0.0004483684,0.000011375565,0.000020016401,0.000046141653,0.000009408522,0.945716,0.0010395814,0.051990114,0.00065843004,0.000015161337],"about_ca_topic_score_codex":0.005165903,"about_ca_topic_score_gemma":0.005036768,"teacher_disagreement_score":0.011658657,"about_ca_system_score_codex":0.00095547334,"about_ca_system_score_gemma":0.0015670015,"threshold_uncertainty_score":0.061657608},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021295554,0.00014980271,0.99636275,0.00011463371,0.00004834904,0.000034168792,0.000009075146,0.00003662282,0.0011151609],"genre_scores_gemma":[0.12112094,0.00028008097,0.87337637,0.0001319638,0.000066713954,0.0002414009,0.000048220183,0.00009494035,0.004639365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993869,0.00026538564,0.00003546715,0.00009226717,0.00017814923,0.00004178155],"domain_scores_gemma":[0.99945,0.00025869126,0.00006154619,0.00004718609,0.00010657509,0.000075832235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019274252,0.0010331514,0.0010135421,0.000841644,0.00046542287,0.00088745274,0.0017516655,0.0018377283,0.002494788],"category_scores_gemma":[0.0027520496,0.00045131173,0.0011450355,0.00044956157,0.0011648567,0.0018820176,0.002229134,0.0023576498,0.0004692817],"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.00016287547,0.00013770629,0.0007960144,0.0005605793,0.000116393305,0.00052245636,0.00040472738,0.35001644,0.027705025,0.5157825,0.0026604317,0.10113482],"study_design_scores_gemma":[0.000019681116,0.000092222464,0.00006433023,0.000027440572,0.000009006118,0.00010037822,0.000013998869,0.9763682,0.0016946065,0.017242428,0.004350995,0.000016717968],"about_ca_topic_score_codex":0.0013423618,"about_ca_topic_score_gemma":0.0013771259,"teacher_disagreement_score":0.002494788,"about_ca_system_score_codex":0.00083299377,"about_ca_system_score_gemma":0.001291356,"threshold_uncertainty_score":0.010193288},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03957173,0.05305328,0.29227492,0.122394174,0.010756532,0.0001717188,0.0011144233,0.00066385174,0.47999942],"genre_scores_gemma":[0.5328043,0.040130187,0.12932782,0.04984692,0.011126802,0.0005199786,0.0017959025,0.0016144381,0.23283361],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811184,0.0005771806,0.000096635,0.0003995042,0.0005540136,0.00026087044],"domain_scores_gemma":[0.9930821,0.0043422827,0.00023274493,0.0010104803,0.001012532,0.0003198159],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023422397,0.0010900233,0.0017391872,0.0035849956,0.0041964594,0.0032224797,0.0017356277,0.0035146968,0.016712867],"category_scores_gemma":[0.016117703,0.00053930894,0.0021941722,0.0038221898,0.003975031,0.011615424,0.0072923386,0.005855757,0.0033785596],"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.000112393296,0.00005654994,0.0003635774,0.00017351692,0.000044216293,0.00008476256,0.0005628875,0.0012446109,0.0007696537,0.9273816,0.045386992,0.023819085],"study_design_scores_gemma":[0.000018623638,0.000024062516,0.0005535202,0.000085030915,0.00004071972,0.00011900291,0.0001275331,0.0023792547,0.0003942436,0.94163394,0.054600056,0.000024110617],"about_ca_topic_score_codex":0.0033304002,"about_ca_topic_score_gemma":0.0027350734,"teacher_disagreement_score":0.016712867,"about_ca_system_score_codex":0.0019357752,"about_ca_system_score_gemma":0.0013811371,"threshold_uncertainty_score":0.05591011},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008718247,0.00043589712,0.9860568,0.000320954,0.0000370697,0.000048354646,0.000035335404,0.000026939606,0.0043203495],"genre_scores_gemma":[0.56407785,0.0022119326,0.41428462,0.0005088362,0.00024202367,0.0009797888,0.00020079598,0.000209397,0.017284846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990393,0.0004722879,0.000053465425,0.00012742881,0.00024207882,0.000065402586],"domain_scores_gemma":[0.998784,0.00079628924,0.000120286895,0.000050925388,0.00018815884,0.000060371327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035027296,0.0015587446,0.0012446417,0.0013089248,0.00076480414,0.0014205816,0.0011109795,0.0013841683,0.0030197904],"category_scores_gemma":[0.004242838,0.00070309854,0.0010376647,0.0008746585,0.0017836859,0.0023227513,0.0019846219,0.0024033024,0.0003801126],"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.00004844758,0.00006705222,0.0005117497,0.00031695288,0.000094947536,0.00014803739,0.0002131909,0.3783409,0.006555455,0.59219456,0.001411982,0.020096693],"study_design_scores_gemma":[0.000011605836,0.00009210944,0.00017070957,0.00006641085,0.000013374681,0.000051663344,0.000041772226,0.8166495,0.0011995437,0.17907126,0.002617232,0.0000148360805],"about_ca_topic_score_codex":0.0006385974,"about_ca_topic_score_gemma":0.00053495716,"teacher_disagreement_score":0.0035027296,"about_ca_system_score_codex":0.0010393981,"about_ca_system_score_gemma":0.0011390921,"threshold_uncertainty_score":0.018524408},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05605975,0.0025754059,0.90079564,0.0010702879,0.00015515738,0.000066410925,0.00023344121,0.00013285232,0.03891099],"genre_scores_gemma":[0.7424903,0.0034671135,0.2399006,0.0004916329,0.0006979677,0.0003271933,0.0006611021,0.00032412334,0.01163992],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997027,0.0008972942,0.00020220093,0.0005491482,0.0011057904,0.00021859005],"domain_scores_gemma":[0.9963541,0.0017826728,0.000622881,0.00040026227,0.00057721895,0.00026282814],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028780675,0.00082238164,0.00069001253,0.0031481362,0.0009483962,0.003183269,0.0015377699,0.001315314,0.0044737267],"category_scores_gemma":[0.008219576,0.00037568258,0.0009882268,0.0030374408,0.0031616134,0.009122262,0.0026416767,0.0026640643,0.00085725635],"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.0000130777835,0.000011029499,0.00030311517,0.00003782263,0.000011656319,0.000058220427,0.00016641385,0.0036540937,0.0010958909,0.9825951,0.00064614916,0.011407381],"study_design_scores_gemma":[0.0000059544677,0.000053378026,0.0006772287,0.00005861026,0.000017963126,0.00024990414,0.00019500846,0.07523303,0.0013026291,0.91124314,0.010934988,0.000028231168],"about_ca_topic_score_codex":0.0009530472,"about_ca_topic_score_gemma":0.0005831031,"teacher_disagreement_score":0.0044737267,"about_ca_system_score_codex":0.0012044831,"about_ca_system_score_gemma":0.0004903832,"threshold_uncertainty_score":0.0152208805},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041929455,0.00030479158,0.9873568,0.00035523096,0.000063553794,0.000049540133,0.00008763468,0.00004035297,0.007549094],"genre_scores_gemma":[0.5006778,0.0029869901,0.4676879,0.00082511955,0.00070854876,0.000799657,0.0008402749,0.0005334942,0.024940245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992066,0.00027738084,0.000041655818,0.0001375389,0.00025374713,0.00008306916],"domain_scores_gemma":[0.9988129,0.0006612943,0.00011453061,0.00004552004,0.00030335857,0.00006239463],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019148325,0.0013085017,0.00097416306,0.001400395,0.000554776,0.0019031216,0.0011291159,0.0012041539,0.0061583854],"category_scores_gemma":[0.004669298,0.0005386662,0.0011916006,0.0007394764,0.0019331964,0.0031216207,0.002023813,0.003491926,0.0010443601],"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.000021487262,0.000026442944,0.00016878666,0.00010553016,0.000021953458,0.00007549637,0.00009458842,0.03523064,0.0036797922,0.9430921,0.002017407,0.01546585],"study_design_scores_gemma":[0.000019721885,0.0000711347,0.00023486088,0.000054156648,0.000017785153,0.000083569736,0.00006406994,0.50757855,0.0025186779,0.48385745,0.005469451,0.00003054224],"about_ca_topic_score_codex":0.0021346756,"about_ca_topic_score_gemma":0.0018045376,"teacher_disagreement_score":0.0061583854,"about_ca_system_score_codex":0.0014129834,"about_ca_system_score_gemma":0.0014832112,"threshold_uncertainty_score":0.020601869},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020642155,0.00030797455,0.99653447,0.000058793783,0.000023401233,0.000020507967,0.000004665264,0.000049447422,0.0009366279],"genre_scores_gemma":[0.13258635,0.0014369615,0.86236125,0.00010142102,0.00011754076,0.00030039967,0.000048320126,0.00008181202,0.0029658284],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99969935,0.000089861576,0.000016915546,0.000034121076,0.00014116678,0.00001856968],"domain_scores_gemma":[0.9996389,0.00018630277,0.000036708498,0.000023280774,0.00009283137,0.000021897375],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007557487,0.0008255631,0.0004989093,0.0004135538,0.00037014813,0.0003950152,0.0007832219,0.00073333975,0.0015170368],"category_scores_gemma":[0.0015022061,0.0003359317,0.00055101846,0.00048500297,0.00076004025,0.0008101283,0.0011347407,0.0014047768,0.00029359976],"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.00007636352,0.00014284675,0.0006575703,0.0006590444,0.000083156585,0.0001955444,0.00048345045,0.5160761,0.025888128,0.18079366,0.002418088,0.27252603],"study_design_scores_gemma":[0.000014791842,0.00005335339,0.00008809323,0.000015428504,0.000005872817,0.000047641533,0.000015683325,0.98281306,0.0025406056,0.011744862,0.002648268,0.000012326242],"about_ca_topic_score_codex":0.0014627081,"about_ca_topic_score_gemma":0.0015931731,"teacher_disagreement_score":0.0015170368,"about_ca_system_score_codex":0.00028562767,"about_ca_system_score_gemma":0.0009812574,"threshold_uncertainty_score":0.005074978},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0122561455,0.00022935684,0.98513454,0.00012593812,0.00007561186,0.000046267527,0.000012096131,0.00007676025,0.0020432374],"genre_scores_gemma":[0.5565575,0.00084946444,0.43643543,0.00020024345,0.00019761427,0.00030192724,0.00013350914,0.00014799961,0.0051762965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939024,0.00023427987,0.000043569857,0.00007170313,0.00020345775,0.0000566874],"domain_scores_gemma":[0.99925166,0.0003604113,0.00005695681,0.00004966791,0.00022005443,0.00006131022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017652072,0.00097042066,0.00085157936,0.0006494552,0.00043078783,0.0006309102,0.0009523931,0.0008416886,0.0022351863],"category_scores_gemma":[0.00312787,0.00033422155,0.00070518005,0.00043365423,0.00085096457,0.0011433461,0.0010725975,0.0011756484,0.00029836467],"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.00026121497,0.000102893704,0.00093173934,0.00030616255,0.000084293526,0.000182833,0.00014235872,0.81385076,0.009769193,0.07493693,0.0021585657,0.097273074],"study_design_scores_gemma":[0.0000064195146,0.000036419115,0.00006339902,0.0000043186924,0.0000029225134,0.000014747118,0.0000043596015,0.99697316,0.0006197774,0.0018891844,0.00038179208,0.0000034814336],"about_ca_topic_score_codex":0.0030829606,"about_ca_topic_score_gemma":0.00205901,"teacher_disagreement_score":0.0030829606,"about_ca_system_score_codex":0.0005491263,"about_ca_system_score_gemma":0.001298875,"threshold_uncertainty_score":0.009335399},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20183222,0.0030661284,0.75733715,0.0022365884,0.00025124932,0.00015607986,0.00025329093,0.00015910635,0.034708206],"genre_scores_gemma":[0.9344654,0.0014497616,0.054768126,0.00031480927,0.00028690184,0.00023674943,0.00019546952,0.000086105116,0.008196721],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992337,0.00025633833,0.00005629132,0.00013088212,0.00023278408,0.00009000862],"domain_scores_gemma":[0.9963213,0.0022904002,0.00040371867,0.00012489184,0.0005719105,0.00028782064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002119128,0.000988498,0.00071160356,0.0009652569,0.0006825208,0.0011870007,0.00083308027,0.0010856196,0.0031450477],"category_scores_gemma":[0.0065915203,0.00037596168,0.00067723,0.00038113818,0.0024606509,0.0034363742,0.0015834174,0.0017751998,0.00029584058],"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.00018115134,0.00007297966,0.00094224495,0.00044776805,0.00005259466,0.00057509524,0.0004969906,0.020909837,0.03211734,0.9320953,0.0015181205,0.010590445],"study_design_scores_gemma":[0.00010264357,0.00023397645,0.0011054262,0.00013962494,0.00004328589,0.0005550685,0.0004937658,0.2866453,0.015626758,0.69024515,0.004733629,0.00007534011],"about_ca_topic_score_codex":0.000857875,"about_ca_topic_score_gemma":0.0005166555,"teacher_disagreement_score":0.0031450477,"about_ca_system_score_codex":0.00069244794,"about_ca_system_score_gemma":0.0008301614,"threshold_uncertainty_score":0.011207104},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008285751,0.00037082488,0.9826094,0.0006455337,0.000045346016,0.000051852112,0.00011987589,0.00007776319,0.0077937585],"genre_scores_gemma":[0.6855547,0.0025753311,0.2860203,0.00082554476,0.0004848057,0.0010806841,0.00082549354,0.00061678793,0.022016326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985055,0.0006761333,0.00007310907,0.00030550093,0.00034176293,0.00009804819],"domain_scores_gemma":[0.9970071,0.0016864267,0.00040836754,0.0001788332,0.00056045095,0.00015882304],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004810908,0.0017732076,0.0015059471,0.0015146004,0.0008132058,0.0016999583,0.0013925902,0.001289886,0.00546551],"category_scores_gemma":[0.008010849,0.00067550445,0.0014442942,0.00093981175,0.003216122,0.0035800014,0.0029717912,0.003515086,0.0012779959],"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.000039190865,0.000035265508,0.0003108962,0.00021932328,0.000055878678,0.0002998749,0.00019264958,0.11147008,0.005560319,0.86774796,0.0029598186,0.011108728],"study_design_scores_gemma":[0.00003612621,0.00010949436,0.00029366065,0.000069453636,0.000020596133,0.00014628508,0.000103831226,0.5188432,0.0024286562,0.4745293,0.0033834947,0.00003585219],"about_ca_topic_score_codex":0.00070331624,"about_ca_topic_score_gemma":0.0007285779,"teacher_disagreement_score":0.00546551,"about_ca_system_score_codex":0.0011305544,"about_ca_system_score_gemma":0.0012165207,"threshold_uncertainty_score":0.025442839},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6167299,0.00092492753,0.34662074,0.0018647485,0.00013092603,0.00008348684,0.00029081272,0.00024848833,0.033105966],"genre_scores_gemma":[0.98018277,0.00020948984,0.0138879595,0.00010244187,0.00008290704,0.000062573345,0.00011669277,0.000074937205,0.005280233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991972,0.00019393303,0.000043162425,0.00018959401,0.00022929264,0.00014689332],"domain_scores_gemma":[0.9926668,0.0043634176,0.0008227647,0.00022216712,0.0010047788,0.00092012587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017958251,0.0007410887,0.0007008958,0.0015830518,0.00092652434,0.0026577637,0.0012955366,0.0011686378,0.0053480226],"category_scores_gemma":[0.010528098,0.00052239856,0.00066508434,0.00050850585,0.003804888,0.004021714,0.002429194,0.0019867036,0.000376998],"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.00072371884,0.0001338315,0.00359014,0.00032350013,0.000045855177,0.0009766818,0.0009125285,0.009993094,0.05138024,0.9224786,0.0017602367,0.007681487],"study_design_scores_gemma":[0.00015100901,0.00040011405,0.003658765,0.00019133798,0.00005419144,0.0017655474,0.0011869258,0.30097058,0.02796314,0.65854925,0.0049559465,0.00015317216],"about_ca_topic_score_codex":0.0007086772,"about_ca_topic_score_gemma":0.00043882758,"teacher_disagreement_score":0.0053480226,"about_ca_system_score_codex":0.0011753148,"about_ca_system_score_gemma":0.0007136845,"threshold_uncertainty_score":0.01789093},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4182786,0.00070123153,0.52305865,0.001532421,0.00016153339,0.00008122571,0.0005121963,0.00019540313,0.055478707],"genre_scores_gemma":[0.96629655,0.00028670498,0.024810066,0.00019225622,0.00013011224,0.00012498128,0.00038118754,0.000085786545,0.0076922365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981698,0.00043387464,0.000093958944,0.00037241806,0.0006452327,0.0002846494],"domain_scores_gemma":[0.99564856,0.0022866162,0.00053579896,0.0002735427,0.0009491428,0.00030628056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001996381,0.00077120133,0.00054026645,0.0015630679,0.0008205336,0.002313773,0.0011555078,0.00084333273,0.005337198],"category_scores_gemma":[0.009405021,0.00022559287,0.0009001417,0.00068538287,0.0023901488,0.003269248,0.0020899274,0.0019063053,0.00044158578],"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.00008111696,0.000023107794,0.00088543433,0.000053884552,0.000031960943,0.0001277119,0.00016547322,0.009089691,0.0063007316,0.9730936,0.00067756465,0.009469764],"study_design_scores_gemma":[0.000018347839,0.00008541473,0.00072304986,0.00002113911,0.000012012879,0.000108498185,0.00013264501,0.15799597,0.0032548094,0.83625156,0.0013706466,0.000025983749],"about_ca_topic_score_codex":0.0011074846,"about_ca_topic_score_gemma":0.0006890482,"teacher_disagreement_score":0.005337198,"about_ca_system_score_codex":0.0013225381,"about_ca_system_score_gemma":0.00065175095,"threshold_uncertainty_score":0.01785475},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019361382,0.00018431345,0.97866964,0.000058250454,0.000037540907,0.000036900674,0.000007750728,0.000040826824,0.0016034573],"genre_scores_gemma":[0.537698,0.00074788166,0.4551571,0.000074169686,0.000050787272,0.00019165828,0.000060006158,0.000088675406,0.0059317956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948394,0.00017936315,0.00003658971,0.00006540619,0.0001822355,0.00005249764],"domain_scores_gemma":[0.9991787,0.00038041687,0.000089399204,0.00008046392,0.00022139032,0.00004949312],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020963857,0.0008550208,0.0009443905,0.0005578338,0.00037339726,0.00078108686,0.0010481157,0.0009432948,0.0011018189],"category_scores_gemma":[0.0038086188,0.00024435253,0.0010002004,0.00040297394,0.0011656393,0.0010165471,0.0012862001,0.0014350516,0.0002443572],"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.00014448115,0.000051218838,0.0012810231,0.00026947365,0.000047845995,0.00019441507,0.00034393067,0.83379763,0.015533251,0.11247613,0.00050898344,0.0353515],"study_design_scores_gemma":[0.000004119649,0.000026794225,0.00004135227,0.000007899364,0.0000042030656,0.00002539724,0.000012430551,0.9941214,0.0012918364,0.004135842,0.00032306617,0.0000055514556],"about_ca_topic_score_codex":0.003359732,"about_ca_topic_score_gemma":0.0015906169,"teacher_disagreement_score":0.003359732,"about_ca_system_score_codex":0.0007365019,"about_ca_system_score_gemma":0.0012981335,"threshold_uncertainty_score":0.011086881},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.042428486,0.00049457845,0.9348804,0.0020046216,0.00016571708,0.00014453246,0.00019163151,0.00056616915,0.019123983],"genre_scores_gemma":[0.8059445,0.00082460133,0.18284617,0.0010769634,0.0004121399,0.00073529145,0.00043694544,0.00072741776,0.006995941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9958674,0.0012052045,0.0002391724,0.0009302038,0.0011768066,0.0005811504],"domain_scores_gemma":[0.96683204,0.021982173,0.0028082796,0.0024257717,0.004664549,0.0012872221],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0067861485,0.0015840462,0.0015367167,0.0009571908,0.001440829,0.0016042932,0.0018572464,0.0024386807,0.007597808],"category_scores_gemma":[0.05333082,0.0007911096,0.0013467266,0.0005673268,0.0047843796,0.0041203434,0.0047358787,0.0050076465,0.0016223204],"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.00053437264,0.00014484953,0.002637642,0.0006688047,0.00010372494,0.00047309126,0.0005893468,0.19548851,0.027146906,0.73544997,0.005671448,0.031091247],"study_design_scores_gemma":[0.0001050875,0.0006129936,0.0007970629,0.00016513941,0.00003610072,0.00046242692,0.00011853136,0.7402276,0.015082692,0.23640893,0.005910231,0.00007321878],"about_ca_topic_score_codex":0.0010770136,"about_ca_topic_score_gemma":0.00049842824,"teacher_disagreement_score":0.007597808,"about_ca_system_score_codex":0.0011160413,"about_ca_system_score_gemma":0.0031653997,"threshold_uncertainty_score":0.03588903},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011247486,0.00019860547,0.98249936,0.00027737187,0.00035395802,0.00005704649,0.000040644903,0.000219974,0.0051056184],"genre_scores_gemma":[0.26585677,0.00028596475,0.7183716,0.0002967396,0.00033707466,0.00039874925,0.00024434776,0.00046885357,0.013739824],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99927086,0.00019225091,0.000046892168,0.0000997219,0.00028012574,0.000110098124],"domain_scores_gemma":[0.9984257,0.0006645201,0.00009721528,0.00027894124,0.00033674922,0.00019683606],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015595811,0.0012752279,0.001497267,0.0013182071,0.0009574545,0.0017176741,0.002282508,0.0016429668,0.010139597],"category_scores_gemma":[0.0055330284,0.00065453065,0.0012079995,0.0009391288,0.0013522685,0.002757835,0.0045334343,0.002794677,0.0011334297],"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.00068479235,0.00024243625,0.00084764115,0.00023749172,0.000106118714,0.00018168359,0.00034710474,0.22848192,0.006048515,0.5485557,0.006796091,0.20747058],"study_design_scores_gemma":[0.00006469063,0.000098488395,0.00012296147,0.000017498238,0.000011789647,0.000032509943,0.000029505438,0.9342765,0.0011745393,0.060745507,0.003406844,0.00001913331],"about_ca_topic_score_codex":0.0020796172,"about_ca_topic_score_gemma":0.0031758074,"teacher_disagreement_score":0.010139597,"about_ca_system_score_codex":0.00090991566,"about_ca_system_score_gemma":0.0013163176,"threshold_uncertainty_score":0.033920288},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015714929,0.0006596229,0.9736439,0.0010172286,0.00010712011,0.0000565595,0.00004764741,0.000073072086,0.008679896],"genre_scores_gemma":[0.6684043,0.0011134276,0.30730146,0.000509045,0.00059748517,0.00051497674,0.00029022028,0.0006589301,0.020610202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976888,0.0012417944,0.00006888888,0.00029355986,0.0005707536,0.00013624957],"domain_scores_gemma":[0.98815954,0.009051077,0.0008666437,0.0005586762,0.0010210045,0.00034312057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005818754,0.0016412055,0.0018407835,0.0014772668,0.00096093776,0.003145894,0.0021202324,0.0025444769,0.004951993],"category_scores_gemma":[0.027341176,0.0011339065,0.0012314176,0.0015137079,0.0028698333,0.004810577,0.003770646,0.003933234,0.00048765834],"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.00013381283,0.00014343034,0.0006934784,0.00023336282,0.0000731446,0.0001256504,0.00013730499,0.4545157,0.0018596598,0.5088379,0.0042575323,0.028989105],"study_design_scores_gemma":[0.000004679222,0.000015487809,0.00010601656,0.000011279039,0.000005847065,0.00002190694,0.00001255827,0.9274459,0.0002867871,0.07158682,0.0004950776,0.000007662541],"about_ca_topic_score_codex":0.0015174927,"about_ca_topic_score_gemma":0.0014856219,"teacher_disagreement_score":0.005818754,"about_ca_system_score_codex":0.0020167478,"about_ca_system_score_gemma":0.0016313298,"threshold_uncertainty_score":0.030772865},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010190353,0.00006914985,0.9981273,0.00003430594,0.00001316098,0.000011110891,0.00000540529,0.000021915657,0.0006986522],"genre_scores_gemma":[0.0930516,0.00040532456,0.9015382,0.0000800399,0.00006304887,0.00026256914,0.000069258,0.00015735478,0.004372619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987394,0.00050797465,0.000066092,0.00012881502,0.00048360747,0.00007406281],"domain_scores_gemma":[0.9979517,0.0013281419,0.00017566081,0.00014687107,0.00032651494,0.00007105507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024490638,0.001128116,0.0010517992,0.0007196225,0.00052020105,0.0009961392,0.0018054252,0.0015902951,0.0036240607],"category_scores_gemma":[0.006914331,0.00067886815,0.0011803078,0.00064118416,0.0015203839,0.0022212246,0.002979847,0.0029574737,0.00073632604],"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.00011770489,0.00009969137,0.0004005886,0.0006390792,0.000085766005,0.0002592253,0.0003670567,0.4945112,0.011038892,0.3736058,0.001853044,0.11702204],"study_design_scores_gemma":[0.000013208908,0.000031828717,0.000041782,0.000032136628,0.000009209844,0.00005670161,0.000017296066,0.96323097,0.0018343312,0.032735396,0.0019830973,0.000014080536],"about_ca_topic_score_codex":0.0007367286,"about_ca_topic_score_gemma":0.0010719753,"teacher_disagreement_score":0.0036240607,"about_ca_system_score_codex":0.0006014001,"about_ca_system_score_gemma":0.0012090765,"threshold_uncertainty_score":0.01295203},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03343724,0.0006662404,0.961422,0.000264343,0.00008768969,0.00003651736,0.000053413798,0.000029917543,0.0040027066],"genre_scores_gemma":[0.684285,0.002199369,0.30460265,0.0002676139,0.00023831124,0.00018932454,0.00019566173,0.00012873951,0.0078933425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860865,0.00047730352,0.00015256743,0.00023612559,0.00044776275,0.00007766831],"domain_scores_gemma":[0.997537,0.0011653798,0.00024279696,0.00024670677,0.0006510848,0.00015699444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003741343,0.00089702517,0.0010661773,0.0015945093,0.00047754645,0.0015975708,0.00077013904,0.0009893294,0.0019157816],"category_scores_gemma":[0.011202592,0.00044990002,0.0010582317,0.0009011595,0.0024131897,0.004831331,0.0026290645,0.0026401344,0.00026976396],"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.000064513195,0.000023235474,0.00068981166,0.00014170649,0.000025965059,0.00011244811,0.00022020767,0.02661137,0.008046293,0.94134927,0.00040956237,0.02230565],"study_design_scores_gemma":[0.000015122482,0.00018720642,0.0006533349,0.000050094524,0.000025066745,0.0002682575,0.00014890864,0.51066387,0.0066069397,0.4761057,0.005241739,0.0000338749],"about_ca_topic_score_codex":0.00048960454,"about_ca_topic_score_gemma":0.0004407787,"teacher_disagreement_score":0.003741343,"about_ca_system_score_codex":0.0008205355,"about_ca_system_score_gemma":0.000718462,"threshold_uncertainty_score":0.019786298},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01173043,0.00014061823,0.98637706,0.000076734315,0.000047658963,0.000039680974,0.0000075420517,0.000034441084,0.0015459054],"genre_scores_gemma":[0.4651314,0.00050048484,0.5274396,0.00012289819,0.000092536735,0.00040678555,0.00007183712,0.000060471062,0.006173969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996455,0.00011061139,0.000026959335,0.00004920921,0.00013303579,0.00003479905],"domain_scores_gemma":[0.9996563,0.00011262171,0.00005392735,0.000037811977,0.000093512106,0.00004575105],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015347755,0.00074300764,0.00083900127,0.0006820175,0.00056054833,0.0006476809,0.001424766,0.0012973339,0.0014614564],"category_scores_gemma":[0.0017610086,0.0003141584,0.0008662307,0.00037184954,0.0012276886,0.0014689827,0.0018009525,0.0013430441,0.00025328432],"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.000118488955,0.00008807022,0.0012607676,0.00025914103,0.00007280432,0.00016440022,0.0004907981,0.48293084,0.023435472,0.4313951,0.0009807176,0.05880338],"study_design_scores_gemma":[0.000011319404,0.000082138366,0.000074713695,0.000014579534,0.000007843429,0.000024134131,0.000018120229,0.98882127,0.0012084617,0.007902124,0.0018242417,0.0000110087685],"about_ca_topic_score_codex":0.0019888121,"about_ca_topic_score_gemma":0.0019490803,"teacher_disagreement_score":0.0019888121,"about_ca_system_score_codex":0.0006919532,"about_ca_system_score_gemma":0.0009761429,"threshold_uncertainty_score":0.008116782},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007694882,0.000110726,0.98992693,0.00015803361,0.000024078012,0.000011682861,0.00003737767,0.00015873721,0.0018775327],"genre_scores_gemma":[0.514104,0.0004637719,0.469599,0.00028844076,0.00009871928,0.00016607525,0.00034907658,0.0007028827,0.014227955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991215,0.00034636506,0.000040143866,0.00014077645,0.0002209438,0.000130264],"domain_scores_gemma":[0.9978502,0.0012777072,0.00012724656,0.00027148702,0.00032307254,0.00015025803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021761514,0.0010655732,0.0024098195,0.0008131182,0.00069483765,0.002667141,0.0019263935,0.0018277473,0.00369406],"category_scores_gemma":[0.0076528993,0.0011292025,0.0010526553,0.0012904358,0.0021711043,0.003083868,0.0037835808,0.0032780624,0.0007764402],"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.0001049064,0.000097399134,0.00038341945,0.0001334041,0.0000631091,0.0000663086,0.00011922807,0.6810771,0.0010879568,0.2765491,0.0021599072,0.03815825],"study_design_scores_gemma":[0.000004468554,0.000012868839,0.00001653596,0.000006790507,0.0000032343848,0.000006306528,0.0000078996645,0.92915547,0.00016281991,0.07031266,0.00030544493,0.0000055124888],"about_ca_topic_score_codex":0.0039944025,"about_ca_topic_score_gemma":0.0052787443,"teacher_disagreement_score":0.0039944025,"about_ca_system_score_codex":0.0010992462,"about_ca_system_score_gemma":0.002371164,"threshold_uncertainty_score":0.012357831},"labels":[],"label_agreement":null},{"id":"W4409337533","doi":"10.1007/s11228-025-00750-w","title":"Calm Local Optimality for Nonconvex-Nonconcave Minimax Problems","year":2025,"lang":"en","type":"article","venue":"Set-Valued and Variational Analysis","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Minimax; Mathematical optimization; Mathematical economics; Economics; Mathematics; Computer science","score_opus":0.015341426648920797,"score_gpt":0.2783141284345232,"score_spread":0.2629727017856024,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409337533","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048255205,0.0022240772,0.91563106,0.0032502855,0.000208703,0.00014173712,0.00025258918,0.00021895596,0.029817438],"genre_scores_gemma":[0.7575998,0.0021185493,0.18838792,0.0012148529,0.00060686946,0.00075950474,0.00059576926,0.00065083563,0.048065886],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99848396,0.0007318364,0.00005906767,0.0002736666,0.0003102741,0.00014119444],"domain_scores_gemma":[0.99087393,0.007001842,0.000592192,0.00036975907,0.0006649662,0.00049730286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004796858,0.0015522846,0.0027104616,0.0020194752,0.001303425,0.0027716905,0.0023715578,0.002723555,0.0065529435],"category_scores_gemma":[0.023228247,0.0010770813,0.0013112762,0.0015064339,0.003675139,0.0040814765,0.004619878,0.0051353853,0.00050620415],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016058027,0.00011289757,0.00040521345,0.000443263,0.000087569475,0.0001516629,0.00022323147,0.22245601,0.0016675475,0.753838,0.005736007,0.014718137],"study_design_scores_gemma":[0.000030507912,0.00006282778,0.0002043864,0.000045435336,0.000014913585,0.00003551659,0.00005261973,0.5831021,0.00039204443,0.41457164,0.0014716635,0.00001633477],"about_ca_topic_score_codex":0.0032510804,"about_ca_topic_score_gemma":0.004530943,"teacher_disagreement_score":0.0065529435,"about_ca_system_score_codex":0.0033042324,"about_ca_system_score_gemma":0.0022372217,"threshold_uncertainty_score":0.025368512},"labels":[],"label_agreement":null},{"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":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00092504284,0.015860083,0.0037099766,0.049740966,0.5611373,0.0003133861,0.009182587,0.0012224175,0.35790825],"genre_scores_gemma":[0.003810467,0.0073252805,0.0014129061,0.009647287,0.104092605,0.0001864869,0.0073750736,0.0008111258,0.8653388],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992424,0.000102674436,0.000057372734,0.00013351384,0.0003897638,0.00007428047],"domain_scores_gemma":[0.99555343,0.0007546153,0.00018661514,0.00034475772,0.0022054806,0.0009551083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012891693,0.00094092,0.00088617543,0.0023536885,0.0014984851,0.0038006052,0.0012118985,0.0014085243,0.4785824],"category_scores_gemma":[0.008988792,0.00026939154,0.00050709175,0.0015716853,0.00043482365,0.0025476376,0.0020082109,0.0025801407,0.31259212],"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.000016370472,0.000010044627,0.000037600577,0.00007681307,0.0000014000971,0.000016652155,0.000021523403,0.000024700248,0.00007688687,0.0014051234,0.9709047,0.027408086],"study_design_scores_gemma":[0.0000037646823,0.000010951729,0.00022489166,0.00009435674,0.0000015038787,0.000028341305,0.000032887496,0.000020561909,0.00004965295,0.0012514642,0.9982784,0.0000032491896],"about_ca_topic_score_codex":0.0016026953,"about_ca_topic_score_gemma":0.0021557012,"teacher_disagreement_score":0.4785824,"about_ca_system_score_codex":0.001114614,"about_ca_system_score_gemma":0.0015091484,"threshold_uncertainty_score":0},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030450927,0.09316743,0.77881813,0.021536615,0.0038590885,0.00006603499,0.00041485432,0.0005288417,0.07115812],"genre_scores_gemma":[0.5376914,0.09408571,0.2965834,0.008664576,0.030099053,0.0003543884,0.00072541134,0.0010396366,0.03075635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982993,0.00045973112,0.0001320772,0.00037699996,0.00060198136,0.00012998153],"domain_scores_gemma":[0.9966858,0.002095507,0.00022611486,0.00043282946,0.00041586472,0.00014390044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004903171,0.0011262923,0.0012479923,0.0020297128,0.0011448321,0.0023753254,0.0019128551,0.0019275004,0.0039255],"category_scores_gemma":[0.012212785,0.00072593044,0.0014521885,0.0017428942,0.0038704774,0.0075743767,0.0030226647,0.006139689,0.0007932369],"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.000041217594,0.000022468786,0.0002630855,0.00034415393,0.000044002947,0.00010767413,0.00015668824,0.0053404067,0.0014847507,0.95086014,0.006933264,0.034402154],"study_design_scores_gemma":[0.000018012113,0.00004150523,0.000361701,0.00010793517,0.000022700495,0.00024264069,0.000049036018,0.022131057,0.002482606,0.9339347,0.040566247,0.000041881172],"about_ca_topic_score_codex":0.00035464592,"about_ca_topic_score_gemma":0.00019851157,"teacher_disagreement_score":0.004903171,"about_ca_system_score_codex":0.0013152055,"about_ca_system_score_gemma":0.0004827632,"threshold_uncertainty_score":0.025930762},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08574545,0.003213601,0.7646014,0.008944475,0.0011737137,0.0002355906,0.00041087825,0.0001551881,0.13551968],"genre_scores_gemma":[0.7385831,0.003527141,0.22704393,0.0037470798,0.0020556168,0.0007457879,0.00046339852,0.00026849261,0.023565514],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9954997,0.0018661781,0.00035742397,0.0010607572,0.0008207351,0.00039524003],"domain_scores_gemma":[0.97819006,0.015317984,0.0010841074,0.0020035964,0.00236937,0.0010348316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009759243,0.0014233739,0.0019037186,0.0028439495,0.0033526404,0.0041825953,0.0032280535,0.0028442228,0.009349364],"category_scores_gemma":[0.02452253,0.0012365344,0.0034243325,0.002701937,0.010041271,0.023337692,0.0076709436,0.009890319,0.00075975416],"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.000023480401,0.000035480763,0.00015942751,0.000053608394,0.000014677134,0.0000948159,0.00027850884,0.00069614465,0.0006103334,0.99444723,0.00054950727,0.003036772],"study_design_scores_gemma":[0.000009524705,0.000040577837,0.00029681,0.00003407527,0.000016557873,0.00015927522,0.00016383403,0.0053772135,0.00032751326,0.9902603,0.0032981564,0.000016081442],"about_ca_topic_score_codex":0.0006159264,"about_ca_topic_score_gemma":0.00074849074,"teacher_disagreement_score":0.009759243,"about_ca_system_score_codex":0.0014615817,"about_ca_system_score_gemma":0.00107507,"threshold_uncertainty_score":0.051612437},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0052816784,0.00020385564,0.992818,0.0001991263,0.00001848054,0.000009397976,0.00000957022,0.000019849369,0.0014401082],"genre_scores_gemma":[0.49005735,0.0012456954,0.4971675,0.000264197,0.00019387071,0.00022210646,0.00011499212,0.00016193229,0.010572263],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99923706,0.00039162245,0.00003063565,0.00010252018,0.00018163257,0.000056540237],"domain_scores_gemma":[0.9986338,0.00094568793,0.00009784333,0.00011768788,0.00012044235,0.00008449258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025567221,0.0007468872,0.00087700057,0.00063126505,0.00039836287,0.0011880373,0.0015059485,0.0010359979,0.0015629402],"category_scores_gemma":[0.0049190735,0.00048010107,0.00090976176,0.0005320901,0.002246998,0.0019903963,0.001998422,0.0024690516,0.00024491324],"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.000033568373,0.00003819841,0.00029887396,0.000100199926,0.000028762923,0.00007219746,0.00010404081,0.22945662,0.00239585,0.7549328,0.00043322193,0.012105695],"study_design_scores_gemma":[0.0000052067294,0.00002913168,0.00004586585,0.000014894806,0.0000051638754,0.00003311653,0.000015575333,0.88859797,0.00041408098,0.10976602,0.0010662522,0.0000066877474],"about_ca_topic_score_codex":0.0011767447,"about_ca_topic_score_gemma":0.0010584627,"teacher_disagreement_score":0.0025567221,"about_ca_system_score_codex":0.0012597787,"about_ca_system_score_gemma":0.0009803366,"threshold_uncertainty_score":0.013521433},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016843673,0.00026844768,0.97603625,0.00023490065,0.000053670185,0.000096372416,0.000070917784,0.000049785667,0.00634596],"genre_scores_gemma":[0.6895448,0.00071943743,0.30292135,0.00026061168,0.00011414297,0.0005191262,0.00024823347,0.00014233326,0.0055299443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988356,0.0005546818,0.00005813063,0.00013117329,0.0003230528,0.000097401935],"domain_scores_gemma":[0.99805754,0.0011700458,0.00021517553,0.000108945555,0.00034577984,0.000102444676],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035095531,0.0011639389,0.0011084983,0.00093806064,0.000541471,0.001270424,0.001086025,0.0013280388,0.0024072188],"category_scores_gemma":[0.008234735,0.0005372464,0.0011717521,0.00055564515,0.0017083489,0.0021023713,0.0020248217,0.002047442,0.00032208502],"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.000086335924,0.000049096838,0.0005771264,0.00023920712,0.000045560053,0.00018596789,0.00014533072,0.63369024,0.0041444506,0.3475482,0.001249023,0.012039531],"study_design_scores_gemma":[0.000010427971,0.000056358887,0.00010346381,0.000029899598,0.0000052572977,0.000029877565,0.00002488914,0.9470113,0.0006330195,0.051064257,0.0010206786,0.000010651345],"about_ca_topic_score_codex":0.0011811964,"about_ca_topic_score_gemma":0.0012391725,"teacher_disagreement_score":0.0035095531,"about_ca_system_score_codex":0.00091139844,"about_ca_system_score_gemma":0.0011808786,"threshold_uncertainty_score":0.018560529},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049686357,0.0013053542,0.9381761,0.0007828395,0.000047301575,0.00006995562,0.000073316485,0.00008466091,0.009774054],"genre_scores_gemma":[0.8603099,0.0023129266,0.12811597,0.00029487367,0.00018099863,0.00050974434,0.00022750776,0.00015588615,0.007892306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99840695,0.00068846194,0.00008276925,0.00029634533,0.00038749556,0.00013804068],"domain_scores_gemma":[0.9943098,0.0041875434,0.0003812607,0.00022524306,0.0007058229,0.00019029423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0047949716,0.0010700098,0.0012253853,0.001399625,0.0009811103,0.002110946,0.0010918379,0.0011848448,0.0030387077],"category_scores_gemma":[0.012936427,0.0005200228,0.0016867556,0.0008798297,0.0024832215,0.003734657,0.0029198688,0.0031339792,0.0003233554],"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.0001200398,0.000058894744,0.00080445776,0.00035396565,0.00007868679,0.0001652379,0.0005853669,0.1979946,0.012138608,0.76052916,0.0011333022,0.026037652],"study_design_scores_gemma":[0.00001314541,0.00011922263,0.00043817324,0.000053418185,0.000024396992,0.000089685775,0.00008289999,0.8124635,0.002360571,0.18265659,0.0016715901,0.000026761629],"about_ca_topic_score_codex":0.0013443244,"about_ca_topic_score_gemma":0.0005319884,"teacher_disagreement_score":0.0047949716,"about_ca_system_score_codex":0.001244538,"about_ca_system_score_gemma":0.0011416292,"threshold_uncertainty_score":0.025358558},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014366754,0.0006124407,0.97664547,0.00079942634,0.00008599602,0.000023048378,0.000042709013,0.000025940124,0.0073982216],"genre_scores_gemma":[0.64662856,0.0028290004,0.33401275,0.0006160949,0.0005551185,0.0002474375,0.00017835281,0.0002131227,0.014719713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990736,0.0005353781,0.000027158654,0.00009512882,0.00019772959,0.00007094755],"domain_scores_gemma":[0.998738,0.00078853295,0.00012839785,0.000069278125,0.00020106582,0.00007473226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023463103,0.0008992382,0.00091896113,0.0012354191,0.00047058056,0.0019856412,0.0008283336,0.0008773725,0.002952651],"category_scores_gemma":[0.004352107,0.00043214182,0.0011689105,0.0009104051,0.002970017,0.0029413104,0.0024105383,0.002998198,0.0003247509],"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.000021176613,0.000022140937,0.00015099709,0.00009503162,0.000016324708,0.000049937076,0.00008558913,0.048991438,0.0012675675,0.94152105,0.0007418507,0.007036892],"study_design_scores_gemma":[0.000013314389,0.000056630397,0.00017226461,0.00003398331,0.000009753444,0.00005814732,0.00006526341,0.51470995,0.0012020185,0.48055026,0.003113045,0.000015326625],"about_ca_topic_score_codex":0.001034018,"about_ca_topic_score_gemma":0.0007037853,"teacher_disagreement_score":0.002952651,"about_ca_system_score_codex":0.001304365,"about_ca_system_score_gemma":0.0009500183,"threshold_uncertainty_score":0.012408614},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.045291834,0.000609388,0.9416132,0.0006583318,0.00017226239,0.00009235749,0.00013266568,0.00006855812,0.011361424],"genre_scores_gemma":[0.820711,0.0012822985,0.15506095,0.00032788602,0.00031097495,0.0006102936,0.00036636667,0.00019520763,0.02113487],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984798,0.0005525691,0.000088390145,0.00023883737,0.0005237522,0.000116688454],"domain_scores_gemma":[0.99810827,0.0009929523,0.0001977155,0.00008341732,0.0005143296,0.00010326335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028621475,0.000999316,0.0009663748,0.0007521187,0.0004416344,0.0013871917,0.0007205465,0.0011243242,0.0027193385],"category_scores_gemma":[0.0044982857,0.00049604825,0.000797153,0.00037083268,0.0019743764,0.0020689988,0.0015494698,0.0021257973,0.00032033736],"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.00011743581,0.000085902066,0.0005460598,0.00044749022,0.00004365007,0.00023078955,0.0003153609,0.14383468,0.026154067,0.809909,0.0027030671,0.015612449],"study_design_scores_gemma":[0.000033567918,0.00021397005,0.00055896776,0.000040982854,0.000012655062,0.000101383834,0.00008870559,0.7868736,0.004901611,0.203631,0.0035132372,0.000030376044],"about_ca_topic_score_codex":0.0009596747,"about_ca_topic_score_gemma":0.0008710643,"teacher_disagreement_score":0.0028621475,"about_ca_system_score_codex":0.0011168763,"about_ca_system_score_gemma":0.0015189961,"threshold_uncertainty_score":0.0151366},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003907615,0.0001466388,0.9941743,0.00004610051,0.00002133947,0.000030220339,0.000005540422,0.00005657291,0.0016115638],"genre_scores_gemma":[0.3406515,0.00089082046,0.65257573,0.00019566377,0.00014885087,0.00069167675,0.00014078234,0.00022462847,0.0044803433],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992587,0.00027490372,0.000052027273,0.00011276614,0.00023244868,0.00006913969],"domain_scores_gemma":[0.9985892,0.0008087221,0.00012584667,0.000096179465,0.00032454907,0.000055561723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017335254,0.0011310623,0.00093051774,0.0006905539,0.0006227633,0.0007980049,0.0012485767,0.0011357735,0.0022336557],"category_scores_gemma":[0.005441917,0.000457537,0.00089919835,0.0004988553,0.0011278844,0.0015388252,0.0018502094,0.0016177015,0.00050270435],"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.00013797639,0.00011157451,0.0013014245,0.00045745462,0.0001209529,0.00018689795,0.00042392692,0.6083107,0.00985311,0.23815107,0.00284177,0.13810314],"study_design_scores_gemma":[0.0000136881345,0.000047872563,0.00007625628,0.000013124503,0.000006078077,0.000036709615,0.000016203661,0.98302746,0.0010699356,0.01475945,0.0009225136,0.000010698278],"about_ca_topic_score_codex":0.0012963149,"about_ca_topic_score_gemma":0.0010609648,"teacher_disagreement_score":0.0022336557,"about_ca_system_score_codex":0.0004539328,"about_ca_system_score_gemma":0.0010139903,"threshold_uncertainty_score":0.00916785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.073437944,0.0004910789,0.69493294,0.003668675,0.0003405991,0.00007777372,0.000288475,0.0013492563,0.22541326],"genre_scores_gemma":[0.86010927,0.00025770479,0.11221864,0.0007280605,0.0001531929,0.00014555782,0.00027600586,0.0012162558,0.024895318],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9961133,0.0016140096,0.00015439346,0.0008146271,0.0008984901,0.0004052142],"domain_scores_gemma":[0.9859949,0.0091051655,0.0004029977,0.0031879104,0.0010457537,0.00026321592],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033422254,0.00042579792,0.00060956547,0.0010156522,0.0021348158,0.0031149935,0.001245543,0.0010929545,0.022666885],"category_scores_gemma":[0.028916009,0.00037327927,0.00091123045,0.0008730698,0.007715941,0.0045101265,0.0062199454,0.0026341807,0.0029359024],"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.000018835019,0.00000966358,0.0003601315,0.00003712089,0.0000046859805,0.00007899873,0.00063800963,0.0030290156,0.00057575334,0.97596496,0.0018309823,0.017451864],"study_design_scores_gemma":[0.000012149597,0.000013615288,0.00020413792,0.00003626992,0.0000059974177,0.00009575857,0.0001508944,0.022815105,0.0013535862,0.9571888,0.018108973,0.000014811215],"about_ca_topic_score_codex":0.002370793,"about_ca_topic_score_gemma":0.0024659177,"teacher_disagreement_score":0.022666885,"about_ca_system_score_codex":0.0019304171,"about_ca_system_score_gemma":0.0016077077,"threshold_uncertainty_score":0.075828254},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033119349,0.000104949315,0.9960483,0.00003729926,0.000028291746,0.000010725174,0.0000032623325,0.00005221634,0.00040309166],"genre_scores_gemma":[0.29358757,0.00058993034,0.69819194,0.00013990821,0.00017261009,0.00020799242,0.000075136275,0.00014492485,0.006889944],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99971646,0.000086928696,0.000013850906,0.000040500578,0.00012257801,0.000019605748],"domain_scores_gemma":[0.99972695,0.000107234984,0.00003145351,0.000026323556,0.00008170371,0.000026224632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000661828,0.0005472174,0.00065007486,0.00038491114,0.00022787225,0.00038599258,0.0009414882,0.000755967,0.0015538823],"category_scores_gemma":[0.00080922863,0.00026341106,0.0006483238,0.00034318696,0.0006234299,0.0006939989,0.0008379411,0.0009544834,0.00038734818],"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.00014599033,0.000090798174,0.0008336652,0.00044573972,0.00012329957,0.00021035162,0.00021231888,0.7320736,0.032806475,0.06799248,0.002768874,0.16229644],"study_design_scores_gemma":[0.0000061199544,0.00002941935,0.00005456883,0.0000032990695,0.0000033186247,0.000018842826,0.0000033304539,0.99633706,0.000983564,0.0017118622,0.0008440562,0.0000045232136],"about_ca_topic_score_codex":0.0008876057,"about_ca_topic_score_gemma":0.0007678648,"teacher_disagreement_score":0.0015538823,"about_ca_system_score_codex":0.00023176684,"about_ca_system_score_gemma":0.00057488173,"threshold_uncertainty_score":0.0051983},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005588626,0.000064744985,0.993582,0.000047915517,0.000035573303,0.00002944864,0.000004205788,0.00007430911,0.00057310186],"genre_scores_gemma":[0.21092023,0.00015933985,0.78606445,0.00012575055,0.000090240545,0.00024951785,0.00005115457,0.00009963704,0.0022396795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994611,0.00025609438,0.000036700534,0.000061481114,0.00014904086,0.000035532288],"domain_scores_gemma":[0.99919873,0.00043056282,0.00007565045,0.000086937805,0.00013564977,0.00007251266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016779285,0.0007961664,0.0008298347,0.0005018155,0.00032973185,0.00047260817,0.0013760817,0.00088423514,0.0016443728],"category_scores_gemma":[0.002890246,0.00034638122,0.0005607404,0.0002718398,0.0007462775,0.0011892748,0.0010450204,0.0013710557,0.00037256718],"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.00028621498,0.00022173155,0.0011324687,0.00030082575,0.00008130627,0.00032070672,0.00030827828,0.6297956,0.02538402,0.16931565,0.0022488637,0.1706043],"study_design_scores_gemma":[0.000012963179,0.0000720177,0.000056586883,0.00000599199,0.0000031490886,0.00002459517,0.000005169045,0.9941658,0.0012429132,0.0035962213,0.0008080294,0.0000064402852],"about_ca_topic_score_codex":0.00081920583,"about_ca_topic_score_gemma":0.0010851114,"teacher_disagreement_score":0.0016779285,"about_ca_system_score_codex":0.0003446018,"about_ca_system_score_gemma":0.00068029785,"threshold_uncertainty_score":0.00887382},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008831406,0.00013241677,0.9893037,0.00012844926,0.00006445974,0.000038650014,0.000009924271,0.00007519825,0.0014158103],"genre_scores_gemma":[0.41043267,0.00050135225,0.58395284,0.00021073756,0.0001453075,0.0002971431,0.000092507544,0.00014067497,0.004226805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994363,0.00022822472,0.00003882035,0.00006130769,0.00018689454,0.000048348382],"domain_scores_gemma":[0.99927,0.0003566889,0.000070304595,0.000062185994,0.00016983309,0.000070955335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001723558,0.0009923237,0.0010618491,0.0006853218,0.00037194206,0.0007497836,0.0010109537,0.0010007299,0.0020140219],"category_scores_gemma":[0.003045933,0.00042061493,0.000844638,0.0004543536,0.0009091915,0.0012654136,0.0013940936,0.0012791003,0.00030030555],"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.00026593616,0.00014516908,0.00084183173,0.00031104256,0.00009951923,0.0002547476,0.0001721046,0.77109474,0.014583619,0.1064405,0.0018483639,0.1039424],"study_design_scores_gemma":[0.000009418743,0.00003980352,0.000044466964,0.000004690352,0.0000026454757,0.000012469088,0.0000034757413,0.9962205,0.00071182364,0.0025098894,0.00043617727,0.000004532339],"about_ca_topic_score_codex":0.001628479,"about_ca_topic_score_gemma":0.0013866118,"teacher_disagreement_score":0.0020140219,"about_ca_system_score_codex":0.00052641233,"about_ca_system_score_gemma":0.0010660717,"threshold_uncertainty_score":0.0091151595},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011774958,0.00089727883,0.97454417,0.00037642437,0.00021472473,0.000064804684,0.00006791867,0.000044990466,0.012014724],"genre_scores_gemma":[0.3703099,0.0025218376,0.6109822,0.00055102987,0.00046529344,0.0004804007,0.00017018322,0.0002188902,0.014300264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820006,0.0004997582,0.00019064582,0.00037965446,0.0006262761,0.00010362457],"domain_scores_gemma":[0.99849343,0.0006691731,0.00010417937,0.00016181322,0.0004655563,0.000105897394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044512083,0.00069839705,0.0008435312,0.0014533285,0.0010014714,0.0018225809,0.001054597,0.0009120848,0.0025109488],"category_scores_gemma":[0.0056629255,0.0003880585,0.0014924571,0.001010777,0.002922423,0.003269116,0.0022592677,0.0031102072,0.00039181966],"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.00000677995,0.000010451318,0.00014690806,0.000034876717,0.000008708203,0.00011171177,0.00012801761,0.0029434196,0.001074044,0.98570085,0.0005192908,0.009314963],"study_design_scores_gemma":[0.000012805084,0.000030400024,0.00022489543,0.000031157055,0.000013481583,0.00031288352,0.00005136077,0.077018626,0.001429095,0.9112737,0.009579044,0.000022575701],"about_ca_topic_score_codex":0.0009879133,"about_ca_topic_score_gemma":0.0010229421,"teacher_disagreement_score":0.0044512083,"about_ca_system_score_codex":0.0010831702,"about_ca_system_score_gemma":0.00097168586,"threshold_uncertainty_score":0.023540556},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015597846,0.0013062956,0.9754505,0.00035035645,0.0000984159,0.000048711878,0.000040918163,0.000041658048,0.00706526],"genre_scores_gemma":[0.6299753,0.00401904,0.34966063,0.00038750382,0.00029701059,0.00044309732,0.00022376988,0.00020951904,0.014784028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952626,0.00026337244,0.000020560672,0.00005509993,0.00009699812,0.000037726666],"domain_scores_gemma":[0.9988657,0.00085429224,0.00006678291,0.000054269683,0.0001276778,0.00003133056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019223097,0.000972424,0.0012615968,0.0006359845,0.000422054,0.0011180349,0.0006209849,0.00081560994,0.0035218236],"category_scores_gemma":[0.004038918,0.00044788586,0.0005891229,0.0007807189,0.0010020856,0.0015212985,0.0012877691,0.001391303,0.0003352498],"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.00011751732,0.000091678514,0.00033352428,0.00038521682,0.00007282829,0.00009785054,0.00012677324,0.49099228,0.005854008,0.44607988,0.002754189,0.053094223],"study_design_scores_gemma":[0.0000088954375,0.000046997757,0.00009957028,0.000025909936,0.000006724741,0.00002469711,0.000022056813,0.9326703,0.0007814075,0.06457824,0.0017299579,0.0000053334948],"about_ca_topic_score_codex":0.0007699314,"about_ca_topic_score_gemma":0.00073592446,"teacher_disagreement_score":0.0035218236,"about_ca_system_score_codex":0.00049012335,"about_ca_system_score_gemma":0.000893126,"threshold_uncertainty_score":0.0117816925},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054782312,0.00027988292,0.9435008,0.000070362454,0.000026189025,0.00002801004,0.0000097368775,0.000032279786,0.0012704055],"genre_scores_gemma":[0.58660066,0.0004065273,0.40924445,0.000057265086,0.00005385922,0.00010582146,0.00005465977,0.000054223543,0.0034226684],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99896646,0.0004634396,0.00007169009,0.00016991027,0.00025519377,0.00007334204],"domain_scores_gemma":[0.9976356,0.0014419247,0.00024943062,0.00015940952,0.00034570415,0.0001679668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028272348,0.0008518249,0.0010497111,0.0008107573,0.0006483785,0.0015693809,0.0013590035,0.0012038759,0.0011477333],"category_scores_gemma":[0.0075521464,0.00060739677,0.0012755886,0.0006496561,0.002413657,0.0035387992,0.0021540525,0.0019284465,0.00017073794],"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.00020937684,0.00007777204,0.001550598,0.00032190813,0.0001153259,0.000491896,0.00063956797,0.2576572,0.017179752,0.68817776,0.0003625499,0.03321628],"study_design_scores_gemma":[0.000014555603,0.000085062435,0.000108009066,0.000013205289,0.0000084905005,0.000102133454,0.000057484594,0.9096431,0.002837978,0.08648022,0.0006326141,0.00001716231],"about_ca_topic_score_codex":0.00077431404,"about_ca_topic_score_gemma":0.00050608086,"teacher_disagreement_score":0.0028272348,"about_ca_system_score_codex":0.00072973344,"about_ca_system_score_gemma":0.00067507074,"threshold_uncertainty_score":0.014952064},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.067098245,0.0025050922,0.9080285,0.002329118,0.00025251025,0.00016994239,0.00016901208,0.00012064968,0.01932702],"genre_scores_gemma":[0.8086887,0.0034579842,0.15726069,0.0012553537,0.00052108295,0.000524666,0.00050042284,0.00052843464,0.027262643],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99823135,0.00094847823,0.00007446292,0.00027176793,0.0002933679,0.0001805506],"domain_scores_gemma":[0.9886828,0.008473523,0.00089879165,0.00032395957,0.0009676675,0.0006532678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008085986,0.0028464834,0.0032529226,0.0028262576,0.0011942618,0.003664151,0.002249056,0.0034108954,0.0044757635],"category_scores_gemma":[0.03312461,0.0015309586,0.0020502312,0.0017137905,0.004345036,0.004537697,0.0050447346,0.005232469,0.0003795106],"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.00025243027,0.0001302007,0.00084160443,0.0005474735,0.00017299382,0.0003374965,0.00039374374,0.2818245,0.0040351287,0.69345754,0.0038047084,0.014202197],"study_design_scores_gemma":[0.000031229614,0.00011231693,0.0004637525,0.00008331479,0.000026961074,0.000090596965,0.00009600721,0.7471419,0.00064512924,0.25007316,0.0012012816,0.000034382632],"about_ca_topic_score_codex":0.0019522235,"about_ca_topic_score_gemma":0.0018112184,"teacher_disagreement_score":0.008085986,"about_ca_system_score_codex":0.0020651862,"about_ca_system_score_gemma":0.0018992434,"threshold_uncertainty_score":0.042763293},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024054605,0.00029065963,0.99498075,0.00011015479,0.00019598562,0.000024107985,0.000026169097,0.00017434912,0.0017923226],"genre_scores_gemma":[0.12508486,0.0006926644,0.8636111,0.0002567117,0.00041660637,0.00035303857,0.00023786735,0.0005775964,0.008769549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894005,0.0004972629,0.0000850048,0.00010813009,0.00029630453,0.00007331793],"domain_scores_gemma":[0.9982488,0.00095956516,0.000114410475,0.00025478774,0.0003130475,0.000109377586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020863386,0.0019480629,0.0015331745,0.0010828901,0.000614161,0.0012441634,0.00201141,0.0015935109,0.005045328],"category_scores_gemma":[0.007063836,0.00093376165,0.0011359801,0.0014492018,0.0013621821,0.0027552722,0.0030504616,0.004236163,0.0012608543],"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.00050036295,0.00027932224,0.00054692855,0.00046452563,0.00014283141,0.00021589042,0.0002723905,0.4076978,0.009574901,0.28562647,0.010800165,0.2838784],"study_design_scores_gemma":[0.00001922713,0.00006512685,0.00007194209,0.000015105803,0.0000075528837,0.000023386578,0.000009819565,0.9740684,0.0009737938,0.021959363,0.0027747734,0.00001150878],"about_ca_topic_score_codex":0.00306082,"about_ca_topic_score_gemma":0.0046140705,"teacher_disagreement_score":0.005045328,"about_ca_system_score_codex":0.0006405639,"about_ca_system_score_gemma":0.0012296026,"threshold_uncertainty_score":0.016878307},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013440823,0.0006952144,0.9817485,0.00032285904,0.000055382043,0.000052436164,0.000039196468,0.000047581398,0.0035978993],"genre_scores_gemma":[0.47412097,0.003295408,0.4828104,0.00032264154,0.0003019656,0.0006642623,0.00032536793,0.00035081393,0.037808184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987679,0.0006937994,0.000040034327,0.00013565026,0.00026316935,0.000099453144],"domain_scores_gemma":[0.9964851,0.0025575284,0.00018253764,0.00009649553,0.00044805763,0.00023019114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003872491,0.0015799047,0.0019498438,0.0022322116,0.00075450126,0.0019122945,0.0019378177,0.0017485615,0.0033735007],"category_scores_gemma":[0.010162053,0.000997215,0.0013390948,0.0010969578,0.0023388434,0.0024231179,0.0046540257,0.0033919022,0.00042103007],"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.000117620795,0.00010346939,0.0003283052,0.0002664761,0.000108361695,0.00008637247,0.00022525001,0.22685772,0.0018981117,0.7482419,0.0013361534,0.020430345],"study_design_scores_gemma":[0.000033720014,0.000067070105,0.000115033174,0.000053538777,0.000030536565,0.000029138026,0.000077639765,0.66634166,0.0004599673,0.33069375,0.0020787332,0.00001924437],"about_ca_topic_score_codex":0.0029241072,"about_ca_topic_score_gemma":0.0035100337,"teacher_disagreement_score":0.003872491,"about_ca_system_score_codex":0.001731345,"about_ca_system_score_gemma":0.0022283047,"threshold_uncertainty_score":0.020479918},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09453572,0.00065014325,0.87263244,0.00065366144,0.00012191389,0.00012469185,0.00051973056,0.00012427989,0.030637417],"genre_scores_gemma":[0.9083891,0.00082564,0.07689561,0.00028213815,0.00011186072,0.00029997327,0.00072231906,0.000093868766,0.0123795755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991622,0.00024864764,0.00004938047,0.00012772213,0.00028483625,0.00012718319],"domain_scores_gemma":[0.9983606,0.00080171827,0.0001679937,0.00007703254,0.00042323463,0.00016943984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015212101,0.0008551841,0.00073547644,0.0008167474,0.00053434283,0.0014808683,0.0005979275,0.0006887226,0.004739058],"category_scores_gemma":[0.0034560352,0.0003027883,0.00054117665,0.00071826554,0.0011566184,0.0017405379,0.0010521088,0.0012842335,0.0003277508],"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.00007281956,0.0000760833,0.00067491975,0.0002194611,0.000049724495,0.00028099632,0.00009529669,0.09736109,0.0065664547,0.87949157,0.0029350761,0.012176516],"study_design_scores_gemma":[0.000034458553,0.00010520884,0.000560816,0.000053160613,0.000014541537,0.00021269375,0.00010936004,0.5882246,0.0034047393,0.40313983,0.0041095754,0.000030980584],"about_ca_topic_score_codex":0.0017410648,"about_ca_topic_score_gemma":0.0015411334,"teacher_disagreement_score":0.004739058,"about_ca_system_score_codex":0.0006528467,"about_ca_system_score_gemma":0.001525798,"threshold_uncertainty_score":0.015853703},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053142807,0.00019685109,0.99190485,0.00021943558,0.000053726457,0.00006333622,0.000027075714,0.00068536977,0.0015351438],"genre_scores_gemma":[0.14207368,0.00019526659,0.8533456,0.0003087541,0.00012675607,0.000340499,0.0002815193,0.00045573755,0.0028722568],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882,0.00034165452,0.000091994356,0.00023715103,0.00035167142,0.00015741854],"domain_scores_gemma":[0.99724823,0.0017249226,0.0001734256,0.00034305506,0.00035699067,0.00015329603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019356158,0.0016767262,0.001959647,0.00084520277,0.00074000546,0.0016320669,0.0021437246,0.002070666,0.005897017],"category_scores_gemma":[0.006905578,0.0008927669,0.0012043271,0.00071186613,0.0011237732,0.0023453482,0.002988028,0.0032983816,0.0022666112],"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.00062900723,0.00027278435,0.0014196812,0.00038241045,0.000117735166,0.00024216092,0.00022334837,0.73861545,0.0054901405,0.05988596,0.009193918,0.1835273],"study_design_scores_gemma":[0.000049907256,0.00003729805,0.000045071414,0.000010008054,0.000006034452,0.000024853534,0.000012659332,0.9864785,0.0005234035,0.011971056,0.0008346057,0.0000065669356],"about_ca_topic_score_codex":0.0023224796,"about_ca_topic_score_gemma":0.0030155012,"teacher_disagreement_score":0.005897017,"about_ca_system_score_codex":0.0009175281,"about_ca_system_score_gemma":0.0026587471,"threshold_uncertainty_score":0.019727468},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09298,0.0014105566,0.8606459,0.002256191,0.00018573573,0.0009267393,0.0030520181,0.008247092,0.030295707],"genre_scores_gemma":[0.3295085,0.0006356826,0.6506461,0.00032688887,0.000093631024,0.00043291162,0.0052381083,0.001045452,0.012072677],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979159,0.00036287567,0.000111352514,0.0007652143,0.00031691988,0.0005277474],"domain_scores_gemma":[0.99525094,0.002912539,0.0002943099,0.0010274057,0.00026708818,0.00024773172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013499003,0.0018226296,0.0017378408,0.0012029347,0.0022457575,0.0032189067,0.003205037,0.0017841961,0.01777741],"category_scores_gemma":[0.0070004836,0.0010612994,0.0024273319,0.0023249956,0.0016458373,0.0069269906,0.0030554424,0.0029259014,0.00300919],"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.0009529734,0.00065568485,0.0032210737,0.0011652851,0.00016534967,0.00022855212,0.00095817813,0.2619313,0.0076542124,0.28068522,0.04226174,0.40012035],"study_design_scores_gemma":[0.00024627932,0.00007997421,0.0005836268,0.00006635941,0.000065158245,0.00014566937,0.00043064117,0.43920544,0.0040436983,0.54032624,0.014765788,0.0000410857],"about_ca_topic_score_codex":0.010668413,"about_ca_topic_score_gemma":0.014569072,"teacher_disagreement_score":0.01777741,"about_ca_system_score_codex":0.004004884,"about_ca_system_score_gemma":0.0034427925,"threshold_uncertainty_score":0.05947137},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023689186,0.00017117172,0.97346276,0.00014712603,0.00002009762,0.00003500617,0.000016553904,0.000032996024,0.002424986],"genre_scores_gemma":[0.81148785,0.00028358246,0.18149914,0.00010216399,0.000039141563,0.00028790103,0.00007156212,0.00005706927,0.006171498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99928916,0.00025239552,0.000035568413,0.00018504873,0.00016370336,0.00007402158],"domain_scores_gemma":[0.9993142,0.0004036814,0.000072243616,0.00004091613,0.00011376142,0.00005524507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019704828,0.0011074387,0.001227201,0.00064773555,0.0006623631,0.0012210667,0.0012575412,0.001663363,0.0026315413],"category_scores_gemma":[0.0026283455,0.00054001005,0.0010555604,0.00040605155,0.0014002789,0.0019759226,0.0025301473,0.0014269664,0.00023041488],"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.00014355154,0.00010401037,0.001598826,0.0004162248,0.00017271965,0.0005223881,0.00033450295,0.6922443,0.010281783,0.25961238,0.00083243573,0.03373693],"study_design_scores_gemma":[0.000009492236,0.00004653082,0.000092099755,0.000012804385,0.000010978389,0.000038668182,0.000038414863,0.9660224,0.0010572604,0.03225802,0.0004048858,0.000008482259],"about_ca_topic_score_codex":0.0015313865,"about_ca_topic_score_gemma":0.0013739046,"teacher_disagreement_score":0.0026315413,"about_ca_system_score_codex":0.00086377695,"about_ca_system_score_gemma":0.000969516,"threshold_uncertainty_score":0.010421038},"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":"review","genre_gemma":"review","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"review","genre_consensus":"review","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0108283,0.826156,0.075318255,0.006109844,0.0015095453,0.000046982568,0.00026849494,0.0001449386,0.07961757],"genre_scores_gemma":[0.13034923,0.80314124,0.041404624,0.002429925,0.007262016,0.00012235687,0.00057261414,0.00020480683,0.014513212],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99863666,0.00037336038,0.00010182357,0.00029907122,0.00048276148,0.00010636271],"domain_scores_gemma":[0.9970884,0.0021164615,0.00012635933,0.00015787642,0.00037786865,0.00013308076],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024381366,0.0012828802,0.0015558375,0.0049689854,0.0013237919,0.003256826,0.0017824731,0.0017450434,0.005187815],"category_scores_gemma":[0.0050341953,0.00092198903,0.0011767134,0.006895994,0.00401513,0.0061011463,0.003685455,0.003878844,0.0016713055],"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.00003264687,0.00009007,0.00144726,0.0024570615,0.00007013187,0.00022644937,0.00042356734,0.0035839062,0.00062230777,0.7943787,0.02370756,0.17296037],"study_design_scores_gemma":[0.000016766611,0.00006530669,0.0017606752,0.0011236456,0.000031986718,0.00091717584,0.0002495572,0.008110642,0.0005680828,0.72574455,0.2613557,0.000055902885],"about_ca_topic_score_codex":0.00163282,"about_ca_topic_score_gemma":0.0010462048,"teacher_disagreement_score":0.005187815,"about_ca_system_score_codex":0.0018939836,"about_ca_system_score_gemma":0.0013012437,"threshold_uncertainty_score":0.017354965},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09223166,0.0032177828,0.77637345,0.0041784532,0.0005584389,0.00014065653,0.0007382037,0.0003129032,0.12224847],"genre_scores_gemma":[0.806823,0.004162342,0.14577575,0.0022836428,0.00088873296,0.0005251426,0.0006646609,0.00046041954,0.0384163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981869,0.00051743846,0.00009713586,0.00036322317,0.00063135545,0.00020394394],"domain_scores_gemma":[0.99589133,0.0022271299,0.00022285161,0.00039968416,0.0010184852,0.0002404759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033549534,0.00060077425,0.000865993,0.0020084,0.0015520784,0.0018769589,0.0013287948,0.0008980446,0.0070758425],"category_scores_gemma":[0.012203792,0.00035274483,0.0010854499,0.0014428989,0.0037763282,0.00590084,0.004693937,0.00435319,0.0014448225],"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.000028569026,0.00001097431,0.00028630954,0.000049777867,0.0000066094835,0.00005764397,0.0001288753,0.0030280747,0.0007896414,0.9861558,0.0013016734,0.008156181],"study_design_scores_gemma":[0.000013937756,0.00006288589,0.000560342,0.000052943975,0.000010683422,0.00017987848,0.000105337764,0.043187525,0.0014722251,0.9422646,0.01206256,0.000027050755],"about_ca_topic_score_codex":0.001105346,"about_ca_topic_score_gemma":0.00060309056,"teacher_disagreement_score":0.0070758425,"about_ca_system_score_codex":0.001161914,"about_ca_system_score_gemma":0.0008511202,"threshold_uncertainty_score":0.02367109},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17523226,0.0039151628,0.6342405,0.0030730248,0.0012903108,0.00015530203,0.0009583629,0.0014393454,0.17969564],"genre_scores_gemma":[0.84299976,0.0018235128,0.09531417,0.00068534893,0.0016131796,0.00033359535,0.00089105824,0.0010744556,0.055264793],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.98809147,0.0022861732,0.00086483744,0.0027744162,0.004523976,0.0014592122],"domain_scores_gemma":[0.96996516,0.016570883,0.0027944145,0.0045320294,0.0035557768,0.0025817233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069681434,0.002146755,0.0018930535,0.009550572,0.004166434,0.0073289787,0.005235436,0.002507416,0.02683488],"category_scores_gemma":[0.04176842,0.0015950067,0.0021108235,0.0045594173,0.0065750987,0.016200872,0.011256867,0.007817878,0.0048270845],"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.00014011323,0.000031272346,0.0009116394,0.000111174064,0.000030656283,0.0002229232,0.00023898909,0.0036483093,0.0005827416,0.976113,0.002508909,0.015460257],"study_design_scores_gemma":[0.00001565123,0.00003751053,0.00045334751,0.000060706963,0.000031851017,0.0002802541,0.00013104579,0.0198541,0.0012646054,0.9720024,0.0058282963,0.00004015881],"about_ca_topic_score_codex":0.0017924955,"about_ca_topic_score_gemma":0.0015592277,"teacher_disagreement_score":0.02683488,"about_ca_system_score_codex":0.0046100537,"about_ca_system_score_gemma":0.0012614502,"threshold_uncertainty_score":0.08977163},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024203897,0.00013845069,0.9738661,0.000075780255,0.000021640297,0.000025406043,0.000007599937,0.000044712615,0.0016165107],"genre_scores_gemma":[0.64534366,0.00046056125,0.34815902,0.00010323719,0.00005626956,0.00028546868,0.000060781764,0.0000844037,0.005446655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995864,0.00017282917,0.000019703228,0.000066097855,0.00012033842,0.00003469371],"domain_scores_gemma":[0.99927837,0.00040232023,0.00007784924,0.000050449868,0.00012859884,0.0000623478],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017181631,0.0008065811,0.00073531526,0.00067640113,0.00045495515,0.00078252476,0.0010359264,0.00082253333,0.0013318324],"category_scores_gemma":[0.0032072146,0.00039028004,0.00078125065,0.0003601328,0.0018294053,0.0014307704,0.0020730146,0.0012781181,0.0002571356],"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.00009240508,0.000042521347,0.0009494883,0.00016517188,0.000056410023,0.0001529456,0.00031234574,0.5480342,0.010624657,0.4084895,0.00054150954,0.030538814],"study_design_scores_gemma":[0.000007603837,0.000032814118,0.000058351954,0.000007349999,0.000002874047,0.00002428591,0.000020456482,0.96427864,0.001092154,0.033981346,0.0004867307,0.000007309087],"about_ca_topic_score_codex":0.0012045262,"about_ca_topic_score_gemma":0.0007552746,"teacher_disagreement_score":0.0017181631,"about_ca_system_score_codex":0.000641638,"about_ca_system_score_gemma":0.0008587239,"threshold_uncertainty_score":0.009086609},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008129917,0.0001364382,0.9885132,0.00009720373,0.000024531337,0.00003353138,0.000008519186,0.00008387592,0.002972812],"genre_scores_gemma":[0.36695215,0.00029431694,0.6255945,0.00017157535,0.00007034458,0.00022486104,0.00005099903,0.000280096,0.0063611395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989483,0.0004912809,0.000042994714,0.00015217953,0.0003031359,0.000062116196],"domain_scores_gemma":[0.9979601,0.0011252105,0.0001516376,0.000324228,0.00031154335,0.00012717517],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026229213,0.00075519725,0.0006807379,0.00076939375,0.00053391344,0.0008583345,0.0017404268,0.00110005,0.0028157441],"category_scores_gemma":[0.007886584,0.0003694327,0.00078586885,0.0004752668,0.0022137035,0.0016685073,0.0027485446,0.0022249857,0.00042050026],"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.000065294465,0.000050855648,0.00031808708,0.00009350752,0.000028413993,0.00015120948,0.00033140613,0.24642876,0.004739242,0.7176149,0.0007237319,0.029454587],"study_design_scores_gemma":[0.000012059167,0.000041641975,0.00003774225,0.000018676625,0.0000049112796,0.000046050718,0.000026224572,0.87002575,0.0017904076,0.12564361,0.0023409186,0.000012039288],"about_ca_topic_score_codex":0.00078932464,"about_ca_topic_score_gemma":0.0007322674,"teacher_disagreement_score":0.0028157441,"about_ca_system_score_codex":0.0008563693,"about_ca_system_score_gemma":0.00083470007,"threshold_uncertainty_score":0.013871491},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010774616,0.00006160023,0.9978835,0.00007823219,0.00003109405,0.000027710588,0.00001778469,0.00012200045,0.00070056226],"genre_scores_gemma":[0.05940892,0.00015602125,0.9370088,0.00012720209,0.000070430666,0.0001973217,0.000104249724,0.00011119625,0.0028158529],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989568,0.0003844061,0.00005111522,0.00014304767,0.00038012242,0.000084493324],"domain_scores_gemma":[0.99888664,0.00055311254,0.0000687874,0.00013336209,0.00027366317,0.00008444308],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001793634,0.00094348076,0.0010930201,0.00069751707,0.00042849165,0.0011044298,0.0014646022,0.0018003278,0.003991186],"category_scores_gemma":[0.004478624,0.00067992,0.0008429335,0.0006416047,0.0010381349,0.0013038787,0.0019072391,0.0022555958,0.0014967389],"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.00014731075,0.00012872159,0.00044345783,0.00023480866,0.00007371184,0.00019824029,0.00014542537,0.56109065,0.009498951,0.22673109,0.006572619,0.19473505],"study_design_scores_gemma":[0.000018798806,0.000042237174,0.000045829613,0.000010381479,0.0000033691194,0.00004884272,0.0000050395433,0.9786324,0.0009825609,0.017788325,0.0024103252,0.000011927547],"about_ca_topic_score_codex":0.0013597348,"about_ca_topic_score_gemma":0.001392638,"teacher_disagreement_score":0.003991186,"about_ca_system_score_codex":0.000550172,"about_ca_system_score_gemma":0.0013837934,"threshold_uncertainty_score":0.013351858},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003082541,0.0002228199,0.99498737,0.0000897688,0.0000885849,0.000032273125,0.000013351954,0.000091430535,0.0013919061],"genre_scores_gemma":[0.22255014,0.0010128366,0.7667589,0.00029959102,0.00027057197,0.0002883156,0.00016070352,0.00022185312,0.008437041],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99963593,0.00012322611,0.00002445152,0.000052699208,0.00012994187,0.00003378044],"domain_scores_gemma":[0.99975544,0.000088709676,0.000029305284,0.000019786896,0.00007614373,0.00003063176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076997466,0.0009922246,0.0010262384,0.00057076,0.00034960403,0.00054576906,0.0012293023,0.0009824244,0.0023533818],"category_scores_gemma":[0.0012228808,0.0003499997,0.0007111233,0.00040158478,0.0005343528,0.0012907363,0.0010126579,0.0012484232,0.00059648365],"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.00026508534,0.00017619632,0.0010198546,0.0006408428,0.00014129083,0.0003976481,0.00023771299,0.62048835,0.030317267,0.1269288,0.0064731287,0.2129138],"study_design_scores_gemma":[0.000015956097,0.00004809858,0.00007793371,0.000008222531,0.0000064363717,0.00003595155,0.000005855266,0.99301416,0.0011651508,0.0031218515,0.0024917868,0.000008741068],"about_ca_topic_score_codex":0.0023923388,"about_ca_topic_score_gemma":0.002428003,"teacher_disagreement_score":0.0023923388,"about_ca_system_score_codex":0.00043083358,"about_ca_system_score_gemma":0.0010415447,"threshold_uncertainty_score":0.00787282},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025217892,0.00048175888,0.99406636,0.00034464055,0.00020935146,0.000043821015,0.000020614221,0.00011816045,0.002193503],"genre_scores_gemma":[0.15476562,0.0012560675,0.8297585,0.0004035619,0.0003849122,0.00047322706,0.00018701854,0.00033146507,0.012439517],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99897265,0.00046246234,0.00006462183,0.00013865894,0.00025443494,0.000107142005],"domain_scores_gemma":[0.99569905,0.0029657,0.0002838598,0.00024238451,0.0005693015,0.000239813],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037140907,0.0024638332,0.0018953561,0.0024677166,0.0010300939,0.0020391557,0.0029177512,0.0030932468,0.0051912395],"category_scores_gemma":[0.01419414,0.0013395133,0.0019144454,0.002049213,0.0020422419,0.0035809642,0.0036311462,0.0064454726,0.00094498455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020506971,0.00024882867,0.0007703389,0.00031812972,0.00012580691,0.00012986745,0.00024406759,0.46164,0.002342985,0.36665013,0.0067285537,0.16059624],"study_design_scores_gemma":[0.000021689675,0.000034901146,0.00006675496,0.000027622826,0.000009112317,0.000018336461,0.000013119508,0.9526474,0.00032667493,0.044937707,0.0018859439,0.000010745978],"about_ca_topic_score_codex":0.00553627,"about_ca_topic_score_gemma":0.005648078,"teacher_disagreement_score":0.00553627,"about_ca_system_score_codex":0.0016689554,"about_ca_system_score_gemma":0.002569813,"threshold_uncertainty_score":0.019642174},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18803269,0.0010099513,0.78650075,0.00053238077,0.00014025008,0.00014824794,0.000098906814,0.00013396892,0.023402873],"genre_scores_gemma":[0.8953255,0.00091721804,0.09039935,0.00015273252,0.00017934098,0.00037077194,0.000116341354,0.00011473729,0.012423991],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99901426,0.00036263192,0.000061320854,0.00015212603,0.0003205399,0.00008902684],"domain_scores_gemma":[0.9972193,0.0014332326,0.00028237232,0.00015952151,0.000631688,0.00027390476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035314301,0.00095927564,0.0007406033,0.0017017697,0.0007740179,0.0013734297,0.0010609527,0.0007190792,0.0031943575],"category_scores_gemma":[0.0076235724,0.00031936888,0.0010696842,0.00045624046,0.0022602235,0.0024853223,0.0023307686,0.0020334106,0.00030979014],"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.00008682418,0.00005570755,0.0007717716,0.0001362209,0.000054672597,0.00017429,0.00036154792,0.040352933,0.006472718,0.94031936,0.0005309985,0.010682887],"study_design_scores_gemma":[0.000027964874,0.00015717595,0.0010056819,0.00007210795,0.000024825908,0.00018708855,0.00018904629,0.5095035,0.005966753,0.48019373,0.0026359323,0.0000362455],"about_ca_topic_score_codex":0.0005440105,"about_ca_topic_score_gemma":0.00036747288,"teacher_disagreement_score":0.0035314301,"about_ca_system_score_codex":0.000961588,"about_ca_system_score_gemma":0.0008597899,"threshold_uncertainty_score":0.018676162},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024579864,0.00068816484,0.9642103,0.00036183768,0.00031748172,0.000028254528,0.00011273779,0.000653395,0.031169953],"genre_scores_gemma":[0.25735635,0.0041926107,0.65563965,0.0009863188,0.0021140995,0.00077288214,0.0014901041,0.0056206184,0.07182738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978829,0.0008648685,0.00008353795,0.0002933998,0.00075569167,0.000119620716],"domain_scores_gemma":[0.9932508,0.0047309184,0.00022686392,0.001051677,0.00060815725,0.0001315734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028552995,0.0022599483,0.0022230726,0.0029427805,0.0010346511,0.003388801,0.0019321892,0.0018560383,0.022435833],"category_scores_gemma":[0.0153199155,0.0014944169,0.0016112783,0.0026779822,0.0022041805,0.0053767767,0.0038834398,0.0049759783,0.008236452],"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.00004565133,0.00005151774,0.00011046522,0.0001497529,0.00003397745,0.000035638022,0.00014513193,0.048673976,0.0018547165,0.8372099,0.01759259,0.094096705],"study_design_scores_gemma":[0.0000064812707,0.000010774858,0.000046149293,0.000041909312,0.000009354371,0.000016329272,0.000012767828,0.13137957,0.0009819827,0.8598513,0.007628328,0.00001515656],"about_ca_topic_score_codex":0.000541488,"about_ca_topic_score_gemma":0.0006506872,"teacher_disagreement_score":0.022435833,"about_ca_system_score_codex":0.0010833818,"about_ca_system_score_gemma":0.0005753702,"threshold_uncertainty_score":0.07505536},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9912238,0.00009122405,0.001419968,0.000057585672,0.000008550535,0.000009687223,0.005108797,0.00022005186,0.0018603868],"genre_scores_gemma":[0.99067557,0.000038390626,0.0013713073,0.000019823448,0.000009601647,0.000010476992,0.0072502517,0.000026657819,0.000597949],"study_design_codex":"observational","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995772,0.00008017554,0.000016875521,0.00011905098,0.00012233928,0.00008429476],"domain_scores_gemma":[0.9993498,0.00019068674,0.00015342537,0.00009419337,0.000114910836,0.000096912394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007691581,0.0006523849,0.0005083006,0.0012135111,0.00034927556,0.00076630694,0.00068143895,0.0005710707,0.0019022903],"category_scores_gemma":[0.0007121969,0.00027629695,0.00051183207,0.001202855,0.00022155893,0.00033100933,0.0007075557,0.0003429758,0.0005457433],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004871823,0.00068624114,0.72380984,0.0005287751,0.0015379261,0.00189287,0.00017393638,0.041597124,0.1930323,0.0031966835,0.007130347,0.021542197],"study_design_scores_gemma":[0.000303832,0.0006712514,0.6439883,0.000035911704,0.00039890627,0.0013244923,0.00016359113,0.1649089,0.17970759,0.0019845532,0.0063817464,0.00013085965],"about_ca_topic_score_codex":0.0034262321,"about_ca_topic_score_gemma":0.007074603,"teacher_disagreement_score":0.0034262321,"about_ca_system_score_codex":0.00063447823,"about_ca_system_score_gemma":0.00034418728,"threshold_uncertainty_score":0.0068125725},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004255734,0.0002526472,0.0009960328,0.0008003181,0.002211383,0.00010380702,0.0118094785,0.010523805,0.9728769],"genre_scores_gemma":[0.0022410322,0.00025204578,0.0005724217,0.0006718266,0.00049162906,0.000077745106,0.0076198867,0.0069433996,0.98113006],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99952817,0.000043210133,0.000015285632,0.0000788105,0.0002338472,0.000100667305],"domain_scores_gemma":[0.9978581,0.00018625699,0.000054507902,0.00028871387,0.00079625275,0.0008161715],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00055114744,0.0009967734,0.0006553056,0.0011583472,0.002086721,0.0051500592,0.0014701637,0.0015757467,0.9430299],"category_scores_gemma":[0.003608114,0.00040823067,0.0004843128,0.0010612994,0.0004378757,0.0037885446,0.004400589,0.0014629288,0.9028826],"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.000025877915,0.000011155946,0.000042931053,0.00003675209,7.339676e-7,0.000012401472,0.000018111237,0.0000126967025,0.000070350776,0.0004198584,0.9841039,0.015245195],"study_design_scores_gemma":[0.000009858143,0.000008905198,0.00020180074,0.00004848643,0.0000012171922,0.000021276517,0.000054368345,0.000056075573,0.00014239081,0.00028638018,0.9991635,0.0000059168183],"about_ca_topic_score_codex":0.0061287466,"about_ca_topic_score_gemma":0.014084244,"teacher_disagreement_score":0.05697012,"about_ca_system_score_codex":0.0009615976,"about_ca_system_score_gemma":0.0010259169,"threshold_uncertainty_score":0.08126086},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030480493,0.00017632716,0.99285215,0.00032579582,0.000021079368,0.000017016466,0.000034522436,0.00006778065,0.0034572075],"genre_scores_gemma":[0.42809507,0.0013563179,0.5561885,0.0007250935,0.0002495637,0.00037292362,0.000304775,0.00045462037,0.012253092],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988734,0.00047030774,0.000055736346,0.00015043304,0.000335054,0.00011500557],"domain_scores_gemma":[0.9978815,0.0011679762,0.0002223969,0.00025326107,0.00032940652,0.00014545335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020503923,0.00096841366,0.0010469696,0.0007447831,0.00052045775,0.0019524095,0.0011706427,0.0017858776,0.0057294453],"category_scores_gemma":[0.009261877,0.0005913675,0.0009441534,0.0008326243,0.0025052347,0.003416094,0.004011187,0.0033715728,0.0014366851],"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.000022973516,0.000028509703,0.0003715144,0.00012906968,0.000025873926,0.00007622667,0.00013786567,0.15730517,0.0019527338,0.81116277,0.0014135033,0.027373828],"study_design_scores_gemma":[0.000009771853,0.000055019515,0.000106144966,0.0000450305,0.0000064499427,0.000054577034,0.00003070251,0.6584096,0.0011729999,0.33452454,0.0055674496,0.000017660535],"about_ca_topic_score_codex":0.0009059772,"about_ca_topic_score_gemma":0.0008081236,"teacher_disagreement_score":0.0057294453,"about_ca_system_score_codex":0.00084676576,"about_ca_system_score_gemma":0.0012073296,"threshold_uncertainty_score":0.019166887},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0784288,0.0007559587,0.8790595,0.00093740755,0.00007900687,0.000046668323,0.00031233975,0.00044651338,0.039933722],"genre_scores_gemma":[0.8751256,0.0012240963,0.08974611,0.00034655677,0.00022858365,0.00016710178,0.00036244447,0.00045809496,0.0323414],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989058,0.0002574847,0.000059010512,0.0003498999,0.00030330257,0.00012451943],"domain_scores_gemma":[0.9979511,0.00077957223,0.00029014272,0.00050959626,0.00030276977,0.00016684442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015963976,0.0009623826,0.0008603504,0.0011032221,0.000675933,0.0026272507,0.0010754177,0.0010167917,0.0071910815],"category_scores_gemma":[0.0057630604,0.0004306899,0.0010519054,0.00095751515,0.0032492126,0.004450733,0.0024666404,0.0025819195,0.001236084],"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.00004654896,0.000015491043,0.00056385976,0.0000783941,0.000018849354,0.00014583257,0.00015441228,0.020429928,0.0042418917,0.951833,0.0013291788,0.021142596],"study_design_scores_gemma":[0.000012745846,0.000096411335,0.0010169368,0.00005234161,0.000023715807,0.00048279142,0.00016626262,0.16509204,0.00535141,0.80991626,0.017744243,0.00004483749],"about_ca_topic_score_codex":0.0005866231,"about_ca_topic_score_gemma":0.0003314467,"teacher_disagreement_score":0.0071910815,"about_ca_system_score_codex":0.0010203935,"about_ca_system_score_gemma":0.0005963467,"threshold_uncertainty_score":0.024056613},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012568969,0.012066698,0.004028838,0.021898074,0.042660046,0.0013743001,0.07986042,0.005385374,0.8201573],"genre_scores_gemma":[0.011611728,0.0010910477,0.0013314779,0.0007833978,0.00075344235,0.0001250585,0.007719507,0.0008071629,0.97577727],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.999292,0.00007446239,0.000019425956,0.00014703593,0.00025232646,0.00021469982],"domain_scores_gemma":[0.998611,0.00007764079,0.000031617226,0.000075604585,0.00068992056,0.00051416404],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00086631486,0.0017606977,0.001185067,0.0011199099,0.005722132,0.0040708045,0.0013121945,0.002039345,0.5603821],"category_scores_gemma":[0.002904203,0.000532052,0.00089903385,0.0015315257,0.0006466151,0.000968846,0.0018174475,0.0018641221,0.21671328],"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.00015995915,0.000028600325,0.00032519517,0.000039747058,0.000007586821,0.00006536343,0.000049594637,0.00017253417,0.00020232517,0.0004802508,0.98450863,0.013960125],"study_design_scores_gemma":[0.00004185751,0.000024160969,0.0034932296,0.000063425396,0.000005264967,0.000019787049,0.00023603586,0.00023842133,0.00013717315,0.00023451171,0.9954951,0.000011015798],"about_ca_topic_score_codex":0.75202096,"about_ca_topic_score_gemma":0.92524105,"teacher_disagreement_score":0.5603821,"about_ca_system_score_codex":0.010915566,"about_ca_system_score_gemma":0.0095396135,"threshold_uncertainty_score":0.6270615},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5024232,0.037344158,0.003543771,0.027070664,0.0016752519,0.000029629087,0.0011265136,0.00010582894,0.42668095],"genre_scores_gemma":[0.95075434,0.008893567,0.00069683057,0.0005893874,0.00018047116,0.000013788812,0.00029382278,0.000025545238,0.038552314],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.999741,0.000055564517,0.000015662381,0.00004595333,0.00006851337,0.00007326616],"domain_scores_gemma":[0.9998894,0.000022103339,0.000033149885,0.000007715643,0.00003127241,0.000016376222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003855079,0.00025512607,0.00021604459,0.0002770503,0.0010771024,0.0018600904,0.0001857011,0.0005076192,0.0056541683],"category_scores_gemma":[0.0005004618,0.00009919084,0.00028403522,0.00032912067,0.00096238713,0.0004850356,0.0010536717,0.00064840226,0.0005954607],"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.00056422275,0.00008126206,0.03871845,0.0010793936,0.00019582335,0.003235853,0.006645532,0.011555452,0.009194627,0.6800296,0.08566683,0.16303307],"study_design_scores_gemma":[0.00007166989,0.00018424849,0.21546154,0.0011655391,0.00020839043,0.0012833709,0.008036183,0.006386589,0.007478212,0.06472224,0.69489765,0.00010429539],"about_ca_topic_score_codex":0.013936184,"about_ca_topic_score_gemma":0.010609885,"teacher_disagreement_score":0.013936184,"about_ca_system_score_codex":0.0019460928,"about_ca_system_score_gemma":0.0023357947,"threshold_uncertainty_score":0.02771014},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.74658746,0.0055337767,0.036696292,0.007700292,0.009698521,0.0011932667,0.009090812,0.0031373815,0.18036225],"genre_scores_gemma":[0.75837326,0.0015379282,0.014178386,0.0010032144,0.00035395412,0.0003315171,0.00560631,0.0005687316,0.21804671],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9995228,0.000097325064,0.000027630926,0.00007411589,0.00020014001,0.000077999175],"domain_scores_gemma":[0.9992861,0.00015267123,0.00005290663,0.00014027147,0.00022324904,0.00014487827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068719295,0.0003679926,0.0005225624,0.00034547347,0.000472512,0.0009518965,0.000404645,0.0008143783,0.057835117],"category_scores_gemma":[0.0019517934,0.0002732044,0.00026877556,0.00032703573,0.00029695878,0.0005517598,0.0007210153,0.0011169672,0.016744642],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037037174,0.00046978553,0.0017598469,0.0009842794,0.000069060814,0.0004413688,0.00018532871,0.0018581336,0.8258605,0.014025085,0.05825735,0.092385575],"study_design_scores_gemma":[0.0003938756,0.0009056465,0.0017591764,0.0001066531,0.000063411055,0.00031380198,0.00020207958,0.005352013,0.7441215,0.002745013,0.24399109,0.000045693225],"about_ca_topic_score_codex":0.0002760068,"about_ca_topic_score_gemma":0.00043252285,"teacher_disagreement_score":0.057835117,"about_ca_system_score_codex":0.0003184112,"about_ca_system_score_gemma":0.0006895429,"threshold_uncertainty_score":0.19347775},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24500851,0.0021604432,0.13555357,0.0103839375,0.0008043341,0.00029649914,0.0045096627,0.00033538818,0.6009476],"genre_scores_gemma":[0.8075623,0.00086158037,0.022688398,0.0003930033,0.00021683036,0.00011913456,0.0021101162,0.00011779635,0.16593099],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992067,0.00014497581,0.00001971273,0.00013382021,0.0001564896,0.00033839492],"domain_scores_gemma":[0.9993901,0.00017589053,0.000030677737,0.000043581156,0.00015428803,0.00020536661],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066116225,0.0010417928,0.0012724289,0.000977633,0.0025767414,0.0030521862,0.0021790722,0.0029863932,0.022369385],"category_scores_gemma":[0.0023352483,0.000405208,0.0008478432,0.0013910513,0.0019494977,0.0015631403,0.0016665736,0.00269497,0.0010800014],"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.000501643,0.00017268665,0.001071129,0.00016435611,0.00006617651,0.0004980811,0.00020139021,0.13701609,0.00086325704,0.7692888,0.06182707,0.028329425],"study_design_scores_gemma":[0.00029130993,0.00016181878,0.0018635899,0.00009834181,0.00009147392,0.00038752283,0.0010936856,0.44009212,0.0009808962,0.45960033,0.09521581,0.00012306274],"about_ca_topic_score_codex":0.36512047,"about_ca_topic_score_gemma":0.25720006,"teacher_disagreement_score":0.36512047,"about_ca_system_score_codex":0.0061386884,"about_ca_system_score_gemma":0.008664912,"threshold_uncertainty_score":0.7259905},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.852891,0.022447646,0.0044276374,0.036754895,0.000540022,0.000139583,0.00032387002,0.00006615725,0.0824092],"genre_scores_gemma":[0.97297406,0.009154188,0.0016920946,0.001558089,0.00008425592,0.00015726988,0.00015681206,0.000039899096,0.014183295],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.98623776,0.006294764,0.0005856422,0.001249721,0.0041104285,0.0015216676],"domain_scores_gemma":[0.9650007,0.013996196,0.004137268,0.0011285809,0.011671642,0.004065554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01595225,0.0003724365,0.00051931303,0.001852823,0.004715056,0.00809112,0.001647525,0.0016739044,0.0058785044],"category_scores_gemma":[0.03970767,0.000491828,0.00050359784,0.002399899,0.0069099837,0.006239142,0.0055498066,0.0031010646,0.00087428687],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017019865,0.0002465256,0.18287912,0.0012071573,0.000102126774,0.0009067332,0.49882635,0.00026807917,0.0006606311,0.044424955,0.010751335,0.25955683],"study_design_scores_gemma":[0.000026425048,0.00024121131,0.34867838,0.004027543,0.0001225246,0.0008949575,0.4622812,0.0006839617,0.00063221744,0.006903801,0.17537986,0.00012802392],"about_ca_topic_score_codex":0.21943484,"about_ca_topic_score_gemma":0.27018803,"teacher_disagreement_score":0.78056514,"about_ca_system_score_codex":0.014560251,"about_ca_system_score_gemma":0.033376712,"threshold_uncertainty_score":0.43631524},"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":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035855088,0.030812498,0.0054559195,0.012640855,0.003743767,0.000028272158,0.00015277838,0.00016515737,0.9434153],"genre_scores_gemma":[0.03705533,0.0066830628,0.002551887,0.0016267768,0.0008291412,0.000035117973,0.00008799758,0.00030288097,0.95082784],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9996233,0.00010892039,0.000009982107,0.00008386548,0.00012083415,0.000053072872],"domain_scores_gemma":[0.9997391,0.00009868354,0.000013698088,0.000021843542,0.00007127329,0.00005532847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049188006,0.0008055991,0.00040566464,0.00084762636,0.004371191,0.0043788617,0.0006634684,0.001787946,0.03731336],"category_scores_gemma":[0.001564984,0.00045877032,0.00041438566,0.0007543708,0.0052388017,0.005154608,0.0016482453,0.0035165476,0.0079938155],"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.000030956588,0.000009576597,0.00017354105,0.0000821763,0.0000048761567,0.00022560553,0.0052093775,0.00010140425,0.00024979401,0.787472,0.18176655,0.024674168],"study_design_scores_gemma":[0.0000025640172,0.000007725322,0.00020365015,0.00010014892,0.0000021462636,0.00028663324,0.0014702594,0.00007397721,0.0000954642,0.025589788,0.9721628,0.0000048964375],"about_ca_topic_score_codex":0.015688393,"about_ca_topic_score_gemma":0.054259174,"teacher_disagreement_score":0.03731336,"about_ca_system_score_codex":0.0032513614,"about_ca_system_score_gemma":0.0019037684,"threshold_uncertainty_score":0.12482566},"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":"empirical","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46462283,0.035882477,0.007376077,0.41849533,0.008183973,0.000056140434,0.0010226722,0.000035763696,0.06432477],"genre_scores_gemma":[0.96910703,0.006032401,0.00070124445,0.009780901,0.0016997653,0.00002204003,0.0001324185,0.000026982258,0.0124972565],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983846,0.0006857343,0.000037698024,0.00016626646,0.00019612529,0.00052958634],"domain_scores_gemma":[0.99784636,0.00040305042,0.00028554074,0.000050728166,0.00019719011,0.0012170982],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019725694,0.00035757126,0.00076698425,0.0006717812,0.0020103096,0.0033827366,0.0006576772,0.0017237846,0.015177912],"category_scores_gemma":[0.00814574,0.00022191307,0.00036105048,0.001036293,0.0019205303,0.0023221504,0.0019306294,0.0030124292,0.00082209724],"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.0010724277,0.0009355612,0.3546748,0.00072707544,0.00045777299,0.001373427,0.016517393,0.003777002,0.00057591,0.15295848,0.19919628,0.2677338],"study_design_scores_gemma":[0.00028843433,0.00095051405,0.18315582,0.0020224908,0.0004286313,0.0016753228,0.14203148,0.007432725,0.0005920337,0.4435903,0.21765266,0.00017951208],"about_ca_topic_score_codex":0.021557923,"about_ca_topic_score_gemma":0.032879416,"teacher_disagreement_score":0.021557923,"about_ca_system_score_codex":0.0017322412,"about_ca_system_score_gemma":0.002352504,"threshold_uncertainty_score":0.05077517},"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":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009855989,0.000087880835,0.00069320126,0.000078541525,0.00014664941,0.000050089468,0.9894958,0.0007063515,0.0077558705],"genre_scores_gemma":[0.008601294,0.00022691244,0.003621028,0.0001685709,0.000072732255,0.00019002797,0.9715887,0.0010692603,0.014461469],"study_design_codex":"not_applicable","study_design_gemma":"observational","domain_scores_codex":[0.999383,0.000038725506,0.00007111206,0.00011577641,0.0003098104,0.00008156864],"domain_scores_gemma":[0.99491286,0.0018355988,0.00037131604,0.0004504158,0.0021153963,0.0003143084],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005530772,0.0013485015,0.00091660494,0.0021655178,0.0015236201,0.0013417081,0.0018745564,0.0005807564,0.71139985],"category_scores_gemma":[0.007442505,0.0006219397,0.0006035578,0.004820277,0.00027953376,0.00120056,0.0010787181,0.000687837,0.22629794],"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.0003528822,0.00006058021,0.0024565072,0.0013035616,0.00004650874,0.00007859544,0.000049620226,0.0006907283,0.002640717,0.000744395,0.97256833,0.01900752],"study_design_scores_gemma":[0.00034516407,0.00019462268,0.019194422,0.00038257788,0.000062834166,0.00018862722,0.00015293602,0.0015837182,0.008618033,0.003180439,0.96603405,0.000062535444],"about_ca_topic_score_codex":0.019309625,"about_ca_topic_score_gemma":0.06645374,"teacher_disagreement_score":0.71139985,"about_ca_system_score_codex":0.0014920897,"about_ca_system_score_gemma":0.0026182113,"threshold_uncertainty_score":0.41165304},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9990325,0.00034371848,0.00020739516,0.000046830042,0.0000040280393,0.0000038444437,0.000103576065,0.0000014873403,0.0002566974],"genre_scores_gemma":[0.99951375,0.00015174467,0.00013200752,0.000020649548,0.0000049122064,0.0000027410929,0.000080720136,6.837685e-7,0.00009281692],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9997043,0.00013517846,0.000023999211,0.00006145955,0.000040873903,0.000034209446],"domain_scores_gemma":[0.9990048,0.00034313236,0.00034083275,0.00011893946,0.000086237924,0.00010605767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009993208,0.00019979903,0.0002411776,0.00046870433,0.0002201315,0.00034771374,0.0001755165,0.0002824595,0.00092715264],"category_scores_gemma":[0.0028719,0.00016706294,0.00033811686,0.000743631,0.00014203935,0.00023432833,0.00027593868,0.0003709725,0.0001242115],"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.0000864148,0.000053135547,0.9977532,0.00000775938,0.00007861849,0.00002774986,0.000055555993,0.00004552312,0.00007009346,0.000030380597,0.000040267758,0.0017511987],"study_design_scores_gemma":[0.0000051137827,0.00011150111,0.99862266,0.000007974809,0.00006515734,0.00014807929,0.00014608122,0.00061015843,0.000035463123,0.0001267995,0.0001181997,0.0000028377299],"about_ca_topic_score_codex":0.0045182053,"about_ca_topic_score_gemma":0.004955617,"teacher_disagreement_score":0.0045182053,"about_ca_system_score_codex":0.00012653862,"about_ca_system_score_gemma":0.00018560125,"threshold_uncertainty_score":0.0089838505},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036209818,0.0857962,0.27215722,0.13834268,0.0077291704,0.00009437718,0.0009984986,0.0003561907,0.45831573],"genre_scores_gemma":[0.55512714,0.054607727,0.12111032,0.0142835155,0.006047586,0.0002904558,0.00046362678,0.0008408822,0.24722871],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994874,0.00010153479,0.000023652716,0.0001457051,0.00016215793,0.0000794128],"domain_scores_gemma":[0.99920386,0.00037810745,0.000047933492,0.000057881774,0.00026244717,0.00004989093],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013891602,0.00067670643,0.00086735556,0.0020713038,0.0031231286,0.0029905376,0.0012401609,0.0016459227,0.007567831],"category_scores_gemma":[0.0038783338,0.0005505649,0.0010201937,0.0021699683,0.0035935293,0.007950648,0.002128428,0.0034368853,0.0011282422],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001607339,0.000004596653,0.00018463303,0.000042350894,0.000007683489,0.00006104988,0.00027929287,0.0013829119,0.00014136729,0.97210294,0.014458316,0.01131875],"study_design_scores_gemma":[0.000013895859,0.000011876955,0.0009419058,0.00009614569,0.000024393506,0.00009449617,0.00021353854,0.010115091,0.00070635724,0.8663671,0.12137678,0.000038463357],"about_ca_topic_score_codex":0.07294832,"about_ca_topic_score_gemma":0.064828455,"teacher_disagreement_score":0.92705166,"about_ca_system_score_codex":0.0060046655,"about_ca_system_score_gemma":0.0033135014,"threshold_uncertainty_score":0.14504749},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9169794,0.0011094195,0.036192555,0.0022194644,0.000071110284,0.00025469554,0.014615319,0.0002687662,0.028289227],"genre_scores_gemma":[0.98284584,0.00023815769,0.003821488,0.000069983515,0.00006158685,0.00008153673,0.007826556,0.00003744669,0.0050172736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99846715,0.0005397903,0.0000683162,0.00021755509,0.000557144,0.00014996684],"domain_scores_gemma":[0.98289263,0.0124069275,0.0017261006,0.0011202915,0.0014376629,0.00041640457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003506875,0.0004311919,0.00049692945,0.0017398322,0.00049932627,0.0025847931,0.0012051016,0.0011606273,0.008301728],"category_scores_gemma":[0.018184958,0.0001800838,0.0006344809,0.002153077,0.0008490406,0.002014158,0.00068670424,0.0024400859,0.0009478385],"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.00157248,0.001212575,0.31270245,0.00047342503,0.00043266342,0.0015922332,0.00089841883,0.33709994,0.002530852,0.20781194,0.054308563,0.07936453],"study_design_scores_gemma":[0.00013263553,0.00053559913,0.16270478,0.00011029364,0.00012673478,0.0005013077,0.0022632934,0.7052953,0.0041920114,0.099305004,0.024689984,0.0001429278],"about_ca_topic_score_codex":0.012527342,"about_ca_topic_score_gemma":0.008039193,"teacher_disagreement_score":0.012527342,"about_ca_system_score_codex":0.0018949567,"about_ca_system_score_gemma":0.0010426586,"threshold_uncertainty_score":0.027772069},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005273821,0.000111639056,0.9939068,0.000029509723,0.000017341852,0.000015015981,0.000006366521,0.00004545071,0.0005940193],"genre_scores_gemma":[0.26475415,0.00030060118,0.7316497,0.00008354186,0.000053071555,0.00019606977,0.000094711475,0.00008432919,0.0027838938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899405,0.00033737367,0.00008122437,0.00017141526,0.0003496448,0.000066291934],"domain_scores_gemma":[0.9988337,0.00049872336,0.00014045165,0.00015948883,0.00029187533,0.000075785545],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021627983,0.0009952068,0.0011170028,0.00088385737,0.00048229337,0.00087878946,0.0017064186,0.0012425777,0.0011597676],"category_scores_gemma":[0.0043413783,0.00040837761,0.0011126926,0.0007370829,0.0011996626,0.0015405128,0.0020159436,0.001458418,0.00025999598],"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.00014450036,0.00006736323,0.0011948938,0.00025053203,0.0001833653,0.00017510058,0.0002507283,0.6267602,0.014693578,0.22479655,0.0010404765,0.13044272],"study_design_scores_gemma":[0.0000068822046,0.000052452437,0.00007892176,0.000009939224,0.000008362932,0.000044679335,0.000010775897,0.9805315,0.0025510734,0.015492415,0.0012035342,0.0000094693505],"about_ca_topic_score_codex":0.0014712464,"about_ca_topic_score_gemma":0.0015564524,"teacher_disagreement_score":0.0021627983,"about_ca_system_score_codex":0.001030893,"about_ca_system_score_gemma":0.0010797976,"threshold_uncertainty_score":0.011438131},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14478017,0.009965389,0.7149903,0.0121676475,0.0005459338,0.00009630011,0.00013359444,0.00037942015,0.11694125],"genre_scores_gemma":[0.93468404,0.0021536704,0.04848096,0.0011155609,0.00037618974,0.00014910132,0.000048083813,0.000259026,0.012733351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983878,0.00076456455,0.00006520119,0.0002566485,0.00040057677,0.00012518621],"domain_scores_gemma":[0.9944431,0.0035165534,0.00048480742,0.00061326503,0.00054425927,0.00039801738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005616699,0.001027612,0.0014874976,0.0016842585,0.0014794616,0.0027923232,0.0024058863,0.003261403,0.004382705],"category_scores_gemma":[0.020706581,0.0006560536,0.0010723292,0.0009874683,0.005656032,0.0067581832,0.003491669,0.0047293496,0.00068427244],"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.000032399013,0.000010536572,0.00026282936,0.00005071735,0.00001437474,0.0001439155,0.00014081357,0.01046251,0.00077901705,0.9826868,0.0008166645,0.004599343],"study_design_scores_gemma":[0.000024665518,0.00003384033,0.00021503954,0.00006340447,0.0000131739125,0.0001850634,0.00007365786,0.14643519,0.0010684408,0.8479919,0.0038572752,0.000038345643],"about_ca_topic_score_codex":0.001666745,"about_ca_topic_score_gemma":0.0011740067,"teacher_disagreement_score":0.005616699,"about_ca_system_score_codex":0.0020102446,"about_ca_system_score_gemma":0.00095015403,"threshold_uncertainty_score":0.029704273},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.092637695,0.0014726908,0.8835658,0.0054839454,0.00019125028,0.00019535612,0.0010923151,0.00021025396,0.015150851],"genre_scores_gemma":[0.7734394,0.0017445113,0.21301499,0.000903272,0.0004907135,0.00066390785,0.0016857956,0.00026885435,0.007788508],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9961366,0.0019230307,0.00017455417,0.0005822599,0.00072370766,0.00045981922],"domain_scores_gemma":[0.9531046,0.04192381,0.0011579916,0.0019330658,0.0011624269,0.00071806257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006412094,0.0013728896,0.0023498712,0.0010640393,0.0014019809,0.005049854,0.0035828413,0.001754682,0.008252879],"category_scores_gemma":[0.0230563,0.000938805,0.0022480846,0.0017837844,0.0039517777,0.009315587,0.0041896245,0.0068270643,0.0004905204],"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.00027129689,0.00015193954,0.0010722011,0.00035145745,0.000115313924,0.00015703855,0.000265699,0.25142795,0.0010210671,0.727754,0.0032958975,0.0141161755],"study_design_scores_gemma":[0.000037461377,0.00002362912,0.00016482899,0.000024871908,0.0000133767835,0.00002157546,0.00003844584,0.5690735,0.00028015807,0.4296284,0.0006805596,0.000013147161],"about_ca_topic_score_codex":0.004992992,"about_ca_topic_score_gemma":0.0048535746,"teacher_disagreement_score":0.008252879,"about_ca_system_score_codex":0.0033248353,"about_ca_system_score_gemma":0.003256544,"threshold_uncertainty_score":0.03391075},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06192539,0.0020494787,0.8734592,0.001827353,0.00017370626,0.000090459536,0.00013005543,0.00016896988,0.06017535],"genre_scores_gemma":[0.9116721,0.0015841381,0.0679748,0.00026345532,0.00027405706,0.00022902606,0.00015313229,0.00012602987,0.017723178],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993556,0.00024732068,0.000028346301,0.000078817786,0.00023151304,0.000058373993],"domain_scores_gemma":[0.99866617,0.00080819766,0.00011922935,0.00009786759,0.00021863123,0.00008989558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097453437,0.0006973153,0.00053318974,0.0009524898,0.0008353569,0.0020417063,0.00058644754,0.00078587106,0.0030339614],"category_scores_gemma":[0.0033064506,0.0002436144,0.0007823443,0.0004124396,0.0030079717,0.0021356428,0.0018539354,0.0021113327,0.00048543845],"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.000004256525,0.0000059788613,0.000063030144,0.00002536821,0.00000488899,0.000025966754,0.00009240009,0.010006351,0.00050018803,0.98575956,0.00038874522,0.0031232806],"study_design_scores_gemma":[0.000003623704,0.000013942535,0.000080112404,0.0000102044,0.0000026066139,0.000026265454,0.00004886439,0.086763516,0.0004066518,0.9104353,0.0022021134,0.0000067937203],"about_ca_topic_score_codex":0.0011255292,"about_ca_topic_score_gemma":0.0008032848,"teacher_disagreement_score":0.0030339614,"about_ca_system_score_codex":0.0014080047,"about_ca_system_score_gemma":0.000698443,"threshold_uncertainty_score":0.0102158785},"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":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009961271,0.00017293559,0.98579454,0.00020285217,0.00016172476,0.00008549819,0.000050355018,0.000370012,0.0032008365],"genre_scores_gemma":[0.15083547,0.00021313893,0.8401331,0.00020013902,0.00010054825,0.00040934325,0.00015743422,0.0005599727,0.0073908786],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937755,0.00018656784,0.00004004532,0.00006371328,0.00027798922,0.000054211294],"domain_scores_gemma":[0.9979678,0.0009820154,0.00007818897,0.00021845938,0.00052352686,0.00022993512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021420002,0.001168964,0.0011278812,0.00077690464,0.00082275824,0.00096426136,0.002071299,0.0018380336,0.0063242847],"category_scores_gemma":[0.003922004,0.00060022477,0.0010973592,0.00056798954,0.0015415496,0.0017535758,0.0033097488,0.002911381,0.0014587576],"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.0013182984,0.0005574366,0.0012315374,0.0007570047,0.00020088551,0.00047432358,0.00076732226,0.29912895,0.077209584,0.25388888,0.011773092,0.35269272],"study_design_scores_gemma":[0.000046410765,0.000054640255,0.00006573297,0.00001596192,0.000008479519,0.000043368556,0.00001804916,0.980845,0.002132011,0.015094647,0.0016578945,0.000017838576],"about_ca_topic_score_codex":0.003732192,"about_ca_topic_score_gemma":0.0043342276,"teacher_disagreement_score":0.0063242847,"about_ca_system_score_codex":0.0009586278,"about_ca_system_score_gemma":0.0019121887,"threshold_uncertainty_score":0.021156847},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.044547126,0.00078124873,0.9283866,0.0021235056,0.00013298306,0.00012009379,0.00029652432,0.00013432126,0.023477653],"genre_scores_gemma":[0.87425476,0.00083495583,0.0901501,0.0004314162,0.00020335909,0.0005860971,0.0005438944,0.00019713132,0.032798324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995159,0.00015499814,0.000022283713,0.00008735649,0.0001584547,0.00006105572],"domain_scores_gemma":[0.9991447,0.00033698784,0.00011570201,0.000032324755,0.00029111042,0.000079193655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012869138,0.0009068923,0.0009919268,0.00089137634,0.00069883745,0.0014186058,0.00076812785,0.0018152283,0.0055260956],"category_scores_gemma":[0.002907075,0.00039277686,0.00058290054,0.0004674334,0.0016318945,0.0015243602,0.0018306202,0.0015064046,0.00046980628],"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.000070455186,0.000029673503,0.0008085654,0.00017797737,0.000043719134,0.0002488751,0.0002595384,0.48125055,0.0059771654,0.49864495,0.0026968082,0.009791683],"study_design_scores_gemma":[0.000021495312,0.000053571704,0.00039805777,0.000024178275,0.000009698635,0.000076504526,0.000035767745,0.9298548,0.00047008123,0.06727398,0.0017576764,0.000024180672],"about_ca_topic_score_codex":0.0060585584,"about_ca_topic_score_gemma":0.0028211651,"teacher_disagreement_score":0.0060585584,"about_ca_system_score_codex":0.0012838147,"about_ca_system_score_gemma":0.001785863,"threshold_uncertainty_score":0.018486619},"labels":[],"label_agreement":null}]}