{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Akshay Agrawal","is_ca":false},{"name":"Shane Barratt","is_ca":false},{"name":"Stephen Boyd","is_ca":false},{"name":"Enzo Busseti","is_ca":false},{"name":"Walaa M. Moursi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00168488,0.0008736794,0.0008277214,0.0007756933,0.0007204548,0.002235014,0.001262022,0.0009140365,0.007473139],"category_scores_gemma":[0.005503934,0.0004569081,0.0009415954,0.0006499215,0.001623278,0.002074389,0.002024387,0.002150046,0.001749806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001046451,"about_ca_system_score_gemma":0.00216651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004684903,"about_ca_topic_score_gemma":0.004343246,"domain_scores_codex":[0.9991317,0.0001613437,0.0000368117,0.0001640959,0.0003933178,0.0001127754],"domain_scores_gemma":[0.9981717,0.0008461788,0.0001334064,0.0001833182,0.0005163298,0.0001491444],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002038498,0.0002058634,0.003226089,0.0004263752,0.00005914348,0.000493144,0.0005133949,0.4496269,0.01407646,0.3809643,0.00965823,0.1405462],"study_design_scores_gemma":[0.00001357898,0.00003573632,0.0001537134,0.00003243413,0.000006725076,0.00008282458,0.00005300398,0.9227651,0.00359859,0.06738114,0.005863253,0.00001381458],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01546936,0.00008929701,0.9764822,0.0002233368,0.00005647371,0.00005001839,0.0001186195,0.0008003659,0.006710283],"genre_scores_gemma":[0.2177183,0.0002815724,0.7674885,0.0003100608,0.00007559716,0.0001930739,0.0004515204,0.001681738,0.01179962],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007473139,"threshold_uncertainty_score":0.02500015,"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","authors":[{"name":"Wataru Yata","is_ca":false},{"name":"Masao Yamagishi","is_ca":false},{"name":"Isao Yamada","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001178372,0.0007251142,0.0008882505,0.0004445608,0.0003660898,0.0008922211,0.001598075,0.001731853,0.003634113],"category_scores_gemma":[0.00288949,0.0004245152,0.0008384203,0.0005662924,0.001262107,0.001780504,0.002059441,0.001896096,0.0007490413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005723892,"about_ca_system_score_gemma":0.0008105982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00166308,"about_ca_topic_score_gemma":0.00143467,"domain_scores_codex":[0.9994624,0.0002088224,0.00001996659,0.0001151979,0.0001429884,0.00005057354],"domain_scores_gemma":[0.9993741,0.0003382309,0.0000645523,0.00006835315,0.0001086829,0.00004614441],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009799179,0.00004067324,0.0004513032,0.0001003779,0.00003823427,0.0001126772,0.0001163149,0.7801265,0.004443186,0.1705195,0.002421717,0.04153147],"study_design_scores_gemma":[0.000007088554,0.00002530209,0.00004407202,0.000005253397,0.000003787241,0.00002160663,0.000006542243,0.9851893,0.0003926149,0.01343649,0.0008601692,0.000007812571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002594902,0.00006891742,0.9960511,0.0001544195,0.00001262035,0.00001499374,0.00002703583,0.00004198074,0.001033916],"genre_scores_gemma":[0.433717,0.000526658,0.5520485,0.0004913001,0.00009861959,0.0003782925,0.0003509088,0.0001753734,0.01221343],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003634113,"threshold_uncertainty_score":0.01215738,"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","authors":[{"name":"Yair Censor","is_ca":false},{"name":"Stefania Petra","is_ca":false},{"name":"Christoph Schn Örr","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003405277,0.0009739854,0.001238354,0.0006178793,0.0002678217,0.001071075,0.0008980197,0.001136938,0.002558468],"category_scores_gemma":[0.009040963,0.000415392,0.0009082041,0.0006659847,0.001586415,0.00167979,0.002090913,0.001860103,0.0004721313],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004908377,"about_ca_system_score_gemma":0.001410404,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001318265,"about_ca_topic_score_gemma":0.0008802582,"domain_scores_codex":[0.9982894,0.0007451659,0.00007516634,0.0002290454,0.000517202,0.0001439086],"domain_scores_gemma":[0.9963574,0.002117036,0.0003066436,0.0006263828,0.0004936474,0.00009888043],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003771202,0.0001033384,0.000836556,0.0004363121,0.0001177337,0.000239983,0.0001577926,0.7824765,0.01283553,0.09561526,0.002999444,0.1038045],"study_design_scores_gemma":[0.00001363172,0.00007592589,0.00009064782,0.00001628103,0.00001205442,0.00006416207,0.00001419761,0.9861732,0.00361663,0.008636458,0.001278528,0.000008258818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01288984,0.0005707216,0.9835157,0.0002568355,0.00004174045,0.00003810713,0.00003015673,0.0001813505,0.002475583],"genre_scores_gemma":[0.4642552,0.001034445,0.5307994,0.0002899801,0.0001361212,0.0001595682,0.0001695484,0.0002515102,0.002904227],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003405277,"threshold_uncertainty_score":0.01800901,"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","authors":[{"name":"Lu-Chuan Ceng","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001033861,0.001379138,0.001406206,0.0007765926,0.0004869273,0.001014516,0.00186161,0.001345544,0.003949044],"category_scores_gemma":[0.003154737,0.0005717057,0.0007688697,0.0006765472,0.0008255057,0.002208347,0.001754157,0.002197952,0.0007169682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006636613,"about_ca_system_score_gemma":0.001220022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002117756,"about_ca_topic_score_gemma":0.002554063,"domain_scores_codex":[0.9995133,0.0001566919,0.00003634848,0.00008650106,0.0001494254,0.00005774651],"domain_scores_gemma":[0.9994061,0.0002560522,0.00006561425,0.00005597569,0.0001496859,0.00006661416],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0005035381,0.0002495217,0.0007456882,0.000517528,0.0001292663,0.0002377209,0.0003030937,0.5498899,0.008780605,0.1750907,0.005918453,0.2576341],"study_design_scores_gemma":[0.00003041592,0.00008469794,0.00007135247,0.00001191586,0.000006227401,0.00003150155,0.00001362207,0.9896209,0.0007783227,0.00806089,0.001279167,0.00001092126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004987088,0.0002168736,0.9930707,0.0001001264,0.00005486485,0.00004222332,0.00001964322,0.0001011127,0.001407283],"genre_scores_gemma":[0.2608502,0.0005708823,0.7309748,0.0002172789,0.0001509552,0.0004619734,0.0002737565,0.0002318834,0.006268188],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003949044,"threshold_uncertainty_score":0.01321089,"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","authors":[{"name":"Lu-Chuan Ceng","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002756669,0.0009945896,0.001326224,0.001354749,0.0006739284,0.001810141,0.001839344,0.002245273,0.001973861],"category_scores_gemma":[0.005833096,0.0005846725,0.001606357,0.0006122788,0.002586388,0.002639113,0.004664162,0.002298306,0.0003108694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009449013,"about_ca_system_score_gemma":0.001339814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001247815,"about_ca_topic_score_gemma":0.0008943353,"domain_scores_codex":[0.9991263,0.0002805241,0.00004609655,0.0001807252,0.0002741107,0.00009233253],"domain_scores_gemma":[0.9985657,0.0006676167,0.0002161413,0.0001123806,0.0002564579,0.0001817234],"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.0001614305,0.00009700042,0.001212755,0.0002028337,0.0001123676,0.0004854042,0.0006009249,0.3642237,0.01154803,0.5919924,0.0007334332,0.02862965],"study_design_scores_gemma":[0.000007605718,0.00005400455,0.00005668405,0.00001622938,0.000008153233,0.0000699685,0.00005156257,0.9618039,0.001692001,0.03555431,0.000675433,0.00001011401],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02437095,0.00008825697,0.9738833,0.00008349995,0.00002148354,0.00002743774,0.000007328362,0.00002693046,0.001490754],"genre_scores_gemma":[0.5908589,0.0002640571,0.4018122,0.00007063829,0.00004327848,0.0002530686,0.00006793418,0.00008551807,0.00654442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002756669,"threshold_uncertainty_score":0.01457882,"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","authors":[{"name":"Dushmanta Sahu","is_ca":false},{"name":"Feeroz Babu","is_ca":false},{"name":"Shikher Sharma","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001413379,0.0008405357,0.0007980867,0.001244966,0.0005363267,0.0007433674,0.001076849,0.001139016,0.002335094],"category_scores_gemma":[0.004292413,0.0003981846,0.00133859,0.0007088167,0.001825231,0.001823367,0.002033372,0.00186692,0.000593468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005838536,"about_ca_system_score_gemma":0.0006941325,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001206483,"about_ca_topic_score_gemma":0.0008178509,"domain_scores_codex":[0.9993793,0.0002838348,0.0000505632,0.00008764485,0.0001625676,0.00003603691],"domain_scores_gemma":[0.9989009,0.0005694309,0.00007603267,0.0001354497,0.00026659,0.00005153712],"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.00007605651,0.0000508515,0.000649842,0.0003816211,0.00007186978,0.0002562491,0.0004456712,0.1963166,0.01484814,0.6639591,0.001739996,0.121204],"study_design_scores_gemma":[0.00001593601,0.00008997695,0.0001573858,0.00004526103,0.000009835995,0.0001833318,0.00004305341,0.8653429,0.004234375,0.1223983,0.007448439,0.00003114251],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004515738,0.0004859312,0.992099,0.0001428257,0.00005583457,0.00002444511,0.00000836676,0.0000665227,0.00260123],"genre_scores_gemma":[0.20126,0.001216932,0.7906084,0.0001680983,0.0001104419,0.0001675724,0.00004651515,0.0001069405,0.006315078],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002335094,"threshold_uncertainty_score":0.007811666,"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","authors":[{"name":"Mohammad Farid","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001435626,0.0009243129,0.0009070984,0.0005671046,0.0003464767,0.0005312164,0.0009888154,0.000879341,0.001245166],"category_scores_gemma":[0.001425603,0.0003381502,0.0008599348,0.0003744588,0.0008075009,0.001309056,0.001313048,0.001480263,0.0002964584],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004756518,"about_ca_system_score_gemma":0.0009298052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001398193,"about_ca_topic_score_gemma":0.001272002,"domain_scores_codex":[0.9995022,0.0002354087,0.00002839196,0.00005170164,0.0001538756,0.00002846962],"domain_scores_gemma":[0.9996874,0.0001328966,0.00003516817,0.00003031374,0.00008163459,0.00003259284],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001533646,0.0001115568,0.001061626,0.000591229,0.0002112529,0.0002445632,0.0003516619,0.4756668,0.02867888,0.3511975,0.001687164,0.1400443],"study_design_scores_gemma":[0.0000114021,0.0000779943,0.00008325159,0.00001510982,0.000009992071,0.00004191749,0.00001315414,0.9804236,0.001924965,0.01539561,0.001992961,0.00001010548],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003945923,0.0002442212,0.9949167,0.00005473442,0.00002847956,0.00002620215,0.000006908743,0.00003933191,0.0007375433],"genre_scores_gemma":[0.2562065,0.0007316021,0.7379999,0.0001386196,0.00007696028,0.0002793167,0.00007016649,0.00009283288,0.004404134],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001435626,"threshold_uncertainty_score":0.00759238,"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","authors":[{"name":"Ngoc T. Hoang","is_ca":false},{"name":"B. Nguyen Thai","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002905195,0.001391036,0.001061517,0.001106542,0.0005808386,0.0009791711,0.001566533,0.001288685,0.003653099],"category_scores_gemma":[0.006247946,0.0005379351,0.001058946,0.0004255196,0.001676135,0.001950451,0.003050904,0.001877559,0.0008147967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000568781,"about_ca_system_score_gemma":0.001061575,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001580228,"about_ca_topic_score_gemma":0.0009984329,"domain_scores_codex":[0.9988897,0.0004616251,0.00006533376,0.0001404236,0.000349327,0.00009342668],"domain_scores_gemma":[0.9987028,0.0006888203,0.0001506507,0.0001105261,0.0002474414,0.00009984054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002433217,0.0001072047,0.0006807424,0.0003796513,0.00008145031,0.0001262553,0.0003227172,0.4969395,0.007289221,0.415322,0.00218469,0.07632325],"study_design_scores_gemma":[0.00002698302,0.0001375858,0.0001187764,0.00002409501,0.000007209097,0.00003139158,0.0000222633,0.9738429,0.001202245,0.02194186,0.002627679,0.00001698733],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004517928,0.0001505511,0.9930121,0.00007226645,0.0000381922,0.0000374562,0.00001234368,0.00006178777,0.002097322],"genre_scores_gemma":[0.2810183,0.0009579281,0.7053869,0.0002701336,0.0002821337,0.0007714924,0.0002781973,0.0003061423,0.0107288],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003653099,"threshold_uncertainty_score":0.01536429,"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","authors":[{"name":"Patrizia Daniele","is_ca":false},{"name":"Daniele Sciacca","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005029418,0.0006525711,0.0006788604,0.0005534152,0.0007982654,0.00145946,0.001024607,0.001971865,0.005284644],"category_scores_gemma":[0.001188246,0.0004624069,0.0006644939,0.0008420597,0.001054694,0.001655929,0.001059307,0.001135393,0.0002331174],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001982195,"about_ca_system_score_gemma":0.001517614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01795677,"about_ca_topic_score_gemma":0.0102789,"domain_scores_codex":[0.9996804,0.0001184953,0.000009701655,0.00009930431,0.00004019104,0.00005203488],"domain_scores_gemma":[0.9996939,0.0001394545,0.00006400492,0.00001170138,0.00004722592,0.00004386724],"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.00002016724,0.000009302297,0.0003519573,0.00001841137,0.000008124526,0.0001254177,0.00002115478,0.9821997,0.0003371669,0.01565577,0.0002292603,0.001023558],"study_design_scores_gemma":[0.00000902744,0.00001567335,0.0001430706,0.000005814291,0.000006269857,0.00002446519,0.00003304911,0.9920442,0.00006560913,0.007130646,0.000513631,0.000008440041],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2539226,0.0009273685,0.7187254,0.002279436,0.0001160714,0.0001294645,0.001027838,0.0001684924,0.02270333],"genre_scores_gemma":[0.9589185,0.0007039015,0.02943137,0.0000975405,0.00003567367,0.0001968962,0.0003645528,0.0000296472,0.01022195],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01795677,"threshold_uncertainty_score":0.03570449,"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","authors":[{"name":"Alexander Matrosov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005816509,0.003258309,0.001755283,0.002675015,0.0009366531,0.002279322,0.001015303,0.002754752,0.005213086],"category_scores_gemma":[0.01242191,0.0008573369,0.00209937,0.001678751,0.003159141,0.002566983,0.003359124,0.004534099,0.001356725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001431339,"about_ca_system_score_gemma":0.002485034,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002369814,"about_ca_topic_score_gemma":0.001837955,"domain_scores_codex":[0.9984213,0.0006165344,0.0001040338,0.0003043943,0.0003685732,0.0001851794],"domain_scores_gemma":[0.991912,0.00593808,0.0005375111,0.0002045114,0.001182773,0.0002250653],"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.0001336621,0.00009431397,0.0006991806,0.0008117485,0.00007454889,0.0003755293,0.0002753982,0.3157558,0.005206747,0.6326498,0.01083939,0.03308389],"study_design_scores_gemma":[0.00005397037,0.0002143277,0.0005305113,0.0003155321,0.00005169769,0.0001808013,0.0001446545,0.6918761,0.002630514,0.2913936,0.01254043,0.00006800129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009136016,0.002022818,0.9680994,0.0009490666,0.0002144762,0.0001465193,0.0003150892,0.0001015884,0.01901512],"genre_scores_gemma":[0.4571192,0.00882562,0.509023,0.002073514,0.0009489588,0.001840367,0.002034032,0.0009397627,0.01719547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005816509,"threshold_uncertainty_score":0.030761,"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","authors":[{"name":"Bing Tan","is_ca":false},{"name":"Sun Young Cho","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001465628,0.0008192647,0.0008742164,0.000797757,0.0005921428,0.0006497221,0.001403489,0.001404559,0.002652709],"category_scores_gemma":[0.002994009,0.0003527487,0.0008087083,0.0005693465,0.00109007,0.001981751,0.001534672,0.001959849,0.0005396858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005180447,"about_ca_system_score_gemma":0.001043965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008457159,"about_ca_topic_score_gemma":0.0009249142,"domain_scores_codex":[0.9995058,0.00015414,0.00003551984,0.0001099773,0.0001541611,0.0000404059],"domain_scores_gemma":[0.9993716,0.0002923931,0.00007168567,0.00007398562,0.0001370662,0.00005318272],"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.0001694227,0.0001128892,0.0009444719,0.0002428322,0.00008177898,0.0001887363,0.0002990512,0.3069506,0.0156877,0.4699448,0.002032181,0.2033457],"study_design_scores_gemma":[0.00001488284,0.000132163,0.00008192679,0.00001604682,0.000008190518,0.00007469969,0.00001729515,0.952835,0.002779989,0.04174645,0.002275557,0.00001774688],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004254078,0.00005282471,0.9950089,0.00003973036,0.00002224547,0.00002578683,0.000005115849,0.00005422087,0.0005370791],"genre_scores_gemma":[0.1720425,0.0002141148,0.8231083,0.0001155126,0.0000803725,0.0002818528,0.00009270469,0.00009397734,0.003970502],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002652709,"threshold_uncertainty_score":0.008874178,"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","authors":[{"name":"Lê Thanh Tùng","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002876382,0.001642428,0.001147134,0.0008366793,0.0004961854,0.001623704,0.0009847155,0.001287968,0.003933574],"category_scores_gemma":[0.006840003,0.0005068134,0.0008348054,0.0006205649,0.001747763,0.001983471,0.001481071,0.002520041,0.0005680291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008326295,"about_ca_system_score_gemma":0.001623053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008547772,"about_ca_topic_score_gemma":0.0009071485,"domain_scores_codex":[0.9988762,0.0004426282,0.00006845254,0.0001953056,0.0003155111,0.0001018227],"domain_scores_gemma":[0.9974184,0.001663479,0.0002358952,0.00009623872,0.0004682861,0.0001176883],"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.00008006693,0.0001177318,0.0003866107,0.0003383083,0.00004851287,0.0003024093,0.0002241342,0.3749558,0.008855332,0.5908768,0.002717251,0.02109703],"study_design_scores_gemma":[0.00001708759,0.0000757224,0.0001572481,0.00003540917,0.00001115577,0.00008424178,0.00005472399,0.8625516,0.002419646,0.1330661,0.001505709,0.00002125812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01248084,0.0001550215,0.9800795,0.0001726976,0.00003764238,0.0000652194,0.00009103721,0.00005923486,0.006858849],"genre_scores_gemma":[0.6724275,0.0008011234,0.3136989,0.0002634533,0.00009078319,0.0008405964,0.0005254878,0.0002151608,0.01113692],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003933574,"threshold_uncertainty_score":0.01521194,"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","authors":[{"name":"Christian Ünther","is_ca":false},{"name":"Elisabeth Öbis","is_ca":false},{"name":"Nicolae Popovici","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001252213,0.000675849,0.0009859566,0.001142465,0.0005268619,0.00113452,0.001224655,0.0007181068,0.002273718],"category_scores_gemma":[0.003773448,0.000478585,0.001227523,0.000754881,0.001115286,0.001820693,0.0008957078,0.001382654,0.0004237484],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008795148,"about_ca_system_score_gemma":0.001042123,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001574171,"about_ca_topic_score_gemma":0.002363847,"domain_scores_codex":[0.9993628,0.0002089103,0.00003521776,0.0001160312,0.0001939001,0.00008308332],"domain_scores_gemma":[0.9984515,0.001096442,0.0001077087,0.0001299487,0.0001555074,0.00005880182],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003165487,0.0001441135,0.002197294,0.0003264887,0.00008799139,0.000109302,0.0004470985,0.6551838,0.009567526,0.1572277,0.001839962,0.1725522],"study_design_scores_gemma":[0.00001294713,0.00007851383,0.0002605565,0.00002341938,0.00001108373,0.00003782301,0.00005778375,0.9075113,0.005062106,0.08598172,0.0009505199,0.00001220846],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04058922,0.0001419312,0.9577938,0.0000824469,0.0000116377,0.00003367055,0.00006582348,0.0002442562,0.001037303],"genre_scores_gemma":[0.294782,0.0001749312,0.702555,0.00004833057,0.00002345581,0.0001873994,0.0003514179,0.0001805161,0.001696956],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002273718,"threshold_uncertainty_score":0.007606328,"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","authors":[{"name":"Didier Calogine","is_ca":false},{"name":"Oanh Chau","is_ca":false},{"name":"Philippe Lauret","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002688601,0.0007876479,0.0005911928,0.0004807402,0.0006416625,0.001336062,0.001110631,0.001525194,0.003522162],"category_scores_gemma":[0.0005747251,0.0003988441,0.0008840443,0.0007400926,0.0006907301,0.0008405276,0.0006472662,0.0009305084,0.0003754887],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001145632,"about_ca_system_score_gemma":0.0007618179,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01569858,"about_ca_topic_score_gemma":0.008833516,"domain_scores_codex":[0.9998389,0.0000499116,0.000007529331,0.0000347684,0.00003998419,0.00002893133],"domain_scores_gemma":[0.999866,0.00005782532,0.00002625982,0.00000973524,0.00002866959,0.00001151538],"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.00001164311,0.00001060117,0.0001796719,0.00001947015,0.000007801726,0.00008938325,0.00003774438,0.9872515,0.0008742784,0.009433058,0.0002629469,0.001821738],"study_design_scores_gemma":[0.000002033154,0.000007077345,0.00004796105,0.000002251295,0.000002909072,0.00001035826,0.00001124794,0.9975563,0.00008111427,0.001691584,0.0005845995,0.000002539236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04933202,0.0005302209,0.9139202,0.000572883,0.0001500769,0.00006386753,0.0003097666,0.0002715049,0.03484954],"genre_scores_gemma":[0.9360484,0.0006020861,0.04144689,0.0001139766,0.00005824451,0.0001444209,0.0001823339,0.00007587235,0.02132776],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01569858,"threshold_uncertainty_score":0.03121442,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001789435,0.001068624,0.001185975,0.002141824,0.0008057841,0.003904081,0.0008196079,0.001485592,0.09102228],"category_scores_gemma":[0.004556836,0.0003170759,0.0006651357,0.002026879,0.001590587,0.001801674,0.001954609,0.002542058,0.02675095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001291313,"about_ca_system_score_gemma":0.002276322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002238847,"about_ca_topic_score_gemma":0.002860187,"domain_scores_codex":[0.9982688,0.0004278644,0.0001381676,0.0001870394,0.0009098459,0.00006815929],"domain_scores_gemma":[0.9978426,0.000484537,0.0001207008,0.0004121865,0.0009791804,0.0001607796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00009781574,0.0001668505,0.0004568381,0.0006734576,0.00007623719,0.00006269767,0.00004822883,0.01574055,0.001285344,0.2324069,0.4001588,0.3488263],"study_design_scores_gemma":[0.0000299392,0.0000693445,0.001332592,0.0003655501,0.00003900312,0.0001754835,0.00004301968,0.04960742,0.001448596,0.1877305,0.7591279,0.00003071667],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"other","genre_scores_codex":[0.00373495,0.0448143,0.142898,0.01426596,0.0399504,0.0001406508,0.001714604,0.0008813365,0.7515999],"genre_scores_gemma":[0.0731267,0.03695337,0.04666436,0.001067316,0.01071026,0.0002235372,0.001738433,0.001470954,0.8280451],"genre_candidate":"other","genre_consensus":"other","teacher_disagreement_score":0.9089777,"threshold_uncertainty_score":0.3044999,"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","authors":[{"name":"Aviv Gibali","is_ca":false},{"name":"Nguyễn Ngọc Hà","is_ca":false},{"name":"Ngô Thị Song Thương","is_ca":false},{"name":"Trinh Trang","is_ca":false},{"name":"Nguyen Van Vinh","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001874185,0.0008208011,0.0009401916,0.0009322379,0.0004331673,0.0007265765,0.001109933,0.001274876,0.00261027],"category_scores_gemma":[0.00349256,0.0004350384,0.0006977345,0.001107129,0.001548345,0.001297606,0.00159847,0.002052059,0.0005468336],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005363789,"about_ca_system_score_gemma":0.001427283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002727133,"about_ca_topic_score_gemma":0.001840335,"domain_scores_codex":[0.9994181,0.0002524671,0.00002796255,0.00009670704,0.0001625722,0.00004208082],"domain_scores_gemma":[0.9991673,0.0004630803,0.00005420557,0.00005564375,0.0002060938,0.00005377205],"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.0001939479,0.00009787864,0.0006778249,0.000649241,0.0001017659,0.0001728463,0.0002255528,0.5193589,0.01032935,0.3481896,0.005037977,0.1149651],"study_design_scores_gemma":[0.00001227752,0.0000362895,0.00007527252,0.00001530813,0.000006189939,0.00003652477,0.00001329283,0.9783891,0.0008031336,0.01868406,0.001917498,0.00001095898],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003173231,0.0005362015,0.9941555,0.0001573744,0.00005170434,0.00002758564,0.00001643326,0.00004053732,0.001841388],"genre_scores_gemma":[0.2108358,0.001416801,0.7793324,0.0001938934,0.0001134517,0.0004235695,0.0001385269,0.0001835152,0.007362055],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002727133,"threshold_uncertainty_score":0.009911716,"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","authors":[{"name":"Lam Nguyen Hong Anh","is_ca":false},{"name":"Thanatporn Bantaojai","is_ca":false},{"name":"Duc Nguyen Minh","is_ca":false},{"name":"Tran Quoc Duy","is_ca":false},{"name":"Rabian Wangkeeree","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002461037,0.0009329057,0.0007771827,0.001593329,0.0008826635,0.00209691,0.0008980421,0.001438002,0.005152762],"category_scores_gemma":[0.01289098,0.0004570302,0.0008196571,0.000684084,0.002414436,0.002469217,0.003210939,0.00176678,0.0005763136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001326399,"about_ca_system_score_gemma":0.001188286,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001410907,"about_ca_topic_score_gemma":0.001011631,"domain_scores_codex":[0.9988117,0.0006124422,0.00006577709,0.0001451045,0.0002511538,0.0001139517],"domain_scores_gemma":[0.9976834,0.001557556,0.0002404979,0.00007095932,0.0003448026,0.0001027923],"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.00008778276,0.00003891649,0.0006071217,0.0002519432,0.00005388339,0.0001392238,0.0003862729,0.1351738,0.003536033,0.8481125,0.001025837,0.01058674],"study_design_scores_gemma":[0.00003129617,0.00008466445,0.0002488828,0.00009084625,0.00001032364,0.000100523,0.0004058791,0.5017161,0.002117199,0.4918984,0.00326875,0.00002707799],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1027978,0.001235941,0.8600933,0.001860941,0.0001233241,0.0001470849,0.0001537984,0.0001083398,0.03347943],"genre_scores_gemma":[0.8199133,0.002209993,0.1565016,0.0004490319,0.0001203454,0.0006355997,0.0003641618,0.0001643425,0.01964156],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005152762,"threshold_uncertainty_score":0.01723772,"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","authors":[{"name":"Shen-Shyang Ho","is_ca":false},{"name":"Matthew Schofield","is_ca":false},{"name":"Ning Wang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002360371,0.0009484835,0.001397619,0.000383584,0.0004071225,0.0009794674,0.001238343,0.001671097,0.002423738],"category_scores_gemma":[0.009146365,0.0004574609,0.0003981195,0.0003285097,0.001177936,0.001583022,0.001167972,0.001669977,0.0002453999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001339272,"about_ca_system_score_gemma":0.002092176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005203258,"about_ca_topic_score_gemma":0.003400755,"domain_scores_codex":[0.9988619,0.0005199236,0.00004720886,0.0002314905,0.0001563109,0.0001831583],"domain_scores_gemma":[0.9961188,0.002703422,0.0004353171,0.0001501032,0.000316404,0.0002759467],"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.0001646127,0.00008655935,0.0007821529,0.00005780785,0.00003266474,0.00009730579,0.00008695442,0.9734238,0.001199179,0.01132489,0.0005333578,0.01221076],"study_design_scores_gemma":[0.00001684711,0.00002350049,0.00007076914,0.000004820936,0.000004265039,0.00000910053,0.000008859832,0.9970717,0.0001888871,0.002461501,0.0001363473,0.000003422692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1002163,0.0003091177,0.8944426,0.0006310343,0.0000601279,0.0001478523,0.00005748864,0.0003281703,0.003807381],"genre_scores_gemma":[0.9658393,0.00007584754,0.0323044,0.00009748003,0.00001558987,0.00008900715,0.00002879839,0.00002829508,0.001521294],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005203258,"threshold_uncertainty_score":0.012483,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000745154,0.0006261513,0.0006573203,0.0004551985,0.0004335773,0.001094437,0.0006494803,0.001311685,0.002399816],"category_scores_gemma":[0.001270849,0.0002240935,0.0005759317,0.0004642779,0.001555032,0.001215041,0.001462487,0.001409992,0.0004662412],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009165914,"about_ca_system_score_gemma":0.001076136,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002489336,"about_ca_topic_score_gemma":0.001842034,"domain_scores_codex":[0.9997886,0.00006204305,0.000007222819,0.00003326374,0.00009002512,0.00001890422],"domain_scores_gemma":[0.9998577,0.00005326591,0.00001944798,0.00001431754,0.00003923636,0.00001611429],"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.00005498873,0.00003346016,0.0002429615,0.0001506783,0.00001872108,0.0001454901,0.0001459082,0.2488653,0.01161665,0.7085761,0.00219388,0.02795589],"study_design_scores_gemma":[0.00001286464,0.00004602378,0.0001946268,0.00002747165,0.000007598686,0.00006406983,0.0000250664,0.8865405,0.001069912,0.1067303,0.005259764,0.00002167501],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02167867,0.002207968,0.9495932,0.001013871,0.0002895313,0.00004515544,0.00007688683,0.00007474911,0.02501993],"genre_scores_gemma":[0.7882207,0.002537783,0.1730851,0.0004974387,0.0002914808,0.0002024122,0.0001617862,0.0002311368,0.03477224],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002489336,"threshold_uncertainty_score":0.00802815,"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","authors":[{"name":"Watcharaporn Cholamjiak","is_ca":false},{"name":"Suthep Suantai","is_ca":false},{"name":"Raweerote Suparatulatorn","is_ca":false},{"name":"Suparat Kesornprom","is_ca":false},{"name":"Prasit Cholamjiak","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002740392,0.001650494,0.001028545,0.001608715,0.0006130098,0.001449765,0.001372526,0.001930995,0.001125714],"category_scores_gemma":[0.007308501,0.0004833077,0.001414565,0.0006543239,0.002710235,0.002897814,0.002228917,0.002296891,0.0001894363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001137062,"about_ca_system_score_gemma":0.000732915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001287402,"about_ca_topic_score_gemma":0.0007260743,"domain_scores_codex":[0.9992587,0.0004213114,0.00003308635,0.00009627534,0.0001416802,0.00004899755],"domain_scores_gemma":[0.9969099,0.002328963,0.0002466288,0.0001010246,0.0002495962,0.0001639034],"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.0001261952,0.00005150582,0.0006978351,0.0002940217,0.0001021976,0.0002526414,0.0003377435,0.2822452,0.008796746,0.6868777,0.0005425747,0.01967574],"study_design_scores_gemma":[0.00001945836,0.00006744665,0.0001091031,0.00003102556,0.00001354678,0.00005506163,0.00004393335,0.8649692,0.001283534,0.1322854,0.00110486,0.00001739845],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01749666,0.0009099672,0.9794025,0.0003387792,0.00007774652,0.00003185688,0.00001304116,0.00003792041,0.001691454],"genre_scores_gemma":[0.5878159,0.002206855,0.4014392,0.0002832451,0.000186985,0.0003132604,0.00009438753,0.0001526969,0.007507496],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002740392,"threshold_uncertainty_score":0.01449281,"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","authors":[{"name":"Chinedu Izuchukwu","is_ca":false},{"name":"Yekini Shehu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001519559,0.0008338733,0.0007387833,0.0005174608,0.0004725021,0.0006516907,0.001089983,0.0009434479,0.002200619],"category_scores_gemma":[0.003450315,0.0003704334,0.0009552995,0.0005055392,0.0009761662,0.001336365,0.001672485,0.002488459,0.0004884497],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000341853,"about_ca_system_score_gemma":0.001111675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001278376,"about_ca_topic_score_gemma":0.001382469,"domain_scores_codex":[0.999438,0.000231118,0.00003892262,0.00006803703,0.0001876174,0.00003619586],"domain_scores_gemma":[0.9989918,0.0005783471,0.00007224759,0.0001119964,0.0001878263,0.00005778793],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001837671,0.0002006079,0.001175606,0.0005999164,0.000126463,0.0002053373,0.0004372188,0.461824,0.02479069,0.2835792,0.00253385,0.2243433],"study_design_scores_gemma":[0.00001410714,0.00005119648,0.00007561394,0.0000164133,0.000007947299,0.00003476697,0.00001119782,0.978035,0.001941614,0.01801196,0.001790344,0.000009762367],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004334548,0.0002257012,0.9935464,0.00007507043,0.00004196865,0.00003854696,0.00001035039,0.00008071637,0.001646762],"genre_scores_gemma":[0.1538029,0.0006718598,0.8409611,0.0001697612,0.0001248985,0.0003087135,0.00007663056,0.000150767,0.003733322],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002200619,"threshold_uncertainty_score":0.008036315,"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","authors":[{"name":"Shashi Kant Mishra","is_ca":false},{"name":"Rahul Kumar","is_ca":false},{"name":"Vivek Laha","is_ca":false},{"name":"Jitendra Kumar Maurya","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003236428,0.001511944,0.000915356,0.0008905936,0.0005762426,0.001866246,0.0008415659,0.001156298,0.002496364],"category_scores_gemma":[0.004500225,0.0005795573,0.001248282,0.0007433454,0.002397869,0.002285677,0.001748576,0.00285355,0.0004772084],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001475687,"about_ca_system_score_gemma":0.00163647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001298483,"about_ca_topic_score_gemma":0.001512382,"domain_scores_codex":[0.9988343,0.0005529909,0.0000589329,0.0001894261,0.0002644188,0.00009985521],"domain_scores_gemma":[0.9986116,0.0009333277,0.0001221254,0.00007425226,0.00019281,0.00006580607],"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.00004442146,0.00005639942,0.0002843862,0.0002039344,0.00004366417,0.0001226847,0.000177189,0.1897951,0.00389694,0.7895991,0.001333793,0.01444252],"study_design_scores_gemma":[0.0000219811,0.00008275068,0.0002181012,0.00005288473,0.00001495006,0.0000714958,0.00007219185,0.7120099,0.002800832,0.2806766,0.003954267,0.00002409528],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01380209,0.0003450654,0.9731988,0.0002890863,0.0000520862,0.00006384438,0.00006592619,0.00003338932,0.01214972],"genre_scores_gemma":[0.5912942,0.001682813,0.3872503,0.0004214002,0.0001603807,0.0005627328,0.0003611398,0.0002250325,0.01804203],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003236428,"threshold_uncertainty_score":0.01711607,"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","authors":[{"name":"Johannes Jahn","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001215001,0.001021603,0.001054763,0.001007564,0.0004489911,0.001563467,0.00102671,0.000703506,0.003182857],"category_scores_gemma":[0.001772326,0.0004587618,0.0009530082,0.001185005,0.001598529,0.00269505,0.001966926,0.002250466,0.00074282],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001260175,"about_ca_system_score_gemma":0.00101342,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009999775,"about_ca_topic_score_gemma":0.0009566848,"domain_scores_codex":[0.9989851,0.0004349238,0.00005889825,0.0001536729,0.0002970485,0.00007031961],"domain_scores_gemma":[0.9993784,0.0002640036,0.00007313184,0.00006984707,0.0001643189,0.00005025745],"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.00002771275,0.00003822838,0.0001522417,0.0002113514,0.00003326453,0.00005275275,0.00006962693,0.123421,0.004060563,0.8090913,0.002224576,0.06061736],"study_design_scores_gemma":[0.00000941561,0.00008237703,0.0001264928,0.00003626026,0.00001214315,0.00006225336,0.00003646976,0.6742695,0.001861668,0.3122116,0.01126736,0.00002440361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002825666,0.0007653342,0.9925883,0.0002019264,0.00008215467,0.00002480096,0.00002818602,0.00004684194,0.003436788],"genre_scores_gemma":[0.3812034,0.005448208,0.5792894,0.0004834605,0.0005086567,0.0005028683,0.0004463391,0.0003708633,0.03174688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003182857,"threshold_uncertainty_score":0.01064771,"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","authors":[{"name":"Hammed Anuoluwapo Abass","is_ca":false},{"name":"Chinedu Izuchukwu","is_ca":false},{"name":"Oluwatosin Temitope Mewomo","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002327411,0.0009146293,0.0008988262,0.0006657487,0.0007414575,0.0009838392,0.0008975599,0.001404232,0.003027944],"category_scores_gemma":[0.003533649,0.0003636173,0.0009838701,0.0004929082,0.002552853,0.002829167,0.002175352,0.002202843,0.000354205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007435009,"about_ca_system_score_gemma":0.0009287573,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001130422,"about_ca_topic_score_gemma":0.0008843481,"domain_scores_codex":[0.9991757,0.0003738629,0.00003816075,0.0001473089,0.0001978785,0.0000670974],"domain_scores_gemma":[0.999209,0.0004916695,0.00007209589,0.00004388122,0.0001275217,0.0000558187],"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.00004725335,0.00004446961,0.0003763095,0.0001708333,0.00003012674,0.0002511286,0.0004107696,0.2133348,0.00610711,0.7575756,0.0005653348,0.02108618],"study_design_scores_gemma":[0.0000218298,0.00008195114,0.0001415844,0.00002765212,0.000008871698,0.0001252745,0.0001371497,0.7454512,0.0019491,0.2498,0.002235179,0.00002020849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02148288,0.0002690605,0.9740081,0.0002166453,0.00003955417,0.00004183144,0.00001130291,0.00002493752,0.003905732],"genre_scores_gemma":[0.6079707,0.0007969506,0.3788817,0.0002002704,0.0001192735,0.000371366,0.00009621835,0.00008259155,0.0114808],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003027944,"threshold_uncertainty_score":0.01230866,"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","authors":[{"name":"Adeolu Taiwo","is_ca":false},{"name":"Temitope Mewomo","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002192565,0.001061126,0.001149613,0.001236186,0.0006928682,0.001080884,0.001177261,0.001819197,0.001565386],"category_scores_gemma":[0.004616239,0.0004840101,0.001236732,0.0006992062,0.001879459,0.002344999,0.00258726,0.002228722,0.0002376063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008368722,"about_ca_system_score_gemma":0.001146265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001477607,"about_ca_topic_score_gemma":0.001345217,"domain_scores_codex":[0.9992558,0.0003096088,0.00004013732,0.0001139094,0.0002175574,0.00006294483],"domain_scores_gemma":[0.9989912,0.0005305717,0.0001502988,0.00008517438,0.0001467939,0.00009587734],"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.000105405,0.0001013686,0.0008798956,0.0002718079,0.00009478715,0.0001649358,0.0002405507,0.330707,0.006533188,0.6093619,0.001421106,0.05011803],"study_design_scores_gemma":[0.00001282544,0.00003750923,0.00007302363,0.00001092959,0.000006780845,0.00002539835,0.00001579364,0.9542708,0.0005984084,0.04392726,0.001011888,0.000009326304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0104032,0.0002462681,0.9876583,0.0002148858,0.00003636171,0.00002087751,0.000008491153,0.00005207025,0.001359585],"genre_scores_gemma":[0.405256,0.0007383277,0.5868056,0.0002695071,0.0001975559,0.0003046156,0.0001218531,0.0001552071,0.006151361],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002192565,"threshold_uncertainty_score":0.01159555,"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","authors":[{"name":"Gábor T. Herman","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01845895,0.001381474,0.00190891,0.003305008,0.002492158,0.007048591,0.00270255,0.003860009,0.01009109],"category_scores_gemma":[0.02526759,0.0008680451,0.001909086,0.003839964,0.02291914,0.01457815,0.006499791,0.008208517,0.001519418],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004778961,"about_ca_system_score_gemma":0.003815666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000865764,"about_ca_topic_score_gemma":0.0005037198,"domain_scores_codex":[0.9877078,0.006899021,0.0007285376,0.001522135,0.002694294,0.0004482452],"domain_scores_gemma":[0.9807243,0.01373627,0.001315221,0.002327252,0.001519972,0.0003769487],"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.000002480153,0.000004282566,0.00001892639,0.00003885621,0.000003457699,0.00000672207,0.00005387417,0.001547302,0.00002937337,0.9952715,0.0003720774,0.002651106],"study_design_scores_gemma":[0.000004493356,0.00000856055,0.0000157404,0.00003786624,0.000001878652,0.00001118084,0.00002444381,0.004589075,0.00006722641,0.9915307,0.003704724,0.000004131314],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005174078,0.006874494,0.9142596,0.01267412,0.0004757345,0.00008837228,0.00006902547,0.0001315888,0.060253],"genre_scores_gemma":[0.4960888,0.01450477,0.4626816,0.003859415,0.002882584,0.001081575,0.0002216314,0.0003493972,0.01833023],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01845895,"threshold_uncertainty_score":0.09762144,"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","authors":[{"name":"Tingxia Lu","is_ca":false},{"name":"Lulu Zhao","is_ca":false},{"name":"Hongjin He","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004556743,0.001739159,0.001367752,0.001831599,0.0008229986,0.002219468,0.001979617,0.002238746,0.005845597],"category_scores_gemma":[0.01057317,0.0008276078,0.001926423,0.001748251,0.003423316,0.005543447,0.00425815,0.007302339,0.001292708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001374856,"about_ca_system_score_gemma":0.001677909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002232401,"about_ca_topic_score_gemma":0.001526796,"domain_scores_codex":[0.9978094,0.001099768,0.0001005996,0.0003058276,0.0005743112,0.000110114],"domain_scores_gemma":[0.9969749,0.001784024,0.0001985431,0.0003281664,0.0005524706,0.0001617191],"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.0000513578,0.00003238543,0.0001919418,0.0001551353,0.00003508289,0.00007556534,0.0001580124,0.06364745,0.002163627,0.8799271,0.007012497,0.04654992],"study_design_scores_gemma":[0.00002876832,0.00008426885,0.0001288439,0.00009239064,0.00002034242,0.0001398774,0.00005332657,0.6396016,0.001661794,0.3384242,0.01971654,0.00004790787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004944938,0.0003885865,0.9968172,0.0005344563,0.00009670516,0.00001422917,0.00001495322,0.00003124288,0.001608086],"genre_scores_gemma":[0.05061867,0.002090858,0.9390399,0.001085513,0.0008130716,0.0002280367,0.0001020267,0.000349586,0.005672351],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005845597,"threshold_uncertainty_score":0.02409863,"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","authors":[{"name":"Xiaotian Li","is_ca":false},{"name":"Lingliang Cai","is_ca":false},{"name":"Jingchao Li","is_ca":false},{"name":"Carisa Kwok","is_ca":false},{"name":"Wai Yu","is_ca":false},{"name":"Yaohua Hu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003288022,0.001510822,0.002508498,0.003821859,0.001048764,0.00296998,0.002423009,0.002123078,0.004079511],"category_scores_gemma":[0.00584874,0.0009915356,0.002341106,0.00750701,0.001419882,0.002870322,0.001716871,0.002109016,0.003378547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001676425,"about_ca_system_score_gemma":0.001978309,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002264878,"about_ca_topic_score_gemma":0.001371583,"domain_scores_codex":[0.9964179,0.00134124,0.0002713221,0.0006358745,0.00122633,0.0001073606],"domain_scores_gemma":[0.9981014,0.000920018,0.0001118797,0.0002345472,0.0005838551,0.00004834319],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007122028,0.00007205142,0.001076891,0.004267282,0.0003274003,0.0001325098,0.0002764069,0.07554751,0.002739934,0.3238852,0.02367862,0.567925],"study_design_scores_gemma":[0.00004091964,0.0001295561,0.001897855,0.001129899,0.0001297801,0.000659419,0.0001767572,0.3331927,0.003711601,0.3743321,0.284441,0.0001584535],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001116109,0.06303868,0.9260242,0.001166231,0.0004464219,0.00008209886,0.0002381777,0.00035717,0.007530788],"genre_scores_gemma":[0.0433014,0.1524885,0.7912197,0.001061166,0.002659901,0.0005705455,0.001069342,0.000607265,0.007022121],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004079511,"threshold_uncertainty_score":0.01738888,"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","authors":[{"name":"Heiko Gimperlein","is_ca":false},{"name":"Matthias Maischak","is_ca":false},{"name":"Ernst P. Stephan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006104428,0.0004735136,0.0005255984,0.000443475,0.0005489776,0.0006107803,0.0006974051,0.001428378,0.005372173],"category_scores_gemma":[0.001375226,0.0003131133,0.000370646,0.0002837976,0.0006995501,0.0005050434,0.0008655306,0.0006841505,0.0006267701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005453824,"about_ca_system_score_gemma":0.0005824924,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002300701,"about_ca_topic_score_gemma":0.002484007,"domain_scores_codex":[0.9998413,0.0000485165,0.000004446805,0.00001642943,0.00007547895,0.0000138464],"domain_scores_gemma":[0.9997423,0.0001533061,0.00002626088,0.00002384454,0.00003746981,0.00001682027],"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.00004787582,0.00006932853,0.0005072689,0.0001119547,0.00002195833,0.0002162039,0.0001407233,0.9095666,0.01164591,0.06660715,0.0007090074,0.01035605],"study_design_scores_gemma":[0.000003608411,0.000008950547,0.00004906402,0.000006681528,0.000002370449,0.00002172053,0.00001190387,0.9963121,0.0005720822,0.002362582,0.0006470013,0.000001951947],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03390104,0.0001455946,0.9484606,0.000262973,0.00003267423,0.00007725385,0.00005872132,0.0001352662,0.01692595],"genre_scores_gemma":[0.7497972,0.0002802443,0.2322159,0.0001627832,0.0000414829,0.0002651124,0.0001494392,0.000218855,0.01686895],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005372173,"threshold_uncertainty_score":0.01797169,"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","authors":[{"name":"Truong Q. Bao","is_ca":false},{"name":"Antoine Soubeyran","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002084995,0.0006666073,0.0006983498,0.0007612783,0.0007025275,0.001191455,0.001107602,0.0008789063,0.002302461],"category_scores_gemma":[0.003814045,0.0003923874,0.001018435,0.0007905998,0.002212003,0.001852607,0.002090242,0.001833464,0.0002001199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001898139,"about_ca_system_score_gemma":0.001389233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003399212,"about_ca_topic_score_gemma":0.002631614,"domain_scores_codex":[0.9992336,0.000334703,0.00002647743,0.0001053966,0.0002220989,0.00007769817],"domain_scores_gemma":[0.9990063,0.0006004934,0.00007912608,0.00007288164,0.0001368745,0.0001044129],"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.00001126604,0.0000155722,0.0001875412,0.00003598426,0.00001916439,0.00004119073,0.00007969627,0.09610841,0.0008885961,0.8948027,0.0006253353,0.007184628],"study_design_scores_gemma":[0.000007601668,0.00002196901,0.0001482566,0.000009582166,0.000005326172,0.00002434701,0.00002977661,0.491246,0.0003040227,0.5055405,0.002651324,0.00001117693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01527568,0.0006305988,0.9720339,0.0007283054,0.00008373384,0.0000287311,0.000048014,0.00005244579,0.01111858],"genre_scores_gemma":[0.7184576,0.001649752,0.2557201,0.0005040425,0.0002892971,0.0002609754,0.0001281604,0.0001944769,0.02279561],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003399212,"threshold_uncertainty_score":0.01377201,"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","authors":[{"name":"Boris S. Mordukhovich","is_ca":false},{"name":"Nguyen Mau","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002895748,0.00109716,0.001451041,0.001591496,0.001156772,0.002052906,0.001738731,0.002757708,0.00369897],"category_scores_gemma":[0.00904365,0.0005535795,0.001615929,0.00250096,0.003709252,0.003944132,0.002552143,0.00369162,0.001065964],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002234116,"about_ca_system_score_gemma":0.001833254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004200602,"about_ca_topic_score_gemma":0.003247377,"domain_scores_codex":[0.9987772,0.0004768244,0.00006137615,0.0002406588,0.000337472,0.0001066127],"domain_scores_gemma":[0.9985788,0.001022885,0.00007520377,0.0001055429,0.0001721696,0.00004547575],"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.00006089551,0.00002402743,0.0002740971,0.00008458424,0.00003135792,0.00006626303,0.0001304735,0.1244613,0.0005740691,0.8085045,0.006274459,0.05951403],"study_design_scores_gemma":[0.00003094721,0.00003848021,0.0001796768,0.00006082137,0.0000147214,0.00005739,0.0000407008,0.3673004,0.0006971239,0.6174001,0.01414282,0.00003676944],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005308983,0.001554723,0.9797163,0.0020579,0.0001925065,0.00003783502,0.00007893696,0.00009841174,0.01095438],"genre_scores_gemma":[0.1634782,0.003090824,0.8167303,0.0007160232,0.000604319,0.0002181655,0.0002631541,0.0002124393,0.0146865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004200602,"threshold_uncertainty_score":0.01620972,"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","authors":[{"name":"Didier Aussel","is_ca":false},{"name":"T.C. Thanh Cong","is_ca":false},{"name":"Rossana Riccardi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002407548,0.001475755,0.001559295,0.0007954051,0.0007475235,0.002603627,0.002409548,0.002472269,0.005508752],"category_scores_gemma":[0.003250432,0.0006840827,0.001802747,0.0009597245,0.001874501,0.003086367,0.001695125,0.00175317,0.000582082],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00198496,"about_ca_system_score_gemma":0.001083442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004015633,"about_ca_topic_score_gemma":0.004022854,"domain_scores_codex":[0.9980059,0.001188042,0.00007138801,0.0003199267,0.0002273443,0.0001873321],"domain_scores_gemma":[0.9986534,0.0008076168,0.0002185342,0.00006535764,0.0001088244,0.000146222],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001005909,0.0001135687,0.0008603482,0.0001670895,0.0001433967,0.0005890584,0.0002609211,0.6077998,0.001732493,0.3815377,0.000806691,0.005888242],"study_design_scores_gemma":[0.00003327025,0.00009022583,0.0002229899,0.00001553271,0.00002759259,0.0000666039,0.00007568618,0.8938022,0.0001548572,0.1044783,0.001006908,0.00002585018],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07545797,0.0007292443,0.8971122,0.0006626362,0.0001082809,0.00021516,0.0001938455,0.00005808941,0.02546252],"genre_scores_gemma":[0.9009593,0.0009017427,0.08004934,0.0001700331,0.00009624139,0.0003263827,0.0001272042,0.0000343487,0.01733529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005508752,"threshold_uncertainty_score":0.01842862,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002156185,0.0009160292,0.001098524,0.002190382,0.001238141,0.002858318,0.001147512,0.0008373792,0.00595655],"category_scores_gemma":[0.01428286,0.0006747877,0.001089156,0.001175434,0.004251461,0.005658098,0.002242961,0.003070501,0.0008086013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001198547,"about_ca_system_score_gemma":0.0006945464,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001724347,"about_ca_topic_score_gemma":0.001100869,"domain_scores_codex":[0.9988172,0.0005527405,0.00004670899,0.0001854975,0.0002805839,0.0001173971],"domain_scores_gemma":[0.9939818,0.004008972,0.0005443192,0.000372675,0.0007663053,0.0003259345],"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.00002478083,0.000007349006,0.0001597251,0.00002600615,0.000007993674,0.00002814675,0.0001148169,0.004684355,0.0003542322,0.9898931,0.0007404148,0.003958941],"study_design_scores_gemma":[0.000006119401,0.00001987578,0.0003018008,0.00001076666,0.000005108418,0.00005246373,0.00005709894,0.02163038,0.000189932,0.975758,0.001959164,0.000009318142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.2800002,0.003881775,0.5579627,0.004218971,0.0003827669,0.00005250223,0.000413642,0.0001919383,0.1528955],"genre_scores_gemma":[0.9355115,0.002415022,0.03758526,0.0003760555,0.0004904419,0.00007845248,0.0002477609,0.0001894186,0.02310604],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.00595655,"threshold_uncertainty_score":0.01992667,"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","authors":[{"name":"Hilbert Spaces","is_ca":false},{"name":"Bing Tan","is_ca":false},{"name":"Shanshan Xu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002932879,0.00131564,0.001267329,0.001204204,0.0007972866,0.001411206,0.001781576,0.001630092,0.002375998],"category_scores_gemma":[0.006550426,0.0006146649,0.001196171,0.0008459266,0.00212785,0.003218189,0.004236173,0.002623024,0.0004399165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008462117,"about_ca_system_score_gemma":0.001831318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001219784,"about_ca_topic_score_gemma":0.0008683016,"domain_scores_codex":[0.9981852,0.0005603459,0.0001275301,0.000363003,0.0005981895,0.0001656158],"domain_scores_gemma":[0.9981484,0.000916017,0.0001936236,0.0001725223,0.0003944723,0.0001750449],"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.0002231513,0.0001584508,0.001308786,0.0003416403,0.0001359286,0.0001865607,0.0005484771,0.3124487,0.007718309,0.4761698,0.001656889,0.1991034],"study_design_scores_gemma":[0.00002488561,0.0001074952,0.0001698343,0.00001796782,0.00001225342,0.00006638708,0.00003858022,0.9502776,0.002314392,0.04555048,0.001395809,0.00002423791],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004534692,0.0000878705,0.9944715,0.00005427118,0.00002291635,0.0000269204,0.000005160413,0.00006248845,0.0007341466],"genre_scores_gemma":[0.2956065,0.0004227208,0.6993241,0.0001739745,0.0001306685,0.0004604762,0.0001021937,0.0001245862,0.003654731],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002932879,"threshold_uncertainty_score":0.01551074,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003086392,0.001196339,0.0009325271,0.0009485404,0.0005081933,0.0009377474,0.001433168,0.001857964,0.001655947],"category_scores_gemma":[0.007419205,0.0004569615,0.001347464,0.0005477056,0.002465328,0.001931107,0.00334555,0.001845798,0.0002625615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008269811,"about_ca_system_score_gemma":0.001253858,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009877336,"about_ca_topic_score_gemma":0.0009334192,"domain_scores_codex":[0.9989485,0.0004719463,0.00005128491,0.0001410844,0.0003119236,0.00007529248],"domain_scores_gemma":[0.9979006,0.001416892,0.0001757743,0.00009690781,0.0002922043,0.0001176043],"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.0001394669,0.00009099043,0.0009660038,0.0004780456,0.0001488442,0.000337794,0.0007014241,0.4291086,0.01614009,0.4951398,0.0009160723,0.05583278],"study_design_scores_gemma":[0.00001279274,0.00006596255,0.00008091873,0.00002173286,0.000007629169,0.00006079358,0.00005158524,0.9438668,0.002453622,0.05264856,0.0007209615,0.000008697276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01966549,0.0001855246,0.9782009,0.0001253142,0.00002425131,0.00003982587,0.000009807999,0.00002881354,0.001720054],"genre_scores_gemma":[0.4592454,0.000449794,0.533088,0.0001080489,0.00008022052,0.0004638269,0.00008553057,0.0000874744,0.00639168],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003086392,"threshold_uncertainty_score":0.01632255,"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","authors":[{"name":"Eyal Cohen","is_ca":false},{"name":"Shoham Sabach","is_ca":false},{"name":"Marc Teboulle","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00350841,0.001440119,0.001574189,0.000815016,0.0005571866,0.001073011,0.001596238,0.001598398,0.003634006],"category_scores_gemma":[0.009312982,0.0008246133,0.000912802,0.0008982432,0.00161422,0.001195673,0.00240278,0.002565921,0.00104926],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007575336,"about_ca_system_score_gemma":0.001707145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001739061,"about_ca_topic_score_gemma":0.001936911,"domain_scores_codex":[0.9990948,0.0005274312,0.00004079082,0.00009521779,0.000190003,0.00005185727],"domain_scores_gemma":[0.996097,0.003019294,0.0002102434,0.0001860333,0.0003762268,0.0001112047],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007185421,0.00005651251,0.0002930934,0.0002787196,0.00006974146,0.0001413095,0.0001070111,0.8349118,0.001404588,0.1238781,0.001867111,0.03692016],"study_design_scores_gemma":[0.000009724738,0.00001848787,0.00002581203,0.00001391078,0.000003930379,0.00001991461,0.000008118043,0.9786671,0.000304677,0.02008718,0.0008357458,0.000005286986],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001149075,0.0001426517,0.9978983,0.00008263073,0.00001919104,0.00001644458,0.000008599929,0.00005548946,0.0006276125],"genre_scores_gemma":[0.1935133,0.00100793,0.7949553,0.0002235914,0.0001407138,0.0004390153,0.0001704625,0.000316634,0.009233003],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003634006,"threshold_uncertainty_score":0.01855445,"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","authors":[{"name":"Simeon Reich","is_ca":false},{"name":"Alexander J. Zaslavski","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003031492,0.00131416,0.0009911252,0.001464763,0.0007681439,0.001455341,0.0009986464,0.001059247,0.00210232],"category_scores_gemma":[0.01535265,0.000565284,0.001005589,0.0006212868,0.003731272,0.002933203,0.003287894,0.002078408,0.0001750973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001252821,"about_ca_system_score_gemma":0.0008265754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002378391,"about_ca_topic_score_gemma":0.001859758,"domain_scores_codex":[0.9989462,0.0004389787,0.00006046642,0.0001607203,0.0002780983,0.0001155641],"domain_scores_gemma":[0.9942532,0.003507546,0.0007055707,0.0003970674,0.0007200773,0.0004164928],"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.0001866583,0.00003366313,0.002110569,0.000199278,0.00008730862,0.0003103867,0.0005605159,0.2859835,0.003381902,0.6906497,0.0008658214,0.01563058],"study_design_scores_gemma":[0.00001299599,0.0000966952,0.0005520703,0.00004698054,0.00001278476,0.00008200439,0.0001605236,0.6133832,0.001455702,0.3831142,0.001058751,0.00002398907],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2539642,0.0009781289,0.7331386,0.0007082582,0.0001343651,0.00007366595,0.0001120299,0.0001301323,0.01076059],"genre_scores_gemma":[0.9071534,0.0007997346,0.0816825,0.0001598202,0.00008122112,0.0001758772,0.0001921484,0.0001904248,0.009565014],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003031492,"threshold_uncertainty_score":0.01603228,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004371197,0.001909408,0.001814936,0.001222191,0.0006903618,0.002575001,0.00183313,0.002147066,0.002434051],"category_scores_gemma":[0.008898498,0.0007878326,0.001243496,0.0009127246,0.002635688,0.002754909,0.004507894,0.003131226,0.0002970403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001372724,"about_ca_system_score_gemma":0.002183499,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005135668,"about_ca_topic_score_gemma":0.00373471,"domain_scores_codex":[0.9984615,0.0008002871,0.00007299118,0.0002322107,0.0003376736,0.00009536619],"domain_scores_gemma":[0.9957688,0.003018532,0.0003512854,0.0001922367,0.0004820435,0.0001871498],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001565652,0.0001025045,0.0002498549,0.0003821597,0.0001055099,0.00007000218,0.0001499947,0.5080451,0.005288259,0.4573287,0.001303694,0.02681763],"study_design_scores_gemma":[0.000008332269,0.00002916335,0.00004153068,0.00001954368,0.000008830821,0.00000779228,0.000008004159,0.958739,0.0003972466,0.040187,0.000544898,0.000008606714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00367883,0.0002586443,0.9938096,0.0001589709,0.00006166573,0.00002137286,0.00002694606,0.0000366154,0.001947285],"genre_scores_gemma":[0.435015,0.001404214,0.5454512,0.0002982185,0.0004306953,0.0004307686,0.0003131008,0.0003912308,0.01626565],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005135668,"threshold_uncertainty_score":0.02311736,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008999368,0.0008877441,0.0007383307,0.0004540209,0.0003655959,0.001361467,0.0009712388,0.0008676531,0.001943803],"category_scores_gemma":[0.00221234,0.0003167895,0.0007131012,0.0006276428,0.00181634,0.00162905,0.002149689,0.001630895,0.0003939493],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006628791,"about_ca_system_score_gemma":0.001059782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001657587,"about_ca_topic_score_gemma":0.001799665,"domain_scores_codex":[0.9994743,0.0002528683,0.00002033985,0.00005209948,0.0001491536,0.00005119796],"domain_scores_gemma":[0.999422,0.0002238941,0.0001080766,0.0001349216,0.00007568143,0.00003555971],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002187764,0.00001651229,0.0002438984,0.00007847534,0.00002201498,0.00008969842,0.00008513308,0.5507221,0.001759471,0.4285928,0.0005863073,0.01778176],"study_design_scores_gemma":[0.000004472862,0.0000208984,0.00004148528,0.00001280588,0.00000318352,0.00002314802,0.00001040257,0.9194264,0.0003418995,0.07796319,0.002146176,0.000005929865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01326216,0.0003521384,0.9783524,0.000226472,0.0000539218,0.00002251139,0.00004268442,0.00007127166,0.007616462],"genre_scores_gemma":[0.6935488,0.0008923709,0.2890197,0.000152578,0.0001148385,0.0001985418,0.0001833993,0.0001264191,0.01576339],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001943803,"threshold_uncertainty_score":0.006502628,"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","authors":[{"name":"Christian Ünther","is_ca":false},{"name":"Nicolae Popovici","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001806226,0.001024617,0.0004778274,0.001337574,0.0005017667,0.001688736,0.0005480058,0.00037667,0.001253773],"category_scores_gemma":[0.002892256,0.0002018257,0.0004094556,0.0008205962,0.003184454,0.004258926,0.001095345,0.001268955,0.0002683196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008349241,"about_ca_system_score_gemma":0.0004807564,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007948751,"about_ca_topic_score_gemma":0.0005389225,"domain_scores_codex":[0.9994123,0.0002489467,0.0000305819,0.00009666056,0.0001498579,0.00006160571],"domain_scores_gemma":[0.9985262,0.0005544492,0.0002735871,0.0001265915,0.000379644,0.0001395968],"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.00006415774,0.00002274376,0.001255412,0.0001076033,0.00001414872,0.0001714133,0.0003043568,0.03275395,0.009253982,0.9375617,0.000512969,0.0179776],"study_design_scores_gemma":[0.00001244616,0.0002157186,0.002097454,0.00006488596,0.00001682313,0.0004026831,0.0004162533,0.3789087,0.008092543,0.6014195,0.008285614,0.00006734325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1685161,0.001065369,0.8154108,0.0004403857,0.00008189159,0.00005885074,0.0001243834,0.00009945597,0.0142028],"genre_scores_gemma":[0.9223695,0.001349966,0.06940441,0.0001394008,0.0001975818,0.00007282214,0.0001558225,0.000118211,0.006192241],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001806226,"threshold_uncertainty_score":0.00955236,"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","authors":[{"name":"Chunxiang Zong","is_ca":false},{"name":"Yuchao Tang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00167151,0.0009149876,0.0009746375,0.0007035077,0.0004930398,0.0007681458,0.001083383,0.001247557,0.001626526],"category_scores_gemma":[0.002974215,0.0004089396,0.00102001,0.0006401678,0.0009806462,0.001376361,0.002009611,0.002045014,0.0003342442],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005265892,"about_ca_system_score_gemma":0.0009932352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001129704,"about_ca_topic_score_gemma":0.0009954561,"domain_scores_codex":[0.9994078,0.0001993123,0.00003728535,0.00007943382,0.0002288282,0.00004729307],"domain_scores_gemma":[0.9989555,0.0005540143,0.00008240308,0.00008025912,0.0002582313,0.00006958604],"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.0002057569,0.0001807095,0.000967441,0.0004964193,0.0001073888,0.0002902252,0.0004456873,0.6265008,0.02105398,0.1868897,0.001902599,0.1609593],"study_design_scores_gemma":[0.000008194178,0.00002251353,0.00002564404,0.00000582419,0.00000381841,0.00003615076,0.00001295448,0.9904228,0.001230457,0.007601316,0.0006251559,0.000005171327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00431244,0.0001284439,0.9945523,0.00006414187,0.00001805693,0.00002226939,0.000005876474,0.00003614834,0.0008602376],"genre_scores_gemma":[0.1349806,0.0002818143,0.862432,0.00008700851,0.00005093402,0.0001738078,0.00004770893,0.00007904374,0.00186713],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00167151,"threshold_uncertainty_score":0.008839905,"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","authors":[{"name":"Mohamed Mansour","is_ca":false},{"name":"Mohamed Amin Bahraoui","is_ca":false},{"name":"Adham El Bekkali","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001750876,0.0008285997,0.0005873067,0.0007217144,0.0004058049,0.001415369,0.0009458596,0.001153096,0.002003461],"category_scores_gemma":[0.006234461,0.0003919538,0.0007777313,0.0004357504,0.002061444,0.002435046,0.00170169,0.001596282,0.000205773],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006823023,"about_ca_system_score_gemma":0.0006396478,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009912348,"about_ca_topic_score_gemma":0.0006662612,"domain_scores_codex":[0.9994552,0.0002462372,0.00002988898,0.00008859503,0.0001311288,0.00004888956],"domain_scores_gemma":[0.998068,0.001152976,0.00030116,0.0001634693,0.0002510622,0.0000633372],"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.00004433368,0.00002636592,0.0007927426,0.0001626207,0.0000448538,0.0001348049,0.0001808456,0.2676489,0.01156777,0.7081735,0.0004911609,0.01073204],"study_design_scores_gemma":[0.000004399179,0.00003054638,0.0001647103,0.00001787091,0.000006465727,0.00005162167,0.00003643597,0.8879841,0.001644018,0.1088336,0.001214337,0.00001200691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02018405,0.0002431193,0.9763724,0.0003140619,0.00004015887,0.00002309909,0.00003946598,0.00003079561,0.002752913],"genre_scores_gemma":[0.7898584,0.001078786,0.2009419,0.0002400949,0.0001137416,0.0002492961,0.0001184635,0.00008287485,0.007316471],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002003461,"threshold_uncertainty_score":0.009259582,"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","authors":[{"name":"Lê Thanh Tùng","is_ca":false},{"name":"Trần Thiện Khải","is_ca":false},{"name":"Thanh-Hung Pham","is_ca":false},{"name":"Phạm Lê Bạch Ngọc","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048057,0.00138106,0.001706645,0.001806761,0.000973247,0.002988865,0.001161581,0.001852307,0.004374376],"category_scores_gemma":[0.01357968,0.0007937722,0.001577071,0.001488435,0.00274745,0.004841252,0.002539554,0.004266688,0.0005701812],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001637374,"about_ca_system_score_gemma":0.002001145,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001005639,"about_ca_topic_score_gemma":0.0008798615,"domain_scores_codex":[0.9980046,0.0009349192,0.0001233493,0.0002454034,0.0004715413,0.0002202477],"domain_scores_gemma":[0.9962973,0.002601169,0.0003476547,0.0001451217,0.0004627471,0.0001460175],"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.00005684105,0.00004124093,0.0003214417,0.0001984682,0.00004777994,0.0001152611,0.0001251106,0.06836852,0.002012559,0.9190087,0.001045123,0.008659128],"study_design_scores_gemma":[0.00003443308,0.00008042349,0.0003383922,0.00009565474,0.00002326644,0.0001148404,0.0001008434,0.3321081,0.001920212,0.6626741,0.002472958,0.00003676732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04133167,0.001709839,0.9294149,0.001304449,0.000130048,0.0001269791,0.0002507702,0.00008522415,0.0256462],"genre_scores_gemma":[0.7098145,0.002120853,0.2772232,0.0005029266,0.0002428773,0.0008262647,0.0003709813,0.0001303305,0.008768119],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0048057,"threshold_uncertainty_score":0.02541524,"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","authors":[{"name":"Bing Tan","is_ca":true},{"name":"Xiaolong Qin","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00149538,0.001077193,0.0008977109,0.0005300655,0.0004565935,0.0008743731,0.001542729,0.001098654,0.002144133],"category_scores_gemma":[0.002759103,0.000381158,0.0009384817,0.0006013735,0.001062716,0.001362293,0.00151657,0.002172864,0.0003717111],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004062959,"about_ca_system_score_gemma":0.001420768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001159454,"about_ca_topic_score_gemma":0.001125976,"domain_scores_codex":[0.9992249,0.0003164006,0.00004100708,0.0001049062,0.0002556871,0.00005708754],"domain_scores_gemma":[0.9993433,0.0003168237,0.00006433429,0.00007588376,0.0001442656,0.00005539726],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001727457,0.0001568312,0.0006795521,0.0004412256,0.0001119206,0.0002240857,0.0003107845,0.4666084,0.0186685,0.2758301,0.002467674,0.2343282],"study_design_scores_gemma":[0.00001104866,0.00005573522,0.00007887183,0.000008243666,0.00000391903,0.00003891922,0.000008120049,0.9875684,0.001191341,0.009641395,0.001382856,0.00001103724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00343151,0.0001915384,0.9952638,0.00006131886,0.00005674779,0.00003044166,0.000007210539,0.00003806017,0.0009192749],"genre_scores_gemma":[0.2400436,0.000962402,0.752376,0.0001768249,0.0002317768,0.0005492687,0.00008412993,0.0001113016,0.005464768],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002144133,"threshold_uncertainty_score":0.007908404,"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","authors":[{"name":"Bas Peters","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002954436,0.001814302,0.001059046,0.0009763351,0.0006230346,0.001693562,0.001937262,0.002631345,0.003866602],"category_scores_gemma":[0.01115363,0.0006707886,0.001015462,0.00105663,0.001980043,0.002935912,0.003164858,0.004671608,0.001111209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002315742,"about_ca_system_score_gemma":0.001892759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002519353,"about_ca_topic_score_gemma":0.002626926,"domain_scores_codex":[0.9987131,0.0005164287,0.00008620403,0.0001969877,0.0004137308,0.00007348479],"domain_scores_gemma":[0.9973989,0.00155185,0.000212876,0.0002174235,0.0005019846,0.000117103],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007200083,0.00007428454,0.0003565437,0.0002460643,0.00004260647,0.00007716491,0.00009376003,0.766657,0.003249661,0.1543597,0.003217625,0.0715536],"study_design_scores_gemma":[0.000005049183,0.00001968627,0.00005395681,0.00002301931,0.000002721036,0.00002065387,0.000006447357,0.9677086,0.0008770091,0.02993497,0.001338276,0.000009584462],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002065666,0.0001609405,0.9962139,0.0001750916,0.00002088404,0.00004138998,0.00004346054,0.0001056179,0.001173068],"genre_scores_gemma":[0.1385275,0.000622512,0.8535547,0.0002863717,0.00006270417,0.0008246228,0.0004573542,0.0005263436,0.005137843],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003866602,"threshold_uncertainty_score":0.01680195,"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","authors":[{"name":"Gábor T. Herman","is_ca":false},{"name":"Christoph Schnörr","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002659547,0.001948266,0.002583649,0.004073828,0.001493756,0.007419307,0.001888493,0.003784539,0.07723168],"category_scores_gemma":[0.008113706,0.0006072301,0.002025033,0.003825223,0.001135941,0.004403829,0.001677407,0.004391667,0.02003063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001685042,"about_ca_system_score_gemma":0.002084396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006075502,"about_ca_topic_score_gemma":0.001461677,"domain_scores_codex":[0.997816,0.0003507207,0.0001607581,0.0004278875,0.001052467,0.0001922379],"domain_scores_gemma":[0.9922662,0.002793305,0.0005514747,0.0005622902,0.002897659,0.0009289932],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000115859,0.0001181192,0.0002710516,0.0005389806,0.00006634416,0.0001089103,0.00001547052,0.0007768237,0.0006396849,0.009432888,0.9187377,0.06917826],"study_design_scores_gemma":[0.00004461344,0.0002481219,0.001696669,0.0005121514,0.0001128004,0.0004044691,0.00005832623,0.006472663,0.0007657229,0.0200036,0.9696398,0.00004109199],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.002013425,0.04558228,0.01829685,0.02600502,0.8586502,0.0001351913,0.0005686168,0.0003334909,0.04841486],"genre_scores_gemma":[0.01108635,0.03255872,0.006713404,0.007227622,0.8052799,0.000147957,0.001011552,0.0008534403,0.135121],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.07723168,"threshold_uncertainty_score":0.2583657,"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","authors":[{"name":"Yair Censor","is_ca":false},{"name":"Maroun Zaknoon","is_ca":false},{"name":"Alexander J. Zaslavski","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009927655,0.001150855,0.001355168,0.001812751,0.0008485556,0.002690978,0.00246233,0.001804685,0.002566857],"category_scores_gemma":[0.03556981,0.0007378043,0.001335641,0.001700743,0.003185515,0.004435454,0.006459828,0.003625471,0.0007709413],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001412172,"about_ca_system_score_gemma":0.001514686,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000618281,"about_ca_topic_score_gemma":0.000346439,"domain_scores_codex":[0.9934756,0.003175694,0.0004678209,0.0007615999,0.001960978,0.0001583313],"domain_scores_gemma":[0.9856907,0.009601676,0.0008287133,0.001610453,0.001885592,0.0003828945],"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.000193694,0.00007576201,0.0009479102,0.0002647473,0.00007710525,0.00009663476,0.0002944903,0.1762688,0.003646122,0.7480101,0.00109016,0.06903437],"study_design_scores_gemma":[0.0000244556,0.0001266299,0.0001454467,0.00006096942,0.00001292135,0.00006643355,0.0000347376,0.7746941,0.003347503,0.2174904,0.003973066,0.0000233528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003341209,0.0001265011,0.9949321,0.0001304005,0.00002488106,0.00003199431,0.00002117181,0.00005874125,0.00133296],"genre_scores_gemma":[0.2292203,0.0004897455,0.7656747,0.000285689,0.0001812691,0.0005630191,0.0003092798,0.0003338853,0.002942197],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009927655,"threshold_uncertainty_score":0.05250311,"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","authors":[{"name":"Yaohua Hu","is_ca":false},{"name":"Yuping Liu","is_ca":false},{"name":"Minghua Li","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002968831,0.000951416,0.001085996,0.0003603405,0.0004680159,0.001046161,0.00122912,0.001359433,0.001254713],"category_scores_gemma":[0.01047285,0.0004852342,0.0005981925,0.0003365082,0.001670711,0.00154177,0.001282274,0.001685416,0.000174924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006576515,"about_ca_system_score_gemma":0.001144467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003223074,"about_ca_topic_score_gemma":0.002080337,"domain_scores_codex":[0.9989275,0.0005844164,0.00005114415,0.0001016812,0.0002787402,0.00005649028],"domain_scores_gemma":[0.9959401,0.002929702,0.0002812621,0.0002323194,0.0005047608,0.0001118099],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002119037,0.00005281515,0.0007099254,0.0002359222,0.00005111799,0.0001975493,0.0001417489,0.9202057,0.005972955,0.04821084,0.001038774,0.02297075],"study_design_scores_gemma":[0.000003411945,0.00001971731,0.00003313302,0.00000405506,0.000002935835,0.000007860975,0.000002943181,0.9983071,0.0004322745,0.001016899,0.0001671224,0.000002472146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01721353,0.0003329492,0.9808604,0.0002773968,0.00007748594,0.00003070349,0.00001394978,0.00009634024,0.001097363],"genre_scores_gemma":[0.599492,0.0008576943,0.3955618,0.0003409981,0.0001083167,0.0002019476,0.00008229692,0.000188138,0.003166738],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003223074,"threshold_uncertainty_score":0.01570088,"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","authors":[],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001968751,0.0009084555,0.0006432174,0.00172372,0.0009713332,0.001552899,0.001179438,0.0008125513,0.003649141],"category_scores_gemma":[0.002134895,0.0003413199,0.0009310574,0.001325427,0.002397252,0.004017083,0.001765074,0.002776034,0.0005150933],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001249028,"about_ca_system_score_gemma":0.0009399676,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009030505,"about_ca_topic_score_gemma":0.0008620527,"domain_scores_codex":[0.9992606,0.0003064004,0.00004502731,0.0001194197,0.0002120603,0.0000565047],"domain_scores_gemma":[0.9992918,0.0002761173,0.00006859776,0.00009365477,0.0002076479,0.00006211681],"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.000002819941,0.000003887279,0.00003692857,0.00001396106,0.000002178859,0.00001764816,0.00005558097,0.002148829,0.0003873385,0.9940144,0.0002719484,0.003044369],"study_design_scores_gemma":[0.000004262707,0.00003072397,0.00008112285,0.00002276795,0.000007122045,0.00007280215,0.00008668594,0.03286315,0.0005976142,0.9575909,0.008629592,0.00001326033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01148776,0.000761549,0.9568574,0.0007102799,0.0001094025,0.00003802523,0.00007940087,0.00005241115,0.02990383],"genre_scores_gemma":[0.5231106,0.003486183,0.4299551,0.001074087,0.0008880127,0.0003277581,0.0003260318,0.0002322448,0.04060004],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003649141,"threshold_uncertainty_score":0.01220763,"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","authors":[{"name":"В. Ф. Бабенко","is_ca":false},{"name":"Vira Babenko","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004800959,0.001465788,0.001561351,0.001962763,0.0009598396,0.002237106,0.001605357,0.001950549,0.00236322],"category_scores_gemma":[0.01662908,0.0004718308,0.001548396,0.001035734,0.004312142,0.005127162,0.003360986,0.003613228,0.0002542046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003060572,"about_ca_system_score_gemma":0.001442796,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003306417,"about_ca_topic_score_gemma":0.002323508,"domain_scores_codex":[0.9986652,0.0005598599,0.00006888696,0.0002352796,0.0002870503,0.0001836416],"domain_scores_gemma":[0.992716,0.005284348,0.0006451146,0.0003000273,0.0005957522,0.0004587899],"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.0002300921,0.00008230809,0.001521461,0.0003868942,0.00009235641,0.0002623433,0.0003964909,0.1382944,0.006461009,0.8394021,0.0009524665,0.011918],"study_design_scores_gemma":[0.00001651935,0.00009701007,0.0004116909,0.00007557574,0.00002876347,0.00007204241,0.0001064197,0.7951634,0.002310429,0.2008194,0.0008660795,0.00003276675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1022181,0.003466414,0.8825865,0.002010058,0.0001385532,0.00005564316,0.0001208267,0.0001110254,0.009292838],"genre_scores_gemma":[0.832369,0.002178713,0.153357,0.0003879987,0.0002269788,0.0001762696,0.0002219432,0.0001779512,0.01090425],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004800959,"threshold_uncertainty_score":0.02539021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}