{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":186,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":186,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"fdf67e044dd4","filters":{"venue":"Journal of Applied and Numerical Optimization"}},"results":[{"id":"W4241359251","doi":"10.23952/jano.1.2019.2.02","title":"Differentiating through a cone program","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":46,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"National Science Foundation","keywords":"Cone (formal languages); Computer science; Geometry; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.0252567016098609,"gpt":0.333545698837122,"spread":0.3082889972272611,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001781144,0.0001125926,0.0003065669,0.00007150347,0.00005737983,0.00005595369,0.0000949077,0.00006705235,0.0002322125],"category_scores_gemma":[0.0001256945,0.00008801289,0.00005031606,0.0002270543,0.00003431065,0.0002221543,0.00004579185,0.0002222918,0.000005324549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003450119,"about_ca_system_score_gemma":0.0000291151,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.587459e-7,"about_ca_topic_score_gemma":1.89762e-8,"domain_scores_codex":[0.9988799,0.00002829082,0.0004445918,0.0001282412,0.0003489885,0.0001700017],"domain_scores_gemma":[0.9989828,0.0002116628,0.0004158748,0.0001005277,0.0002056979,0.00008346896],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007685538,0.001344263,0.0005553987,0.0003184784,0.0002593776,0.00001241789,0.00192203,0.8328789,0.001701423,0.06605322,0.0005709132,0.09361501],"study_design_scores_gemma":[0.00282877,0.0005899045,0.000113757,0.00007428369,0.00005837526,0.00004790154,0.0004489199,0.9607886,0.0008404452,0.03275673,0.001173018,0.000279275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007558906,0.00004099505,0.9873456,0.0001463158,0.00007679885,0.0003760274,9.306584e-7,0.00003800158,0.00441644],"genre_scores_gemma":[0.1795885,0.0001016402,0.8200414,0.00006111332,0.00007437124,0.000007996616,0.000003568434,0.00002446732,0.00009699474],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1720296,"threshold_uncertainty_score":0.3589062,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285242719","doi":"10.23952/jano.4.2022.2.09","title":"A constrained LiGME model and its proximal splitting algorithm under overall convexity condition","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Convexity; Algorithm; Mathematics; Computer science; Combinatorics; Applied mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.01102938075775526,"gpt":0.2177526935053623,"spread":0.206723312747607,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001142149,0.00009015406,0.0001721914,0.00006643334,0.0001022687,0.00003061941,0.00003834365,0.00003658212,0.00002099885],"category_scores_gemma":[0.000003933835,0.00008851583,0.0000248989,0.00006356894,0.00002258866,0.00009837513,0.00003379841,0.0002048207,1.171155e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003553602,"about_ca_system_score_gemma":0.00001708387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.687797e-7,"about_ca_topic_score_gemma":8.96875e-9,"domain_scores_codex":[0.99943,0.00001392797,0.0002265938,0.00008303162,0.0001477203,0.0000987127],"domain_scores_gemma":[0.999718,0.00002681172,0.0001129797,0.00003507115,0.00004740547,0.00005980062],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003421446,0.00002056157,0.000002310092,0.000007183514,0.00002431913,0.00000403903,0.00009898976,0.9893234,0.004769038,0.002173344,0.0000910144,0.003451559],"study_design_scores_gemma":[0.0004390916,0.00007766283,0.00002725031,0.0000105303,0.00002371575,0.00008328107,0.00006984353,0.993365,0.001625092,0.004122734,0.00005643522,0.00009934507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0607987,0.0001659932,0.9379089,0.00009160431,0.00004458108,0.0001174931,0.00000732565,0.00007601424,0.0007893677],"genre_scores_gemma":[0.9073024,0.00008314996,0.09239803,0.0001434796,0.00004378374,0.000004689736,0.000006562793,0.00001360458,0.000004309894],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8465037,"threshold_uncertainty_score":0.3609571,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2984521971","doi":"10.23952/jano.2.2020.1.03","title":"Superiorization vs. accelerated convex optimization: The superiorized / regularized least-squares case","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Israel Science Foundation; National Natural Science Foundation of China","keywords":"Least-squares function approximation; Convex optimization; Mathematics; Least trimmed squares; Regular polygon; Conic optimization; Mathematical optimization; Computer science; Non-linear least squares; Convex analysis; Algorithm; Statistics; Estimation theory; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01675820020479771,"gpt":0.2106089504209564,"spread":0.1938507502161587,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001030425,0.0001779803,0.0003408274,0.00006318311,0.0001450933,0.000148672,0.0001176767,0.0001051381,0.000089054],"category_scores_gemma":[0.00004207869,0.0001318114,0.00006122808,0.0003587226,0.00005847288,0.0002392302,0.00002924306,0.0002353911,0.000001180477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002471398,"about_ca_system_score_gemma":0.00002615404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002149974,"about_ca_topic_score_gemma":6.473766e-8,"domain_scores_codex":[0.9990255,0.00004174839,0.0004591975,0.0001322515,0.000195353,0.0001460112],"domain_scores_gemma":[0.9993675,0.00005913042,0.0001453555,0.0001051194,0.0001900611,0.0001328858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000242238,0.00001350478,0.00001236718,0.0000117285,0.00004936096,0.00006389403,0.0004859456,0.9923339,0.004707645,0.0001819912,0.0004566556,0.001440807],"study_design_scores_gemma":[0.0008268545,0.0001293662,0.00001337905,0.00001755125,0.00006824468,0.0003528845,0.0002086597,0.99237,0.004981431,0.00004597878,0.0008246253,0.0001610257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01607328,0.0001781651,0.981656,0.001164085,0.0001334975,0.0002161807,0.000002569741,0.0001851824,0.0003910632],"genre_scores_gemma":[0.9302442,0.0003480768,0.06867431,0.0004412802,0.0002348598,0.000004881162,0.0000123938,0.00003721601,0.000002759059],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9141709,"threshold_uncertainty_score":0.5375113,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.03557950230596722,"gpt":0.2832461937927081,"spread":0.2476666914867409,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004747194,0.0001180975,0.0002304778,0.00007382691,0.0001782687,0.0001600917,0.000278832,0.00003860086,0.00004571428],"category_scores_gemma":[0.0001019013,0.00007050509,0.00006985434,0.0005305156,0.0000709669,0.0002553785,0.00005462255,0.0001461138,0.000001106158],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002514483,"about_ca_system_score_gemma":0.0001503361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003793597,"about_ca_topic_score_gemma":1.451608e-7,"domain_scores_codex":[0.9987163,0.00004258875,0.0004635823,0.0002046797,0.0004334806,0.0001393581],"domain_scores_gemma":[0.9985272,0.0003583237,0.0003633052,0.00009596754,0.0004856536,0.0001695642],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002197911,0.0000813742,0.00006780365,0.000007205894,0.0001007664,0.000001249138,0.0003718472,0.9067487,0.00008170942,0.0800733,0.00005896128,0.01218726],"study_design_scores_gemma":[0.001462449,0.0001858528,0.0006126544,0.00000432081,0.00004905256,0.00001473869,0.0000396101,0.9964088,0.00005817085,0.0008609685,0.000202538,0.0001008075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001777365,0.00002484443,0.988407,0.01097799,0.00005544221,0.0002180795,0.000008209723,0.00001519205,0.0001155294],"genre_scores_gemma":[0.3781205,0.00003126506,0.6205775,0.0009915848,0.0002451147,0.00001253748,0.00001061767,0.000006383982,0.00000447886],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3779427,"threshold_uncertainty_score":0.2875114,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4253828966","doi":"10.23952/jano.1.2019.1.01","title":"Approximation of common solutions of a split inclusion problem and a fixed-point problem","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Nonlinear Differential Equations Analysis","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Shanghai Municipal Education Commission; Ministry of Education of the People's Republic of China","keywords":"Fixed point; Mathematics; Point (geometry); Inclusion (mineral); Mathematical optimization; Mathematical analysis; Physics; Geometry; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.01459546102716764,"gpt":0.2570349487863004,"spread":0.2424394877591328,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004666704,0.00009957666,0.0004412855,0.0001911673,0.0000770011,0.00001518534,0.00007147418,0.00007280884,0.00004674156],"category_scores_gemma":[0.00004112701,0.00007907526,0.0000702574,0.0002657509,0.00004611006,0.0001639008,0.0001502819,0.0001145883,4.450002e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002750985,"about_ca_system_score_gemma":0.00003353221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007392159,"about_ca_topic_score_gemma":0.000001036691,"domain_scores_codex":[0.9987037,0.00004278171,0.000773238,0.0001030903,0.000283573,0.00009359673],"domain_scores_gemma":[0.9984422,0.0001473518,0.00101334,0.0001094101,0.0002330032,0.00005464388],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001212149,0.003874818,0.001594311,0.002954327,0.0008285236,0.000001641019,0.01069107,0.3976912,0.0699674,0.4631397,0.0001654622,0.04787938],"study_design_scores_gemma":[0.001538936,0.0004478405,0.0002602701,0.0002480504,0.0003912626,0.00001306931,0.0003711719,0.8131564,0.002273282,0.1811059,0.00002291661,0.0001709351],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1877359,0.0000544994,0.810472,0.0002087608,0.00001647439,0.0003803257,0.000006027476,0.000008246357,0.001117821],"genre_scores_gemma":[0.6598884,0.00004663799,0.3400143,0.000007200378,0.00001478477,0.000002701011,0.000007650293,0.000008863142,0.000009516982],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4721525,"threshold_uncertainty_score":0.3224595,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4244929336","doi":"10.23952/jano.2.2020.3.06","title":"The S-iterative techniques on Hadamard manifolds and applications","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Hadamard transform; Mathematics; Computer science; Algorithm; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.005057722705793437,"gpt":0.1889528743982024,"spread":0.1838951516924089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008887663,0.00006768485,0.0001084594,0.00002238352,0.00009299067,0.00005353001,0.00004881837,0.00003418367,0.000003137629],"category_scores_gemma":[0.000004706539,0.00004430663,0.00002010726,0.00009226392,0.00002622116,0.0000503043,0.000007694157,0.0001098111,8.600363e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007090333,"about_ca_system_score_gemma":0.000003093521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.34492e-8,"about_ca_topic_score_gemma":1.680732e-8,"domain_scores_codex":[0.9996175,0.00001244458,0.0001818012,0.00005413531,0.00007551373,0.00005857158],"domain_scores_gemma":[0.9997441,0.00005960892,0.00006496874,0.00003753818,0.00002600114,0.0000677881],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005812612,0.00006516324,0.00008581838,0.0001163051,0.0002220787,0.000006443661,0.00212286,0.5730109,0.006661572,0.2083296,0.002579838,0.2062181],"study_design_scores_gemma":[0.001802882,0.00158116,0.0006233214,0.0001396163,0.000187704,0.0001256417,0.001595683,0.7270513,0.02274778,0.02009206,0.2231753,0.0008775734],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002138202,0.0004212778,0.9859878,0.000845918,0.00004753246,0.0002553547,0.000002819357,0.00006912218,0.01023194],"genre_scores_gemma":[0.9948866,0.0004153953,0.004308506,0.0002004707,0.0001580653,0.00001446615,0.000001220602,0.00001069375,0.000004608204],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9927484,"threshold_uncertainty_score":0.1806772,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Subgradient method; Hilbert space; Fixed point; Mathematics; Applied mathematics; Mathematical economics; Mathematical optimization; Pure mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.009534542447006081,"gpt":0.2269635311735376,"spread":0.2174289887265315,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009209021,0.0001247932,0.0002659498,0.0001486219,0.0001075898,0.0002724642,0.0002007573,0.00005208435,0.000005687141],"category_scores_gemma":[0.00004980001,0.00008201678,0.00006685703,0.0003658645,0.0000227409,0.000343183,0.00007499271,0.000112574,5.437794e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004141791,"about_ca_system_score_gemma":0.00003632678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000787503,"about_ca_topic_score_gemma":0.00000249656,"domain_scores_codex":[0.9987897,0.0000474597,0.0005122754,0.000226304,0.0002304057,0.000193881],"domain_scores_gemma":[0.9988276,0.0003666936,0.000429703,0.0001188047,0.0001581904,0.00009901229],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004054231,0.00006301217,0.0003301791,0.00002504204,0.00003500496,2.710863e-7,0.0008610509,0.9660236,0.0004992164,0.02673451,0.00005386594,0.00533371],"study_design_scores_gemma":[0.0008102619,0.0001568336,0.0006637466,0.00002452061,0.00001995491,0.00001176211,0.00007036648,0.9927315,0.0001024274,0.004156788,0.001139175,0.0001126681],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002846736,0.000268988,0.9926208,0.003544341,0.0001404442,0.0003675966,7.184404e-7,0.00001117981,0.0001991995],"genre_scores_gemma":[0.4159025,0.0002947068,0.5834243,0.0002187204,0.00004982729,0.00002430454,0.000004715632,0.00001239807,0.00006857218],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4130558,"threshold_uncertainty_score":0.3344547,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4241864462","doi":"10.23952/jano.3.2021.1.13","title":"Convergence of relaxed inertial methods for equilibrium problems","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Aerospace Engineering and Control Systems","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"National Foundation for Science and Technology Development","keywords":"Convergence (economics); Inertial frame of reference; Applied mathematics; Mathematical economics; Mathematics; Computer science; Economics; Physics; Classical mechanics; Macroeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.007613119653564279,"gpt":0.2363308686665417,"spread":0.2287177490129774,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001911376,0.00007754919,0.0002680244,0.00003290547,0.00001250167,0.00001248331,0.00004334205,0.00005934959,0.000008376986],"category_scores_gemma":[0.00004398451,0.00006853764,0.00005591184,0.0001218261,0.00001181855,0.00006083796,0.000008846661,0.00008077453,1.626781e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001497719,"about_ca_system_score_gemma":0.00001862015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.438505e-7,"about_ca_topic_score_gemma":2.402165e-8,"domain_scores_codex":[0.9994044,0.00001346686,0.0003493857,0.00006210821,0.00007619739,0.0000944738],"domain_scores_gemma":[0.9995764,0.00008174546,0.0001129985,0.00005569242,0.0001139971,0.00005920487],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003092665,0.00001127095,0.00001063621,0.00008969611,0.00003825489,4.098121e-7,0.00009298886,0.8885948,0.1074403,0.0002957875,0.00005792247,0.003336984],"study_design_scores_gemma":[0.0006411683,0.00006974298,0.0000335394,0.00003277436,0.00003574471,0.00001399874,0.00003986372,0.9776763,0.01997381,0.0001279656,0.001272124,0.0000829795],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004166655,0.0008962101,0.9941909,0.00004560999,0.00031329,0.00008026324,0.000001394931,0.00002145672,0.0002842156],"genre_scores_gemma":[0.7452894,0.0001098985,0.2544473,0.00000847664,0.0001050752,0.000006518652,0.000002454662,0.00001658616,0.00001422429],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7411228,"threshold_uncertainty_score":0.2794884,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3164353206","doi":"10.23952/jano.3.2021.2.09","title":"A dynamic supply chain network for PPE during the Covid-19 pandemic","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Università di Catania","keywords":"Variational inequality; Minification; Coronavirus disease 2019 (COVID-19); Mathematical optimization; Supply chain; Computer science; Function (biology); Optimization problem; Pandemic; Mathematics; Disease; Infectious disease (medical specialty); Medicine; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.017021543195456,"gpt":0.241553835484995,"spread":0.224532292289539,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004414987,0.00009625835,0.0001643391,0.00006176556,0.0002728401,0.000118647,0.000101886,0.00003792802,0.0001740253],"category_scores_gemma":[0.0001191226,0.0000708552,0.0000692344,0.0003221477,0.00002681121,0.0001977838,0.0000594941,0.00009445995,0.000003373282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004844278,"about_ca_system_score_gemma":0.00003283529,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001375473,"about_ca_topic_score_gemma":0.00001364117,"domain_scores_codex":[0.9991868,0.000009647409,0.0003497648,0.0001315775,0.0001640433,0.0001582309],"domain_scores_gemma":[0.9995174,0.00004381239,0.0001840726,0.00009229017,0.000133697,0.00002867103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001793153,0.00004013017,0.001377948,0.0001324983,0.00003698277,0.000002034082,0.00005399733,0.9893184,0.00007248959,0.00499714,0.001899026,0.001890033],"study_design_scores_gemma":[0.001481648,0.00001771166,0.004055145,0.00001705228,0.0001115814,0.00001692942,0.0004668682,0.8853611,0.000004284868,0.003698474,0.1045794,0.0001898133],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03191058,0.0003149665,0.954708,0.01110038,0.00046725,0.0003923218,0.000003469233,0.00004388226,0.001059191],"genre_scores_gemma":[0.9817339,0.0004179663,0.01002766,0.006908035,0.0005902319,0.00002450338,0.00004569185,0.00001767234,0.0002343946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9498233,"threshold_uncertainty_score":0.2889391,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Minification; Mathematical optimization; Computer science; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01006641568373094,"gpt":0.2444833559736338,"spread":0.2344169402899029,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001515719,0.0001140695,0.0002316192,0.00006969059,0.000143543,0.0001533585,0.0001250135,0.00005803694,0.00006098221],"category_scores_gemma":[0.00007238836,0.0000907359,0.0000649557,0.0005202662,0.00005079203,0.0002856626,0.00002461573,0.0000691224,0.000001105153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004823829,"about_ca_system_score_gemma":0.0001708009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.712287e-7,"about_ca_topic_score_gemma":2.160812e-7,"domain_scores_codex":[0.9989853,0.00003379003,0.0003764239,0.0002114294,0.00027149,0.0001215577],"domain_scores_gemma":[0.9986192,0.0001359224,0.0003701658,0.0001142009,0.0006406012,0.0001198863],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005342984,0.0001316802,0.00004438812,0.000008466813,0.00005469237,0.00000214179,0.00004499059,0.7782207,0.00002272367,0.220046,0.0001764049,0.001194425],"study_design_scores_gemma":[0.001482178,0.0002400356,0.0004217229,0.00002533787,0.00006956606,0.00006548813,0.00003930201,0.9862097,0.0001354887,0.01092486,0.0002374082,0.000148931],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003253504,0.00001902597,0.9957079,0.001658921,0.00006588387,0.0001301771,0.00001674677,0.00002016144,0.002055817],"genre_scores_gemma":[0.389258,0.00003399576,0.6098547,0.000715511,0.00004545538,0.00001000509,0.00005468124,0.000006074315,0.00002154163],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3889327,"threshold_uncertainty_score":0.3700103,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Inertial frame of reference; Hilbert space; Fixed point; Mathematics; Algorithm; Computer science; Pure mathematics; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.009497754820999958,"gpt":0.2301454462221357,"spread":0.2206476914011357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001629788,0.00009456103,0.0002863742,0.0001488864,0.00003852838,0.0000628751,0.0002062379,0.00005431957,0.00001500765],"category_scores_gemma":[0.00003395172,0.00008113289,0.00006127496,0.0004771688,0.00001955787,0.0004074909,0.00003416694,0.00007917135,4.809841e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001669621,"about_ca_system_score_gemma":0.00004758693,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004568643,"about_ca_topic_score_gemma":1.820897e-7,"domain_scores_codex":[0.9990215,0.00002703712,0.0004642633,0.0001680538,0.0002187592,0.0001004231],"domain_scores_gemma":[0.9990772,0.00006642154,0.0004137109,0.00006867232,0.0002483132,0.0001256965],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001241429,0.0001468864,0.00009701217,0.00001520644,0.00004558335,0.000001953314,0.00140905,0.977349,0.0007525614,0.004417775,0.0001561511,0.01548467],"study_design_scores_gemma":[0.000975449,0.0002342486,0.0002734314,0.000008280802,0.00002057974,0.000002580538,0.00009272458,0.9973315,0.0003794628,0.000358327,0.0002324093,0.00009101435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008406707,0.00001840646,0.9949906,0.003897338,0.00005232449,0.0001078723,0.00000307341,0.000009127189,0.00008062203],"genre_scores_gemma":[0.224277,0.00004245024,0.7743004,0.001261851,0.00009132254,0.000003673281,0.00001206945,0.000006861875,0.000004352406],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2234364,"threshold_uncertainty_score":0.3308503,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.007635573047310998,"gpt":0.2402863197540349,"spread":0.2326507467067239,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003610198,0.000142322,0.0003054812,0.0001915963,0.000164173,0.0001972161,0.0001400082,0.00008072583,0.00002957684],"category_scores_gemma":[0.00006110156,0.0001210031,0.00008882291,0.0003988309,0.00003840652,0.0005234993,0.00006128372,0.0001319088,0.000003134442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003570629,"about_ca_system_score_gemma":0.0000640975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002904894,"about_ca_topic_score_gemma":1.804623e-7,"domain_scores_codex":[0.9988602,0.0000345365,0.0004537078,0.0002497613,0.0002380403,0.0001637876],"domain_scores_gemma":[0.9986137,0.0002944595,0.0004629249,0.0001209579,0.0003701383,0.0001378924],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001263621,0.0001562316,0.0008648433,0.00003361297,0.0001419525,8.526916e-7,0.0006183857,0.9292493,0.0003326527,0.05919491,0.0000878864,0.00919303],"study_design_scores_gemma":[0.001035874,0.0001865593,0.001589786,0.00001897598,0.00006779144,0.000019346,0.00008090743,0.9933599,0.0001088047,0.001907312,0.001446161,0.0001785965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002461214,0.00005393885,0.99546,0.0006398167,0.0000900326,0.0003004795,0.00000992432,0.00002826097,0.0009563867],"genre_scores_gemma":[0.4216431,0.00009208648,0.577723,0.0003943446,0.00005606166,0.00001536827,0.00002388269,0.00001017023,0.00004195743],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4191819,"threshold_uncertainty_score":0.4934364,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4244231150","doi":"10.23952/jano.1.2019.2.04","title":"Computing minimal elements of finite families of sets w.r.t. preorder relations in set optimization","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","keywords":"Preorder; Set (abstract data type); Mathematics; Computer science; Combinatorics; Discrete mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.006736461028911781,"gpt":0.2216589757036264,"spread":0.2149225146747147,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002279615,0.0001130864,0.0003156892,0.0002737532,0.00002073449,0.00001327468,0.00007333442,0.00008841213,0.00007546145],"category_scores_gemma":[0.00004523567,0.0001098644,0.00004253696,0.0004086037,0.00002523798,0.0001503447,0.00001922248,0.0001453317,0.00000107617],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000273838,"about_ca_system_score_gemma":0.00002607833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001643791,"about_ca_topic_score_gemma":1.013267e-7,"domain_scores_codex":[0.9987751,0.00002185389,0.0007920257,0.0000934406,0.000203106,0.0001144664],"domain_scores_gemma":[0.9992271,0.0001309937,0.0003740392,0.00007519151,0.0001456645,0.00004702857],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005671621,0.00004334452,0.002937085,0.0000513124,0.00003096705,3.424374e-7,0.0006197531,0.9946607,0.0001378154,0.00007470365,0.00001085144,0.00137643],"study_design_scores_gemma":[0.001013559,0.00008493014,0.001066614,0.00007243561,0.00002319102,0.000002541124,0.0003749361,0.9968747,0.0003453919,0.00003109036,0.00001275383,0.00009789167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1283063,0.00009887217,0.8699192,0.00002329598,0.0001353272,0.0001513942,0.000006459273,0.00001804006,0.001341054],"genre_scores_gemma":[0.6131549,0.000119707,0.3866645,0.00001009165,0.00001470214,7.442739e-7,0.0000172569,0.00001321059,0.000004907346],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4848486,"threshold_uncertainty_score":0.4480141,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4233901756","doi":"10.23952/jano.1.2019.3.11","title":"A fractional derivative approach to modelling a smart grid-off cluster of houses in an isolated area","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Microgrid Control and Optimization","field":"Engineering","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"European Regional Development Fund","keywords":"Microgrid; Battery (electricity); Computer science; Energy management; Energy storage; Mathematical optimization; Smart grid; Integer programming; Grid; Production (economics); Linear programming; Power (physics); Energy (signal processing); Electrical engineering; Engineering; Renewable energy; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.00820265361346378,"gpt":0.1905349788452921,"spread":0.1823323252318284,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001181773,0.0001112356,0.0002744907,0.0001937634,0.00001759637,0.00002595373,0.00006297578,0.00007673177,0.00001872945],"category_scores_gemma":[0.000005691239,0.00009829093,0.00003364219,0.0002554044,0.000009555343,0.0002502523,0.000009602952,0.0001515195,9.83403e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003640317,"about_ca_system_score_gemma":0.00001639815,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002489157,"about_ca_topic_score_gemma":1.887019e-7,"domain_scores_codex":[0.9992217,0.00001582445,0.0004012471,0.0001070719,0.0001391427,0.0001150101],"domain_scores_gemma":[0.9995885,0.00003502249,0.0001341554,0.00006143075,0.000103768,0.00007714423],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003688334,0.00008404849,0.0002189116,0.00001970112,0.00002528173,2.963937e-7,0.0004804403,0.9965419,0.001100719,0.00003860511,0.00002274398,0.001098478],"study_design_scores_gemma":[0.0008331491,0.0001208362,0.0002010958,0.00002464615,0.00001494637,0.000006984936,0.00009011234,0.9982759,0.0001929911,0.00004732214,0.00008525389,0.000106719],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1005083,0.00009155806,0.8984871,0.00002530194,0.00007450262,0.0001793061,0.000002526782,0.00001646275,0.0006149831],"genre_scores_gemma":[0.9059833,0.0001535313,0.0936949,0.00007556483,0.00005308457,0.000004927844,0.00001286117,0.00001951661,0.000002317965],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8054751,"threshold_uncertainty_score":0.4008188,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4234925647","doi":"10.23952/jano","title":"Journal of Applied and Numerical Optimization","year":2019,"lang":"en","type":"paratext","venue":"Journal of Applied and Numerical Optimization","topic":"Topology Optimization in Engineering","field":"Engineering","cited_by":6,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.005005978399821935,"gpt":0.2048406108827155,"spread":0.1998346324828935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003586983,0.0005457866,0.001357915,0.0006912554,0.00008593992,0.0001330919,0.0002984917,0.0006855279,0.0005615833],"category_scores_gemma":[0.00004807768,0.0005079262,0.0001578679,0.0004581114,0.000110874,0.0003111649,0.00007314016,0.001120769,0.00002641784],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001620268,"about_ca_system_score_gemma":0.000118877,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.430608e-7,"about_ca_topic_score_gemma":1.481441e-8,"domain_scores_codex":[0.9971818,0.00003663358,0.0016339,0.0002738758,0.0005068888,0.0003669494],"domain_scores_gemma":[0.9976993,0.0001938899,0.001250617,0.0002057145,0.000352051,0.0002984493],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002106267,0.00004735652,0.000004489405,0.0002215177,0.0002713326,0.000005462568,0.0002386969,0.9886844,0.0001762352,0.0001849939,0.008249095,0.001705757],"study_design_scores_gemma":[0.001760477,0.0002334323,0.00001512791,0.000155234,0.0002592592,0.0002443063,0.0001204041,0.9862216,0.0002630099,0.00004783276,0.0101286,0.0005507446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001478907,0.001949976,0.9808323,0.00007834127,0.002526941,0.0002774557,0.00001675888,0.00003925202,0.01413106],"genre_scores_gemma":[0.2294941,0.01764558,0.7481731,0.0002995544,0.002794119,0.00002237418,0.0001897913,0.0005240134,0.00085732],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2326592,"threshold_uncertainty_score":0.9997373,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0126004153318758,"gpt":0.2634251402608905,"spread":0.2508247249290147,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006016988,0.00009459354,0.0002118737,0.0000777895,0.0001656795,0.0001377552,0.0002042886,0.00004472849,0.000016291],"category_scores_gemma":[0.00002873155,0.00006305948,0.0000634852,0.0003010605,0.00001580833,0.0002517888,0.00006321646,0.00009506033,0.000001624516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002844232,"about_ca_system_score_gemma":0.00004568402,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001445065,"about_ca_topic_score_gemma":1.04266e-7,"domain_scores_codex":[0.9990921,0.00003079038,0.0003674413,0.0002045547,0.0001906373,0.0001145022],"domain_scores_gemma":[0.9988597,0.0002927857,0.000366643,0.0001299668,0.0002601059,0.0000907965],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005650711,0.00009563289,0.0001709002,0.0000373537,0.00006736328,1.121925e-7,0.0004113436,0.5140567,0.0004051746,0.4748729,0.00006753921,0.009758458],"study_design_scores_gemma":[0.0004763886,0.00006992956,0.0003312073,0.000005395498,0.00004089159,0.0000107103,0.00004284313,0.9894356,0.00009296561,0.008463542,0.0009468114,0.00008370138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002813898,0.000127354,0.9957423,0.002834479,0.00004122129,0.0005025269,0.000002239404,0.00001334266,0.0004551788],"genre_scores_gemma":[0.2364556,0.00009890463,0.7627668,0.0005185126,0.00006031286,0.00002919174,0.000004471256,0.000006839782,0.00005928708],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4753789,"threshold_uncertainty_score":0.2571491,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4252888861","doi":"10.23952/jano.1.2019.1.04","title":"Convergence of solutions to lexicographic equilibrium problems","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Lexicography and Language Studies","field":"Arts and Humanities","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"National Foundation for Science and Technology Development","keywords":"Lexicographical order; Convergence (economics); Applied mathematics; Mathematics; Mathematical optimization; Mathematical economics; Computer science; Economics; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.015232416422482,"gpt":0.2066567205166707,"spread":0.1914243040941887,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001274303,0.000078495,0.0002051381,0.0001513862,0.0000686027,0.00003075361,0.00006980758,0.00002383825,0.0004479128],"category_scores_gemma":[0.000009051589,0.00005841389,0.00007362313,0.0001123936,0.00009699038,0.0001303896,0.00003099536,0.00007970948,0.000004189742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000004895018,"about_ca_system_score_gemma":0.0000136075,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001003221,"about_ca_topic_score_gemma":0.000001487521,"domain_scores_codex":[0.9993361,0.0000112195,0.0003032579,0.00008234505,0.0001484617,0.0001186105],"domain_scores_gemma":[0.999474,0.00003444499,0.0002177704,0.00005979825,0.0001528961,0.00006110375],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0008079063,0.0007316221,0.002722979,0.0004570669,0.0005827733,0.000004312639,0.1044975,0.4410596,0.007705098,0.43064,0.003160049,0.007630999],"study_design_scores_gemma":[0.02182674,0.02216768,0.01689195,0.002835366,0.002337005,0.0001703635,0.120096,0.1844639,0.01002454,0.06370507,0.5492828,0.006198439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.720786,0.003301524,0.131914,0.002048883,0.002174026,0.001321916,0.00004654886,0.0000882131,0.1383189],"genre_scores_gemma":[0.9973515,0.00008707074,0.002198294,0.000153312,0.0001226572,0.000002924796,0.000001780227,0.000007002823,0.00007542247],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5461228,"threshold_uncertainty_score":0.490433,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3171894515","doi":"10.23952/jano.3.2021.1.07","title":"Learning incentivization strategy for resource rebalancing in shared services with a budget constraint","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Constraint (computer-aided design); Resource (disambiguation); Budget constraint; Resource allocation; Computer science; Resource constraints; Business; Operations research; Mathematical optimization; Chemistry; Economics; Distributed computing; Microeconomics; Engineering; Mathematics; Computer network; Mechanical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.009843123987047843,"gpt":0.2354008190798567,"spread":0.2255576950928089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000313423,0.00008504622,0.000188065,0.000107906,0.00008515135,0.0002185939,0.0001188196,0.00004891826,0.00001006671],"category_scores_gemma":[0.00002750162,0.00007120585,0.00002301841,0.0004289436,0.00002035629,0.0003791604,0.00004115807,0.0001590893,2.23772e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003251399,"about_ca_system_score_gemma":0.0001142022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001223989,"about_ca_topic_score_gemma":8.941091e-7,"domain_scores_codex":[0.999104,0.00005268235,0.0003246586,0.0001734186,0.0001978708,0.0001473405],"domain_scores_gemma":[0.9992375,0.00008994224,0.0002658972,0.0000691581,0.0002575894,0.00007985582],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007531784,0.00005170607,0.0003497183,0.00003721866,0.00001067995,0.000007895872,0.0007285252,0.9861808,0.0002543087,0.003434863,0.00001027505,0.008858647],"study_design_scores_gemma":[0.001203459,0.000210803,0.000309573,0.00007982559,0.000006248373,0.00003443446,0.0006201,0.9963347,0.0002706565,0.0004009846,0.0004333361,0.00009582779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001755333,0.00005031526,0.9966508,0.000489229,0.00001875492,0.0001301234,0.000001069321,0.00001733234,0.0008870572],"genre_scores_gemma":[0.63691,0.00007441454,0.3627174,0.0002054505,0.00003037033,0.00000579317,0.00002528546,0.000008938436,0.00002240861],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6351546,"threshold_uncertainty_score":0.2903691,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4249283703","doi":"10.23952/jano.3.2021.2.02","title":"A shape derivative for optimal control of the nonlinear Brinkman-Forchheimer equation","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Mathematical Modeling in Engineering","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Russian Foundation for Basic Research; Austrian Science Fund; European Commission","keywords":"Nonlinear system; Derivative (finance); Control theory (sociology); Mathematics; Applied mathematics; Mathematical analysis; Control (management); Physics; Computer science; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.01535851846013394,"gpt":0.2400392040955849,"spread":0.224680685635451,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000153413,0.0000706653,0.0001918343,0.00002908661,0.00004462652,0.00002903708,0.0001610215,0.00003661957,0.000003094413],"category_scores_gemma":[0.00017824,0.00004964475,0.00006286332,0.0001739946,0.00002298486,0.0001968735,0.00005069702,0.00009372352,1.312887e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001644193,"about_ca_system_score_gemma":0.00004511283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.972515e-8,"about_ca_topic_score_gemma":6.080467e-9,"domain_scores_codex":[0.9992827,0.00001175138,0.0003412282,0.00009581672,0.0001769451,0.00009155478],"domain_scores_gemma":[0.9990783,0.0002264231,0.0002716614,0.0001043295,0.000277129,0.00004210376],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002665419,0.000035049,0.00000270483,0.0000168219,0.00002215272,3.612136e-7,0.0001417664,0.9719512,0.001774801,0.02159454,0.000003135393,0.004430815],"study_design_scores_gemma":[0.0005674976,0.0000558428,0.00001846166,0.00002687496,0.00002202765,0.00001159964,0.00001919087,0.989889,0.005491212,0.003790561,0.00005313449,0.00005455444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001296488,0.00006396377,0.9979785,0.0003886292,0.00007379142,0.0001167948,0.000001175668,0.000008350585,0.0000723151],"genre_scores_gemma":[0.3686855,0.000009644074,0.6311611,0.00009769488,0.00003495955,0.000003200739,4.599574e-7,0.000005020257,0.000002391491],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3673891,"threshold_uncertainty_score":0.2024454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4237610153","doi":"10.23952/jano.1.2019.1.03","title":"Viscosity approximation methods for fixed point problems in Hilbert spaces endowed with graphs","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Fixed Point Theorems Analysis","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Thailand Research Fund","keywords":"Mathematics; Fixed point; Hilbert space; Fixed-point theorem; Applied mathematics; Pure mathematics; Viscosity; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01311204291942785,"gpt":0.2843343655290947,"spread":0.2712223226096668,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001040623,0.0001463787,0.0004893444,0.0002363016,0.00003988281,0.00005289862,0.00008719863,0.0000796694,0.00003783712],"category_scores_gemma":[0.0001077281,0.0001023134,0.00008729746,0.0003422144,0.00003089638,0.0002062559,0.00001996098,0.0001557107,6.517578e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004761478,"about_ca_system_score_gemma":0.00002543341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000482242,"about_ca_topic_score_gemma":0.000001201207,"domain_scores_codex":[0.9989021,0.00007569082,0.000523033,0.0001645301,0.0001798499,0.0001548215],"domain_scores_gemma":[0.9985806,0.0004531635,0.0006392632,0.0001209596,0.0001381591,0.00006779622],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00232605,0.0008155571,0.001399649,0.0006306098,0.0004794403,0.000001959394,0.003522649,0.7527693,0.01066221,0.2130568,0.0002259833,0.01410979],"study_design_scores_gemma":[0.004309841,0.0007659322,0.0002568679,0.0001733515,0.0003117554,0.00003547487,0.0005311092,0.7097505,0.004135188,0.2791259,0.0002320422,0.000371957],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03100941,0.00003403119,0.9671494,0.0002987153,0.00003554412,0.0005735311,0.000001079112,0.00001292716,0.000885324],"genre_scores_gemma":[0.2947869,0.00002414078,0.705063,0.00004506876,0.00001923978,0.00001672074,0.000005301592,0.00001932567,0.00002027186],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2637775,"threshold_uncertainty_score":0.4172218,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0264954872892156,"gpt":0.2956079964048903,"spread":0.2691125091156747,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005205263,0.0001243061,0.000271249,0.0001140151,0.0001695719,0.0001676375,0.0001814876,0.00005121086,0.00001589787],"category_scores_gemma":[0.0002646267,0.00009567542,0.00005847647,0.0004922067,0.00001881894,0.0005105583,0.00005313936,0.0001236911,3.445164e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003607599,"about_ca_system_score_gemma":0.0001286907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006450214,"about_ca_topic_score_gemma":1.460329e-7,"domain_scores_codex":[0.9988155,0.00006951101,0.0004885884,0.0002088197,0.0002951187,0.0001224812],"domain_scores_gemma":[0.9984169,0.0002838677,0.0005696155,0.00006500397,0.0005454053,0.0001191823],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002545067,0.00004808556,0.00007731943,0.00001531838,0.00009681374,4.738992e-7,0.001104738,0.9554218,0.0007558843,0.03847838,0.00003607779,0.00371061],"study_design_scores_gemma":[0.0009281681,0.000252672,0.0001110455,0.000007280991,0.00004930255,0.00000609384,0.00009007571,0.996509,0.0005883466,0.001169743,0.0001629228,0.0001253383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000501341,0.00001989222,0.9965843,0.002334714,0.00009162996,0.0001727029,0.000002122048,0.00002884652,0.0002644291],"genre_scores_gemma":[0.1525531,0.00001489213,0.8464848,0.0007115009,0.0002000325,0.000007264047,0.000009913834,0.000009314006,0.000009133785],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1520518,"threshold_uncertainty_score":0.3901531,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.02250132360065009,"gpt":0.2564471490728111,"spread":0.233945825472161,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006819538,0.00009765184,0.0002282396,0.0001404172,0.0003733571,0.000123215,0.0001316537,0.00003140995,0.00001161116],"category_scores_gemma":[0.00004428767,0.00008884734,0.00006043295,0.0004174595,0.00003217217,0.0002822975,0.0001116942,0.0001272418,7.315082e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006244694,"about_ca_system_score_gemma":0.0000636299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005073103,"about_ca_topic_score_gemma":5.345548e-8,"domain_scores_codex":[0.9989295,0.00006623696,0.0004185437,0.0002061996,0.0002575561,0.0001219874],"domain_scores_gemma":[0.9989707,0.0001336912,0.0005143792,0.00008073698,0.0002052811,0.00009514311],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005927252,0.00009548934,0.0002706454,0.00001458542,0.00004772083,4.671616e-7,0.0006947776,0.9806333,0.00008406835,0.01483545,0.0000106908,0.00325352],"study_design_scores_gemma":[0.000647297,0.0001211188,0.0002143854,0.000003499362,0.00004447538,0.00002295986,0.0002268513,0.9966426,0.00004056204,0.001404108,0.0005213661,0.0001106984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002816913,0.00005935306,0.9963113,0.0004304391,0.00006554686,0.0002255369,0.000005584939,0.00001814443,0.00006719963],"genre_scores_gemma":[0.436964,0.00001804405,0.5628082,0.0001496282,0.00002636098,0.00001690403,0.000006526123,0.000005689628,0.000004652084],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4341471,"threshold_uncertainty_score":0.3623089,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Vectorization (mathematics); Set (abstract data type); Computer science; Mathematical optimization; Mathematics; Algorithm; Parallel computing; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.007936345292094815,"gpt":0.2178672487866019,"spread":0.2099309034945071,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004572472,0.0001061109,0.0002281342,0.0004144849,0.0001739038,0.00009410554,0.0002699604,0.00003985509,0.0002176024],"category_scores_gemma":[0.00003709762,0.0001031697,0.00005158822,0.001237567,0.00001375017,0.0004703642,0.0001257296,0.0001908853,9.500679e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001174147,"about_ca_system_score_gemma":0.00008990477,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000437505,"about_ca_topic_score_gemma":1.194287e-7,"domain_scores_codex":[0.9986248,0.00009055329,0.0005312008,0.0001907132,0.0004351466,0.0001275685],"domain_scores_gemma":[0.9991183,0.00007310981,0.0004656154,0.0001134105,0.0001470585,0.00008253385],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004332829,0.00008698679,0.0002011124,0.000003138441,0.00001436408,0.000003240425,0.0004014832,0.9828941,0.00003458934,0.01510471,0.00007789554,0.001135064],"study_design_scores_gemma":[0.0007103608,0.0001057091,0.0003062069,0.000003038853,0.00001409606,0.00002075842,0.00008589261,0.997395,0.00002363709,0.0007189267,0.0005015032,0.0001149138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0003407703,0.00004232638,0.9972462,0.001081681,0.0001820706,0.00009338914,0.000001938263,0.0000208509,0.0009907953],"genre_scores_gemma":[0.6319264,0.00009605365,0.3672732,0.0005508153,0.0000704936,0.00001160323,0.00003066346,0.00001095314,0.00002984875],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6315856,"threshold_uncertainty_score":0.4207139,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01480240814059658,"gpt":0.225474390346622,"spread":0.2106719822060255,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006178017,0.0001413622,0.0003720044,0.0002096922,0.0001600203,0.00007001039,0.0002197975,0.00004660877,0.00008252124],"category_scores_gemma":[0.00003886799,0.0001200566,0.00007550381,0.0005576662,0.00004334788,0.0003219474,0.0001895784,0.0002118042,6.540827e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005562139,"about_ca_system_score_gemma":0.00005456223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001256352,"about_ca_topic_score_gemma":1.745139e-7,"domain_scores_codex":[0.9982887,0.000143788,0.0006746725,0.000250538,0.0005036072,0.0001387019],"domain_scores_gemma":[0.9984764,0.000152465,0.0008780101,0.0001399702,0.0002351579,0.0001180114],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000106188,0.0001610979,0.00005668592,0.00002176782,0.00006191914,0.000001035124,0.001215502,0.9277749,0.0007845575,0.06900959,0.00008667469,0.0007201006],"study_design_scores_gemma":[0.001247211,0.0004664987,0.0004463766,0.00001700409,0.00004374456,0.00002225763,0.0000845703,0.9877516,0.0001591482,0.009358675,0.0002424401,0.0001604406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01208354,0.00009380466,0.9852563,0.001487791,0.00006627688,0.0002075646,0.000008961943,0.00001875478,0.000777012],"genre_scores_gemma":[0.8331796,0.00008316497,0.1660861,0.0005074474,0.00003425901,0.00001471752,0.00002195752,0.00001207721,0.00006067132],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8210961,"threshold_uncertainty_score":0.4895765,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4312757248","doi":"10.23952/jano.4.2022.3.07","title":"Inertial viscosity with alternative regularization for certain optimization and fixed point problems","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Contact Mechanics and Variational Inequalities","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"International Mathematical Union","keywords":"Inertial frame of reference; Regularization (linguistics); Fixed point; Mathematics; Applied mathematics; Viscosity; Mathematical optimization; Computer science; Mathematical analysis; Physics; Classical mechanics; Artificial intelligence; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.01213784961640096,"gpt":0.2152853878007981,"spread":0.2031475381843972,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000374374,0.00009462079,0.0001738141,0.0001154271,0.0002417804,0.0001179033,0.0001284132,0.00002538802,0.0000117974],"category_scores_gemma":[0.00002226722,0.00007827782,0.00002528026,0.0001976224,0.000007725118,0.0003444351,0.00009606309,0.00009920653,2.942693e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005453967,"about_ca_system_score_gemma":0.00005948069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006679724,"about_ca_topic_score_gemma":2.490595e-7,"domain_scores_codex":[0.9991294,0.00004569845,0.0002989146,0.0001637971,0.0002620821,0.0001001303],"domain_scores_gemma":[0.9991713,0.00009152373,0.0004146121,0.00007006543,0.0001901753,0.0000623649],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001638618,0.00005063678,0.00000836362,0.000009534829,0.00002339025,6.610815e-7,0.0007671526,0.8232955,0.000243413,0.1745825,0.00001890912,0.0008361788],"study_design_scores_gemma":[0.001054446,0.0006319562,0.00002487054,0.000008345332,0.00001699133,0.00002499311,0.0001179407,0.9906366,0.000257003,0.006952924,0.000166688,0.0001071843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0009918985,0.00002999011,0.9973519,0.001185434,0.00008970614,0.0002574041,0.000005476689,0.00001437274,0.00007383444],"genre_scores_gemma":[0.6789725,0.00003135448,0.3205835,0.0002517726,0.00007078591,0.00003303892,0.00002408143,0.000009718785,0.0000232994],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6779806,"threshold_uncertainty_score":0.3192077,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2974508456","doi":"10.23952/jano.2.2020.1.05","title":"Problem structures in the theory and practice of superiorization","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Control Systems and Identification","field":"Engineering","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Epistemology; Computer science; Sociology; Philosophy","retraction":null,"screen_n_in":null,"score":{"opus":0.005868689363544942,"gpt":0.2044484938909915,"spread":0.1985798045274465,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003215389,0.00004129175,0.0001050719,0.00002895532,0.00001507837,0.0000280894,0.00003459377,0.00002585428,0.000003715299],"category_scores_gemma":[0.00008009885,0.0000279043,0.00001062525,0.0001101445,0.00001198305,0.0001340732,0.00000432653,0.00006867283,8.202272e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005295146,"about_ca_system_score_gemma":0.000004897721,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001133433,"about_ca_topic_score_gemma":5.896707e-8,"domain_scores_codex":[0.9995502,0.00004561428,0.0002402624,0.00003865338,0.00009006591,0.00003522838],"domain_scores_gemma":[0.9996776,0.000128376,0.000106835,0.00002551866,0.00003983415,0.00002185617],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003063174,0.00001693736,0.0001034706,0.00008354394,0.0000244382,0.000001008028,0.004993831,0.9475191,0.01437826,0.01838908,0.00006967975,0.01411438],"study_design_scores_gemma":[0.002505564,0.0003765464,0.009025713,0.00006309553,0.0001863293,0.000108373,0.006209038,0.9682294,0.001340495,0.006099132,0.005577844,0.0002784785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03387046,0.000768069,0.9626038,0.0008851519,0.00005401087,0.0002254557,0.00000127333,0.00001038842,0.001581392],"genre_scores_gemma":[0.9933756,0.0002033138,0.006284199,0.000074866,0.00005398315,0.000001525018,0.000001289806,0.000004800654,4.282473e-7],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9595051,"threshold_uncertainty_score":0.1137904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4239181871","doi":"10.23952/jano.2.2020.3.08","title":"A multi-view on the CQ algorithm for split feasibility problems: From optimization lens","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Lens (geology); Optimization algorithm; Computer science; Algorithm; Mathematical optimization; Mathematics; Optics; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03997516674427885,"gpt":0.2430363821161088,"spread":0.20306121537183,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002019869,0.0001588808,0.00030394,0.00003351432,0.00008853715,0.00008576021,0.0001095136,0.00008131663,0.00008004979],"category_scores_gemma":[0.0001138024,0.0001095713,0.00008244241,0.0001890003,0.00003340145,0.0001431613,0.00001786181,0.0001844211,0.000002810237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003578529,"about_ca_system_score_gemma":0.00001467364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.564792e-7,"about_ca_topic_score_gemma":4.203534e-8,"domain_scores_codex":[0.9990045,0.00002252638,0.0005001456,0.0001499372,0.0001755298,0.0001473869],"domain_scores_gemma":[0.9992939,0.0001968508,0.0001767251,0.00009035088,0.0001114589,0.0001306769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003503592,0.00006694101,0.000001839293,0.00005068011,0.00003865078,3.445806e-7,0.0002941008,0.9827835,0.00006188106,0.0004341003,0.0001575972,0.01607535],"study_design_scores_gemma":[0.0008149957,0.0001280884,0.000005227599,0.00003688233,0.00005328825,0.000001375953,0.00008874729,0.9973684,0.0001229282,0.0002477961,0.001007714,0.0001245682],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001315918,0.0001367523,0.9976747,0.001020045,0.00007188739,0.0005745034,0.00001198103,0.00007098732,0.0003075656],"genre_scores_gemma":[0.04001122,0.0003056876,0.9586936,0.0007429249,0.0001545037,0.00002717417,0.00002313807,0.00003819088,0.000003607265],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03987963,"threshold_uncertainty_score":0.4468189,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4244787383","doi":"10.23952/jano.3.2021.1.09","title":"A survey of clustering methods via optimization methodology","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Clustering Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Department of Education of Guangdong Province; Shenzhen University; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Cluster analysis; Computer science; Data mining; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0701899445410024,"gpt":0.377917705896767,"spread":0.3077277613557646,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00180408,0.0001086216,0.0004062779,0.0001570955,0.00005973853,0.00005289349,0.0002763747,0.00008437516,0.00001930535],"category_scores_gemma":[0.0005374097,0.00009852369,0.00004773794,0.0007406322,0.00004799392,0.0002878066,0.0002765556,0.0002034968,2.896188e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003928849,"about_ca_system_score_gemma":0.0001047617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008803737,"about_ca_topic_score_gemma":6.95465e-7,"domain_scores_codex":[0.9982097,0.0005597142,0.0005667285,0.0002137194,0.0002747092,0.0001754285],"domain_scores_gemma":[0.9977543,0.000807577,0.0004541659,0.0001994866,0.0006684492,0.0001159911],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005678471,0.00003937458,0.00001737442,0.00001699943,0.00002636739,0.000006708357,0.0001442328,0.8890353,0.002156402,0.0001669219,0.000003618692,0.1083299],"study_design_scores_gemma":[0.0004292233,0.0001158019,0.0004053403,0.00001301305,0.00000975359,0.0001061522,0.00002165665,0.9933997,0.004928175,0.0004536508,0.00002617388,0.00009140279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007918422,0.0002286534,0.9991055,0.0001555385,0.0001673515,0.00005962584,8.537277e-7,0.00001376177,0.000189602],"genre_scores_gemma":[0.0208764,0.0002055767,0.9787909,0.0000650522,0.00003374299,0.000001933279,0.00000383729,0.00001167535,0.0000109062],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1082385,"threshold_uncertainty_score":0.401768,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3192527474","doi":"10.23952/jano.3.2021.2.06","title":"FE-BE coupling for a transmission problem involving microstructure","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Metal Forming Simulation Techniques","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Microstructure; Coupling (piping); Transmission (telecommunications); Materials science; Composite material; Computer science; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.008645525358408773,"gpt":0.2253199746998504,"spread":0.2166744493414417,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001088702,0.00008445163,0.0001837166,0.00005494186,0.00005230355,0.00004079567,0.00003754179,0.00007507572,0.00002466363],"category_scores_gemma":[0.00001299337,0.00007330475,0.00004877909,0.000116658,0.000008849948,0.0001101976,0.000006385001,0.0001120544,9.088949e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002540864,"about_ca_system_score_gemma":0.00001841282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.562183e-7,"about_ca_topic_score_gemma":2.195614e-8,"domain_scores_codex":[0.9994322,0.000003184022,0.0003028731,0.00007069529,0.0001015865,0.00008946005],"domain_scores_gemma":[0.9996495,0.00004574921,0.00009046494,0.00004120871,0.0001124571,0.00006056742],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0000374209,0.00001227913,0.00000438416,0.0001007185,0.00001983948,0.000001169924,0.0001558754,0.9189164,0.07390265,0.001288563,0.0001676379,0.00539303],"study_design_scores_gemma":[0.0004351472,0.00004768172,0.00001311943,0.00005412054,0.00003268512,0.00002091135,0.00003744424,0.919193,0.07247967,0.003487222,0.004092435,0.000106554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00999428,0.0004902027,0.9889132,0.0001262942,0.00005889221,0.0001180046,0.000001741392,0.00005284319,0.0002445104],"genre_scores_gemma":[0.3931799,0.0003046712,0.6063156,0.00007793164,0.00006836038,0.000003908333,0.00001308723,0.00002321342,0.00001334391],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3831856,"threshold_uncertainty_score":0.2989281,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4231157253","doi":"10.23952/jano.1.2019.3.03","title":"Variational principles in set optimization with domination structures and application to changing jobs","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Aix-Marseille Université","keywords":"Set (abstract data type); Mathematical optimization; Computer science; Mathematical economics; Mathematics; Programming language","retraction":null,"screen_n_in":null,"score":{"opus":0.004617188997102028,"gpt":0.2027417648185157,"spread":0.1981245758214137,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000212404,0.0001275409,0.0002037772,0.000370376,0.00004395454,0.00006289218,0.00005508538,0.00007679989,0.00002312117],"category_scores_gemma":[0.0000179019,0.0001106767,0.00001397356,0.0004502512,0.0000129209,0.0002091689,0.00001659679,0.0001235696,0.000001144251],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005737189,"about_ca_system_score_gemma":0.00001863279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001166952,"about_ca_topic_score_gemma":2.848119e-7,"domain_scores_codex":[0.9991731,0.00001356191,0.0003318758,0.0001428242,0.000205981,0.000132651],"domain_scores_gemma":[0.9995442,0.00005203012,0.000142673,0.00006673043,0.000107142,0.00008720654],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008919091,0.0000117148,0.0005413252,0.0000234319,0.00001451986,4.497336e-7,0.0005663708,0.9941859,0.0001455618,0.00168737,0.000002210355,0.002731986],"study_design_scores_gemma":[0.0008200164,0.00007068537,0.002143772,0.00002707029,0.00001523297,0.00001641074,0.0002167288,0.996236,0.0001720935,0.0001008765,0.0000435873,0.0001375291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0354597,0.00004592279,0.96363,0.0001149299,0.00007572571,0.0002575093,0.000002194476,0.00003106128,0.0003829395],"genre_scores_gemma":[0.5619006,0.00005394785,0.4378816,0.00005735028,0.0000553281,0.000008682107,0.00001940183,0.00001764627,0.000005405503],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5264409,"threshold_uncertainty_score":0.4513265,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2997577556","doi":"10.23952/jano.1.2019.3.02","title":"The Fermat-Torricelli problem and Weiszfeld’s algorithm in the light of convex analysis","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Australian Research Council; National Science Foundation","keywords":"Fermat's Last Theorem; Algorithm; Regular polygon; Mathematics; Computer science; Combinatorics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.005404647650407687,"gpt":0.1921024465828304,"spread":0.1866977989324227,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005890063,0.00007961757,0.0001959916,0.0001659345,0.00007784031,0.00009489941,0.0001312419,0.00002928375,0.00006211021],"category_scores_gemma":[0.000009196488,0.00004458326,0.00005022382,0.0006532206,0.00002878351,0.0002169966,0.00004064055,0.00009294235,0.000004129194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008467911,"about_ca_system_score_gemma":0.000006461014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003764047,"about_ca_topic_score_gemma":0.00000396961,"domain_scores_codex":[0.9991685,0.00001097193,0.0004046321,0.00009245171,0.0002283416,0.00009510881],"domain_scores_gemma":[0.9995196,0.00003287675,0.000242843,0.00009604877,0.00009912073,0.000009534208],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003189124,0.0004065995,0.01171323,0.0003065798,0.0005489756,0.000002895149,0.001203611,0.8390011,0.0001206936,0.07478939,0.002384725,0.06920327],"study_design_scores_gemma":[0.0006970973,0.00003059736,0.006462564,0.00001542792,0.0002927027,0.000001425694,0.001459327,0.9650202,0.00001005107,0.001701835,0.02417991,0.0001288255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1903476,0.001588587,0.6480957,0.03168346,0.0009679556,0.002464747,0.000005046691,0.00005174931,0.1247951],"genre_scores_gemma":[0.9962273,0.0003008825,0.002770486,0.0005404948,0.00007587186,0.000004919877,0.00000576719,0.000005301401,0.00006897217],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8058797,"threshold_uncertainty_score":0.1818053,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4226356618","doi":"10.23952/jano.4.2022.1.06","title":"Strategic decision in a two-period game using a multi-leader-follower approach. Part 1 – General setting and weighted Nash equilibrium","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Università degli Studi di Brescia; Centre National de la Recherche Scientifique","keywords":"Mathematical economics; Nash equilibrium; Best response; Sequential game; Non-cooperative game; Epsilon-equilibrium; Normal-form game; Computer science; Repeated game; Strategy; Screening game; Game theory; Symmetric game; Equilibrium selection; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03711402008024802,"gpt":0.2436702999161822,"spread":0.2065562798359342,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005029742,0.0001319928,0.0004188703,0.0002078489,0.0001040127,0.00009215172,0.00009434124,0.0000451625,0.0001052643],"category_scores_gemma":[0.00001060769,0.0001394446,0.00006012804,0.0001732684,0.00003741121,0.0002056591,0.00009739318,0.0002345928,7.730396e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001010876,"about_ca_system_score_gemma":0.00002887908,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001615071,"about_ca_topic_score_gemma":3.435734e-7,"domain_scores_codex":[0.9987203,0.00002048967,0.0007560008,0.0002546803,0.00004663024,0.000201846],"domain_scores_gemma":[0.9992201,0.0000332574,0.0005503042,0.0000863311,0.00001771684,0.00009231869],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000237673,0.0001292499,0.0008021712,0.00001085505,0.00002850513,0.000005850344,0.0008039382,0.976507,0.000114923,0.02048554,0.00001098169,0.0008633148],"study_design_scores_gemma":[0.002020198,0.00007796381,0.00009408009,0.000007853022,0.000009112823,0.00005639298,0.0007279482,0.985832,0.000007073613,0.01053846,0.0004564401,0.0001724236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7126375,0.0007010342,0.2850552,0.00009661747,0.0001869386,0.0001431647,0.00002081579,0.000006866624,0.001151858],"genre_scores_gemma":[0.8761181,0.00008388879,0.1235158,0.0001257968,0.00009623033,0.000007147445,0.000009355812,0.0000202554,0.00002344417],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1634806,"threshold_uncertainty_score":0.5686385,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4241688089","doi":"10.23952/jano.3.2021.2.10","title":"Structural convexity and ravines of quadratic functions","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Analytic and geometric function theory","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Convexity; Ravine; Quadratic equation; Mathematics; Mathematical optimization; Applied mathematics; Mathematical economics; Geometry; Geography; Economics; Cartography","retraction":null,"screen_n_in":null,"score":{"opus":0.0193588544538282,"gpt":0.2561571229105787,"spread":0.2367982684567505,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001656671,0.00006806106,0.0002562073,0.00008528966,0.00005407418,0.00001557678,0.00002551662,0.00004630007,0.0002108411],"category_scores_gemma":[0.0002503345,0.00005147758,0.00004248577,0.0002581108,0.00006350445,0.00006834073,0.00001913063,0.00009146176,4.220293e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009477481,"about_ca_system_score_gemma":0.00003654255,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":7.335996e-7,"about_ca_topic_score_gemma":6.712156e-8,"domain_scores_codex":[0.9993513,0.00002284632,0.0003509058,0.00007291987,0.0001416615,0.00006033587],"domain_scores_gemma":[0.999109,0.0002517371,0.0003102992,0.00005872463,0.0002054119,0.00006482127],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003091488,0.001226706,0.0120233,0.001573062,0.001969781,0.00006473946,0.004608467,0.2665625,0.004756678,0.627345,0.008887719,0.06789059],"study_design_scores_gemma":[0.00659231,0.001018299,0.007841693,0.0001580806,0.001540607,0.000810788,0.008203944,0.4362208,0.003664103,0.5318965,0.001314327,0.0007385222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1514402,0.0002823493,0.8462334,0.000230408,0.0001273394,0.00005068642,0.000002516728,0.000007277099,0.001625885],"genre_scores_gemma":[0.9621345,0.00009869901,0.03739824,0.00005730198,0.00007053591,5.335801e-7,0.000002571585,0.000006438071,0.0002311265],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8106944,"threshold_uncertainty_score":0.2308562,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01407311487704326,"gpt":0.2455963998976129,"spread":0.2315232850205696,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001462628,0.0000744036,0.0002120893,0.0001271268,0.00002870574,0.0000429446,0.0001454699,0.00003303793,0.00002742982],"category_scores_gemma":[0.00003602217,0.00006218479,0.00004172674,0.0006530077,0.00001921395,0.0003508466,0.00004175887,0.00009605473,7.161081e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002000801,"about_ca_system_score_gemma":0.00005854223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001371916,"about_ca_topic_score_gemma":3.601753e-7,"domain_scores_codex":[0.9990994,0.00002989563,0.0004232761,0.0001307938,0.0002388997,0.0000777508],"domain_scores_gemma":[0.9993118,0.00003744667,0.0003771222,0.00004891959,0.0001443842,0.000080335],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005595648,0.00005598071,0.0006861953,0.000007567774,0.00001904027,0.000001185992,0.0005127907,0.9836798,0.000400685,0.01123424,0.00003061649,0.003315991],"study_design_scores_gemma":[0.0006313918,0.0001068211,0.0004682626,0.000006645139,0.00001374906,0.000003556874,0.00004628663,0.9978456,0.0005554451,0.0001890173,0.00006777948,0.00006544083],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002096331,0.00002665285,0.9951444,0.002264083,0.00006266575,0.00006149557,5.852587e-7,0.000008558223,0.0003352601],"genre_scores_gemma":[0.7350213,0.00006297158,0.2646088,0.0002265612,0.00006989881,0.000001219483,0.000002099171,0.000003405136,0.000003704883],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.732925,"threshold_uncertainty_score":0.2535822,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.0115450524025004,"gpt":0.2294331381343084,"spread":0.217888085731808,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003854636,0.00007984197,0.0002234896,0.0003407371,0.0001240458,0.00005727748,0.0001114411,0.00004566622,0.00001158929],"category_scores_gemma":[0.00004025941,0.00006453729,0.00003416832,0.000912262,0.00002980135,0.0003502932,0.0002522574,0.00008569622,7.952002e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002383483,"about_ca_system_score_gemma":0.00003399837,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000099532,"about_ca_topic_score_gemma":9.147287e-7,"domain_scores_codex":[0.9990875,0.00003721971,0.0004150795,0.000134417,0.0002218503,0.0001038989],"domain_scores_gemma":[0.9993048,0.0001008237,0.0003173009,0.00006801191,0.0001419397,0.00006706839],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002372623,0.00007123876,0.0003071653,0.00001208306,0.00002145083,0.000001149743,0.002170549,0.9649771,0.0004257725,0.03008765,0.00005902733,0.001843045],"study_design_scores_gemma":[0.0004939084,0.00007623917,0.002582798,0.00002554928,0.00001262735,0.000004834395,0.00006907067,0.9906007,0.00009315259,0.005899741,0.00006971099,0.00007168926],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006606399,0.00007382326,0.9893687,0.003468221,0.00003360403,0.000101106,0.000001470615,0.00001399178,0.0003326703],"genre_scores_gemma":[0.8623703,0.0003829451,0.1370546,0.0001277936,0.00002226802,0.000004119578,0.00000774108,0.000004817482,0.00002540267],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8557639,"threshold_uncertainty_score":0.2631754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4243792189","doi":"10.23952/jano.3.2021.1.04","title":"Non-Euclidean proximal methods for convex-concave saddle-point problems","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Israel Science Foundation; Deutsche Forschungsgemeinschaft","keywords":"Saddle point; Regular polygon; Saddle; Euclidean geometry; Mathematics; Euclidean distance; Point (geometry); Combinatorics; Geometry; Computer science; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.04057491881040825,"gpt":0.3809193250032356,"spread":0.3403444061928274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008567446,0.0001747892,0.0005230379,0.0001245908,0.0001304325,0.000087339,0.0001219372,0.0001207875,0.0001032955],"category_scores_gemma":[0.0006880767,0.0001481947,0.0001161242,0.0003321361,0.00006697022,0.0002205113,0.00007052514,0.0002778016,0.000001151398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007730417,"about_ca_system_score_gemma":0.0001583507,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.561819e-7,"about_ca_topic_score_gemma":6.506672e-8,"domain_scores_codex":[0.9983891,0.00006990439,0.0007525969,0.0002361966,0.0002890133,0.0002632526],"domain_scores_gemma":[0.9975605,0.0006723908,0.0005524903,0.000152805,0.0008601584,0.0002016739],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008190446,0.0007869124,0.0000363531,0.0005793475,0.0003425565,0.00002444841,0.001740362,0.8473705,0.007079049,0.02956619,0.001071057,0.1105842],"study_design_scores_gemma":[0.002637855,0.0003220992,0.00001097551,0.00006338899,0.00009627751,0.0001041363,0.0004440872,0.9270068,0.01181945,0.05514172,0.002095047,0.0002582019],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000168477,0.0001134025,0.9968184,0.000551962,0.0001061566,0.0005215782,0.000003972717,0.00002150501,0.001694541],"genre_scores_gemma":[0.005997419,0.0001871306,0.9931979,0.0001654549,0.0001568805,0.00003761688,0.00001324568,0.00004734369,0.00019705],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.110326,"threshold_uncertainty_score":0.6043206,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285159165","doi":"10.23952/jano.4.2022.2.07","title":"Convergence of inexact iterates of strict contractions in metric spaces with graphs","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Fixed Point Theorems Analysis","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Israel Science Foundation","keywords":"Iterated function; Convergence (economics); Metric space; Mathematics; Metric (unit); Discrete mathematics; Computer science; Mathematical analysis; Economics; Operations management","retraction":null,"screen_n_in":null,"score":{"opus":0.009970642827420623,"gpt":0.2416763495416725,"spread":0.2317057067142519,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004406488,0.00007555576,0.0003811039,0.0005076329,0.00003857254,0.000008882104,0.0000761366,0.00002326029,0.0001645974],"category_scores_gemma":[0.0001098295,0.00005728853,0.00005515196,0.001291166,0.00004289272,0.00009249915,0.0000220199,0.0001620998,6.079397e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002661993,"about_ca_system_score_gemma":0.00003582944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001559413,"about_ca_topic_score_gemma":7.115996e-7,"domain_scores_codex":[0.9990119,0.00006197806,0.0005049363,0.00007260439,0.0002743942,0.00007414648],"domain_scores_gemma":[0.9984869,0.0004325359,0.0008460085,0.00006891156,0.0001282927,0.00003735802],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0007296196,0.0004300783,0.002725267,0.00005122763,0.0001808624,0.000005007631,0.0005825235,0.9588857,0.001143825,0.03481192,0.00007602089,0.0003779979],"study_design_scores_gemma":[0.01158811,0.005590804,0.01340422,0.0002697875,0.002254005,0.0002907256,0.0131147,0.7806741,0.0165026,0.154774,0.0004114613,0.001125497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6463222,0.000299775,0.3521429,0.00014943,0.00005566089,0.0001984675,0.0000137,0.000007515093,0.000810365],"genre_scores_gemma":[0.9679902,0.0001116231,0.03186114,0.00001035299,0.000007162674,0.000003264562,0.000002104991,0.000008023993,0.000006079032],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.321668,"threshold_uncertainty_score":0.2336158,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01638038327225282,"gpt":0.2677829618036052,"spread":0.2514025785313524,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003359056,0.00009687485,0.0002529704,0.0001226142,0.00006624996,0.0001312438,0.0001200842,0.00007061652,0.00006358344],"category_scores_gemma":[0.0001036531,0.00007834046,0.00004393966,0.0003226849,0.00002887335,0.0004391537,0.00001575243,0.0001194314,4.41505e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002711296,"about_ca_system_score_gemma":0.0001954086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001285697,"about_ca_topic_score_gemma":7.104245e-7,"domain_scores_codex":[0.9989992,0.00004146763,0.0004388448,0.000167291,0.0002402988,0.0001128421],"domain_scores_gemma":[0.998705,0.0003017827,0.0003326817,0.00008882942,0.0004755063,0.00009623734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001801739,0.0001463866,0.0004129387,0.000009230017,0.00004446633,0.000006214255,0.0004296563,0.8908691,0.0000835304,0.1061578,0.000004643393,0.001655863],"study_design_scores_gemma":[0.001434907,0.0001548632,0.003423084,0.00002415639,0.00002811348,0.00002672157,0.0001355168,0.9899542,0.0000380431,0.004617071,0.00004545966,0.0001179021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001533994,0.00001875717,0.9966098,0.001544346,0.00005653864,0.00008905384,0.000008601471,0.000009878502,0.000129039],"genre_scores_gemma":[0.4988254,0.000008143523,0.5005609,0.0005158223,0.00006389698,0.000004165893,0.00001322572,0.000004352712,0.000004170263],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4972914,"threshold_uncertainty_score":0.3194631,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4393616711","doi":"10.23952/jano.6.2024.2.08","title":"Implicit augmented Lagrangian and generalized optimization","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Augmented Lagrangian method; Lagrangian; Lagrangian relaxation; Mathematical optimization; Applied mathematics; Computer science; Mathematics; Calculus (dental); Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.01052654356898014,"gpt":0.2630617335023203,"spread":0.2525351899333402,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004622808,0.0001431387,0.0002590847,0.0003392645,0.0001042815,0.0005160947,0.0002153282,0.00007700858,0.00007050312],"category_scores_gemma":[0.00004978553,0.000114938,0.00004720789,0.0006679308,0.00004669589,0.0004949336,0.0001068967,0.0001897106,0.000002778428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003887097,"about_ca_system_score_gemma":0.00007585538,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002455356,"about_ca_topic_score_gemma":3.350056e-8,"domain_scores_codex":[0.9986233,0.0000594589,0.0004703734,0.0002633579,0.0003959833,0.0001875796],"domain_scores_gemma":[0.9991757,0.000124718,0.0001593288,0.0001387746,0.0001920949,0.0002093784],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003656563,0.00003417856,0.000005477307,0.00003194076,0.00004874649,0.00001517395,0.0001953495,0.9390272,0.0002234247,0.01891206,0.0003421727,0.04112767],"study_design_scores_gemma":[0.000526801,0.0000999048,0.00002528443,0.00002504597,0.00002657925,0.00009349643,0.00001514185,0.9969933,0.000132215,0.0007056609,0.00123474,0.0001218506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001545873,0.0009189092,0.9962783,0.001260375,0.0002017495,0.0001502521,0.000001823381,0.00006241816,0.0009715845],"genre_scores_gemma":[0.04086587,0.001763249,0.9568925,0.0002229382,0.0001361354,0.000006237264,0.000008385946,0.00002103413,0.00008356846],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.05796604,"threshold_uncertainty_score":0.4976713,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.004503901284674715,"gpt":0.1969571943526005,"spread":0.1924532930679258,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002800885,0.00008399156,0.000213494,0.0001724882,0.0001088202,0.00009076987,0.0001633247,0.00005399685,0.00004723102],"category_scores_gemma":[0.00003545777,0.00006074673,0.00006417117,0.0006527234,0.00002232116,0.0003413825,0.00004154508,0.0001185495,0.000005566516],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002924679,"about_ca_system_score_gemma":0.00006337126,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004723816,"about_ca_topic_score_gemma":4.237429e-7,"domain_scores_codex":[0.9989763,0.00004638289,0.0005061405,0.0001288023,0.0002393123,0.0001030457],"domain_scores_gemma":[0.9990019,0.0001146518,0.0004608261,0.0001248368,0.000240891,0.000056851],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000110938,0.0001268008,0.002745575,0.000006203467,0.00005911589,2.813439e-7,0.0002230106,0.9500055,0.006535373,0.03431725,0.00002364544,0.005846313],"study_design_scores_gemma":[0.0005436349,0.00006022308,0.003163332,0.0000086658,0.00002068062,0.000004157452,0.0000820663,0.993679,0.0003748862,0.0004149548,0.001576569,0.00007181212],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01010614,0.00008069532,0.9875835,0.001028791,0.000201476,0.0001196061,0.000002418161,0.00001188393,0.0008655101],"genre_scores_gemma":[0.9175401,0.000152089,0.08191426,0.0001726648,0.00008987194,0.000005081877,0.00002240135,0.000008969851,0.00009455144],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.907434,"threshold_uncertainty_score":0.247718,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01150794879687846,"gpt":0.2482513964258231,"spread":0.2367434476289447,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002487717,0.0001407219,0.0003007439,0.0001669254,0.0004728906,0.000220244,0.0001735509,0.00006369314,0.00001642099],"category_scores_gemma":[0.0000377498,0.0001179349,0.00006010992,0.0008147935,0.00001862859,0.0003722012,0.000220612,0.00009570146,0.000001393592],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005206895,"about_ca_system_score_gemma":0.0001327897,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001654396,"about_ca_topic_score_gemma":5.614053e-7,"domain_scores_codex":[0.9986842,0.00002140809,0.0005070862,0.0002870634,0.0003451142,0.000155142],"domain_scores_gemma":[0.9982813,0.000144607,0.0003724222,0.0001510201,0.0008682064,0.0001824432],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007606761,0.000124068,0.00009827707,0.00001465737,0.00006207631,0.000002440373,0.0004389602,0.9681247,0.001648815,0.01915908,0.00004643084,0.0102044],"study_design_scores_gemma":[0.0008451183,0.0001195638,0.0001941462,0.00002194154,0.00006247772,0.00003022972,0.00005476489,0.994825,0.001832392,0.0008851765,0.0009603716,0.0001687981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000603625,0.00006572927,0.9962743,0.002518942,0.00005093184,0.0002950957,0.000004491852,0.00002776484,0.0001591438],"genre_scores_gemma":[0.1297079,0.0000377016,0.8691267,0.0008629067,0.0001569817,0.00003567529,0.00003819007,0.00001385373,0.00002006554],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1291043,"threshold_uncertainty_score":0.4809244,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4246097035","doi":"10.23952/jano.3.2021.2.05","title":"Approximate solutions of quasi-equilibrium problems: Lipschitz dependence of solutions on parameters","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Material Science and Thermodynamics","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Lipschitz continuity; Mathematics; Applied mathematics; Thermodynamics; Mathematical analysis; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01404804880562961,"gpt":0.2034332996729456,"spread":0.189385250867316,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001683941,0.00007622255,0.0002119134,0.00006371112,0.00003486291,0.00001694235,0.00007565054,0.00005121528,0.00002471504],"category_scores_gemma":[0.00002160562,0.00006623242,0.00004737466,0.0002143847,0.00005305658,0.000111399,0.00002421775,0.00008836151,4.252047e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000209789,"about_ca_system_score_gemma":0.00003310115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002589334,"about_ca_topic_score_gemma":4.072562e-7,"domain_scores_codex":[0.9992327,0.00001512425,0.0003683565,0.00007494746,0.0001712758,0.0001375855],"domain_scores_gemma":[0.999565,0.0000370123,0.0001723203,0.00008025837,0.00008308214,0.00006230274],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002538946,0.00008213071,0.000007669652,0.00004823951,0.00001989247,8.774089e-7,0.000120862,0.9556182,0.03784414,0.005019537,0.000007640525,0.001205433],"study_design_scores_gemma":[0.0002789633,0.0001481816,0.00008041328,0.00006708873,0.0000326332,0.00001775565,0.0001056817,0.9859735,0.01011404,0.003063469,0.00002398521,0.00009426215],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1353997,0.0001245388,0.8613826,0.00007227372,0.0001722328,0.00008882939,0.00001034723,0.00001771807,0.002731767],"genre_scores_gemma":[0.9777484,0.0001881376,0.02201517,0.0000117162,0.00002032099,0.00000209034,0.000003886622,0.00000825699,0.000002050541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8423487,"threshold_uncertainty_score":0.270088,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Duality (order theory); Set (abstract data type); Mathematical optimization; Mathematics; Computer science; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.01095450819081421,"gpt":0.2360023193427086,"spread":0.2250478111518944,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004792884,0.0001698061,0.0003616166,0.0001594709,0.0001651155,0.0002116381,0.0001594663,0.00009062275,0.00008765887],"category_scores_gemma":[0.0000387832,0.0001331041,0.00006347476,0.0003950393,0.0000916299,0.0006266314,0.0000507338,0.0001205168,0.000001607371],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003537633,"about_ca_system_score_gemma":0.000097223,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001900112,"about_ca_topic_score_gemma":2.308841e-7,"domain_scores_codex":[0.9986281,0.00005501033,0.0005303879,0.0002971161,0.0003168481,0.0001724889],"domain_scores_gemma":[0.9984347,0.000179781,0.0005816247,0.0001520915,0.0004874676,0.000164376],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00008452438,0.00008061517,0.0003375579,0.000029422,0.00008493578,5.66256e-7,0.0002147225,0.9638174,0.00005586397,0.03455364,0.00006746569,0.0006732789],"study_design_scores_gemma":[0.001688758,0.000251687,0.0009608305,0.00002306267,0.00007831019,0.00003926469,0.00008351979,0.9952216,0.00006528005,0.001213101,0.0001816168,0.0001929279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002154806,0.0000240472,0.9953325,0.001121928,0.00008085137,0.0003892758,0.00002103764,0.0000289524,0.0008466031],"genre_scores_gemma":[0.4400652,0.0000548029,0.5594509,0.0002891103,0.00003528181,0.00001257581,0.00005664633,0.00001009867,0.0000253854],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4379103,"threshold_uncertainty_score":0.5427828,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285299972","doi":"10.23952/jano.4.2022.2.08","title":"Adaptive modified inertial projection and contraction methods for pseudomonotone variational inequalities","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Contact Mechanics and Variational Inequalities","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"China Scholarship Council","keywords":"Inertial frame of reference; Variational inequality; Contraction (grammar); Mathematics; Applied mathematics; Mathematical analysis; Computer science; Physics; Classical mechanics; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.03312964160466782,"gpt":0.30382299757392,"spread":0.2706933559692521,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001174099,0.00008741095,0.0001973056,0.000147034,0.000261098,0.00009099292,0.00009335022,0.00003548888,0.00001012072],"category_scores_gemma":[0.00007646478,0.00008089082,0.00004094765,0.0001527845,0.000006423093,0.0003577294,0.00007436346,0.0001344404,3.975691e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006761109,"about_ca_system_score_gemma":0.00009165058,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000015943,"about_ca_topic_score_gemma":1.193898e-7,"domain_scores_codex":[0.9990333,0.00013594,0.0003878124,0.0001449472,0.0002022467,0.00009573756],"domain_scores_gemma":[0.998791,0.0004720161,0.000439062,0.00005318479,0.0001932079,0.00005152188],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0004463753,0.00006614174,0.00000183556,0.000006808073,0.00004064412,2.858333e-7,0.0008520451,0.1327434,0.001391082,0.8465623,0.00002446788,0.01786467],"study_design_scores_gemma":[0.0008855035,0.0004286162,0.00006219517,0.000002498871,0.00002266681,0.00003063742,0.0002503757,0.9584159,0.00022411,0.03905337,0.0005289724,0.00009513136],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005133873,0.00006336065,0.9980826,0.0006853952,0.000298219,0.0002192669,0.000007154308,0.00001645216,0.0001141077],"genre_scores_gemma":[0.5179263,0.00002500275,0.4816656,0.0001825115,0.0001161667,0.00005421378,0.00000769662,0.000005488954,0.00001701763],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8256725,"threshold_uncertainty_score":0.3298632,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4285242070","doi":"10.23952/jano.4.2022.2.05","title":"Point-to-set distance functions for output-constrained neural networks","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Set (abstract data type); Artificial neural network; Point (geometry); Set point; Computer science; Mathematics; Artificial intelligence; Geometry; Engineering; Control engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.01113572001804153,"gpt":0.2256658296341659,"spread":0.2145301096161243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001894287,0.00009473763,0.000172655,0.00007143986,0.0003800115,0.00009271465,0.000275607,0.00002215171,0.0000148235],"category_scores_gemma":[0.000009796874,0.00008426078,0.00008259754,0.0004341324,0.00002132936,0.0001581794,0.000108077,0.0001771208,3.975131e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000316872,"about_ca_system_score_gemma":0.00002175794,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.637974e-7,"about_ca_topic_score_gemma":9.039442e-8,"domain_scores_codex":[0.9991338,0.0000201649,0.000323322,0.0001835656,0.000168524,0.0001706021],"domain_scores_gemma":[0.9993017,0.0001114726,0.0002357311,0.0001314925,0.00007701083,0.0001426067],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007007855,0.00004043646,0.00001034303,0.000001687883,0.00001038986,9.712226e-7,0.00005841832,0.961688,0.0000262392,0.01493176,0.002958257,0.02020335],"study_design_scores_gemma":[0.0003942868,0.0002330422,0.00005287533,0.000001990777,0.00001467126,0.00003691521,0.00005618407,0.9866509,0.00000526663,0.001004961,0.01144826,0.0001006737],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004856334,0.00005383584,0.995227,0.003480257,0.0002615442,0.0002506312,0.000008915647,0.00002647414,0.0002056584],"genre_scores_gemma":[0.8866242,0.0000107371,0.111785,0.00123475,0.0001934959,0.00007006601,0.00001136918,0.000009802526,0.00006056702],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8861386,"threshold_uncertainty_score":0.3436055,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4248646680","doi":"10.23952/jano.2.2020.1.01","title":"A special issue focused on superiorization versus constrained optimization: analysis and applications","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Computer science; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.01826649990284673,"gpt":0.2627202259413634,"spread":0.2444537260385167,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002474529,0.0001773563,0.0004186042,0.0003618693,0.0001768259,0.0002984292,0.0002977693,0.0000922968,0.0002684752],"category_scores_gemma":[0.0001739535,0.0001612517,0.00007616816,0.001996506,0.00009325193,0.0003441464,0.00009375289,0.000208144,0.000005695111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003627342,"about_ca_system_score_gemma":0.00009566705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.502928e-7,"about_ca_topic_score_gemma":6.883361e-8,"domain_scores_codex":[0.9982753,0.00007486086,0.0005810381,0.0003563776,0.0005312463,0.000181195],"domain_scores_gemma":[0.9985106,0.0002365854,0.0003699964,0.0001772502,0.0003398505,0.0003657197],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002533699,0.00006113631,0.00002135405,0.00001059012,0.0001532859,0.000003869939,0.0002993189,0.9569607,0.00001498844,0.007303031,0.000206832,0.03471147],"study_design_scores_gemma":[0.001693028,0.0003691934,0.00005250962,0.000003827942,0.0001521466,0.000005161711,0.00005078466,0.9937484,0.00007193038,0.00006590209,0.003626805,0.0001602769],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002591707,0.00002549852,0.9931126,0.002521423,0.0001354838,0.0002875742,0.000005140959,0.00003895691,0.0038474],"genre_scores_gemma":[0.02434652,0.0003656738,0.9721754,0.0006227196,0.002399256,0.00001928258,0.00002952063,0.00002116817,0.00002044233],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03678768,"threshold_uncertainty_score":0.6575652,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4251102484","doi":"10.23952/jano.3.2021.1.03","title":"Data-compatibility of algorithms for constrained convex optimization","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"Israel Science Foundation; National Natural Science Foundation of China","keywords":"Compatibility (geochemistry); Algorithm; Regular polygon; Mathematical optimization; Computer science; Convex optimization; Mathematics; Materials science; Geometry; Composite material","retraction":null,"screen_n_in":null,"score":{"opus":0.09222090177705922,"gpt":0.3793088991012824,"spread":0.2870879973242232,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007125672,0.0001532385,0.0005708952,0.0001180522,0.00008705846,0.00004115369,0.0002209945,0.0001098351,0.0001747477],"category_scores_gemma":[0.001265927,0.0001376976,0.00007191883,0.0003734596,0.0001360329,0.0003057136,0.0001051771,0.0001752326,2.594856e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004335535,"about_ca_system_score_gemma":0.0002298634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.555432e-7,"about_ca_topic_score_gemma":1.631728e-7,"domain_scores_codex":[0.9980893,0.00006862567,0.0009649709,0.0002740394,0.00041699,0.000186055],"domain_scores_gemma":[0.9966587,0.0007939214,0.0007991584,0.0003387289,0.001266365,0.0001430806],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002480134,0.0002995234,0.00001735335,0.0001319712,0.00008833467,0.00000328922,0.0001241615,0.9866617,0.0002485264,0.004619351,0.0002464123,0.007311378],"study_design_scores_gemma":[0.001858032,0.0001325203,0.000009506036,0.00003135366,0.00008339093,0.00003281199,0.0002776664,0.9886332,0.001737551,0.006825592,0.0002434115,0.0001349641],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002482758,0.0000929903,0.9983275,0.0002678543,0.00009557277,0.0003370004,0.0001077313,0.00001718043,0.0005059143],"genre_scores_gemma":[0.02120203,0.0002039068,0.9781974,0.00005741021,0.0001013137,0.000006758974,0.0001710831,0.00002884798,0.00003127485],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02095375,"threshold_uncertainty_score":0.5615144,"prediction_status":"machine_predicted_unvalidated"},"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,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"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","retraction":null,"screen_n_in":null,"score":{"opus":0.01580478980916792,"gpt":0.2717489569966035,"spread":0.2559441671874356,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007528643,0.0001193982,0.0003525662,0.00005820605,0.0001439544,0.00008558819,0.0002620996,0.00004579031,0.000004190196],"category_scores_gemma":[0.0002980902,0.00007202628,0.000140139,0.0003505569,0.00003093298,0.000110758,0.00003846074,0.0001029575,7.270648e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000265436,"about_ca_system_score_gemma":0.00004113737,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001145242,"about_ca_topic_score_gemma":9.771573e-8,"domain_scores_codex":[0.9987513,0.000122835,0.0005312389,0.0001953283,0.0002822723,0.0001170173],"domain_scores_gemma":[0.9980579,0.0009063235,0.0005849029,0.0001287236,0.0001844308,0.0001376906],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006761312,0.0001409277,0.0001193322,0.00005877097,0.00007716975,5.753523e-7,0.0004781938,0.9605634,0.0001939973,0.0171068,0.00006666577,0.02051806],"study_design_scores_gemma":[0.0009432227,0.002203947,0.0001204359,0.000009975327,0.00006708558,0.000003085797,0.0000113834,0.9949875,0.0004923574,0.0008496872,0.0002335753,0.0000777644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005152154,0.00003503753,0.9963451,0.002618566,0.00006459516,0.0003105004,0.000002478346,0.00001166386,0.00009682645],"genre_scores_gemma":[0.6805698,0.00003773346,0.3189271,0.0003667934,0.00006763263,0.00001495626,0.000003075174,0.000007798699,0.000005128219],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6800545,"threshold_uncertainty_score":0.2937147,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4318332875","doi":"10.23952/jano.5.2023.1.02","title":"A unified approach to Bishop-Phelps and scalarizing functionals","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Algebra and Logic","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Mathematical economics; Mathematics; Philosophy; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01626160390568936,"gpt":0.2287648424734166,"spread":0.2125032385677272,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002218485,0.00008282076,0.0001669664,0.000166415,0.0001033712,0.00009366793,0.0001286749,0.00004202694,0.000002601563],"category_scores_gemma":[0.00002957834,0.00006469148,0.00002470941,0.000642862,0.00001998031,0.0002460712,0.00009536751,0.0001052107,0.000003668779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001210344,"about_ca_system_score_gemma":0.00001881267,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.135692e-7,"about_ca_topic_score_gemma":9.832233e-9,"domain_scores_codex":[0.9992673,0.00001589633,0.0002255513,0.000166247,0.0001909795,0.0001340579],"domain_scores_gemma":[0.9995216,0.00006837035,0.0001220833,0.00007774294,0.0000646495,0.0001455114],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007642877,0.00006798242,0.00007231764,0.00001595052,0.00002410152,0.000005725142,0.0005508041,0.8625305,0.001055114,0.09175079,0.0004905104,0.04335974],"study_design_scores_gemma":[0.000812677,0.0002432307,0.003213415,0.00001985053,0.00001880601,0.00009291991,0.0002407414,0.9715802,0.0002198508,0.02114172,0.002166074,0.0002505232],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004172199,0.00004518747,0.9928064,0.0007171743,0.00008427504,0.00007674324,3.777459e-7,0.00004314276,0.00205447],"genre_scores_gemma":[0.5871515,0.0000933519,0.4120204,0.0005874072,0.00009521078,0.00000442175,0.000002253641,0.000007283238,0.00003812626],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5829793,"threshold_uncertainty_score":0.2638042,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4233258680","doi":"10.23952/jano.1.2019.2.07","title":"Best approximation, optimal recovery, and Landau inequalities for derivatives of Hukuhara-type in function L-spaces","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Approximation Theory and Sequence Spaces","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false},"ca_institutions":"","funders":"","keywords":"Type (biology); Mathematics; Function (biology); Inequality; Applied mathematics; Pure mathematics; Mathematical analysis; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.025284881621858,"gpt":0.2759672081700278,"spread":0.2506823265481699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004672989,0.00009757415,0.0003144459,0.0001296456,0.00003663961,0.00003168128,0.00004544624,0.00006311401,0.00002809707],"category_scores_gemma":[0.0001668084,0.00007790656,0.0000298411,0.0001465331,0.00005105936,0.0003085361,0.00001460103,0.00008171724,4.004278e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001567394,"about_ca_system_score_gemma":0.00002903948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001169582,"about_ca_topic_score_gemma":2.144811e-7,"domain_scores_codex":[0.9991939,0.00003864439,0.000445653,0.000100881,0.0001320997,0.00008883481],"domain_scores_gemma":[0.9988553,0.0003586987,0.0005302582,0.0000551166,0.0001653168,0.00003531091],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.008572146,0.000613621,0.003594249,0.001799665,0.0002297147,0.000001163512,0.01256044,0.3554429,0.008843489,0.6001133,0.000203144,0.008026223],"study_design_scores_gemma":[0.007250077,0.004969196,0.0009679024,0.0007522242,0.0002399417,0.00004779877,0.02617341,0.326597,0.01245368,0.619197,0.0005807725,0.0007710518],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.52882,0.00007751879,0.470275,0.0001284538,0.0000512381,0.0002569502,0.000003545358,0.000005772557,0.0003814957],"genre_scores_gemma":[0.8553646,0.0001211422,0.1443646,0.0000284095,0.0000390491,0.000006482419,0.00000815713,0.00001092452,0.00005663098],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3265446,"threshold_uncertainty_score":0.3176937,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}