{"meta":{"query_hash":"fdf67e044dd4","filters":{"venue":"Journal of Applied and Numerical Optimization"},"cohort_total":186,"direct_labels_cover":0,"predictions_cover":186,"exported":186,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/fdf67e044dd4","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Applied+and+Numerical+Optimization"},"results":[{"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Epistemology; Computer science; Sociology; Philosophy","score_opus":0.005868689363544942,"score_gpt":0.20444849389099148,"score_spread":0.19857980452744653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974508456","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005174078,0.006874494,0.9142596,0.012674124,0.00047573447,0.00008837228,0.000069025475,0.00013158882,0.060253],"genre_scores_gemma":[0.49608883,0.014504767,0.46268162,0.003859415,0.0028825835,0.0010815746,0.00022163145,0.00034939722,0.018330231],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9877078,0.0068990206,0.0007285376,0.0015221345,0.0026942939,0.00044824524],"domain_scores_gemma":[0.98072433,0.013736271,0.0013152213,0.0023272524,0.0015199716,0.00037694874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018458955,0.0013814744,0.0019089101,0.0033050082,0.0024921575,0.007048591,0.0027025498,0.0038600087,0.0100910915],"category_scores_gemma":[0.025267594,0.0008680451,0.0019090862,0.0038399638,0.022919139,0.014578153,0.006499791,0.008208517,0.0015194179],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000024801527,0.0000042825664,0.00001892639,0.000038856215,0.0000034576985,0.0000067220703,0.00005387417,0.0015473021,0.000029373374,0.9952715,0.00037207743,0.002651106],"study_design_scores_gemma":[0.0000044933563,0.00000856055,0.0000157404,0.000037866244,0.0000018786517,0.000011180843,0.000024443809,0.004589075,0.00006722641,0.99153066,0.003704724,0.0000041313137],"about_ca_topic_score_codex":0.000865764,"about_ca_topic_score_gemma":0.0005037198,"teacher_disagreement_score":0.018458955,"about_ca_system_score_codex":0.0047789607,"about_ca_system_score_gemma":0.0038156663,"threshold_uncertainty_score":0.09762144},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.016758200204797714,"score_gpt":0.2106089504209564,"score_spread":0.1938507502161587,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2984521971","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012889836,0.0005707216,0.9835157,0.00025683548,0.00004174045,0.000038107133,0.000030156725,0.00018135046,0.0024755825],"genre_scores_gemma":[0.46425518,0.0010344445,0.5307994,0.0002899801,0.00013612119,0.00015956823,0.00016954842,0.00025151015,0.0029042275],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982894,0.0007451659,0.00007516634,0.00022904543,0.000517202,0.00014390863],"domain_scores_gemma":[0.9963574,0.002117036,0.0003066436,0.00062638277,0.0004936474,0.00009888043],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034052767,0.00097398536,0.0012383542,0.00061787927,0.0002678217,0.001071075,0.0008980197,0.0011369382,0.0025584677],"category_scores_gemma":[0.009040963,0.00041539202,0.00090820406,0.0006659847,0.0015864145,0.0016797899,0.0020909132,0.0018601029,0.00047213133],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00037712016,0.000103338396,0.00083655596,0.00043631208,0.000117733674,0.00023998297,0.00015779256,0.7824765,0.012835531,0.09561526,0.002999444,0.10380454],"study_design_scores_gemma":[0.000013631716,0.00007592589,0.000090647816,0.000016281034,0.00001205442,0.00006416207,0.000014197606,0.98617315,0.0036166299,0.008636458,0.0012785275,0.000008258818],"about_ca_topic_score_codex":0.0013182655,"about_ca_topic_score_gemma":0.00088025816,"teacher_disagreement_score":0.0034052767,"about_ca_system_score_codex":0.00049083773,"about_ca_system_score_gemma":0.0014104036,"threshold_uncertainty_score":0.018009007},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.005404647650407687,"score_gpt":0.19210244658283043,"score_spread":0.18669779893242275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997577556","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0053089834,0.0015547227,0.9797163,0.0020578997,0.0001925065,0.000037835016,0.00007893696,0.000098411736,0.010954385],"genre_scores_gemma":[0.16347823,0.0030908245,0.81673026,0.0007160232,0.000604319,0.00021816554,0.0002631541,0.00021243926,0.014686499],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987772,0.00047682444,0.00006137615,0.00024065879,0.00033747195,0.00010661269],"domain_scores_gemma":[0.9985788,0.0010228853,0.00007520377,0.00010554286,0.00017216957,0.000045475746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002895748,0.0010971596,0.0014510405,0.0015914956,0.0011567716,0.0020529062,0.001738731,0.0027577078,0.0036989702],"category_scores_gemma":[0.00904365,0.00055357954,0.0016159288,0.0025009601,0.0037092525,0.0039441325,0.002552143,0.00369162,0.001065964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006089551,0.000024027435,0.0002740971,0.00008458424,0.000031357922,0.00006626303,0.00013047348,0.12446128,0.0005740691,0.8085045,0.0062744594,0.059514035],"study_design_scores_gemma":[0.000030947213,0.000038480208,0.0001796768,0.000060821367,0.000014721397,0.00005739,0.000040700805,0.3673004,0.00069712393,0.6174001,0.014142815,0.000036769445],"about_ca_topic_score_codex":0.004200602,"about_ca_topic_score_gemma":0.0032473768,"teacher_disagreement_score":0.004200602,"about_ca_system_score_codex":0.0022341157,"about_ca_system_score_gemma":0.0018332535,"threshold_uncertainty_score":0.016209722},"labels":[],"label_agreement":null},{"id":"W3083845621","doi":"10.23952/jano.3.2021.3.01","title":"The fun is finite: Douglas-Rachford and Sudoku puzzle – Finite termination and local linear convergence","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"graph theory and CDMA systems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Leverhulme Trust","keywords":"Convergence (economics); Mathematics; Applied mathematics; Calculus (dental); Computer science; Mathematical optimization; Economics","score_opus":0.004666684971510855,"score_gpt":0.18881917530046893,"score_spread":0.18415249032895809,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3083845621","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09800988,0.0005181507,0.87854916,0.00088681164,0.000099477475,0.00008081063,0.000046278354,0.00017245601,0.021636998],"genre_scores_gemma":[0.7420588,0.0003843306,0.23996007,0.0003688149,0.00006471326,0.00029576244,0.00013552269,0.00019005053,0.016541876],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989943,0.00042093493,0.000037856833,0.000121579826,0.0002758732,0.00014937969],"domain_scores_gemma":[0.9956269,0.0026412194,0.00026444014,0.0004775976,0.0007369508,0.0002528926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031353931,0.00056897814,0.0008594745,0.0009655508,0.0012177449,0.0012143211,0.0010275068,0.001445457,0.0041344077],"category_scores_gemma":[0.016874459,0.00034914757,0.0010569325,0.00051966537,0.0034743985,0.0024519232,0.0020625375,0.0023119806,0.0005407721],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013598047,0.0000458419,0.0012162887,0.000116518655,0.000020250784,0.000367359,0.00042188587,0.17558685,0.003386189,0.78646207,0.0020122752,0.03022857],"study_design_scores_gemma":[0.00002667367,0.000065081964,0.00023095135,0.000042286123,0.0000063289094,0.00011295867,0.00008460512,0.7227205,0.0020993066,0.2720268,0.00256629,0.000018276874],"about_ca_topic_score_codex":0.0024591577,"about_ca_topic_score_gemma":0.0017870417,"teacher_disagreement_score":0.0041344077,"about_ca_system_score_codex":0.0009697926,"about_ca_system_score_gemma":0.0011658086,"threshold_uncertainty_score":0.016581774},"labels":[],"label_agreement":null},{"id":"W3093546888","doi":"10.23952/jano.3.2021.1.08","title":"Extended Gauss-Newton and ADMM-Gauss-Newton algorithms for low-rank matrix optimization","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Office of Naval Research","keywords":"Gauss; Rank (graph theory); Matrix (chemical analysis); Algorithm; Mathematics; Newton's method; Applied mathematics; Combinatorics; Physics; Materials science; Nonlinear system","score_opus":0.009184008314072734,"score_gpt":0.24314860746898437,"score_spread":0.23396459915491163,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3093546888","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013193176,0.00032464773,0.99720913,0.00010487091,0.00005007763,0.000017710896,0.000023445811,0.00012100384,0.0008297812],"genre_scores_gemma":[0.08682092,0.0010692371,0.9063255,0.0001988755,0.00020107935,0.00015917553,0.0002674417,0.00015033457,0.004807414],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992305,0.00027998115,0.00004547176,0.00012172275,0.00027038463,0.000051888055],"domain_scores_gemma":[0.99899024,0.0004633733,0.00011857396,0.00011836302,0.00026349266,0.000045920395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013563496,0.0012963859,0.0011238154,0.0007282853,0.00044602697,0.0006887272,0.001254033,0.0014283498,0.0017730886],"category_scores_gemma":[0.0035694218,0.00050775806,0.00082000124,0.0010249644,0.0009892733,0.0011243273,0.001072833,0.00223818,0.0008560001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096588155,0.000077231845,0.0005586986,0.00033708304,0.00010557489,0.0001320298,0.00011651933,0.7481001,0.0041437214,0.061306123,0.0060578245,0.17896853],"study_design_scores_gemma":[0.000008614017,0.000021461778,0.00005910486,0.000010607545,0.000005702489,0.00004271462,0.0000056240424,0.9894079,0.0007599977,0.0068492945,0.002821657,0.0000073789784],"about_ca_topic_score_codex":0.0026846423,"about_ca_topic_score_gemma":0.0036401798,"teacher_disagreement_score":0.0026846423,"about_ca_system_score_codex":0.0006167752,"about_ca_system_score_gemma":0.00150358,"threshold_uncertainty_score":0.007173121},"labels":[],"label_agreement":null},{"id":"W3160114214","doi":"10.23952/jano.3.2021.2.03","title":"A variational inequality for the derivative of the scalar play operator","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund; Grantová Agentura České Republiky","keywords":"Scalar (mathematics); Mathematics; Inequality; Variational inequality; Operator (biology); Derivative (finance); Mathematical physics; Algebra over a field; Applied mathematics; Mathematical analysis; Mathematical economics; Pure mathematics; Economics; Geometry; Chemistry","score_opus":0.011465887219513209,"score_gpt":0.23695825790202957,"score_spread":0.22549237068251635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160114214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03684481,0.0019216144,0.88972676,0.003136137,0.00034661006,0.00006514769,0.0001897041,0.000066150336,0.06770304],"genre_scores_gemma":[0.8066768,0.0029612256,0.13947578,0.0014126885,0.00049524195,0.0003080102,0.00029253992,0.00020665815,0.04817113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993293,0.00016600467,0.000026420332,0.00016939429,0.00020942334,0.000099420926],"domain_scores_gemma":[0.99895084,0.0005441406,0.00010599067,0.000047124395,0.00023922684,0.00011265574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018063559,0.00081370265,0.0007908616,0.00081497413,0.00086621125,0.0019586233,0.00097493414,0.0015124492,0.0051842504],"category_scores_gemma":[0.0043105497,0.00035174613,0.0009169622,0.00055524387,0.0028813768,0.0025917313,0.0023204663,0.0027084306,0.0006170474],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025642947,0.000020572721,0.0002158736,0.00005750064,0.000016374996,0.000106283616,0.000089766305,0.0124754,0.006542049,0.9743541,0.0011696195,0.0049267975],"study_design_scores_gemma":[0.000031354353,0.000075453994,0.00063839264,0.000078216784,0.000033615477,0.00033904094,0.000103572,0.38160902,0.0035862632,0.60399425,0.009463944,0.00004679294],"about_ca_topic_score_codex":0.0034606005,"about_ca_topic_score_gemma":0.0022510043,"teacher_disagreement_score":0.0051842504,"about_ca_system_score_codex":0.002302624,"about_ca_system_score_gemma":0.002080036,"threshold_uncertainty_score":0.017343104},"labels":[],"label_agreement":null},{"id":"W3161875491","doi":"10.23952/jano.4.2022.2.02","title":"On angles between convex cones","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Mathematics; Orthographic projection; Regular polygon; Projection (relational algebra); Hilbert space; Mathematical proof; Convergence (economics); Pure mathematics; Algebra over a field; Geometry; Algorithm","score_opus":0.008797429418133544,"score_gpt":0.2151201609620584,"score_spread":0.20632273154392486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161875491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15044844,0.010651777,0.57418174,0.0014067987,0.00081453944,0.00011156434,0.0008864998,0.00018647216,0.26131225],"genre_scores_gemma":[0.85854375,0.008112675,0.10080589,0.00071449054,0.001144207,0.00023884942,0.0013037833,0.00023909828,0.028897192],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99821705,0.00060362753,0.000089087385,0.0002984659,0.0005310717,0.0002606199],"domain_scores_gemma":[0.9973693,0.0012555282,0.00036514405,0.00015045797,0.0005448128,0.0003148327],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017183414,0.000952047,0.00058305,0.0025746685,0.0012229559,0.003386621,0.000679576,0.00067907845,0.008976771],"category_scores_gemma":[0.0059533883,0.0004650734,0.000617879,0.0018019171,0.0032170345,0.0046142875,0.0027516505,0.0029936573,0.0014565152],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021345204,0.000004674783,0.00026193412,0.000029189629,0.0000035411508,0.00003284987,0.0000959835,0.0013191724,0.00037994084,0.98934084,0.00086387584,0.0076465528],"study_design_scores_gemma":[0.000011726848,0.000048577283,0.0005959203,0.00007657176,0.0000055980327,0.00012831396,0.00026381193,0.008810866,0.00047729374,0.9717382,0.01782615,0.000017013781],"about_ca_topic_score_codex":0.0010668102,"about_ca_topic_score_gemma":0.00067813555,"teacher_disagreement_score":0.008976771,"about_ca_system_score_codex":0.0010104785,"about_ca_system_score_gemma":0.00040225795,"threshold_uncertainty_score":0.03003025},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.017021543195456002,"score_gpt":0.24155383548499498,"score_spread":0.22453229228953897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3164353206","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25392258,0.0009273685,0.71872544,0.0022794355,0.00011607135,0.00012946448,0.0010278376,0.00016849238,0.02270333],"genre_scores_gemma":[0.95891845,0.0007039015,0.02943137,0.0000975405,0.000035673675,0.00019689616,0.00036455278,0.000029647203,0.010221953],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996804,0.0001184953,0.0000097016555,0.00009930431,0.00004019104,0.000052034884],"domain_scores_gemma":[0.9996939,0.00013945445,0.00006400492,0.0000117013815,0.00004722592,0.000043867236],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050294184,0.0006525711,0.0006788604,0.0005534152,0.0007982654,0.00145946,0.0010246065,0.0019718646,0.0052846437],"category_scores_gemma":[0.0011882462,0.00046240693,0.0006644939,0.0008420597,0.0010546941,0.001655929,0.0010593069,0.0011353932,0.0002331174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020167237,0.000009302297,0.00035195728,0.000018411367,0.000008124526,0.00012541766,0.000021154785,0.98219967,0.00033716694,0.015655769,0.00022926029,0.0010235579],"study_design_scores_gemma":[0.00000902744,0.00001567335,0.00014307057,0.000005814291,0.000006269857,0.000024465193,0.000033049106,0.9920442,0.00006560913,0.007130646,0.00051363104,0.000008440041],"about_ca_topic_score_codex":0.017956773,"about_ca_topic_score_gemma":0.010278901,"teacher_disagreement_score":0.017956773,"about_ca_system_score_codex":0.0019821953,"about_ca_system_score_gemma":0.001517614,"threshold_uncertainty_score":0.035704494},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.009843123987047843,"score_gpt":0.23540081907985674,"score_spread":0.2255576950928089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3171894515","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10021633,0.00030911766,0.89444256,0.0006310343,0.000060127895,0.00014785235,0.000057488636,0.00032817025,0.0038073813],"genre_scores_gemma":[0.9658393,0.00007584754,0.032304402,0.00009748003,0.000015589872,0.000089007146,0.000028798395,0.000028295084,0.0015212945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988619,0.0005199236,0.000047208858,0.00023149049,0.00015631093,0.00018315828],"domain_scores_gemma":[0.9961188,0.002703422,0.00043531705,0.0001501032,0.00031640404,0.00027594672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023603712,0.00094848353,0.001397619,0.00038358403,0.00040712245,0.0009794674,0.0012383431,0.0016710972,0.0024237381],"category_scores_gemma":[0.009146365,0.00045746088,0.0003981195,0.00032850972,0.0011779362,0.0015830216,0.0011679722,0.0016699766,0.0002453999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016461266,0.00008655935,0.00078215287,0.000057807854,0.00003266474,0.00009730579,0.00008695442,0.9734238,0.0011991787,0.011324891,0.0005333578,0.012210761],"study_design_scores_gemma":[0.000016847112,0.000023500488,0.000070769136,0.0000048209363,0.0000042650395,0.00000910053,0.000008859832,0.99707174,0.00018888712,0.0024615012,0.00013634734,0.0000034226923],"about_ca_topic_score_codex":0.0052032582,"about_ca_topic_score_gemma":0.003400755,"teacher_disagreement_score":0.0052032582,"about_ca_system_score_codex":0.0013392721,"about_ca_system_score_gemma":0.0020921761,"threshold_uncertainty_score":0.012483001},"labels":[],"label_agreement":null},{"id":"W3172104953","doi":"10.23952/jano.4.2022.2.03","title":"Avoiding traps in nonconvex problems","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advancements in Photolithography Techniques","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Constraint (computer-aided design); Heuristic; Metric (unit); Hyperparameter; Feature (linguistics); Projection (relational algebra); Mathematical optimization; Computer science; Mathematics; Algorithm; Applied mathematics","score_opus":0.00534230158026218,"score_gpt":0.19912800201051284,"score_spread":0.19378570043025065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3172104953","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08027771,0.00088862877,0.9075588,0.00075774605,0.00007539541,0.0001618744,0.00006107535,0.00054923486,0.009669534],"genre_scores_gemma":[0.62285674,0.0007039112,0.36612234,0.00046350164,0.000051342835,0.00075593666,0.00022711667,0.00054458174,0.008274587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983084,0.0007854752,0.00011086312,0.00015110144,0.0004434969,0.00020050265],"domain_scores_gemma":[0.99019134,0.007094843,0.00082310993,0.0007935453,0.0008268896,0.0002702906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004917727,0.00093266356,0.0012146229,0.000899458,0.0012407079,0.0017629425,0.0011395501,0.0016760477,0.0037695728],"category_scores_gemma":[0.018231748,0.0010492597,0.00070612354,0.00066085166,0.00238466,0.0023287714,0.00460149,0.0021671918,0.00073497655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002410418,0.0001531071,0.0031880604,0.00073674566,0.00014523938,0.00049234554,0.0008676739,0.71626884,0.008274567,0.20482881,0.0043307696,0.060472857],"study_design_scores_gemma":[0.000036862097,0.00013201567,0.00029585947,0.00009094815,0.000013859151,0.00009601477,0.0001484561,0.9258802,0.0032128398,0.06749542,0.0025730971,0.000024377954],"about_ca_topic_score_codex":0.0011110832,"about_ca_topic_score_gemma":0.0016301972,"teacher_disagreement_score":0.004917727,"about_ca_system_score_codex":0.0006514278,"about_ca_system_score_gemma":0.0012570459,"threshold_uncertainty_score":0.026007712},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Microstructure; Coupling (piping); Transmission (telecommunications); Materials science; Composite material; Computer science; Telecommunications","score_opus":0.008645525358408773,"score_gpt":0.22531997469985043,"score_spread":0.21667444934144167,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192527474","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033901036,0.00014559456,0.94846064,0.000262973,0.000032674234,0.00007725385,0.000058721318,0.00013526624,0.01692595],"genre_scores_gemma":[0.74979717,0.00028024428,0.23221594,0.00016278318,0.000041482897,0.00026511244,0.00014943923,0.00021885496,0.016868945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99984133,0.0000485165,0.000004446805,0.000016429434,0.00007547895,0.000013846401],"domain_scores_gemma":[0.9997423,0.00015330614,0.000026260876,0.000023844535,0.00003746981,0.00001682027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006104428,0.00047351365,0.00052559836,0.00044347497,0.00054897764,0.0006107803,0.0006974051,0.0014283784,0.005372173],"category_scores_gemma":[0.0013752262,0.00031311333,0.00037064604,0.0002837976,0.00069955015,0.00050504337,0.00086553063,0.0006841505,0.0006267701],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047875823,0.00006932853,0.00050726894,0.00011195468,0.000021958334,0.00021620389,0.00014072334,0.9095666,0.011645909,0.06660715,0.0007090074,0.010356046],"study_design_scores_gemma":[0.000003608411,0.000008950547,0.00004906402,0.0000066815282,0.0000023704492,0.000021720534,0.000011903868,0.9963121,0.00057208224,0.002362582,0.00064700126,0.0000019519473],"about_ca_topic_score_codex":0.0023007013,"about_ca_topic_score_gemma":0.0024840068,"teacher_disagreement_score":0.005372173,"about_ca_system_score_codex":0.00054538244,"about_ca_system_score_gemma":0.0005824924,"threshold_uncertainty_score":0.017971694},"labels":[],"label_agreement":null},{"id":"W3198647921","doi":"10.23952/jano.4.2022.2.10","title":"Adaptive uncertainty-weighted ADMM for distributed optimization","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Machine Learning and ELM","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Adaptive optimization; Mathematical optimization; Mathematics","score_opus":0.007881869110446537,"score_gpt":0.22292802939030654,"score_spread":0.21504616027986,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198647921","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038660908,0.000058554007,0.9989064,0.00006544036,0.00001930269,0.000009271121,0.000015319569,0.00009355082,0.0004455601],"genre_scores_gemma":[0.117133856,0.00038401873,0.8777507,0.00023532961,0.0001504562,0.00027575126,0.0002595926,0.00020334369,0.0036069236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903643,0.00032127692,0.00005176569,0.00018473291,0.00034788213,0.000057939447],"domain_scores_gemma":[0.99857545,0.00070719497,0.00013036402,0.00019984717,0.00032475914,0.00006236422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017762977,0.0012237827,0.0012382334,0.0005138105,0.00055090425,0.0009306313,0.0018153526,0.00174784,0.0032572746],"category_scores_gemma":[0.0049644234,0.00052111276,0.0007925697,0.00096542103,0.0012032527,0.0015944184,0.0021028956,0.0029609827,0.0010228865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039421626,0.00002777043,0.00016240228,0.0001306032,0.000043944037,0.000059841455,0.000050687737,0.8951242,0.00198888,0.04191982,0.0038790342,0.056573473],"study_design_scores_gemma":[0.000008583028,0.000012767312,0.000017277252,0.000006125128,0.0000036523677,0.0000156091,0.0000034624998,0.98387235,0.0004851562,0.014029473,0.0015412308,0.0000042995534],"about_ca_topic_score_codex":0.0019497158,"about_ca_topic_score_gemma":0.002023763,"teacher_disagreement_score":0.0032572746,"about_ca_system_score_codex":0.0007004998,"about_ca_system_score_gemma":0.0016481291,"threshold_uncertainty_score":0.010896683},"labels":[],"label_agreement":null},{"id":"W4205304882","doi":"10.23952/jano.3.2021.3.06","title":"Improved sample efficiency by episodic memory hit ratio deep Q-networks","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Episodic memory; Sample (material); Computer science; Psychology; Neuroscience; Chemistry; Cognition","score_opus":0.0051715406517908015,"score_gpt":0.2061447720945865,"score_spread":0.20097323144279572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205304882","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0673583,0.0005555066,0.9283635,0.00028487813,0.000054250817,0.00007549102,0.000036706606,0.0008824351,0.0023889923],"genre_scores_gemma":[0.86521846,0.00018741724,0.13089022,0.00035949174,0.000038479677,0.00012150742,0.00008812589,0.00010321922,0.0029930815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99939597,0.00018650296,0.00004493808,0.00013689397,0.00014000635,0.000095689786],"domain_scores_gemma":[0.998171,0.0010580017,0.00018956355,0.0001943295,0.0002694799,0.00011765229],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018564838,0.00072359,0.0010356278,0.00035507875,0.0003302091,0.000692063,0.0016727127,0.000968338,0.0021243081],"category_scores_gemma":[0.005549446,0.0003748333,0.0003283776,0.00030216397,0.0007691141,0.0015110084,0.0012666513,0.0010951557,0.00034261716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004391721,0.00030655658,0.003095892,0.00014069202,0.000084645086,0.00013519025,0.00012691242,0.6809681,0.0066811577,0.018780105,0.0025961578,0.28664547],"study_design_scores_gemma":[0.00002465956,0.00005608886,0.00010619583,0.000004543559,0.000008134132,0.00001646462,0.000004242501,0.99575377,0.0009981261,0.0027790372,0.00024455888,0.0000041980516],"about_ca_topic_score_codex":0.0025436287,"about_ca_topic_score_gemma":0.002922063,"teacher_disagreement_score":0.0025436287,"about_ca_system_score_codex":0.0007074953,"about_ca_system_score_gemma":0.0013333262,"threshold_uncertainty_score":0.009818196},"labels":[],"label_agreement":null},{"id":"W4205379046","doi":"10.23952/jano.3.2021.3.07","title":"A note on minimax optimization problems with an infinite number of constraints","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Minimax; Mathematical optimization; Mathematics; Computer science; Applied mathematics","score_opus":0.009611660392554573,"score_gpt":0.24041513453907434,"score_spread":0.23080347414651978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205379046","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007595911,0.009023921,0.9528235,0.0056455825,0.0009184564,0.000033839766,0.00008364663,0.0000717926,0.023803258],"genre_scores_gemma":[0.3639115,0.02515878,0.5629984,0.006870651,0.005477795,0.00061901094,0.000251051,0.0006057378,0.034107022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99764293,0.0010086761,0.00013496896,0.00044916687,0.0006567272,0.000107450556],"domain_scores_gemma":[0.9902632,0.008228635,0.00036191067,0.00047858804,0.0004593617,0.0002082508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053015477,0.0014096703,0.0018225687,0.0011420932,0.0013279787,0.0017053094,0.0015837001,0.002116534,0.0045052096],"category_scores_gemma":[0.010909328,0.0007532107,0.0018564484,0.0012998855,0.0046752677,0.006738757,0.0034131228,0.010475253,0.00071081734],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000058024914,0.000031077077,0.00019857063,0.00042530088,0.000065691806,0.00037064846,0.00023417697,0.032352068,0.0031013025,0.93948007,0.004054721,0.019628327],"study_design_scores_gemma":[0.000025672782,0.00010004946,0.0002209607,0.00024868478,0.000044227472,0.0002606542,0.00005203875,0.08860564,0.0016259335,0.87617785,0.0325858,0.00005245555],"about_ca_topic_score_codex":0.0007243348,"about_ca_topic_score_gemma":0.00068385067,"teacher_disagreement_score":0.0053015477,"about_ca_system_score_codex":0.0012254985,"about_ca_system_score_gemma":0.0009849337,"threshold_uncertainty_score":0.028037608},"labels":[],"label_agreement":null},{"id":"W4205560202","doi":"10.23952/jano.3.2021.3.08","title":"Dual three-operator splitting algorithms for solving composite monotone inclusion with applications to convex minimization","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monotone polygon; Dual (grammatical number); Operator splitting; Regular polygon; Convex optimization; Minification; Operator (biology); Algorithm; Mathematics; Composite number; Combinatorics; Computer science; Mathematical optimization; Applied mathematics","score_opus":0.01150794879687846,"score_gpt":0.24825139642582314,"score_spread":0.23674344762894467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205560202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00431244,0.00012844392,0.9945523,0.00006414187,0.000018056931,0.000022269389,0.0000058764736,0.00003614834,0.0008602376],"genre_scores_gemma":[0.13498056,0.00028181428,0.862432,0.000087008506,0.00005093402,0.00017380777,0.000047708927,0.00007904374,0.0018671303],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940777,0.00019931227,0.00003728535,0.00007943382,0.00022882821,0.000047293073],"domain_scores_gemma":[0.9989555,0.0005540143,0.00008240308,0.000080259124,0.00025823133,0.00006958604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00167151,0.0009149876,0.0009746375,0.0007035077,0.0004930398,0.0007681458,0.0010833829,0.0012475573,0.0016265265],"category_scores_gemma":[0.002974215,0.00040893955,0.0010200104,0.0006401678,0.0009806462,0.0013763609,0.0020096113,0.0020450144,0.0003342442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020575694,0.00018070954,0.000967441,0.0004964193,0.00010738877,0.00029022523,0.00044568733,0.62650084,0.02105398,0.18688966,0.0019025987,0.16095926],"study_design_scores_gemma":[0.000008194178,0.000022513532,0.000025644043,0.0000058241903,0.0000038184103,0.000036150755,0.000012954476,0.99042284,0.0012304569,0.0076013156,0.0006251559,0.000005171327],"about_ca_topic_score_codex":0.0011297044,"about_ca_topic_score_gemma":0.0009954561,"teacher_disagreement_score":0.00167151,"about_ca_system_score_codex":0.0005265892,"about_ca_system_score_gemma":0.0009932352,"threshold_uncertainty_score":0.008839905},"labels":[],"label_agreement":null},{"id":"W4205821035","doi":"10.23952/jano.3.2021.3.04","title":"New linear convergence results on quasi-variational inequalities","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Variational inequality; Applied mathematics; Inequality; Mathematics; Mathematical economics; Mathematical analysis; Economics; Economic growth","score_opus":0.015783234826559495,"score_gpt":0.24570173668053172,"score_spread":0.22991850185397222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205821035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024167856,0.00017487502,0.9953719,0.00012351632,0.000060791273,0.00003604399,0.000023953846,0.000103538514,0.0016886223],"genre_scores_gemma":[0.15110302,0.0008977589,0.83892614,0.00033963867,0.00023400062,0.0004019041,0.00022038055,0.00031843118,0.0075586513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985228,0.00059751194,0.00008408035,0.0001750671,0.00050223124,0.00011839737],"domain_scores_gemma":[0.9974668,0.0013695867,0.00015592463,0.00024273866,0.00061264157,0.00015240404],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033818237,0.0013125557,0.00085900904,0.0009811266,0.0006015217,0.0016216858,0.001984366,0.001206565,0.0061415723],"category_scores_gemma":[0.0069448315,0.0006298525,0.0011429883,0.0009064263,0.001959329,0.0031654087,0.0030122187,0.00400813,0.0013237793],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025606752,0.00019791318,0.001203537,0.0006732597,0.00014120058,0.00020051825,0.00040538222,0.43104762,0.015584152,0.38857657,0.004989783,0.15672398],"study_design_scores_gemma":[0.000012828779,0.000042226886,0.00006531234,0.000017427099,0.0000057870066,0.00002942292,0.0000106231255,0.9809718,0.001359384,0.01629507,0.0011802538,0.000009763325],"about_ca_topic_score_codex":0.0016571119,"about_ca_topic_score_gemma":0.001767671,"teacher_disagreement_score":0.0061415723,"about_ca_system_score_codex":0.000834256,"about_ca_system_score_gemma":0.0016783279,"threshold_uncertainty_score":0.020545602},"labels":[],"label_agreement":null},{"id":"W4206090486","doi":"10.23952/jano.3.2021.3.03","title":"Two convergence results for a gradient-type method in Banach spaces","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Iterative Methods for Nonlinear Equations","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Banach space; Mathematics; Convergence (economics); Type (biology); Mathematical analysis; Applied mathematics; Economics; Geology","score_opus":0.06219714840935401,"score_gpt":0.390612062369212,"score_spread":0.32841491395985795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206090486","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007970567,0.0010755361,0.98085016,0.00083554955,0.00026164931,0.00012421142,0.000055419136,0.0001231562,0.008703783],"genre_scores_gemma":[0.34049886,0.0032665234,0.6264543,0.0011268914,0.00069987425,0.0010396955,0.00033325428,0.0006606977,0.025919914],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99806434,0.00082152797,0.00011245684,0.00026057183,0.0005883502,0.0001528143],"domain_scores_gemma":[0.9947918,0.0028701082,0.00032739004,0.0002838458,0.0012439195,0.00048295953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005955867,0.0025864462,0.0012288907,0.0021669506,0.0008084167,0.0018596903,0.001986594,0.0029505782,0.0028463223],"category_scores_gemma":[0.01509773,0.000620548,0.0022889245,0.000774365,0.0038551455,0.003617737,0.0042550415,0.004496608,0.0008808001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043154843,0.00028477403,0.0016570651,0.0012699503,0.00021380256,0.00072523317,0.000988802,0.14328639,0.022578169,0.75494546,0.005293128,0.06832574],"study_design_scores_gemma":[0.000068874324,0.0003079168,0.0005949471,0.00021042382,0.00005916379,0.00059393764,0.00009191352,0.85718113,0.009643163,0.12374915,0.0074013555,0.000097996446],"about_ca_topic_score_codex":0.0011778241,"about_ca_topic_score_gemma":0.000669198,"teacher_disagreement_score":0.005955867,"about_ca_system_score_codex":0.0012608009,"about_ca_system_score_gemma":0.001341873,"threshold_uncertainty_score":0.031497955},"labels":[],"label_agreement":null},{"id":"W4206290566","doi":"10.23952/jano.3.2021.3.05","title":"On sequential optimality theorems for linear fractional optimization problems involving integral functions defined on $L_n^2 [0,1]$","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Mathematics; Applied mathematics; Mathematical optimization","score_opus":0.01847058817465212,"score_gpt":0.2505827690994383,"score_spread":0.23211218092478617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206290566","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016536897,0.000698835,0.96426046,0.00057255087,0.00013996335,0.00011007115,0.00014893508,0.00007016909,0.017462123],"genre_scores_gemma":[0.3921271,0.0032174652,0.5859326,0.0009236796,0.00061777094,0.0009519566,0.0006185892,0.0004065927,0.015204251],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985025,0.0005207005,0.00009530047,0.00025820383,0.00045064758,0.00017265542],"domain_scores_gemma":[0.9955596,0.003095733,0.0003555404,0.00015279786,0.0006892905,0.00014700608],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069156894,0.0022327078,0.0013037887,0.0019197434,0.00088440155,0.0015531686,0.001204611,0.0011529543,0.006116806],"category_scores_gemma":[0.00951585,0.00060912233,0.0019646175,0.0012909865,0.0027946678,0.0038443985,0.0027220761,0.0033836416,0.00091930485],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001444789,0.0001434065,0.00052701065,0.00031033167,0.000051134088,0.00018850986,0.00024973048,0.1069563,0.0069492836,0.856411,0.0030753338,0.024993507],"study_design_scores_gemma":[0.000059819773,0.00027392776,0.00041207953,0.00013382245,0.000038836402,0.0001373002,0.00009114669,0.537662,0.004913576,0.4500664,0.006175749,0.000035379635],"about_ca_topic_score_codex":0.0018415888,"about_ca_topic_score_gemma":0.0015474124,"teacher_disagreement_score":0.0069156894,"about_ca_system_score_codex":0.0015721327,"about_ca_system_score_gemma":0.0025661977,"threshold_uncertainty_score":0.036574066},"labels":[],"label_agreement":null},{"id":"W4206640931","doi":"10.23952/jano.3.2021.3.02","title":"Phase retrieval with sub-Gaussian measurements via Riemannian optimization","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced X-ray Imaging Techniques","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Safety Academic Fund; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Gaussian; Phase retrieval; Phase (matter); Computer science; Statistical physics; Mathematics; Physics; Mathematical analysis; Quantum mechanics; Fourier transform","score_opus":0.011003256910630366,"score_gpt":0.26129050282563065,"score_spread":0.2502872459150003,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206640931","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042553074,0.00012118208,0.9949591,0.000093624214,0.000012108521,0.000012911844,0.000019091118,0.00012262596,0.00040402063],"genre_scores_gemma":[0.32452595,0.0008950368,0.66948986,0.00029052148,0.00012176446,0.00018623719,0.0003208412,0.0002491857,0.0039206245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993228,0.00022907139,0.000032036423,0.00018399101,0.0001881618,0.000043992066],"domain_scores_gemma":[0.99930406,0.000288529,0.00012663637,0.00010590536,0.00012845077,0.000046428708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011069808,0.0010761146,0.0011153027,0.0005749472,0.00032651858,0.0008848761,0.0010733288,0.0011864236,0.0010847584],"category_scores_gemma":[0.0038084541,0.0004532831,0.00077229936,0.00068504724,0.0011890801,0.0022691372,0.0015946073,0.0012367358,0.0005814648],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020532288,0.000046771445,0.0012101915,0.0003577751,0.00013087736,0.0002085503,0.00021481692,0.69111204,0.027796779,0.09248988,0.003074268,0.18315269],"study_design_scores_gemma":[0.0000068034346,0.000021695794,0.00011796704,0.0000045508004,0.0000057964658,0.000038784976,0.0000064731316,0.9872793,0.0019803932,0.009761213,0.0007651055,0.00001192208],"about_ca_topic_score_codex":0.002392434,"about_ca_topic_score_gemma":0.0016514844,"teacher_disagreement_score":0.002392434,"about_ca_system_score_codex":0.00067458,"about_ca_system_score_gemma":0.0010686727,"threshold_uncertainty_score":0.0058543086},"labels":[],"label_agreement":null},{"id":"W4212892245","doi":"10.23952/jano.1.2019.3.04","title":"Solving bilevel problems with polyhedral constraint set","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bilevel optimization; Constraint (computer-aided design); Set (abstract data type); Mathematical optimization; Computer science; Mathematics; Optimization problem; Geometry","score_opus":0.007189926153251263,"score_gpt":0.19216286614363703,"score_spread":0.18497293999038578,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4212892245","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010452744,0.00023317499,0.9859928,0.0002277587,0.000030786774,0.000039390703,0.000046162768,0.000097282755,0.0028799018],"genre_scores_gemma":[0.39268208,0.0009857793,0.59853446,0.0002953185,0.00009860881,0.000431877,0.0004230793,0.00030533547,0.0062435153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868304,0.0005092264,0.00006848984,0.00022705965,0.00032747423,0.00018475615],"domain_scores_gemma":[0.99667263,0.0026233979,0.00017696903,0.00016918758,0.0002402023,0.00011757365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021916337,0.001239254,0.0020045014,0.0007234642,0.0006532469,0.003276002,0.0013631528,0.0021449681,0.0050551826],"category_scores_gemma":[0.009234932,0.0009222008,0.0013006985,0.0014282207,0.0019153877,0.0027348083,0.0031556438,0.003800201,0.00059826893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051007402,0.000060051672,0.0003587688,0.00025122124,0.000044344113,0.00008722581,0.00010001614,0.88723224,0.0007550749,0.08749824,0.0007194668,0.022842351],"study_design_scores_gemma":[0.000015491927,0.00004450815,0.00004376666,0.00003519135,0.0000067416845,0.00003139691,0.000045349345,0.9137351,0.0006128313,0.08419066,0.0012283364,0.0000106482585],"about_ca_topic_score_codex":0.002039081,"about_ca_topic_score_gemma":0.0018694574,"teacher_disagreement_score":0.0050551826,"about_ca_system_score_codex":0.0009026272,"about_ca_system_score_gemma":0.0014910756,"threshold_uncertainty_score":0.016911268},"labels":[],"label_agreement":null},{"id":"W4225767607","doi":"10.23952/jano.4.2022.1.03","title":"Vectorization in nonconvex set optimization","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vectorization (mathematics); Set (abstract data type); Computer science; Mathematical optimization; Mathematics; Algorithm; Parallel computing; Programming language","score_opus":0.007936345292094815,"score_gpt":0.2178672487866019,"score_spread":0.2099309034945071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225767607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002825666,0.00076533423,0.99258834,0.00020192642,0.00008215467,0.000024800956,0.000028186025,0.00004684194,0.0034367878],"genre_scores_gemma":[0.38120335,0.005448208,0.57928944,0.00048346055,0.0005086567,0.0005028683,0.0004463391,0.00037086327,0.031746875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989851,0.00043492383,0.000058898248,0.0001536729,0.00029704848,0.00007031961],"domain_scores_gemma":[0.99937844,0.00026400358,0.000073131836,0.00006984707,0.00016431893,0.00005025745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012150013,0.0010216029,0.0010547633,0.0010075642,0.0004489911,0.001563467,0.0010267104,0.000703506,0.003182857],"category_scores_gemma":[0.0017723258,0.0004587618,0.0009530082,0.001185005,0.0015985287,0.0026950496,0.0019669263,0.0022504656,0.00074282],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027712746,0.000038228383,0.00015224172,0.00021135136,0.00003326453,0.00005275275,0.00006962693,0.12342102,0.004060563,0.8090913,0.0022245764,0.06061736],"study_design_scores_gemma":[0.00000941561,0.00008237703,0.0001264928,0.00003626026,0.000012143152,0.000062253355,0.00003646976,0.6742695,0.0018616677,0.31221163,0.011267356,0.000024403607],"about_ca_topic_score_codex":0.0009999775,"about_ca_topic_score_gemma":0.0009566848,"teacher_disagreement_score":0.003182857,"about_ca_system_score_codex":0.0012601748,"about_ca_system_score_gemma":0.0010134199,"threshold_uncertainty_score":0.010647714},"labels":[],"label_agreement":null},{"id":"W4226195069","doi":"10.23952/jano.4.2022.1.01","title":"A Special Issue on Recent Progress on Vector Optimization and Related Topics Dedicated to Professor Dinh The Luc on the occasion of his 70th birthday","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Engineering ethics; Computer science; Data science; Computational biology; Engineering; Biology","score_opus":0.024967813549732702,"score_gpt":0.31040457697538554,"score_spread":0.28543676342565283,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226195069","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00072074693,0.06119188,0.005870889,0.019530125,0.89347744,0.00006818771,0.00035806265,0.00023611171,0.01854651],"genre_scores_gemma":[0.0038547849,0.04147313,0.0034231048,0.0062597743,0.8688969,0.00008696785,0.0009086645,0.00044385105,0.07465288],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.997982,0.00036177182,0.00015895728,0.00037143764,0.00095243583,0.00017328214],"domain_scores_gemma":[0.9940485,0.0020600234,0.00043971915,0.00032630132,0.0016706284,0.0014548845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018813529,0.0017879887,0.0024792275,0.0032671792,0.0013317018,0.0053545884,0.0017576136,0.002533948,0.06349137],"category_scores_gemma":[0.005886368,0.0005916796,0.0012712805,0.002910549,0.0010583184,0.0039123218,0.0023114944,0.004599307,0.021611728],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053110714,0.000049190123,0.00008863296,0.00040868888,0.000034262514,0.00004883023,0.0000165204,0.00019968585,0.0006665466,0.002998862,0.9482659,0.047169738],"study_design_scores_gemma":[0.00002372618,0.00013667282,0.00057633396,0.00028227185,0.000036345966,0.00022590083,0.000029131561,0.0006553151,0.00041370746,0.007432013,0.9901648,0.000023662411],"about_ca_topic_score_codex":0.00034032617,"about_ca_topic_score_gemma":0.0009315618,"teacher_disagreement_score":0.06349137,"about_ca_system_score_codex":0.0012317641,"about_ca_system_score_gemma":0.0014586374,"threshold_uncertainty_score":0.21239978},"labels":[],"label_agreement":null},{"id":"W4226200284","doi":"10.23952/jano.4.2022.1.09","title":"Solvability of convex optimization problems on a *-continuous closed convex set","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Subderivative; Convex set; Regular polygon; Proper convex function; Convex analysis; Conic optimization; Set (abstract data type); Convex optimization; Mathematics; Mathematical optimization; Convex combination; Convex polytope; Absolutely convex set; Computer science; Geometry","score_opus":0.010002825590155064,"score_gpt":0.21609861142083092,"score_spread":0.20609578583067586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226200284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22328258,0.0008922242,0.7626583,0.0012064864,0.000045279176,0.00009208428,0.00015728266,0.00010048028,0.011565338],"genre_scores_gemma":[0.8947335,0.00083316,0.09590391,0.00011807428,0.00011371369,0.00031580497,0.0003740247,0.00009655211,0.0075112795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990097,0.00041751986,0.00004811716,0.00024501298,0.00018618905,0.00009343559],"domain_scores_gemma":[0.99639016,0.0027795767,0.00037090527,0.00009036761,0.00018106171,0.00018793748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024055429,0.0014487974,0.0013784578,0.0006842532,0.0005343581,0.0021846083,0.00094224286,0.0012345174,0.0015483762],"category_scores_gemma":[0.0061914753,0.000661461,0.0013125533,0.00063218415,0.0024189753,0.002675388,0.0025537251,0.0021711923,0.00019402361],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038326377,0.00021499458,0.0015757799,0.000556769,0.00022991562,0.00069210876,0.00080457673,0.3232177,0.015208909,0.63409233,0.0016127239,0.021410963],"study_design_scores_gemma":[0.000042181724,0.00012995153,0.00029135853,0.000032971777,0.00001861135,0.00010427042,0.00011328479,0.8498975,0.0019480826,0.14651638,0.000890303,0.000015163453],"about_ca_topic_score_codex":0.0013980917,"about_ca_topic_score_gemma":0.0006349292,"teacher_disagreement_score":0.0024055429,"about_ca_system_score_codex":0.0011643831,"about_ca_system_score_gemma":0.0013824465,"threshold_uncertainty_score":0.012721837},"labels":[],"label_agreement":null},{"id":"W4226279112","doi":"10.23952/jano.4.2022.1.02","title":"Relaxed Lagrangian duality in convex infinite optimization: Reverse strong duality and optimality","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; European Regional Development Fund; Viet Nam National University Ho Chi Minh City; Ministerio de Ciencia, Innovación y Universidades","keywords":"Duality (order theory); Lagrangian; Strong duality; Convex analysis; Mathematics; Duality gap; Perturbation function; Fenchel's duality theorem; Regular polygon; Convex optimization; Mathematical optimization; Wolfe duality; Weak duality; Applied mathematics; Pure mathematics; Optimization problem; Geometry","score_opus":0.011958170476297988,"score_gpt":0.23406817775916275,"score_spread":0.22211000728286476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226279112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03197739,0.0009311754,0.94386834,0.0009677984,0.00013544186,0.00003076883,0.000103125945,0.00006294063,0.021923022],"genre_scores_gemma":[0.71382946,0.001766865,0.26928496,0.0005904701,0.00039844817,0.00025806195,0.00034646346,0.00019504022,0.013330343],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99830735,0.0009858102,0.00007013941,0.00020537392,0.00028869815,0.00014269205],"domain_scores_gemma":[0.9976273,0.0014256141,0.00028353563,0.00021947891,0.00026896223,0.00017505462],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0042077308,0.0010435013,0.0009801643,0.0009879961,0.00066460756,0.0024938246,0.0011329969,0.00090399233,0.0028232143],"category_scores_gemma":[0.006083848,0.0005038934,0.0012008157,0.0010772814,0.0034728353,0.004364626,0.003391896,0.003893339,0.00058855186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004432196,0.00003280687,0.00019676336,0.00007889769,0.000016682527,0.00008399152,0.00010146144,0.023826802,0.0010171536,0.96582806,0.0009240601,0.0078489175],"study_design_scores_gemma":[0.00001778591,0.000087589,0.00014922726,0.000045513912,0.000013088868,0.000124436,0.00007812937,0.21025962,0.0016504308,0.78401077,0.003544786,0.00001865258],"about_ca_topic_score_codex":0.00048768046,"about_ca_topic_score_gemma":0.0003343876,"teacher_disagreement_score":0.0042077308,"about_ca_system_score_codex":0.0011953721,"about_ca_system_score_gemma":0.0009750806,"threshold_uncertainty_score":0.022252858},"labels":[],"label_agreement":null},{"id":"W4226337303","doi":"10.23952/jano.4.2022.1.04","title":"Set-valued variational principles. When migration improves quality of life","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Aix-Marseille Université","keywords":"Set (abstract data type); Quality of life (healthcare); Quality (philosophy); Mathematical optimization; Applied mathematics; Mathematics; Computer science; Psychology; Epistemology; Philosophy; Psychotherapist","score_opus":0.023234993276034427,"score_gpt":0.25191491913896796,"score_spread":0.22867992586293354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226337303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.049083553,0.00238255,0.91387725,0.004322755,0.00039293876,0.000107608146,0.00021944441,0.00006871359,0.029545262],"genre_scores_gemma":[0.877591,0.0013098625,0.10823152,0.00063657045,0.00015166939,0.00021344675,0.00014329603,0.000083067396,0.011639486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99866116,0.000631054,0.000058027596,0.00022329629,0.00033196254,0.00009454789],"domain_scores_gemma":[0.9992055,0.00032174098,0.00016263171,0.000081463215,0.00014979791,0.000078874444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023687244,0.0006056611,0.00054388685,0.00043802365,0.00046723406,0.0012963674,0.0011771298,0.0010977606,0.0034782125],"category_scores_gemma":[0.00395348,0.00021924525,0.0008642183,0.00039306885,0.0017489818,0.0017212091,0.001563499,0.0018959768,0.00034397896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029488843,0.000036689595,0.0006524508,0.00017797368,0.000065002576,0.00007939197,0.00022798659,0.032317713,0.0039071855,0.94115376,0.0011824952,0.020169713],"study_design_scores_gemma":[0.000021020984,0.000150182,0.0012012069,0.000067888934,0.00003090141,0.00017073723,0.00018516126,0.13533053,0.0014573773,0.8531309,0.008225553,0.00002849963],"about_ca_topic_score_codex":0.0011227487,"about_ca_topic_score_gemma":0.00089734746,"teacher_disagreement_score":0.0034782125,"about_ca_system_score_codex":0.001266918,"about_ca_system_score_gemma":0.0009528347,"threshold_uncertainty_score":0.012527108},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.03711402008024802,"score_gpt":0.24367029991618222,"score_spread":0.2065562798359342,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226356618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07545797,0.0007292443,0.8971122,0.0006626362,0.00010828091,0.00021516002,0.0001938455,0.00005808941,0.025462518],"genre_scores_gemma":[0.9009593,0.00090174266,0.080049336,0.00017003312,0.00009624139,0.00032638267,0.00012720424,0.0000343487,0.017335288],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980059,0.0011880416,0.000071388014,0.00031992668,0.00022734431,0.00018733212],"domain_scores_gemma":[0.9986534,0.0008076168,0.00021853422,0.000065357635,0.00010882435,0.00014622204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024075485,0.0014757555,0.0015592945,0.00079540507,0.0007475235,0.0026036273,0.0024095478,0.002472269,0.0055087516],"category_scores_gemma":[0.0032504315,0.00068408274,0.0018027467,0.0009597245,0.0018745011,0.0030863672,0.0016951254,0.0017531703,0.00058208196],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010059088,0.00011356872,0.00086034817,0.00016708953,0.0001433967,0.0005890584,0.0002609211,0.6077998,0.0017324933,0.38153774,0.000806691,0.005888242],"study_design_scores_gemma":[0.00003327025,0.000090225825,0.00022298991,0.000015532705,0.000027592587,0.0000666039,0.00007568618,0.89380217,0.00015485722,0.104478315,0.0010069081,0.000025850182],"about_ca_topic_score_codex":0.0040156334,"about_ca_topic_score_gemma":0.0040228544,"teacher_disagreement_score":0.0055087516,"about_ca_system_score_codex":0.00198496,"about_ca_system_score_gemma":0.0010834417,"threshold_uncertainty_score":0.018428624},"labels":[],"label_agreement":null},{"id":"W4226363315","doi":"10.23952/jano.4.2022.1.05","title":"A new class of vector optimization problems with linear fractional objective criteria","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vietnam Institute for Advanced Study in Mathematics; Le Quy Don Technical University; Vietnam Academy of Science and Technology","keywords":"Class (philosophy); Mathematics; Vector optimization; Mathematical optimization; Optimization problem; Computer science; Applied mathematics; Artificial intelligence; Multi-swarm optimization","score_opus":0.007806373512615274,"score_gpt":0.22506443750229171,"score_spread":0.21725806398967645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226363315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025006609,0.0011614881,0.95926124,0.0005376881,0.00012297765,0.00006921869,0.00011251385,0.00006624689,0.013662028],"genre_scores_gemma":[0.66559947,0.0040282323,0.30277377,0.0005099116,0.0009107678,0.00043440025,0.0006215735,0.00018477466,0.024937147],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925,0.0002380795,0.00004360514,0.00015400813,0.00024077247,0.0000735283],"domain_scores_gemma":[0.99928826,0.00040381245,0.00011459582,0.00003995028,0.000103397266,0.00005001491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012053634,0.0010216546,0.0009641135,0.0011267102,0.00060641574,0.0022045413,0.0008270252,0.0013522048,0.003049071],"category_scores_gemma":[0.002022367,0.00028735228,0.00087791524,0.0011679166,0.0011066003,0.0033028084,0.0013910679,0.0018921889,0.00025803348],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008004121,0.00013446016,0.00088320166,0.0002883515,0.00006609369,0.00046111847,0.00014370079,0.19603471,0.005900378,0.73510927,0.0040351325,0.05686362],"study_design_scores_gemma":[0.000038002298,0.00008862417,0.00038683758,0.000038309598,0.000027038279,0.00030576825,0.00007814704,0.7723513,0.0013173693,0.20943737,0.015904581,0.000026724267],"about_ca_topic_score_codex":0.0007170126,"about_ca_topic_score_gemma":0.0005772779,"teacher_disagreement_score":0.003049071,"about_ca_system_score_codex":0.0007522685,"about_ca_system_score_gemma":0.0006759856,"threshold_uncertainty_score":0.010200202},"labels":[],"label_agreement":null},{"id":"W4226394830","doi":"10.23952/jano.4.2022.1.08","title":"Optimality and duality for semidefinite multiobjective programming problems using convexificators","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board","keywords":"Duality (order theory); Semidefinite programming; Mathematical optimization; Semidefinite embedding; Multiobjective programming; Mathematics; Strong duality; Multi-objective optimization; Mathematical economics; Computer science; Combinatorics; Optimization problem; Quadratically constrained quadratic program; Quadratic programming","score_opus":0.02250132360065009,"score_gpt":0.2564471490728111,"score_spread":0.23394582547216097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226394830","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01380209,0.0003450654,0.97319883,0.00028908634,0.000052086205,0.00006384438,0.00006592619,0.000033389322,0.01214972],"genre_scores_gemma":[0.59129417,0.0016828134,0.3872503,0.00042140024,0.00016038066,0.0005627328,0.00036113983,0.00022503248,0.018042034],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988343,0.00055299094,0.0000589329,0.00018942614,0.00026441884,0.00009985521],"domain_scores_gemma":[0.99861157,0.00093332765,0.00012212545,0.00007425226,0.00019281,0.00006580607],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003236428,0.0015119439,0.00091535604,0.0008905936,0.0005762426,0.0018662465,0.0008415659,0.0011562979,0.0024963643],"category_scores_gemma":[0.004500225,0.0005795573,0.0012482824,0.0007433454,0.002397869,0.0022856775,0.0017485764,0.0028535502,0.0004772084],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004442146,0.00005639942,0.00028438616,0.00020393438,0.000043664175,0.00012268471,0.00017718904,0.18979508,0.0038969398,0.78959906,0.0013337934,0.014442521],"study_design_scores_gemma":[0.0000219811,0.00008275068,0.00021810118,0.00005288473,0.000014950063,0.0000714958,0.00007219185,0.7120099,0.0028008323,0.28067657,0.003954267,0.000024095285],"about_ca_topic_score_codex":0.0012984829,"about_ca_topic_score_gemma":0.0015123816,"teacher_disagreement_score":0.003236428,"about_ca_system_score_codex":0.0014756874,"about_ca_system_score_gemma":0.0016364704,"threshold_uncertainty_score":0.01711607},"labels":[],"label_agreement":null},{"id":"W4226455594","doi":"10.23952/jano.4.2022.1.07","title":"Strategic decision in a two-period game using a multi-leader-follower approach. Part 2 – Decision making for the new player","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":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Università degli Studi di Brescia; Centre National de la Recherche Scientifique","keywords":"Mathematical economics; Uniqueness; Nash equilibrium; Computer science; Non-cooperative game; Strategy; Sequential game; Game theory; Mathematical optimization; Mathematics","score_opus":0.06457936149856162,"score_gpt":0.27782919541633616,"score_spread":0.21324983391777452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226455594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15876733,0.0005549636,0.8184201,0.00095862866,0.00010453534,0.00017323092,0.00011895874,0.000044859233,0.020857427],"genre_scores_gemma":[0.9330307,0.00034029875,0.056060906,0.00012132938,0.000054830787,0.00012748443,0.000041916202,0.000015780337,0.010206709],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991142,0.00052761775,0.000030008658,0.00013587261,0.00010365104,0.0000886477],"domain_scores_gemma":[0.9989899,0.0006760982,0.00014564978,0.000038125974,0.000058388814,0.00009184904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001657355,0.0006699523,0.0008225298,0.00038642515,0.00051699515,0.0015203101,0.0010789806,0.0013853058,0.0045413193],"category_scores_gemma":[0.0018525119,0.000343837,0.0010361755,0.00037831406,0.0012750747,0.0016171057,0.0010112686,0.0012203673,0.0002867409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012965966,0.00010648144,0.0010933375,0.000107562184,0.00010187212,0.00037967184,0.00023251829,0.74679667,0.0024294003,0.24060693,0.00073499035,0.0072809337],"study_design_scores_gemma":[0.000025609243,0.00007121206,0.00023581575,0.000008198651,0.000015984748,0.0000317915,0.000055170243,0.9556249,0.00018011592,0.04318802,0.00054866576,0.000014508133],"about_ca_topic_score_codex":0.00281059,"about_ca_topic_score_gemma":0.003386626,"teacher_disagreement_score":0.0045413193,"about_ca_system_score_codex":0.0013311432,"about_ca_system_score_gemma":0.0009382854,"threshold_uncertainty_score":0.015192211},"labels":[],"label_agreement":null},{"id":"W4229775072","doi":"10.23952/jano.1.2019.2.03","title":"A Henig conical regularization approach for circumventing the Slater conundrum in linearly $\\ell_{+}^{p}$-constrained least squares problems","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund; Ministerio de Ciencia, Innovación y Universidades; Agencia Estatal de Investigación; National Science Foundation","keywords":"Conical surface; Regularization (linguistics); Mathematics; Physics; Combinatorics; Applied mathematics; Geometry; Computer science; Artificial intelligence","score_opus":0.020263110182131294,"score_gpt":0.2553146937593069,"score_spread":0.2350515835771756,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229775072","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0051417383,0.00007280733,0.9930935,0.00020149772,0.000015394382,0.000016563825,0.000020248699,0.00004237986,0.0013959077],"genre_scores_gemma":[0.32820207,0.0005519201,0.66140735,0.00064391224,0.00019208466,0.00026073185,0.00023184731,0.00025957313,0.008250491],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99932206,0.00033197037,0.000025480726,0.000106798696,0.00016972957,0.000043991447],"domain_scores_gemma":[0.99907804,0.00051241915,0.00009921277,0.00011968416,0.00013659163,0.000054027845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018827511,0.000857376,0.0007433036,0.00056004524,0.0005800331,0.00095645024,0.0012111864,0.0014257535,0.0014188469],"category_scores_gemma":[0.0032841845,0.0004390937,0.0006876001,0.0005948299,0.001839614,0.0013564794,0.0019790547,0.0021724529,0.00044448246],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008506006,0.00006119376,0.0006551682,0.00015209419,0.0000656286,0.00023217652,0.00019812753,0.3698109,0.01689701,0.5688454,0.00275778,0.040239546],"study_design_scores_gemma":[0.000007192962,0.00003334691,0.00009398482,0.000009598608,0.0000045115635,0.000035454163,0.000020752599,0.93781954,0.0014750945,0.059341777,0.0011440766,0.000014665247],"about_ca_topic_score_codex":0.0014181824,"about_ca_topic_score_gemma":0.0015765347,"teacher_disagreement_score":0.0018827511,"about_ca_system_score_codex":0.00045256838,"about_ca_system_score_gemma":0.0010297662,"threshold_uncertainty_score":0.0099570155},"labels":[],"label_agreement":null},{"id":"W4229988500","doi":"10.23952/jano.1.2019.3.08","title":"Representation of the Pareto front for heterogeneous multi-objective optimization","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Representation (politics); Multi-objective optimization; Front (military); Pareto principle; Computer science; Mathematical optimization; Mathematical economics; Mathematics; Engineering; Political science; Mechanical engineering","score_opus":0.01168561794993419,"score_gpt":0.25649472857169725,"score_spread":0.24480911062176305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229988500","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0055534225,0.00029472564,0.99066025,0.0000641395,0.000019118002,0.000039608512,0.000038285394,0.00007014529,0.0032603717],"genre_scores_gemma":[0.5055585,0.0011206783,0.48697865,0.00011870493,0.000068382935,0.00045872646,0.00038267658,0.00014692251,0.0051666982],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922335,0.0003195508,0.000035101464,0.0000633954,0.00027902995,0.00007957117],"domain_scores_gemma":[0.99923825,0.00039756874,0.000077463985,0.00009003736,0.00015408461,0.000042600135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020538657,0.001327705,0.0008780512,0.0016571885,0.0004503023,0.0016258685,0.0010993017,0.001186497,0.0038146842],"category_scores_gemma":[0.0030860428,0.00031258215,0.0012323027,0.0014272076,0.00067045336,0.0012748908,0.0012774883,0.0013486069,0.00071758416],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049393253,0.000048853948,0.00021059155,0.000118593045,0.000026385358,0.00009876885,0.000063625506,0.89253896,0.0021957208,0.071738325,0.0010761705,0.031834494],"study_design_scores_gemma":[0.0000045171646,0.000020674017,0.000050000002,0.000012487954,0.0000047456506,0.00002161993,0.00000997125,0.9868688,0.00033262663,0.012015523,0.00065442687,0.000004622461],"about_ca_topic_score_codex":0.0017918965,"about_ca_topic_score_gemma":0.0010083498,"teacher_disagreement_score":0.0038146842,"about_ca_system_score_codex":0.001035074,"about_ca_system_score_gemma":0.0007712194,"threshold_uncertainty_score":0.012761414},"labels":[],"label_agreement":null},{"id":"W4230319725","doi":"10.23952/jano.3.2021.1.05","title":"Minimax exactness and global saddle points of nonlinear augmented Lagrangians","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Differential Geometry Research","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Minimax; Saddle point; Nonlinear system; Mathematics; Applied mathematics; Saddle; Mathematical optimization; Mathematical economics; Physics; Geometry","score_opus":0.008203083147464096,"score_gpt":0.2638626601844168,"score_spread":0.2556595770369527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230319725","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08109821,0.00042999847,0.90953505,0.00058337406,0.00003584163,0.00003433765,0.00007642146,0.00005377511,0.008152979],"genre_scores_gemma":[0.915172,0.0005807128,0.076588295,0.00013086709,0.00004742572,0.00013549866,0.00012511635,0.00007729145,0.0071428493],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996877,0.00014070452,0.000016623842,0.00005932834,0.000056782254,0.000039036928],"domain_scores_gemma":[0.9987896,0.00067099463,0.00021586179,0.000090825015,0.0001636279,0.0000691729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017027258,0.000856426,0.00079279294,0.0007503147,0.0004427698,0.0011783728,0.000631594,0.00082220574,0.0025193624],"category_scores_gemma":[0.004830705,0.00034851787,0.00062672736,0.000448005,0.0019265264,0.0021825419,0.0016510495,0.0013453413,0.00025102208],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003993881,0.000033020377,0.0007420426,0.00014461644,0.00004631666,0.00018622124,0.00020685834,0.31037647,0.0033682417,0.6717233,0.0008263243,0.012306603],"study_design_scores_gemma":[0.000010928186,0.00005712091,0.00022350733,0.000032636926,0.000007650743,0.00004903001,0.000051130482,0.7647101,0.0009836293,0.23291521,0.00094685855,0.000012145875],"about_ca_topic_score_codex":0.00055400975,"about_ca_topic_score_gemma":0.00053759216,"teacher_disagreement_score":0.0025193624,"about_ca_system_score_codex":0.00060340535,"about_ca_system_score_gemma":0.00061374734,"threshold_uncertainty_score":0.00900501},"labels":[],"label_agreement":null},{"id":"W4230794122","doi":"10.23952/jano.2.2020.2.05","title":"Weak convergence of a primal-dual algorithm for split common fixed-point problems in Hilbert spaces","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Tianjin Municipal Education Commission","keywords":"Convergence (economics); Hilbert space; Mathematics; Fixed point; Dual (grammatical number); Algorithm; Weak convergence; Computer science; Pure mathematics; Mathematical analysis; Linguistics","score_opus":0.011845325650636642,"score_gpt":0.22799098491161757,"score_spread":0.21614565926098092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230794122","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037500628,0.000108868175,0.9954396,0.000066644534,0.00002617999,0.000021129305,0.0000053407966,0.00002641924,0.0005557161],"genre_scores_gemma":[0.27077058,0.00040306716,0.7241727,0.00015728484,0.0000952857,0.0003952357,0.00010219758,0.00013156261,0.0037720723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908686,0.00040356224,0.00004942801,0.0001463621,0.00024031888,0.00007346723],"domain_scores_gemma":[0.9985784,0.0008139653,0.00009635322,0.00008631374,0.00032319027,0.0001017884],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035700134,0.0013154686,0.0015111996,0.0008998853,0.0006197111,0.0014367932,0.0017701322,0.0018145044,0.0021593843],"category_scores_gemma":[0.0048550577,0.0006785231,0.00092309923,0.00070041534,0.001667279,0.002020247,0.002784736,0.0028065906,0.00044992578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020726267,0.00012780109,0.0010050819,0.0003678353,0.00016183557,0.00019107739,0.00026484433,0.71108764,0.0066968626,0.19457376,0.001935753,0.08338022],"study_design_scores_gemma":[0.000012962438,0.000031445106,0.000029954064,0.000007407154,0.0000049382675,0.000023355029,0.0000100164325,0.9895573,0.00051635195,0.00932373,0.00047666323,0.0000058391474],"about_ca_topic_score_codex":0.0012352295,"about_ca_topic_score_gemma":0.0010252729,"teacher_disagreement_score":0.0035700134,"about_ca_system_score_codex":0.00093770673,"about_ca_system_score_gemma":0.0016534587,"threshold_uncertainty_score":0.018880308},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Aix-Marseille Université","keywords":"Set (abstract data type); Mathematical optimization; Computer science; Mathematical economics; Mathematics; Programming language","score_opus":0.004617188997102028,"score_gpt":0.20274176481851575,"score_spread":0.1981245758214137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231157253","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015275679,0.0006305988,0.9720339,0.0007283054,0.00008373384,0.000028731098,0.000048014,0.000052445786,0.011118583],"genre_scores_gemma":[0.7184576,0.0016497524,0.25572008,0.0005040425,0.0002892971,0.00026097536,0.00012816039,0.00019447695,0.022795606],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992336,0.000334703,0.00002647743,0.00010539665,0.00022209888,0.00007769817],"domain_scores_gemma":[0.99900633,0.0006004934,0.000079126075,0.00007288164,0.00013687454,0.00010441286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020849947,0.00066660735,0.00069834985,0.00076127826,0.00070252747,0.0011914553,0.0011076023,0.0008789063,0.0023024608],"category_scores_gemma":[0.0038140449,0.00039238745,0.001018435,0.0007905998,0.002212003,0.0018526069,0.0020902418,0.0018334639,0.0002001199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011266045,0.000015572203,0.00018754121,0.00003598426,0.000019164387,0.000041190735,0.00007969627,0.09610841,0.00088859606,0.8948027,0.0006253353,0.0071846284],"study_design_scores_gemma":[0.0000076016677,0.000021969006,0.00014825664,0.000009582166,0.0000053261724,0.000024347013,0.000029776611,0.491246,0.00030402266,0.50554055,0.0026513243,0.000011176926],"about_ca_topic_score_codex":0.0033992121,"about_ca_topic_score_gemma":0.002631614,"teacher_disagreement_score":0.0033992121,"about_ca_system_score_codex":0.0018981392,"about_ca_system_score_gemma":0.001389233,"threshold_uncertainty_score":0.013772011},"labels":[],"label_agreement":null},{"id":"W4231809672","doi":"10.23952/jano.2.2020.1.08","title":"Three extensions of Butnariu-Reich-Zaslavski theorem for inexact infinite products of nonexpansive mappings","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.017310395515079815,"score_gpt":0.22640861560569664,"score_spread":0.20909822009061682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231809672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.085252084,0.0022902414,0.87690014,0.0011215556,0.0005850495,0.00009888895,0.00017591543,0.0002459831,0.033330128],"genre_scores_gemma":[0.86937344,0.0029212818,0.10446901,0.0006385417,0.0008126485,0.00024914293,0.00040530428,0.00021227688,0.020918394],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99838185,0.00033128375,0.00013889819,0.00036905037,0.0006142785,0.00016464926],"domain_scores_gemma":[0.99550027,0.0013830966,0.0007298771,0.00062265235,0.0010966533,0.00066744233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038199062,0.001094969,0.0009861524,0.0018184485,0.001009839,0.002048598,0.0019229221,0.0016676767,0.004273438],"category_scores_gemma":[0.013391066,0.00040169005,0.0019616147,0.0007470275,0.0028319587,0.0067005144,0.0037365346,0.0031768053,0.00045201695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000921347,0.000042983473,0.0018201512,0.00021120155,0.000049516115,0.00054694444,0.00035958042,0.018270887,0.003652538,0.9556004,0.0013855357,0.017968228],"study_design_scores_gemma":[0.000024758658,0.0002152698,0.0019233809,0.00008872642,0.00006086672,0.0012450778,0.00021963227,0.21492921,0.003394038,0.7696302,0.00818609,0.00008278134],"about_ca_topic_score_codex":0.0006950367,"about_ca_topic_score_gemma":0.0004164667,"teacher_disagreement_score":0.004273438,"about_ca_system_score_codex":0.0008456213,"about_ca_system_score_gemma":0.0009294447,"threshold_uncertainty_score":0.020201862},"labels":[],"label_agreement":null},{"id":"W4233160317","doi":"10.23952/jano.2.2020.1.02","title":"Superiorization of block accelerated cyclic subgradient methods","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Iterative Methods for Nonlinear Equations","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subgradient method; Block (permutation group theory); Computer science; Mathematics; Mathematical optimization; Combinatorics","score_opus":0.09892586903627934,"score_gpt":0.38393907341490785,"score_spread":0.28501320437862854,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233160317","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010094119,0.00035130107,0.9855806,0.00010568088,0.00007586543,0.000047522488,0.000048387607,0.00017168447,0.0035248639],"genre_scores_gemma":[0.42347482,0.001180918,0.56580156,0.00022200124,0.0002215221,0.00033923346,0.00038205113,0.0003863661,0.007991527],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924064,0.0003012893,0.000031789805,0.000061605824,0.0003148821,0.00004983998],"domain_scores_gemma":[0.9988918,0.0004056243,0.00008207151,0.00014386288,0.00041775653,0.000059014917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013247959,0.0008376007,0.000828636,0.0005921693,0.00032357805,0.0006801958,0.0008590733,0.0007366328,0.0037441398],"category_scores_gemma":[0.004462197,0.00034310648,0.000529174,0.00062018586,0.00062633713,0.0010896033,0.0011695075,0.0011866299,0.0007346831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030848297,0.00006688932,0.000890798,0.00030047723,0.00007643897,0.00011707174,0.0001365917,0.7100193,0.012792595,0.11157894,0.0064214356,0.15729107],"study_design_scores_gemma":[0.000008510652,0.000029892597,0.00007637646,0.000005341196,0.000003826157,0.000014776149,0.0000034215843,0.9942872,0.0009984217,0.0031547747,0.0014131143,0.0000043971486],"about_ca_topic_score_codex":0.0038513516,"about_ca_topic_score_gemma":0.0026905995,"teacher_disagreement_score":0.0038513516,"about_ca_system_score_codex":0.00060057984,"about_ca_system_score_gemma":0.0015304077,"threshold_uncertainty_score":0.01252532},"labels":[],"label_agreement":null},{"id":"W4233215929","doi":"10.23952/jano.1.2019.2.01","title":"A special issue dedicated to Boris Polyak","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Fusion and Plasma Physics Studies","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Philosophy","score_opus":0.0035096936116054064,"score_gpt":0.20911394322626875,"score_spread":0.20560424961466334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233215929","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00047354016,0.015318717,0.0013170305,0.039245356,0.9035162,0.00008692642,0.0003347219,0.0003286702,0.039378863],"genre_scores_gemma":[0.0036761314,0.012335675,0.00065646,0.010284683,0.64246064,0.00010819495,0.000598563,0.0004896724,0.32938996],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99849796,0.0001692369,0.00009638093,0.00030378829,0.00071641,0.00021617075],"domain_scores_gemma":[0.99526864,0.00053370005,0.00040664693,0.00025191205,0.0017197287,0.0018193991],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001342684,0.0019350043,0.0017948843,0.0023345693,0.0017616759,0.0058924346,0.0011827591,0.0032944619,0.1391174],"category_scores_gemma":[0.0046387757,0.00051759946,0.0010139883,0.00091940176,0.00061541586,0.0024271691,0.0030218211,0.0036674456,0.095465995],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027451519,0.000016384001,0.00004941306,0.00007139448,0.000005989107,0.00003109487,0.0000046248338,0.00004721066,0.00019866499,0.0005779033,0.98288375,0.016086096],"study_design_scores_gemma":[0.0000115346475,0.000035335695,0.0003023231,0.00006241444,0.00000773185,0.000097187396,0.000013896189,0.00012998786,0.00013919805,0.0010045638,0.9981889,0.000006768316],"about_ca_topic_score_codex":0.00048319573,"about_ca_topic_score_gemma":0.0011306539,"teacher_disagreement_score":0.8608826,"about_ca_system_score_codex":0.0014350394,"about_ca_system_score_gemma":0.0022019583,"threshold_uncertainty_score":0.46539408},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Type (biology); Mathematics; Function (biology); Inequality; Applied mathematics; Pure mathematics; Mathematical analysis; Biology","score_opus":0.025284881621857998,"score_gpt":0.27596720817002784,"score_spread":0.25068232654816985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233258680","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102218114,0.0034664136,0.88258654,0.0020100584,0.00013855324,0.000055643162,0.00012082672,0.0001110254,0.009292838],"genre_scores_gemma":[0.83236897,0.002178713,0.15335695,0.00038799868,0.00022697881,0.00017626962,0.0002219432,0.00017795122,0.010904245],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986652,0.00055985985,0.00006888696,0.00023527959,0.00028705032,0.00018364162],"domain_scores_gemma":[0.992716,0.0052843476,0.00064511463,0.0003000273,0.0005957522,0.00045878993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048009595,0.0014657883,0.0015613508,0.0019627635,0.0009598396,0.0022371055,0.0016053566,0.0019505491,0.0023632196],"category_scores_gemma":[0.016629077,0.0004718308,0.0015483961,0.0010357344,0.0043121423,0.005127162,0.0033609855,0.003613228,0.0002542046],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023009212,0.00008230809,0.001521461,0.00038689416,0.000092356415,0.00026234327,0.00039649085,0.13829438,0.0064610094,0.83940214,0.0009524665,0.011917998],"study_design_scores_gemma":[0.000016519345,0.000097010074,0.00041169088,0.000075575736,0.00002876347,0.000072042414,0.00010641972,0.7951634,0.0023104285,0.2008194,0.00086607947,0.00003276675],"about_ca_topic_score_codex":0.0033064175,"about_ca_topic_score_gemma":0.0023235085,"teacher_disagreement_score":0.0048009595,"about_ca_system_score_codex":0.0030605723,"about_ca_system_score_gemma":0.0014427959,"threshold_uncertainty_score":0.025390208},"labels":[],"label_agreement":null},{"id":"W4233846768","doi":"10.23952/jano.1.2019.2.08","title":"Generalized monotone mixed equilibrium problems in FC-spaces: Existence and approximation","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Central Florida","keywords":"Monotone polygon; Mathematics; Applied mathematics; Pure mathematics; Mathematical economics; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.009947744684997567,"score_gpt":0.21528139591667378,"score_spread":0.2053336512316762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233846768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048148945,0.0010001227,0.94489163,0.00042271081,0.00004968053,0.00005401067,0.00004816883,0.00004242262,0.0053422176],"genre_scores_gemma":[0.8093364,0.0010008625,0.18248706,0.00014427443,0.00013838605,0.0002654142,0.00014012965,0.000038631362,0.0064488477],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993166,0.0003059705,0.000032868455,0.0001147826,0.00014531067,0.00008444238],"domain_scores_gemma":[0.998686,0.00082525075,0.00017129167,0.00006808445,0.000173812,0.00007546115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019978867,0.0012080278,0.0011609697,0.00073092774,0.0006329661,0.0014966028,0.0014686078,0.0017309627,0.0017549979],"category_scores_gemma":[0.004476962,0.00038978367,0.0012379758,0.00060597114,0.0016349389,0.0025016633,0.0018662688,0.0016850309,0.00013756096],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010795449,0.000065034365,0.0008896305,0.00042928618,0.00011742692,0.00030572654,0.00022978822,0.27159116,0.0052438397,0.70140636,0.0008016944,0.018812187],"study_design_scores_gemma":[0.000015058231,0.000050347466,0.00014806201,0.000026605567,0.000014537897,0.000087869616,0.000055994973,0.90384907,0.0007688997,0.09376049,0.0012121503,0.000010837268],"about_ca_topic_score_codex":0.0019389209,"about_ca_topic_score_gemma":0.0013237856,"teacher_disagreement_score":0.0019978867,"about_ca_system_score_codex":0.0010321833,"about_ca_system_score_gemma":0.00091395207,"threshold_uncertainty_score":0.010565996},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.00820265361346378,"score_gpt":0.19053497884529214,"score_spread":0.18233232523182835,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233901756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04933202,0.0005302209,0.9139202,0.000572883,0.0001500769,0.00006386753,0.00030976662,0.00027150495,0.034849536],"genre_scores_gemma":[0.93604845,0.0006020861,0.041446894,0.00011397656,0.000058244514,0.0001444209,0.00018233388,0.000075872355,0.021327758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99983895,0.000049911596,0.0000075293315,0.000034768396,0.00003998419,0.000028931334],"domain_scores_gemma":[0.999866,0.000057825317,0.000026259817,0.00000973524,0.000028669592,0.000011515383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026886014,0.0007876479,0.0005911928,0.00048074016,0.00064166245,0.0013360616,0.0011106313,0.0015251937,0.0035221616],"category_scores_gemma":[0.0005747251,0.0003988441,0.0008840443,0.0007400926,0.00069073006,0.00084052765,0.0006472662,0.0009305084,0.00037548871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011643113,0.000010601175,0.00017967192,0.00001947015,0.0000078017265,0.000089383255,0.000037744376,0.9872515,0.00087427837,0.009433058,0.00026294685,0.0018217375],"study_design_scores_gemma":[0.0000020331538,0.000007077345,0.000047961046,0.0000022512947,0.000002909072,0.000010358258,0.000011247942,0.9975563,0.000081114275,0.0016915844,0.0005845995,0.0000025392355],"about_ca_topic_score_codex":0.01569858,"about_ca_topic_score_gemma":0.008833516,"teacher_disagreement_score":0.01569858,"about_ca_system_score_codex":0.0011456318,"about_ca_system_score_gemma":0.0007618179,"threshold_uncertainty_score":0.031214416},"labels":[],"label_agreement":null},{"id":"W4234435134","doi":"10.23952/jano.2.2020.1.07","title":"Inexact orbits of set-valued nonexpansive mappings with summable errors","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Israel Science Foundation","keywords":"Set (abstract data type); Computer science; Mathematics; Programming language","score_opus":0.012483671187066567,"score_gpt":0.2138085194490388,"score_spread":0.20132484826197225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234435134","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50817674,0.0005959894,0.47952068,0.00041571984,0.00013267944,0.00008917927,0.00012592015,0.00015228757,0.01079079],"genre_scores_gemma":[0.9570203,0.00035344108,0.03397553,0.00004598016,0.00004847454,0.00011114053,0.00013855493,0.00006648623,0.008240036],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995221,0.00012538343,0.000039707455,0.000060912324,0.00018592479,0.00006612771],"domain_scores_gemma":[0.99640286,0.0019565725,0.00066596747,0.0002494186,0.0003998448,0.00032534412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001494226,0.0009198683,0.00072350795,0.0011931759,0.0006513424,0.0014258098,0.0009239532,0.0011570012,0.0018009756],"category_scores_gemma":[0.009160745,0.00045993595,0.0008301851,0.00036732174,0.0021636733,0.0016292188,0.002680175,0.0013647954,0.00018248663],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021025076,0.0000742025,0.0034390923,0.00020773568,0.000108725835,0.0010320953,0.0007028445,0.5829413,0.008769096,0.38875613,0.00058796693,0.0131705515],"study_design_scores_gemma":[0.000011268054,0.00007464663,0.00046963102,0.000034914177,0.000011692733,0.00010387792,0.00010945381,0.9190876,0.0018829246,0.07766563,0.00053178525,0.000016607823],"about_ca_topic_score_codex":0.0020668535,"about_ca_topic_score_gemma":0.0013656288,"teacher_disagreement_score":0.0020668535,"about_ca_system_score_codex":0.00097439095,"about_ca_system_score_gemma":0.0007882114,"threshold_uncertainty_score":0.007902324},"labels":[],"label_agreement":null},{"id":"W4234612837","doi":"10.23952/jano.2.2020.3.02","title":"An inertial splitting algorithm for solving inclusion problems and its applications to compressed sensing","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Inclusion (mineral); Compressed sensing; Algorithm; Computer science; Inertial frame of reference; Geology; Physics","score_opus":0.016781479031937736,"score_gpt":0.2406739303777423,"score_spread":0.22389245134580454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234612837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.006539209,0.00012774364,0.9914779,0.00012113156,0.000027666842,0.000022212706,0.000007657444,0.000045079265,0.0016313952],"genre_scores_gemma":[0.35236442,0.0006695544,0.64172035,0.00019456659,0.00016249779,0.00020888288,0.000083859326,0.00009873686,0.004497056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99973875,0.000076710974,0.000012986201,0.000033758024,0.0001217914,0.000016003522],"domain_scores_gemma":[0.9995473,0.00026229164,0.000041375843,0.00004305547,0.000076062635,0.000030007726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007030935,0.00044302858,0.00046662652,0.00039623983,0.00037003684,0.00036204173,0.0006028607,0.00075578183,0.0016098206],"category_scores_gemma":[0.0015117474,0.00018745662,0.00033624683,0.0003966395,0.0009867568,0.00091567915,0.0013371463,0.0009987607,0.00029042488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015781967,0.00014853363,0.0008928286,0.00024902506,0.000054356995,0.0002111027,0.0004623465,0.4262122,0.04923315,0.24251673,0.0025752573,0.2772866],"study_design_scores_gemma":[0.0000072121525,0.00005430021,0.000064390246,0.000008067927,0.0000034369587,0.00005905305,0.00001959113,0.97877055,0.0022431633,0.016918896,0.0018444306,0.000006834335],"about_ca_topic_score_codex":0.0009313679,"about_ca_topic_score_gemma":0.00080698245,"teacher_disagreement_score":0.0016098206,"about_ca_system_score_codex":0.00024363042,"about_ca_system_score_gemma":0.00047526273,"threshold_uncertainty_score":0.005385399},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.005005978399821935,"score_gpt":0.2048406108827155,"score_spread":0.19983463248289354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234925647","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037349502,0.044814296,0.14289796,0.014265963,0.039950397,0.0001406508,0.0017146037,0.00088133645,0.7515999],"genre_scores_gemma":[0.0731267,0.036953375,0.046664365,0.0010673163,0.010710257,0.00022353716,0.001738433,0.0014709536,0.82804507],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99826884,0.0004278644,0.00013816761,0.0001870394,0.00090984587,0.00006815929],"domain_scores_gemma":[0.99784255,0.00048453695,0.000120700824,0.00041218646,0.0009791804,0.00016077957],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017894352,0.0010686243,0.0011859749,0.002141824,0.0008057841,0.0039040812,0.0008196079,0.0014855915,0.09102228],"category_scores_gemma":[0.004556836,0.00031707593,0.0006651357,0.002026879,0.0015905874,0.0018016736,0.001954609,0.0025420575,0.026750952],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009781574,0.00016685046,0.0004568381,0.0006734576,0.000076237186,0.00006269767,0.00004822883,0.015740547,0.0012853438,0.23240685,0.40015882,0.34882632],"study_design_scores_gemma":[0.000029939203,0.0000693445,0.001332592,0.00036555008,0.000039003124,0.00017548352,0.000043019678,0.04960742,0.0014485961,0.1877305,0.75912786,0.00003071667],"about_ca_topic_score_codex":0.0022388466,"about_ca_topic_score_gemma":0.002860187,"teacher_disagreement_score":0.90897775,"about_ca_system_score_codex":0.0012913131,"about_ca_system_score_gemma":0.0022763223,"threshold_uncertainty_score":0.30449986},"labels":[],"label_agreement":null},{"id":"W4236705252","doi":"10.23952/jano.2.2020.3.05","title":"An inertial Mann-like algorithm for fixed points of nonexpansive mappings in Hilbert spaces","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Inertial frame of reference; Hilbert space; Fixed point; Mathematics; Algorithm; Computer science; Pure mathematics; Mathematical analysis; Physics","score_opus":0.009497754820999958,"score_gpt":0.23014544622213567,"score_spread":0.22064769140113571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236705252","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004254078,0.000052824715,0.99500895,0.00003973036,0.000022245475,0.000025786825,0.0000051158495,0.000054220873,0.00053707906],"genre_scores_gemma":[0.17204253,0.00021411479,0.8231083,0.00011551255,0.0000803725,0.00028185284,0.000092704686,0.00009397734,0.0039705024],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99950576,0.00015413998,0.000035519843,0.00010997728,0.00015416114,0.000040405903],"domain_scores_gemma":[0.9993716,0.00029239312,0.00007168567,0.00007398562,0.0001370662,0.00005318272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014656278,0.00081926474,0.00087421644,0.000797757,0.0005921428,0.00064972206,0.001403489,0.0014045588,0.0026527087],"category_scores_gemma":[0.0029940086,0.0003527487,0.0008087083,0.0005693465,0.00109007,0.0019817508,0.0015346725,0.0019598494,0.00053968583],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016942267,0.000112889225,0.0009444719,0.00024283216,0.00008177898,0.00018873626,0.00029905123,0.30695057,0.015687704,0.46994478,0.0020321815,0.20334572],"study_design_scores_gemma":[0.000014882841,0.00013216304,0.00008192679,0.000016046824,0.000008190518,0.00007469969,0.000017295148,0.952835,0.002779989,0.041746445,0.0022755573,0.000017746877],"about_ca_topic_score_codex":0.0008457159,"about_ca_topic_score_gemma":0.0009249142,"teacher_disagreement_score":0.0026527087,"about_ca_system_score_codex":0.0005180447,"about_ca_system_score_gemma":0.0010439652,"threshold_uncertainty_score":0.008874178},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.013112042919427854,"score_gpt":0.2843343655290947,"score_spread":0.27122232260966683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237610153","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017496657,0.00090996723,0.97940254,0.0003387792,0.00007774652,0.00003185688,0.000013041162,0.000037920414,0.0016914536],"genre_scores_gemma":[0.58781594,0.0022068548,0.4014392,0.0002832451,0.00018698501,0.00031326042,0.00009438753,0.00015269686,0.007507496],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992587,0.00042131142,0.000033086348,0.00009627534,0.0001416802,0.000048997554],"domain_scores_gemma":[0.9969099,0.0023289626,0.00024662883,0.00010102465,0.00024959623,0.00016390336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002740392,0.0016504939,0.0010285454,0.0016087152,0.00061300985,0.0014497648,0.0013725256,0.001930995,0.0011257136],"category_scores_gemma":[0.007308501,0.00048330767,0.0014145654,0.0006543239,0.0027102346,0.002897814,0.0022289166,0.002296891,0.00018943634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012619523,0.00005150582,0.0006978351,0.00029402168,0.00010219758,0.00025264142,0.00033774346,0.2822452,0.008796746,0.6868777,0.00054257474,0.019675737],"study_design_scores_gemma":[0.000019458359,0.00006744665,0.000109103064,0.00003102556,0.000013546775,0.00005506163,0.00004393335,0.8649692,0.0012835343,0.13228545,0.0011048603,0.000017398452],"about_ca_topic_score_codex":0.0012874024,"about_ca_topic_score_gemma":0.0007260743,"teacher_disagreement_score":0.002740392,"about_ca_system_score_codex":0.0011370622,"about_ca_system_score_gemma":0.00073291495,"threshold_uncertainty_score":0.01449281},"labels":[],"label_agreement":null},{"id":"W4239109439","doi":"10.23952/jano.1.2019.2.06","title":"Three convergence results for inexact orbits of nonexpansive mappings","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Mathematics; Applied mathematics; Mathematical economics; Economics; Macroeconomics","score_opus":0.008836865933084513,"score_gpt":0.2199011869786978,"score_spread":0.21106432104561326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239109439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05959405,0.0020623698,0.918215,0.0007985988,0.00034160208,0.00009721171,0.00013011739,0.00019537518,0.018565726],"genre_scores_gemma":[0.81745166,0.0034211879,0.15328752,0.000492897,0.00048959465,0.00025671584,0.00039177024,0.0003425652,0.023866007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99802715,0.00041477004,0.00016245153,0.00032703453,0.00090061914,0.00016795183],"domain_scores_gemma":[0.99443936,0.002387602,0.0005923408,0.00063556066,0.0014936446,0.00045145256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004594193,0.0016372124,0.0012011136,0.002104315,0.0011760399,0.0019239187,0.0016714361,0.0018953688,0.0036745544],"category_scores_gemma":[0.013556716,0.000427576,0.0024940914,0.0007308094,0.0038410786,0.00454227,0.003973474,0.003648304,0.0004519161],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024267915,0.000100308716,0.0031121066,0.0006530164,0.0001723139,0.0009496137,0.001050365,0.118423976,0.011494635,0.8226053,0.0014996706,0.03969604],"study_design_scores_gemma":[0.000026912494,0.00033267232,0.0017006559,0.00021765853,0.00009594394,0.001154871,0.00043891207,0.5617976,0.014943027,0.41153193,0.0076565114,0.000103322585],"about_ca_topic_score_codex":0.0011451626,"about_ca_topic_score_gemma":0.0004446352,"teacher_disagreement_score":0.004594193,"about_ca_system_score_codex":0.0011237507,"about_ca_system_score_gemma":0.0009853138,"threshold_uncertainty_score":0.024296701},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Lens (geology); Optimization algorithm; Computer science; Algorithm; Mathematical optimization; Mathematics; Optics; Physics","score_opus":0.039975166744278846,"score_gpt":0.24303638211610884,"score_spread":0.20306121537183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239181871","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00049449375,0.00038858652,0.99681723,0.00053445634,0.00009670516,0.000014229175,0.000014953218,0.000031242882,0.0016080863],"genre_scores_gemma":[0.05061867,0.0020908578,0.93903995,0.0010855133,0.00081307156,0.00022803668,0.000102026715,0.00034958601,0.005672351],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99780935,0.001099768,0.00010059957,0.00030582762,0.0005743112,0.00011011401],"domain_scores_gemma":[0.99697495,0.0017840236,0.00019854307,0.0003281664,0.00055247056,0.00016171914],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004556743,0.001739159,0.0013677523,0.001831599,0.00082299864,0.0022194677,0.001979617,0.0022387463,0.005845597],"category_scores_gemma":[0.010573167,0.0008276078,0.0019264229,0.0017482508,0.003423316,0.005543447,0.0042581502,0.0073023387,0.001292708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000513578,0.00003238543,0.00019194184,0.00015513535,0.000035082885,0.00007556534,0.00015801238,0.06364745,0.0021636274,0.8799271,0.0070124967,0.04654992],"study_design_scores_gemma":[0.000028768318,0.00008426885,0.00012884388,0.00009239064,0.000020342424,0.00013987739,0.000053326567,0.63960165,0.001661794,0.33842424,0.019716542,0.00004790787],"about_ca_topic_score_codex":0.002232401,"about_ca_topic_score_gemma":0.0015267965,"teacher_disagreement_score":0.005845597,"about_ca_system_score_codex":0.0013748562,"about_ca_system_score_gemma":0.0016779094,"threshold_uncertainty_score":0.024098635},"labels":[],"label_agreement":null},{"id":"W4239889688","doi":"10.23952/jano.1.2019.3.06","title":"Semicontinuity of the composition of set-valued map and scalarization function for sets","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Composition (language); Set (abstract data type); Function (biology); Mathematics; Computer science; Biology; Philosophy; Evolutionary biology","score_opus":0.006008323978339901,"score_gpt":0.21396936103636302,"score_spread":0.20796103705802313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239889688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.118263416,0.0012407033,0.85807496,0.00056047924,0.00012003122,0.000070005575,0.000108003216,0.00018488533,0.021377554],"genre_scores_gemma":[0.85739416,0.0017437424,0.13096698,0.00048746378,0.0002293838,0.00020228903,0.00021570819,0.00017799993,0.008582449],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979699,0.00042715025,0.00017530422,0.0006233981,0.0006003056,0.00020380222],"domain_scores_gemma":[0.99716467,0.0009977976,0.00040885533,0.00046547758,0.00067241077,0.000290783],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032384945,0.00072839006,0.0009726505,0.0015168288,0.0010219851,0.0019217299,0.000986691,0.0008275762,0.0024467795],"category_scores_gemma":[0.006232821,0.00049813994,0.0015983963,0.0014742006,0.003459576,0.0056683063,0.003698515,0.002847684,0.00029372322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006475451,0.000042467735,0.0013807869,0.00015601321,0.000035326957,0.00022456884,0.00056794274,0.007821709,0.008153584,0.96038723,0.0004303216,0.020735232],"study_design_scores_gemma":[0.000024410529,0.00030273994,0.0033384943,0.00010415423,0.000080647114,0.00092942815,0.0004337693,0.12673216,0.011503804,0.84512144,0.0113731045,0.000055941735],"about_ca_topic_score_codex":0.00093705126,"about_ca_topic_score_gemma":0.00065178453,"teacher_disagreement_score":0.0032384945,"about_ca_system_score_codex":0.0013044756,"about_ca_system_score_gemma":0.0013583765,"threshold_uncertainty_score":0.017127037},"labels":[],"label_agreement":null},{"id":"W4240410149","doi":"10.23952/jano.3.2021.1.01","title":"Editorial: A special issue on optimization and related topics dedicated to Professor Roman Polyak","year":2021,"lang":"en","type":"editorial","venue":"Journal of Applied and Numerical Optimization","topic":"Mathematical Control Systems and Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; George Mason University; National Aeronautics and Space Administration","keywords":"Computer science; Classics; Psychology; Library science; Art","score_opus":0.0040900990136525225,"score_gpt":0.23133305123005107,"score_spread":0.22724295221639856,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240410149","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000647011,0.010621134,0.00032494965,0.026379406,0.96033293,0.000020087919,0.00006738881,0.000070015434,0.0021194038],"genre_scores_gemma":[0.00040409472,0.006829802,0.00013639804,0.008865882,0.9763337,0.00002067995,0.000048983602,0.000056245626,0.0073043117],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9970367,0.00044481564,0.00037511677,0.00068518094,0.00117216,0.00028609592],"domain_scores_gemma":[0.9899458,0.0036542302,0.0007246131,0.00031097408,0.0034663496,0.0018980963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029552884,0.0049305237,0.005071137,0.0034540882,0.0020569419,0.007724193,0.0033620368,0.008546961,0.03433204],"category_scores_gemma":[0.012643794,0.0010889621,0.003829994,0.0018117118,0.0020916127,0.005006036,0.0014606683,0.013825752,0.024550553],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048358328,0.000019491205,0.00003898209,0.00026632237,0.000020602467,0.000087344684,0.00000754825,0.00008248259,0.00008589701,0.00047278602,0.99231017,0.006560026],"study_design_scores_gemma":[0.000042581087,0.000048454924,0.00028549976,0.00033058156,0.000034208595,0.00031852385,0.000024384215,0.00026060606,0.00013362204,0.0013672835,0.9971354,0.000018811346],"about_ca_topic_score_codex":0.00073214987,"about_ca_topic_score_gemma":0.0012556363,"teacher_disagreement_score":0.03433204,"about_ca_system_score_codex":0.0027296373,"about_ca_system_score_gemma":0.0018481928,"threshold_uncertainty_score":0.11485213},"labels":[],"label_agreement":null},{"id":"W4240475332","doi":"10.23952/jano.3.2021.2.08","title":"Convergence of implicit Runge-Kutta time discretisation methods for fundamental models in nonlinear acoustics","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Acoustic Wave Phenomena Research","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Runge–Kutta methods; Discretization; Convergence (economics); Nonlinear system; Mathematics; Applied mathematics; Mathematical analysis; Computer science; Acoustics; Physics; Numerical analysis","score_opus":0.015339875693904145,"score_gpt":0.2952642865175125,"score_spread":0.27992441082360836,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4240475332","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027037296,0.0010135835,0.9666468,0.00030113492,0.00010008471,0.0000428408,0.000041776144,0.00012467224,0.0046917824],"genre_scores_gemma":[0.6731747,0.0017951089,0.31017205,0.00015737931,0.00011010321,0.00028290317,0.0001782214,0.00036786296,0.0137616685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99947315,0.00023387691,0.000024748648,0.000045403016,0.00018038806,0.000042407853],"domain_scores_gemma":[0.99854434,0.0008761867,0.00017820304,0.00013104302,0.0001987805,0.000071428505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012772883,0.0010120407,0.0008615584,0.0005296233,0.00050458143,0.0010092272,0.0010529582,0.0011451249,0.001145869],"category_scores_gemma":[0.005379072,0.0004142693,0.00082396815,0.00038392647,0.0019217978,0.001130235,0.0021363054,0.0020811893,0.00031931105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000808318,0.000050047885,0.0005294801,0.0002434978,0.000036882135,0.000091506685,0.00036709572,0.8437448,0.007924955,0.11908703,0.0007687531,0.027075166],"study_design_scores_gemma":[0.0000030409424,0.0000100301195,0.000027789796,0.0000076124297,0.0000014640109,0.000010086455,0.000007834996,0.99214447,0.00038996272,0.0066009676,0.0007919238,0.0000048770494],"about_ca_topic_score_codex":0.00466561,"about_ca_topic_score_gemma":0.0033992734,"teacher_disagreement_score":0.00466561,"about_ca_system_score_codex":0.00071822695,"about_ca_system_score_gemma":0.0012417815,"threshold_uncertainty_score":0.0092769265},"labels":[],"label_agreement":null},{"id":"W4241130888","doi":"10.23952/jano.1.2019.1.02","title":"DC-gap function and proximal methods for solving Nash-Cournot oligopolistic equilibrium models involving concave cost","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Cournot competition; Oligopoly; Mathematical economics; Nash equilibrium; Economics; Symmetric equilibrium; Function (biology); Game theory; Equilibrium selection; Repeated game","score_opus":0.03618734998342756,"score_gpt":0.26267353236654156,"score_spread":0.226486182383114,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241130888","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004880292,0.00034496377,0.99165946,0.00021969639,0.000032421973,0.00002520099,0.000025996938,0.000061098435,0.0027507723],"genre_scores_gemma":[0.40820622,0.0012004754,0.57974166,0.00023324291,0.00010094945,0.00036494288,0.00014823418,0.00017332085,0.009830899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995722,0.00021981724,0.000013248904,0.00006298657,0.00008346299,0.000048323698],"domain_scores_gemma":[0.9989785,0.00065706566,0.00007203005,0.000058957878,0.00015213974,0.00008130471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015028544,0.0012977541,0.0013286119,0.00094038725,0.0005311448,0.0009969524,0.0011120251,0.0014004976,0.0031617035],"category_scores_gemma":[0.0031640113,0.0006115236,0.00096422323,0.0010204653,0.0012609805,0.0011215947,0.0018200679,0.0020376814,0.00044023324],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032960394,0.00004687016,0.0002075546,0.00012323337,0.000026966733,0.000040055394,0.00005705319,0.8874273,0.000446999,0.091377616,0.0009665165,0.019246899],"study_design_scores_gemma":[0.0000037498755,0.000010299985,0.000016123162,0.000006877241,0.0000032496134,0.0000048101624,0.0000065075287,0.98842686,0.00012353976,0.010868465,0.00052635686,0.0000031854295],"about_ca_topic_score_codex":0.006793422,"about_ca_topic_score_gemma":0.004569806,"teacher_disagreement_score":0.006793422,"about_ca_system_score_codex":0.001297209,"about_ca_system_score_gemma":0.0022822516,"threshold_uncertainty_score":0.013507724},"labels":[],"label_agreement":null},{"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Science Foundation","keywords":"Cone (formal languages); Computer science; Geometry; Mathematics; Programming language","score_opus":0.025256701609860904,"score_gpt":0.33354569883712204,"score_spread":0.3082889972272611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241359251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015469358,0.00008929701,0.9764822,0.00022333677,0.000056473713,0.000050018385,0.000118619486,0.00080036593,0.0067102835],"genre_scores_gemma":[0.2177183,0.0002815724,0.76748854,0.0003100608,0.000075597156,0.00019307394,0.00045152038,0.0016817378,0.011799621],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913174,0.00016134372,0.000036811703,0.00016409594,0.00039331775,0.000112775364],"domain_scores_gemma":[0.9981717,0.0008461788,0.00013340639,0.0001833182,0.00051632983,0.00014914441],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016848801,0.0008736794,0.0008277214,0.0007756933,0.00072045485,0.0022350142,0.0012620216,0.0009140365,0.007473139],"category_scores_gemma":[0.0055039343,0.00045690808,0.00094159535,0.0006499215,0.0016232785,0.002074389,0.002024387,0.0021500457,0.0017498061],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020384985,0.00020586337,0.0032260886,0.00042637522,0.000059143484,0.00049314403,0.00051339495,0.4496269,0.014076463,0.3809643,0.00965823,0.14054616],"study_design_scores_gemma":[0.00001357898,0.000035736324,0.00015371344,0.000032434134,0.000006725076,0.000082824576,0.000053003983,0.92276514,0.00359859,0.06738114,0.005863253,0.000013814578],"about_ca_topic_score_codex":0.004684903,"about_ca_topic_score_gemma":0.0043432456,"teacher_disagreement_score":0.007473139,"about_ca_system_score_codex":0.0010464506,"about_ca_system_score_gemma":0.0021665103,"threshold_uncertainty_score":0.025000155},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convexity; Ravine; Quadratic equation; Mathematics; Mathematical optimization; Applied mathematics; Mathematical economics; Geometry; Geography; Economics; Cartography","score_opus":0.019358854453828202,"score_gpt":0.25615712291057874,"score_spread":0.23679826845675053,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241688089","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2800002,0.0038817753,0.5579627,0.004218971,0.00038276686,0.00005250223,0.000413642,0.00019193826,0.15289553],"genre_scores_gemma":[0.93551147,0.0024150219,0.037585262,0.0003760555,0.0004904419,0.00007845248,0.0002477609,0.00018941856,0.02310604],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988172,0.00055274053,0.000046708992,0.00018549748,0.00028058395,0.00011739705],"domain_scores_gemma":[0.9939818,0.0040089716,0.00054431916,0.00037267501,0.0007663053,0.00032593452],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021561855,0.00091602915,0.0010985243,0.0021903818,0.0012381409,0.002858318,0.001147512,0.0008373792,0.0059565497],"category_scores_gemma":[0.014282859,0.0006747877,0.001089156,0.001175434,0.0042514605,0.0056580976,0.0022429607,0.003070501,0.00080860127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024780835,0.0000073490055,0.00015972505,0.000026006153,0.0000079936735,0.00002814675,0.00011481688,0.0046843546,0.0003542322,0.98989314,0.00074041483,0.0039589414],"study_design_scores_gemma":[0.0000061194014,0.00001987578,0.00030180084,0.000010766659,0.0000051084185,0.00005246373,0.000057098936,0.021630378,0.00018993196,0.975758,0.001959164,0.000009318142],"about_ca_topic_score_codex":0.0017243467,"about_ca_topic_score_gemma":0.0011008689,"teacher_disagreement_score":0.0059565497,"about_ca_system_score_codex":0.0011985474,"about_ca_system_score_gemma":0.0006945464,"threshold_uncertainty_score":0.019926667},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Foundation for Science and Technology Development","keywords":"Convergence (economics); Inertial frame of reference; Applied mathematics; Mathematical economics; Mathematics; Computer science; Economics; Physics; Classical mechanics; Macroeconomics","score_opus":0.007613119653564279,"score_gpt":0.2363308686665417,"score_spread":0.22871774901297742,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241864462","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045179278,0.00015055115,0.99301213,0.00007226645,0.000038192196,0.000037456204,0.000012343679,0.000061787774,0.0020973224],"genre_scores_gemma":[0.2810183,0.0009579281,0.70538694,0.00027013358,0.00028213373,0.0007714924,0.00027819735,0.0003061423,0.010728799],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99888974,0.00046162508,0.00006533376,0.00014042364,0.000349327,0.00009342668],"domain_scores_gemma":[0.99870276,0.00068882026,0.00015065068,0.00011052606,0.0002474414,0.00009984054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029051946,0.0013910361,0.0010615168,0.0011065418,0.0005808386,0.0009791711,0.001566533,0.0012886855,0.003653099],"category_scores_gemma":[0.006247946,0.0005379351,0.0010589462,0.00042551957,0.0016761355,0.0019504506,0.0030509038,0.0018775593,0.00081479666],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024332173,0.000107204694,0.00068074244,0.00037965126,0.000081450315,0.00012625525,0.00032271724,0.49693954,0.0072892206,0.41532204,0.0021846902,0.07632325],"study_design_scores_gemma":[0.000026983023,0.00013758578,0.000118776385,0.000024095012,0.0000072090966,0.000031391584,0.000022263299,0.9738429,0.0012022445,0.021941863,0.0026276794,0.000016987333],"about_ca_topic_score_codex":0.0015802282,"about_ca_topic_score_gemma":0.0009984329,"teacher_disagreement_score":0.003653099,"about_ca_system_score_codex":0.00056878105,"about_ca_system_score_gemma":0.0010615754,"threshold_uncertainty_score":0.015364289},"labels":[],"label_agreement":null},{"id":"W4241961027","doi":"10.23952/jano.1.2019.2.05","title":"Polyak’s gradient method for solving the split convex feasibility problem and its applications","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Trường Đại học Giao thông vận tải","keywords":"Regular polygon; Mathematical optimization; Gradient method; Convex optimization; Mathematics; Computer science; Geometry","score_opus":0.0126004153318758,"score_gpt":0.2634251402608905,"score_spread":0.2508247249290147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241961027","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031732311,0.0005362015,0.9941555,0.00015737435,0.00005170434,0.000027585642,0.000016433258,0.000040537325,0.0018413884],"genre_scores_gemma":[0.21083578,0.0014168015,0.7793324,0.00019389337,0.00011345166,0.00042356952,0.00013852693,0.00018351522,0.0073620547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941814,0.0002524671,0.000027962553,0.00009670704,0.00016257218,0.000042080817],"domain_scores_gemma":[0.9991673,0.00046308033,0.000054205575,0.000055643748,0.00020609375,0.000053772048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018741846,0.00082080107,0.00094019156,0.00093223795,0.00043316733,0.0007265765,0.0011099334,0.0012748756,0.0026102704],"category_scores_gemma":[0.0034925598,0.00043503838,0.0006977345,0.0011071286,0.0015483453,0.0012976057,0.00159847,0.0020520594,0.0005468336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019394793,0.00009787864,0.0006778249,0.000649241,0.00010176585,0.00017284627,0.00022555284,0.51935893,0.010329346,0.3481896,0.0050379774,0.11496513],"study_design_scores_gemma":[0.000012277523,0.000036289504,0.00007527252,0.000015308126,0.0000061899386,0.00003652477,0.000013292827,0.97838914,0.0008031336,0.018684065,0.0019174981,0.000010958977],"about_ca_topic_score_codex":0.0027271332,"about_ca_topic_score_gemma":0.0018403347,"teacher_disagreement_score":0.0027271332,"about_ca_system_score_codex":0.0005363789,"about_ca_system_score_gemma":0.0014272832,"threshold_uncertainty_score":0.009911716},"labels":[],"label_agreement":null},{"id":"W4243059100","doi":"10.23952/jano.3.2021.1.11","title":"A weak convergence theorem for relatively nonexpansive mappings and maximal monotone operators in a Banach space","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Banach space; Mathematics; Monotone polygon; Convergence (economics); Pure mathematics; Eberlein–Šmulian theorem; Discrete mathematics; Weak convergence; Lp space; Computer science; Economics","score_opus":0.007997638099171155,"score_gpt":0.22280181065011306,"score_spread":0.21480417255094192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243059100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021734104,0.00072898535,0.968291,0.00046060575,0.00015963745,0.00009515513,0.000058474066,0.00009612632,0.008375848],"genre_scores_gemma":[0.49056864,0.002322904,0.48655662,0.0009308836,0.0005034313,0.0009979088,0.00026988838,0.00028426325,0.017565398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99788886,0.00057366013,0.00013596377,0.00050143583,0.00076751655,0.00013259852],"domain_scores_gemma":[0.9968131,0.0017281199,0.00024599745,0.00018251225,0.0007814056,0.00024886875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055964068,0.0016884119,0.0014667552,0.002353898,0.0014988284,0.0015449343,0.0016926844,0.0014992659,0.0030654971],"category_scores_gemma":[0.008371201,0.00051940215,0.0027540005,0.0010701386,0.00455795,0.0052844463,0.004261653,0.0039981944,0.00053417275],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010153085,0.00005475716,0.0007441482,0.00044831875,0.00013882968,0.000397199,0.00070582656,0.0147232,0.015901702,0.93397,0.0013233756,0.031491067],"study_design_scores_gemma":[0.000046535373,0.0005651533,0.0011077571,0.0001436016,0.000113477494,0.0012266573,0.0002945696,0.18955193,0.017278336,0.77563745,0.013942744,0.0000919066],"about_ca_topic_score_codex":0.0006231854,"about_ca_topic_score_gemma":0.00036386837,"teacher_disagreement_score":0.0055964068,"about_ca_system_score_codex":0.0010513789,"about_ca_system_score_gemma":0.001258173,"threshold_uncertainty_score":0.029597044},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.04057491881040825,"score_gpt":0.3809193250032356,"score_spread":0.34034440619282735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243792189","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001149075,0.00014265168,0.99789834,0.00008263073,0.000019191042,0.000016444583,0.000008599929,0.000055489458,0.00062761246],"genre_scores_gemma":[0.19351335,0.0010079298,0.7949553,0.00022359137,0.00014071385,0.00043901528,0.00017046247,0.00031663396,0.009233003],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99909484,0.0005274312,0.000040790823,0.000095217794,0.00019000302,0.000051857267],"domain_scores_gemma":[0.996097,0.0030192942,0.00021024338,0.00018603327,0.0003762268,0.00011120469],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035084097,0.0014401191,0.0015741887,0.00081501604,0.0005571866,0.0010730114,0.0015962382,0.0015983977,0.003634006],"category_scores_gemma":[0.009312982,0.0008246133,0.000912802,0.00089824316,0.0016142204,0.0011956727,0.0024027799,0.0025659206,0.0010492601],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007185421,0.00005651251,0.00029309344,0.00027871956,0.00006974146,0.00014130952,0.0001070111,0.8349118,0.0014045883,0.12387808,0.0018671107,0.036920156],"study_design_scores_gemma":[0.000009724738,0.00001848787,0.00002581203,0.0000139107815,0.0000039303786,0.00001991461,0.000008118043,0.97866714,0.00030467697,0.020087177,0.00083574577,0.0000052869864],"about_ca_topic_score_codex":0.0017390605,"about_ca_topic_score_gemma":0.0019369114,"teacher_disagreement_score":0.003634006,"about_ca_system_score_codex":0.00075753365,"about_ca_system_score_gemma":0.0017071449,"threshold_uncertainty_score":0.01855445},"labels":[],"label_agreement":null},{"id":"W4244074079","doi":"10.23952/jano.1.2019.3.10","title":"The subgradient extragradient method for solving mixed equilibrium problems and fixed point problems in Hilbert spaces","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subgradient method; Hilbert space; Fixed point; Mathematics; Applied mathematics; Mathematical economics; Mathematical optimization; Pure mathematics; Mathematical analysis","score_opus":0.009534542447006081,"score_gpt":0.22696353117353757,"score_spread":0.2174289887265315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244074079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039459234,0.00024422118,0.9949167,0.00005473442,0.000028479564,0.000026202148,0.000006908743,0.000039331906,0.0007375433],"genre_scores_gemma":[0.2562065,0.0007316021,0.73799986,0.00013861957,0.00007696028,0.0002793167,0.00007016649,0.00009283288,0.004404134],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995022,0.00023540875,0.000028391963,0.00005170164,0.00015387563,0.000028469618],"domain_scores_gemma":[0.99968743,0.00013289657,0.00003516817,0.000030313737,0.00008163459,0.000032592838],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014356257,0.00092431286,0.00090709835,0.00056710455,0.00034647668,0.00053121644,0.0009888154,0.00087934104,0.0012451658],"category_scores_gemma":[0.0014256027,0.00033815025,0.00085993484,0.00037445885,0.0008075009,0.0013090563,0.0013130477,0.0014802628,0.00029645837],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001533646,0.00011155682,0.0010616262,0.000591229,0.00021125286,0.0002445632,0.0003516619,0.47566682,0.02867888,0.35119745,0.0016871636,0.14004433],"study_design_scores_gemma":[0.0000114021,0.0000779943,0.00008325159,0.000015109823,0.000009992071,0.000041917494,0.000013154136,0.98042357,0.0019249646,0.0153956115,0.0019929607,0.000010105478],"about_ca_topic_score_codex":0.0013981927,"about_ca_topic_score_gemma":0.0012720022,"teacher_disagreement_score":0.0014356257,"about_ca_system_score_codex":0.00047565182,"about_ca_system_score_gemma":0.00092980516,"threshold_uncertainty_score":0.00759238},"labels":[],"label_agreement":null},{"id":"W4244199699","doi":"10.23952/jano.3.2021.1.02","title":"Augmented Lagrangian – fast projected gradient algorithm with working set selection for training support vector machines","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Training (meteorology); Set (abstract data type); Selection (genetic algorithm); Support vector machine; Lagrangian; Augmented Lagrangian method; Mathematical optimization; Algorithm; Artificial intelligence; Mathematics; Applied mathematics","score_opus":0.01678469710297636,"score_gpt":0.23597845643748847,"score_spread":0.2191937593345121,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244199699","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030956597,0.00008009721,0.9957468,0.000054580672,0.000030468986,0.000041657528,0.000021917918,0.0004745612,0.00045431117],"genre_scores_gemma":[0.0618465,0.00012916658,0.9351495,0.00007212552,0.000048949394,0.00046764157,0.00026603797,0.00022182436,0.0017983159],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988518,0.00043007112,0.000060761216,0.00010648185,0.0004639701,0.00008686875],"domain_scores_gemma":[0.99867487,0.0005246801,0.00009407932,0.00017254136,0.00047018312,0.00006375835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020833723,0.0012632055,0.0015418372,0.0012596282,0.0007035127,0.001088695,0.0018976108,0.0011819567,0.003113793],"category_scores_gemma":[0.004363068,0.0007913162,0.0010157916,0.001135965,0.0008494622,0.0013702947,0.0014167507,0.0018131549,0.0020579463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020230982,0.00017178984,0.0009162137,0.00021544006,0.00013562712,0.00020985054,0.00017205709,0.3915068,0.011486907,0.02534982,0.00829093,0.5613422],"study_design_scores_gemma":[0.00002044572,0.000054601267,0.000101389145,0.000009120072,0.000007468829,0.00003976769,0.0000069737816,0.99189925,0.0021068067,0.004093473,0.0016511058,0.000009505829],"about_ca_topic_score_codex":0.0015519438,"about_ca_topic_score_gemma":0.0013629106,"teacher_disagreement_score":0.003113793,"about_ca_system_score_codex":0.0004084395,"about_ca_system_score_gemma":0.001346631,"threshold_uncertainty_score":0.011018097},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","keywords":"Preorder; Set (abstract data type); Mathematics; Computer science; Combinatorics; Discrete mathematics; Programming language","score_opus":0.006736461028911781,"score_gpt":0.22165897570362644,"score_spread":0.21492251467471465,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244231150","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040589217,0.0001419312,0.9577938,0.000082446895,0.000011637697,0.000033670553,0.00006582348,0.00024425623,0.0010373031],"genre_scores_gemma":[0.29478198,0.00017493119,0.702555,0.000048330574,0.000023455808,0.00018739943,0.00035141787,0.00018051612,0.0016969561],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99936277,0.00020891029,0.000035217756,0.000116031166,0.00019390006,0.000083083316],"domain_scores_gemma":[0.9984515,0.0010964415,0.000107708736,0.00012994866,0.00015550743,0.000058801816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012522127,0.000675849,0.0009859566,0.0011424647,0.00052686187,0.0011345197,0.0012246548,0.0007181068,0.0022737181],"category_scores_gemma":[0.003773448,0.00047858502,0.0012275225,0.00075488095,0.0011152857,0.0018206935,0.00089570775,0.0013826538,0.0004237484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003165487,0.00014411354,0.0021972943,0.0003264887,0.000087991386,0.00010930204,0.00044709846,0.6551838,0.009567526,0.15722771,0.001839962,0.17255221],"study_design_scores_gemma":[0.00001294713,0.000078513825,0.00026055647,0.000023419376,0.000011083734,0.000037823007,0.000057783745,0.9075113,0.0050621056,0.08598172,0.00095051987,0.000012208456],"about_ca_topic_score_codex":0.0015741715,"about_ca_topic_score_gemma":0.0023638469,"teacher_disagreement_score":0.0022737181,"about_ca_system_score_codex":0.00087951485,"about_ca_system_score_gemma":0.0010421234,"threshold_uncertainty_score":0.0076063275},"labels":[],"label_agreement":null},{"id":"W4244231788","doi":"10.23952/jano.1.2019.1.08","title":"A descent-like method for fixed points and split conclusion problems","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Robotic Path Planning Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Descent (aeronautics); Fixed point; Computer science; Mathematics; Mathematical analysis; Engineering; Aerospace engineering","score_opus":0.00983490032252842,"score_gpt":0.2469238633489255,"score_spread":0.23708896302639706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244231788","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024209428,0.00005975626,0.9965256,0.00006743272,0.000033073135,0.000022336802,0.000010360658,0.000032423824,0.00082804484],"genre_scores_gemma":[0.16163379,0.0002567155,0.828452,0.00019728085,0.000116142786,0.00041797428,0.00015413735,0.00020447439,0.0085674105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954754,0.00016941722,0.000020959444,0.000065000364,0.00016349881,0.000033599503],"domain_scores_gemma":[0.99953246,0.00017374476,0.000034597506,0.000040565556,0.00014566956,0.00007294569],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013835094,0.0008080258,0.0010112041,0.0007864311,0.00067029684,0.00071895384,0.001513875,0.0015058181,0.002372447],"category_scores_gemma":[0.0018700921,0.00043525908,0.0011040127,0.000396807,0.0014132343,0.0011804934,0.002313128,0.002004863,0.0007077243],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014467137,0.0001268873,0.00077088963,0.00033556233,0.0001237133,0.00034780402,0.0003185851,0.26156062,0.020949928,0.6041998,0.003991038,0.107130505],"study_design_scores_gemma":[0.00001385645,0.00009682116,0.00007404869,0.000018181925,0.000009275824,0.00007353497,0.000017253991,0.9560634,0.0012523533,0.039254416,0.0031125802,0.000014418518],"about_ca_topic_score_codex":0.0014480202,"about_ca_topic_score_gemma":0.0016756633,"teacher_disagreement_score":0.002372447,"about_ca_system_score_codex":0.0006191561,"about_ca_system_score_gemma":0.0012413918,"threshold_uncertainty_score":0.007936597},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Education of Guangdong Province; Shenzhen University; Natural Science Foundation of Guangdong Province; National Natural Science Foundation of China","keywords":"Cluster analysis; Computer science; Data mining; Artificial intelligence","score_opus":0.0701899445410024,"score_gpt":0.37791770589676704,"score_spread":0.30772776135576463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244787383","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011161086,0.063038684,0.9260242,0.0011662309,0.00044642188,0.000082098864,0.00023817774,0.00035717004,0.007530788],"genre_scores_gemma":[0.043301404,0.15248853,0.7912197,0.001061166,0.0026599008,0.0005705455,0.0010693419,0.000607265,0.0070221215],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964179,0.0013412397,0.00027132206,0.00063587446,0.0012263296,0.00010736058],"domain_scores_gemma":[0.9981014,0.000920018,0.00011187972,0.00023454719,0.0005838551,0.000048343194],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003288022,0.001510822,0.002508498,0.0038218594,0.001048764,0.0029699802,0.0024230094,0.0021230783,0.0040795114],"category_scores_gemma":[0.00584874,0.0009915356,0.0023411056,0.00750701,0.0014198817,0.0028703217,0.0017168713,0.0021090163,0.0033785466],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007122028,0.00007205142,0.0010768911,0.004267282,0.0003274003,0.00013250984,0.00027640688,0.07554751,0.002739934,0.32388523,0.023678618,0.567925],"study_design_scores_gemma":[0.000040919644,0.00012955612,0.0018978548,0.0011298993,0.00012978009,0.00065941905,0.0001767572,0.33319268,0.0037116013,0.3743321,0.284441,0.00015845349],"about_ca_topic_score_codex":0.002264878,"about_ca_topic_score_gemma":0.0013715834,"teacher_disagreement_score":0.0040795114,"about_ca_system_score_codex":0.0016764252,"about_ca_system_score_gemma":0.0019783087,"threshold_uncertainty_score":0.01738888},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hadamard transform; Mathematics; Computer science; Algorithm; Mathematical analysis","score_opus":0.005057722705793437,"score_gpt":0.18895287439820238,"score_spread":0.18389515169240894,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244929336","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045157378,0.0004859312,0.99209905,0.00014282572,0.000055834575,0.000024445111,0.00000836676,0.0000665227,0.0026012298],"genre_scores_gemma":[0.20126005,0.0012169316,0.7906084,0.00016809833,0.000110441935,0.00016757238,0.000046515153,0.00010694052,0.0063150777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993793,0.00028383482,0.0000505632,0.000087644854,0.00016256756,0.000036036912],"domain_scores_gemma":[0.9989009,0.0005694309,0.000076032666,0.00013544969,0.00026659,0.000051537118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014133791,0.0008405357,0.0007980867,0.0012449659,0.0005363267,0.00074336736,0.0010768494,0.0011390162,0.0023350937],"category_scores_gemma":[0.0042924127,0.0003981846,0.0013385898,0.00070881675,0.0018252314,0.0018233671,0.0020333717,0.0018669199,0.00059346796],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007605651,0.000050851504,0.000649842,0.00038162112,0.000071869785,0.00025624913,0.00044567123,0.19631664,0.014848135,0.6639591,0.0017399957,0.12120395],"study_design_scores_gemma":[0.000015936008,0.00008997695,0.00015738583,0.00004526103,0.000009835995,0.00018333184,0.00004305341,0.8653429,0.004234375,0.122398324,0.0074484395,0.000031142506],"about_ca_topic_score_codex":0.0012064829,"about_ca_topic_score_gemma":0.00081785093,"teacher_disagreement_score":0.0023350937,"about_ca_system_score_codex":0.00058385363,"about_ca_system_score_gemma":0.00069413247,"threshold_uncertainty_score":0.0078116655},"labels":[],"label_agreement":null},{"id":"W4245074662","doi":"10.23952/jano.2.2020.2.08","title":"The effect of deterministic noise on a quasi-subgradient method for quasi-convex feasibility problems","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Education of Guangdong Province; Natural Science Foundation of Guangdong Province; Natural Science Foundation of Chongqing; Chongqing University; Shenzhen University; National Natural Science Foundation of China","keywords":"Subgradient method; Mathematical optimization; Regular polygon; Noise (video); Mathematics; Convex optimization; Applied mathematics; Computer science; Artificial intelligence; Geometry","score_opus":0.015804789809167923,"score_gpt":0.2717489569966035,"score_spread":0.25594416718743557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245074662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017213525,0.0003329492,0.98086035,0.00027739682,0.000077485936,0.000030703486,0.000013949777,0.00009634024,0.0010973632],"genre_scores_gemma":[0.599492,0.0008576943,0.39556178,0.00034099806,0.00010831673,0.0002019476,0.000082296916,0.00018813804,0.0031667377],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99892753,0.0005844164,0.00005114415,0.000101681246,0.00027874016,0.00005649028],"domain_scores_gemma":[0.9959401,0.0029297017,0.0002812621,0.00023231945,0.0005047608,0.00011180985],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029688312,0.000951416,0.0010859956,0.00036034055,0.00046801593,0.0010461609,0.0012291202,0.0013594326,0.0012547133],"category_scores_gemma":[0.010472851,0.00048523417,0.0005981925,0.0003365082,0.0016707105,0.0015417697,0.0012822743,0.0016854159,0.00017492405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021190365,0.000052815147,0.0007099254,0.00023592218,0.000051117993,0.00019754928,0.00014174887,0.9202057,0.005972955,0.048210844,0.0010387741,0.022970753],"study_design_scores_gemma":[0.0000034119453,0.000019717309,0.00003313302,0.00000405506,0.0000029358355,0.000007860975,0.0000029431806,0.9983071,0.00043227454,0.0010168988,0.00016712245,0.000002472146],"about_ca_topic_score_codex":0.003223074,"about_ca_topic_score_gemma":0.002080337,"teacher_disagreement_score":0.003223074,"about_ca_system_score_codex":0.00065765146,"about_ca_system_score_gemma":0.0011444674,"threshold_uncertainty_score":0.015700877},"labels":[],"label_agreement":null},{"id":"W4245430892","doi":"10.23952/jano.2.2020.1.04","title":"Superiorized regularization of inverse problems","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Numerical methods in inverse problems","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Austrian Science Fund","keywords":"Regularization (linguistics); Inverse; Inverse problem; Applied mathematics; Mathematics; Computer science; Artificial intelligence; Mathematical analysis; Geometry","score_opus":0.05095649951014571,"score_gpt":0.2858056067282158,"score_spread":0.2348491072180701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245430892","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004339188,0.00024021993,0.9921936,0.00022678894,0.00005954128,0.000016083392,0.000027704587,0.00009391265,0.002803076],"genre_scores_gemma":[0.372755,0.0013139845,0.61569345,0.00043652617,0.00029187254,0.00021217519,0.00022869784,0.00032233945,0.008746028],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983968,0.00066735747,0.00006510807,0.00021198837,0.0005646862,0.00009393229],"domain_scores_gemma":[0.99824584,0.00075921125,0.00019163126,0.00037338247,0.0003698918,0.000060128554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026335807,0.0006617479,0.0010043575,0.0009232422,0.00042677726,0.0015471802,0.0008740662,0.0013030171,0.002425595],"category_scores_gemma":[0.005378889,0.00039944623,0.00096032716,0.00065135484,0.002433515,0.0017367458,0.0025641348,0.0018923213,0.0005007536],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007639068,0.000029672652,0.00043043934,0.0002405387,0.00006947363,0.000100291916,0.00016740612,0.31237096,0.016836355,0.6176521,0.002660729,0.04936564],"study_design_scores_gemma":[0.000008401973,0.000028558741,0.00009268868,0.000023036946,0.000008820522,0.000054515633,0.0000107150345,0.8974466,0.0028355555,0.09480416,0.004673418,0.000013498675],"about_ca_topic_score_codex":0.00088627974,"about_ca_topic_score_gemma":0.0006322655,"teacher_disagreement_score":0.0026335807,"about_ca_system_score_codex":0.0008246365,"about_ca_system_score_gemma":0.0013466874,"threshold_uncertainty_score":0.013927877},"labels":[],"label_agreement":null},{"id":"W4246059835","doi":"10.23952/jano.1.2019.3.07","title":"Karush-Kuhn-Tucker optimality conditions and duality for set optimization problems with mixed constraints","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Duality (order theory); Set (abstract data type); Mathematical optimization; Mathematics; Computer science; Combinatorics","score_opus":0.010954508190814213,"score_gpt":0.2360023193427086,"score_spread":0.22504781115189437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246059835","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.041331675,0.0017098392,0.9294149,0.0013044487,0.000130048,0.00012697911,0.00025077022,0.00008522415,0.025646202],"genre_scores_gemma":[0.7098145,0.002120853,0.27722317,0.00050292665,0.00024287726,0.00082626473,0.0003709813,0.00013033055,0.008768119],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980046,0.00093491917,0.00012334925,0.00024540338,0.00047154128,0.0002202477],"domain_scores_gemma":[0.9962973,0.0026011686,0.00034765466,0.00014512165,0.00046274712,0.00014601748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0048057004,0.0013810601,0.0017066451,0.0018067608,0.000973247,0.0029888647,0.0011615814,0.0018523072,0.0043743756],"category_scores_gemma":[0.013579678,0.0007937722,0.0015770707,0.0014884348,0.0027474498,0.004841252,0.0025395537,0.004266688,0.0005701812],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056841047,0.000041240928,0.00032144165,0.00019846816,0.000047779944,0.00011526114,0.0001251106,0.068368524,0.002012559,0.9190087,0.0010451234,0.008659128],"study_design_scores_gemma":[0.00003443308,0.00008042349,0.00033839216,0.00009565474,0.000023266435,0.000114840426,0.00010084336,0.3321081,0.0019202116,0.66267407,0.0024729583,0.000036767324],"about_ca_topic_score_codex":0.0010056386,"about_ca_topic_score_gemma":0.00087986153,"teacher_disagreement_score":0.0048057004,"about_ca_system_score_codex":0.0016373744,"about_ca_system_score_gemma":0.0020011447,"threshold_uncertainty_score":0.025415242},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lipschitz continuity; Mathematics; Applied mathematics; Thermodynamics; Mathematical analysis; Physics","score_opus":0.014048048805629614,"score_gpt":0.20343329967294563,"score_spread":0.189385250867316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246097035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02018405,0.0002431193,0.9763724,0.00031406185,0.000040158873,0.000023099094,0.000039465976,0.000030795607,0.0027529132],"genre_scores_gemma":[0.7898584,0.0010787859,0.20094189,0.0002400949,0.00011374164,0.0002492961,0.00011846349,0.00008287485,0.007316471],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945515,0.00024623724,0.000029888977,0.00008859503,0.00013112879,0.000048889557],"domain_scores_gemma":[0.99806803,0.0011529761,0.00030115998,0.0001634693,0.00025106216,0.0000633372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001750876,0.00082859973,0.0005873067,0.0007217144,0.00040580487,0.0014153685,0.0009458596,0.001153096,0.0020034611],"category_scores_gemma":[0.0062344605,0.00039195377,0.0007777313,0.00043575038,0.0020614443,0.0024350455,0.0017016901,0.0015962822,0.00020577302],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044333683,0.000026365924,0.00079274265,0.00016262074,0.000044853798,0.00013480487,0.00018084564,0.26764894,0.011567771,0.7081735,0.0004911609,0.010732039],"study_design_scores_gemma":[0.0000043991795,0.000030546376,0.00016471032,0.00001787091,0.000006465727,0.000051621668,0.000036435973,0.8879841,0.001644018,0.10883356,0.0012143374,0.000012006912],"about_ca_topic_score_codex":0.0009912348,"about_ca_topic_score_gemma":0.0006662612,"teacher_disagreement_score":0.0020034611,"about_ca_system_score_codex":0.0006823023,"about_ca_system_score_gemma":0.0006396478,"threshold_uncertainty_score":0.009259582},"labels":[],"label_agreement":null},{"id":"W4247170081","doi":"10.23952/jano.2.2020.2.07","title":"Two inertial linesearch extragradient algorithms for the bilevel split pseudomonotone variational inequality with constraints","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai Municipal Education Commission; Ministry of Education of the People's Republic of China","keywords":"Variational inequality; Inertial frame of reference; Algorithm; Mathematics; Inequality; Applied mathematics; Computer science; Mathematical optimization; Mathematical analysis; Physics; Classical mechanics","score_opus":0.035579502305967216,"score_gpt":0.2832461937927081,"score_spread":0.2476666914867409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247170081","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004987088,0.00021687362,0.99307066,0.000100126395,0.000054864846,0.000042223324,0.00001964322,0.000101112746,0.0014072831],"genre_scores_gemma":[0.26085022,0.0005708823,0.7309748,0.00021727885,0.00015095517,0.00046197342,0.00027375654,0.00023188337,0.006268188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99951327,0.00015669188,0.000036348476,0.00008650106,0.00014942537,0.000057746507],"domain_scores_gemma":[0.9994061,0.0002560522,0.00006561425,0.000055975688,0.00014968589,0.00006661416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010338613,0.001379138,0.0014062056,0.00077659264,0.00048692725,0.0010145163,0.0018616102,0.0013455445,0.003949044],"category_scores_gemma":[0.0031547367,0.0005717057,0.0007688697,0.0006765472,0.0008255057,0.0022083467,0.0017541568,0.0021979515,0.0007169682],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00050353806,0.00024952166,0.0007456882,0.00051752804,0.00012926632,0.00023772086,0.00030309366,0.54988986,0.008780605,0.17509069,0.0059184525,0.2576341],"study_design_scores_gemma":[0.000030415922,0.00008469794,0.00007135247,0.000011915863,0.0000062274007,0.000031501546,0.000013622068,0.9896209,0.00077832275,0.00806089,0.0012791672,0.000010921261],"about_ca_topic_score_codex":0.002117756,"about_ca_topic_score_gemma":0.0025540628,"teacher_disagreement_score":0.003949044,"about_ca_system_score_codex":0.0006636613,"about_ca_system_score_gemma":0.0012200222,"threshold_uncertainty_score":0.013210893},"labels":[],"label_agreement":null},{"id":"W4247835158","doi":"10.23952/jano.1.2019.1.06","title":"Karush-Kuhn-Tucker optimality conditions for nonsmooth multiobjective semidefinite and semi-infinite programming","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Semidefinite programming; Mathematical optimization; Mathematics; Semidefinite embedding; Computer science; Applied mathematics; Quadratically constrained quadratic program; Quadratic programming","score_opus":0.007635573047310998,"score_gpt":0.24028631975403486,"score_spread":0.23265074670672387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247835158","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012480837,0.00015502145,0.9800795,0.00017269763,0.00003764238,0.0000652194,0.00009103721,0.000059234862,0.0068588494],"genre_scores_gemma":[0.67242754,0.00080112345,0.31369895,0.00026345334,0.00009078319,0.0008405964,0.00052548776,0.00021516076,0.0111369165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887615,0.0004426282,0.00006845254,0.00019530558,0.0003155111,0.00010182274],"domain_scores_gemma":[0.9974184,0.0016634787,0.0002358952,0.00009623872,0.00046828613,0.00011768834],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028763823,0.0016424279,0.0011471339,0.0008366793,0.0004961854,0.0016237035,0.0009847155,0.0012879678,0.003933574],"category_scores_gemma":[0.0068400027,0.0005068134,0.0008348054,0.00062056485,0.0017477634,0.001983471,0.0014810708,0.0025200406,0.0005680291],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008006693,0.00011773185,0.0003866107,0.00033830834,0.00004851287,0.0003024093,0.00022413423,0.37495577,0.008855332,0.5908768,0.0027172512,0.02109703],"study_design_scores_gemma":[0.000017087586,0.000075722404,0.00015724814,0.000035409168,0.000011155768,0.00008424178,0.00005472399,0.8625516,0.0024196461,0.13306615,0.0015057094,0.000021258116],"about_ca_topic_score_codex":0.0008547772,"about_ca_topic_score_gemma":0.0009071485,"teacher_disagreement_score":0.003933574,"about_ca_system_score_codex":0.0008326295,"about_ca_system_score_gemma":0.0016230528,"threshold_uncertainty_score":0.01521194},"labels":[],"label_agreement":null},{"id":"W4247884247","doi":"10.23952/jano.1.2019.3.01","title":"A special issue dedicated to Christiane Tammer","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"History","score_opus":0.004380773534918199,"score_gpt":0.21134893315077513,"score_spread":0.20696815961585693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247884247","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003311846,0.02066229,0.001006799,0.037490357,0.9154418,0.000067593195,0.00046583026,0.00023855013,0.02429565],"genre_scores_gemma":[0.0028757409,0.018289827,0.00053900346,0.014625026,0.79997355,0.0000899122,0.0006706203,0.00037813574,0.16255815],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983852,0.00022116303,0.00012675433,0.00047943322,0.00061937625,0.00016808083],"domain_scores_gemma":[0.99451953,0.0013136667,0.0004267679,0.00030537852,0.0017499485,0.0016846689],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014845611,0.0019392071,0.002048093,0.0022214793,0.001785739,0.005273529,0.0015591432,0.004093933,0.14471048],"category_scores_gemma":[0.0065798,0.00052603165,0.0010112552,0.000989683,0.0009769873,0.0034838116,0.0026333602,0.004387708,0.10624312],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030446621,0.000015778727,0.000055652257,0.00017010745,0.000006498157,0.00006077446,0.000015910126,0.000039580955,0.00024835608,0.0010609868,0.9807226,0.017573318],"study_design_scores_gemma":[0.000008192734,0.000021930162,0.00019170313,0.00010764632,0.0000069379876,0.00020955534,0.000018171555,0.000070707894,0.00013266307,0.001003012,0.9982223,0.0000071570007],"about_ca_topic_score_codex":0.00055331,"about_ca_topic_score_gemma":0.0007891843,"teacher_disagreement_score":0.14471048,"about_ca_system_score_codex":0.0016500454,"about_ca_system_score_gemma":0.0018779883,"threshold_uncertainty_score":0.4841048},"labels":[],"label_agreement":null},{"id":"W4248042746","doi":"10.23952/jano.3.2021.2.07","title":"A posteriori error control for variational inequalities with linear constraints in an abstract framework","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"A priori and a posteriori; Variational inequality; Mathematics; Inequality; Control (management); Applied mathematics; Mathematical optimization; Computer science; Mathematical analysis; Artificial intelligence; Philosophy; Epistemology","score_opus":0.016380383272252816,"score_gpt":0.2677829618036052,"score_spread":0.2514025785313524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248042746","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036788299,0.0002586443,0.99380964,0.00015897091,0.00006166573,0.000021372858,0.000026946058,0.0000366154,0.0019472853],"genre_scores_gemma":[0.435015,0.0014042143,0.54545116,0.00029821854,0.0004306953,0.00043076862,0.00031310078,0.00039123077,0.016265646],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984615,0.0008002871,0.000072991184,0.00023221075,0.00033767364,0.000095366195],"domain_scores_gemma":[0.9957688,0.0030185324,0.0003512854,0.00019223672,0.00048204348,0.0001871498],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004371197,0.0019094078,0.0018149363,0.0012221914,0.00069036183,0.0025750005,0.0018331305,0.0021470657,0.002434051],"category_scores_gemma":[0.008898498,0.0007878326,0.0012434964,0.0009127246,0.0026356883,0.0027549095,0.004507894,0.003131226,0.00029704033],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015656516,0.00010250448,0.00024985493,0.00038215975,0.00010550989,0.000070002185,0.00014999468,0.50804514,0.005288259,0.4573287,0.0013036942,0.026817631],"study_design_scores_gemma":[0.000008332269,0.000029163353,0.00004153068,0.00001954368,0.000008830821,0.00000779228,0.000008004159,0.95873904,0.00039724656,0.040187,0.00054489804,0.000008606714],"about_ca_topic_score_codex":0.0051356675,"about_ca_topic_score_gemma":0.0037347102,"teacher_disagreement_score":0.0051356675,"about_ca_system_score_codex":0.0013727243,"about_ca_system_score_gemma":0.0021834986,"threshold_uncertainty_score":0.023117363},"labels":[],"label_agreement":null},{"id":"W4248114642","doi":"10.23952/jano.2.2020.2.02","title":"Some new iterative algorithms for finding fixed points of nonexpansive mappings","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities","keywords":"Fixed point; Algorithm; Mathematics; Computer science; Discrete mathematics; Mathematical analysis","score_opus":0.023667283085235857,"score_gpt":0.2526007596630225,"score_spread":0.22893347657778662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248114642","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013926097,0.00034262636,0.9974807,0.00004372581,0.00006244205,0.000034633136,0.000009106425,0.000059807604,0.00057431817],"genre_scores_gemma":[0.04758914,0.0013819054,0.9473121,0.00009052841,0.00016106683,0.00037923965,0.000093388015,0.00010776515,0.0028848555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988319,0.00033241473,0.00011253979,0.00021541807,0.000437514,0.0000702394],"domain_scores_gemma":[0.9988815,0.00052572956,0.0000965546,0.000094644005,0.00034726338,0.000054358028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023466628,0.0016454448,0.0014238899,0.0013064862,0.0006610117,0.0012291933,0.0019904284,0.0018600632,0.002321461],"category_scores_gemma":[0.0056793005,0.00079177856,0.00156762,0.0010881547,0.0012001032,0.00291963,0.0019118265,0.0029053574,0.0006729926],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012977488,0.00013538085,0.0011198957,0.0012668454,0.00024645883,0.00037134223,0.00063453574,0.37070313,0.017955314,0.28296492,0.0037328503,0.32073957],"study_design_scores_gemma":[0.00004519499,0.00009800895,0.00015612946,0.00006431122,0.00003979477,0.0002961068,0.000040282757,0.9430304,0.0051382584,0.041722868,0.009320165,0.000048566653],"about_ca_topic_score_codex":0.00088475255,"about_ca_topic_score_gemma":0.00084406795,"teacher_disagreement_score":0.0023466628,"about_ca_system_score_codex":0.0005349044,"about_ca_system_score_gemma":0.0013245259,"threshold_uncertainty_score":0.0124105215},"labels":[],"label_agreement":null},{"id":"W4248519834","doi":"10.23952/jano.1.2019.3.09","title":"The role of nonlinear scalarization functions in characterizing generalized convex vector functions","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","keywords":"Nonlinear system; Mathematics; Regular polygon; Convex function; Vector-valued function; Applied mathematics; Pure mathematics; Physics; Geometry","score_opus":0.0045039012846747155,"score_gpt":0.1969571943526005,"score_spread":0.1924532930679258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248519834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16851607,0.0010653688,0.8154108,0.00044038575,0.000081891594,0.00005885074,0.00012438343,0.000099455974,0.014202799],"genre_scores_gemma":[0.9223695,0.0013499659,0.06940441,0.00013940078,0.00019758182,0.00007282214,0.00015582248,0.00011821102,0.006192241],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994123,0.00024894672,0.000030581905,0.00009666056,0.00014985792,0.00006160571],"domain_scores_gemma":[0.9985262,0.0005544492,0.00027358712,0.00012659152,0.000379644,0.00013959677],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018062262,0.0010246168,0.00047782745,0.0013375742,0.00050176674,0.001688736,0.0005480058,0.00037667,0.0012537732],"category_scores_gemma":[0.002892256,0.00020182574,0.00040945562,0.0008205962,0.0031844538,0.0042589265,0.0010953445,0.0012689546,0.00026831956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064157735,0.000022743756,0.0012554124,0.00010760334,0.000014148718,0.00017141327,0.00030435683,0.03275395,0.009253982,0.9375617,0.000512969,0.017977595],"study_design_scores_gemma":[0.000012446158,0.00021571861,0.002097454,0.000064885964,0.000016823133,0.0004026831,0.0004162533,0.37890872,0.008092543,0.6014195,0.008285614,0.00006734325],"about_ca_topic_score_codex":0.0007948751,"about_ca_topic_score_gemma":0.0005389225,"teacher_disagreement_score":0.0018062262,"about_ca_system_score_codex":0.00083492405,"about_ca_system_score_gemma":0.00048075643,"threshold_uncertainty_score":0.00955236},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Psychology","score_opus":0.01826649990284673,"score_gpt":0.2627202259413634,"score_spread":0.24445372603851667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248646680","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020134246,0.04558228,0.018296853,0.02600502,0.8586502,0.00013519132,0.0005686168,0.00033349087,0.04841486],"genre_scores_gemma":[0.011086355,0.03255872,0.0067134043,0.007227622,0.8052799,0.00014795705,0.0010115523,0.00085344026,0.13512102],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99781597,0.0003507207,0.00016075812,0.0004278875,0.0010524668,0.00019223793],"domain_scores_gemma":[0.99226624,0.0027933049,0.00055147475,0.0005622902,0.0028976589,0.00092899316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026595474,0.001948266,0.002583649,0.0040738275,0.0014937558,0.007419307,0.0018884932,0.0037845387,0.07723168],"category_scores_gemma":[0.0081137065,0.00060723006,0.0020250326,0.003825223,0.0011359407,0.0044038286,0.0016774071,0.004391667,0.020030633],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011585899,0.00011811919,0.00027105163,0.0005389806,0.00006634416,0.00010891025,0.000015470523,0.00077682367,0.0006396849,0.009432888,0.9187377,0.06917826],"study_design_scores_gemma":[0.000044613436,0.00024812194,0.0016966691,0.0005121514,0.000112800386,0.0004044691,0.00005832623,0.0064726626,0.00076572294,0.020003602,0.9696398,0.000041091986],"about_ca_topic_score_codex":0.0006075502,"about_ca_topic_score_gemma":0.001461677,"teacher_disagreement_score":0.07723168,"about_ca_system_score_codex":0.0016850422,"about_ca_system_score_gemma":0.0020843956,"threshold_uncertainty_score":0.2583657},"labels":[],"label_agreement":null},{"id":"W4248792414","doi":"10.23952/jano.2.2020.3.07","title":"Strong convergence of a modified inertial forward-backward splitting algorithm for a inclusion problem","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Algorithm; Inertial frame of reference; Inclusion (mineral); Mathematics; Computer science; Mathematical optimization; Physics; Classical mechanics; Economics","score_opus":0.013296763590287608,"score_gpt":0.23489089749541092,"score_spread":0.2215941339051233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248792414","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012087072,0.00008623844,0.9853147,0.0001317702,0.00004561863,0.000038843402,0.000012153772,0.00006565037,0.0022179529],"genre_scores_gemma":[0.34705022,0.00025665667,0.64596635,0.00019181649,0.00012835061,0.0003648768,0.000119363314,0.00013395943,0.0057884217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995332,0.00014903142,0.000029501312,0.00005588172,0.00018123834,0.00005118609],"domain_scores_gemma":[0.99939954,0.000292699,0.00004582208,0.000044124823,0.00013593177,0.00008183632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017235604,0.00069927785,0.0007633072,0.0004613351,0.0004841501,0.0006937674,0.0012003822,0.0011311328,0.0022296517],"category_scores_gemma":[0.0022792968,0.0003129334,0.0007083832,0.0002944087,0.0011085353,0.0011013316,0.002198285,0.001624954,0.0003610947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032792886,0.00022243861,0.0010184789,0.00037747456,0.00009609499,0.00028439483,0.0004344805,0.5385971,0.03627777,0.28939885,0.0030570326,0.12990795],"study_design_scores_gemma":[0.000017309138,0.00007640151,0.000074214135,0.000010742192,0.000004665196,0.000031135718,0.000012438518,0.9826481,0.0015557241,0.014581215,0.0009805982,0.000007488545],"about_ca_topic_score_codex":0.0014028697,"about_ca_topic_score_gemma":0.0011191379,"teacher_disagreement_score":0.0022296517,"about_ca_system_score_codex":0.000489188,"about_ca_system_score_gemma":0.0012338196,"threshold_uncertainty_score":0.0091151595},"labels":[],"label_agreement":null},{"id":"W4249161544","doi":"10.23952/jano.1.2019.1.07","title":"Weak sharpness and finite convergence for mixed variational inequalities","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Contact Mechanics and Variational Inequalities","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"China Postdoctoral Science Foundation; National Natural Science Foundation of China","keywords":"Variational inequality; Convergence (economics); Applied mathematics; Mathematics; Inequality; Mathematical optimization; Mathematical analysis; Economics","score_opus":0.016130815682163686,"score_gpt":0.2341674326852839,"score_spread":0.21803661700312021,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249161544","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054645848,0.0011029035,0.93911195,0.00032102843,0.00007194448,0.00006908178,0.00005837376,0.00013568864,0.0044832802],"genre_scores_gemma":[0.815396,0.0011253895,0.17467892,0.00022335848,0.00015104905,0.0002855973,0.00021244204,0.00015648814,0.0077708103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99837995,0.00061409833,0.00008172352,0.00024625118,0.00051930384,0.00015860917],"domain_scores_gemma":[0.9930735,0.0044598323,0.0007407842,0.0004146251,0.0008268412,0.00048452168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004607413,0.0018066034,0.0010393799,0.0021632893,0.00085655827,0.0019794737,0.001804322,0.00122376,0.002675616],"category_scores_gemma":[0.017942382,0.0008519312,0.0014137304,0.0008776509,0.004297884,0.0038618043,0.0036646624,0.005147385,0.0003269534],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030013296,0.000088762965,0.0017921673,0.00042787872,0.00012467011,0.00026951265,0.00061174063,0.14983311,0.0168242,0.7960435,0.00087647105,0.032807868],"study_design_scores_gemma":[0.000023113193,0.00021434294,0.00058337155,0.00008000571,0.000027526288,0.0001193771,0.000105230436,0.72358257,0.006064222,0.26772964,0.0014319393,0.00003869292],"about_ca_topic_score_codex":0.00081004994,"about_ca_topic_score_gemma":0.0004714862,"teacher_disagreement_score":0.004607413,"about_ca_system_score_codex":0.001610247,"about_ca_system_score_gemma":0.0009074995,"threshold_uncertainty_score":0.024366617},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.01535851846013394,"score_gpt":0.2400392040955849,"score_spread":0.22468068563545096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249283703","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021678666,0.002207968,0.94959325,0.0010138714,0.00028953125,0.00004515544,0.00007688683,0.00007474911,0.025019925],"genre_scores_gemma":[0.7882207,0.0025377828,0.17308508,0.00049743865,0.00029148077,0.0002024122,0.00016178619,0.00023113684,0.034772236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9997886,0.00006204305,0.000007222819,0.000033263743,0.00009002512,0.000018904222],"domain_scores_gemma":[0.99985766,0.000053265907,0.000019447984,0.0000143175375,0.000039236358,0.000016114289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000745154,0.0006261513,0.0006573203,0.00045519852,0.00043357734,0.0010944366,0.0006494803,0.0013116853,0.0023998157],"category_scores_gemma":[0.0012708488,0.00022409351,0.00057593174,0.00046427787,0.0015550316,0.0012150413,0.0014624874,0.0014099919,0.0004662412],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054988734,0.000033460165,0.00024296147,0.00015067827,0.000018721075,0.00014549008,0.00014590818,0.24886529,0.011616645,0.70857614,0.0021938796,0.02795589],"study_design_scores_gemma":[0.000012864643,0.00004602378,0.00019462685,0.000027471648,0.0000075986864,0.00006406983,0.000025066402,0.88654053,0.0010699119,0.106730334,0.005259764,0.000021675007],"about_ca_topic_score_codex":0.0024893356,"about_ca_topic_score_gemma":0.001842034,"teacher_disagreement_score":0.0024893356,"about_ca_system_score_codex":0.00091659144,"about_ca_system_score_gemma":0.0010761356,"threshold_uncertainty_score":0.00802815},"labels":[],"label_agreement":null},{"id":"W4249757450","doi":"10.23952/jano.2.2020.3.03","title":"$L^\\infty$-stability for a class of parametric optimal control problems with mixed pointwise constraints","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Science and Technology, Taiwan; National Foundation for Science and Technology Development","keywords":"Pointwise; Class (philosophy); Stability (learning theory); Mathematics; Parametric statistics; Applied mathematics; Control (management); Mathematical optimization; Pure mathematics; Mathematical analysis; Computer science; Statistics; Artificial intelligence","score_opus":0.013711567518721511,"score_gpt":0.20823951385260372,"score_spread":0.1945279463338822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249757450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15789375,0.00096329924,0.8260319,0.0007787495,0.0000532283,0.00007188737,0.00007574927,0.00011614548,0.014015259],"genre_scores_gemma":[0.9731502,0.00042230327,0.021504525,0.00008553346,0.00005817476,0.00016104101,0.0000703245,0.00004857217,0.004499463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99959654,0.00014611453,0.000014020997,0.000090779446,0.000107811284,0.00004468212],"domain_scores_gemma":[0.99882454,0.0007012082,0.00017417812,0.00004714181,0.00018703932,0.00006588259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010295925,0.0008340028,0.0006134073,0.00058813574,0.0005450589,0.0013532548,0.0006708535,0.00082353054,0.001846771],"category_scores_gemma":[0.003069116,0.00023505828,0.000709823,0.00028613955,0.0015032872,0.0012156322,0.0017704666,0.0012360553,0.00017711527],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033069245,0.00010560709,0.0022422136,0.00041291802,0.00016234674,0.00048412764,0.0004839564,0.53014094,0.038897432,0.38449627,0.0021386826,0.0401047],"study_design_scores_gemma":[0.000010429595,0.00007486876,0.00027050954,0.000014419329,0.000007569565,0.00005999591,0.000044084576,0.9675075,0.0017685408,0.029624965,0.00060704834,0.000010038847],"about_ca_topic_score_codex":0.0011344256,"about_ca_topic_score_gemma":0.00047733102,"teacher_disagreement_score":0.001846771,"about_ca_system_score_codex":0.000559517,"about_ca_system_score_gemma":0.00055651413,"threshold_uncertainty_score":0.0061780214},"labels":[],"label_agreement":null},{"id":"W4249847888","doi":"10.23952/jano.3.2021.1.14","title":"Convergence of an iterative process generated by a regular vector field","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"advanced mathematical theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Process (computing); Iterative and incremental development; Field (mathematics); Computer science; Iterative method; Mathematical optimization; Mathematics; Algorithm; Economics; Pure mathematics; Software engineering","score_opus":0.012726458195521985,"score_gpt":0.29294268974966564,"score_spread":0.28021623155414366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249847888","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.112986244,0.00027035587,0.8816342,0.00036517333,0.000036864232,0.00008521799,0.000030230427,0.00011080316,0.004480925],"genre_scores_gemma":[0.8620712,0.00037205082,0.13106327,0.00007866842,0.00004177331,0.00024789944,0.00008514395,0.00007154799,0.005968494],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989011,0.0005204952,0.00004158673,0.00017582408,0.00023705023,0.0001238471],"domain_scores_gemma":[0.9942802,0.0037523126,0.00063567195,0.0001906515,0.00087029074,0.00027085803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037799843,0.0011344731,0.0010849972,0.0008860252,0.00052110775,0.0013599239,0.0010739476,0.0016613281,0.0013503317],"category_scores_gemma":[0.010571775,0.0003846333,0.000787044,0.0005003335,0.0025506974,0.0013414902,0.0022824805,0.0011369198,0.00021558181],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023958487,0.000068565605,0.001308982,0.00016835406,0.00007863567,0.0002725252,0.00036165374,0.85648686,0.011733566,0.115948424,0.00031514588,0.013017753],"study_design_scores_gemma":[0.000010219721,0.00006858386,0.00006018189,0.000009748471,0.000004738654,0.000016613432,0.000013331826,0.98993886,0.0012129642,0.008513499,0.00014318009,0.000008156797],"about_ca_topic_score_codex":0.0030771305,"about_ca_topic_score_gemma":0.0011008516,"teacher_disagreement_score":0.0037799843,"about_ca_system_score_codex":0.0011044256,"about_ca_system_score_gemma":0.0014624762,"threshold_uncertainty_score":0.019990683},"labels":[],"label_agreement":null},{"id":"W4250438687","doi":"10.23952/jano.1.2019.3.05","title":"Ekeland variational principles for vector equilibrium problems with solid ordering cones","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Contact Mechanics and Variational Inequalities","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational principle; Mathematics; Applied mathematics; Mathematical optimization; Mathematical economics; Computer science; Mathematical analysis","score_opus":0.01705921595157528,"score_gpt":0.22878711077966085,"score_spread":0.21172789482808557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250438687","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030575465,0.0007832247,0.9554839,0.0005627935,0.00008499237,0.000049829294,0.00010031658,0.000036072972,0.0123233935],"genre_scores_gemma":[0.69721204,0.0030660871,0.2582873,0.0004366021,0.0002045822,0.0003980347,0.00054085883,0.00020360861,0.03965089],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994319,0.0001692297,0.0000375176,0.0000929631,0.00020378978,0.00006459644],"domain_scores_gemma":[0.99940836,0.00026978157,0.00006522278,0.000029976956,0.00015531587,0.00007134401],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021914316,0.0009163359,0.0008614895,0.0010357389,0.00091055303,0.0016931115,0.0010287164,0.0011506703,0.0025132033],"category_scores_gemma":[0.0027096097,0.0004257703,0.0009885781,0.0005924411,0.0018504973,0.0029626528,0.0019183215,0.0018276557,0.00034032942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012486109,0.000014646673,0.00015951491,0.00004403195,0.000011939409,0.00006269982,0.000074096264,0.036594603,0.0017153835,0.9566384,0.0004642828,0.004207966],"study_design_scores_gemma":[0.000010635592,0.00003530043,0.00014101023,0.000024970212,0.0000073952933,0.000055794797,0.0000819992,0.38905278,0.0007748524,0.6067928,0.00300964,0.000012833489],"about_ca_topic_score_codex":0.003028382,"about_ca_topic_score_gemma":0.0025841752,"teacher_disagreement_score":0.003028382,"about_ca_system_score_codex":0.0016800386,"about_ca_system_score_gemma":0.001616907,"threshold_uncertainty_score":0.012189567},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.09222090177705922,"score_gpt":0.3793088991012824,"score_spread":0.2870879973242232,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251102484","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0033412094,0.00012650111,0.9949321,0.00013040048,0.000024881056,0.00003199431,0.00002117181,0.000058741247,0.0013329599],"genre_scores_gemma":[0.22922026,0.0004897455,0.7656747,0.00028568905,0.00018126913,0.00056301913,0.0003092798,0.00033388525,0.0029421973],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9934756,0.0031756943,0.0004678209,0.00076159986,0.0019609784,0.00015833128],"domain_scores_gemma":[0.98569065,0.009601676,0.0008287133,0.0016104525,0.0018855915,0.0003828945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009927655,0.0011508552,0.0013551681,0.0018127512,0.0008485556,0.0026909783,0.00246233,0.0018046853,0.002566857],"category_scores_gemma":[0.03556981,0.0007378043,0.0013356406,0.0017007426,0.0031855148,0.0044354536,0.0064598285,0.0036254714,0.00077094126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019369401,0.000075762015,0.00094791024,0.0002647473,0.00007710525,0.00009663476,0.00029449025,0.17626885,0.0036461216,0.7480101,0.0010901598,0.06903437],"study_design_scores_gemma":[0.000024455601,0.00012662988,0.0001454467,0.00006096942,0.000012921346,0.00006643355,0.000034737604,0.77469414,0.0033475033,0.21749036,0.003973066,0.000023352795],"about_ca_topic_score_codex":0.000618281,"about_ca_topic_score_gemma":0.00034643902,"teacher_disagreement_score":0.009927655,"about_ca_system_score_codex":0.0014121715,"about_ca_system_score_gemma":0.0015146862,"threshold_uncertainty_score":0.05250311},"labels":[],"label_agreement":null},{"id":"W4251314684","doi":"10.23952/jano.1.2019.1.05","title":"Three convergence results for continuous descent methods with a convex objective function","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Descent (aeronautics); Convergence (economics); Mathematics; Function (biology); Convex function; Regular polygon; Mathematical optimization; Applied mathematics; Computer science; Economics; Physics; Geometry; Biology","score_opus":0.026549802017938412,"score_gpt":0.336297206979644,"score_spread":0.3097474049617056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251314684","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028264027,0.00123977,0.9876187,0.0005088816,0.00021899951,0.00006255877,0.00004997266,0.0001619922,0.0073127416],"genre_scores_gemma":[0.25771236,0.0045416974,0.71223134,0.0011969351,0.0009397844,0.0007588125,0.00045293785,0.0011485668,0.02101754],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99734265,0.0008296453,0.00016158973,0.00032420264,0.0011107537,0.00023114521],"domain_scores_gemma":[0.9854651,0.0074705863,0.00085573085,0.0010998936,0.004046279,0.0010624767],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008421288,0.0024903954,0.0013016652,0.0026560568,0.0012655599,0.0026399437,0.0028585775,0.00302426,0.0045870873],"category_scores_gemma":[0.025906386,0.0007401412,0.0026542647,0.0013643788,0.0044484534,0.0034084336,0.0038202314,0.0050393213,0.0022054017],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036553532,0.00026906643,0.0025868292,0.0011514882,0.00022672657,0.00051249634,0.0007425794,0.14694992,0.011530469,0.68437076,0.015580096,0.13571404],"study_design_scores_gemma":[0.000055842338,0.00019575034,0.0006624249,0.00026258695,0.00007151081,0.000464473,0.000094192306,0.8158915,0.008949285,0.16106068,0.012190809,0.0001009852],"about_ca_topic_score_codex":0.0026378187,"about_ca_topic_score_gemma":0.0015583868,"teacher_disagreement_score":0.008421288,"about_ca_system_score_codex":0.0017138999,"about_ca_system_score_gemma":0.0020360635,"threshold_uncertainty_score":0.04453653},"labels":[],"label_agreement":null},{"id":"W4251680909","doi":"10.23952/jano.3.2021.1.06","title":"Minimum energy control problem for one class of singularly perturbed systems with input delay","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Differential Equations and Numerical Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Class (philosophy); Control theory (sociology); Control (management); Energy (signal processing); Computer science; Mathematics; Statistics; Artificial intelligence","score_opus":0.02239009086013307,"score_gpt":0.2654726181018459,"score_spread":0.24308252724171284,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251680909","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14122385,0.0006282255,0.849245,0.0004679231,0.00011000918,0.00005255875,0.00007155793,0.000104147955,0.008096676],"genre_scores_gemma":[0.98531187,0.0002790211,0.011907808,0.00003616603,0.000037822887,0.000039804345,0.000041427284,0.000013960904,0.0023321558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99981993,0.000043381566,0.000009739759,0.000056194986,0.000046560897,0.00002417391],"domain_scores_gemma":[0.9996692,0.00016347707,0.00007661738,0.000016154485,0.000051326657,0.000023215476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039408242,0.0008074617,0.0007930223,0.00040604806,0.0004275546,0.0009345417,0.00050190336,0.00097281544,0.0010196713],"category_scores_gemma":[0.00084391196,0.00017043002,0.00045752653,0.00023242783,0.00083042757,0.0006890433,0.0006402779,0.00062830746,0.00008272814],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021435092,0.00006529508,0.0007666369,0.00025150378,0.000083348416,0.0006276286,0.00020110728,0.88059103,0.022491641,0.078534044,0.0006828091,0.015490575],"study_design_scores_gemma":[0.000012957579,0.00006609295,0.00014523105,0.0000064025494,0.0000090250305,0.000039792052,0.000029524364,0.9910211,0.0011504132,0.007142925,0.00036880496,0.000007807802],"about_ca_topic_score_codex":0.0017033898,"about_ca_topic_score_gemma":0.0006245914,"teacher_disagreement_score":0.0017033898,"about_ca_system_score_codex":0.0004475562,"about_ca_system_score_gemma":0.0003620718,"threshold_uncertainty_score":0.0034111142},"labels":[],"label_agreement":null},{"id":"W4252466691","doi":"10.23952/jano.2.2020.3.01","title":"Projection-type methods with alternating inertial steps for solving multivalued variational inequalities beyond monotonicity","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation","keywords":"Monotonic function; Variational inequality; Type (biology); Inertial frame of reference; Projection (relational algebra); Mathematics; Projection method; Applied mathematics; Inequality; Mathematical analysis; Mathematical optimization; Dykstra's projection algorithm; Algorithm; Physics; Classical mechanics","score_opus":0.026495487289215598,"score_gpt":0.2956079964048903,"score_spread":0.26911250911567475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252466691","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0043345485,0.00022570121,0.9935464,0.000075070435,0.00004196865,0.000038546958,0.000010350393,0.00008071637,0.0016467621],"genre_scores_gemma":[0.15380292,0.00067185983,0.8409611,0.0001697612,0.00012489849,0.00030871353,0.00007663056,0.00015076701,0.0037333225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999438,0.00023111803,0.00003892262,0.00006803703,0.00018761739,0.000036195856],"domain_scores_gemma":[0.9989918,0.00057834707,0.00007224759,0.0001119964,0.00018782628,0.00005778793],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001519559,0.00083387335,0.0007387833,0.0005174608,0.00047250208,0.0006516907,0.0010899834,0.0009434479,0.0022006189],"category_scores_gemma":[0.0034503152,0.00037043338,0.00095529953,0.0005055392,0.00097616616,0.0013363645,0.001672485,0.0024884595,0.0004884497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001837671,0.00020060792,0.0011756059,0.00059991644,0.00012646295,0.00020533729,0.00043721878,0.461824,0.024790691,0.2835792,0.00253385,0.22434334],"study_design_scores_gemma":[0.000014107137,0.000051196483,0.00007561394,0.000016413298,0.000007947299,0.000034766974,0.000011197819,0.978035,0.0019416137,0.018011963,0.0017903437,0.000009762367],"about_ca_topic_score_codex":0.0012783757,"about_ca_topic_score_gemma":0.001382469,"teacher_disagreement_score":0.0022006189,"about_ca_system_score_codex":0.00034185304,"about_ca_system_score_gemma":0.001111675,"threshold_uncertainty_score":0.008036315},"labels":[],"label_agreement":null},{"id":"W4252738740","doi":"10.23952/jano.3.2021.1.10","title":"On global optimality conditions for D.C. minimization problems with D.C. constraints","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Minification; Mathematical optimization; Computer science; Mathematics","score_opus":0.010066415683730939,"score_gpt":0.24448335597363383,"score_spread":0.2344169402899029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252738740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009136016,0.002022818,0.96809936,0.0009490666,0.00021447618,0.00014651929,0.00031508916,0.00010158837,0.019015124],"genre_scores_gemma":[0.4571192,0.00882562,0.509023,0.0020735143,0.0009489588,0.0018403671,0.0020340325,0.00093976274,0.017195472],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984213,0.00061653444,0.00010403385,0.00030439429,0.00036857324,0.00018517938],"domain_scores_gemma":[0.991912,0.00593808,0.00053751114,0.00020451141,0.0011827732,0.00022506533],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0058165095,0.0032583089,0.0017552827,0.0026750155,0.0009366531,0.002279322,0.0010153034,0.002754752,0.0052130856],"category_scores_gemma":[0.0124219125,0.00085733685,0.0020993704,0.0016787507,0.0031591407,0.0025669825,0.0033591238,0.0045340993,0.0013567253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013366206,0.000094313975,0.00069918064,0.0008117485,0.000074548894,0.00037552934,0.00027539817,0.3157558,0.0052067474,0.6326498,0.010839391,0.033083893],"study_design_scores_gemma":[0.00005397037,0.00021432774,0.0005305113,0.0003155321,0.000051697687,0.00018080129,0.00014465454,0.69187605,0.0026305139,0.2913936,0.0125404345,0.00006800129],"about_ca_topic_score_codex":0.0023698143,"about_ca_topic_score_gemma":0.0018379549,"teacher_disagreement_score":0.0058165095,"about_ca_system_score_codex":0.0014313387,"about_ca_system_score_gemma":0.0024850338,"threshold_uncertainty_score":0.030761003},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Foundation for Science and Technology Development","keywords":"Lexicographical order; Convergence (economics); Applied mathematics; Mathematics; Mathematical optimization; Mathematical economics; Computer science; Economics; Combinatorics","score_opus":0.015232416422481996,"score_gpt":0.20665672051667072,"score_spread":0.19142430409418873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252888861","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10279782,0.0012359412,0.8600933,0.0018609407,0.00012332409,0.0001470849,0.00015379842,0.00010833977,0.033479434],"genre_scores_gemma":[0.8199133,0.0022099928,0.15650159,0.00044903185,0.00012034542,0.00063559966,0.0003641618,0.00016434248,0.01964156],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988117,0.0006124422,0.00006577709,0.0001451045,0.00025115383,0.00011395173],"domain_scores_gemma":[0.9976834,0.0015575561,0.00024049795,0.000070959315,0.0003448026,0.00010279228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024610374,0.0009329057,0.0007771827,0.0015933287,0.00088266353,0.0020969103,0.00089804205,0.0014380018,0.0051527624],"category_scores_gemma":[0.012890981,0.00045703023,0.0008196571,0.00068408396,0.0024144356,0.002469217,0.0032109395,0.00176678,0.00057631364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000087782755,0.000038916492,0.0006071217,0.0002519432,0.00005388339,0.00013922385,0.00038627288,0.13517377,0.003536033,0.84811246,0.0010258368,0.010586739],"study_design_scores_gemma":[0.00003129617,0.000084664454,0.00024888277,0.00009084625,0.000010323639,0.00010052303,0.00040587908,0.5017161,0.002117199,0.49189842,0.0032687504,0.00002707799],"about_ca_topic_score_codex":0.0014109067,"about_ca_topic_score_gemma":0.001011631,"teacher_disagreement_score":0.0051527624,"about_ca_system_score_codex":0.0013263993,"about_ca_system_score_gemma":0.0011882863,"threshold_uncertainty_score":0.017237723},"labels":[],"label_agreement":null},{"id":"W4253114670","doi":"10.23952/jano.3.2021.2.04","title":"A Tikhonov-type regularization for Brézis pseudomonotone equilibrium problems in Banach spaces","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tikhonov regularization; Banach space; Regularization (linguistics); Mathematics; Type (biology); Applied mathematics; Pure mathematics; Mathematical analysis; Computer science; Inverse problem; Artificial intelligence; Geology","score_opus":0.01128739405459117,"score_gpt":0.23319282345994366,"score_spread":0.2219054294053525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253114670","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09009529,0.0014372307,0.8990862,0.0010305669,0.00013548619,0.000099173645,0.000037439397,0.000057290825,0.008021345],"genre_scores_gemma":[0.83123314,0.0014776665,0.14639275,0.0003209039,0.00016610089,0.00035338535,0.00010998677,0.00007829665,0.019867828],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99954104,0.0001810537,0.000022962027,0.0000754483,0.000136009,0.000043480206],"domain_scores_gemma":[0.99950457,0.0002362775,0.00008286119,0.000028318369,0.00008585506,0.0000620778],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001621387,0.00088954245,0.0009855367,0.0008067991,0.0007182097,0.0011437056,0.001025247,0.0020894422,0.0012631989],"category_scores_gemma":[0.0021324828,0.00039155828,0.0010131868,0.00035673133,0.0018051466,0.0017234096,0.0020163197,0.001756912,0.00017881829],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002043924,0.00017935745,0.0013601796,0.000807919,0.00012507204,0.0003798313,0.00044990887,0.217697,0.049300425,0.70603406,0.0010058489,0.022456037],"study_design_scores_gemma":[0.000022875576,0.00012750652,0.00034175726,0.000036808127,0.000012817823,0.00009890796,0.00008549368,0.9380928,0.0025305492,0.057018243,0.0016104345,0.000021777707],"about_ca_topic_score_codex":0.0014446244,"about_ca_topic_score_gemma":0.0012073088,"teacher_disagreement_score":0.0020894422,"about_ca_system_score_codex":0.0009317789,"about_ca_system_score_gemma":0.001262327,"threshold_uncertainty_score":0.008574784},"labels":[],"label_agreement":null},{"id":"W4253456546","doi":"10.23952/jano.2.2020.2.04","title":"Strong convergence of two inertial projection algorithms in Hilbert spaces","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Inertial frame of reference; Hilbert space; Convergence (economics); Algorithm; Projection (relational algebra); Mathematics; Computer science; Pure mathematics; Physics; Classical mechanics; Economics","score_opus":0.014073114877043255,"score_gpt":0.24559639989761287,"score_spread":0.23152328502056962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253456546","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0045346916,0.000087870496,0.99447155,0.000054271182,0.000022916354,0.000026920403,0.000005160413,0.00006248845,0.0007341466],"genre_scores_gemma":[0.29560646,0.0004227208,0.69932413,0.00017397452,0.00013066849,0.00046047624,0.000102193706,0.00012458621,0.003654731],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981852,0.0005603459,0.0001275301,0.00036300303,0.0005981895,0.0001656158],"domain_scores_gemma":[0.99814844,0.000916017,0.00019362362,0.0001725223,0.00039447233,0.00017504487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002932879,0.0013156396,0.0012673289,0.0012042037,0.0007972866,0.0014112056,0.0017815756,0.0016300924,0.0023759978],"category_scores_gemma":[0.006550426,0.0006146649,0.001196171,0.00084592664,0.0021278497,0.0032181893,0.004236173,0.0026230237,0.00043991653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022315134,0.00015845084,0.0013087863,0.00034164026,0.00013592863,0.00018656073,0.0005484771,0.31244865,0.0077183093,0.4761698,0.0016568893,0.19910336],"study_design_scores_gemma":[0.000024885612,0.00010749524,0.00016983425,0.00001796782,0.000012253422,0.00006638708,0.000038580216,0.9502776,0.0023143918,0.045550484,0.0013958092,0.00002423791],"about_ca_topic_score_codex":0.0012197839,"about_ca_topic_score_gemma":0.0008683016,"teacher_disagreement_score":0.002932879,"about_ca_system_score_codex":0.0008462117,"about_ca_system_score_gemma":0.0018313184,"threshold_uncertainty_score":0.015510738},"labels":[],"label_agreement":null},{"id":"W4253635760","doi":"10.23952/jano.2.2020.2.03","title":"Semi-proximal augmented Lagrangian method for sparse estimation of high-dimensional inverse covariance matrices","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Statistical and numerical algorithms","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Inverse; Covariance; Estimation of covariance matrices; Applied mathematics; Augmented Lagrangian method; Mathematics; Lagrangian; Estimation; Inverse problem; Mathematical optimization; Statistics; Mathematical analysis; Geometry; Engineering","score_opus":0.026842200663506195,"score_gpt":0.2913756800443169,"score_spread":0.26453347938081073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253635760","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00152544,0.000058818212,0.99797016,0.00004487551,0.00000898657,0.000007351873,0.000009942778,0.000053781838,0.00032061402],"genre_scores_gemma":[0.1938989,0.0004946241,0.80051434,0.00013890416,0.0000804559,0.00021740796,0.00024212242,0.00013271884,0.0042805327],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995734,0.00019672359,0.00001382881,0.000048330854,0.00013010387,0.00003764373],"domain_scores_gemma":[0.99927455,0.00043091198,0.00007897918,0.000056846922,0.00011994402,0.000038813363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012491221,0.0007935113,0.0010875299,0.00055329077,0.00041345484,0.000664567,0.0009805323,0.0010206078,0.0019963516],"category_scores_gemma":[0.0022330733,0.00049689034,0.00087066554,0.00069018453,0.0009965854,0.0010013937,0.001313114,0.0016964565,0.00051225396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047407913,0.000034502063,0.0003559003,0.00012319353,0.0000465926,0.00009926265,0.000084871055,0.9210261,0.003268896,0.033533737,0.0016329843,0.039746597],"study_design_scores_gemma":[0.000003509336,0.000008803408,0.000025154124,0.0000029966202,0.0000020390048,0.0000101024125,0.0000032726803,0.99658763,0.00022414196,0.0027556985,0.0003733934,0.00000313526],"about_ca_topic_score_codex":0.003564307,"about_ca_topic_score_gemma":0.0039154133,"teacher_disagreement_score":0.003564307,"about_ca_system_score_codex":0.00047106526,"about_ca_system_score_gemma":0.0016485647,"threshold_uncertainty_score":0.0070871115},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai Municipal Education Commission; Ministry of Education of the People's Republic of China","keywords":"Fixed point; Mathematics; Point (geometry); Inclusion (mineral); Mathematical optimization; Mathematical analysis; Physics; Geometry; Thermodynamics","score_opus":0.014595461027167638,"score_gpt":0.2570349487863004,"score_spread":0.24243948775913277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253828966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02437095,0.000088256966,0.9738833,0.00008349995,0.000021483536,0.000027437742,0.0000073283622,0.000026930462,0.0014907538],"genre_scores_gemma":[0.59085894,0.00026405707,0.4018122,0.000070638285,0.000043278476,0.00025306857,0.00006793418,0.00008551807,0.00654442],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99912626,0.0002805241,0.000046096553,0.00018072521,0.00027411073,0.00009233253],"domain_scores_gemma":[0.99856573,0.0006676167,0.0002161413,0.00011238057,0.00025645786,0.0001817234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027566694,0.0009945896,0.0013262237,0.0013547492,0.0006739284,0.0018101411,0.0018393437,0.0022452734,0.0019738607],"category_scores_gemma":[0.005833096,0.0005846725,0.0016063566,0.0006122788,0.0025863885,0.0026391125,0.0046641617,0.0022983055,0.00031086942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001614305,0.00009700042,0.0012127545,0.00020283375,0.0001123676,0.00048540422,0.00060092495,0.36422372,0.011548033,0.5919924,0.00073343323,0.028629648],"study_design_scores_gemma":[0.0000076057177,0.000054004548,0.000056684054,0.000016229384,0.0000081532335,0.000069968504,0.000051562565,0.96180385,0.0016920005,0.03555431,0.00067543297,0.000010114006],"about_ca_topic_score_codex":0.0012478146,"about_ca_topic_score_gemma":0.0008943353,"teacher_disagreement_score":0.0027566694,"about_ca_system_score_codex":0.00094490126,"about_ca_system_score_gemma":0.0013398144,"threshold_uncertainty_score":0.014578819},"labels":[],"label_agreement":null},{"id":"W4255259813","doi":"10.23952/jano.3.2021.1.12","title":"Optimal control in the traffic flow: Multi-lane signalized intersection","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Traffic control and management","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Intersection (aeronautics); Traffic flow (computer networking); Transport engineering; Computer science; Control (management); Environmental science; Engineering; Artificial intelligence; Computer network","score_opus":0.005620303069232417,"score_gpt":0.1920975139865558,"score_spread":0.1864772109173234,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4255259813","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055185035,0.000368882,0.93819755,0.00017253408,0.00006955382,0.000050323655,0.00006507572,0.000115036644,0.005776099],"genre_scores_gemma":[0.9754708,0.00022580403,0.021658584,0.000035673933,0.00003510693,0.00006986669,0.000048573955,0.000021462994,0.0024340297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926525,0.00025509144,0.000019080402,0.00014465477,0.00016886425,0.00014706788],"domain_scores_gemma":[0.999405,0.0002715734,0.000107036176,0.000025606596,0.00015752082,0.000033329397],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00084788643,0.00084246526,0.0010392258,0.00044495365,0.00039270025,0.0012665192,0.0010849667,0.00096619397,0.0016872004],"category_scores_gemma":[0.0015453176,0.00047627316,0.00065971643,0.0007163761,0.001098876,0.0010271672,0.0009002708,0.0010267807,0.00014925291],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002702226,0.0000170773,0.00007316657,0.00002206006,0.000009556138,0.000015947773,0.000015540341,0.99225384,0.00060985226,0.0049697566,0.00012940908,0.0018567676],"study_design_scores_gemma":[0.0000040810432,0.000014892016,0.000024603602,0.0000015173756,0.000002439455,0.0000014798471,0.000002959134,0.99902856,0.000083092295,0.00077884103,0.000055890272,0.0000017203598],"about_ca_topic_score_codex":0.014563062,"about_ca_topic_score_gemma":0.0069212294,"teacher_disagreement_score":0.014563062,"about_ca_system_score_codex":0.0013834639,"about_ca_system_score_gemma":0.0019461901,"threshold_uncertainty_score":0.028956592},"labels":[],"label_agreement":null},{"id":"W4256235392","doi":"10.23952/jano.2.2020.2.01","title":"Primal-dual algorithm for solving a convex image dejittering model with hybrid finite differences","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Remote-Sensing Image Classification","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; University of Hong Kong; National Natural Science Foundation of China; Centre National de la Recherche Scientifique; Université de Toulouse; Georgia Institute of Technology","keywords":"Dual (grammatical number); Regular polygon; Image (mathematics); Convex analysis; Mathematics; Mathematical optimization; Algorithm; Computer science; Convex optimization; Artificial intelligence; Geometry","score_opus":0.014303819283388862,"score_gpt":0.19939396366733275,"score_spread":0.1850901443839439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256235392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004100292,0.0002871527,0.9929623,0.00024696154,0.00005739424,0.00004808066,0.00005266294,0.00011611981,0.0021290777],"genre_scores_gemma":[0.2783775,0.0004975139,0.71074635,0.0004979991,0.00013389667,0.000689009,0.00047052267,0.00027273502,0.008314451],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999673,0.00011620863,0.000016543572,0.000064164444,0.000084617546,0.000045404304],"domain_scores_gemma":[0.9992186,0.0005044019,0.000057053378,0.00003287517,0.00013245182,0.00005460487],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015675484,0.0013141255,0.0016632352,0.0005911663,0.00049772725,0.0012352837,0.0015028429,0.0017942649,0.0041459426],"category_scores_gemma":[0.002040334,0.00073075196,0.0008980527,0.0006112436,0.0008967168,0.00087102497,0.0018217484,0.0024017936,0.000725974],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055262724,0.000058283964,0.00035554502,0.0001334445,0.000034805103,0.00007469499,0.000041690077,0.95950264,0.00089464174,0.015881332,0.0021328093,0.020834923],"study_design_scores_gemma":[0.000006476251,0.000009586626,0.00001515206,0.000004032933,0.0000021839546,0.0000066899147,0.000003888181,0.99797267,0.00009664788,0.0016070188,0.00027356378,0.0000020467285],"about_ca_topic_score_codex":0.005943596,"about_ca_topic_score_gemma":0.005639472,"teacher_disagreement_score":0.005943596,"about_ca_system_score_codex":0.00095164124,"about_ca_system_score_gemma":0.002412524,"threshold_uncertainty_score":0.013869584},"labels":[],"label_agreement":null},{"id":"W4256472077","doi":"10.23952/jano.2.2020.3.04","title":"The subgradient extragradient-type algorithms for solving a class of monotone variational inclusion problems","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities","keywords":"Subgradient method; Monotone polygon; Class (philosophy); Inclusion (mineral); Mathematics; Type (biology); Applied mathematics; Mathematical optimization; Variational inequality; Algorithm; Algebra over a field; Computer science; Pure mathematics; Artificial intelligence; Psychology; Social psychology","score_opus":0.016708107747700325,"score_gpt":0.2328252932967818,"score_spread":0.2161171855490815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256472077","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0018291526,0.00030878946,0.9965952,0.00007769621,0.00006227789,0.00004906879,0.000013792736,0.00007207907,0.0009919517],"genre_scores_gemma":[0.08295324,0.0008323493,0.9123955,0.00016494501,0.00012323441,0.0003266117,0.00013637527,0.00012086051,0.002946875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992017,0.0003166562,0.000050781568,0.00009795855,0.0002747866,0.000058104815],"domain_scores_gemma":[0.99929965,0.00031942225,0.000065983426,0.000063021784,0.00019322881,0.00005862143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017912254,0.0013949908,0.0013604416,0.00089293247,0.00042809785,0.0008259345,0.0019883458,0.0015436764,0.0020723902],"category_scores_gemma":[0.0038261118,0.0005170676,0.0010994095,0.0008309081,0.0007751845,0.0017416517,0.0015007971,0.0025458168,0.00065434695],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002185669,0.0001965826,0.0008222098,0.0009010887,0.00015261571,0.00024265533,0.0002821068,0.51746535,0.010164548,0.16973905,0.0057070414,0.2941081],"study_design_scores_gemma":[0.000018527515,0.0000591013,0.000087739034,0.000020137164,0.000008165821,0.00006408769,0.000010097627,0.98645884,0.0013247883,0.008900373,0.0030373489,0.000010800142],"about_ca_topic_score_codex":0.0014639414,"about_ca_topic_score_gemma":0.0017367747,"teacher_disagreement_score":0.0020723902,"about_ca_system_score_codex":0.00053328095,"about_ca_system_score_gemma":0.0013838902,"threshold_uncertainty_score":0.009473026},"labels":[],"label_agreement":null},{"id":"W4285116060","doi":"10.23952/jano.4.2022.2.04","title":"Parallel projection method for solving split equilibrium problems","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Projection (relational algebra); Computer science; Mathematical optimization; Mathematical economics; Mathematics; Algorithm","score_opus":0.015174813360367327,"score_gpt":0.2575961429409186,"score_spread":0.24242132958055126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285116060","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008906275,0.00018495544,0.9877208,0.00012170532,0.00003858534,0.00003485922,0.000013086713,0.00005423133,0.002925575],"genre_scores_gemma":[0.54573876,0.0007894313,0.43893388,0.00018486968,0.000097563076,0.0004984263,0.000111354464,0.00015354641,0.013492218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9996313,0.00012872292,0.000014567277,0.000059250982,0.00012989395,0.000036304296],"domain_scores_gemma":[0.9997228,0.00014189178,0.000023424798,0.000020568637,0.000056695826,0.000034515335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093230413,0.0007751121,0.0010619188,0.00046565387,0.00058088894,0.0008677701,0.0010581253,0.0009400061,0.0035018893],"category_scores_gemma":[0.0013577958,0.00047941512,0.0006507347,0.00041901733,0.0012964723,0.0013899998,0.0023478833,0.0017546011,0.00052337645],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016946647,0.000116981326,0.00060413464,0.00033553469,0.00011121972,0.00028219575,0.00021684954,0.6347223,0.008732463,0.2974526,0.0014625464,0.05579376],"study_design_scores_gemma":[0.000012590262,0.00003043949,0.000028681532,0.0000069273215,0.0000038868616,0.000029215642,0.000019511468,0.96909565,0.00066748785,0.029259091,0.0008408473,0.0000056296117],"about_ca_topic_score_codex":0.0011649816,"about_ca_topic_score_gemma":0.001237157,"teacher_disagreement_score":0.0035018893,"about_ca_system_score_codex":0.0004172919,"about_ca_system_score_gemma":0.0009532896,"threshold_uncertainty_score":0.011714995},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.009970642827420623,"score_gpt":0.24167634954167252,"score_spread":0.2317057067142519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285159165","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25396416,0.0009781289,0.7331386,0.00070825825,0.00013436508,0.00007366595,0.00011202986,0.00013013228,0.010760592],"genre_scores_gemma":[0.90715337,0.0007997346,0.0816825,0.0001598202,0.00008122112,0.00017587718,0.00019214838,0.00019042483,0.009565014],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99894625,0.0004389787,0.000060466416,0.00016072026,0.0002780983,0.00011556414],"domain_scores_gemma":[0.9942532,0.0035075461,0.00070557074,0.00039706737,0.00072007725,0.00041649284],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030314918,0.00131416,0.0009911252,0.0014647626,0.0007681439,0.0014553415,0.0009986464,0.001059247,0.0021023203],"category_scores_gemma":[0.01535265,0.00056528405,0.0010055893,0.0006212868,0.003731272,0.0029332025,0.0032878937,0.0020784084,0.00017509726],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001866583,0.000033663135,0.002110569,0.00019927799,0.000087308625,0.0003103867,0.0005605159,0.2859835,0.0033819024,0.69064975,0.00086582144,0.015630584],"study_design_scores_gemma":[0.0000129959935,0.0000966952,0.0005520703,0.000046980538,0.000012784763,0.000082004386,0.00016052356,0.61338323,0.0014557017,0.38311416,0.001058751,0.000023989065],"about_ca_topic_score_codex":0.0023783906,"about_ca_topic_score_gemma":0.0018597577,"teacher_disagreement_score":0.0030314918,"about_ca_system_score_codex":0.0012528212,"about_ca_system_score_gemma":0.0008265754,"threshold_uncertainty_score":0.016032279},"labels":[],"label_agreement":null},{"id":"W4285179989","doi":"10.23952/jano.4.2022.2.01","title":"A Special Issue on Projection and Splitting Methods and Their Applications","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Projection (relational algebra); Computer science; Algorithm","score_opus":0.009304687153161816,"score_gpt":0.2711098398652638,"score_spread":0.26180515271210203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285179989","genre_codex":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037800807,0.23399904,0.35163203,0.01757388,0.22721481,0.00025304806,0.00068630883,0.0009404297,0.16392043],"genre_scores_gemma":[0.040343083,0.2089913,0.17934583,0.0064347964,0.32351148,0.00047343163,0.002035737,0.0025995346,0.23626487],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99834335,0.0003807121,0.00014463658,0.00038001564,0.0006729831,0.0000782872],"domain_scores_gemma":[0.9968329,0.0015196188,0.00014939505,0.00034544233,0.00083799276,0.00031468167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024663447,0.0016679871,0.0015559869,0.0022094618,0.0012429014,0.0037683893,0.0014670857,0.0027672446,0.035804745],"category_scores_gemma":[0.0069881235,0.00067300064,0.0014471263,0.0030937719,0.0018827566,0.003392897,0.0023694308,0.0059612724,0.01577725],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010369976,0.00012524452,0.0005246777,0.0010875977,0.00013175304,0.0003032238,0.00016990262,0.008298291,0.0016153452,0.15716667,0.5053962,0.32507744],"study_design_scores_gemma":[0.000016519743,0.00008648415,0.000472212,0.00046355557,0.000037070335,0.00070678256,0.000057033267,0.018924063,0.00068491994,0.11661139,0.8619006,0.000039392395],"about_ca_topic_score_codex":0.0006568353,"about_ca_topic_score_gemma":0.00066927396,"teacher_disagreement_score":0.035804745,"about_ca_system_score_codex":0.0007926346,"about_ca_system_score_gemma":0.0011784318,"threshold_uncertainty_score":0.11977881},"labels":[],"label_agreement":null},{"id":"W4285221937","doi":"10.23952/jano.4.2022.2.11","title":"Superiorization with a projected subgradient method","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subgradient method; Mathematics; Mathematical optimization","score_opus":0.005466644890986958,"score_gpt":0.21366184018363155,"score_spread":0.20819519529264457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285221937","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037692692,0.00009112867,0.99399084,0.0000835382,0.000029490104,0.000023858822,0.00001356733,0.00010043627,0.0018979041],"genre_scores_gemma":[0.27533388,0.0005065762,0.71584314,0.0002292472,0.00013950783,0.00030485072,0.00016597025,0.0002395334,0.0072373394],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917907,0.0003698004,0.0000332854,0.000085407264,0.0002843875,0.000048065187],"domain_scores_gemma":[0.9993254,0.00027597253,0.000055028526,0.00007349388,0.00022269791,0.000047431222],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017041642,0.00081078784,0.0011122958,0.0005981948,0.00035598507,0.000808545,0.00074386765,0.00082910835,0.0032566213],"category_scores_gemma":[0.0028040425,0.00043665167,0.0006767952,0.0005719341,0.00089473155,0.0014037336,0.0013761872,0.0013535938,0.0007145995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109801746,0.00006927467,0.00034076863,0.00022557202,0.0000608935,0.0001128588,0.00010317526,0.7125184,0.008690044,0.1724393,0.0028336383,0.10249624],"study_design_scores_gemma":[0.000007086573,0.000040604766,0.000026456948,0.0000060592824,0.000003671231,0.000014947735,0.0000032400756,0.98879725,0.0007458702,0.009334214,0.0010172349,0.0000033653532],"about_ca_topic_score_codex":0.0013984245,"about_ca_topic_score_gemma":0.0010068896,"teacher_disagreement_score":0.0032566213,"about_ca_system_score_codex":0.0006028423,"about_ca_system_score_gemma":0.0015065832,"threshold_uncertainty_score":0.010894477},"labels":[],"label_agreement":null},{"id":"W4285223524","doi":"10.23952/jano.4.2022.2.06","title":"The Tseng’s extragradient method for semistrictly quasimonotone 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":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational inequality; Inequality; Mathematics; Applied mathematics; Pure mathematics; Mathematical economics; Calculus (dental); Mathematical analysis; Medicine; Orthodontics","score_opus":0.01621640043584723,"score_gpt":0.25877031491027075,"score_spread":0.2425539144744235,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285223524","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009292232,0.00028845525,0.98859566,0.00012888368,0.000058977934,0.000037683618,0.000009441916,0.000049395116,0.0015392697],"genre_scores_gemma":[0.46790457,0.0006522482,0.522822,0.00022207444,0.00009797789,0.0002796827,0.00006664241,0.000113323855,0.00784145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995216,0.00022223472,0.000027196704,0.0000565668,0.0001385672,0.000033910557],"domain_scores_gemma":[0.9994147,0.00031604175,0.000044835928,0.000047981663,0.00013045555,0.000046029854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014481802,0.0008347597,0.00080100814,0.0005691053,0.00037045512,0.00060963345,0.0009186714,0.0009930392,0.0015499206],"category_scores_gemma":[0.002014648,0.00035309594,0.0008806901,0.00034100396,0.0011184403,0.0012401957,0.0010913513,0.0015079597,0.0002409675],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021576336,0.00014196265,0.001386033,0.0007535569,0.00016965996,0.00046156245,0.0003678965,0.6084186,0.028455878,0.24902545,0.0021594965,0.10844406],"study_design_scores_gemma":[0.000007944089,0.000047530717,0.00006951458,0.000009379476,0.0000048391767,0.000030365225,0.000007540762,0.9914402,0.0012924535,0.0061969757,0.00088645215,0.0000067566853],"about_ca_topic_score_codex":0.0020235945,"about_ca_topic_score_gemma":0.0019147788,"teacher_disagreement_score":0.0020235945,"about_ca_system_score_codex":0.00055071944,"about_ca_system_score_gemma":0.0009068141,"threshold_uncertainty_score":0.007658839},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.011135720018041528,"score_gpt":0.22566582963416587,"score_spread":0.21453010961612434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285242070","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020656658,0.0001609405,0.99621385,0.00017509157,0.000020884045,0.00004138998,0.000043460543,0.00010561794,0.0011730684],"genre_scores_gemma":[0.13852754,0.00062251196,0.8535547,0.00028637174,0.00006270417,0.00082462275,0.00045735415,0.00052634365,0.0051378426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99871314,0.0005164287,0.00008620403,0.00019698775,0.00041373083,0.00007348479],"domain_scores_gemma":[0.99739885,0.0015518499,0.000212876,0.0002174235,0.0005019846,0.000117102965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029544355,0.0018143022,0.0010590461,0.0009763351,0.0006230346,0.0016935623,0.0019372625,0.0026313448,0.0038666017],"category_scores_gemma":[0.011153635,0.00067078864,0.0010154615,0.0010566299,0.0019800428,0.0029359118,0.003164858,0.0046716076,0.0011112092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007200083,0.000074284544,0.00035654366,0.00024606427,0.000042606465,0.000077164914,0.00009376003,0.766657,0.003249661,0.15435965,0.0032176252,0.0715536],"study_design_scores_gemma":[0.000005049183,0.000019686267,0.00005395681,0.00002301931,0.0000027210363,0.000020653868,0.000006447357,0.9677086,0.00087700906,0.029934965,0.0013382762,0.000009584462],"about_ca_topic_score_codex":0.0025193526,"about_ca_topic_score_gemma":0.0026269262,"teacher_disagreement_score":0.0038666017,"about_ca_system_score_codex":0.002315742,"about_ca_system_score_gemma":0.0018927592,"threshold_uncertainty_score":0.016801953},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convexity; Algorithm; Mathematics; Computer science; Combinatorics; Applied mathematics; Economics","score_opus":0.011029380757755265,"score_gpt":0.21775269350536228,"score_spread":0.20672331274760702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285242719","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025949022,0.00006891742,0.99605113,0.00015441947,0.0000126203495,0.000014993741,0.000027035825,0.000041980744,0.0010339157],"genre_scores_gemma":[0.43371698,0.000526658,0.5520485,0.00049130013,0.00009861959,0.00037829255,0.00035090884,0.00017537338,0.0122134285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994624,0.00020882236,0.00001996659,0.0001151979,0.00014298841,0.000050573537],"domain_scores_gemma":[0.9993741,0.00033823086,0.0000645523,0.000068353154,0.000108682936,0.000046144414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011783723,0.0007251142,0.0008882505,0.00044456084,0.00036608978,0.00089222105,0.0015980751,0.0017318529,0.003634113],"category_scores_gemma":[0.0028894905,0.00042451516,0.0008384203,0.00056629244,0.0012621069,0.001780504,0.0020594413,0.0018960959,0.00074904127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009799179,0.000040673236,0.00045130317,0.000100377896,0.000038234266,0.00011267724,0.00011631488,0.78012645,0.0044431863,0.17051955,0.002421717,0.041531473],"study_design_scores_gemma":[0.0000070885535,0.000025302088,0.00004407202,0.000005253397,0.0000037872414,0.000021606633,0.000006542243,0.9851893,0.00039261492,0.0134364925,0.0008601692,0.000007812571],"about_ca_topic_score_codex":0.0016630801,"about_ca_topic_score_gemma":0.0014346697,"teacher_disagreement_score":0.003634113,"about_ca_system_score_codex":0.00057238917,"about_ca_system_score_gemma":0.0008105982,"threshold_uncertainty_score":0.012157381},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"China Scholarship Council","keywords":"Inertial frame of reference; Variational inequality; Contraction (grammar); Mathematics; Applied mathematics; Mathematical analysis; Computer science; Physics; Classical mechanics; Medicine","score_opus":0.03312964160466782,"score_gpt":0.30382299757391995,"score_spread":0.27069335596925215,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285299972","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034315104,0.00019153843,0.9952638,0.00006131886,0.000056747795,0.000030441664,0.0000072105386,0.000038060174,0.00091927487],"genre_scores_gemma":[0.24004358,0.000962402,0.75237596,0.00017682495,0.00023177681,0.00054926873,0.000084129926,0.00011130161,0.005464768],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992249,0.0003164006,0.000041007082,0.00010490617,0.0002556871,0.000057087538],"domain_scores_gemma":[0.99934334,0.00031682372,0.000064334294,0.000075883756,0.00014426556,0.00005539726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014953798,0.0010771926,0.0008977109,0.0005300655,0.00045659352,0.00087437313,0.0015427293,0.0010986541,0.0021441325],"category_scores_gemma":[0.0027591034,0.000381158,0.00093848165,0.0006013735,0.0010627158,0.0013622929,0.0015165695,0.0021728643,0.00037171112],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017274565,0.00015683123,0.00067955215,0.00044122557,0.000111920606,0.00022408566,0.00031078447,0.46660843,0.018668504,0.27583015,0.0024676742,0.23432815],"study_design_scores_gemma":[0.000011048658,0.00005573522,0.00007887183,0.000008243666,0.0000039190304,0.000038919217,0.000008120049,0.98756844,0.001191341,0.009641395,0.0013828564,0.000011037242],"about_ca_topic_score_codex":0.0011594545,"about_ca_topic_score_gemma":0.0011259763,"teacher_disagreement_score":0.0021441325,"about_ca_system_score_codex":0.00040629588,"about_ca_system_score_gemma":0.0014207683,"threshold_uncertainty_score":0.007908404},"labels":[],"label_agreement":null},{"id":"W4312320539","doi":"10.23952/jano.4.2022.3.05","title":"Primal criteria of metric subregularity for generalized equations","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"advanced mathematical theories","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Hebei Province","keywords":"Metric (unit); Applied mathematics; Mathematics; Mathematical optimization; Mathematical analysis; Economics","score_opus":0.03953607865158522,"score_gpt":0.3299878064620216,"score_spread":0.2904517278104364,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312320539","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26352638,0.0010384129,0.7048856,0.00092342595,0.00016970649,0.00011954676,0.00034207746,0.00017550179,0.028819393],"genre_scores_gemma":[0.93445426,0.0006965979,0.054866564,0.00016957738,0.00026147845,0.000118438766,0.0002968709,0.00019752156,0.008938756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982799,0.00060071977,0.00012424288,0.00034497274,0.00046340784,0.00018677037],"domain_scores_gemma":[0.99557686,0.0018227939,0.0006470212,0.00042450134,0.00086854544,0.000660283],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033408124,0.0008922401,0.0010865264,0.0016867757,0.0007457848,0.0017635511,0.0010052056,0.000760733,0.005233407],"category_scores_gemma":[0.008138412,0.00041377556,0.0012683372,0.0005327681,0.0026849525,0.0034491923,0.0030590552,0.0028635676,0.00035825095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005149251,0.000019151657,0.0007904589,0.00005887795,0.000019730804,0.00018095,0.00015839194,0.010918647,0.0039367434,0.97865033,0.0005254981,0.004689799],"study_design_scores_gemma":[0.00002698651,0.00016869657,0.00158249,0.000040244264,0.000025307392,0.0004102755,0.00017379697,0.2728343,0.003177181,0.71722656,0.004279962,0.000054094806],"about_ca_topic_score_codex":0.0006453958,"about_ca_topic_score_gemma":0.00038831535,"teacher_disagreement_score":0.005233407,"about_ca_system_score_codex":0.0010927604,"about_ca_system_score_gemma":0.0005859405,"threshold_uncertainty_score":0.017668128},"labels":[],"label_agreement":null},{"id":"W4312340192","doi":"10.23952/jano.4.2022.3.04","title":"On split equality generalized equilibrium problems and fixed point problems of Bregman relatively nonexpansive semigroups","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation","keywords":"Fixed point; Mathematics; Bregman divergence; Applied mathematics; Fixed-point theorem; Point (geometry); Pure mathematics; Mathematical analysis; Geometry","score_opus":0.014802408140596576,"score_gpt":0.22547439034662203,"score_spread":0.21067198220602545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312340192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02148288,0.0002690605,0.97400814,0.00021664529,0.000039554172,0.000041831438,0.000011302909,0.000024937515,0.0039057322],"genre_scores_gemma":[0.6079707,0.0007969506,0.37888172,0.00020027044,0.00011927349,0.00037136598,0.000096218355,0.00008259155,0.011480803],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991757,0.00037386292,0.000038160753,0.0001473089,0.00019787846,0.0000670974],"domain_scores_gemma":[0.999209,0.0004916695,0.000072095885,0.00004388122,0.00012752171,0.000055818702],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023274114,0.0009146293,0.0008988262,0.00066574867,0.0007414575,0.0009838392,0.0008975599,0.0014042318,0.0030279444],"category_scores_gemma":[0.003533649,0.0003636173,0.0009838701,0.0004929082,0.0025528532,0.0028291673,0.0021753523,0.0022028426,0.00035420497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004725335,0.000044469612,0.0003763095,0.00017083334,0.000030126743,0.00025112863,0.00041076963,0.21333478,0.0061071096,0.75757563,0.0005653348,0.021086177],"study_design_scores_gemma":[0.000021829797,0.00008195114,0.00014158443,0.000027652115,0.000008871698,0.00012527451,0.0001371497,0.74545115,0.0019490999,0.24979998,0.0022351793,0.000020208488],"about_ca_topic_score_codex":0.0011304219,"about_ca_topic_score_gemma":0.00088434806,"teacher_disagreement_score":0.0030279444,"about_ca_system_score_codex":0.0007435009,"about_ca_system_score_gemma":0.0009287573,"threshold_uncertainty_score":0.012308657},"labels":[],"label_agreement":null},{"id":"W4312736249","doi":"10.23952/jano.4.2022.3.03","title":"A stochastic selective projection method for solving a constrained stochastic variational inequality problem","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational inequality; Projection (relational algebra); Inequality; Mathematical optimization; Mathematics; Applied mathematics; Computer science; Mathematical analysis; Algorithm","score_opus":0.013479440996961495,"score_gpt":0.26671886377582676,"score_spread":0.25323942277886524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312736249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014608587,0.00009370333,0.9975802,0.00003703401,0.000020334304,0.000023522049,0.000006999116,0.000048206515,0.0007290455],"genre_scores_gemma":[0.13621865,0.0007160047,0.85828,0.00015705079,0.00010597482,0.0003893489,0.00012498717,0.00008169279,0.003926197],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99962187,0.000113036716,0.00001798613,0.000063019856,0.0001565173,0.00002754686],"domain_scores_gemma":[0.9997638,0.00010887867,0.000020026455,0.000018521989,0.00006782968,0.000020999114],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007102269,0.0006816117,0.0007895262,0.00041291874,0.0003948642,0.0005224536,0.00104314,0.000718923,0.00205901],"category_scores_gemma":[0.0009810205,0.00038489388,0.0007377836,0.0005594671,0.00059459667,0.0008996543,0.0013573924,0.0013614097,0.00052130374],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013637675,0.00012768,0.0009936794,0.0005939787,0.00020431266,0.0002513733,0.00019197754,0.5587026,0.024432184,0.12942044,0.00421621,0.28072914],"study_design_scores_gemma":[0.000013162429,0.000041854135,0.000058641817,0.000008918155,0.000008532426,0.000053045653,0.0000067837527,0.9924744,0.0011760525,0.004568683,0.0015819488,0.000007885977],"about_ca_topic_score_codex":0.0022986599,"about_ca_topic_score_gemma":0.0019578245,"teacher_disagreement_score":0.0022986599,"about_ca_system_score_codex":0.00029606605,"about_ca_system_score_gemma":0.0014691848,"threshold_uncertainty_score":0.0068880916},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_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","score_opus":0.01213784961640096,"score_gpt":0.21528538780079812,"score_spread":0.20314753818439715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312757248","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010403196,0.00024626814,0.9876583,0.00021488579,0.00003636171,0.000020877509,0.000008491153,0.000052070252,0.0013595845],"genre_scores_gemma":[0.40525603,0.0007383277,0.5868056,0.00026950712,0.00019755593,0.00030461565,0.000121853125,0.00015520715,0.0061513614],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99925584,0.00030960885,0.00004013732,0.00011390937,0.00021755736,0.00006294483],"domain_scores_gemma":[0.9989912,0.00053057173,0.00015029876,0.000085174375,0.00014679386,0.00009587734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021925652,0.0010611265,0.0011496126,0.0012361859,0.0006928682,0.0010808845,0.0011772611,0.0018191965,0.0015653856],"category_scores_gemma":[0.0046162386,0.00048401006,0.0012367318,0.0006992062,0.0018794592,0.002344999,0.0025872595,0.0022287224,0.00023760628],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000105405015,0.000101368554,0.00087989564,0.00027180786,0.00009478715,0.00016493582,0.00024055065,0.33070704,0.006533188,0.6093619,0.0014211057,0.05011803],"study_design_scores_gemma":[0.000012825441,0.000037509235,0.00007302363,0.000010929592,0.000006780845,0.000025398349,0.000015793641,0.9542708,0.0005984084,0.04392726,0.0010118883,0.000009326304],"about_ca_topic_score_codex":0.0014776074,"about_ca_topic_score_gemma":0.0013452165,"teacher_disagreement_score":0.0021925652,"about_ca_system_score_codex":0.0008368722,"about_ca_system_score_gemma":0.0011462654,"threshold_uncertainty_score":0.011595547},"labels":[],"label_agreement":null},{"id":"W4312874287","doi":"10.23952/jano.4.2022.3.02","title":"Pareto subdifferential calculus for convex set-valued mappings and applications to set optimization","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subderivative; Pareto principle; Mathematics; Convex analysis; Set (abstract data type); Mathematical optimization; Regular polygon; Convex set; Calculus (dental); Convex optimization; Applied mathematics; Pure mathematics; Computer science; Medicine; Geometry","score_opus":0.014846795698720229,"score_gpt":0.2519294366041357,"score_spread":0.23708264090541548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312874287","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011167843,0.0015475049,0.97708285,0.0004085444,0.00011176697,0.000044840282,0.000048729402,0.000028982944,0.009559015],"genre_scores_gemma":[0.44511133,0.0050616777,0.5303147,0.000493879,0.000536499,0.00033767355,0.000169842,0.00017486543,0.01779955],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982774,0.0006092191,0.00014697967,0.00023516154,0.00062699936,0.00010418535],"domain_scores_gemma":[0.9979054,0.001186388,0.00015997703,0.00019332558,0.00042652368,0.00012851048],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0051086564,0.00092654896,0.0011382906,0.0022318445,0.00093698426,0.0022134536,0.0010116155,0.0008252583,0.002098819],"category_scores_gemma":[0.0068080863,0.0004286624,0.002086845,0.0017326016,0.003194207,0.003422519,0.0025239862,0.0034780507,0.00036737658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004124897,0.000009484933,0.00009706802,0.00003797843,0.000012696964,0.000043322005,0.00010394074,0.0069905613,0.0006625152,0.9850679,0.00022308457,0.006747186],"study_design_scores_gemma":[0.000006922636,0.000029577071,0.00017476645,0.000027354397,0.000014308607,0.00008867525,0.000052635438,0.09055965,0.0006360054,0.90204084,0.006355489,0.000013747389],"about_ca_topic_score_codex":0.0011525847,"about_ca_topic_score_gemma":0.0008986387,"teacher_disagreement_score":0.0051086564,"about_ca_system_score_codex":0.00185061,"about_ca_system_score_gemma":0.0012205946,"threshold_uncertainty_score":0.027017474},"labels":[],"label_agreement":null},{"id":"W4312982452","doi":"10.23952/jano.4.2022.3.08","title":"Revisiting inertial subgradient extragradient algorithms for solving bilevel variational inequality problems","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"China Scholarship Council","keywords":"Subgradient method; Variational inequality; Inertial frame of reference; Inequality; Bilevel optimization; Mathematics; Applied mathematics; Algorithm; Mathematical optimization; Computer science; Mathematical analysis; Optimization problem; Physics","score_opus":0.02305230992120919,"score_gpt":0.24771067076882358,"score_spread":0.2246583608476144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312982452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029727514,0.00035943254,0.9953707,0.000069752175,0.000067611996,0.000029515331,0.000012609972,0.00009738347,0.0010203681],"genre_scores_gemma":[0.27228376,0.0015497816,0.72049254,0.00025069618,0.00023312718,0.00028596754,0.000232357,0.0002466695,0.004425177],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992768,0.0002703412,0.00006280944,0.00009444121,0.0002266093,0.00006905047],"domain_scores_gemma":[0.999424,0.00024366954,0.0000568442,0.00006438,0.00016732857,0.000043934928],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014962801,0.001396854,0.001522265,0.0006415536,0.0003959613,0.001266395,0.0017126456,0.0010455238,0.0019957304],"category_scores_gemma":[0.0032122412,0.0005608815,0.0009079908,0.0007796877,0.0008501751,0.0019113536,0.0015506992,0.0021276767,0.0006519212],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020848111,0.00010506409,0.00056423055,0.0004740234,0.00010311168,0.00012660777,0.00020877158,0.7081899,0.0069025694,0.088406965,0.0033818,0.19132847],"study_design_scores_gemma":[0.0000110556775,0.00003295071,0.00004682561,0.000009360461,0.0000043161867,0.000013223108,0.0000068958066,0.99350643,0.00056829385,0.0045330115,0.0012616009,0.0000060419948],"about_ca_topic_score_codex":0.002757827,"about_ca_topic_score_gemma":0.0023163059,"teacher_disagreement_score":0.002757827,"about_ca_system_score_codex":0.0005691401,"about_ca_system_score_gemma":0.0012189146,"threshold_uncertainty_score":0.007913232},"labels":[],"label_agreement":null},{"id":"W4313021298","doi":"10.23952/jano.4.2022.3.06","title":"Hierarchical reinforcement learning with advantage function for entity relation extraction","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Text and Document Classification Technologies","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Reinforcement learning; Relation (database); Relationship extraction; Reinforcement; Computer science; Function (biology); Extraction (chemistry); Artificial intelligence; Psychology; Data mining; Biology; Chemistry; Social psychology; Chromatography","score_opus":0.008532871366860002,"score_gpt":0.23142409086263183,"score_spread":0.22289121949577181,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313021298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013467232,0.00027792368,0.98387873,0.00019600808,0.000035492423,0.000058580998,0.000041858526,0.0009486859,0.0010954334],"genre_scores_gemma":[0.7728329,0.00024091318,0.22165097,0.00034659897,0.000056113997,0.00023642638,0.00022496431,0.00014523596,0.0042658877],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883443,0.00035480742,0.0000786724,0.00031401444,0.00030237378,0.00011572004],"domain_scores_gemma":[0.99750227,0.0016697753,0.00020415052,0.00019290186,0.00033017405,0.000100722566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020611167,0.0009214442,0.0012909042,0.00070965214,0.0004063431,0.0007348778,0.0013613481,0.0010694131,0.0024807835],"category_scores_gemma":[0.0064782905,0.0004888367,0.00069009216,0.00055852946,0.00092899316,0.0020467844,0.0013323076,0.0018567003,0.00046868646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025295955,0.00021556986,0.002164593,0.00017656964,0.00010545244,0.00019898394,0.00019557342,0.74095094,0.0056530666,0.021628587,0.0024952453,0.22596245],"study_design_scores_gemma":[0.000010558399,0.000020859487,0.00008931,0.000002853489,0.0000062255413,0.000010007651,0.0000025638149,0.99585414,0.0005333651,0.0032111155,0.0002536223,0.0000054350444],"about_ca_topic_score_codex":0.0050977115,"about_ca_topic_score_gemma":0.0050010122,"teacher_disagreement_score":0.0050977115,"about_ca_system_score_codex":0.0011621481,"about_ca_system_score_gemma":0.0018351094,"threshold_uncertainty_score":0.010900319},"labels":[],"label_agreement":null},{"id":"W4313048877","doi":"10.23952/jano.4.2022.3.01","title":"The penalty method for the boundary condition of the Darcy system","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Contact Mechanics and Variational Inequalities","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Boundary value problem; Computer science; Mathematics; Mathematical analysis","score_opus":0.012500002203152715,"score_gpt":0.2584980322355899,"score_spread":0.2459980300324372,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4313048877","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048381384,0.00021172583,0.9915342,0.00019289719,0.00010782704,0.000037122823,0.000027839342,0.000060440918,0.0029897934],"genre_scores_gemma":[0.267633,0.00085602683,0.7143579,0.00039519736,0.0002312002,0.000585889,0.00025145288,0.00037662018,0.015312694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994356,0.0001863118,0.00002318598,0.00007219522,0.00023307258,0.00004960225],"domain_scores_gemma":[0.99950457,0.00015814055,0.000043273278,0.000058889495,0.00017458068,0.00006056949],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009456411,0.0006591452,0.00078002067,0.00086567696,0.0005761582,0.00081142824,0.0013019788,0.0010927853,0.0037247473],"category_scores_gemma":[0.0018887923,0.0003055621,0.0006481947,0.00043089932,0.0010958398,0.0014234241,0.0017158205,0.0019140764,0.00088654284],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013572501,0.00007587932,0.00072164036,0.00042935135,0.00004278204,0.00024144682,0.00021395735,0.30638343,0.035197694,0.5722508,0.0049597286,0.079347566],"study_design_scores_gemma":[0.000011343216,0.000028250299,0.000056728146,0.000012353829,0.000003580361,0.000048582166,0.000009148266,0.97765315,0.0018573705,0.016005695,0.004300683,0.000013078044],"about_ca_topic_score_codex":0.0018811193,"about_ca_topic_score_gemma":0.0011057567,"teacher_disagreement_score":0.0037247473,"about_ca_system_score_codex":0.0004292862,"about_ca_system_score_gemma":0.0011647335,"threshold_uncertainty_score":0.01246053},"labels":[],"label_agreement":null},{"id":"W4318332800","doi":"10.23952/jano.5.2023.1.10","title":"Lagrange duality of vector variational inequalities","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Contact Mechanics and Variational Inequalities","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Duality (order theory); Mathematics; Variational inequality; Inequality; Lagrange multiplier; Applied mathematics; Vector (molecular biology); Mathematical optimization; Pure mathematics; Mathematical economics; Mathematical analysis; Algebra over a field; Biology; Recombinant DNA","score_opus":0.024576176715438033,"score_gpt":0.24947366634210388,"score_spread":0.22489748962666584,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332800","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02158842,0.00278017,0.7910457,0.00408327,0.0007659684,0.00010420731,0.0005022429,0.00009771705,0.17903227],"genre_scores_gemma":[0.6241108,0.0055736965,0.21387242,0.0015406783,0.001535723,0.0005138837,0.00091608765,0.000509926,0.15142685],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988023,0.00066538464,0.000032128202,0.00010603415,0.00029186867,0.00010230147],"domain_scores_gemma":[0.9984565,0.0009299117,0.000099498015,0.00008197052,0.00033080776,0.00010137967],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00233766,0.0008796708,0.0011512751,0.0018077726,0.00082461373,0.0030348601,0.0009998883,0.0011155205,0.010892336],"category_scores_gemma":[0.0059433198,0.00066867174,0.0008880651,0.0016726013,0.0018407466,0.0026226593,0.0024493122,0.0042371247,0.0012656575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018603954,0.000021228438,0.000058585763,0.000043197404,0.000011086923,0.000011942819,0.000046912344,0.009397329,0.00033722701,0.97975355,0.0028380388,0.0074622734],"study_design_scores_gemma":[0.000015224772,0.000024524235,0.00013618567,0.000045598827,0.0000068063164,0.000026169177,0.000041757172,0.17487113,0.00026740663,0.81614965,0.008404179,0.000011451431],"about_ca_topic_score_codex":0.004691765,"about_ca_topic_score_gemma":0.0031232906,"teacher_disagreement_score":0.010892336,"about_ca_system_score_codex":0.0025794096,"about_ca_system_score_gemma":0.0024808282,"threshold_uncertainty_score":0.036438465},"labels":[],"label_agreement":null},{"id":"W4318332803","doi":"10.23952/jano.5.2023.1.07","title":"The stability of the parametric Cauchy problem of initial-value ordinary differential equations revisited","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"advanced mathematical theories","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Ordinary differential equation; Mathematics; Initial value problem; Cauchy problem; Stability (learning theory); Parametric statistics; Cauchy boundary condition; Applied mathematics; Mathematical analysis; Value (mathematics); Cauchy distribution; Differential equation; Computer science; Statistics; Boundary value problem","score_opus":0.036133742999719505,"score_gpt":0.326921759785901,"score_spread":0.2907880167861815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332803","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19431943,0.0019184006,0.777785,0.0023618967,0.0001426051,0.000085375636,0.00007185901,0.000097756776,0.023217753],"genre_scores_gemma":[0.9762489,0.0005528669,0.018401153,0.00009879647,0.000092126116,0.00008060157,0.000036818914,0.00003856625,0.0044500595],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994135,0.00023816184,0.00002839096,0.00008677788,0.00018129892,0.00005192449],"domain_scores_gemma":[0.99865353,0.0007963907,0.00016433322,0.00007751123,0.0002434666,0.00006477151],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017500353,0.0005949416,0.00056982774,0.00071604847,0.0006206095,0.0015152841,0.0008431074,0.0011019931,0.0010426745],"category_scores_gemma":[0.0058268304,0.00025609578,0.0006368883,0.0003523029,0.003151754,0.0015565308,0.0019611537,0.0011771125,0.00012510599],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010204581,0.00003317568,0.0018026901,0.00021511856,0.000060114082,0.00047800795,0.00069768704,0.306807,0.014667896,0.65957403,0.00061458093,0.014947694],"study_design_scores_gemma":[0.000008642049,0.000053429587,0.00039263486,0.000034070974,0.000007650723,0.0001410352,0.00010637382,0.87863225,0.0022492714,0.11729634,0.001058486,0.000019767534],"about_ca_topic_score_codex":0.0014061347,"about_ca_topic_score_gemma":0.00037916598,"teacher_disagreement_score":0.0017500353,"about_ca_system_score_codex":0.0007675805,"about_ca_system_score_gemma":0.00069531426,"threshold_uncertainty_score":0.009255171},"labels":[],"label_agreement":null},{"id":"W4318332805","doi":"10.23952/jano.5.2023.1.09","title":"On the lower semicontinuity and subdifferentiability of the value function for conic linear programming problems","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conic section; Mathematics; Linear programming; Value (mathematics); Mathematical optimization; Function (biology); Bellman equation; Applied mathematics; Geometry; Statistics","score_opus":0.010704904426451695,"score_gpt":0.22028324289249643,"score_spread":0.20957833846604473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1224315,0.0057727955,0.8201489,0.004493774,0.00024800026,0.00012978054,0.0005316447,0.000115677154,0.046127915],"genre_scores_gemma":[0.85921836,0.005435952,0.117860034,0.0012239324,0.00045177614,0.00042783664,0.0011905384,0.0003721334,0.013819419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99696296,0.0016072871,0.00017353462,0.000491156,0.0005388471,0.00022621788],"domain_scores_gemma":[0.9781231,0.017725967,0.00078194967,0.0009528527,0.0016837924,0.00073225755],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0088978205,0.00129282,0.0016652588,0.0021528362,0.0010420732,0.0033713966,0.0016086226,0.0014653312,0.0031596932],"category_scores_gemma":[0.032035436,0.0008867655,0.0014559889,0.0016593839,0.0059928293,0.005689021,0.00422014,0.0071050553,0.00037429322],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017771931,0.0000615046,0.0010163592,0.0002651798,0.000036237125,0.0001764029,0.00039656376,0.04116116,0.0020782824,0.9359232,0.0022737207,0.016433662],"study_design_scores_gemma":[0.000020377642,0.00009662613,0.00066975947,0.00012286151,0.000012422864,0.0001279046,0.00009416408,0.23290853,0.0011453994,0.7623264,0.0024508515,0.000024736413],"about_ca_topic_score_codex":0.0019910566,"about_ca_topic_score_gemma":0.0010662067,"teacher_disagreement_score":0.0088978205,"about_ca_system_score_codex":0.0019210852,"about_ca_system_score_gemma":0.0017397652,"threshold_uncertainty_score":0.047056794},"labels":[],"label_agreement":null},{"id":"W4318332820","doi":"10.23952/jano.5.2023.1.08","title":"The fixed point property of quasi-point-separable topological vector spaces","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Fixed Point Theorems Analysis","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Property (philosophy); Separable space; Fixed-point property; Mathematics; Topology (electrical circuits); Locally convex topological vector space; Point (geometry); Pure mathematics; Topological vector space; Topological space; Mathematical analysis; Fixed-point theorem; Combinatorics; Geometry","score_opus":0.020576011121491482,"score_gpt":0.26948495407908635,"score_spread":0.24890894295759486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14941771,0.0008495819,0.8351281,0.00045739926,0.00011125704,0.000046678528,0.00020632197,0.0001477963,0.013635099],"genre_scores_gemma":[0.9217116,0.00087200204,0.066981,0.00011642782,0.00015834364,0.00011316654,0.00034856674,0.00009320358,0.00960569],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994747,0.00012178989,0.000026786724,0.0001111581,0.00019781764,0.000067733876],"domain_scores_gemma":[0.9988438,0.0003296538,0.00018926794,0.0001383671,0.00034718603,0.00015165684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010541225,0.00062525074,0.00054445455,0.0012748113,0.00070687226,0.0012718666,0.00065605296,0.00050141127,0.0035477525],"category_scores_gemma":[0.0029205296,0.00022255741,0.00058068254,0.00070889044,0.002192948,0.0031414842,0.0014866904,0.0012657716,0.00045101947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040554423,0.000012701425,0.00050453324,0.00008195844,0.000023673194,0.00012901708,0.00017964937,0.0070323474,0.005371487,0.97732306,0.00048379743,0.008817361],"study_design_scores_gemma":[0.000027662822,0.00022447728,0.0014055315,0.000042191026,0.00003167233,0.00050603715,0.00025509828,0.13671358,0.0060571656,0.8421176,0.012577615,0.00004136614],"about_ca_topic_score_codex":0.0008730095,"about_ca_topic_score_gemma":0.00046564033,"teacher_disagreement_score":0.0035477525,"about_ca_system_score_codex":0.0006509921,"about_ca_system_score_gemma":0.0004840712,"threshold_uncertainty_score":0.011868417},"labels":[],"label_agreement":null},{"id":"W4318332826","doi":"10.23952/jano.5.2023.1.01","title":"“International Conference on Variational Analysis and Nonsmooth Optimization” In honor of the 65th birthday of Christiane Tammer (Martin Luther University Halle-Wittenberg)","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Engineering and Materials Science Studies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Honor; Philosophy; Classics; History; Computer science","score_opus":0.006717495644501184,"score_gpt":0.18897396985426573,"score_spread":0.18225647420976454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332826","genre_codex":"editorial","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0039563444,0.10929006,0.18113457,0.052700877,0.5078265,0.00021345961,0.0016706618,0.0007545345,0.14245297],"genre_scores_gemma":[0.072005264,0.076313145,0.093539804,0.015033184,0.28103885,0.0007860478,0.004219228,0.003814471,0.45325002],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99709177,0.0008325917,0.00014489981,0.00071212015,0.0009223239,0.00029618086],"domain_scores_gemma":[0.998059,0.00051034155,0.00007952393,0.0001948683,0.00067601976,0.00048027953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044621946,0.002329567,0.0021433646,0.0016459525,0.0010329885,0.004377153,0.0017194542,0.0024008467,0.020991683],"category_scores_gemma":[0.005434088,0.00061540323,0.001977757,0.0013004341,0.0018256101,0.002286875,0.0028504163,0.0062759575,0.0088012945],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010844826,0.000053829277,0.00012280936,0.000302478,0.0001056857,0.000080707505,0.00006759905,0.0028302495,0.0014307753,0.08356514,0.83624303,0.07508921],"study_design_scores_gemma":[0.00004319391,0.00011450756,0.0007958215,0.00027735802,0.000047281417,0.0001809206,0.000034383895,0.010646252,0.0016099163,0.054534066,0.93166476,0.00005159655],"about_ca_topic_score_codex":0.001852987,"about_ca_topic_score_gemma":0.0017791154,"teacher_disagreement_score":0.020991683,"about_ca_system_score_codex":0.0022818965,"about_ca_system_score_gemma":0.0026212528,"threshold_uncertainty_score":0.070224166},"labels":[],"label_agreement":null},{"id":"W4318332836","doi":"10.23952/jano.5.2023.1.06","title":"On nonsmooth multiobjective semi-infinite programming with switching constraints","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Mathematics; Multiobjective programming; Semi-infinite programming; Multi-objective optimization; Computer science; Geometry","score_opus":0.007485384557642302,"score_gpt":0.22649303926863382,"score_spread":0.2190076547109915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023788916,0.0006828239,0.9588917,0.0005895093,0.00013074234,0.00010589837,0.000116906216,0.00007170925,0.015621836],"genre_scores_gemma":[0.68925875,0.0016292532,0.28060466,0.0007148319,0.00029605147,0.00087290927,0.0004909691,0.00046704357,0.025665533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987081,0.0007513332,0.000050791343,0.00015587827,0.00023135796,0.00010253375],"domain_scores_gemma":[0.99352163,0.005354517,0.0003275741,0.00012786336,0.00041978693,0.00024867035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035474675,0.0019325662,0.0023462432,0.0012583559,0.00070872356,0.0025571613,0.0018439586,0.002619625,0.0045241066],"category_scores_gemma":[0.008492319,0.0013548016,0.0014513439,0.001258474,0.0024249917,0.0020355657,0.0033990443,0.0027304578,0.0003856027],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009841335,0.00013003143,0.0003677598,0.00027781815,0.00008750944,0.00016722277,0.00012477566,0.87741446,0.0014804016,0.10428321,0.0014862503,0.014082148],"study_design_scores_gemma":[0.0000064383917,0.00003562377,0.00005634223,0.00001928579,0.0000070490914,0.000014005056,0.000013703769,0.9768519,0.00012335085,0.022532338,0.0003337863,0.0000061877913],"about_ca_topic_score_codex":0.0032365937,"about_ca_topic_score_gemma":0.0023649943,"teacher_disagreement_score":0.0045241066,"about_ca_system_score_codex":0.0013712837,"about_ca_system_score_gemma":0.0015105229,"threshold_uncertainty_score":0.018761039},"labels":[],"label_agreement":null},{"id":"W4318332838","doi":"10.23952/jano.5.2023.1.04","title":"Cone enlargements and applications to vector optimization","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii; Ministerul Cercetării, Inovării şi Digitalizării","keywords":"Cone (formal languages); Vector (molecular biology); Computer science; Biology; Algorithm; Recombinant DNA; Genetics","score_opus":0.010940995224264113,"score_gpt":0.24648181870624686,"score_spread":0.23554082348198274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13342862,0.0030910852,0.78623885,0.0010270384,0.0002172372,0.00006800281,0.00010874127,0.00030519644,0.07551524],"genre_scores_gemma":[0.88545495,0.0022013886,0.1014074,0.0002334701,0.0003016806,0.00009142018,0.00011338334,0.000111533125,0.010084735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994104,0.00024715572,0.000026576608,0.00007440257,0.00018120692,0.00006026292],"domain_scores_gemma":[0.998264,0.00096165476,0.00019787201,0.00011527152,0.0002730144,0.00018824085],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013024911,0.0005237712,0.0003825019,0.0007950167,0.0005992096,0.00096441986,0.00035800022,0.00038871294,0.0028327736],"category_scores_gemma":[0.00352446,0.00018762221,0.0006339916,0.00058109744,0.002191883,0.0016302554,0.0014628537,0.001302689,0.00024609015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020658594,0.000017234055,0.00034837515,0.000050272603,0.0000053134595,0.00014675809,0.00025495232,0.013714458,0.0043504373,0.9678045,0.0007560005,0.012531171],"study_design_scores_gemma":[0.0000144356345,0.00015082295,0.0009963005,0.000058671874,0.000009910071,0.00042286215,0.000314774,0.18060176,0.0041166455,0.80085593,0.012424965,0.00003289104],"about_ca_topic_score_codex":0.0009184574,"about_ca_topic_score_gemma":0.0006756181,"teacher_disagreement_score":0.0028327736,"about_ca_system_score_codex":0.0004931262,"about_ca_system_score_gemma":0.000292879,"threshold_uncertainty_score":0.0094765425},"labels":[],"label_agreement":null},{"id":"W4318332842","doi":"10.23952/jano.5.2023.1.05","title":"Convexity and continuity of specific set-valued maps and their extremal value functions","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Convexity; Mathematics; Set (abstract data type); Value (mathematics); Combinatorics; Applied mathematics; Statistics; Computer science; Economics; Financial economics","score_opus":0.01607627434821768,"score_gpt":0.22365710738346953,"score_spread":0.20758083303525185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13711837,0.002425823,0.8330597,0.0012208016,0.00010099747,0.00009327636,0.00032176278,0.00011467411,0.025544638],"genre_scores_gemma":[0.89043486,0.0023121429,0.10057046,0.00017674798,0.00019134211,0.00024762595,0.00032753154,0.00017243855,0.0055666766],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987055,0.0004460691,0.000072257884,0.00028791375,0.0003373298,0.00015093581],"domain_scores_gemma":[0.99441975,0.0035435893,0.00061226886,0.00030796474,0.0007735037,0.0003429231],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033090257,0.00091501896,0.0011839032,0.0022862158,0.0008997696,0.0036453337,0.001146723,0.0013427193,0.0021778054],"category_scores_gemma":[0.013362025,0.0005927512,0.0011678654,0.0013036366,0.0033311946,0.005047667,0.0019270842,0.0027404947,0.0002976768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055217446,0.00004051431,0.0011513793,0.00022616664,0.00006360588,0.0003358261,0.00027316235,0.044645116,0.0035807753,0.9335473,0.00096597243,0.015114877],"study_design_scores_gemma":[0.00001182841,0.000065670254,0.001677735,0.00011680704,0.000034147542,0.00047885947,0.0002010079,0.24639635,0.0031164337,0.7443702,0.003489924,0.000041079646],"about_ca_topic_score_codex":0.0005039121,"about_ca_topic_score_gemma":0.00033216635,"teacher_disagreement_score":0.0036453337,"about_ca_system_score_codex":0.0015445357,"about_ca_system_score_gemma":0.00072020525,"threshold_uncertainty_score":0.017500043},"labels":[],"label_agreement":null},{"id":"W4318332844","doi":"10.23952/jano.5.2023.1.12","title":"Fenchel subdifferential operators: A characterization without cyclic monotonicity","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Holomorphic and Operator Theory","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministerio de Economía y Competitividad","keywords":"Subderivative; Characterization (materials science); Monotonic function; Mathematics; Pure mathematics; Mathematical economics; Mathematical analysis; Materials science; Regular polygon; Geometry; Convex optimization; Nanotechnology","score_opus":0.020421696771224032,"score_gpt":0.27305985593251186,"score_spread":0.25263815916128785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332844","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4089976,0.0015037492,0.55943716,0.0008736308,0.000118988006,0.00008013688,0.0002485973,0.000095266594,0.028644912],"genre_scores_gemma":[0.94302857,0.0006607799,0.049626417,0.0002990628,0.00019511866,0.000094811796,0.00015302715,0.00004786347,0.0058942344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993568,0.00015286854,0.000042848616,0.00015098427,0.00021628737,0.00008011194],"domain_scores_gemma":[0.9983193,0.0005640407,0.00023517478,0.00022411128,0.0004604896,0.00019688735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015871942,0.0005517535,0.00045291343,0.0012096041,0.00039260768,0.0009836059,0.00057409576,0.0005940616,0.0014419408],"category_scores_gemma":[0.0029524488,0.00017156157,0.00054729875,0.00056021794,0.002162828,0.0025417614,0.001345679,0.0014879878,0.00017253077],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044913955,0.000020149271,0.0011262986,0.000059151105,0.000013114221,0.00015014758,0.000262819,0.004075143,0.012335301,0.9634902,0.0007726061,0.017650336],"study_design_scores_gemma":[0.0000142818435,0.00012930107,0.0018140618,0.000037965136,0.0000145932245,0.00078394375,0.00021772404,0.1053202,0.0071513364,0.8750561,0.009418672,0.00004178412],"about_ca_topic_score_codex":0.00039396674,"about_ca_topic_score_gemma":0.0002451221,"teacher_disagreement_score":0.0015871942,"about_ca_system_score_codex":0.0005436839,"about_ca_system_score_gemma":0.0006147941,"threshold_uncertainty_score":0.008394003},"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical economics; Mathematics; Philosophy; Computer science","score_opus":0.016261603905689356,"score_gpt":0.22876484247341658,"score_spread":0.21250323856772724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332875","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011487758,0.000761549,0.9568574,0.00071027986,0.000109402485,0.00003802523,0.000079400874,0.00005241115,0.02990383],"genre_scores_gemma":[0.52311057,0.0034861828,0.42995512,0.0010740866,0.0008880127,0.00032775808,0.0003260318,0.00023224478,0.040600043],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992606,0.00030640038,0.00004502731,0.00011941972,0.00021206032,0.000056504698],"domain_scores_gemma":[0.9992918,0.00027611727,0.00006859776,0.00009365477,0.00020764791,0.00006211681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019687507,0.00090845546,0.0006432174,0.0017237196,0.00097133324,0.0015528988,0.001179438,0.0008125513,0.0036491407],"category_scores_gemma":[0.0021348952,0.00034131994,0.00093105744,0.001325427,0.0023972518,0.004017083,0.0017650744,0.002776034,0.0005150933],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000028199413,0.000003887279,0.00003692857,0.000013961059,0.0000021788594,0.000017648163,0.000055580967,0.0021488294,0.00038733854,0.99401444,0.0002719484,0.0030443694],"study_design_scores_gemma":[0.000004262707,0.00003072397,0.000081122846,0.00002276795,0.0000071220447,0.00007280215,0.00008668594,0.032863148,0.00059761415,0.9575909,0.008629592,0.000013260331],"about_ca_topic_score_codex":0.0009030505,"about_ca_topic_score_gemma":0.0008620527,"teacher_disagreement_score":0.0036491407,"about_ca_system_score_codex":0.0012490281,"about_ca_system_score_gemma":0.0009399676,"threshold_uncertainty_score":0.012207627},"labels":[],"label_agreement":null},{"id":"W4318332884","doi":"10.23952/jano.5.2023.1.11","title":"Some topological properties of solution sets in partially ordered set optimization","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Set (abstract data type); Mathematics; Topology (electrical circuits); Solution set; Pure mathematics; Computer science; Combinatorics","score_opus":0.042646845383208565,"score_gpt":0.28389829597127375,"score_spread":0.24125145058806519,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332884","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3904104,0.0010099537,0.5888248,0.0010254903,0.000040965508,0.0000907215,0.00022161884,0.00011399576,0.018262109],"genre_scores_gemma":[0.93708396,0.000779304,0.058165397,0.00008536346,0.000060041915,0.0001363051,0.00028825618,0.00006729309,0.0033340387],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.999298,0.0003072464,0.000043626038,0.00011056947,0.00019270954,0.00004780484],"domain_scores_gemma":[0.9956377,0.0027731408,0.0005510112,0.00020195886,0.00055785663,0.00027839906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018415949,0.0005065997,0.0005437663,0.0030275225,0.0009046014,0.0022284396,0.0007441665,0.0008154549,0.0023055782],"category_scores_gemma":[0.008182997,0.000478001,0.00070014846,0.0014751969,0.0026452143,0.0038063324,0.0014723984,0.0014346493,0.00016944516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053022544,0.00003140421,0.0012707365,0.00011034092,0.000032717282,0.00012453603,0.00038416949,0.06622549,0.00352484,0.9169028,0.00046637724,0.01087365],"study_design_scores_gemma":[0.000020655942,0.0001105934,0.0014145807,0.000064958294,0.000030519266,0.00018011821,0.00034388114,0.413314,0.0033961805,0.578244,0.0028510843,0.00002947157],"about_ca_topic_score_codex":0.0006235422,"about_ca_topic_score_gemma":0.00043979453,"teacher_disagreement_score":0.0030275225,"about_ca_system_score_codex":0.0011301581,"about_ca_system_score_gemma":0.00042177868,"threshold_uncertainty_score":0.009739399},"labels":[],"label_agreement":null},{"id":"W4318332889","doi":"10.23952/jano.5.2023.1.03","title":"Subdifferential calculus for ordered multifunctions with applications to set-valued optimization","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subderivative; Mathematics; Calculus (dental); Set (abstract data type); Pure mathematics; Mathematical optimization; Applied mathematics; Algebra over a field; Computer science; Regular polygon; Geometry; Convex optimization; Medicine","score_opus":0.016155330983677545,"score_gpt":0.25938858929646325,"score_spread":0.2432332583127857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332889","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014841452,0.001384817,0.9761872,0.00029592004,0.00009032216,0.000037068243,0.000049679722,0.000027673404,0.007085939],"genre_scores_gemma":[0.45730114,0.003762325,0.5226295,0.0003533043,0.00039485237,0.00026744118,0.00015738694,0.00013844279,0.014995616],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990042,0.0003506153,0.00008303118,0.0001269002,0.00038107275,0.000054225988],"domain_scores_gemma":[0.9984048,0.0009187263,0.00010644567,0.00012447512,0.00031750512,0.00012812387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003336804,0.00071316847,0.0009399864,0.0015670155,0.000700394,0.0015324828,0.00066934567,0.000587143,0.0017793485],"category_scores_gemma":[0.004057491,0.00033083992,0.001417431,0.0010232842,0.002017671,0.0022561967,0.0020969224,0.0026374576,0.0002518441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008468971,0.000016050864,0.00015055553,0.000061558065,0.000016914204,0.000066749635,0.00012208402,0.012733465,0.0020304052,0.97561395,0.00026522359,0.008914499],"study_design_scores_gemma":[0.000009431615,0.000048002137,0.0002163299,0.000035403402,0.000015648424,0.000107437845,0.00004959764,0.1445119,0.0011365514,0.84811,0.0057447637,0.000014810233],"about_ca_topic_score_codex":0.0007203059,"about_ca_topic_score_gemma":0.0007543047,"teacher_disagreement_score":0.003336804,"about_ca_system_score_codex":0.0011837713,"about_ca_system_score_gemma":0.0009549277,"threshold_uncertainty_score":0.017646909},"labels":[],"label_agreement":null},{"id":"W4384574966","doi":"10.23952/jano.5.2023.2.06","title":"Iterative solutions of split fixed point and monotone inclusion problems in Hilbert spaces","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation","keywords":"Fixed point; Lipschitz continuity; Monotone polygon; Mathematics; Hilbert space; Spectral radius; Convergence (economics); Strongly monotone; Fixed-point theorem; Operator (biology); Applied mathematics; Iterative method; Computation; Bounded function; Discrete mathematics; Pure mathematics; Mathematical optimization; Mathematical analysis; Algorithm","score_opus":0.011545052402500398,"score_gpt":0.22943313813430838,"score_spread":0.21788808573180798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384574966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01966549,0.00018552458,0.9782009,0.00012531415,0.000024251312,0.000039825874,0.000009807999,0.000028813542,0.0017200538],"genre_scores_gemma":[0.45924544,0.00044979402,0.533088,0.00010804893,0.00008022052,0.00046382693,0.00008553057,0.0000874744,0.00639168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989485,0.0004719463,0.000051284915,0.00014108444,0.00031192362,0.00007529248],"domain_scores_gemma":[0.9979006,0.0014168917,0.00017577432,0.00009690781,0.00029220426,0.00011760428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030863918,0.0011963386,0.0009325271,0.0009485404,0.00050819333,0.0009377474,0.0014331677,0.0018579644,0.0016559473],"category_scores_gemma":[0.0074192053,0.00045696145,0.0013474636,0.00054770557,0.0024653277,0.0019311071,0.00334555,0.0018457981,0.00026256155],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013946685,0.000090990434,0.0009660038,0.00047804558,0.00014884416,0.00033779396,0.00070142414,0.4291086,0.016140094,0.4951398,0.00091607234,0.055832785],"study_design_scores_gemma":[0.000012792742,0.00006596255,0.000080918726,0.000021732858,0.000007629169,0.000060793576,0.000051585244,0.94386685,0.002453622,0.05264856,0.00072096154,0.000008697276],"about_ca_topic_score_codex":0.0009877336,"about_ca_topic_score_gemma":0.00093341916,"teacher_disagreement_score":0.0030863918,"about_ca_system_score_codex":0.0008269811,"about_ca_system_score_gemma":0.0012538581,"threshold_uncertainty_score":0.016322553},"labels":[],"label_agreement":null},{"id":"W4384574973","doi":"10.23952/jano.5.2023.2.07","title":"A note on the subdifferential of convex multi-composite functionals","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subderivative; Minimax; Mathematics; Regular polygon; Constraint (computer-aided design); Composite number; Convex analysis; Convex function; Mathematical optimization; Applied mathematics; Pure mathematics; Convex optimization; Geometry; Algorithm","score_opus":0.016859116991125394,"score_gpt":0.24352579363967303,"score_spread":0.22666667664854764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384574973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009098706,0.0017729158,0.9683658,0.0011655265,0.00043363514,0.00003744064,0.00008438562,0.000054690223,0.018986866],"genre_scores_gemma":[0.42625225,0.006402415,0.5332585,0.0018009844,0.0018871273,0.0002250362,0.00029872477,0.00069848594,0.02917662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99831605,0.0005615262,0.00011003111,0.00028289863,0.0006394827,0.00009000206],"domain_scores_gemma":[0.9951981,0.0031689745,0.00022294937,0.0005234416,0.0006550215,0.00023159067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005593568,0.0009636103,0.0009612591,0.0015367519,0.0008780813,0.0017028538,0.0012584386,0.0013106881,0.0036366517],"category_scores_gemma":[0.011157348,0.00060728425,0.0017136763,0.0012792996,0.0037507801,0.0049047633,0.0029458615,0.0070233354,0.0007006473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020170073,0.000011153248,0.00018161292,0.00007995073,0.000010598183,0.00014185812,0.00012921465,0.0060247397,0.0024149711,0.97873104,0.0017210023,0.010533583],"study_design_scores_gemma":[0.000012082071,0.00011306156,0.0004939546,0.000071629416,0.000018964127,0.00040328127,0.000057065216,0.096073575,0.0028119306,0.86968035,0.030223925,0.000040115945],"about_ca_topic_score_codex":0.0011772958,"about_ca_topic_score_gemma":0.0010307545,"teacher_disagreement_score":0.005593568,"about_ca_system_score_codex":0.001088514,"about_ca_system_score_gemma":0.0009558303,"threshold_uncertainty_score":0.029581964},"labels":[],"label_agreement":null},{"id":"W4384574988","doi":"10.23952/jano.5.2023.2.01","title":"Multi-step actor-critic framework for reinforcement learning in continuous control","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Reinforcement learning; Temporal difference learning; Computer science; Sequence (biology); State (computer science); Control (management); Artificial intelligence; Reinforcement; Optimal control; Action (physics); Machine learning; Mathematical optimization; Mathematics; Algorithm; Engineering","score_opus":0.015598831028528763,"score_gpt":0.2672656284476811,"score_spread":0.2516667974191523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384574988","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030507613,0.00066689425,0.99311125,0.00021385754,0.000079565725,0.0000269366,0.000028151188,0.0002326914,0.0025898365],"genre_scores_gemma":[0.82188034,0.0010932004,0.1685811,0.00023267636,0.00015309795,0.00036046348,0.00012727416,0.000099018995,0.007472818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99945134,0.00016912683,0.000030083667,0.00012724938,0.00016238264,0.000059810773],"domain_scores_gemma":[0.9993895,0.00031306586,0.00006114058,0.000037451664,0.00015479907,0.00004400738],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011183945,0.0012314921,0.0011702011,0.00036136314,0.0003628323,0.00090340414,0.0015009579,0.001165717,0.0025497116],"category_scores_gemma":[0.0018146867,0.00042954943,0.000686593,0.000401429,0.0010300115,0.0007632414,0.000780482,0.0021980978,0.0003372139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034726785,0.00002290324,0.00022473931,0.0000887922,0.00003231914,0.0000758811,0.000035844994,0.9522182,0.0008950193,0.029983897,0.00082104444,0.015566643],"study_design_scores_gemma":[0.000005521719,0.000009964481,0.000020885822,0.000003075352,0.0000033057895,0.0000045401625,0.0000013068985,0.9966523,0.00010322637,0.0028458731,0.00034757314,0.000002501803],"about_ca_topic_score_codex":0.009158794,"about_ca_topic_score_gemma":0.0065578627,"teacher_disagreement_score":0.009158794,"about_ca_system_score_codex":0.0011683772,"about_ca_system_score_gemma":0.0016926618,"threshold_uncertainty_score":0.018210948},"labels":[],"label_agreement":null},{"id":"W4384574990","doi":"10.23952/jano.5.2023.2.05","title":"The boosted proximal difference-of-convex algorithm","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Convex function; Proximal Gradient Methods; Lipschitz continuity; Sequence (biology); Convex optimization; Limit point; Convexity; Monotonic function; Function (biology); Logarithmically convex function; Rate of convergence; Regular polygon; Algorithm; Applied mathematics; Combinatorics; Subderivative; Mathematical optimization; Mathematical analysis; Computer science; Geometry","score_opus":0.00873160697592923,"score_gpt":0.20934418763918147,"score_spread":0.20061258066325224,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384574990","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017526788,0.00014592387,0.99696594,0.000089796806,0.00004512017,0.000025275653,0.000015346872,0.00013121375,0.0008287331],"genre_scores_gemma":[0.21295905,0.0004900642,0.7787882,0.00032322918,0.00014604337,0.0002922432,0.00023156314,0.00017033183,0.0065992726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989324,0.0003203428,0.000046799723,0.0001720652,0.00042617752,0.00010215353],"domain_scores_gemma":[0.9989905,0.00044296056,0.000060815048,0.00009863841,0.0003376182,0.000069420516],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017527161,0.0008839769,0.0018139939,0.0006525643,0.00043454146,0.0010552694,0.002299318,0.0015592129,0.0029573757],"category_scores_gemma":[0.0034589171,0.00059609895,0.0008780801,0.0008227391,0.0010192513,0.0014051361,0.002024258,0.0023627789,0.0012086504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022135927,0.00008539997,0.0006534559,0.00027135786,0.0000815113,0.00015046766,0.00012765228,0.7787632,0.004753095,0.04763183,0.0048286873,0.16243201],"study_design_scores_gemma":[0.0000143283105,0.000033272347,0.000028473081,0.000006238401,0.000004471879,0.000030446094,0.000004577839,0.9939051,0.00071578455,0.004138185,0.0011127965,0.0000062993154],"about_ca_topic_score_codex":0.0023855155,"about_ca_topic_score_gemma":0.0014967012,"teacher_disagreement_score":0.0029573757,"about_ca_system_score_codex":0.00076071447,"about_ca_system_score_gemma":0.0017522316,"threshold_uncertainty_score":0.009893417},"labels":[],"label_agreement":null},{"id":"W4384574993","doi":"10.23952/jano.5.2023.2.03","title":"Existence and stability to vector optimization problems via improvement sets","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Bộ Giáo dục và Ðào tạo","keywords":"Vector optimization; Optimization problem; Mathematical optimization; Stability (learning theory); Mathematics; Parametric statistics; Continuous optimization; Computer science; Applied mathematics; Multi-swarm optimization","score_opus":0.014264775075372974,"score_gpt":0.23458838648716213,"score_spread":0.22032361141178916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384574993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0372632,0.00084304623,0.9534141,0.00048400857,0.000040518466,0.00006248183,0.00003323455,0.00007105158,0.0077884537],"genre_scores_gemma":[0.79981905,0.0018957737,0.18553387,0.00022013098,0.0001822642,0.0004418618,0.00018625046,0.00017329767,0.011547417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839103,0.0008118141,0.00007117473,0.00026157204,0.0003484999,0.00011590972],"domain_scores_gemma":[0.99568534,0.0029721942,0.00041521713,0.00015970747,0.00061588374,0.00015167016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004013534,0.0013301794,0.0010800837,0.0013285683,0.00078512594,0.0019285062,0.0010792732,0.0013482396,0.0028622604],"category_scores_gemma":[0.010724766,0.00059453124,0.001122663,0.00085590105,0.0025873112,0.0029291916,0.0031774412,0.002503699,0.0004051516],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090669426,0.00006035671,0.0006330507,0.00026856677,0.00006711621,0.000113242684,0.00043364838,0.18020098,0.006822429,0.7866252,0.0008338902,0.023850858],"study_design_scores_gemma":[0.000015833544,0.00012792916,0.00020770241,0.00004192518,0.000016729122,0.00007242426,0.00008342781,0.8460354,0.0021545656,0.14872447,0.0025006705,0.000018909346],"about_ca_topic_score_codex":0.00088735373,"about_ca_topic_score_gemma":0.00042521747,"teacher_disagreement_score":0.004013534,"about_ca_system_score_codex":0.0012017344,"about_ca_system_score_gemma":0.0010418454,"threshold_uncertainty_score":0.02122587},"labels":[],"label_agreement":null},{"id":"W4384575244","doi":"10.23952/jano.5.2023.2.04","title":"IdentifyMix: An efficient two-stage learning approach to combating label noise","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Fujian Province; National Natural Science Foundation of China","keywords":"Artificial intelligence; Computer science; Machine learning; Margin (machine learning); Noise (video); Generalization; Sample (material); Artificial neural network; Selection (genetic algorithm); Supervised learning; Process (computing); Pattern recognition (psychology); Deep learning; Stability (learning theory); Mathematics","score_opus":0.02130369396280206,"score_gpt":0.28307913250964417,"score_spread":0.2617754385468421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384575244","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005455388,0.00010133172,0.9928599,0.000083064275,0.000021877666,0.0000821759,0.000022920098,0.0010775777,0.00029568726],"genre_scores_gemma":[0.21660292,0.00018470481,0.7774922,0.00049504056,0.00011951648,0.000587551,0.00038103384,0.0005096351,0.0036273338],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975109,0.00082042546,0.00013849184,0.0005678589,0.00078237144,0.00017989437],"domain_scores_gemma":[0.9958831,0.001848516,0.0004504139,0.0007827394,0.00085843884,0.00017681687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052414415,0.0021586511,0.002224882,0.0012920051,0.0008762743,0.0014293813,0.0035058216,0.0025316495,0.0019482408],"category_scores_gemma":[0.009604688,0.0013516363,0.0014022553,0.0008789942,0.0019599856,0.0032346346,0.004782491,0.0033148793,0.0009999188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070370163,0.00049025385,0.0029016056,0.00031630867,0.00024201778,0.0001544507,0.00038593423,0.316009,0.025264012,0.013531684,0.0055462443,0.6344548],"study_design_scores_gemma":[0.000015877356,0.00013647559,0.00017555243,0.000009000846,0.0000135203645,0.000029672032,0.00001661131,0.9899767,0.004818957,0.0040099923,0.0007845723,0.000013082385],"about_ca_topic_score_codex":0.0016779086,"about_ca_topic_score_gemma":0.003265774,"teacher_disagreement_score":0.0052414415,"about_ca_system_score_codex":0.0009729596,"about_ca_system_score_gemma":0.0022065246,"threshold_uncertainty_score":0.027719736},"labels":[],"label_agreement":null},{"id":"W4384616291","doi":"10.23952/jano.5.2023.2.02","title":"Model predictive control of discrete-time linear systems by ADMM with applications to turbofan engine control problems","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities; National Natural Science Foundation of China","keywords":"Turbofan; Model predictive control; Quadratic programming; Computer science; Mathematical optimization; Quadratic equation; Control theory (sociology); Optimal control; Linear programming; Optimization problem; Control (management); Mathematics; Engineering; Artificial intelligence","score_opus":0.0038076228688520364,"score_gpt":0.19282403253471592,"score_spread":0.1890164096658639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384616291","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0042504966,0.0009782424,0.9924954,0.00024532512,0.00007235922,0.000019163743,0.000022004804,0.000094454794,0.001822501],"genre_scores_gemma":[0.7741793,0.0024212627,0.2179025,0.00022953333,0.0002625544,0.00026539378,0.0001781034,0.00006147468,0.0044999653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996476,0.00014095956,0.000020617108,0.000061122024,0.000100002304,0.000029682098],"domain_scores_gemma":[0.9992607,0.0004679192,0.000081567916,0.00003644327,0.00013251149,0.00002088054],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009686665,0.0010092153,0.0011519793,0.00043500125,0.0004195359,0.0008333903,0.0008019762,0.0012882364,0.0013683875],"category_scores_gemma":[0.0016859793,0.00041678542,0.000661834,0.00082183175,0.0007585627,0.00078879145,0.0009061944,0.0018458853,0.00017270901],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015405636,0.000012986822,0.00009864898,0.0000841923,0.00001614443,0.000043096916,0.00002902895,0.97828954,0.00043834772,0.006608922,0.00040155882,0.013962191],"study_design_scores_gemma":[0.0000024513504,0.00000789343,0.000014625941,0.0000026461194,0.0000017093595,0.000004269474,0.0000026356624,0.99838626,0.00009031596,0.001282866,0.00020281132,0.0000014668425],"about_ca_topic_score_codex":0.0054174494,"about_ca_topic_score_gemma":0.0030836307,"teacher_disagreement_score":0.0054174494,"about_ca_system_score_codex":0.00047162684,"about_ca_system_score_gemma":0.0009611392,"threshold_uncertainty_score":0.010771811},"labels":[],"label_agreement":null},{"id":"W4392403993","doi":"10.23952/jano.6.2024.1.05","title":"Solving split feasibility problems via block-wise formulation","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Block (permutation group theory); Computer science; Mathematical optimization; Mathematics; Algorithm; Applied mathematics; Combinatorics","score_opus":0.016677210267237914,"score_gpt":0.22377003270311324,"score_spread":0.20709282243587532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392403993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021199784,0.000065946224,0.9966487,0.00006562445,0.000012458778,0.00002339249,0.000026768977,0.000043794043,0.0009933279],"genre_scores_gemma":[0.12941942,0.00043174307,0.86524534,0.00012267826,0.00006589976,0.00049989065,0.00026162676,0.00018859352,0.0037648515],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934834,0.0002721411,0.000027325555,0.00011277465,0.00016916342,0.00007028618],"domain_scores_gemma":[0.9985696,0.000979578,0.000099147335,0.00009846925,0.00019882838,0.00005442497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016498639,0.0011400497,0.0012866313,0.0005846432,0.00038027915,0.0011286552,0.0010128388,0.0013479134,0.0048573203],"category_scores_gemma":[0.0034894298,0.00078217883,0.0009660287,0.00075701764,0.0010431713,0.0018370139,0.001795402,0.0021290155,0.0009130416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006215025,0.0000585526,0.00036968917,0.00023131096,0.000040986535,0.000114403854,0.0000867728,0.84409887,0.0041473215,0.10737859,0.0028331326,0.04057826],"study_design_scores_gemma":[0.0000079520905,0.000019973126,0.000027310052,0.0000067272154,0.0000037216394,0.000013884467,0.000008752908,0.98439723,0.00043061838,0.014256662,0.00082317414,0.000003894821],"about_ca_topic_score_codex":0.002200534,"about_ca_topic_score_gemma":0.0023753028,"teacher_disagreement_score":0.0048573203,"about_ca_system_score_codex":0.00057823036,"about_ca_system_score_gemma":0.0015577852,"threshold_uncertainty_score":0.016249418},"labels":[],"label_agreement":null},{"id":"W4392403996","doi":"10.23952/jano.6.2024.1.03","title":"Numerical computation of entropy-regularized quadratic optimization problems","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Computation; Quadratic equation; Applied mathematics; Mathematics; Entropy (arrow of time); Mathematical optimization; Computer science; Algorithm; Physics; Geometry; Thermodynamics","score_opus":0.007662265125497311,"score_gpt":0.2274391926198778,"score_spread":0.2197769274943805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392403996","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09147475,0.00050437,0.9005963,0.00060902,0.00013581682,0.00007371961,0.00012504875,0.0004304189,0.0060506025],"genre_scores_gemma":[0.7470673,0.00021120916,0.24893075,0.000094196526,0.000055524677,0.00022524604,0.00024718323,0.00014500365,0.003023548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99960655,0.0001766588,0.000019213445,0.000043605643,0.00011603136,0.000037998754],"domain_scores_gemma":[0.99826694,0.001079895,0.00014819081,0.00010819313,0.00029187085,0.00010486908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013126463,0.0005756851,0.0010347451,0.00048761122,0.00047177478,0.0008073097,0.00088875246,0.0012315992,0.002335656],"category_scores_gemma":[0.005161834,0.00035879322,0.0003765266,0.0004944887,0.0009236641,0.0009162901,0.0011536272,0.0010912518,0.00031759447],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007234697,0.000025777294,0.00037172282,0.00006463992,0.00001557329,0.00006159344,0.000032928594,0.97663635,0.0013887451,0.013405576,0.0005257758,0.007398914],"study_design_scores_gemma":[0.0000050792783,0.0000045684806,0.000025089434,0.0000016213879,7.5212876e-7,0.000002729458,0.0000019223287,0.9987226,0.00012003771,0.0010341929,0.00008017708,0.0000011538201],"about_ca_topic_score_codex":0.0042420044,"about_ca_topic_score_gemma":0.0037913043,"teacher_disagreement_score":0.0042420044,"about_ca_system_score_codex":0.0006774182,"about_ca_system_score_gemma":0.0012843973,"threshold_uncertainty_score":0.008434653},"labels":[],"label_agreement":null},{"id":"W4392404031","doi":"10.23952/jano.6.2024.1.07","title":"On the linear convergence rate of generalized ADMM for convex composite programming","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Henan Province; National Natural Science Foundation of China","keywords":"Convergence (economics); Rate of convergence; Mathematics; Composite number; Regular polygon; Mathematical optimization; Applied mathematics; Linear programming; Computer science; Algorithm; Economics; Geometry","score_opus":0.013037206758040057,"score_gpt":0.2509826683118481,"score_spread":0.23794546155380808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392404031","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011000451,0.0067859283,0.9652756,0.0016891077,0.00026663573,0.000082214574,0.000098307544,0.00030535902,0.014496458],"genre_scores_gemma":[0.4515147,0.01207099,0.51500416,0.0019227428,0.0012337039,0.00092921435,0.000566802,0.0010326765,0.01572505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99445796,0.0032456082,0.00018514694,0.0005475517,0.0012125552,0.0003511284],"domain_scores_gemma":[0.9726293,0.022199145,0.00084840733,0.0012573624,0.0026598484,0.00040598417],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018510275,0.0025370473,0.0014165113,0.0020374884,0.0008852645,0.0018667653,0.002202454,0.0020055987,0.00436453],"category_scores_gemma":[0.047505967,0.00083864806,0.001742656,0.0015026904,0.0046464773,0.004405744,0.004176737,0.007846321,0.0011961352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006577002,0.00012591104,0.0018919766,0.0012151345,0.00021976832,0.00044543654,0.0006372849,0.33624002,0.0072605656,0.5641035,0.00967906,0.07752373],"study_design_scores_gemma":[0.000028767037,0.00013997804,0.00023017151,0.00016060396,0.000037372298,0.00014743948,0.000060996532,0.90293497,0.0027222023,0.090119004,0.0033859573,0.000032525248],"about_ca_topic_score_codex":0.0025889322,"about_ca_topic_score_gemma":0.0015553819,"teacher_disagreement_score":0.018510275,"about_ca_system_score_codex":0.0020100637,"about_ca_system_score_gemma":0.0015342933,"threshold_uncertainty_score":0.09789282},"labels":[],"label_agreement":null},{"id":"W4392404087","doi":"10.23952/jano.6.2024.1.06","title":"An accelerated regularization method for variational inclusions","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Topology Optimization in Engineering","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Quỹ Đổi mới sáng tạo Vingroup; Trường Đại học Giao thông vận tải; Tập đoàn Vingroup - Công ty CP","keywords":"Regularization (linguistics); Applied mathematics; Mathematics; Computer science; Artificial intelligence","score_opus":0.008909858499843767,"score_gpt":0.2636508573113558,"score_spread":0.254740998811512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392404087","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0031779774,0.00010039869,0.994935,0.000077459146,0.000058411042,0.000020597732,0.000009232483,0.00005861942,0.0015623992],"genre_scores_gemma":[0.13170716,0.00041131722,0.8558632,0.00015447612,0.00017401358,0.00026022675,0.00007880964,0.00017140758,0.011179418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99945503,0.00018720255,0.000016497086,0.000065868,0.00024335893,0.000032043168],"domain_scores_gemma":[0.99972314,0.00009907612,0.000023063245,0.000030658797,0.00009278431,0.000031147927],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090173795,0.00060080603,0.0006574124,0.00057506317,0.0004085104,0.0005461164,0.000979808,0.0010016952,0.0018965283],"category_scores_gemma":[0.0011791224,0.00030567747,0.00090715283,0.00035807033,0.0008142211,0.000972248,0.0016464054,0.0014256149,0.0005107231],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013390227,0.0001273896,0.00045735063,0.00034473452,0.00009042196,0.00031487976,0.000331592,0.2798621,0.05688546,0.48942,0.0045826645,0.16744953],"study_design_scores_gemma":[0.000016728834,0.00008649321,0.00007944696,0.00001855328,0.000009900935,0.00011516133,0.000012475485,0.96026576,0.0035436722,0.025885634,0.009948716,0.000017557653],"about_ca_topic_score_codex":0.0008892789,"about_ca_topic_score_gemma":0.0009455862,"teacher_disagreement_score":0.0018965283,"about_ca_system_score_codex":0.00037220668,"about_ca_system_score_gemma":0.0010778593,"threshold_uncertainty_score":0},"labels":[],"label_agreement":null},{"id":"W4392404093","doi":"10.23952/jano.6.2024.1.04","title":"A new hybrid Halpern-based extragradient algorithm for a pseudomonotone equilibrium problem and a fixed point problem of nonexpansive mappings in Banach spaces","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Banach space; Fixed point; Mathematics; Algorithm; Point (geometry); Pure mathematics; Applied mathematics; Mathematical analysis; Geometry","score_opus":0.0063825247507114345,"score_gpt":0.22055230662088773,"score_spread":0.2141697818701763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392404093","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0046474654,0.00014224341,0.993891,0.00006593909,0.000040830837,0.000043142703,0.000010875059,0.000098516364,0.0010599633],"genre_scores_gemma":[0.25331584,0.00028750364,0.739836,0.00018195872,0.00007865093,0.0003932213,0.00013624427,0.00011498176,0.005655608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99941075,0.00019324844,0.000043300257,0.00012265415,0.00017892907,0.000051114457],"domain_scores_gemma":[0.9995983,0.00015427133,0.000040722192,0.000030004448,0.00013349162,0.00004314563],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013979112,0.0012044545,0.0014891742,0.00075951277,0.0005386162,0.00081643654,0.0019323934,0.001450706,0.0028954574],"category_scores_gemma":[0.0015827678,0.0005708245,0.00083263865,0.00048738418,0.0007410806,0.0016342074,0.0016641967,0.0013510063,0.00052039995],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026453385,0.00013921256,0.0008911486,0.00045016257,0.00015683078,0.00028149225,0.0002284156,0.7588994,0.010439414,0.061009917,0.0029795486,0.16426],"study_design_scores_gemma":[0.000021676426,0.000050494218,0.00005427623,0.000007757043,0.000005879031,0.00003581362,0.000008024946,0.9950858,0.00064108346,0.0031093506,0.00097156555,0.000008295571],"about_ca_topic_score_codex":0.0026052475,"about_ca_topic_score_gemma":0.0028585885,"teacher_disagreement_score":0.0028954574,"about_ca_system_score_codex":0.0006855188,"about_ca_system_score_gemma":0.0013532,"threshold_uncertainty_score":0.009686232},"labels":[],"label_agreement":null},{"id":"W4392404102","doi":"10.23952/jano.6.2024.1.08","title":"Modified relaxed CQ-algorithms for a split equality problem in Hilbert spaces","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Hilbert space; Mathematics; Algebra over a field; Algorithm; Pure mathematics","score_opus":0.0543469595364946,"score_gpt":0.3622265552854344,"score_spread":0.3078795957489398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392404102","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028694845,0.00006775661,0.9964264,0.000044863133,0.000027769072,0.00003175495,0.000012114864,0.0000989185,0.00042095105],"genre_scores_gemma":[0.09439209,0.00013163174,0.9031807,0.00014014986,0.000059206377,0.00021570348,0.00015227495,0.00014813014,0.0015801557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984843,0.00060106424,0.00010331211,0.00021853411,0.00047330215,0.00011951509],"domain_scores_gemma":[0.9977465,0.000990708,0.00016143841,0.00039630968,0.00055462844,0.00015038175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025259086,0.0009735479,0.0010040647,0.00073158566,0.00048360907,0.0010545709,0.0026424471,0.0015619566,0.0042120265],"category_scores_gemma":[0.0064427187,0.000508149,0.0009201664,0.00071386405,0.0013004581,0.0024094926,0.0030898857,0.0028293221,0.000946149],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068023,0.00021734636,0.00094527536,0.0005332642,0.00016082027,0.00012640878,0.00035527308,0.5415879,0.021437217,0.14374743,0.0045041353,0.28570473],"study_design_scores_gemma":[0.000043775606,0.00009088761,0.00010022391,0.000013151369,0.000008477608,0.00004038567,0.000021071919,0.9839177,0.0028357059,0.01167815,0.0012326194,0.000017770075],"about_ca_topic_score_codex":0.001370505,"about_ca_topic_score_gemma":0.0011168193,"teacher_disagreement_score":0.0042120265,"about_ca_system_score_codex":0.00048342955,"about_ca_system_score_gemma":0.0013639033,"threshold_uncertainty_score":0.014090598},"labels":[],"label_agreement":null},{"id":"W4392404120","doi":"10.23952/jano.6.2024.1.02","title":"Tseng-type algorithms for solving variational inequalities over the solution sets of split variational inclusion problems with an application to a bilevel optimization problem","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Technion-Israel Institute of Technology","keywords":"Bilevel optimization; Variational inequality; Inclusion (mineral); Mathematical optimization; Type (biology); Mathematics; Optimization problem; Algorithm; Inequality; Computer science; Mathematical analysis; Sociology","score_opus":0.016482215035793793,"score_gpt":0.2631354231861637,"score_spread":0.2466532081503699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392404120","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005178217,0.00018558813,0.9923592,0.00014898807,0.00006300098,0.000045893066,0.000016075403,0.0000708758,0.0019321877],"genre_scores_gemma":[0.20593181,0.00065036636,0.7842479,0.00022647601,0.00013636405,0.00056107424,0.00020226275,0.00018246309,0.007861325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99934417,0.00024118632,0.00005213887,0.00008642516,0.00021378054,0.00006234768],"domain_scores_gemma":[0.99850756,0.00086191186,0.00009832379,0.00014068968,0.00027593636,0.00011563749],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002000299,0.0013797818,0.0012569047,0.0013861887,0.0008978337,0.0014006444,0.0015022762,0.001979732,0.0035478938],"category_scores_gemma":[0.005297245,0.00055933284,0.0013345623,0.0012158956,0.0018669608,0.0026276393,0.0026786956,0.003246624,0.0005783199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018205275,0.00020347051,0.0010260259,0.00028867737,0.0001242994,0.0001811824,0.0003292182,0.556313,0.005050878,0.2880482,0.002426354,0.1458267],"study_design_scores_gemma":[0.0000124178205,0.000052946107,0.000051823197,0.00001669817,0.000007452487,0.00002455392,0.00002520163,0.9645033,0.0011398675,0.03273329,0.0014221959,0.00001035548],"about_ca_topic_score_codex":0.002281636,"about_ca_topic_score_gemma":0.003154969,"teacher_disagreement_score":0.0035478938,"about_ca_system_score_codex":0.00081846537,"about_ca_system_score_gemma":0.0016005253,"threshold_uncertainty_score":0.011868954},"labels":[],"label_agreement":null},{"id":"W4392404184","doi":"10.23952/jano.6.2024.1.01","title":"Accelerated Bregman divergence optimization with SMART: An information geometric point of view","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Statistical Methods and Models","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Bregman divergence; Divergence (linguistics); Point (geometry); Kullback–Leibler divergence; Mathematics; Computer science; Optimization problem; Artificial intelligence; Mathematical optimization; Applied mathematics; Geometry; Philosophy","score_opus":0.042914703397638754,"score_gpt":0.33686439062404366,"score_spread":0.2939496872264049,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392404184","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010579145,0.00019458646,0.9873962,0.0002941316,0.000034433528,0.00002184397,0.000021351938,0.00015075358,0.0013076006],"genre_scores_gemma":[0.4407013,0.0005604661,0.55068326,0.00037646867,0.000112936825,0.00021981169,0.00017852313,0.0002720987,0.006895136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944156,0.00022190837,0.000022926353,0.00007438347,0.00019441696,0.000044845427],"domain_scores_gemma":[0.9987539,0.0006490841,0.00015070883,0.00017699847,0.00017865328,0.000090565925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021425874,0.00093817856,0.0011736394,0.00056064985,0.0003055079,0.00088965904,0.0013275475,0.0013765227,0.0019589495],"category_scores_gemma":[0.0057095336,0.0005120121,0.00063816033,0.00050308736,0.0018433321,0.001687039,0.0023188551,0.0017930613,0.0005032154],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085512496,0.000038027232,0.00054296997,0.00015016658,0.000050425628,0.000116066185,0.00010078265,0.83179855,0.003395034,0.1301377,0.0018105974,0.031774186],"study_design_scores_gemma":[0.000007644306,0.000028174161,0.000050696326,0.000006939646,0.0000029840699,0.000020362566,0.0000060672164,0.98395294,0.00042521395,0.014945765,0.00054635113,0.0000067782235],"about_ca_topic_score_codex":0.0017314351,"about_ca_topic_score_gemma":0.0013917397,"teacher_disagreement_score":0.0021425874,"about_ca_system_score_codex":0.0006846025,"about_ca_system_score_gemma":0.0011676747,"threshold_uncertainty_score":0.01133126},"labels":[],"label_agreement":null},{"id":"W4393443200","doi":"10.23952/jano.6.2024.2.02","title":"Generalized Hukuhara Dini Hadamard $\\epsilon$-subdifferential and $H_{\\epsilon}$-subgradient and their applications in interval optimization","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Numerical Methods and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board","keywords":"Subgradient method; Subderivative; Hadamard transform; Mathematics; Interval (graph theory); Pure mathematics; Applied mathematics; Mathematical analysis; Mathematical optimization; Regular polygon; Convex optimization; Combinatorics; Geometry","score_opus":0.01156842082400594,"score_gpt":0.2540222144213252,"score_spread":0.24245379359731928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393443200","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011042216,0.0020861933,0.98052144,0.00038463314,0.00012113214,0.0000345669,0.00007394758,0.000046348443,0.0056894366],"genre_scores_gemma":[0.38884816,0.0046127923,0.5946619,0.00038954394,0.00031281187,0.00024037497,0.00027631287,0.00015919075,0.010498927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993106,0.00031773592,0.000050018512,0.00011012204,0.00015615954,0.00005530439],"domain_scores_gemma":[0.9986853,0.00073042273,0.0000966024,0.00011499619,0.00028771747,0.000085004845],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024494904,0.0010401619,0.0009316875,0.0009963884,0.00040303986,0.0011830453,0.0009027795,0.0009339787,0.0020913074],"category_scores_gemma":[0.0049904054,0.00038598062,0.0011389811,0.0008159727,0.0015475007,0.0019120624,0.0012719368,0.002436231,0.00036658204],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014815421,0.000059160186,0.0014692874,0.0003929144,0.00007710058,0.0002594921,0.00025929356,0.16954279,0.005592972,0.74469215,0.0033204202,0.07418632],"study_design_scores_gemma":[0.000015560885,0.00008412977,0.00058733666,0.000054445172,0.000020704982,0.00016481662,0.000055561904,0.8321684,0.0021598227,0.15831561,0.006340379,0.00003319893],"about_ca_topic_score_codex":0.0020802577,"about_ca_topic_score_gemma":0.001534034,"teacher_disagreement_score":0.0024494904,"about_ca_system_score_codex":0.0010958768,"about_ca_system_score_gemma":0.00084338454,"threshold_uncertainty_score":0.012954354},"labels":[],"label_agreement":null},{"id":"W4393443251","doi":"10.23952/jano.6.2024.2.07","title":"On approximate positively properly efficient solutions in nonsmooth semi-infinite multiobjective optimization problems with data uncertainty","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Multi-objective optimization; Mathematics; Applied mathematics; Computer science","score_opus":0.016073939679707213,"score_gpt":0.23526598263677026,"score_spread":0.21919204295706304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393443251","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.02437961,0.00027000645,0.9716573,0.00022894877,0.000023661556,0.000038961974,0.00004202529,0.000033584536,0.0033258444],"genre_scores_gemma":[0.7708161,0.00093303074,0.22316642,0.00020160133,0.00006097772,0.000386938,0.0002172898,0.0001341746,0.0040834555],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902,0.0005176526,0.000053354477,0.000116978495,0.00021326105,0.00007876735],"domain_scores_gemma":[0.99738246,0.0017594865,0.00032240996,0.0001349404,0.00031936174,0.00008124823],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038737182,0.0012111116,0.0012491994,0.00082383666,0.0004309256,0.0013161153,0.0006463884,0.0012788489,0.001522376],"category_scores_gemma":[0.009188578,0.00054368284,0.0008789075,0.00054264226,0.0017238591,0.0017412258,0.001968867,0.0012998123,0.00022496609],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007148053,0.00004197281,0.0006465267,0.0002395978,0.00005738344,0.00019767637,0.00015135936,0.6711608,0.0053992704,0.30754304,0.0005848831,0.013905968],"study_design_scores_gemma":[0.000006681342,0.000045429442,0.00012137426,0.000035962883,0.0000073351493,0.000032614582,0.000033235243,0.9536931,0.0010984258,0.044337384,0.0005793972,0.000009033546],"about_ca_topic_score_codex":0.00071550446,"about_ca_topic_score_gemma":0.00048672006,"teacher_disagreement_score":0.0038737182,"about_ca_system_score_codex":0.00061156205,"about_ca_system_score_gemma":0.00086559326,"threshold_uncertainty_score":0.020486414},"labels":[],"label_agreement":null},{"id":"W4393443252","doi":"10.23952/jano.6.2024.2.03","title":"Ravines of quadratic functions","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Differential Equations and Dynamical Systems","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Trường Đại học Duy Tân; Vietnam Academy of Science and Technology","keywords":"Ravine; Mathematics; Quadratic equation; Geometry; Geography; Cartography","score_opus":0.016579091826065748,"score_gpt":0.28082995336094624,"score_spread":0.2642508615348805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393443252","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12280664,0.004315556,0.78519315,0.0011370649,0.00055523025,0.00006648719,0.00019473971,0.00035823786,0.0853728],"genre_scores_gemma":[0.88984907,0.0024550718,0.079174325,0.00041770146,0.0008149884,0.000081801234,0.00020600947,0.0002522935,0.026748704],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99841094,0.00057240215,0.00009493543,0.00035260076,0.00043232137,0.00013672371],"domain_scores_gemma":[0.9972886,0.0010216733,0.00039332465,0.00034384258,0.00073178124,0.00022088998],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019456189,0.00084705907,0.0006832386,0.0017775554,0.0009093943,0.0020649375,0.0008595097,0.0007538649,0.0035702172],"category_scores_gemma":[0.0068723187,0.0003168242,0.0007766818,0.0007060401,0.0037506337,0.0064275027,0.0019918242,0.0027228387,0.0010716006],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026494628,0.0000069489583,0.00013296613,0.00005378182,0.000009433789,0.00006516687,0.00020803242,0.0026775065,0.001960701,0.98556364,0.00049869175,0.008796635],"study_design_scores_gemma":[0.000013088554,0.00021316166,0.00059188704,0.000055087738,0.000014601379,0.0004493539,0.00022555447,0.04031967,0.0024494487,0.9291498,0.026468007,0.000050446506],"about_ca_topic_score_codex":0.00050085026,"about_ca_topic_score_gemma":0.00022839101,"teacher_disagreement_score":0.0035702172,"about_ca_system_score_codex":0.0006098807,"about_ca_system_score_gemma":0.00036535153,"threshold_uncertainty_score":0.011943579},"labels":[],"label_agreement":null},{"id":"W4393443269","doi":"10.23952/jano.6.2024.2.05","title":"Pontryagin optimality conditions for generalized bilevel optimal control problems with pure state inequality constraints","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pontryagin's minimum principle; Optimal control; Bilevel optimization; Inequality; Mathematics; Mathematical economics; Control (management); State (computer science); Mathematical optimization; Maximum principle; Applied mathematics; Economics; Optimization problem; Mathematical analysis","score_opus":0.01176881556444719,"score_gpt":0.25060960242217994,"score_spread":0.23884078685773275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393443269","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018162752,0.0002887801,0.9711728,0.00044691708,0.00004797627,0.000051380586,0.00009089279,0.00005607042,0.00968242],"genre_scores_gemma":[0.772542,0.0009895705,0.2126227,0.00046795295,0.00017489426,0.00064415246,0.00040968214,0.00025344975,0.011895662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899656,0.00036993707,0.000059270933,0.00020656243,0.00024345037,0.00012423003],"domain_scores_gemma":[0.99814,0.0012271248,0.00017461588,0.00011312908,0.00025884886,0.000086254695],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025274795,0.0012016961,0.0014418784,0.0007163569,0.0006128951,0.0017927762,0.0011192925,0.0016686582,0.0036214686],"category_scores_gemma":[0.0063189077,0.00056161045,0.0011117879,0.00061404315,0.0023130686,0.0025548914,0.0025724962,0.0022454197,0.00043258406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034583398,0.000038592418,0.0002781011,0.00022738073,0.00004474025,0.0002162906,0.00014459003,0.24966344,0.0028434538,0.73621684,0.0010513187,0.009240662],"study_design_scores_gemma":[0.000015993819,0.00004659843,0.00015245908,0.00003791769,0.000008612808,0.00005807482,0.00004865446,0.7370192,0.00073302357,0.26027426,0.001590367,0.000014876491],"about_ca_topic_score_codex":0.0013819535,"about_ca_topic_score_gemma":0.0010518202,"teacher_disagreement_score":0.0036214686,"about_ca_system_score_codex":0.0009992679,"about_ca_system_score_gemma":0.0015036216,"threshold_uncertainty_score":0.013366699},"labels":[],"label_agreement":null},{"id":"W4393443272","doi":"10.23952/jano.6.2024.2.06","title":"On the strong convergence of an inertial proximal algorithm with a time scale, Hessian-driven damping, and a Tikhonov regularization term","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Numerical methods in inverse problems","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tikhonov regularization; Hessian matrix; Regularization (linguistics); Inertial frame of reference; Convergence (economics); Term (time); Scale (ratio); Algorithm; Mathematics; Applied mathematics; Mathematical analysis; Computer science; Physics; Artificial intelligence; Inverse problem; Classical mechanics","score_opus":0.016924596498197365,"score_gpt":0.27761439369677027,"score_spread":0.2606897971985729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393443272","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012170895,0.00010275746,0.9850899,0.00018966655,0.000035442332,0.000038218608,0.0000088177685,0.000048868875,0.0023153683],"genre_scores_gemma":[0.46906558,0.0006056771,0.5190094,0.00032289381,0.00017072962,0.00048204907,0.000110137276,0.0002884404,0.009945137],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883527,0.00058789615,0.000043897493,0.00011335827,0.00032954436,0.00008994159],"domain_scores_gemma":[0.99415153,0.004257997,0.000321395,0.0002870843,0.0006781143,0.00030382557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055910437,0.0011059784,0.000958985,0.00095343817,0.0008302555,0.0010953675,0.0010664352,0.0016986973,0.0020507434],"category_scores_gemma":[0.015461862,0.00047285488,0.0009559683,0.0006616773,0.003077284,0.0014557741,0.003098751,0.0020054805,0.00048588403],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020558354,0.00014237652,0.0010202788,0.00025446096,0.00009608822,0.00024702417,0.00040384475,0.6641679,0.0111656645,0.28515938,0.0013708144,0.03576657],"study_design_scores_gemma":[0.000015730935,0.000089154455,0.000117755175,0.000015596179,0.0000073962583,0.000038520826,0.000020033569,0.98145056,0.0013086111,0.016334489,0.0005903986,0.0000117995005],"about_ca_topic_score_codex":0.0019655966,"about_ca_topic_score_gemma":0.0015534983,"teacher_disagreement_score":0.0055910437,"about_ca_system_score_codex":0.0006664755,"about_ca_system_score_gemma":0.0018242726,"threshold_uncertainty_score":0.029568672},"labels":[],"label_agreement":null},{"id":"W4393616030","doi":"10.23952/jano.6.2024.2.01","title":"Primal and dual second-order necessary optimality conditions in bilevel programming","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bilevel optimization; Dual (grammatical number); Order (exchange); Mathematical optimization; Computer science; Mathematics; Economics; Optimization problem; Philosophy","score_opus":0.009523742768348347,"score_gpt":0.2521858338886716,"score_spread":0.24266209112032325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393616030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0109420195,0.0007011893,0.9780496,0.0006478935,0.00010765533,0.00008254039,0.00020911846,0.00011194692,0.009148011],"genre_scores_gemma":[0.5584807,0.0026884999,0.4238704,0.0005218766,0.00034234385,0.0009918648,0.0009295604,0.0005512928,0.011623528],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975758,0.0009749553,0.00014666292,0.00023750663,0.0007288347,0.00033624668],"domain_scores_gemma":[0.995161,0.0031394649,0.00033633478,0.00021108701,0.0009223552,0.00022972836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0059042,0.0017967478,0.0025011993,0.0022868381,0.0009210474,0.00401873,0.0015669231,0.0022864083,0.005887392],"category_scores_gemma":[0.017498553,0.001561979,0.0018720111,0.001367281,0.003055547,0.0040377993,0.0027212014,0.004222233,0.0010780955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000909311,0.00009444497,0.00047306414,0.0005478103,0.00004084792,0.0002865902,0.00023537647,0.32443488,0.0026532358,0.6530818,0.0030804724,0.014980569],"study_design_scores_gemma":[0.00001577647,0.00005613433,0.00012449671,0.000079603444,0.000009152698,0.000050451534,0.00006262386,0.8142184,0.0011231706,0.18255295,0.0016872492,0.000020096159],"about_ca_topic_score_codex":0.002494667,"about_ca_topic_score_gemma":0.0026338024,"teacher_disagreement_score":0.0059042,"about_ca_system_score_codex":0.0019849024,"about_ca_system_score_gemma":0.003977229,"threshold_uncertainty_score":0.031224728},"labels":[],"label_agreement":null},{"id":"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,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Augmented Lagrangian method; Lagrangian; Lagrangian relaxation; Mathematical optimization; Applied mathematics; Computer science; Mathematics; Calculus (dental); Medicine","score_opus":0.010526543568980144,"score_gpt":0.2630617335023203,"score_spread":0.2525351899333402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393616711","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013262163,0.00035213845,0.9783524,0.00022647195,0.000053921798,0.000022511394,0.000042684424,0.000071271665,0.0076164617],"genre_scores_gemma":[0.6935488,0.00089237094,0.2890197,0.00015257802,0.000114838505,0.00019854185,0.00018339927,0.00012641914,0.015763387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947435,0.00025286828,0.000020339854,0.000052099476,0.0001491536,0.000051197963],"domain_scores_gemma":[0.99942195,0.00022389412,0.00010807655,0.00013492162,0.000075681426,0.000035559708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008999368,0.00088774407,0.0007383307,0.00045402092,0.00036559592,0.0013614673,0.00097123877,0.0008676531,0.0019438029],"category_scores_gemma":[0.0022123398,0.00031678946,0.0007131012,0.00062764285,0.0018163405,0.0016290498,0.0021496895,0.001630895,0.00039394927],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021877644,0.000016512286,0.0002438984,0.000078475336,0.000022014983,0.00008969842,0.00008513308,0.55072206,0.0017594714,0.4285928,0.00058630726,0.017781762],"study_design_scores_gemma":[0.000004472862,0.0000208984,0.000041485284,0.000012805882,0.0000031835195,0.000023148023,0.000010402573,0.9194264,0.00034189946,0.07796319,0.0021461756,0.0000059298645],"about_ca_topic_score_codex":0.0016575869,"about_ca_topic_score_gemma":0.0017996647,"teacher_disagreement_score":0.0019438029,"about_ca_system_score_codex":0.0006628791,"about_ca_system_score_gemma":0.0010597818,"threshold_uncertainty_score":0.0065026283},"labels":[],"label_agreement":null},{"id":"W4393616852","doi":"10.23952/jano.6.2024.2.04","title":"Sensitivity analysis of an optimal control problem under Lipschitzian perturbations","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Contact Mechanics and Variational Inequalities","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Sensitivity (control systems); Mathematics; Optimal control; Control theory (sociology); Control (management); Applied mathematics; Mathematical optimization; Mathematical economics; Computer science; Engineering; Artificial intelligence","score_opus":0.0107264990995764,"score_gpt":0.2421039027145652,"score_spread":0.2313774036149888,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393616852","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25898328,0.00092996587,0.7266489,0.0011590346,0.000077434684,0.00012702333,0.00017150318,0.00020956613,0.011693198],"genre_scores_gemma":[0.9913902,0.00030309815,0.006516823,0.00007021653,0.000026187876,0.000054904263,0.00004639166,0.000030012408,0.0015621689],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989243,0.0004747193,0.000041301737,0.00019999748,0.00025935486,0.00010024723],"domain_scores_gemma":[0.9958546,0.0031919489,0.00043530538,0.00013341759,0.0002857845,0.000099014025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026765333,0.00084916834,0.0008738492,0.0012176665,0.00040879435,0.0015698912,0.00061507575,0.001123839,0.0012711987],"category_scores_gemma":[0.0076964046,0.00035752374,0.0008011081,0.00040083702,0.002214645,0.0012972079,0.0014516617,0.0008867414,0.00006387712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085700754,0.000030459958,0.000787754,0.00011668203,0.00010134746,0.00023088767,0.00012304501,0.9294945,0.011135837,0.053596,0.0002000924,0.004097706],"study_design_scores_gemma":[0.000004406468,0.0000363352,0.00053075084,0.00001242319,0.000015528054,0.000033107408,0.000029541578,0.9790739,0.0013242301,0.018727262,0.00019989377,0.000012669447],"about_ca_topic_score_codex":0.0028272443,"about_ca_topic_score_gemma":0.00047558814,"teacher_disagreement_score":0.0028272443,"about_ca_system_score_codex":0.001350277,"about_ca_system_score_gemma":0.00069516257,"threshold_uncertainty_score":0.01415503},"labels":[],"label_agreement":null},{"id":"W4400959673","doi":"10.23952/jano.6.2024.3.03","title":"Unsupervised sample selection for active learning with quadratic programming","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Machine Learning and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Selection (genetic algorithm); Computer science; Machine learning; Sample (material); Artificial intelligence; Active learning (machine learning); Unsupervised learning; Chemistry","score_opus":0.005992738286746913,"score_gpt":0.23469284714421976,"score_spread":0.22870010885747286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400959673","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019408675,0.00014689154,0.9972621,0.00009765527,0.000020990685,0.00003165931,0.000016517752,0.00017065852,0.0003126623],"genre_scores_gemma":[0.3456905,0.00061496254,0.646132,0.0006489903,0.0003362322,0.0009909136,0.00070842804,0.0004580313,0.00442005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796486,0.0010049093,0.00008446651,0.00038537043,0.00043981776,0.00012062551],"domain_scores_gemma":[0.9936877,0.004696619,0.00033611397,0.0002950402,0.0008080568,0.00017654154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044689123,0.0017407062,0.002429373,0.0015185615,0.0007453965,0.0015016583,0.003612876,0.0020191716,0.002850285],"category_scores_gemma":[0.010808228,0.0010753326,0.0014532829,0.0013557179,0.0018759962,0.0022869546,0.0024737078,0.002800024,0.00067308114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025854082,0.00024616695,0.0014940131,0.00034743786,0.00020033454,0.00013012839,0.00018062764,0.7208311,0.0035645764,0.040116213,0.0047285245,0.22790231],"study_design_scores_gemma":[0.000008378616,0.000016359478,0.000031417734,0.00000509211,0.0000048065085,0.0000080663785,0.000003905239,0.9951768,0.00026846922,0.0041994927,0.0002739069,0.000003189294],"about_ca_topic_score_codex":0.002632877,"about_ca_topic_score_gemma":0.0034522025,"teacher_disagreement_score":0.0044689123,"about_ca_system_score_codex":0.0010526618,"about_ca_system_score_gemma":0.0014309216,"threshold_uncertainty_score":0.023634195},"labels":[],"label_agreement":null},{"id":"W4400959697","doi":"10.23952/jano.6.2024.3.09","title":"A self-adaptive algorithm with multi-step inertia for solving convex bilevel optimization problems","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Tianjin Municipal Education Commission","keywords":"Bilevel optimization; Inertia; Mathematical optimization; Computer science; Regular polygon; Algorithm; Convex optimization; Mathematics; Optimization problem; Physics","score_opus":0.012680389766965283,"score_gpt":0.22778450855343294,"score_spread":0.21510411878646765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400959697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004820063,0.00013095656,0.99394196,0.000051019364,0.000040159757,0.000021002483,0.00000502712,0.00012822561,0.00086166244],"genre_scores_gemma":[0.3359135,0.0003638888,0.6596155,0.00018210428,0.00013187798,0.00033903628,0.00009699084,0.00013986648,0.0032172913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995826,0.00009747561,0.00003356782,0.00007912629,0.00016373424,0.000043523378],"domain_scores_gemma":[0.9994413,0.00024508938,0.00006645179,0.000067146284,0.0001402483,0.000039733037],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007765094,0.00067633577,0.0009564962,0.00057283096,0.00043621068,0.0007392975,0.0014313665,0.0011556448,0.0017323442],"category_scores_gemma":[0.0021033129,0.00045957218,0.0006882613,0.00060856354,0.00070860295,0.0011034454,0.0013058523,0.0012482282,0.00042834174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014983099,0.00012790693,0.0012697396,0.0002470559,0.00014512936,0.00014000134,0.00016463893,0.7416918,0.011120057,0.02975707,0.0022491748,0.21293764],"study_design_scores_gemma":[0.000014265041,0.000032131837,0.000054435608,0.0000046709497,0.000005498887,0.000020415204,0.00000353873,0.9975777,0.000539744,0.0010506256,0.00069078204,0.000006138554],"about_ca_topic_score_codex":0.001612312,"about_ca_topic_score_gemma":0.0013304105,"teacher_disagreement_score":0.0017323442,"about_ca_system_score_codex":0.0002976359,"about_ca_system_score_gemma":0.00071849045,"threshold_uncertainty_score":0.0057953},"labels":[],"label_agreement":null},{"id":"W4400959701","doi":"10.23952/jano.6.2024.3.06","title":"Efficient box-constrained “nonconvex + nonconvex” approach for image deblurring with impulse noise","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Image and Signal Denoising Methods","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Guangzhou University; National Natural Science Foundation of China","keywords":"Deblurring; Impulse noise; Impulse (physics); Image (mathematics); Mathematics; Noise (video); Image restoration; Mathematical optimization; Computer science; Algorithm; Computer vision; Artificial intelligence; Image processing; Physics","score_opus":0.00815333075055686,"score_gpt":0.24484103812008906,"score_spread":0.2366877073695322,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400959701","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002898589,0.00007791941,0.99644107,0.000049741313,0.0000066820685,0.000013298389,0.000013057951,0.00007018376,0.0004293315],"genre_scores_gemma":[0.20320062,0.0005377413,0.78913575,0.00018178832,0.000056525452,0.00026111567,0.00025796704,0.0002034244,0.006165058],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996704,0.00012143248,0.000013845486,0.000050452145,0.00011356357,0.00003040184],"domain_scores_gemma":[0.9995995,0.00020295032,0.00005452955,0.000050367424,0.00007330688,0.000019351228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096751994,0.0008301693,0.0009457983,0.0005115757,0.00028780216,0.0005716946,0.001055189,0.0011207055,0.0019641137],"category_scores_gemma":[0.0013607907,0.00043669058,0.0007031692,0.00047840257,0.0006950509,0.0008680414,0.001188579,0.0008334018,0.0005076375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081260354,0.000049635626,0.00039137548,0.00021976608,0.000048835536,0.00013245131,0.00010314187,0.89379084,0.016181156,0.02545011,0.0018305267,0.061720837],"study_design_scores_gemma":[0.0000016314211,0.000008147729,0.000026841173,0.0000024765513,0.0000018464328,0.000010969772,0.0000026917446,0.99799013,0.000802399,0.0008161359,0.0003333935,0.0000033634492],"about_ca_topic_score_codex":0.0025398568,"about_ca_topic_score_gemma":0.0031463876,"teacher_disagreement_score":0.0025398568,"about_ca_system_score_codex":0.00042021074,"about_ca_system_score_gemma":0.0009767946,"threshold_uncertainty_score":0.006570637},"labels":[],"label_agreement":null},{"id":"W4400959818","doi":"10.23952/jano.6.2024.3.08","title":"On fixed point iterative methods for solving non-Lipschitz quasi-monotone variational inequalities","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lipschitz continuity; Monotone polygon; Variational inequality; Fixed point; Mathematics; Applied mathematics; Inequality; Fixed-point theorem; Iterative method; Point (geometry); Mathematical analysis; Mathematical optimization; Geometry","score_opus":0.015111775827970629,"score_gpt":0.3083736395106421,"score_spread":0.2932618636826715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400959818","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034376043,0.0012519938,0.9911283,0.00028983701,0.00020273501,0.00010234397,0.00003275439,0.00005828287,0.0034961838],"genre_scores_gemma":[0.15248163,0.00334327,0.82301205,0.0005642405,0.00052987627,0.0012134496,0.00030751977,0.0004973546,0.018050622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976349,0.0013503333,0.00012728074,0.00022023518,0.00053218147,0.00013512588],"domain_scores_gemma":[0.9887726,0.008759416,0.0003294453,0.00039676734,0.001442207,0.00029969687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008420137,0.0030442683,0.0026452157,0.0022284342,0.0010831795,0.002013909,0.00394197,0.0044185626,0.0047227824],"category_scores_gemma":[0.021571329,0.0013915249,0.0029120897,0.0020445923,0.0039508,0.0029699788,0.0062466,0.0054079923,0.00085231604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040465503,0.0002254691,0.000995731,0.001154871,0.0003975141,0.0003414376,0.00066455035,0.6066045,0.0067576454,0.28845724,0.0042931666,0.08970316],"study_design_scores_gemma":[0.000019626696,0.00007164223,0.00008639997,0.000052107313,0.00001955303,0.00002037085,0.00002472805,0.9676579,0.0004000819,0.029757965,0.0018710304,0.00001857256],"about_ca_topic_score_codex":0.010041991,"about_ca_topic_score_gemma":0.0077323876,"teacher_disagreement_score":0.010041991,"about_ca_system_score_codex":0.0019890452,"about_ca_system_score_gemma":0.0027321475,"threshold_uncertainty_score":0.04453051},"labels":[],"label_agreement":null},{"id":"W4400959825","doi":"10.23952/jano.6.2024.3.04","title":"How wrong could we be? A new way to solve underdetermined linear equations, illustrated via computed tomography","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Reservoir Engineering and Simulation Methods","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Centre Scientifique et Technique du Bâtiment; Chongqing Municipal Education Commission; Natural Science Foundation of Chongqing; National Natural Science Foundation of China","keywords":"Underdetermined system; Computed tomography; Applied mathematics; Tomography; Computer science; Mathematics; Calculus (dental); Algorithm; Medicine; Radiology; Orthodontics","score_opus":0.020921434307720962,"score_gpt":0.2579050072746522,"score_spread":0.23698357296693123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400959825","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0076975636,0.0021082524,0.9752256,0.009317975,0.0003690555,0.000029313765,0.00010102766,0.0002965556,0.004854672],"genre_scores_gemma":[0.19707115,0.0030778253,0.79102004,0.0024600844,0.00045198193,0.000112837784,0.00011667639,0.00027450756,0.0054149325],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871385,0.00061874936,0.000066679204,0.00027735985,0.00027067735,0.000052654013],"domain_scores_gemma":[0.9966763,0.0019526148,0.0002986989,0.00060525216,0.00035278348,0.0001143254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035531505,0.00077341736,0.0010944064,0.0010780365,0.0012525384,0.003482714,0.0009915446,0.002209809,0.0030607951],"category_scores_gemma":[0.012754341,0.00068001234,0.00070939044,0.00074846577,0.0063545494,0.007564529,0.0021218017,0.0049292743,0.00089296605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00040526813,0.00010798202,0.0040692375,0.00047734266,0.0003262314,0.00034276219,0.0017421996,0.070459016,0.014088383,0.6804382,0.016354613,0.21118866],"study_design_scores_gemma":[0.000055598437,0.000102878796,0.00056289637,0.00017211188,0.00004208445,0.00038631444,0.0005886231,0.15099604,0.0060357233,0.8114994,0.029453093,0.0001053814],"about_ca_topic_score_codex":0.001690116,"about_ca_topic_score_gemma":0.0021794278,"teacher_disagreement_score":0.0035531505,"about_ca_system_score_codex":0.0008416408,"about_ca_system_score_gemma":0.0012084007,"threshold_uncertainty_score":0.01879108},"labels":[],"label_agreement":null},{"id":"W4400959887","doi":"10.23952/jano.6.2024.3.02","title":"A stochastic proximal gradient method for linear hyperspectral unmixing","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Remote-Sensing Image Classification","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Chinese Academy of Sciences; National Natural Science Foundation of China","keywords":"Hyperspectral imaging; Computer science; Artificial intelligence; Pattern recognition (psychology); Mathematics","score_opus":0.011852992522159518,"score_gpt":0.2555297992872905,"score_spread":0.243676806765131,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400959887","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00074331166,0.00008875581,0.9985922,0.000059250553,0.000016253318,0.000013040059,0.000010343759,0.000058822552,0.00041804864],"genre_scores_gemma":[0.13563044,0.00066729396,0.8550818,0.00021473554,0.00014752944,0.00033747914,0.00020552678,0.00020841644,0.0075068353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993286,0.00027540448,0.000020679183,0.00010463367,0.00022096894,0.00004965449],"domain_scores_gemma":[0.9995278,0.0002627998,0.000049399863,0.00002600614,0.0001013054,0.000032616088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001529436,0.0011359833,0.00138751,0.0006396113,0.0004751993,0.00072008313,0.0011825698,0.0014311179,0.0020605156],"category_scores_gemma":[0.0019459188,0.00059753633,0.0009494247,0.0009465011,0.001092663,0.0011094116,0.0019693081,0.0018361983,0.00076602877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006280957,0.00006664482,0.00020183926,0.00020100403,0.00007319,0.000077397424,0.00007174782,0.8806873,0.0043039867,0.049725883,0.0025154627,0.062012736],"study_design_scores_gemma":[0.0000041386616,0.000012902083,0.000021023392,0.0000040851037,0.0000025684599,0.000008669254,0.000002469442,0.9950283,0.00033325245,0.0038626215,0.00071507454,0.0000048209263],"about_ca_topic_score_codex":0.0028672486,"about_ca_topic_score_gemma":0.0023025419,"teacher_disagreement_score":0.0028672486,"about_ca_system_score_codex":0.0006676007,"about_ca_system_score_gemma":0.0017427903,"threshold_uncertainty_score":0.008088529},"labels":[],"label_agreement":null},{"id":"W4400959902","doi":"10.23952/jano.6.2024.3.05","title":"Function approximations via l1 - l2 optimization","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Function (biology); Approximations of π; Computer science; Mathematics; Algorithm; Mathematical optimization; Applied mathematics; Biology","score_opus":0.004062597707315444,"score_gpt":0.20435090351581509,"score_spread":0.20028830580849963,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400959902","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026414832,0.00031423284,0.9909376,0.00026939966,0.00013778731,0.000024812141,0.00004651052,0.00019795484,0.00543021],"genre_scores_gemma":[0.22343576,0.00089420425,0.74432546,0.00059649243,0.00038361186,0.00040403614,0.00044500048,0.0012377916,0.02827772],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988681,0.00060116546,0.00003837495,0.00009450581,0.00032884005,0.000068977344],"domain_scores_gemma":[0.9982698,0.0010864167,0.00007588339,0.00019293987,0.00030286817,0.00007202963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002321694,0.0015230828,0.0014264365,0.0009887019,0.00063849706,0.0018058332,0.0013388233,0.0021358521,0.005755887],"category_scores_gemma":[0.0070273406,0.00066232716,0.00089882355,0.0009601104,0.0012118737,0.0016573833,0.0026037288,0.0026092562,0.0024918825],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024121505,0.00010181672,0.00046318612,0.00028293795,0.000086185806,0.000118887416,0.00014987327,0.6955228,0.0036689416,0.19014162,0.010749052,0.09847347],"study_design_scores_gemma":[0.0000055660203,0.000011130718,0.000018980218,0.000008279587,0.0000034852762,0.000009856898,0.000006370972,0.98800665,0.0004378912,0.010027144,0.0014606031,0.0000040783316],"about_ca_topic_score_codex":0.0039371927,"about_ca_topic_score_gemma":0.0031664064,"teacher_disagreement_score":0.005755887,"about_ca_system_score_codex":0.0011026033,"about_ca_system_score_gemma":0.001107311,"threshold_uncertainty_score":0.0192554},"labels":[],"label_agreement":null},{"id":"W4400959906","doi":"10.23952/jano.6.2024.3.07","title":"A small target motion detection algorithm in complex dynamic environment","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Infrared Target Detection Methodologies","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Computer science; Motion (physics); Artificial intelligence; Computer vision; Algorithm","score_opus":0.016058544778919624,"score_gpt":0.21856937858780826,"score_spread":0.20251083380888862,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400959906","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05127278,0.0001883551,0.94635797,0.0001444046,0.00003609633,0.000050584982,0.000028137707,0.00041675536,0.0015049143],"genre_scores_gemma":[0.64736485,0.0001911025,0.34692356,0.00017257199,0.000039273866,0.00015606765,0.0001459435,0.00005963138,0.0049470463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9998301,0.000018517989,0.000009192187,0.00005993144,0.000049232058,0.00003296916],"domain_scores_gemma":[0.9998153,0.000059171925,0.000032489253,0.000016163009,0.000057182257,0.00001971289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003484069,0.00050000666,0.00056456117,0.0004839992,0.00032360613,0.00040038678,0.0010211855,0.0008034663,0.0013847775],"category_scores_gemma":[0.0008876371,0.00026571954,0.00031912417,0.00036969746,0.00037350602,0.0006713178,0.00067932316,0.00052829226,0.00022579407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002855898,0.00009334905,0.0020970304,0.000078897916,0.000057157686,0.00016394757,0.00008343634,0.56043667,0.030784553,0.0068993443,0.0017029383,0.39731708],"study_design_scores_gemma":[0.0000067321516,0.000023584604,0.0001753837,0.0000019340598,0.000003741554,0.000019627614,0.000003851285,0.9977047,0.0013501645,0.0005241096,0.00018331895,0.0000029309315],"about_ca_topic_score_codex":0.005694492,"about_ca_topic_score_gemma":0.004297714,"teacher_disagreement_score":0.005694492,"about_ca_system_score_codex":0.0005867492,"about_ca_system_score_gemma":0.0007323135,"threshold_uncertainty_score":0.011322677},"labels":[],"label_agreement":null},{"id":"W4400960057","doi":"10.23952/jano.6.2024.3.01","title":"EDITORIAL: SPECIAL ISSUE ON IMAGE RESTORATION MODELS, ALGORITHMS, AND THEIR APPLICATIONS","year":2024,"lang":"en","type":"editorial","venue":"Journal of Applied and Numerical Optimization","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Guangzhou University","keywords":"Image restoration; Computer science; Image (mathematics); Algorithm; Artificial intelligence; Image processing","score_opus":0.007375064360661626,"score_gpt":0.2628097290762185,"score_spread":0.25543466471555687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400960057","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000030417346,0.003711818,0.00034813397,0.009680797,0.98485327,0.000017983772,0.00003954587,0.00005913073,0.0012589047],"genre_scores_gemma":[0.0002573622,0.0025963383,0.00020106588,0.0038258133,0.98665464,0.000016848562,0.00002755878,0.00004102583,0.0063792295],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99559915,0.0006304738,0.00050786155,0.00056716136,0.0024490005,0.00024633392],"domain_scores_gemma":[0.98047376,0.006333469,0.0012416897,0.0005661014,0.008939999,0.0024450205],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0054849447,0.004582907,0.00557411,0.00574566,0.002508825,0.008680962,0.0033560807,0.011498211,0.020591171],"category_scores_gemma":[0.019381069,0.0014795787,0.0037049972,0.0018514999,0.0022417414,0.0032348267,0.001325242,0.01450707,0.01486858],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005823577,0.000019613126,0.00001968281,0.00022418096,0.000029337345,0.000080467515,0.0000035876972,0.00006038584,0.00009347053,0.00029116968,0.9920459,0.0070740944],"study_design_scores_gemma":[0.000150423,0.00006388455,0.0003986427,0.0003988724,0.0001302918,0.00043224663,0.000023680721,0.0008403166,0.00035094144,0.0023631146,0.9948132,0.00003447891],"about_ca_topic_score_codex":0.00091854495,"about_ca_topic_score_gemma":0.0032124568,"teacher_disagreement_score":0.020591171,"about_ca_system_score_codex":0.0021350982,"about_ca_system_score_gemma":0.002105076,"threshold_uncertainty_score":0.06888431},"labels":[],"label_agreement":null},{"id":"W4408577766","doi":"10.23952/jano.7.2025.1.03","title":"DC programming and algorithm for nonconvex log total variation image reconstruction","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Medical Image Segmentation Techniques","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Guangxi Province; National Natural Science Foundation of China","keywords":"Variation (astronomy); Image (mathematics); Algorithm; Computer science; Mathematics; Artificial intelligence","score_opus":0.005105190725417419,"score_gpt":0.2499684202268943,"score_spread":0.24486322950147688,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408577766","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005433508,0.000071450144,0.99883837,0.00006161021,0.000012181355,0.000012012142,0.000009363509,0.000036016,0.00041560075],"genre_scores_gemma":[0.09225769,0.0004960262,0.9008498,0.0002375062,0.000088286884,0.00026994746,0.00022175329,0.00017901392,0.005399959],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993467,0.0002187047,0.000031925196,0.00015079942,0.0002046314,0.000047204296],"domain_scores_gemma":[0.9991597,0.0004225174,0.0000718521,0.00007727698,0.00022723604,0.000041409723],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012652659,0.0007978521,0.00085206755,0.00097533135,0.0004434095,0.0009497436,0.0013427442,0.0013673218,0.002392647],"category_scores_gemma":[0.002626054,0.00052756316,0.0007512319,0.0012075516,0.0009820936,0.0012475603,0.0014627046,0.002331951,0.00058338273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073125404,0.00006803451,0.0004418648,0.00020550503,0.00004788351,0.00011923588,0.0000765277,0.6626839,0.0059235226,0.16119811,0.004431319,0.16473098],"study_design_scores_gemma":[0.0000038721573,0.000015286036,0.000026228414,0.0000051450165,0.000002797604,0.000034078636,0.0000039904194,0.989972,0.00080909184,0.0076215058,0.0015003536,0.0000056170024],"about_ca_topic_score_codex":0.0032608204,"about_ca_topic_score_gemma":0.0022911646,"teacher_disagreement_score":0.0032608204,"about_ca_system_score_codex":0.00097449584,"about_ca_system_score_gemma":0.0015920595,"threshold_uncertainty_score":0.008004189},"labels":[],"label_agreement":null},{"id":"W4408577964","doi":"10.23952/jano.7.2025.1.06","title":"Solving a large-scale least squares problem with a simplex constraint by a two-stage algorithm","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Stage (stratigraphy); Simplex algorithm; Constraint (computer-aided design); Scale (ratio); Least-squares function approximation; Simplex; Algorithm; Mathematical optimization; Mathematics; Computer science; Linear programming; Combinatorics; Geography; Statistics","score_opus":0.003708786062473193,"score_gpt":0.20901014485763778,"score_spread":0.2053013587951646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408577964","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021561072,0.00003252053,0.99656725,0.000048120706,0.000020711484,0.00004197863,0.000018920746,0.00034761787,0.00076682144],"genre_scores_gemma":[0.040950175,0.000048887036,0.9555603,0.00005910167,0.00003329679,0.00030333802,0.00011492186,0.00018999088,0.002739976],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989906,0.00030029318,0.00007245007,0.00018218064,0.0003577556,0.00009679989],"domain_scores_gemma":[0.99779093,0.0014054569,0.00009344583,0.0001887393,0.00043246802,0.00008894242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014654526,0.0013825459,0.0019363168,0.00072897313,0.00085095357,0.0013213533,0.0021297915,0.002665324,0.0087502925],"category_scores_gemma":[0.004165973,0.0014046377,0.0013680278,0.0012278782,0.0009350767,0.0016853237,0.0023960434,0.0025222637,0.0025638347],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031737282,0.00023057694,0.00056480186,0.00033374547,0.00013848273,0.00014287866,0.00017877026,0.7524354,0.013009933,0.012741378,0.0048914407,0.21501529],"study_design_scores_gemma":[0.00002764116,0.00003547229,0.00005732376,0.000004314623,0.0000068982076,0.000017945136,0.000008389015,0.996774,0.00095508853,0.001433526,0.00066927535,0.000010013123],"about_ca_topic_score_codex":0.007973596,"about_ca_topic_score_gemma":0.009765566,"teacher_disagreement_score":0.0087502925,"about_ca_system_score_codex":0.0006383272,"about_ca_system_score_gemma":0.0029958482,"threshold_uncertainty_score":0.029272616},"labels":[],"label_agreement":null},{"id":"W4408578012","doi":"10.23952/jano.7.2025.1.04","title":"Explicit iterative methods for the split feasibility problem with multiple output sets","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Iterative method; Computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.019025794215610275,"score_gpt":0.3115094066775586,"score_spread":0.2924836124619483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408578012","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010190353,0.00006914985,0.9981273,0.00003430594,0.00001316098,0.000011110891,0.00000540529,0.000021915657,0.0006986522],"genre_scores_gemma":[0.0930516,0.00040532456,0.9015382,0.0000800399,0.00006304887,0.00026256914,0.000069258,0.00015735478,0.004372619],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987394,0.00050797465,0.000066092,0.00012881502,0.00048360747,0.00007406281],"domain_scores_gemma":[0.9979517,0.0013281419,0.00017566081,0.00014687107,0.00032651494,0.00007105507],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024490638,0.001128116,0.0010517992,0.0007196225,0.00052020105,0.0009961392,0.0018054252,0.0015902951,0.0036240607],"category_scores_gemma":[0.006914331,0.00067886815,0.0011803078,0.00064118416,0.0015203839,0.0022212246,0.002979847,0.0029574737,0.00073632604],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011770489,0.00009969137,0.0004005886,0.0006390792,0.000085766005,0.0002592253,0.0003670567,0.4945112,0.011038892,0.3736058,0.001853044,0.11702204],"study_design_scores_gemma":[0.000013208908,0.000031828717,0.000041782,0.000032136628,0.000009209844,0.00005670161,0.000017296066,0.96323097,0.0018343312,0.032735396,0.0019830973,0.000014080536],"about_ca_topic_score_codex":0.0007367286,"about_ca_topic_score_gemma":0.0010719753,"teacher_disagreement_score":0.0036240607,"about_ca_system_score_codex":0.0006014001,"about_ca_system_score_gemma":0.0012090765,"threshold_uncertainty_score":0.01295203},"labels":[],"label_agreement":null},{"id":"W4408578183","doi":"10.23952/jano.7.2025.1.01","title":"Solving basis pursuit revisited: When ADMM meets the inherent separable structure","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Semiconductor Quantum Structures and Devices","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Ningbo; Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Separable space; Basis (linear algebra); Basis pursuit; Computer science; Mathematical economics; Mathematical optimization; Mathematics; Artificial intelligence; Geometry; Matching pursuit; Mathematical analysis","score_opus":0.00603341570260296,"score_gpt":0.23612590859171728,"score_spread":0.23009249288911432,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408578183","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021963906,0.0012763708,0.951667,0.006858006,0.0005413196,0.00007014943,0.00017478927,0.00018943833,0.0172589],"genre_scores_gemma":[0.5911029,0.0017319142,0.38905144,0.0024034542,0.0013322339,0.00024541805,0.000493668,0.00046128276,0.0131777385],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99810946,0.0009262196,0.000093990195,0.00029915292,0.00038576312,0.00018539804],"domain_scores_gemma":[0.9947437,0.0036777095,0.0003291172,0.00046453395,0.00053205667,0.00025295155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052842833,0.0011500464,0.0019553264,0.00063471106,0.00080732047,0.0032642442,0.0019830263,0.004462945,0.0054959347],"category_scores_gemma":[0.024187524,0.000841991,0.00059624895,0.0009305669,0.0024042525,0.0060604624,0.0034851644,0.0051687364,0.000647484],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002755514,0.00009622015,0.0012734166,0.00048741285,0.00012118511,0.00050223945,0.00023134793,0.1276522,0.0023352397,0.80308294,0.012279301,0.051662963],"study_design_scores_gemma":[0.00003739965,0.00006364589,0.00021758332,0.00007792578,0.000016037215,0.00015779979,0.00006679465,0.6827603,0.0007504892,0.31359488,0.002237424,0.000019781724],"about_ca_topic_score_codex":0.002265848,"about_ca_topic_score_gemma":0.0021254295,"teacher_disagreement_score":0.0054959347,"about_ca_system_score_codex":0.00061137177,"about_ca_system_score_gemma":0.0020022793,"threshold_uncertainty_score":0.027946293},"labels":[],"label_agreement":null},{"id":"W4408578214","doi":"10.23952/jano.7.2025.1.07","title":"EDFM: An enhanced dual-branch fusion model for face deepfake detection","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Face recognition and analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Dual (grammatical number); Face (sociological concept); Computer science; Fusion; Artificial intelligence; Computer vision; Art; Linguistics","score_opus":0.008991893199281672,"score_gpt":0.2451783875524789,"score_spread":0.23618649435319722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408578214","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025913192,0.0008303073,0.9694876,0.00026690986,0.000088713874,0.000049017224,0.000108919055,0.0010870264,0.0021682947],"genre_scores_gemma":[0.7830787,0.0006601359,0.20451246,0.00058924983,0.00009303847,0.00013018138,0.00047194885,0.00011682788,0.010347403],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9997297,0.000034601297,0.000012748106,0.000076456476,0.000091218804,0.000055353234],"domain_scores_gemma":[0.9998061,0.000044205797,0.000019704137,0.000024193181,0.000090596855,0.000015296986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073712086,0.00086247094,0.0008571375,0.0006696015,0.0003107281,0.0005990892,0.001701482,0.0010572285,0.001961234],"category_scores_gemma":[0.0010237088,0.00033713723,0.0008917867,0.00038649075,0.00036600552,0.001212805,0.0010868483,0.0011833389,0.0006042125],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003188785,0.00018730084,0.002883815,0.00009916552,0.00017754332,0.00016125114,0.0000904512,0.4314346,0.021914685,0.007964668,0.0055063358,0.5292613],"study_design_scores_gemma":[0.0000030948013,0.000022857936,0.0001657906,0.000003667881,0.000009453245,0.000032631007,0.0000035794517,0.9960847,0.0020835225,0.001126816,0.0004592558,0.000004675351],"about_ca_topic_score_codex":0.0063680103,"about_ca_topic_score_gemma":0.0063492646,"teacher_disagreement_score":0.0063680103,"about_ca_system_score_codex":0.00079200993,"about_ca_system_score_gemma":0.00077538984,"threshold_uncertainty_score":0.012661874},"labels":[],"label_agreement":null},{"id":"W4408578220","doi":"10.23952/jano.7.2025.1.08","title":"A proximal bundle algorithm for a class of quasilinear variational inequalities of the second kind arising in the viscoplastic laminar flow","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Contact Mechanics and Variational Inequalities","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Viscoplasticity; Laminar flow; Variational inequality; Flow (mathematics); Class (philosophy); Mathematics; Bundle; Calculus (dental); Mathematical analysis; Applied mathematics; Computer science; Mechanics; Physics; Geometry; Artificial intelligence; Materials science; Constitutive equation; Thermodynamics","score_opus":0.011752327354552212,"score_gpt":0.24369754545445263,"score_spread":0.23194521809990043,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408578220","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013694323,0.000050023293,0.9978015,0.000059038946,0.00002093892,0.000030083515,0.000007799353,0.00007011356,0.0005910444],"genre_scores_gemma":[0.085113764,0.0001958302,0.91069347,0.000113609014,0.00006791167,0.00033948227,0.00008724165,0.00018163571,0.0032070088],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993222,0.00029015954,0.000029129755,0.00009694743,0.00020871681,0.000052788986],"domain_scores_gemma":[0.99897444,0.00057126407,0.00009142168,0.000079782,0.00018747298,0.0000956373],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018171292,0.0010421601,0.0012882462,0.00076470035,0.00074104423,0.0011196556,0.0014934771,0.0021849037,0.005131518],"category_scores_gemma":[0.003192345,0.0006497725,0.0011008731,0.0006949406,0.0013593088,0.0013178367,0.0020846555,0.0026379682,0.0011951533],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009912859,0.00014770441,0.0006159459,0.00025934947,0.00007997662,0.00018687636,0.00024493484,0.72546315,0.007492648,0.14377607,0.0033333655,0.11830082],"study_design_scores_gemma":[0.000007699979,0.00003672172,0.00003355056,0.0000080389445,0.000003212784,0.000019425464,0.000008283458,0.98937756,0.00038993207,0.0089346925,0.00117565,0.000005335832],"about_ca_topic_score_codex":0.0032382358,"about_ca_topic_score_gemma":0.00398064,"teacher_disagreement_score":0.005131518,"about_ca_system_score_codex":0.00093388266,"about_ca_system_score_gemma":0.00201655,"threshold_uncertainty_score":0.017166615},"labels":[],"label_agreement":null},{"id":"W4408578389","doi":"10.23952/jano.7.2025.1.02","title":"Numerical resolution of diffusion equations using a weakly monotone finite volume method on tetrahedral meshes","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Numerical Methods in Computational Mathematics","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Commission; Conseil départemental de la Marne","keywords":"Monotone polygon; Polygon mesh; Finite volume method; Tetrahedron; Finite volume method for one-dimensional steady state diffusion; Mathematics; Resolution (logic); Diffusion; Mathematical analysis; Geometry; Computer science; Physics; Mechanics; Partial differential equation; Thermodynamics; Numerical partial differential equations","score_opus":0.01864370862423988,"score_gpt":0.30303440432174084,"score_spread":0.284390695697501,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408578389","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0094048735,0.00012957706,0.9887673,0.00011135141,0.000049411654,0.00003150137,0.000023918628,0.000080243655,0.0014018024],"genre_scores_gemma":[0.2936469,0.0004581197,0.70217234,0.00014645932,0.000085086416,0.00024254552,0.00014727435,0.00010986141,0.002991351],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995703,0.00016069418,0.000027737291,0.000040103037,0.00017141667,0.000029700132],"domain_scores_gemma":[0.99931014,0.00038960588,0.00006958327,0.000059788697,0.00013093246,0.00004001273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079582626,0.00049903773,0.0007107056,0.00050659006,0.00042957664,0.00069527887,0.0012728379,0.0011898233,0.0009803085],"category_scores_gemma":[0.0020938243,0.0002714518,0.00089122186,0.0003398607,0.00076114555,0.0008057787,0.0011990446,0.0010730932,0.0003114304],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006477747,0.000044072232,0.00096069643,0.00019558174,0.00004111272,0.00023794523,0.00024119405,0.84978205,0.031963684,0.065039195,0.00084057916,0.050589193],"study_design_scores_gemma":[0.0000038410335,0.0000107111855,0.000029909283,0.00000582562,0.0000018415567,0.000028669487,0.000007450826,0.99466854,0.001370367,0.0029592055,0.00090924255,0.0000043964947],"about_ca_topic_score_codex":0.0018603553,"about_ca_topic_score_gemma":0.0012698802,"teacher_disagreement_score":0.0018603553,"about_ca_system_score_codex":0.0003745872,"about_ca_system_score_gemma":0.000906026,"threshold_uncertainty_score":0.004208803},"labels":[],"label_agreement":null},{"id":"W4408578410","doi":"10.23952/jano.7.2025.1.05","title":"Approximate weak and proper subdifferentials of the difference of two vector convex mappings and applications","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Regular polygon; Mathematics; Vector (molecular biology); Pure mathematics; Geometry; Biology","score_opus":0.006293103049162445,"score_gpt":0.2214991119194109,"score_spread":0.21520600887024846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408578410","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03343724,0.0006662404,0.961422,0.000264343,0.00008768969,0.00003651736,0.000053413798,0.000029917543,0.0040027066],"genre_scores_gemma":[0.684285,0.002199369,0.30460265,0.0002676139,0.00023831124,0.00018932454,0.00019566173,0.00012873951,0.0078933425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99860865,0.00047730352,0.00015256743,0.00023612559,0.00044776275,0.00007766831],"domain_scores_gemma":[0.997537,0.0011653798,0.00024279696,0.00024670677,0.0006510848,0.00015699444],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003741343,0.00089702517,0.0010661773,0.0015945093,0.00047754645,0.0015975708,0.00077013904,0.0009893294,0.0019157816],"category_scores_gemma":[0.011202592,0.00044990002,0.0010582317,0.0009011595,0.0024131897,0.004831331,0.0026290645,0.0026401344,0.00026976396],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000064513195,0.000023235474,0.00068981166,0.00014170649,0.000025965059,0.00011244811,0.00022020767,0.02661137,0.008046293,0.94134927,0.00040956237,0.02230565],"study_design_scores_gemma":[0.000015122482,0.00018720642,0.0006533349,0.000050094524,0.000025066745,0.0002682575,0.00014890864,0.51066387,0.0066069397,0.4761057,0.005241739,0.0000338749],"about_ca_topic_score_codex":0.00048960454,"about_ca_topic_score_gemma":0.0004407787,"teacher_disagreement_score":0.003741343,"about_ca_system_score_codex":0.0008205355,"about_ca_system_score_gemma":0.000718462,"threshold_uncertainty_score":0.019786298},"labels":[],"label_agreement":null},{"id":"W4412767561","doi":"10.23952/jano.7.2025.2.01","title":"Some notes about a relative order relation used in unsupervised deep learning","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Neural Networks and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Relation (database); Order (exchange); Artificial intelligence; Unsupervised learning; Psychology; Computer science; Natural language processing; Cognitive psychology; Data mining; Economics","score_opus":0.007976941909530213,"score_gpt":0.23676345695101397,"score_spread":0.22878651504148376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767561","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010551992,0.0048978887,0.92314696,0.011640514,0.0031918653,0.000054890486,0.0003490536,0.00026473746,0.0459021],"genre_scores_gemma":[0.3686118,0.008733404,0.5435752,0.007215207,0.008238591,0.00040417636,0.0006145745,0.0010421807,0.061564893],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974209,0.00087003096,0.00038167226,0.00046619723,0.00071849086,0.00014264451],"domain_scores_gemma":[0.9925613,0.0050332937,0.0003070625,0.0012589117,0.00067223574,0.00016730926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063419463,0.0008045791,0.001010219,0.0017804564,0.001960074,0.0029246649,0.0018242752,0.0020641063,0.007548945],"category_scores_gemma":[0.016636074,0.00073483156,0.001759637,0.0029433821,0.00753463,0.0121541405,0.0021462445,0.007403743,0.0013037025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000123945865,0.00000714049,0.00010779501,0.00004467947,0.000006684204,0.00003079388,0.00009651878,0.00083139236,0.00022060947,0.9895555,0.0017463964,0.007340088],"study_design_scores_gemma":[0.0000047661592,0.00002063135,0.000118117394,0.000026303176,0.000008854337,0.00005103202,0.000034030236,0.004538471,0.00062744215,0.9832086,0.011347201,0.000014652605],"about_ca_topic_score_codex":0.0027368092,"about_ca_topic_score_gemma":0.0027516899,"teacher_disagreement_score":0.007548945,"about_ca_system_score_codex":0.0020629584,"about_ca_system_score_gemma":0.00095127546,"threshold_uncertainty_score":0.03353983},"labels":[],"label_agreement":null},{"id":"W4412767575","doi":"10.23952/jano.7.2025.2.08","title":"An inertial extragradient algorithm with non-monotone step sizes for variational inequality problems and fixed point problems of nonexpansive semigroups","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Strong","keywords":"Variational inequality; Monotone polygon; Fixed point; Inertial frame of reference; Mathematics; Applied mathematics; Algorithm; Mathematical optimization; Mathematical analysis; Physics; Geometry","score_opus":0.006690705911487792,"score_gpt":0.22845132810469052,"score_spread":0.22176062219320272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767575","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.005588626,0.000064744985,0.993582,0.000047915517,0.000035573303,0.00002944864,0.000004205788,0.00007430911,0.00057310186],"genre_scores_gemma":[0.21092023,0.00015933985,0.78606445,0.00012575055,0.000090240545,0.00024951785,0.00005115457,0.00009963704,0.0022396795],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994611,0.00025609438,0.000036700534,0.000061481114,0.00014904086,0.000035532288],"domain_scores_gemma":[0.99919873,0.00043056282,0.00007565045,0.000086937805,0.00013564977,0.00007251266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016779285,0.0007961664,0.0008298347,0.0005018155,0.00032973185,0.00047260817,0.0013760817,0.00088423514,0.0016443728],"category_scores_gemma":[0.002890246,0.00034638122,0.0005607404,0.0002718398,0.0007462775,0.0011892748,0.0010450204,0.0013710557,0.00037256718],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028621498,0.00022173155,0.0011324687,0.00030082575,0.00008130627,0.00032070672,0.00030827828,0.6297956,0.02538402,0.16931565,0.0022488637,0.1706043],"study_design_scores_gemma":[0.000012963179,0.0000720177,0.000056586883,0.00000599199,0.0000031490886,0.00002459517,0.000005169045,0.9941658,0.0012429132,0.0035962213,0.0008080294,0.0000064402852],"about_ca_topic_score_codex":0.00081920583,"about_ca_topic_score_gemma":0.0010851114,"teacher_disagreement_score":0.0016779285,"about_ca_system_score_codex":0.0003446018,"about_ca_system_score_gemma":0.00068029785,"threshold_uncertainty_score":0.00887382},"labels":[],"label_agreement":null},{"id":"W4412767577","doi":"10.23952/jano.7.2025.2.03","title":"Strong convergence of an inertial Tseng’s extragradient algorithm for pseudomonotone variational inequalities with applications to optimal control problems","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Centre Scientifique et Technique du Bâtiment; Fundamental Research Funds for the Central Universities; Natural Science Foundation of Chongqing","keywords":"Variational inequality; Inertial frame of reference; Convergence (economics); Algorithm; Mathematics; Applied mathematics; Computer science; Physics; Economics","score_opus":0.00856190637897728,"score_gpt":0.24556300266634484,"score_spread":0.23700109628736757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008831406,0.00013241677,0.9893037,0.00012844926,0.00006445974,0.000038650014,0.000009924271,0.00007519825,0.0014158103],"genre_scores_gemma":[0.41043267,0.00050135225,0.58395284,0.00021073756,0.0001453075,0.0002971431,0.000092507544,0.00014067497,0.004226805],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994363,0.00022822472,0.00003882035,0.00006130769,0.00018689454,0.000048348382],"domain_scores_gemma":[0.99927,0.0003566889,0.000070304595,0.000062185994,0.00016983309,0.000070955335],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001723558,0.0009923237,0.0010618491,0.0006853218,0.00037194206,0.0007497836,0.0010109537,0.0010007299,0.0020140219],"category_scores_gemma":[0.003045933,0.00042061493,0.000844638,0.0004543536,0.0009091915,0.0012654136,0.0013940936,0.0012791003,0.00030030555],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026593616,0.00014516908,0.00084183173,0.00031104256,0.00009951923,0.0002547476,0.0001721046,0.77109474,0.014583619,0.1064405,0.0018483639,0.1039424],"study_design_scores_gemma":[0.000009418743,0.00003980352,0.000044466964,0.000004690352,0.0000026454757,0.000012469088,0.0000034757413,0.9962205,0.00071182364,0.0025098894,0.00043617727,0.000004532339],"about_ca_topic_score_codex":0.001628479,"about_ca_topic_score_gemma":0.0013866118,"teacher_disagreement_score":0.0020140219,"about_ca_system_score_codex":0.00052641233,"about_ca_system_score_gemma":0.0010660717,"threshold_uncertainty_score":0.0091151595},"labels":[],"label_agreement":null},{"id":"W4412767593","doi":"10.23952/jano.7.2025.2.02","title":"Solving an uncertain quadratic multiobjective optimization problem using Newton’s descent method via a robust optimization approach","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Multi-Criteria Decision Making","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Descent (aeronautics); Mathematical optimization; Multi-objective optimization; Robust optimization; Quadratic equation; Descent direction; Optimization problem; Newton's method; Quadratic programming; Computer science; Mathematics; Newton's method in optimization; Gradient descent; Iterative method; Engineering; Nonlinear system; Artificial intelligence; Local convergence; Artificial neural network","score_opus":0.09640393866883326,"score_gpt":0.395242406603361,"score_spread":0.29883846793452773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767593","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015304431,0.00012202204,0.9970745,0.00005644844,0.000014705513,0.000018480465,0.000009582841,0.00004420458,0.0011295256],"genre_scores_gemma":[0.15415235,0.0005523586,0.8406314,0.0001255127,0.00009100545,0.00031373432,0.00010800901,0.00008641635,0.003939133],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994448,0.00018686423,0.000033809883,0.00009133172,0.00021029958,0.000032881264],"domain_scores_gemma":[0.999421,0.00033995166,0.000073579955,0.000028724467,0.00011739153,0.000019324701],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012557738,0.0009856161,0.0010183322,0.0005931208,0.00040089514,0.00077364105,0.0008598882,0.0011670524,0.0016289955],"category_scores_gemma":[0.0016078226,0.000439205,0.001028279,0.0004790789,0.00054357795,0.00065669446,0.00084412785,0.0011867451,0.00044951163],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016972577,0.000021440255,0.00017316209,0.00014504028,0.00004021766,0.000066701694,0.000037843667,0.9559227,0.0029719395,0.010564603,0.00057093374,0.029468458],"study_design_scores_gemma":[0.0000024457704,0.000014599355,0.000028257227,0.000005002044,0.0000032862133,0.000011036369,0.0000027712622,0.9980106,0.00029972065,0.0010306892,0.00058819336,0.0000034524196],"about_ca_topic_score_codex":0.0036223168,"about_ca_topic_score_gemma":0.0025411001,"teacher_disagreement_score":0.0036223168,"about_ca_system_score_codex":0.00050823524,"about_ca_system_score_gemma":0.0012677901,"threshold_uncertainty_score":0.007202506},"labels":[],"label_agreement":null},{"id":"W4412767601","doi":"10.23952/jano.7.2025.2.04","title":"Calculus rules of generalized proper $\\epsilon$-subdifferential for vector valued mappings and applications","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subderivative; Calculus (dental); Mathematics; Pure mathematics; Geometry; Medicine; Regular polygon; Orthodontics","score_opus":0.007807725067741243,"score_gpt":0.2367515569242589,"score_spread":0.22894383185651765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011774958,0.00089727883,0.97454417,0.00037642437,0.00021472473,0.000064804684,0.00006791867,0.000044990466,0.012014724],"genre_scores_gemma":[0.3703099,0.0025218376,0.6109822,0.00055102987,0.00046529344,0.0004804007,0.00017018322,0.0002188902,0.014300264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99820006,0.0004997582,0.00019064582,0.00037965446,0.0006262761,0.00010362457],"domain_scores_gemma":[0.99849343,0.0006691731,0.00010417937,0.00016181322,0.0004655563,0.000105897394],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0044512083,0.00069839705,0.0008435312,0.0014533285,0.0010014714,0.0018225809,0.001054597,0.0009120848,0.0025109488],"category_scores_gemma":[0.0056629255,0.0003880585,0.0014924571,0.001010777,0.002922423,0.003269116,0.0022592677,0.0031102072,0.00039181966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00000677995,0.000010451318,0.00014690806,0.000034876717,0.000008708203,0.00011171177,0.00012801761,0.0029434196,0.001074044,0.98570085,0.0005192908,0.009314963],"study_design_scores_gemma":[0.000012805084,0.000030400024,0.00022489543,0.000031157055,0.000013481583,0.00031288352,0.00005136077,0.077018626,0.001429095,0.9112737,0.009579044,0.000022575701],"about_ca_topic_score_codex":0.0009879133,"about_ca_topic_score_gemma":0.0010229421,"teacher_disagreement_score":0.0044512083,"about_ca_system_score_codex":0.0010831702,"about_ca_system_score_gemma":0.00097168586,"threshold_uncertainty_score":0.023540556},"labels":[],"label_agreement":null},{"id":"W4412767614","doi":"10.23952/jano.7.2025.2.07","title":"Inertial four-operator splitting algorithms for solving monotone inclusion problems","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Operator splitting; Monotone polygon; Inclusion (mineral); Algorithm; Operator (biology); Inertial frame of reference; Mathematics; Pseudo-monotone operator; Computer science; Algebra over a field; Mathematical optimization; Applied mathematics; Discrete mathematics; Pure mathematics; Physics; Finite-rank operator; Geometry; Classical mechanics; Banach space","score_opus":0.010461112262936785,"score_gpt":0.2437397940667266,"score_spread":0.23327868180378983,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767614","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.020458564,0.00016790225,0.9736511,0.00016431951,0.00011431347,0.000066071036,0.00003263668,0.00022307143,0.005122131],"genre_scores_gemma":[0.34148833,0.00024284325,0.65022296,0.00020689337,0.000111063884,0.0003921394,0.00016594965,0.00032695537,0.006842924],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995776,0.00014971971,0.000028412362,0.000039879604,0.0001499758,0.000054485314],"domain_scores_gemma":[0.9986652,0.00067514856,0.00009062691,0.00015792415,0.00027032575,0.00014076385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001537218,0.0008824087,0.0009423888,0.0008690171,0.00073966,0.0008666707,0.0018368965,0.0012274191,0.005320385],"category_scores_gemma":[0.0036907273,0.0004559635,0.00074540894,0.00075881643,0.0011868695,0.001623174,0.0027049684,0.0022650268,0.00074514234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006673235,0.0003765636,0.0011309402,0.0003043635,0.00010954917,0.00017542405,0.00064542633,0.47371036,0.0138272345,0.2670705,0.004691403,0.23729084],"study_design_scores_gemma":[0.00002939852,0.000059434176,0.00006986668,0.000010296071,0.000006039797,0.000012893542,0.000031555865,0.9661632,0.0008513537,0.031706993,0.0010511151,0.000007906402],"about_ca_topic_score_codex":0.0021309815,"about_ca_topic_score_gemma":0.0026488702,"teacher_disagreement_score":0.005320385,"about_ca_system_score_codex":0.00059038785,"about_ca_system_score_gemma":0.0011456454,"threshold_uncertainty_score":0.017798483},"labels":[],"label_agreement":null},{"id":"W4412767618","doi":"10.23952/jano.7.2025.2.05","title":"Sequential approximate solutions for robust fractional optimization problems","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Applied mathematics; Mathematics; Computer science","score_opus":0.018128478474513612,"score_gpt":0.23547929365608897,"score_spread":0.21735081518157534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767618","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018095134,0.00009916298,0.9784279,0.000116796524,0.000017974453,0.000025973515,0.000024157142,0.00003097487,0.0031619582],"genre_scores_gemma":[0.73889846,0.00046220885,0.25485328,0.00012940224,0.00006767688,0.00025623792,0.00013438184,0.0000907885,0.005107623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922276,0.00030517246,0.00005242029,0.00009160379,0.0002717508,0.00005639156],"domain_scores_gemma":[0.99858034,0.0008224549,0.00023302308,0.00011146512,0.00021260542,0.00004008128],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018779151,0.0007346334,0.0008298797,0.0005758936,0.00036301618,0.0008208878,0.00046911646,0.0007385594,0.0027675668],"category_scores_gemma":[0.0053883004,0.00034295226,0.0006286372,0.00053045695,0.0011999798,0.0013446292,0.0013536059,0.00092141517,0.00029637304],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011151584,0.000040264295,0.00047319103,0.00016913081,0.000039246857,0.00015514647,0.00012419485,0.5192259,0.012056872,0.43777236,0.0007169229,0.029115321],"study_design_scores_gemma":[0.000011333286,0.00006667209,0.0000872943,0.000013284661,0.0000053661724,0.000030970616,0.00001690424,0.91904014,0.0027933978,0.07666702,0.0012616366,0.0000060018324],"about_ca_topic_score_codex":0.0008754728,"about_ca_topic_score_gemma":0.00082332024,"teacher_disagreement_score":0.0027675668,"about_ca_system_score_codex":0.0006786553,"about_ca_system_score_gemma":0.0008763324,"threshold_uncertainty_score":0.009931505},"labels":[],"label_agreement":null},{"id":"W4412767620","doi":"10.23952/jano.7.2025.2.06","title":"On approximate efficient solutions of nonsmooth minimax programming problems involving inequality and equality constraints with applications","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Minimax; Inequality; Mathematical optimization; Mathematics; Mathematical economics; Applied mathematics; Mathematical analysis","score_opus":0.013837618799269535,"score_gpt":0.2451002029475536,"score_spread":0.23126258414828407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015597846,0.0013062956,0.9754505,0.00035035645,0.0000984159,0.000048711878,0.000040918163,0.000041658048,0.00706526],"genre_scores_gemma":[0.6299753,0.00401904,0.34966063,0.00038750382,0.00029701059,0.00044309732,0.00022376988,0.00020951904,0.014784028],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99952626,0.00026337244,0.000020560672,0.00005509993,0.00009699812,0.000037726666],"domain_scores_gemma":[0.9988657,0.00085429224,0.00006678291,0.000054269683,0.0001276778,0.00003133056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019223097,0.000972424,0.0012615968,0.0006359845,0.000422054,0.0011180349,0.0006209849,0.00081560994,0.0035218236],"category_scores_gemma":[0.004038918,0.00044788586,0.0005891229,0.0007807189,0.0010020856,0.0015212985,0.0012877691,0.001391303,0.0003352498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011751732,0.000091678514,0.00033352428,0.00038521682,0.00007282829,0.00009785054,0.00012677324,0.49099228,0.005854008,0.44607988,0.002754189,0.053094223],"study_design_scores_gemma":[0.0000088954375,0.000046997757,0.00009957028,0.000025909936,0.000006724741,0.00002469711,0.000022056813,0.9326703,0.0007814075,0.06457824,0.0017299579,0.0000053334948],"about_ca_topic_score_codex":0.0007699314,"about_ca_topic_score_gemma":0.00073592446,"teacher_disagreement_score":0.0035218236,"about_ca_system_score_codex":0.00049012335,"about_ca_system_score_gemma":0.000893126,"threshold_uncertainty_score":0.0117816925},"labels":[],"label_agreement":null},{"id":"W7105885683","doi":"10.23952/jano.7.2025.3.05","title":"Parametric analysis of objective function coefficients and right-hand-side parameters of linear programming models across the entire feasible range","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Range (aeronautics); Linear programming; Function (biology); Parametric statistics; Linear model; Linear-fractional programming","score_opus":0.023831044428219275,"score_gpt":0.3255235906922811,"score_spread":0.30169254626406183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105885683","genre_codex":"empirical","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6387663,0.0006258969,0.34810534,0.00049642066,0.000022568858,0.00006598654,0.00029911456,0.00027611307,0.011342324],"genre_scores_gemma":[0.9917361,0.00011593506,0.0073643704,0.000014934895,0.0000040179743,0.000046585523,0.00009357903,0.00004277844,0.0005816955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885607,0.00055315916,0.00003802135,0.0001582832,0.0002416677,0.00015276294],"domain_scores_gemma":[0.9825844,0.014523129,0.0010221465,0.0011838847,0.0005795025,0.00010698164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036378598,0.00070589554,0.00070589985,0.00086458016,0.00031361496,0.0012838049,0.001149893,0.0010375095,0.0016885832],"category_scores_gemma":[0.03107414,0.00069375127,0.00091297424,0.00096953847,0.0011035374,0.0020449385,0.0011558881,0.0019084703,0.00015880511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019393997,0.000107919754,0.0016054111,0.000100720725,0.00004388286,0.00009478923,0.0001284469,0.9669329,0.0035047329,0.008209613,0.00029515257,0.018782444],"study_design_scores_gemma":[0.000006674552,0.00008518619,0.0021893228,0.000022090402,0.000026848187,0.000055984183,0.000061178696,0.99043894,0.002303943,0.0045444923,0.00024174018,0.000023443772],"about_ca_topic_score_codex":0.0021416426,"about_ca_topic_score_gemma":0.0015413985,"teacher_disagreement_score":0.0036378598,"about_ca_system_score_codex":0.000392614,"about_ca_system_score_gemma":0.0009328573,"threshold_uncertainty_score":0.019239128},"labels":[],"label_agreement":null},{"id":"W7105897877","doi":"10.23952/jano.7.2025.3.08","title":"A line decomposition algorithm for multiobjective optimization","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Multi-objective optimization; Line (geometry); Decomposition; Minification; Optimization algorithm; Genetic algorithm","score_opus":0.00808009215581886,"score_gpt":0.28741063485751495,"score_spread":0.2793305427016961,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105897877","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00037644213,0.000060726117,0.9982681,0.00003144762,0.000019139527,0.000026595671,0.000036738307,0.00031668332,0.0008640925],"genre_scores_gemma":[0.01725223,0.00011347958,0.9800576,0.00006581087,0.000018210003,0.0002759418,0.00022518211,0.0002690103,0.001722575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992355,0.00024592053,0.000049995677,0.00011274955,0.00029810044,0.00005766938],"domain_scores_gemma":[0.9991585,0.00035428136,0.00006398102,0.00009333647,0.00028693507,0.000042994416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010619431,0.0015565709,0.0010813233,0.0008507886,0.00059855555,0.0012192403,0.0011659319,0.0014622785,0.009508123],"category_scores_gemma":[0.002386721,0.0005996078,0.0012437096,0.0010497691,0.0006033985,0.0008773629,0.0013857768,0.0024151315,0.0040591834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000641472,0.00008678536,0.00038011812,0.00025140576,0.00008266047,0.00010165617,0.0000940949,0.69258416,0.0061167856,0.035746083,0.011709473,0.25278267],"study_design_scores_gemma":[0.00001885818,0.000023993476,0.000052365653,0.000024304447,0.0000062451018,0.000037114965,0.0000105130575,0.98085105,0.0012503904,0.009918328,0.0077968435,0.000009953572],"about_ca_topic_score_codex":0.0027884434,"about_ca_topic_score_gemma":0.0026302263,"teacher_disagreement_score":0.009508123,"about_ca_system_score_codex":0.0007388463,"about_ca_system_score_gemma":0.0013516581,"threshold_uncertainty_score":0.0318079},"labels":[],"label_agreement":null},{"id":"W7105903772","doi":"10.23952/jano.7.2025.3.04","title":"Robust contextual bandit method for optimal loan offering","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Loan; Context (archaeology); Term (time); Production (economics); Robustness (evolution)","score_opus":0.058461756882175794,"score_gpt":0.38796934007498757,"score_spread":0.32950758319281176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105903772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010718433,0.00044034907,0.9852889,0.00042055626,0.00004751413,0.00007114306,0.00014861519,0.00041430135,0.0024501546],"genre_scores_gemma":[0.72067463,0.0007142162,0.27062333,0.00050829607,0.00019450866,0.00044682005,0.00066769955,0.00019900281,0.005971532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983537,0.0008630769,0.0000706843,0.00027407412,0.00024279143,0.00019565741],"domain_scores_gemma":[0.9957054,0.0032754652,0.0003317739,0.0002545507,0.0003171139,0.000115658026],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037970322,0.0011453802,0.002207102,0.00092121767,0.0005883757,0.0017061504,0.0016207951,0.0019696634,0.006970569],"category_scores_gemma":[0.012110143,0.0006637087,0.00089049956,0.0010602499,0.0012671914,0.0016491895,0.0015490856,0.0023443096,0.001514105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020745263,0.00006380226,0.0010440524,0.000100257574,0.000075756085,0.00006622375,0.00007671086,0.9052199,0.0006225541,0.04575256,0.0016149287,0.045155697],"study_design_scores_gemma":[0.000009464608,0.0000142286835,0.00007724004,0.000009656169,0.000008135087,0.0000049519945,0.0000069125726,0.9877891,0.00014119605,0.011605701,0.00032824746,0.0000051273264],"about_ca_topic_score_codex":0.0061198333,"about_ca_topic_score_gemma":0.0047210436,"teacher_disagreement_score":0.006970569,"about_ca_system_score_codex":0.0011405222,"about_ca_system_score_gemma":0.0018171524,"threshold_uncertainty_score":0.023318827},"labels":[],"label_agreement":null},{"id":"W7105913978","doi":"10.23952/jano.7.2025.3.07","title":"Variable Bregman majorization-minimization algorithm and its application to Dirichlet maximum likelihood estimation","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Bayesian Methods and Mixture Models","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Berlin Mathematics Research Center MATH+; Deutsche Forschungsgemeinschaft","keywords":"Maximum likelihood; Variable (mathematics); Expectation–maximization algorithm; Estimation; Dirichlet distribution; Estimation theory; Maximum likelihood sequence estimation","score_opus":0.00387340013188319,"score_gpt":0.2353775001156472,"score_spread":0.231504099983764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105913978","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007991299,0.00008839624,0.99862206,0.00010662937,0.000012499289,0.000011609316,0.000007462656,0.000095941505,0.00025616065],"genre_scores_gemma":[0.060040746,0.00031689377,0.93599164,0.00019037585,0.00006829168,0.0002266933,0.00011480712,0.00024623008,0.0028042842],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979184,0.0011628757,0.00007699247,0.00028694238,0.00044149777,0.00011337828],"domain_scores_gemma":[0.9975473,0.0014823129,0.00017772517,0.00023768743,0.0004544214,0.00010053096],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003605802,0.0010388681,0.0014852174,0.0011950874,0.00081408536,0.0015271069,0.002841137,0.0024565402,0.0024094493],"category_scores_gemma":[0.01064817,0.0009747773,0.0011574946,0.001410382,0.0019979759,0.0019494309,0.002969554,0.002784817,0.0012852375],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001344004,0.00005624989,0.0006042792,0.00020061384,0.00009646106,0.00013999802,0.00027658333,0.6997423,0.0063108164,0.14902203,0.0046607056,0.13875557],"study_design_scores_gemma":[0.000012030672,0.000016920481,0.000051924177,0.000012444878,0.0000058932733,0.000043591474,0.000009189527,0.9706388,0.0012802292,0.025855888,0.0020576636,0.0000154103],"about_ca_topic_score_codex":0.003110772,"about_ca_topic_score_gemma":0.003044927,"teacher_disagreement_score":0.003605802,"about_ca_system_score_codex":0.001292764,"about_ca_system_score_gemma":0.0022976308,"threshold_uncertainty_score":0.019069493},"labels":[],"label_agreement":null},{"id":"W7105919186","doi":"10.23952/jano.7.2025.3.09","title":"A discontinuous Galerkin method for optimal control of the obstacle problem","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Spacecraft Dynamics and Control","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Air Force Office of Scientific Research; Office of Naval Research; National Science Foundation","keywords":"Optimal control; Obstacle problem; Discontinuous Galerkin method; Control theory (sociology); Obstacle; Control (management)","score_opus":0.0027896785257708425,"score_gpt":0.21483868428033626,"score_spread":0.21204900575456542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105919186","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004020784,0.00019459285,0.99435353,0.000074768526,0.000032718133,0.000013004164,0.000012322562,0.000036861038,0.0012614777],"genre_scores_gemma":[0.4532661,0.00077493343,0.53776735,0.00016789103,0.00011836404,0.00024862168,0.00011235793,0.00014961575,0.0073947483],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996778,0.00012235732,0.000008657311,0.000032235275,0.00013772742,0.000021129123],"domain_scores_gemma":[0.9996953,0.00018533682,0.000027438156,0.000020624091,0.000046753754,0.000024662228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007986492,0.00058644055,0.00063657726,0.0004364251,0.00025244872,0.00053037883,0.00060542015,0.0006473282,0.0011904985],"category_scores_gemma":[0.0010627412,0.00023561699,0.00043426605,0.0002321468,0.0009269349,0.00053561176,0.001092294,0.001233389,0.00022044718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013840613,0.000074965035,0.00037027503,0.00035535285,0.000041281386,0.00010829591,0.00014352254,0.73032373,0.021356413,0.1808109,0.0014141358,0.06486273],"study_design_scores_gemma":[0.000008028651,0.000032289867,0.000051479372,0.000009513749,0.000003077806,0.000015962096,0.000004249127,0.9873043,0.000891355,0.009625817,0.0020476282,0.000006272141],"about_ca_topic_score_codex":0.0007476406,"about_ca_topic_score_gemma":0.0005706004,"teacher_disagreement_score":0.0011904985,"about_ca_system_score_codex":0.00034989312,"about_ca_system_score_gemma":0.00068564946,"threshold_uncertainty_score":0.0042237043},"labels":[],"label_agreement":null},{"id":"W7105920295","doi":"10.23952/jano.7.2025.3.01","title":"Editorial: Special issue on recent trends in optimization models and algorithms, dedicated to Tamás Terlaky on the occasion of his 70th birthday","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Division of Mathematical Sciences; Magyar Tudományos Akadémia","keywords":"Work (physics)","score_opus":0.024562234204166852,"score_gpt":0.32084547849776884,"score_spread":0.296283244293602,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105920295","genre_codex":"editorial","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000035538582,0.0036712782,0.00019068448,0.014127478,0.98114806,0.000012029686,0.00005579759,0.000041556737,0.00071760133],"genre_scores_gemma":[0.0002619481,0.002282442,0.0000809575,0.0034981999,0.9908817,0.000008554555,0.00002396061,0.000028584942,0.0029336808],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9961578,0.0005146372,0.00050876575,0.0007595893,0.0017327686,0.00032638057],"domain_scores_gemma":[0.97735536,0.008272717,0.0017599533,0.00060040486,0.0088173235,0.0031941207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052331067,0.0051675057,0.0055844807,0.0043206536,0.0022690583,0.009304372,0.003421917,0.009785677,0.024881672],"category_scores_gemma":[0.024342857,0.0012625686,0.0034778505,0.0015435669,0.0020069813,0.0041109305,0.0012248678,0.014049557,0.01441542],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006739503,0.000016984433,0.00003101491,0.00024902783,0.00003043427,0.000067682806,0.0000059985464,0.000055640387,0.000108498156,0.00038856053,0.9950771,0.0039018064],"study_design_scores_gemma":[0.00016887096,0.00011296286,0.0006438754,0.0005840598,0.00016070438,0.00048563688,0.0000410744,0.0007137093,0.00041174667,0.002851996,0.99378705,0.00003826095],"about_ca_topic_score_codex":0.0007732895,"about_ca_topic_score_gemma":0.0019663293,"teacher_disagreement_score":0.024881672,"about_ca_system_score_codex":0.0022345337,"about_ca_system_score_gemma":0.0021465672,"threshold_uncertainty_score":0.08323747},"labels":[],"label_agreement":null},{"id":"W7105922355","doi":"10.23952/jano.7.2025.3.06","title":"Shapes optimising grand resistance tensor entries for a rigid body in a Stokes flow","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Fluid dynamics and aerodynamics studies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Precursory Research for Embryonic Science and Technology; Division of Mathematical Sciences; Agence Nationale de la Recherche; Research Institute for Mathematical Sciences; Japan Society for the Promotion of Science; Conseil Régional des Pays de la Loire","keywords":"Rigid body; Flow (mathematics); Tensor (intrinsic definition); Rigid frame; Slender-body theory; Work (physics)","score_opus":0.0029994526866474903,"score_gpt":0.1978273344150963,"score_spread":0.1948278817284488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105922355","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36891618,0.00037622085,0.6174096,0.000566196,0.000079155914,0.00012225908,0.00011094405,0.00044966204,0.011969738],"genre_scores_gemma":[0.79571146,0.0002123004,0.19929603,0.00012656958,0.000027570155,0.0001456447,0.00011697235,0.00046421777,0.0038991328],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99979,0.000063941035,0.000010272772,0.00003996172,0.000054100805,0.00004175255],"domain_scores_gemma":[0.9992387,0.00036531914,0.00012421928,0.00006958653,0.00009953571,0.00010249952],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010542208,0.0011163928,0.0009536112,0.00085363066,0.00044172237,0.0013558497,0.0006053186,0.0013738745,0.0019782241],"category_scores_gemma":[0.002753246,0.0005656416,0.00065295654,0.0003199476,0.0012731962,0.0009660881,0.0010264115,0.0006444403,0.0006293623],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002134134,0.00010601264,0.00078780594,0.000112277805,0.00002644151,0.00017000671,0.00014879502,0.9241749,0.02256348,0.024347695,0.0009588922,0.026390322],"study_design_scores_gemma":[0.000018046687,0.00008185355,0.00015761051,0.000013484298,0.0000093029985,0.00003398368,0.00003762555,0.98889166,0.0030894831,0.0071052485,0.0005450082,0.000016636266],"about_ca_topic_score_codex":0.0010939466,"about_ca_topic_score_gemma":0.0013623759,"teacher_disagreement_score":0.0019782241,"about_ca_system_score_codex":0.00092688145,"about_ca_system_score_gemma":0.000930102,"threshold_uncertainty_score":0.0067250133},"labels":[],"label_agreement":null},{"id":"W7105930757","doi":"10.23952/jano.7.2025.3.03","title":"The topological derivative method for optimum shape design and control of gas networks","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Integrated Energy Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Topology (electrical circuits); Derivative (finance); Stability (learning theory); Control (management); Control theory (sociology); Class (philosophy)","score_opus":0.007485976795924486,"score_gpt":0.23926651230225848,"score_spread":0.23178053550633398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105930757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020517777,0.00026025853,0.99482995,0.00006871376,0.000034282824,0.0000232288,0.000018881026,0.00005156199,0.0026612885],"genre_scores_gemma":[0.3802656,0.0013452566,0.60926634,0.00019392636,0.00010480765,0.0004970427,0.00018007892,0.00035390383,0.007793169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995608,0.00017455469,0.000017425937,0.000056626286,0.00016272723,0.000027812757],"domain_scores_gemma":[0.9994973,0.0002865701,0.000051697985,0.00004711898,0.0000945676,0.000022674674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013552868,0.0010836073,0.0008538711,0.0009489328,0.00036907117,0.00088024884,0.00083227333,0.0010652036,0.0022179352],"category_scores_gemma":[0.002009266,0.0004988917,0.0009448684,0.000722604,0.0011943164,0.0010614399,0.0009951651,0.0013219683,0.00043071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004516692,0.000030464276,0.00017106399,0.00016671544,0.000027297481,0.0000511179,0.000055409957,0.8047239,0.0054209586,0.15335181,0.0009501892,0.0350059],"study_design_scores_gemma":[0.000005869737,0.00002747041,0.000030663112,0.000008722693,0.0000042158626,0.0000125255565,0.000003946464,0.9811441,0.0006355545,0.0158978,0.0022223147,0.0000069207003],"about_ca_topic_score_codex":0.0013106769,"about_ca_topic_score_gemma":0.0010387216,"teacher_disagreement_score":0.0022179352,"about_ca_system_score_codex":0.0010809386,"about_ca_system_score_gemma":0.0010132804,"threshold_uncertainty_score":0.007842839},"labels":[],"label_agreement":null},{"id":"W7105933270","doi":"10.23952/jano.7.2025.3.02","title":"Towards robust adversarial examples for deep neural networks","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Adversarial Robustness in Machine Learning","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Adversarial system; Artificial neural network; Deep learning; Deep neural networks; Key (lock); Feature (linguistics)","score_opus":0.010413139310401167,"score_gpt":0.24417596679944667,"score_spread":0.2337628274890455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7105933270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00544674,0.000109799126,0.99308664,0.00009694176,0.00002470173,0.000025018853,0.000018197452,0.0002766625,0.000915231],"genre_scores_gemma":[0.522984,0.00031683923,0.4711274,0.0003080645,0.000115641196,0.00023541202,0.00020971091,0.00037067133,0.0043322546],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983935,0.000651254,0.00006910223,0.00019584724,0.00057436415,0.00011591122],"domain_scores_gemma":[0.9963541,0.0023176188,0.00033617805,0.00050074863,0.000367415,0.0001239909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003010972,0.0015401352,0.001115393,0.0009399734,0.00038209895,0.0010067131,0.0015973503,0.0015766511,0.0022413468],"category_scores_gemma":[0.01049256,0.0006362497,0.0010545363,0.00040906316,0.002149838,0.0018267897,0.0035984053,0.0030735633,0.0005792751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008198295,0.000017965916,0.00020129673,0.00004625451,0.0000335176,0.0000497985,0.000031634358,0.93125516,0.0019378678,0.044240825,0.00060232,0.021501362],"study_design_scores_gemma":[0.000002983523,0.00001528812,0.000017615104,0.0000052728674,0.0000018849855,0.000010313774,0.0000021286396,0.98718226,0.00077047,0.01171245,0.00027604398,0.0000033193041],"about_ca_topic_score_codex":0.00087731786,"about_ca_topic_score_gemma":0.00074175856,"teacher_disagreement_score":0.003010972,"about_ca_system_score_codex":0.0009886675,"about_ca_system_score_gemma":0.00054703385,"threshold_uncertainty_score":0.015923738},"labels":[],"label_agreement":null},{"id":"W7142732056","doi":"10.23952/jano.8.2026.1.04","title":"Primal-dual resampling for solution validation in convex stochastic programming","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Resampling; Convex optimization; Regular polygon; Measure (data warehouse); Linear programming","score_opus":0.03453323664915676,"score_gpt":0.3424886123195521,"score_spread":0.3079553756703953,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7142732056","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010936341,0.0005557524,0.9863028,0.00031802972,0.00013195543,0.00013563744,0.00007917428,0.00066801684,0.00087235024],"genre_scores_gemma":[0.3642805,0.00048840203,0.629692,0.0005637773,0.00023859792,0.0007927615,0.00081796944,0.0007234365,0.002402524],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99201936,0.005774985,0.0003055908,0.0005460548,0.0010407546,0.00031322634],"domain_scores_gemma":[0.95545703,0.03473812,0.0012470904,0.003142859,0.0045251558,0.00088978524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.02659154,0.0019277537,0.0033524607,0.002194753,0.0015018601,0.0021066254,0.0033069865,0.0038812137,0.0040289555],"category_scores_gemma":[0.0703474,0.0017719301,0.00194952,0.00093775993,0.0028047652,0.0021980926,0.0039069904,0.0054713474,0.0008747689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008422459,0.0005445424,0.0025181845,0.00046706214,0.00036209723,0.0001479652,0.00015788774,0.8170279,0.0024878453,0.04861355,0.005066091,0.12176463],"study_design_scores_gemma":[0.000021672788,0.0000284784,0.00008455731,0.000019753465,0.000009248846,0.000010684025,0.000006959445,0.9955461,0.00043534092,0.0036221093,0.0002093043,0.0000057942857],"about_ca_topic_score_codex":0.0056808386,"about_ca_topic_score_gemma":0.005687781,"teacher_disagreement_score":0.02659154,"about_ca_system_score_codex":0.0018129918,"about_ca_system_score_gemma":0.0040937695,"threshold_uncertainty_score":0.1406312},"labels":[],"label_agreement":null},{"id":"W7142763955","doi":"10.23952/jano.8.2026.1.02","title":"Some results and conjectures related to Frankl’s union closed conjecture","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Limits and Structures in Graph Theory","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conjecture; Finite set; Set (abstract data type); Existential quantification; Family of sets; Element (criminal law)","score_opus":0.005598809760703863,"score_gpt":0.2518934061996613,"score_spread":0.2462945964389574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7142763955","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37870702,0.013255453,0.33532867,0.039296612,0.0010474295,0.00016632226,0.0015373523,0.000943097,0.2297181],"genre_scores_gemma":[0.89829373,0.0050365245,0.077063166,0.0033536127,0.0014939205,0.00021924515,0.0014016154,0.00024537343,0.012892822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.995331,0.0012761496,0.00027645944,0.0012269615,0.0013205844,0.0005688145],"domain_scores_gemma":[0.9701928,0.021416632,0.0020825376,0.0031765418,0.00211682,0.0010147243],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005885553,0.0006416108,0.0012389927,0.0027283553,0.004363474,0.00378449,0.0021315152,0.0027653885,0.0068948083],"category_scores_gemma":[0.02943915,0.0008095919,0.0013341149,0.0031875356,0.009056749,0.019499477,0.0029234388,0.003599845,0.001213729],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021607392,0.00018161339,0.0034453894,0.00028194443,0.000026632742,0.00040975361,0.0014206731,0.005482336,0.0016273316,0.948594,0.01211222,0.02620209],"study_design_scores_gemma":[0.00003461223,0.000047450747,0.0008455203,0.00006094935,0.000015446207,0.00033126166,0.0004365377,0.010707885,0.0019077213,0.97502375,0.010554399,0.000034429322],"about_ca_topic_score_codex":0.0021450978,"about_ca_topic_score_gemma":0.0011565584,"teacher_disagreement_score":0.0068948083,"about_ca_system_score_codex":0.002581803,"about_ca_system_score_gemma":0.0011554247,"threshold_uncertainty_score":0.031126142},"labels":[],"label_agreement":null},{"id":"W7142787166","doi":"10.23952/jano.8.2026.1.06","title":"Necessary condition of weak Nash equilibrium","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"","score_opus":0.009361214195226581,"score_gpt":0.21683565358614956,"score_spread":0.20747443939092297,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7142787166","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16062076,0.0020706397,0.5924091,0.01142962,0.0011169779,0.00053694355,0.0021328167,0.00046085077,0.22922228],"genre_scores_gemma":[0.93430907,0.0018702169,0.03872552,0.0011637409,0.0007443091,0.00076757866,0.0008330931,0.00020535584,0.02138111],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981274,0.00063372107,0.0001215121,0.00035269168,0.0004131366,0.00035161764],"domain_scores_gemma":[0.9886326,0.0067474423,0.00073830615,0.00045749376,0.0025291098,0.0008949118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027435527,0.001281053,0.0024268588,0.0023118244,0.0019802556,0.0030045244,0.002360039,0.0025187645,0.018392202],"category_scores_gemma":[0.022411542,0.0009264585,0.0016031655,0.0012578892,0.0036627878,0.0054325676,0.003435367,0.0035104891,0.0019473945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001257104,0.00006890056,0.0005855183,0.00023404676,0.00006051679,0.00026988966,0.00020124916,0.012800682,0.003041149,0.9744118,0.004546633,0.0036539235],"study_design_scores_gemma":[0.00007383742,0.00005658414,0.00043366716,0.000057868565,0.000033123575,0.00017200198,0.00017495707,0.07586524,0.0009652353,0.9194689,0.0026613907,0.00003728196],"about_ca_topic_score_codex":0.002574916,"about_ca_topic_score_gemma":0.0017154792,"teacher_disagreement_score":0.018392202,"about_ca_system_score_codex":0.0014969513,"about_ca_system_score_gemma":0.0035979948,"threshold_uncertainty_score":0.061528027},"labels":[],"label_agreement":null},{"id":"W7142805799","doi":"10.23952/jano.8.2026.1.07","title":"A primal alternating direction method of multipliers for the cost-sensitive constrained Lasso problem","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Numerical methods in inverse problems","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lasso (programming language); Minification; Feature (linguistics); Constraint (computer-aided design); Lagrange multiplier","score_opus":0.026376547082648125,"score_gpt":0.342131413434936,"score_spread":0.3157548663522879,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7142805799","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00061469106,0.00014182221,0.9980611,0.0001517881,0.000084608415,0.000028554647,0.000035524565,0.000093872324,0.00078795454],"genre_scores_gemma":[0.032521494,0.00043262306,0.96065843,0.00031895,0.000339779,0.000378598,0.00027427956,0.00035933568,0.0047164042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855286,0.00082008267,0.00005126357,0.00015538327,0.0003625557,0.000057825753],"domain_scores_gemma":[0.9976465,0.0014897593,0.00014104185,0.00016842164,0.000415445,0.0001388446],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029964535,0.0014780184,0.0017633414,0.0006926641,0.00055419985,0.0014808169,0.0018530673,0.002716565,0.0067305528],"category_scores_gemma":[0.008389382,0.00091379526,0.0010529065,0.0009076907,0.0010878562,0.0017298443,0.0027768512,0.004281478,0.0022115242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004183738,0.00027559037,0.0005215766,0.0007340123,0.00020585225,0.00026577126,0.00021181234,0.5256482,0.012374503,0.17287828,0.028641235,0.2578249],"study_design_scores_gemma":[0.000027173692,0.000044504308,0.000036880483,0.000023825185,0.000011226585,0.000053865468,0.000007568448,0.98223877,0.0005373338,0.013638828,0.0033647225,0.000015341046],"about_ca_topic_score_codex":0.0011165928,"about_ca_topic_score_gemma":0.0014976042,"teacher_disagreement_score":0.0067305528,"about_ca_system_score_codex":0.00047097183,"about_ca_system_score_gemma":0.0021200236,"threshold_uncertainty_score":0.022515953},"labels":[],"label_agreement":null},{"id":"W7142837718","doi":"10.23952/jano.8.2026.1.01","title":"Stochastic optimization approach for predicting horse racing outcomes","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Veterinary Equine Medical Research","field":"Veterinary","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Flexibility (engineering); Quantile; Stochastic modelling; Conditional probability distribution; Nonlinear system; Function (biology); Stochastic programming; Nonlinear programming","score_opus":0.032700464499255504,"score_gpt":0.33770163177127616,"score_spread":0.30500116727202065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7142837718","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03726652,0.0003595709,0.9590713,0.0004596787,0.000055240092,0.00005466801,0.0002992843,0.00017305494,0.0022607478],"genre_scores_gemma":[0.9058737,0.00063760934,0.0879635,0.00015637215,0.00008443774,0.00027974168,0.00058901386,0.00006145437,0.004354052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993849,0.00029271925,0.000029738916,0.00012474725,0.00010003744,0.00006772915],"domain_scores_gemma":[0.9989911,0.0007028176,0.000106463995,0.000024287427,0.0001378602,0.000037432874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011811239,0.0008364174,0.0009538729,0.00065557635,0.0002660141,0.000768342,0.0010393847,0.0009880827,0.001438123],"category_scores_gemma":[0.0032494753,0.0004924679,0.0008863608,0.00068038184,0.00050089107,0.00055954396,0.00075362285,0.0013700905,0.00019590787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008210422,0.0000066401117,0.00029048257,0.000007034691,0.000011450381,0.000009013153,0.0000032541468,0.99633104,0.000055457127,0.0012636345,0.00008545842,0.0019282999],"study_design_scores_gemma":[0.0000012663459,0.000005329965,0.00007001889,0.0000012179329,0.0000021010244,0.000001554172,0.0000013767886,0.9991529,0.00002407021,0.0006835775,0.00005518471,0.0000014504666],"about_ca_topic_score_codex":0.019011218,"about_ca_topic_score_gemma":0.00806998,"teacher_disagreement_score":0.019011218,"about_ca_system_score_codex":0.00079418876,"about_ca_system_score_gemma":0.0016126351,"threshold_uncertainty_score":0.037801147},"labels":[],"label_agreement":null},{"id":"W7142865936","doi":"10.23952/jano.8.2026.1.03","title":"A fast three-operator splitting method with $o(1/k)$ last-iterate convergence rates for monotone inclusions","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Monotone polygon; Rate of convergence; Sequence (biology); Differential inclusion","score_opus":0.008348923102842342,"score_gpt":0.2830043175382748,"score_spread":0.27465539443543247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7142865936","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009961271,0.00017293559,0.98579454,0.00020285217,0.00016172476,0.00008549819,0.000050355018,0.000370012,0.0032008365],"genre_scores_gemma":[0.15083547,0.00021313893,0.8401331,0.00020013902,0.00010054825,0.00040934325,0.00015743422,0.0005599727,0.0073908786],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99937755,0.00018656784,0.00004004532,0.00006371328,0.00027798922,0.000054211294],"domain_scores_gemma":[0.9979678,0.0009820154,0.00007818897,0.00021845938,0.00052352686,0.00022993512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021420002,0.001168964,0.0011278812,0.00077690464,0.00082275824,0.00096426136,0.002071299,0.0018380336,0.0063242847],"category_scores_gemma":[0.003922004,0.00060022477,0.0010973592,0.00056798954,0.0015415496,0.0017535758,0.0033097488,0.002911381,0.0014587576],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013182984,0.0005574366,0.0012315374,0.0007570047,0.00020088551,0.00047432358,0.00076732226,0.29912895,0.077209584,0.25388888,0.011773092,0.35269272],"study_design_scores_gemma":[0.000046410765,0.000054640255,0.00006573297,0.00001596192,0.000008479519,0.000043368556,0.00001804916,0.980845,0.002132011,0.015094647,0.0016578945,0.000017838576],"about_ca_topic_score_codex":0.003732192,"about_ca_topic_score_gemma":0.0043342276,"teacher_disagreement_score":0.0063242847,"about_ca_system_score_codex":0.0009586278,"about_ca_system_score_gemma":0.0019121887,"threshold_uncertainty_score":0.021156847},"labels":[],"label_agreement":null},{"id":"W7142866237","doi":"10.23952/jano.8.2026.1.05","title":"A corrector-predictor feasible interior-point algorithm for $P_{*}(\\kappa)$-weighted linear complementarity problem based on the algebraic equivalent transformation","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Algebraic number; Complementarity (molecular biology); Line search; Polynomial; Predictor–corrector method; Linear complementarity problem; Complementarity theory; Transformation (genetics); Simple (philosophy)","score_opus":0.029414867818872082,"score_gpt":0.32030225463917167,"score_spread":0.2908873868202996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7142866237","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013714671,0.000017271388,0.99755114,0.000028896642,0.000012505334,0.000025883324,0.000009737817,0.00010674292,0.00087633333],"genre_scores_gemma":[0.0720687,0.000075790216,0.9243973,0.000054584234,0.000023774464,0.00031648058,0.00009919131,0.00015009912,0.002814049],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99957293,0.00011870402,0.000017803844,0.00006640833,0.00017585728,0.000048277994],"domain_scores_gemma":[0.999471,0.00022398627,0.000058329202,0.00005249701,0.00016155867,0.000032605643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009548723,0.0009180016,0.0013534263,0.00062725024,0.00051260076,0.00077917415,0.0015131788,0.0009986789,0.0053047678],"category_scores_gemma":[0.00211243,0.00047719068,0.00063012575,0.00069549325,0.0009352276,0.0007815213,0.0015676969,0.0020352374,0.0012830213],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012553259,0.00010152887,0.00039819218,0.00021785178,0.00003590215,0.00015702083,0.00014498802,0.7193177,0.0070864256,0.104483224,0.0034397226,0.1644919],"study_design_scores_gemma":[0.00002128744,0.000026260821,0.000028291193,0.000008483125,0.0000038443322,0.00002607438,0.000008236835,0.98897344,0.0013212739,0.00812411,0.001451397,0.0000073671613],"about_ca_topic_score_codex":0.0025475044,"about_ca_topic_score_gemma":0.0023645982,"teacher_disagreement_score":0.0053047678,"about_ca_system_score_codex":0.0005763057,"about_ca_system_score_gemma":0.0022707172,"threshold_uncertainty_score":0.01774615},"labels":[],"label_agreement":null},{"id":"W7142908568","doi":"10.23952/jano.8.2026.1.08","title":"The shape of you: Incorporating patient geometry and controlling extreme dosage in radiation treatment planning","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Radiation treatment planning; Margin (machine learning)","score_opus":0.007920528460789014,"score_gpt":0.2497855242735882,"score_spread":0.2418649958127992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7142908568","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"metacan-v3-hybrid-931329e0061c","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.055170823,0.00065113,0.93821716,0.0006579764,0.000112684866,0.000060374674,0.000056803365,0.00052744045,0.004545624],"genre_scores_gemma":[0.8470246,0.000472604,0.14940587,0.00031695818,0.000055794826,0.00006582882,0.00005564604,0.00052672124,0.0020759068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993405,0.00036223076,0.000024038343,0.000056952857,0.00017531274,0.000040852945],"domain_scores_gemma":[0.9988368,0.0006909643,0.00012252647,0.00015980737,0.00011457999,0.00007540635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010326318,0.0006326148,0.0005528121,0.0002582673,0.0002870111,0.00096224516,0.001278327,0.0011019448,0.0011647131],"category_scores_gemma":[0.005125474,0.0007536889,0.0005988808,0.00038310056,0.0008433681,0.0011999427,0.0017689535,0.0010897019,0.00028313574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014603102,0.00004182458,0.0012173739,0.000056105782,0.000028706907,0.00010909747,0.00019036356,0.9600167,0.0054558543,0.004539524,0.0007298582,0.02746854],"study_design_scores_gemma":[0.000022371287,0.00010382617,0.00059602776,0.0000124563785,0.000021074386,0.0001715141,0.000061795916,0.98982877,0.002590228,0.0046493495,0.001906264,0.000036223122],"about_ca_topic_score_codex":0.001467284,"about_ca_topic_score_gemma":0.0017688097,"teacher_disagreement_score":0.001467284,"about_ca_system_score_codex":0.00047290087,"about_ca_system_score_gemma":0.0005607067,"threshold_uncertainty_score":0.0054611564},"labels":[],"label_agreement":null}]}