{"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.033870462,0.000768069,0.9626038,0.00088515185,0.000054010867,0.00022545575,0.0000012733302,0.00001038842,0.0015813923],"genre_scores_gemma":[0.9933756,0.00020331383,0.006284199,0.000074866,0.000053983153,0.0000015250176,0.0000012898058,0.000004800654,4.2824735e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99955016,0.00004561428,0.00024026241,0.000038653376,0.000090065914,0.000035228382],"domain_scores_gemma":[0.9996776,0.00012837604,0.00010683496,0.00002551866,0.00003983415,0.000021856165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003215389,0.000041291747,0.00010507188,0.000028955323,0.000015078365,0.000028089398,0.000034593773,0.00002585428,0.0000037152986],"category_scores_gemma":[0.00008009885,0.0000279043,0.000010625248,0.00011014453,0.000011983052,0.00013407323,0.00000432653,0.00006867283,8.2022716e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030631738,0.00001693736,0.00010347056,0.00008354394,0.000024438199,0.0000010080278,0.0049938313,0.94751906,0.01437826,0.018389083,0.00006967975,0.014114375],"study_design_scores_gemma":[0.0025055641,0.0003765464,0.009025713,0.000063095526,0.0001863293,0.000108373024,0.0062090377,0.9682294,0.0013404951,0.0060991324,0.0055778436,0.00027847855],"about_ca_topic_score_codex":0.0000011334332,"about_ca_topic_score_gemma":5.896707e-8,"teacher_disagreement_score":0.95950514,"about_ca_system_score_codex":0.000005295146,"about_ca_system_score_gemma":0.0000048977213,"threshold_uncertainty_score":0.11379043},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016073277,0.00017816506,0.98165596,0.0011640852,0.00013349747,0.00021618075,0.0000025697414,0.00018518239,0.00039106316],"genre_scores_gemma":[0.9302442,0.0003480768,0.06867431,0.00044128016,0.00023485982,0.000004881162,0.000012393801,0.000037216014,0.0000027590593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902546,0.000041748386,0.00045919747,0.00013225146,0.00019535296,0.00014601124],"domain_scores_gemma":[0.9993675,0.00005913042,0.00014535546,0.000105119354,0.00019006108,0.00013288582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00010304251,0.00017798034,0.0003408274,0.00006318311,0.00014509335,0.00014867201,0.00011767669,0.00010513806,0.000089053996],"category_scores_gemma":[0.00004207869,0.00013181141,0.00006122808,0.0003587226,0.000058472877,0.00023923017,0.000029243056,0.00023539113,0.0000011804768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024223798,0.000013504776,0.000012367183,0.0000117285,0.000049360955,0.000063894026,0.00048594555,0.9923339,0.0047076447,0.00018199118,0.00045665557,0.0014408068],"study_design_scores_gemma":[0.00082685455,0.00012936624,0.000013379045,0.00001755125,0.000068244684,0.00035288453,0.00020865974,0.99237,0.004981431,0.00004597878,0.0008246253,0.0001610257],"about_ca_topic_score_codex":0.0000021499739,"about_ca_topic_score_gemma":6.4737655e-8,"teacher_disagreement_score":0.9141709,"about_ca_system_score_codex":0.000024713983,"about_ca_system_score_gemma":0.000026154039,"threshold_uncertainty_score":0.53751135},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19034761,0.0015885867,0.6480957,0.031683464,0.00096795557,0.0024647468,0.000005046691,0.00005174931,0.12479512],"genre_scores_gemma":[0.9962273,0.0003008825,0.0027704856,0.0005404948,0.00007587186,0.000004919877,0.0000057671896,0.000005301401,0.00006897217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991685,0.000010971929,0.00040463213,0.00009245171,0.00022834164,0.00009510881],"domain_scores_gemma":[0.9995196,0.000032876753,0.00024284299,0.000096048774,0.00009912073,0.000009534208],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005890063,0.000079617574,0.00019599158,0.00016593446,0.00007784031,0.00009489941,0.00013124193,0.000029283747,0.00006211021],"category_scores_gemma":[0.0000091964885,0.00004458326,0.00005022382,0.00065322063,0.000028783508,0.0002169966,0.000040640545,0.00009294235,0.0000041291937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031891238,0.00040659952,0.011713233,0.0003065798,0.0005489756,0.000002895149,0.0012036109,0.8390011,0.00012069356,0.07478939,0.002384725,0.06920327],"study_design_scores_gemma":[0.0006970973,0.000030597363,0.0064625638,0.00001542792,0.00029270267,0.0000014256942,0.0014593268,0.96502024,0.000010051072,0.0017018351,0.024179908,0.00012882549],"about_ca_topic_score_codex":0.00003764047,"about_ca_topic_score_gemma":0.0000039696097,"teacher_disagreement_score":0.8058797,"about_ca_system_score_codex":0.000008467911,"about_ca_system_score_gemma":0.0000064610135,"threshold_uncertainty_score":0.18180525},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06413329,0.0021131241,0.9314889,0.00042104904,0.00044118764,0.00011313939,0.0000052740074,0.000026440051,0.001257626],"genre_scores_gemma":[0.9956026,0.0019105586,0.0022470816,0.000078412835,0.000094053394,0.0000027894694,0.0000031679688,0.000010963538,0.000050387127],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940526,0.000024463467,0.0002724315,0.00008577963,0.0001107812,0.00010128085],"domain_scores_gemma":[0.99948275,0.00021170476,0.00009151869,0.00006193445,0.00007373227,0.00007838549],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018852645,0.000092973205,0.00015482464,0.000036906393,0.00014216194,0.00006694642,0.000041328534,0.00006468025,0.000024765646],"category_scores_gemma":[0.000031831412,0.00006876345,0.000025508452,0.00013272047,0.000064471955,0.00011865097,0.000020026417,0.0001401636,9.636116e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002060082,0.00003597793,0.00046319334,0.0001342429,0.0001013159,0.000021993745,0.0018692779,0.911905,0.0010161104,0.0059197806,0.00022538374,0.07810175],"study_design_scores_gemma":[0.0004911517,0.00006245517,0.00046064978,0.00002924556,0.00003622857,0.00007189538,0.00056563196,0.9879221,0.0016577014,0.0010835341,0.007497505,0.00012191998],"about_ca_topic_score_codex":5.563584e-7,"about_ca_topic_score_gemma":3.3621103e-7,"teacher_disagreement_score":0.9314693,"about_ca_system_score_codex":0.000009419461,"about_ca_system_score_gemma":0.000009677971,"threshold_uncertainty_score":0.28040922},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0030709323,0.000851872,0.99483556,0.00032832086,0.00022659151,0.00017807102,0.000005280536,0.00010427114,0.00039907993],"genre_scores_gemma":[0.30424342,0.0038339717,0.6910662,0.00015073421,0.0004997853,0.000014263497,0.00005083366,0.00007727283,0.00006356121],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990039,0.000018107941,0.00043117505,0.00017867799,0.00017999437,0.0001881719],"domain_scores_gemma":[0.999299,0.00007848224,0.00017272886,0.00011148773,0.00021319116,0.00012514775],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011837647,0.00018533535,0.00034648692,0.0001143847,0.000089531844,0.00010449748,0.00006595365,0.00014014321,0.00002491393],"category_scores_gemma":[0.000031913616,0.0001729052,0.00006826806,0.00018671475,0.000031832333,0.00018660839,0.000028638884,0.00016768523,4.0219757e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011677327,0.000047572885,0.0000057171205,0.000047959,0.000055880653,0.000010707934,0.00007453855,0.9847175,0.006278136,0.0003697859,0.0013584062,0.0069170254],"study_design_scores_gemma":[0.0008874868,0.00012251313,0.00004403007,0.00007744188,0.00008949701,0.000093661,0.00006531605,0.96734697,0.02873537,0.00076699187,0.0015579364,0.00021276898],"about_ca_topic_score_codex":9.753852e-7,"about_ca_topic_score_gemma":9.515808e-8,"teacher_disagreement_score":0.3037694,"about_ca_system_score_codex":0.00003771126,"about_ca_system_score_gemma":0.000028247481,"threshold_uncertainty_score":0.70508695},"labels":[],"label_agreement":null},{"id":"W3160114214","doi":"10.23952/jano.3.2021.2.03","title":"A variational inequality for the derivative of the scalar play operator","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"European Regional Development Fund; Grantová Agentura České Republiky","keywords":"Scalar (mathematics); Mathematics; Inequality; Variational inequality; Operator (biology); Derivative (finance); Mathematical physics; Algebra over a field; Applied mathematics; Mathematical analysis; Mathematical economics; Pure mathematics; Economics; Geometry; Chemistry","score_opus":0.011465887219513209,"score_gpt":0.23695825790202957,"score_spread":0.22549237068251635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160114214","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003726051,0.000056633013,0.99343836,0.005790172,0.00010516536,0.00008965254,0.0000051433776,0.000003523587,0.0001387659],"genre_scores_gemma":[0.58060414,0.000053404667,0.418162,0.0010478812,0.00009096475,0.000006962033,0.0000047774206,0.00000448614,0.000025424612],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991022,0.000061019455,0.00038403284,0.000105944426,0.00027971546,0.00006710852],"domain_scores_gemma":[0.99840975,0.00039175918,0.00040490172,0.0001282736,0.00062634645,0.000038998056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037296314,0.00006587875,0.00016297237,0.000033624197,0.00017145039,0.000075053955,0.00024251525,0.00003660341,0.000030507324],"category_scores_gemma":[0.00021597189,0.000035987545,0.000093897725,0.0005041629,0.000030956904,0.00017563623,0.00007824763,0.00007956758,2.0912499e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002541215,0.000066593886,0.0001550578,0.000004746814,0.00007971774,1.5497851e-7,0.00033315658,0.8468876,0.00024599564,0.15113935,0.00011603308,0.0009462035],"study_design_scores_gemma":[0.00048696258,0.000027724256,0.0037628715,0.0000067669343,0.00004943554,0.0000067616056,0.000057758232,0.99081403,0.0011332856,0.0031085203,0.00049092557,0.000054975444],"about_ca_topic_score_codex":0.0000012146385,"about_ca_topic_score_gemma":1.8255655e-7,"teacher_disagreement_score":0.5802315,"about_ca_system_score_codex":0.00001897781,"about_ca_system_score_gemma":0.0001702724,"threshold_uncertainty_score":0.14675295},"labels":[],"label_agreement":null},{"id":"W3161875491","doi":"10.23952/jano.4.2022.2.02","title":"On angles between convex cones","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Linear subspace; Mathematics; Orthographic projection; Regular polygon; Projection (relational algebra); Hilbert space; Mathematical proof; Convergence (economics); Pure mathematics; Algebra over a field; Geometry; Algorithm","score_opus":0.008797429418133544,"score_gpt":0.2151201609620584,"score_spread":0.20632273154392486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3161875491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011519955,0.000024112633,0.99509233,0.0017500801,0.00008262544,0.000043259697,0.000002840536,0.000016204409,0.0018365729],"genre_scores_gemma":[0.89312947,0.000017238697,0.10581112,0.0008990429,0.000070649985,0.0000033693361,0.00000956385,0.0000053184745,0.00005424231],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912167,0.000046519483,0.0002892031,0.000119357195,0.0003433719,0.000079877216],"domain_scores_gemma":[0.99930507,0.00014409935,0.00030559732,0.00007986834,0.00008739098,0.000077975696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023865163,0.00007151271,0.0001887604,0.0001646362,0.00019883299,0.00006689675,0.00021055035,0.000020959475,0.00021200988],"category_scores_gemma":[0.000020783591,0.00006057852,0.000050696854,0.0003914312,0.000014914178,0.00014801009,0.000082705774,0.00013186233,0.0000027867954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002874078,0.00005547722,0.00011933993,0.0000014941394,0.000032840486,0.000001772838,0.00013787684,0.8998935,0.00001574008,0.096240565,0.00046437958,0.0030082222],"study_design_scores_gemma":[0.00071817404,0.0003158068,0.0007936279,0.0000029156129,0.000036413792,0.000014711326,0.00006775964,0.98680264,0.00007296394,0.008614848,0.0024222971,0.00013783954],"about_ca_topic_score_codex":9.713058e-7,"about_ca_topic_score_gemma":9.934433e-9,"teacher_disagreement_score":0.8919775,"about_ca_system_score_codex":0.00003096635,"about_ca_system_score_gemma":0.00003638669,"threshold_uncertainty_score":0.24703203},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031910576,0.0003149665,0.954708,0.01110038,0.00046725004,0.0003923218,0.0000034692332,0.000043882264,0.0010591908],"genre_scores_gemma":[0.98173386,0.00041796628,0.010027659,0.006908035,0.0005902319,0.000024503384,0.000045691846,0.000017672344,0.0002343946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918675,0.000009647409,0.0003497648,0.00013157749,0.00016404327,0.00015823086],"domain_scores_gemma":[0.99951744,0.000043812393,0.00018407257,0.00009229017,0.00013369697,0.00002867103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004414987,0.00009625835,0.00016433914,0.00006176556,0.00027284012,0.00011864695,0.000101885984,0.000037928025,0.00017402526],"category_scores_gemma":[0.00011912262,0.0000708552,0.000069234404,0.0003221477,0.000026811214,0.00019778377,0.000059494105,0.000094459945,0.000003373282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017931529,0.000040130173,0.0013779479,0.00013249835,0.000036982772,0.0000020340822,0.000053997333,0.98931843,0.00007248959,0.0049971403,0.0018990259,0.0018900331],"study_design_scores_gemma":[0.0014816482,0.00001771166,0.004055145,0.000017052278,0.00011158135,0.000016929418,0.00046686816,0.8853611,0.0000042848683,0.0036984743,0.104579404,0.00018981333],"about_ca_topic_score_codex":0.000013754727,"about_ca_topic_score_gemma":0.000013641173,"teacher_disagreement_score":0.94982326,"about_ca_system_score_codex":0.000048442776,"about_ca_system_score_gemma":0.000032835287,"threshold_uncertainty_score":0.28893915},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001755333,0.000050315255,0.9966508,0.000489229,0.000018754921,0.00013012336,0.0000010693215,0.000017332337,0.00088705716],"genre_scores_gemma":[0.63690996,0.000074414536,0.3627174,0.00020545053,0.000030370331,0.0000057931697,0.000025285455,0.000008938436,0.000022408607],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999104,0.000052682346,0.00032465855,0.0001734186,0.00019787083,0.00014734046],"domain_scores_gemma":[0.99923754,0.00008994224,0.00026589716,0.0000691581,0.00025758945,0.00007985582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031342296,0.00008504622,0.00018806498,0.00010790596,0.00008515135,0.00021859385,0.000118819604,0.00004891826,0.000010066711],"category_scores_gemma":[0.000027501625,0.00007120585,0.000023018412,0.0004289436,0.00002035629,0.0003791604,0.000041158066,0.00015908934,2.2377196e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007531784,0.000051706065,0.00034971835,0.000037218655,0.000010679946,0.000007895872,0.00072852516,0.98618084,0.00025430866,0.0034348627,0.00001027505,0.008858647],"study_design_scores_gemma":[0.0012034592,0.00021080299,0.00030957302,0.000079825586,0.000006248373,0.00003443446,0.0006201,0.99633473,0.00027065654,0.00040098457,0.00043333607,0.00009582779],"about_ca_topic_score_codex":0.0000012239888,"about_ca_topic_score_gemma":8.9410906e-7,"teacher_disagreement_score":0.6351546,"about_ca_system_score_codex":0.000032513988,"about_ca_system_score_gemma":0.00011420224,"threshold_uncertainty_score":0.29036906},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014972684,0.0002867106,0.98089147,0.000025168392,0.000113618415,0.00014649986,0.0000017250384,0.000054201086,0.0035079333],"genre_scores_gemma":[0.9315644,0.00028466198,0.06805172,0.000038593345,0.000022048556,0.000020277725,0.0000017758185,0.000014619092,0.0000019422237],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999414,0.000018750241,0.00027619436,0.0000580021,0.0001377207,0.00009529494],"domain_scores_gemma":[0.9998049,0.000027451444,0.00008342848,0.000036749654,0.000012733757,0.00003472228],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024959375,0.00006725173,0.00013956647,0.00016960052,0.000065446286,0.000010645884,0.000067360714,0.000020427551,0.00004628962],"category_scores_gemma":[0.0000045669176,0.00006671046,0.000024756378,0.00026345014,0.000011846388,0.000092204726,0.000020321168,0.00034301722,8.320713e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024902056,0.000030621704,0.00009669338,0.000012806246,0.000009600591,0.000004031644,0.00028110438,0.9901215,0.0014385949,0.00037150868,0.00005824276,0.007550439],"study_design_scores_gemma":[0.0012344815,0.0002878706,0.00026971434,0.000038113787,0.000022878037,0.000107779364,0.000679187,0.97643626,0.0032031902,0.0056278002,0.0117846,0.00030812668],"about_ca_topic_score_codex":4.7492625e-7,"about_ca_topic_score_gemma":2.8010932e-8,"teacher_disagreement_score":0.9165917,"about_ca_system_score_codex":0.000058019636,"about_ca_system_score_gemma":0.0000057642296,"threshold_uncertainty_score":0.2720374},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00999428,0.00049020274,0.98891324,0.00012629418,0.00005889221,0.00011800457,0.0000017413919,0.00005284319,0.00024451036],"genre_scores_gemma":[0.39317986,0.00030467124,0.6063156,0.00007793164,0.00006836038,0.000003908333,0.000013087227,0.000023213419,0.000013343913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994322,0.0000031840225,0.00030287312,0.000070695285,0.00010158654,0.00008946005],"domain_scores_gemma":[0.9996495,0.00004574921,0.00009046494,0.00004120871,0.000112457084,0.000060567425],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000108870205,0.00008445163,0.00018371659,0.000054941862,0.000052303552,0.00004079567,0.000037541795,0.00007507572,0.00002466363],"category_scores_gemma":[0.000012993372,0.00007330475,0.000048779093,0.00011665805,0.000008849948,0.00011019762,0.000006385001,0.000112054426,9.088949e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037420905,0.00001227913,0.00000438416,0.00010071846,0.000019839481,0.0000011699244,0.00015587543,0.9189164,0.07390265,0.0012885625,0.00016763792,0.0053930297],"study_design_scores_gemma":[0.0004351472,0.000047681722,0.000013119431,0.000054120537,0.00003268512,0.000020911348,0.000037444242,0.919193,0.072479665,0.0034872221,0.004092435,0.000106553984],"about_ca_topic_score_codex":1.5621829e-7,"about_ca_topic_score_gemma":2.1956144e-8,"teacher_disagreement_score":0.38318557,"about_ca_system_score_codex":0.000025408643,"about_ca_system_score_gemma":0.000018412822,"threshold_uncertainty_score":0.29892808},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025565003,0.00005299835,0.9979921,0.0010252978,0.00016044438,0.0001452983,0.0000093023855,0.000034881294,0.0003240269],"genre_scores_gemma":[0.45182064,0.00002056118,0.54767364,0.0002929792,0.000089417925,0.00002105895,0.000047628248,0.000010747406,0.00002330825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990292,0.000059709095,0.00032441632,0.00017114318,0.000264963,0.00015056197],"domain_scores_gemma":[0.999139,0.00012322224,0.00039829637,0.00010063188,0.00014135247,0.00009749442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034453944,0.000103069025,0.00020664149,0.000111850444,0.0003292943,0.00007220269,0.0002561599,0.000033468918,0.00004101774],"category_scores_gemma":[0.000035288434,0.00008975103,0.000061355175,0.00038588213,0.000017536751,0.00017274657,0.00010585192,0.00016914576,3.1650632e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022846436,0.00007983994,0.000006958007,0.000003885552,0.000021797914,0.0000017245252,0.00019571611,0.9786153,0.000012373767,0.007387184,0.0005581927,0.0128886],"study_design_scores_gemma":[0.00094756414,0.0004912996,0.000019843437,0.0000037077568,0.000019248762,0.000025558316,0.00008024922,0.99306625,0.000019897023,0.001128158,0.0040888446,0.00010936816],"about_ca_topic_score_codex":0.0000024847423,"about_ca_topic_score_gemma":3.0218878e-8,"teacher_disagreement_score":0.451565,"about_ca_system_score_codex":0.00006819806,"about_ca_system_score_gemma":0.00006175348,"threshold_uncertainty_score":0.3659941},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005814203,0.0005432174,0.9972359,0.0010287785,0.00013346449,0.000089087465,0.0000011233542,0.000023878905,0.0003631178],"genre_scores_gemma":[0.7198624,0.00053485745,0.27832255,0.0009825242,0.00021876939,0.000009404761,0.000015100358,0.000012941426,0.00004144217],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990022,0.000029880171,0.00039364127,0.000214706,0.0001786822,0.0001808756],"domain_scores_gemma":[0.99906886,0.00016884123,0.00029789275,0.00017185725,0.0001450449,0.00014750489],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015526269,0.00011316221,0.00021602218,0.00003841106,0.00016498413,0.00016267992,0.00024140693,0.00006500234,0.00002859574],"category_scores_gemma":[0.000027578002,0.000095514326,0.000059101865,0.00045371303,0.000033182707,0.00021522447,0.00008266674,0.00019326532,9.573114e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001847424,0.00013873777,0.00001189115,0.0000047438107,0.000016578086,0.000003917203,0.000084005675,0.9298858,0.0028073052,0.006079399,0.0010508652,0.059898265],"study_design_scores_gemma":[0.0003768378,0.000066083965,0.000025105595,0.0000054171496,0.000014514919,0.000030022919,0.000020174923,0.9960802,0.0014604148,0.00084332656,0.0009631591,0.00011471159],"about_ca_topic_score_codex":0.0000019781846,"about_ca_topic_score_gemma":2.0557344e-7,"teacher_disagreement_score":0.719281,"about_ca_system_score_codex":0.000023173476,"about_ca_system_score_gemma":0.0000458708,"threshold_uncertainty_score":0.38949612},"labels":[],"label_agreement":null},{"id":"W4205379046","doi":"10.23952/jano.3.2021.3.07","title":"A note on minimax optimization problems with an infinite number of constraints","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Minimax; Mathematical optimization; Mathematics; Computer science; Applied mathematics","score_opus":0.009611660392554573,"score_gpt":0.24041513453907434,"score_spread":0.23080347414651978,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205379046","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00077460194,0.0000097687725,0.99517846,0.0005682082,0.0000429236,0.000067925044,0.0000026835833,0.0000148428,0.0033405677],"genre_scores_gemma":[0.31231648,0.00006975513,0.6872095,0.00032524564,0.0000348149,0.0000019729646,0.000017241038,0.000008257974,0.000016711669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987171,0.000057137597,0.000502244,0.00020963242,0.0003992988,0.00011456459],"domain_scores_gemma":[0.99839175,0.0000974773,0.0005829206,0.00015794119,0.0006369231,0.00013299276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020167798,0.00012806388,0.00029572906,0.00013229247,0.00007332049,0.000105810104,0.00015840742,0.00006977458,0.00015000347],"category_scores_gemma":[0.000044046275,0.00010023211,0.000053556712,0.00069942564,0.00005917888,0.0004468584,0.000034598255,0.00012211074,0.0000016380175],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009342449,0.00022402607,0.000127997,0.0000106768175,0.0000460012,0.0000051492675,0.00029335954,0.9759187,0.00007096991,0.019741213,0.000011381571,0.0034571139],"study_design_scores_gemma":[0.00096096116,0.00025324797,0.00017597787,0.00003617894,0.000046961202,0.000073872485,0.00004772835,0.9972535,0.00038268414,0.0005606041,0.0000761043,0.00013220121],"about_ca_topic_score_codex":0.0000012417787,"about_ca_topic_score_gemma":2.0525017e-7,"teacher_disagreement_score":0.3115419,"about_ca_system_score_codex":0.000023919894,"about_ca_system_score_gemma":0.00016195372,"threshold_uncertainty_score":0.40873468},"labels":[],"label_agreement":null},{"id":"W4205560202","doi":"10.23952/jano.3.2021.3.08","title":"Dual three-operator splitting algorithms for solving composite monotone inclusion with applications to convex minimization","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Monotone polygon; Dual (grammatical number); Operator splitting; Regular polygon; Convex optimization; Minification; Operator (biology); Algorithm; Mathematics; Composite number; Combinatorics; Computer science; Mathematical optimization; Applied mathematics","score_opus":0.01150794879687846,"score_gpt":0.24825139642582314,"score_spread":0.23674344762894467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205560202","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00060362497,0.00006572927,0.9962743,0.002518942,0.00005093184,0.00029509573,0.0000044918525,0.000027764841,0.00015914382],"genre_scores_gemma":[0.1297079,0.000037701604,0.86912674,0.0008629067,0.00015698167,0.00003567529,0.000038190068,0.000013853728,0.000020065541],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868417,0.000021408088,0.0005070862,0.00028706342,0.00034511415,0.00015514196],"domain_scores_gemma":[0.9982813,0.00014460704,0.00037242225,0.00015102007,0.00086820644,0.00018244321],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024877174,0.0001407219,0.0003007439,0.0001669254,0.00047289062,0.00022024396,0.00017355086,0.000063693136,0.00001642099],"category_scores_gemma":[0.000037749804,0.00011793486,0.000060109916,0.00081479346,0.000018628589,0.00037220123,0.000220612,0.000095701456,0.0000013935924],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007606761,0.00012406804,0.000098277065,0.000014657374,0.00006207631,0.000002440373,0.0004389602,0.96812475,0.0016488149,0.019159082,0.000046430836,0.010204403],"study_design_scores_gemma":[0.0008451183,0.00011956375,0.00019414624,0.000021941541,0.00006247772,0.000030229716,0.00005476489,0.994825,0.0018323923,0.00088517653,0.0009603716,0.00016879813],"about_ca_topic_score_codex":0.0000016543963,"about_ca_topic_score_gemma":5.6140533e-7,"teacher_disagreement_score":0.12910429,"about_ca_system_score_codex":0.000052068954,"about_ca_system_score_gemma":0.00013278975,"threshold_uncertainty_score":0.4809244},"labels":[],"label_agreement":null},{"id":"W4205821035","doi":"10.23952/jano.3.2021.3.04","title":"New linear convergence results on quasi-variational inequalities","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Variational inequality; Applied mathematics; Inequality; Mathematics; Mathematical economics; Mathematical analysis; Economics; Economic growth","score_opus":0.015783234826559495,"score_gpt":0.24570173668053172,"score_spread":0.22991850185397222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4205821035","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00006694256,0.000036939466,0.9931047,0.0045865257,0.00018619128,0.00002932547,0.0000034747816,0.000017150447,0.0019687817],"genre_scores_gemma":[0.13050103,0.00019205992,0.8671799,0.0013950322,0.00028977776,0.0000010249914,0.000028851766,0.000007130408,0.00040524022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986867,0.00006272262,0.00053439813,0.00019134374,0.00042242793,0.00010243802],"domain_scores_gemma":[0.9987014,0.00022617493,0.00039867958,0.00013069401,0.00039507428,0.00014796079],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032431533,0.00010111825,0.00021230322,0.00012135881,0.00009214201,0.0001094355,0.00016860563,0.00005798493,0.000120963836],"category_scores_gemma":[0.00020777962,0.00008642281,0.000067212684,0.0005167695,0.000011826065,0.0003056006,0.000050329094,0.0001225256,0.000008301127],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000085171894,0.00008198989,0.000017813614,0.0000029324117,0.000036086334,0.0000044138924,0.00027174206,0.76447463,0.000041683295,0.23183581,0.00067928,0.0024684556],"study_design_scores_gemma":[0.0008767413,0.000112112575,0.00029910877,0.000012053089,0.000020586336,0.000018143412,0.0000430383,0.99201286,0.0003678201,0.004153828,0.001965199,0.00011850045],"about_ca_topic_score_codex":0.0000044112917,"about_ca_topic_score_gemma":1.7836899e-7,"teacher_disagreement_score":0.22768198,"about_ca_system_score_codex":0.000029872883,"about_ca_system_score_gemma":0.0002492885,"threshold_uncertainty_score":0.352422},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041212765,0.000067610745,0.99400705,0.0004752232,0.00014406363,0.00014431006,0.0000070481583,0.0000062022855,0.0010272077],"genre_scores_gemma":[0.038832396,0.000049133763,0.9608743,0.00006607397,0.00009219719,0.0000041731746,0.000011751501,0.000010010672,0.00005995481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899626,0.00011237028,0.00050086423,0.00013186067,0.00014408487,0.000114588984],"domain_scores_gemma":[0.9982893,0.0009017293,0.0003366574,0.00008085505,0.00033121184,0.00006024902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008819288,0.00008844901,0.0002793879,0.00009834238,0.000051258467,0.000035988818,0.000054159093,0.00004361119,0.000015336314],"category_scores_gemma":[0.0011745025,0.00007429191,0.00005090461,0.0003528147,0.000019716432,0.00009489326,0.0000146599905,0.00012648711,3.7952458e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036810422,0.0012019334,0.00033759334,0.00024780395,0.00026821424,0.000051671068,0.00756633,0.582747,0.012515891,0.3531646,0.0014606689,0.036757234],"study_design_scores_gemma":[0.0044283047,0.00033574476,0.00013173919,0.00007668774,0.00012824657,0.000063628286,0.0008034297,0.8147341,0.01039113,0.16702944,0.0016286655,0.00024888],"about_ca_topic_score_codex":0.0000015664049,"about_ca_topic_score_gemma":0.0000017146571,"teacher_disagreement_score":0.2319871,"about_ca_system_score_codex":0.00003339291,"about_ca_system_score_gemma":0.00006889195,"threshold_uncertainty_score":0.3029536},"labels":[],"label_agreement":null},{"id":"W4206290566","doi":"10.23952/jano.3.2021.3.05","title":"On sequential optimality theorems for linear fractional optimization problems involving integral functions defined on $L_n^2 [0,1]$","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Science and ICT, South Korea; National Research Foundation of Korea; National Research Foundation","keywords":"Mathematics; Applied mathematics; Mathematical optimization","score_opus":0.01847058817465212,"score_gpt":0.2505827690994383,"score_spread":0.23211218092478617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4206290566","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001950765,0.000034951645,0.9956243,0.0022754313,0.00035603181,0.00017342689,0.000011443356,0.000042702402,0.0012866182],"genre_scores_gemma":[0.18594599,0.00016877746,0.8118792,0.0013214921,0.00033344902,0.000025249401,0.00017769731,0.000024627423,0.00012348608],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823177,0.000086880136,0.0006490368,0.00036041244,0.00047912786,0.00019275134],"domain_scores_gemma":[0.9978595,0.00040071592,0.0005621415,0.00018871934,0.00083215785,0.00015680993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000450956,0.00020139813,0.00033064574,0.00025638798,0.00032673098,0.00023425856,0.0001985472,0.00012765964,0.00014872885],"category_scores_gemma":[0.000293117,0.00017010147,0.00018588985,0.00066487625,0.000037541744,0.00048725234,0.000056443285,0.00026075845,0.0000044631474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016811455,0.00024779732,0.000012240375,0.000009647481,0.00007714766,0.0000014825895,0.0000759636,0.8085729,0.00008368103,0.18991838,0.00020760686,0.00062502385],"study_design_scores_gemma":[0.0010629026,0.0002887084,0.000038520884,0.000031257434,0.00006486972,0.000021130378,0.00004303415,0.9899506,0.00022064184,0.0077457638,0.00035135626,0.00018120235],"about_ca_topic_score_codex":0.0000023453872,"about_ca_topic_score_gemma":3.4446342e-7,"teacher_disagreement_score":0.1857509,"about_ca_system_score_codex":0.00010751298,"about_ca_system_score_gemma":0.00019054447,"threshold_uncertainty_score":0.69365364},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003085092,0.000039093124,0.9945658,0.00023479974,0.000053022784,0.00010982135,0.000002462401,0.000024812702,0.0018851166],"genre_scores_gemma":[0.59815687,0.000014194797,0.40156505,0.00006548879,0.00013612324,0.0000022405586,0.000027794826,0.000020801826,0.0000114634995],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990028,0.000028568249,0.00035211083,0.000170211,0.0002922984,0.00015397483],"domain_scores_gemma":[0.9990321,0.000020412848,0.00039973174,0.00011455949,0.0003062274,0.00012696158],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013906027,0.00014859943,0.0002596707,0.00007025014,0.00010438658,0.000068369096,0.0000726838,0.000035925317,0.00007718456],"category_scores_gemma":[0.000009131676,0.00012293836,0.000046245183,0.00028284194,0.000043006225,0.0002747213,0.000024353125,0.00018177879,7.363141e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065957324,0.00063950557,0.00060130376,0.000012029771,0.00012202405,0.000011394292,0.00014070398,0.9753467,0.0059123402,0.00059686304,0.00011978818,0.015837789],"study_design_scores_gemma":[0.014435278,0.0015640556,0.00017677009,0.00024290704,0.0005464065,0.000118084914,0.00045320077,0.73105913,0.24186279,0.006871886,0.0015869132,0.0010825744],"about_ca_topic_score_codex":0.000001051038,"about_ca_topic_score_gemma":2.9067246e-8,"teacher_disagreement_score":0.59507173,"about_ca_system_score_codex":0.00003524518,"about_ca_system_score_gemma":0.0000724818,"threshold_uncertainty_score":0.5013281},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009285288,0.000043620763,0.9833565,0.00005830907,0.00006700218,0.00012155485,7.712626e-7,0.0000447981,0.007022203],"genre_scores_gemma":[0.8015997,0.00003337845,0.19826727,0.00004202056,0.000027742402,0.000001958866,0.000002336089,0.000016399523,0.000009238156],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999442,0.0000045752986,0.00024353755,0.00006264602,0.00013165624,0.00011559151],"domain_scores_gemma":[0.9996953,0.00003514165,0.00009175257,0.000047093727,0.00004535999,0.00008533407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00009497478,0.00008589401,0.00016459411,0.0000585032,0.00002481232,0.00005039221,0.00004322736,0.000045432236,0.00012668147],"category_scores_gemma":[0.0000070518245,0.000064352666,0.000024119845,0.00011096146,0.000026678692,0.00012175707,0.000009282039,0.0001203382,0.0000043649347],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002173754,0.00001644997,0.00003234637,0.00006361975,0.000026947215,0.0000011566833,0.00020156887,0.99191356,0.00036972293,0.0025701404,0.000032509877,0.0047502606],"study_design_scores_gemma":[0.0006415194,0.00012940346,0.000021750488,0.000058285244,0.000022932543,0.000054328175,0.00016323352,0.99781245,0.00030579054,0.0003671963,0.0003000287,0.00012305527],"about_ca_topic_score_codex":2.381471e-7,"about_ca_topic_score_gemma":2.782456e-8,"teacher_disagreement_score":0.79231435,"about_ca_system_score_codex":0.0000143543475,"about_ca_system_score_gemma":0.000013977203,"threshold_uncertainty_score":0.26242253},"labels":[],"label_agreement":null},{"id":"W4225767607","doi":"10.23952/jano.4.2022.1.03","title":"Vectorization in nonconvex set optimization","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Vectorization (mathematics); Set (abstract data type); Computer science; Mathematical optimization; Mathematics; Algorithm; Parallel computing; Programming language","score_opus":0.007936345292094815,"score_gpt":0.2178672487866019,"score_spread":0.2099309034945071,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225767607","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00034077032,0.00004232638,0.9972462,0.0010816813,0.00018207057,0.00009338914,0.0000019382628,0.000020850903,0.0009907953],"genre_scores_gemma":[0.63192636,0.00009605365,0.36727318,0.00055081525,0.0000704936,0.000011603229,0.000030663457,0.00001095314,0.000029848748],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986248,0.00009055329,0.0005312008,0.0001907132,0.00043514665,0.00012756854],"domain_scores_gemma":[0.99911827,0.00007310981,0.00046561542,0.000113410475,0.00014705847,0.00008253385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004572472,0.0001061109,0.00022813423,0.00041448494,0.00017390377,0.00009410554,0.00026996035,0.000039855095,0.00021760243],"category_scores_gemma":[0.000037097616,0.00010316972,0.00005158822,0.0012375669,0.000013750169,0.00047036418,0.00012572964,0.00019088533,9.5006794e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043328295,0.000086986794,0.00020111237,0.0000031384407,0.000014364083,0.0000032404255,0.00040148318,0.98289406,0.000034589342,0.015104713,0.000077895544,0.0011350639],"study_design_scores_gemma":[0.0007103608,0.00010570909,0.00030620693,0.0000030388533,0.000014096063,0.000020758423,0.000085892614,0.997395,0.000023637092,0.00071892666,0.00050150324,0.000114913826],"about_ca_topic_score_codex":0.00000437505,"about_ca_topic_score_gemma":1.1942866e-7,"teacher_disagreement_score":0.6315856,"about_ca_system_score_codex":0.00011741475,"about_ca_system_score_gemma":0.00008990477,"threshold_uncertainty_score":0.4207139},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03996344,0.00046243172,0.70742774,0.2149289,0.004009642,0.013494159,0.00013179403,0.00027487666,0.019307025],"genre_scores_gemma":[0.28328857,0.005736035,0.69062185,0.0056727836,0.008005419,0.0008900409,0.00016983744,0.0005563399,0.005059117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784124,0.00024867195,0.000633313,0.00022757804,0.0008478002,0.00020139453],"domain_scores_gemma":[0.9981438,0.00060381705,0.00065016793,0.00021949604,0.0002593982,0.00012333342],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007249236,0.00018268918,0.0003192034,0.00018251203,0.00041547144,0.00004652344,0.00022880026,0.00007821535,0.00062642136],"category_scores_gemma":[0.000573459,0.000108944645,0.000049002658,0.000782238,0.00010135468,0.00006772722,0.00012720324,0.0005547596,0.000002449403],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014233739,0.00048049312,0.000008301988,0.000024442254,0.0000526382,0.0000051462926,0.001240597,0.9642072,0.00002944135,0.0086492365,0.005782521,0.018096626],"study_design_scores_gemma":[0.0040133726,0.0055969823,0.00018570658,0.00024650252,0.00015149373,0.000062072926,0.0019113594,0.93493783,0.0019124969,0.0045018313,0.045935016,0.0005453556],"about_ca_topic_score_codex":3.7853835e-7,"about_ca_topic_score_gemma":1.0455477e-7,"teacher_disagreement_score":0.24332513,"about_ca_system_score_codex":0.0001542907,"about_ca_system_score_gemma":0.000072807496,"threshold_uncertainty_score":0.68588746},"labels":[],"label_agreement":null},{"id":"W4226200284","doi":"10.23952/jano.4.2022.1.09","title":"Solvability of convex optimization problems on a *-continuous closed convex set","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Subderivative; Convex set; Regular polygon; Proper convex function; Convex analysis; Conic optimization; Set (abstract data type); Convex optimization; Mathematics; Mathematical optimization; Convex combination; Convex polytope; Absolutely convex set; Computer science; Geometry","score_opus":0.010002825590155064,"score_gpt":0.21609861142083092,"score_spread":0.20609578583067586,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226200284","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014594188,0.00003546278,0.9960528,0.00097367505,0.00014406843,0.00020371986,0.000008627146,0.00002628711,0.0010959456],"genre_scores_gemma":[0.79390645,0.000054029457,0.20538846,0.0005240844,0.00004400613,0.000013266627,0.000027027265,0.000011456346,0.0000312001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806726,0.00013253845,0.00077595515,0.0002568682,0.00061736425,0.00014999845],"domain_scores_gemma":[0.9981959,0.00015573071,0.0009841839,0.0002006477,0.00034887553,0.00011468598],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006622245,0.0001486722,0.0004411848,0.00026725527,0.00020485905,0.00007196655,0.00034649408,0.000055571327,0.0002617795],"category_scores_gemma":[0.00006346319,0.00013214943,0.000116073104,0.00077072845,0.000046729434,0.00027531074,0.00013225434,0.00022627563,0.0000010279063],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013326178,0.00025616665,0.00014733113,0.00001362312,0.000056113247,0.00000139985,0.00049066177,0.9837399,0.000086103035,0.013591722,0.0001406443,0.001343059],"study_design_scores_gemma":[0.0010274315,0.00044925846,0.00019565318,0.0000073117862,0.000041976215,0.000014383632,0.000105606385,0.9963665,0.00013767662,0.0011292719,0.0003847027,0.00014022742],"about_ca_topic_score_codex":0.000004599781,"about_ca_topic_score_gemma":6.070013e-8,"teacher_disagreement_score":0.79244703,"about_ca_system_score_codex":0.000075022595,"about_ca_system_score_gemma":0.00011081676,"threshold_uncertainty_score":0.53888977},"labels":[],"label_agreement":null},{"id":"W4226279112","doi":"10.23952/jano.4.2022.1.02","title":"Relaxed Lagrangian duality in convex infinite optimization: Reverse strong duality and optimality","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agencia Estatal de Investigación; European Regional Development Fund; Viet Nam National University Ho Chi Minh City; Ministerio de Ciencia, Innovación y Universidades","keywords":"Duality (order theory); Lagrangian; Strong duality; Convex analysis; Mathematics; Duality gap; Perturbation function; Fenchel's duality theorem; Regular polygon; Convex optimization; Mathematical optimization; Wolfe duality; Weak duality; Applied mathematics; Pure mathematics; Optimization problem; Geometry","score_opus":0.011958170476297988,"score_gpt":0.23406817775916275,"score_spread":0.22211000728286476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226279112","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020419613,0.00007995818,0.9935295,0.0028539207,0.00011086598,0.00015278974,0.000008887311,0.00002643285,0.0011956977],"genre_scores_gemma":[0.5823691,0.00016958683,0.41644242,0.0008787452,0.000050235623,0.0000112314,0.000028954322,0.000011025174,0.00003872367],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979515,0.00025293184,0.0007929627,0.0003103954,0.00050792156,0.00018430287],"domain_scores_gemma":[0.99866575,0.00016085508,0.00063050486,0.00018752056,0.00019018476,0.00016521358],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012584904,0.0001609074,0.00039845813,0.00028696566,0.00028227762,0.0001450992,0.00025806585,0.00006646263,0.0002017354],"category_scores_gemma":[0.00008201014,0.00015576583,0.000072625306,0.0010029923,0.00005547481,0.0005891348,0.00025175145,0.00033145634,6.253552e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010199812,0.00013539336,0.0008364226,0.000010414193,0.00003273086,0.0000065571285,0.00049943133,0.97209233,0.000011379074,0.025478443,0.00007261688,0.0007222863],"study_design_scores_gemma":[0.0012382327,0.00010926812,0.0023430819,0.000006451758,0.000035128865,0.000033970304,0.0002331608,0.9944785,0.000008645614,0.0007760122,0.00055358344,0.0001839289],"about_ca_topic_score_codex":0.000022272177,"about_ca_topic_score_gemma":6.6045334e-7,"teacher_disagreement_score":0.5803271,"about_ca_system_score_codex":0.000101178906,"about_ca_system_score_gemma":0.000099658995,"threshold_uncertainty_score":0.6351946},"labels":[],"label_agreement":null},{"id":"W4226337303","doi":"10.23952/jano.4.2022.1.04","title":"Set-valued variational principles. When migration improves quality of life","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Agence Nationale de la Recherche; Aix-Marseille Université","keywords":"Set (abstract data type); Quality of life (healthcare); Quality (philosophy); Mathematical optimization; Applied mathematics; Mathematics; Computer science; Psychology; Epistemology; Philosophy; Psychotherapist","score_opus":0.023234993276034427,"score_gpt":0.25191491913896796,"score_spread":0.22867992586293354,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226337303","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028636777,0.00004408439,0.99486166,0.0015155035,0.00011220932,0.0000887465,0.0000067216397,0.000014963599,0.0004924291],"genre_scores_gemma":[0.6090266,0.00002613668,0.39032435,0.00047651262,0.00006467392,0.0000071015656,0.000026485592,0.0000060609495,0.000042089556],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812293,0.00013234894,0.00082510407,0.00017084976,0.0006523499,0.00009640524],"domain_scores_gemma":[0.99819,0.00012598242,0.0011406068,0.00013066476,0.00030684247,0.00010591762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008483578,0.00009791189,0.00028936664,0.00020074009,0.00018512104,0.00006462726,0.00028080936,0.000037193506,0.0001555325],"category_scores_gemma":[0.00012331283,0.000088192,0.000093200535,0.00045968307,0.000022357566,0.00035196566,0.00014195981,0.00014347896,5.85508e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094020266,0.00008120223,0.00018651488,0.000007935782,0.000058016,2.1928716e-7,0.00067167473,0.86315155,0.0003591762,0.13471483,0.00011304953,0.00056182226],"study_design_scores_gemma":[0.0006617251,0.00011050721,0.0025412482,0.0000018565405,0.000025795522,0.000004002645,0.00010603596,0.9923497,0.000055001383,0.0034908855,0.00055082346,0.000102435915],"about_ca_topic_score_codex":0.000016077029,"about_ca_topic_score_gemma":3.3749652e-7,"teacher_disagreement_score":0.6061629,"about_ca_system_score_codex":0.00007489553,"about_ca_system_score_gemma":0.00023990878,"threshold_uncertainty_score":0.35963655},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71263754,0.00070103415,0.2850552,0.00009661747,0.00018693862,0.00014316471,0.000020815785,0.000006866624,0.0011518578],"genre_scores_gemma":[0.87611806,0.00008388879,0.12351579,0.0001257968,0.00009623033,0.0000071474446,0.000009355812,0.000020255404,0.000023444172],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872035,0.000020489673,0.0007560008,0.0002546803,0.00004663024,0.00020184599],"domain_scores_gemma":[0.9992201,0.0000332574,0.00055030425,0.0000863311,0.000017716839,0.00009231869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005029742,0.00013199281,0.00041887027,0.00020784892,0.000104012724,0.00009215172,0.00009434124,0.000045162502,0.000105264255],"category_scores_gemma":[0.0000106076905,0.00013944457,0.000060128037,0.00017326839,0.000037411213,0.00020565912,0.00009739318,0.00023459276,7.730396e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023767304,0.00012924992,0.0008021712,0.000010855054,0.000028505126,0.000005850344,0.0008039382,0.976507,0.000114922994,0.020485537,0.000010981686,0.0008633148],"study_design_scores_gemma":[0.0020201984,0.000077963814,0.00009408009,0.000007853022,0.000009112823,0.000056392983,0.0007279482,0.98583204,0.000007073613,0.010538464,0.0004564401,0.00017242364],"about_ca_topic_score_codex":0.000016150705,"about_ca_topic_score_gemma":3.4357342e-7,"teacher_disagreement_score":0.16348058,"about_ca_system_score_codex":0.000101087586,"about_ca_system_score_gemma":0.000028879078,"threshold_uncertainty_score":0.5686385},"labels":[],"label_agreement":null},{"id":"W4226363315","doi":"10.23952/jano.4.2022.1.05","title":"A new class of vector optimization problems with linear fractional objective criteria","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Vietnam Institute for Advanced Study in Mathematics; Le Quy Don Technical University; Vietnam Academy of Science and Technology","keywords":"Class (philosophy); Mathematics; Vector optimization; Mathematical optimization; Optimization problem; Computer science; Applied mathematics; Artificial intelligence; Multi-swarm optimization","score_opus":0.007806373512615274,"score_gpt":0.22506443750229171,"score_spread":0.21725806398967645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226363315","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001174662,0.000035574063,0.99776584,0.0011128066,0.00010357056,0.00011897086,0.000004253477,0.000018187922,0.0007233096],"genre_scores_gemma":[0.26463953,0.000036501347,0.7349174,0.0002230215,0.00009349292,0.000007851574,0.000018622968,0.000011189679,0.000052373864],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985902,0.00006574921,0.00047784808,0.00019557652,0.0005592536,0.00011137462],"domain_scores_gemma":[0.9985814,0.000086643384,0.0007451806,0.00011143526,0.00035899022,0.00011631668],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024842302,0.00012087926,0.00027671846,0.00025609156,0.00018155522,0.000060816492,0.00022498769,0.00003867028,0.00037049895],"category_scores_gemma":[0.000024885763,0.000100591424,0.000064917345,0.00089047005,0.000022192475,0.0004457425,0.000089813584,0.0001876457,5.1005145e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019082346,0.00012443808,0.000050223258,0.0000069020657,0.00007782053,0.000001315561,0.00039030125,0.9884471,0.000102273785,0.009768945,0.00017682713,0.0006630127],"study_design_scores_gemma":[0.0008871301,0.00041084614,0.00019340191,0.000007979272,0.000049053113,0.00004225226,0.00007953034,0.99714875,0.00008861635,0.0004861032,0.00048705054,0.000119281474],"about_ca_topic_score_codex":0.000009539031,"about_ca_topic_score_gemma":1.6720865e-7,"teacher_disagreement_score":0.26452205,"about_ca_system_score_codex":0.00007453094,"about_ca_system_score_gemma":0.00023602,"threshold_uncertainty_score":0.4101999},"labels":[],"label_agreement":null},{"id":"W4226394830","doi":"10.23952/jano.4.2022.1.08","title":"Optimality and duality for semidefinite multiobjective programming problems using convexificators","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Science and Engineering Research Board","keywords":"Duality (order theory); Semidefinite programming; Mathematical optimization; Semidefinite embedding; Multiobjective programming; Mathematics; Strong duality; Multi-objective optimization; Mathematical economics; Computer science; Combinatorics; Optimization problem; Quadratically constrained quadratic program; Quadratic programming","score_opus":0.02250132360065009,"score_gpt":0.2564471490728111,"score_spread":0.23394582547216097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226394830","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028169127,0.000059353064,0.9963113,0.0004304391,0.00006554686,0.00022553692,0.000005584939,0.000018144434,0.00006719963],"genre_scores_gemma":[0.43696398,0.000018044046,0.5628082,0.00014962816,0.000026360976,0.000016904032,0.000006526123,0.000005689628,0.0000046520845],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989295,0.00006623696,0.00041854367,0.00020619958,0.00025755612,0.00012198741],"domain_scores_gemma":[0.99897075,0.00013369115,0.0005143792,0.00008073698,0.00020528107,0.00009514311],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006819538,0.00009765184,0.00022823956,0.00014041716,0.0003733571,0.00012321495,0.00013165367,0.000031409952,0.000011611163],"category_scores_gemma":[0.000044287666,0.00008884734,0.000060432954,0.0004174595,0.000032172175,0.0002822975,0.00011169421,0.00012724176,7.3150815e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059272523,0.00009548934,0.00027064543,0.000014585424,0.00004772083,4.6716164e-7,0.00069477764,0.9806333,0.00008406835,0.014835452,0.000010690801,0.00325352],"study_design_scores_gemma":[0.00064729695,0.00012111876,0.00021438544,0.0000034993625,0.000044475375,0.000022959865,0.00022685135,0.99664265,0.000040562045,0.0014041082,0.00052136614,0.00011069837],"about_ca_topic_score_codex":0.000005073103,"about_ca_topic_score_gemma":5.3455476e-8,"teacher_disagreement_score":0.43414706,"about_ca_system_score_codex":0.00006244694,"about_ca_system_score_gemma":0.0000636299,"threshold_uncertainty_score":0.36230892},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05278498,0.0008838743,0.94514304,0.00012205561,0.0003259647,0.00026688777,0.000015062546,0.0000043794357,0.0004537586],"genre_scores_gemma":[0.8150597,0.000091025,0.18451639,0.00015489587,0.00012312004,0.0000138974365,0.0000026906787,0.00001976974,0.000018500945],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987508,0.000010392689,0.0007726806,0.00022408899,0.000053837917,0.0001881975],"domain_scores_gemma":[0.99901986,0.00017984331,0.00059766864,0.000119518474,0.000019727799,0.00006340585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007317514,0.00012275702,0.00037260636,0.00016802373,0.00018680627,0.00010136635,0.00017109782,0.000042152813,0.00013855456],"category_scores_gemma":[0.000033678265,0.00010474808,0.000109145054,0.00018111007,0.000023510294,0.00015556079,0.00007171077,0.00020875227,0.0000010293546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006084692,0.00008343459,0.00011340028,0.000003943764,0.000024306668,0.0000012145879,0.0005989608,0.9659504,0.000006847275,0.027994324,0.000047821042,0.0045668324],"study_design_scores_gemma":[0.0023400628,0.00008682028,0.00005696428,0.000013586703,0.000014154772,0.00003020247,0.001008843,0.9560202,0.0000022491402,0.038229257,0.0020576264,0.00014003884],"about_ca_topic_score_codex":0.000011526259,"about_ca_topic_score_gemma":0.0000011557742,"teacher_disagreement_score":0.76227474,"about_ca_system_score_codex":0.00012718819,"about_ca_system_score_gemma":0.000046780297,"threshold_uncertainty_score":0.42715028},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0069750957,0.000045198987,0.9906953,0.00045938857,0.00008257663,0.0007277007,0.000006518106,0.000015445083,0.0009927511],"genre_scores_gemma":[0.62905914,0.000015246223,0.37045234,0.00015038866,0.00014326758,0.000029912848,0.000018446619,0.000028370896,0.00010292271],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984523,0.00005730163,0.0007618177,0.00020904302,0.00027486734,0.00024469345],"domain_scores_gemma":[0.9985842,0.00063231215,0.00043098244,0.00010936997,0.00015049729,0.00009263687],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005703213,0.00016214489,0.00044391348,0.00007469239,0.00008199731,0.000087805,0.00013363388,0.00011860713,0.000053572152],"category_scores_gemma":[0.00021521286,0.00010378993,0.00009626896,0.00021784409,0.00009712829,0.00011933687,0.000032948185,0.000270923,0.0000018031736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002835829,0.0022005101,0.0030948992,0.0012971989,0.00041083305,0.000012134176,0.0033555324,0.6024823,0.0035303175,0.3127195,0.00054705516,0.06751387],"study_design_scores_gemma":[0.002522823,0.00035023445,0.00020408987,0.000062048515,0.00007749111,0.00004230304,0.00031279164,0.9533795,0.000118657066,0.04239411,0.00032064214,0.00021529754],"about_ca_topic_score_codex":0.0000027419512,"about_ca_topic_score_gemma":1.1217359e-7,"teacher_disagreement_score":0.622084,"about_ca_system_score_codex":0.000031682477,"about_ca_system_score_gemma":0.00004010088,"threshold_uncertainty_score":0.42324305},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006594934,0.000060240873,0.9979388,0.00014740264,0.00036226187,0.00065479847,0.0000036701372,0.00001881449,0.00015450554],"genre_scores_gemma":[0.24696593,0.00005984442,0.7527613,0.000106271524,0.000041239575,0.000014132134,0.0000042429456,0.000015732105,0.00003132449],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998677,0.00006071843,0.0005507531,0.00026233986,0.00029845984,0.00015073267],"domain_scores_gemma":[0.9979927,0.00017283903,0.00094294717,0.0002501536,0.00056962564,0.00007172318],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001877654,0.00014772158,0.0003392973,0.00011962295,0.00009788469,0.000053041073,0.0003199475,0.00008129677,0.000013411333],"category_scores_gemma":[0.00012070129,0.000109192224,0.00012517234,0.0003934857,0.000051084167,0.00045916167,0.00009808566,0.000118032316,9.129012e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011721305,0.00008933517,0.0001443469,0.000012269044,0.000037056237,3.4365507e-7,0.00049877586,0.9947791,0.00033823907,0.00049325434,0.000011150963,0.0034789278],"study_design_scores_gemma":[0.0016165159,0.000173394,0.00030687387,0.000020788879,0.000025472125,0.000018867562,0.00009362863,0.9919469,0.005316003,0.0003264735,0.00003320071,0.000121900346],"about_ca_topic_score_codex":0.0000022356683,"about_ca_topic_score_gemma":2.0527789e-7,"teacher_disagreement_score":0.24630643,"about_ca_system_score_codex":0.00007880884,"about_ca_system_score_gemma":0.00006512684,"threshold_uncertainty_score":0.44527298},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21070786,0.000120957855,0.7863548,0.00016317361,0.000048091864,0.00006915574,0.000029843839,0.000003357634,0.0025027606],"genre_scores_gemma":[0.9475105,0.00003785473,0.052289136,0.000016380338,0.000089705856,8.9927005e-7,0.000020418773,0.000006713297,0.000028401075],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993314,0.000019602547,0.00025945407,0.00010028401,0.00017870199,0.00011053081],"domain_scores_gemma":[0.99945056,0.000042549156,0.00018426492,0.00005640153,0.0001655055,0.00010074089],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005691112,0.00007770136,0.00022743188,0.00003773763,0.000037495898,0.000024751238,0.000045717905,0.00002746296,0.00018902679],"category_scores_gemma":[0.000010715262,0.00006619878,0.00004230288,0.00024661026,0.000043450844,0.00008182575,0.000045598135,0.000092035596,6.008154e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042842757,0.0048111943,0.08189778,0.00045157786,0.0017042853,0.00008434014,0.0011863344,0.2596623,0.048263963,0.03859337,0.0005210961,0.5585395],"study_design_scores_gemma":[0.03737996,0.0027199453,0.061112933,0.0007153199,0.0013416368,0.00031200008,0.011479059,0.6620526,0.16528742,0.048682243,0.00638794,0.0025289864],"about_ca_topic_score_codex":0.0000035304813,"about_ca_topic_score_gemma":8.713558e-8,"teacher_disagreement_score":0.73680264,"about_ca_system_score_codex":0.000011135824,"about_ca_system_score_gemma":0.000038999224,"threshold_uncertainty_score":0.2699508},"labels":[],"label_agreement":null},{"id":"W4230794122","doi":"10.23952/jano.2.2020.2.05","title":"Weak convergence of a primal-dual algorithm for split common fixed-point problems in Hilbert spaces","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Tianjin Municipal Education Commission","keywords":"Convergence (economics); Hilbert space; Mathematics; Fixed point; Dual (grammatical number); Algorithm; Weak convergence; Computer science; Pure mathematics; Mathematical analysis; Linguistics","score_opus":0.011845325650636642,"score_gpt":0.22799098491161757,"score_spread":0.21614565926098092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230794122","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032700508,0.000053130643,0.9953051,0.003807925,0.000045466368,0.00016711999,0.0000037329294,0.000009804219,0.0002806676],"genre_scores_gemma":[0.27027544,0.000120652,0.72901255,0.0004988916,0.000060398776,0.0000067577425,0.00000846573,0.0000070379137,0.000009797005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887085,0.00002708033,0.0005782491,0.00016975406,0.0002423712,0.00011169132],"domain_scores_gemma":[0.99900395,0.00010492957,0.0005108324,0.00007034725,0.00019649218,0.00011347143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023645433,0.00010149694,0.000330894,0.00010958476,0.00004052534,0.00005767641,0.00018287763,0.000052307623,0.00003071694],"category_scores_gemma":[0.00003778836,0.00008499195,0.00007159542,0.0005118326,0.00002649064,0.0003091184,0.000057837467,0.00009608528,7.129904e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053454027,0.00011793599,0.0002810517,0.00003073443,0.0000380639,8.0198066e-7,0.00077087677,0.97317916,0.00017017683,0.014276671,0.00015061298,0.010930448],"study_design_scores_gemma":[0.00078690576,0.00021224562,0.00029052355,0.000015642045,0.000022452761,0.0000047546832,0.00006081491,0.99692243,0.000293484,0.00087209896,0.00042314827,0.000095500174],"about_ca_topic_score_codex":0.0000057899965,"about_ca_topic_score_gemma":3.0988477e-7,"teacher_disagreement_score":0.26994842,"about_ca_system_score_codex":0.000022274688,"about_ca_system_score_gemma":0.000058581976,"threshold_uncertainty_score":0.34658712},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0354597,0.00004592279,0.96363,0.000114929935,0.000075725715,0.00025750932,0.0000021944757,0.000031061278,0.00038293947],"genre_scores_gemma":[0.5619006,0.000053947846,0.43788165,0.000057350284,0.000055328102,0.000008682107,0.000019401828,0.000017646273,0.0000054055026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991731,0.000013561914,0.00033187584,0.00014282422,0.00020598099,0.00013265097],"domain_scores_gemma":[0.9995442,0.000052030122,0.00014267299,0.000066730434,0.000107142034,0.000087206536],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021240403,0.0001275409,0.0002037772,0.00037037596,0.00004395454,0.000062892184,0.000055085384,0.000076799886,0.00002312117],"category_scores_gemma":[0.0000179019,0.0001106767,0.00001397356,0.0004502512,0.000012920904,0.00020916887,0.000016596794,0.00012356961,0.0000011442513],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008919091,0.0000117148,0.0005413252,0.000023431896,0.000014519858,4.497336e-7,0.00056637084,0.99418586,0.00014556185,0.00168737,0.0000022103552,0.0027319859],"study_design_scores_gemma":[0.00082001643,0.00007068537,0.0021437719,0.000027070295,0.000015232975,0.000016410742,0.00021672879,0.996236,0.00017209353,0.00010087647,0.000043587304,0.0001375291],"about_ca_topic_score_codex":0.0000011669516,"about_ca_topic_score_gemma":2.848119e-7,"teacher_disagreement_score":0.5264409,"about_ca_system_score_codex":0.00005737189,"about_ca_system_score_gemma":0.000018632785,"threshold_uncertainty_score":0.4513265},"labels":[],"label_agreement":null},{"id":"W4231809672","doi":"10.23952/jano.2.2020.1.08","title":"Three extensions of Butnariu-Reich-Zaslavski theorem for inexact infinite products of nonexpansive mappings","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Pure mathematics; Algebra over a field","score_opus":0.017310395515079815,"score_gpt":0.22640861560569664,"score_spread":0.20909822009061682,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231809672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00089241634,0.000054716136,0.9940197,0.0045721736,0.000046942747,0.0001703916,0.0000061540745,0.000010903533,0.0002266073],"genre_scores_gemma":[0.52760214,0.0000665552,0.4717855,0.0004505742,0.000074769894,0.000002800724,0.000007440704,0.000007092967,0.0000031254579],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987783,0.000018905703,0.000640066,0.00018089096,0.00027891307,0.00010294432],"domain_scores_gemma":[0.99775726,0.00017863419,0.00087884866,0.000120691446,0.00095744943,0.00010710316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022497345,0.00011247642,0.00038779236,0.00014474006,0.00005818838,0.00003111958,0.00023592912,0.000055543864,0.000014911549],"category_scores_gemma":[0.00027217582,0.00008858104,0.0000984742,0.0007247408,0.00004520771,0.00026844864,0.000068781716,0.00009360002,5.405848e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023834339,0.00013055658,0.00007265509,0.000063347914,0.00012605186,8.338537e-7,0.001049703,0.90823954,0.0037703796,0.08393077,0.00025740755,0.0021204061],"study_design_scores_gemma":[0.0008170835,0.0003239722,0.0003678992,0.00002459558,0.00007985479,0.000005214573,0.00006654314,0.9919665,0.0021668596,0.003844908,0.00022546659,0.0001111173],"about_ca_topic_score_codex":0.000002173712,"about_ca_topic_score_gemma":7.5017965e-8,"teacher_disagreement_score":0.52670974,"about_ca_system_score_codex":0.000011056279,"about_ca_system_score_gemma":0.00010889478,"threshold_uncertainty_score":0.36122298},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030922933,0.000046671114,0.9679559,0.00042295756,0.000060316313,0.00014910048,0.000003323077,0.000014927213,0.00042386955],"genre_scores_gemma":[0.30383733,0.000031026797,0.6959316,0.000083240986,0.000090617155,0.0000016430054,0.0000048703746,0.000015394171,0.0000042708502],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987732,0.0001513629,0.00066889235,0.00011254617,0.00019659003,0.00009741456],"domain_scores_gemma":[0.9986457,0.00033579292,0.0005556189,0.000069071335,0.0002781055,0.00011566442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00044543255,0.00011448623,0.0003826974,0.00009340095,0.00005458012,0.00002737594,0.000085547326,0.00006546102,0.000050293536],"category_scores_gemma":[0.0005769707,0.00009258034,0.000069395806,0.00043326037,0.00004172263,0.00012315935,0.00002680332,0.00015338135,6.134088e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015534385,0.0010442039,0.0007006726,0.00044168212,0.00055098796,0.000010470184,0.019910503,0.5245374,0.29419115,0.09253845,0.0004218628,0.06409916],"study_design_scores_gemma":[0.0020916231,0.0008783954,0.00026831066,0.000053514745,0.0003272199,0.000028146676,0.00045724868,0.8823979,0.0896123,0.022387378,0.0011602506,0.00033770403],"about_ca_topic_score_codex":5.45205e-7,"about_ca_topic_score_gemma":3.2528547e-8,"teacher_disagreement_score":0.3578605,"about_ca_system_score_codex":0.000020540507,"about_ca_system_score_gemma":0.00003755787,"threshold_uncertainty_score":0.37753168},"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":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21355276,0.000046404668,0.26178592,0.0037989793,0.0024472394,0.0006772486,0.000026069138,0.00003285019,0.5176325],"genre_scores_gemma":[0.98189855,0.000015111482,0.012333786,0.00034057497,0.0050693536,0.000002408925,0.00000763826,0.000013042534,0.00031951035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99943537,0.0000080675445,0.00021432701,0.000089640984,0.00014818556,0.000104429906],"domain_scores_gemma":[0.99959093,0.00003356183,0.00014812963,0.0000511639,0.00006870348,0.00010749052],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00005186307,0.00008595756,0.00020797295,0.000054304044,0.00005114328,0.000028633005,0.000060091726,0.000021783175,0.0012613971],"category_scores_gemma":[0.0000026165135,0.00006789162,0.000043981407,0.00016100709,0.000011623112,0.00005769979,0.00003271446,0.0001078034,0.00007323241],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019959698,0.0009957353,0.01737504,0.000047664053,0.00055363856,0.000005729729,0.0042575877,0.4779451,0.005241335,0.039855894,0.20270674,0.24901958],"study_design_scores_gemma":[0.008314841,0.0018212902,0.0058023296,0.00015903737,0.00032505448,0.00001346613,0.005929511,0.07656496,0.008905799,0.009410446,0.88125587,0.0014973737],"about_ca_topic_score_codex":0.0000064816195,"about_ca_topic_score_gemma":3.841137e-8,"teacher_disagreement_score":0.76834583,"about_ca_system_score_codex":0.000008827976,"about_ca_system_score_gemma":0.0000208687,"threshold_uncertainty_score":0.9996516},"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.52882,0.00007751879,0.470275,0.00012845376,0.000051238098,0.00025695024,0.0000035453584,0.000005772557,0.00038149575],"genre_scores_gemma":[0.8553646,0.00012114222,0.14436457,0.0000284095,0.000039049104,0.000006482419,0.00000815713,0.000010924522,0.00005663098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991939,0.00003864439,0.00044565302,0.00010088101,0.0001320997,0.000088834815],"domain_scores_gemma":[0.9988553,0.00035869874,0.00053025817,0.0000551166,0.00016531679,0.000035310906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046729887,0.00009757415,0.00031444593,0.00012964557,0.000036639605,0.00003168128,0.000045446242,0.00006311401,0.000028097069],"category_scores_gemma":[0.00016680843,0.00007790656,0.000029841098,0.00014653312,0.00005105936,0.0003085361,0.000014601027,0.00008171724,4.0042784e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.008572146,0.000613621,0.0035942486,0.0017996649,0.00022971474,0.0000011635124,0.012560441,0.35544285,0.008843489,0.6001133,0.00020314404,0.008026223],"study_design_scores_gemma":[0.007250077,0.004969196,0.00096790236,0.0007522242,0.00023994173,0.000047798767,0.026173405,0.326597,0.012453676,0.61919695,0.0005807725,0.0007710518],"about_ca_topic_score_codex":0.0000011695821,"about_ca_topic_score_gemma":2.144811e-7,"teacher_disagreement_score":0.32654464,"about_ca_system_score_codex":0.000015673935,"about_ca_system_score_gemma":0.000029039484,"threshold_uncertainty_score":0.31769374},"labels":[],"label_agreement":null},{"id":"W4233846768","doi":"10.23952/jano.1.2019.2.08","title":"Generalized monotone mixed equilibrium problems in FC-spaces: Existence and approximation","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"University of Central Florida","keywords":"Monotone polygon; Mathematics; Applied mathematics; Pure mathematics; Mathematical economics; Mathematical optimization; Mathematical analysis; Geometry","score_opus":0.009947744684997567,"score_gpt":0.21528139591667378,"score_spread":0.2053336512316762,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4233846768","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04163407,0.00009781901,0.9565587,0.0007753284,0.000070387425,0.00016442695,5.7503985e-7,0.000015085599,0.00068362633],"genre_scores_gemma":[0.60037947,0.00017519016,0.39917454,0.00018270855,0.000028939969,0.00000522636,0.000006906102,0.0000066810708,0.000040310064],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895465,0.000043124717,0.0004361155,0.00019765717,0.0002494548,0.000118992844],"domain_scores_gemma":[0.99925643,0.000056451016,0.00037259609,0.000105721745,0.00012344123,0.000085351276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032113786,0.00010602373,0.00026451406,0.00021506324,0.00003306899,0.00016747414,0.00015043476,0.000060805312,0.000020621677],"category_scores_gemma":[0.000020279998,0.000087520464,0.000035560908,0.000497466,0.000019464871,0.0006034271,0.00006528243,0.00010083842,0.0000029313096],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000038483096,0.000063844294,0.0005663669,0.000020649317,0.000016022115,6.3444554e-7,0.00040579212,0.9661768,0.00072060525,0.030135911,0.000014287171,0.0018406218],"study_design_scores_gemma":[0.00093822187,0.00008902103,0.0010680592,0.00001752842,0.000011276728,0.0000103168995,0.00003914265,0.9947497,0.00011065186,0.0027376101,0.00011887834,0.000109585046],"about_ca_topic_score_codex":0.000004815482,"about_ca_topic_score_gemma":2.8743736e-7,"teacher_disagreement_score":0.55874544,"about_ca_system_score_codex":0.000029394389,"about_ca_system_score_gemma":0.00003432062,"threshold_uncertainty_score":0.3568981},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10050825,0.00009155806,0.8984871,0.000025301943,0.00007450262,0.00017930608,0.0000025267816,0.000016462745,0.0006149831],"genre_scores_gemma":[0.90598327,0.00015353132,0.0936949,0.00007556483,0.000053084572,0.000004927844,0.000012861171,0.000019516609,0.0000023179655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992217,0.000015824455,0.00040124715,0.00010707191,0.00013914269,0.000115010094],"domain_scores_gemma":[0.9995885,0.00003502249,0.00013415542,0.00006143075,0.000103768,0.00007714423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011817734,0.00011123558,0.00027449068,0.00019376341,0.000017596365,0.000025953726,0.00006297578,0.00007673177,0.000018729448],"category_scores_gemma":[0.0000056912386,0.000098290926,0.000033642187,0.00025540445,0.000009555343,0.0002502523,0.000009602952,0.0001515195,9.83403e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036883343,0.000084048486,0.00021891156,0.000019701123,0.000025281728,2.9639367e-7,0.0004804403,0.9965419,0.0011007186,0.00003860511,0.000022743978,0.0010984779],"study_design_scores_gemma":[0.0008331491,0.0001208362,0.00020109578,0.000024646153,0.00001494637,0.000006984936,0.00009011234,0.99827594,0.00019299111,0.00004732214,0.00008525389,0.000106719024],"about_ca_topic_score_codex":0.000002489157,"about_ca_topic_score_gemma":1.8870193e-7,"teacher_disagreement_score":0.80547506,"about_ca_system_score_codex":0.000036403173,"about_ca_system_score_gemma":0.000016398155,"threshold_uncertainty_score":0.40081877},"labels":[],"label_agreement":null},{"id":"W4234435134","doi":"10.23952/jano.2.2020.1.07","title":"Inexact orbits of set-valued nonexpansive mappings with summable errors","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Israel Science Foundation","keywords":"Set (abstract data type); Computer science; Mathematics; Programming language","score_opus":0.012483671187066567,"score_gpt":0.2138085194490388,"score_spread":0.20132484826197225,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234435134","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014429219,0.000027201206,0.9951435,0.0024602904,0.000023828901,0.00006982888,0.0000015298062,0.000015173124,0.0008157799],"genre_scores_gemma":[0.6174923,0.00004748715,0.38157153,0.0008182919,0.0000452164,0.0000011701042,0.0000051045176,0.0000071590207,0.0000117204145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99896014,0.000025585643,0.0004126926,0.00015746446,0.00034209486,0.00010199923],"domain_scores_gemma":[0.99879223,0.000045927463,0.0005693949,0.000080611535,0.0003594594,0.00015236039],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012874365,0.00010748956,0.00030498483,0.000114551396,0.00005713011,0.000053971526,0.0002049566,0.000043706194,0.000036530695],"category_scores_gemma":[0.000037584276,0.00007929753,0.000052327232,0.0007764191,0.000029366727,0.00037600705,0.00004827745,0.000110462075,0.0000016477918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013508135,0.000041376337,0.00011490257,0.000015035382,0.00007409627,0.0000029151295,0.0008572984,0.98971134,0.0002832758,0.008197769,0.0001543627,0.00041252244],"study_design_scores_gemma":[0.0007674857,0.0002578361,0.00018523485,0.00001510773,0.000048145463,0.000009841346,0.0001113859,0.9975749,0.0005072956,0.00018019887,0.00023543555,0.00010710267],"about_ca_topic_score_codex":0.000003568976,"about_ca_topic_score_gemma":6.7936185e-8,"teacher_disagreement_score":0.6160494,"about_ca_system_score_codex":0.0000152331695,"about_ca_system_score_gemma":0.000081541046,"threshold_uncertainty_score":0.32336596},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007750657,0.00014472258,0.9914046,0.000200255,0.000024733114,0.00031287098,0.0000022605307,0.00009584122,0.00006405766],"genre_scores_gemma":[0.5943101,0.00004827265,0.40524846,0.00018396546,0.0001849557,0.0000033499805,0.000003920859,0.000016800026,1.84944e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940103,0.000006646846,0.0002696367,0.00011531981,0.00010055733,0.000106802596],"domain_scores_gemma":[0.99955505,0.00004875456,0.00009365337,0.00004396854,0.0001041997,0.0001543559],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008430919,0.00009993125,0.0001925581,0.00005731166,0.00015224401,0.000054207314,0.00005921287,0.000051246563,0.0000011457323],"category_scores_gemma":[0.0000131471,0.00009382212,0.000021091377,0.00012227304,0.000008721091,0.00011570239,0.00006520598,0.00010273528,1.5388e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002579486,0.000011235117,9.463122e-7,0.0000229429,0.00001216553,6.125638e-7,0.0007333424,0.7560642,0.13100012,0.00005729531,0.000038891958,0.11203249],"study_design_scores_gemma":[0.00026852105,0.00011879145,0.0000052052037,0.00003486032,0.000023083403,0.0000080924,0.000048861584,0.9760865,0.022366224,0.0001916248,0.00074046466,0.00010777097],"about_ca_topic_score_codex":7.0222166e-7,"about_ca_topic_score_gemma":3.7699397e-8,"teacher_disagreement_score":0.5865594,"about_ca_system_score_codex":0.000013926082,"about_ca_system_score_gemma":0.0000063506895,"threshold_uncertainty_score":0.3825955},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014789074,0.001949976,0.98083234,0.00007834127,0.0025269405,0.00027745566,0.000016758884,0.00003925202,0.014131056],"genre_scores_gemma":[0.22949414,0.017645577,0.7481731,0.00029955443,0.0027941193,0.000022374177,0.00018979127,0.00052401336,0.00085732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971818,0.00003663358,0.0016338996,0.0002738758,0.00050688884,0.00036694936],"domain_scores_gemma":[0.99769926,0.00019388992,0.0012506172,0.00020571453,0.00035205096,0.0002984493],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00035869828,0.00054578664,0.0013579155,0.0006912554,0.000085939915,0.00013309187,0.00029849165,0.0006855279,0.00056158326],"category_scores_gemma":[0.000048077683,0.0005079262,0.00015786788,0.0004581114,0.00011087396,0.0003111649,0.00007314016,0.0011207686,0.000026417836],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021062673,0.000047356516,0.000004489405,0.00022151774,0.00027133257,0.0000054625684,0.00023869691,0.9886844,0.00017623525,0.00018499393,0.008249095,0.0017057565],"study_design_scores_gemma":[0.0017604767,0.00023343234,0.000015127907,0.00015523397,0.0002592592,0.00024430628,0.000120404125,0.98622155,0.0002630099,0.000047832764,0.010128599,0.0005507446],"about_ca_topic_score_codex":6.430608e-7,"about_ca_topic_score_gemma":1.481441e-8,"teacher_disagreement_score":0.2326592,"about_ca_system_score_codex":0.00016202677,"about_ca_system_score_gemma":0.000118877004,"threshold_uncertainty_score":0.99973726},"labels":[],"label_agreement":null},{"id":"W4236705252","doi":"10.23952/jano.2.2020.3.05","title":"An inertial Mann-like algorithm for fixed points of nonexpansive mappings in Hilbert spaces","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Inertial frame of reference; Hilbert space; Fixed point; Mathematics; Algorithm; Computer science; Pure mathematics; Mathematical analysis; Physics","score_opus":0.009497754820999958,"score_gpt":0.23014544622213567,"score_spread":0.22064769140113571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236705252","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00084067066,0.000018406456,0.9949906,0.003897338,0.000052324493,0.00010787233,0.0000030734097,0.000009127189,0.00008062203],"genre_scores_gemma":[0.22427703,0.000042450243,0.7743004,0.0012618508,0.000091322545,0.0000036732806,0.000012069451,0.000006861875,0.000004352406],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990215,0.000027037124,0.0004642633,0.00016805378,0.00021875916,0.000100423116],"domain_scores_gemma":[0.9990772,0.00006642154,0.0004137109,0.00006867232,0.00024831315,0.00012569646],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001629788,0.00009456103,0.00028637424,0.00014888638,0.00003852838,0.0000628751,0.00020623795,0.000054319575,0.000015007647],"category_scores_gemma":[0.00003395172,0.000081132894,0.00006127496,0.00047716883,0.000019557869,0.0004074909,0.000034166944,0.00007917135,4.809841e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012414293,0.00014688639,0.00009701217,0.0000152064395,0.000045583347,0.0000019533145,0.0014090503,0.977349,0.0007525614,0.0044177747,0.00015615115,0.015484669],"study_design_scores_gemma":[0.000975449,0.00023424855,0.0002734314,0.000008280802,0.000020579735,0.0000025805382,0.00009272458,0.9973315,0.00037946278,0.00035832703,0.0002324093,0.00009101435],"about_ca_topic_score_codex":0.000004568643,"about_ca_topic_score_gemma":1.8208972e-7,"teacher_disagreement_score":0.22343637,"about_ca_system_score_codex":0.000016696209,"about_ca_system_score_gemma":0.000047586935,"threshold_uncertainty_score":0.33085033},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.031009408,0.000034031185,0.96714944,0.00029871528,0.000035544115,0.00057353114,0.0000010791119,0.000012927159,0.00088532397],"genre_scores_gemma":[0.2947869,0.000024140782,0.70506305,0.000045068762,0.00001923978,0.000016720744,0.000005301592,0.000019325666,0.000020271857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989021,0.00007569082,0.000523033,0.0001645301,0.00017984989,0.00015482148],"domain_scores_gemma":[0.99858063,0.00045316352,0.00063926325,0.000120959645,0.00013815907,0.00006779622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001040623,0.00014637872,0.00048934435,0.00023630157,0.000039882812,0.000052898617,0.000087198634,0.0000796694,0.00003783712],"category_scores_gemma":[0.00010772813,0.00010231338,0.00008729746,0.0003422144,0.000030896375,0.00020625594,0.00001996098,0.0001557107,6.517578e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023260503,0.0008155571,0.001399649,0.0006306098,0.00047944032,0.0000019593938,0.0035226492,0.7527693,0.0106622055,0.21305682,0.00022598333,0.014109792],"study_design_scores_gemma":[0.0043098414,0.0007659322,0.00025686793,0.00017335148,0.00031175543,0.000035474874,0.00053110917,0.70975053,0.0041351877,0.27912593,0.00023204225,0.00037195696],"about_ca_topic_score_codex":0.00000482242,"about_ca_topic_score_gemma":0.0000012012066,"teacher_disagreement_score":0.2637775,"about_ca_system_score_codex":0.000047614783,"about_ca_system_score_gemma":0.000025433412,"threshold_uncertainty_score":0.41722184},"labels":[],"label_agreement":null},{"id":"W4239109439","doi":"10.23952/jano.1.2019.2.06","title":"Three convergence results for inexact orbits of nonexpansive mappings","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Mathematics; Applied mathematics; Mathematical economics; Economics; Macroeconomics","score_opus":0.008836865933084513,"score_gpt":0.2199011869786978,"score_spread":0.21106432104561326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239109439","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013370697,0.00002435133,0.99678165,0.00082083326,0.000121988334,0.00014312683,0.0000044497524,0.000008255771,0.0007582887],"genre_scores_gemma":[0.5766614,0.00005970364,0.42297462,0.00021458018,0.00004536396,0.0000023190482,0.00000791996,0.000005064503,0.000029033225],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989848,0.00001019324,0.00051736913,0.00015416098,0.0002393069,0.0000941324],"domain_scores_gemma":[0.9984968,0.00015271512,0.0006691576,0.00011607955,0.000495468,0.00006981632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026170816,0.00008557901,0.0002628696,0.00014068595,0.000039183524,0.000037922357,0.00021016847,0.0000509032,0.000020741692],"category_scores_gemma":[0.00006450917,0.00006896175,0.00007564164,0.00038643944,0.000017337341,0.00030157354,0.000041283878,0.0000652987,0.000002462345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002534078,0.000065371525,0.00015533948,0.000021333975,0.00006110489,3.70055e-7,0.00027377222,0.9591221,0.0006685059,0.037829973,0.00031309712,0.001235595],"study_design_scores_gemma":[0.0011485232,0.00019238348,0.0005543412,0.00001557602,0.000024246372,0.0000045048346,0.000026057869,0.9951584,0.00050393253,0.0019097925,0.000373377,0.00008891028],"about_ca_topic_score_codex":0.0000028505924,"about_ca_topic_score_gemma":1.1354159e-7,"teacher_disagreement_score":0.57532436,"about_ca_system_score_codex":0.000016289945,"about_ca_system_score_gemma":0.00006161079,"threshold_uncertainty_score":0.28121787},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013159185,0.00013675226,0.9976747,0.0010200447,0.000071887385,0.00057450344,0.00001198103,0.00007098732,0.00030756558],"genre_scores_gemma":[0.040011223,0.0003056876,0.95869356,0.00074292487,0.00015450368,0.000027174174,0.00002313807,0.000038190876,0.0000036072654],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990045,0.000022526376,0.0005001456,0.00014993717,0.00017552983,0.00014738688],"domain_scores_gemma":[0.9992939,0.00019685081,0.00017672514,0.000090350884,0.00011145889,0.00013067693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020198694,0.00015888084,0.00030394003,0.00003351432,0.00008853715,0.00008576021,0.00010951364,0.00008131663,0.00008004979],"category_scores_gemma":[0.00011380243,0.00010957132,0.000082442406,0.00018900033,0.000033401455,0.00014316135,0.000017861808,0.0001844211,0.0000028102372],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003503592,0.000066941015,0.0000018392934,0.00005068011,0.00003865078,3.4458057e-7,0.00029410084,0.9827835,0.00006188106,0.00043410034,0.00015759715,0.016075352],"study_design_scores_gemma":[0.0008149957,0.00012808836,0.000005227599,0.000036882328,0.000053288248,0.0000013759527,0.00008874729,0.9973684,0.00012292819,0.00024779607,0.0010077137,0.00012456824],"about_ca_topic_score_codex":4.5647917e-7,"about_ca_topic_score_gemma":4.2035335e-8,"teacher_disagreement_score":0.03987963,"about_ca_system_score_codex":0.000035785288,"about_ca_system_score_gemma":0.000014673636,"threshold_uncertainty_score":0.4468189},"labels":[],"label_agreement":null},{"id":"W4239889688","doi":"10.23952/jano.1.2019.3.06","title":"Semicontinuity of the composition of set-valued map and scalarization function for sets","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Composition (language); Set (abstract data type); Function (biology); Mathematics; Computer science; Biology; Philosophy; Evolutionary biology","score_opus":0.006008323978339901,"score_gpt":0.21396936103636302,"score_spread":0.20796103705802313,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239889688","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.015875833,0.000028115339,0.9832428,0.0004458396,0.000118409145,0.00017614504,0.000003953412,0.0000049890427,0.00010393514],"genre_scores_gemma":[0.87924385,0.000019188357,0.12058463,0.000104421495,0.0000196743,0.0000014887388,0.0000096224985,0.000003920855,0.000013207456],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991985,0.000035899062,0.00039087798,0.00010800008,0.00020837314,0.000058337315],"domain_scores_gemma":[0.99882203,0.00007274526,0.000661213,0.00009328161,0.0003157449,0.000034974244],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026313175,0.00006804504,0.00020576607,0.000089227025,0.000053665062,0.000030555475,0.00011137413,0.000054245662,0.0000107589185],"category_scores_gemma":[0.000017030492,0.0000487551,0.000062574945,0.00026433388,0.000025105524,0.00024525812,0.000042925996,0.00005570839,2.1507786e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020120094,0.000090546026,0.0015273287,0.00007102651,0.00007294211,3.3168515e-8,0.00032301433,0.9370389,0.008145284,0.04960416,0.00007029452,0.0028552627],"study_design_scores_gemma":[0.00077383325,0.00012351813,0.004788812,0.000024626774,0.000067391105,0.000003022985,0.000025586265,0.9898829,0.0018234034,0.0023818582,0.00004656007,0.000058477905],"about_ca_topic_score_codex":0.0000015029735,"about_ca_topic_score_gemma":6.747113e-8,"teacher_disagreement_score":0.86336803,"about_ca_system_score_codex":0.000014251576,"about_ca_system_score_gemma":0.0000296256,"threshold_uncertainty_score":0.19881752},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":"editorial","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000027901624,0.00007791013,0.46221587,0.001496867,0.53431326,0.00023396974,0.000004624379,0.000027157146,0.0016275755],"genre_scores_gemma":[0.00006613178,0.00020794282,0.060994174,0.00009423055,0.9381371,0.000010031683,0.000032504482,0.000027081576,0.00043080907],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99720067,0.00011149666,0.0009808291,0.0004267958,0.0010507709,0.00022945578],"domain_scores_gemma":[0.9976923,0.00031940272,0.00087145506,0.0002546105,0.00054536195,0.00031690925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005764241,0.00029344292,0.00089018286,0.0002259094,0.00014398593,0.0003929269,0.0003579894,0.00061692455,0.00007686815],"category_scores_gemma":[0.00059035746,0.00023377938,0.000118231575,0.00056492834,0.000028790868,0.00019705603,0.0001537833,0.00064196036,0.0000043013297],"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.00008823409,0.000109361456,2.262955e-7,0.000067183755,0.00012667873,0.000011691438,0.00027721716,0.08617969,0.000011052645,0.0012791316,0.90873414,0.0031154107],"study_design_scores_gemma":[0.0011622326,0.00044758344,9.27863e-7,0.000263274,0.000180513,0.0000071849695,0.000037042784,0.24376607,0.000013722779,0.0005619034,0.7532077,0.00035184593],"about_ca_topic_score_codex":0.000003959047,"about_ca_topic_score_gemma":4.3536028e-7,"teacher_disagreement_score":0.40382385,"about_ca_system_score_codex":0.000079388046,"about_ca_system_score_gemma":0.00017005409,"threshold_uncertainty_score":0.9533247},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010172024,0.0001955773,0.989112,0.000045324396,0.00005900243,0.00013185738,0.000013838299,0.000007741972,0.00026262764],"genre_scores_gemma":[0.41746554,0.00019850634,0.5822349,0.000011506331,0.000046506248,0.000004046423,0.000015278329,0.000015785972,0.000007898379],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917823,0.000021991786,0.00042436202,0.000089541914,0.00014897378,0.00013688288],"domain_scores_gemma":[0.9994257,0.00018458023,0.00010900178,0.00006568335,0.0001429663,0.00007203618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029684798,0.000086872125,0.00026438263,0.00008634352,0.000020922578,0.000017578888,0.00006596682,0.00006019588,0.000044641238],"category_scores_gemma":[0.0000444044,0.00008222949,0.000038256545,0.00019659309,0.000028589307,0.00011603452,0.000028374063,0.00012894261,4.0072607e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007548464,0.000040429022,0.000011617994,0.00006157414,0.00003111449,0.0000010351167,0.0001479436,0.9054705,0.089878716,0.0003357912,0.000023881952,0.003921908],"study_design_scores_gemma":[0.000545473,0.00006878556,0.000069423986,0.000018479484,0.000033199056,0.000007821237,0.000125432,0.99202305,0.004217045,0.0027958718,0.000017313103,0.000078095974],"about_ca_topic_score_codex":8.1575166e-7,"about_ca_topic_score_gemma":4.0814676e-8,"teacher_disagreement_score":0.40729353,"about_ca_system_score_codex":0.00007415866,"about_ca_system_score_gemma":0.000044664775,"threshold_uncertainty_score":0.3353221},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.026402391,0.001179533,0.96767914,0.00016225954,0.00039970758,0.00039304578,0.000015904088,0.000011232549,0.0037567555],"genre_scores_gemma":[0.8580387,0.00029907213,0.14113143,0.00022812205,0.00018011793,0.000013922841,0.000008202531,0.000029186154,0.00007123954],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878055,0.00001071284,0.00071610784,0.0002471798,0.000027791113,0.00021767626],"domain_scores_gemma":[0.9987804,0.00018945758,0.0007358936,0.00009997303,0.00007305575,0.00012117859],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008151516,0.00014725354,0.00051750103,0.0001434485,0.00008232589,0.00012291514,0.00008176907,0.000111679685,0.000053295364],"category_scores_gemma":[0.000054089345,0.00014952787,0.00007907424,0.00007295204,0.000046184156,0.00048017988,0.000050007482,0.00014601662,0.0000027921171],"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.00039463653,0.000040899067,0.00028413913,0.00007205119,0.00007557572,1.854327e-7,0.00032602352,0.3605531,0.0005867509,0.6346843,0.000049306786,0.002933025],"study_design_scores_gemma":[0.0011409656,0.0002018352,0.00008391127,0.000016592085,0.000026737573,0.000008169246,0.00014791111,0.7808084,0.00009147309,0.21662864,0.0006826393,0.00016273277],"about_ca_topic_score_codex":0.0000061115034,"about_ca_topic_score_gemma":1.0428298e-7,"teacher_disagreement_score":0.8316363,"about_ca_system_score_codex":0.000073524265,"about_ca_system_score_gemma":0.000025928166,"threshold_uncertainty_score":0.60975695},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.007558906,0.00004099505,0.9873456,0.00014631581,0.00007679885,0.0003760274,9.306584e-7,0.000038001584,0.0044164397],"genre_scores_gemma":[0.17958847,0.00010164017,0.82004136,0.00006111332,0.00007437124,0.000007996616,0.0000035684343,0.000024467321,0.000096994736],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988799,0.000028290822,0.00044459183,0.00012824115,0.00034898854,0.0001700017],"domain_scores_gemma":[0.9989828,0.00021166279,0.00041587485,0.00010052767,0.00020569786,0.000083468956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017811438,0.00011259262,0.00030656686,0.00007150347,0.00005737983,0.00005595369,0.0000949077,0.00006705235,0.00023221251],"category_scores_gemma":[0.00012569454,0.000088012894,0.000050316055,0.00022705429,0.000034310648,0.00022215431,0.000045791847,0.00022229178,0.000005324549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007685538,0.0013442633,0.0005553987,0.00031847841,0.0002593776,0.000012417891,0.0019220304,0.8328789,0.0017014234,0.06605322,0.0005709132,0.09361501],"study_design_scores_gemma":[0.00282877,0.0005899045,0.000113756956,0.000074283686,0.000058375255,0.00004790154,0.0004489199,0.9607886,0.0008404452,0.032756727,0.001173018,0.00027927497],"about_ca_topic_score_codex":3.5874592e-7,"about_ca_topic_score_gemma":1.8976197e-8,"teacher_disagreement_score":0.17202955,"about_ca_system_score_codex":0.00003450119,"about_ca_system_score_gemma":0.000029115101,"threshold_uncertainty_score":0.35890618},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15144019,0.0002823493,0.84623337,0.000230408,0.00012733939,0.000050686416,0.0000025167283,0.0000072770995,0.0016258849],"genre_scores_gemma":[0.96213454,0.00009869901,0.03739824,0.000057301982,0.000070535905,5.3358013e-7,0.000002571585,0.000006438071,0.00023112651],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993513,0.000022846316,0.00035090576,0.000072919865,0.00014166153,0.000060335875],"domain_scores_gemma":[0.999109,0.00025173713,0.0003102992,0.000058724632,0.0002054119,0.000064821266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016566705,0.00006806106,0.0002562073,0.00008528966,0.00005407418,0.000015576778,0.000025516618,0.00004630007,0.00021084108],"category_scores_gemma":[0.00025033447,0.00005147758,0.000042485768,0.00025811084,0.00006350445,0.00006834073,0.00001913063,0.00009146176,4.220293e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030914885,0.0012267058,0.012023298,0.001573062,0.0019697812,0.000064739455,0.004608467,0.26656246,0.0047566784,0.627345,0.008887719,0.06789059],"study_design_scores_gemma":[0.0065923105,0.0010182991,0.007841693,0.00015808063,0.001540607,0.00081078795,0.008203944,0.43622077,0.003664103,0.53189653,0.0013143274,0.00073852215],"about_ca_topic_score_codex":7.335996e-7,"about_ca_topic_score_gemma":6.712156e-8,"teacher_disagreement_score":0.8106944,"about_ca_system_score_codex":0.000009477481,"about_ca_system_score_gemma":0.00003654255,"threshold_uncertainty_score":0.23085621},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004166655,0.0008962101,0.99419093,0.00004560999,0.00031329002,0.00008026324,0.0000013949314,0.000021456719,0.00028421555],"genre_scores_gemma":[0.74528944,0.000109898465,0.25444734,0.00000847664,0.000105075196,0.0000065186523,0.0000024546623,0.000016586158,0.00001422429],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994044,0.000013466862,0.00034938566,0.000062108214,0.000076197386,0.0000944738],"domain_scores_gemma":[0.9995764,0.00008174546,0.00011299847,0.000055692424,0.0001139971,0.000059204875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019113756,0.000077549186,0.00026802442,0.000032905467,0.000012501669,0.000012483314,0.00004334205,0.000059349586,0.0000083769855],"category_scores_gemma":[0.000043984506,0.00006853764,0.00005591184,0.00012182612,0.0000118185535,0.000060837963,0.000008846661,0.00008077453,1.6267808e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003092665,0.000011270949,0.000010636206,0.000089696114,0.00003825489,4.098121e-7,0.00009298886,0.8885948,0.10744029,0.00029578753,0.000057922472,0.0033369835],"study_design_scores_gemma":[0.0006411683,0.00006974298,0.000033539403,0.00003277436,0.00003574471,0.000013998739,0.000039863724,0.9776763,0.019973813,0.00012796556,0.0012721235,0.0000829795],"about_ca_topic_score_codex":4.438505e-7,"about_ca_topic_score_gemma":2.4021652e-8,"teacher_disagreement_score":0.7411228,"about_ca_system_score_codex":0.000014977195,"about_ca_system_score_gemma":0.000018620147,"threshold_uncertainty_score":0.27948838},"labels":[],"label_agreement":null},{"id":"W4241961027","doi":"10.23952/jano.1.2019.2.05","title":"Polyak’s gradient method for solving the split convex feasibility problem and its applications","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Trường Đại học Giao thông vận tải","keywords":"Regular polygon; Mathematical optimization; Gradient method; Convex optimization; Mathematics; Computer science; Geometry","score_opus":0.0126004153318758,"score_gpt":0.2634251402608905,"score_spread":0.2508247249290147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241961027","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028138977,0.00012735395,0.99574226,0.0028344786,0.000041221287,0.0005025269,0.0000022394038,0.0000133426565,0.00045517876],"genre_scores_gemma":[0.23645563,0.00009890463,0.76276684,0.00051851256,0.00006031286,0.000029191744,0.0000044712565,0.0000068397817,0.000059287082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990921,0.000030790376,0.00036744133,0.00020455469,0.00019063728,0.00011450219],"domain_scores_gemma":[0.9988597,0.00029278567,0.00036664298,0.00012996684,0.0002601059,0.0000907965],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006016988,0.00009459354,0.00021187372,0.000077789504,0.0001656795,0.00013775515,0.00020428862,0.00004472849,0.000016290998],"category_scores_gemma":[0.000028731552,0.00006305948,0.0000634852,0.00030106053,0.00001580833,0.00025178885,0.00006321646,0.00009506033,0.0000016245157],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056507113,0.00009563289,0.00017090024,0.000037353704,0.00006736328,1.121925e-7,0.00041134356,0.5140567,0.00040517462,0.47487292,0.000067539215,0.009758458],"study_design_scores_gemma":[0.00047638864,0.00006992956,0.00033120732,0.0000053954977,0.00004089159,0.000010710301,0.00004284313,0.9894356,0.00009296561,0.008463542,0.0009468114,0.00008370138],"about_ca_topic_score_codex":0.0000014450649,"about_ca_topic_score_gemma":1.0426602e-7,"teacher_disagreement_score":0.4753789,"about_ca_system_score_codex":0.000028442322,"about_ca_system_score_gemma":0.000045684024,"threshold_uncertainty_score":0.2571491},"labels":[],"label_agreement":null},{"id":"W4243059100","doi":"10.23952/jano.3.2021.1.11","title":"A weak convergence theorem for relatively nonexpansive mappings and maximal monotone operators in a Banach space","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Banach space; Mathematics; Monotone polygon; Convergence (economics); Pure mathematics; Eberlein–Šmulian theorem; Discrete mathematics; Weak convergence; Lp space; Computer science; Economics","score_opus":0.007997638099171155,"score_gpt":0.22280181065011306,"score_spread":0.21480417255094192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243059100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0035104235,0.0001251284,0.99306995,0.0026609737,0.000047991845,0.00010585741,0.0000018505706,0.000007453044,0.00047036677],"genre_scores_gemma":[0.542263,0.0002923759,0.45702893,0.00032193155,0.000029075885,0.000006704347,0.000004243406,0.0000060788107,0.000047672973],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991028,0.00003892702,0.00036086375,0.00020978661,0.00017083352,0.000116817246],"domain_scores_gemma":[0.999126,0.00013121859,0.0002447279,0.00007322741,0.0003279643,0.00009685437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025015464,0.00010208723,0.00025496012,0.00014078677,0.000082727536,0.00010440173,0.000106323176,0.00005900164,0.000020783613],"category_scores_gemma":[0.00008791127,0.00008837174,0.00004615616,0.0005483485,0.000031022504,0.00037166235,0.000058912232,0.000108072425,5.542161e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014043832,0.00011623191,0.00066716026,0.000016940316,0.0000700072,0.000008356053,0.0014553225,0.66602594,0.0007355061,0.3288633,0.000080690836,0.0018201488],"study_design_scores_gemma":[0.00094201905,0.00007431685,0.0013646048,0.000017312039,0.000023406139,0.000020406285,0.000282677,0.9920528,0.000468811,0.004333699,0.00029874346,0.000121236946],"about_ca_topic_score_codex":0.0000030161448,"about_ca_topic_score_gemma":3.8170882e-7,"teacher_disagreement_score":0.53875256,"about_ca_system_score_codex":0.000031465588,"about_ca_system_score_gemma":0.00009455317,"threshold_uncertainty_score":0.36036947},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00016847695,0.0001134025,0.9968184,0.000551962,0.0001061566,0.0005215782,0.000003972717,0.000021505008,0.0016945414],"genre_scores_gemma":[0.0059974194,0.00018713059,0.99319786,0.0001654549,0.00015688052,0.000037616875,0.000013245683,0.00004734369,0.00019705005],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99838907,0.00006990439,0.00075259694,0.00023619665,0.00028901335,0.00026325256],"domain_scores_gemma":[0.9975605,0.0006723908,0.0005524903,0.00015280499,0.0008601584,0.0002016739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008567446,0.00017478915,0.0005230379,0.00012459082,0.0001304325,0.000087339,0.00012193724,0.00012078747,0.000103295504],"category_scores_gemma":[0.00068807666,0.00014819474,0.000116124174,0.00033213606,0.00006697022,0.00022051131,0.000070525144,0.00027780162,0.0000011513982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008190446,0.0007869124,0.000036353096,0.0005793475,0.00034255645,0.000024448414,0.0017403624,0.8473705,0.0070790495,0.029566191,0.0010710573,0.11058419],"study_design_scores_gemma":[0.0026378552,0.00032209916,0.0000109755065,0.000063388994,0.00009627751,0.000104136285,0.00044408717,0.9270068,0.011819449,0.055141725,0.0020950472,0.00025820188],"about_ca_topic_score_codex":2.5618192e-7,"about_ca_topic_score_gemma":6.506672e-8,"teacher_disagreement_score":0.110325985,"about_ca_system_score_codex":0.00007730417,"about_ca_system_score_gemma":0.00015835074,"threshold_uncertainty_score":0.60432065},"labels":[],"label_agreement":null},{"id":"W4244074079","doi":"10.23952/jano.1.2019.3.10","title":"The subgradient extragradient method for solving mixed equilibrium problems and fixed point problems in Hilbert spaces","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subgradient method; Hilbert space; Fixed point; Mathematics; Applied mathematics; Mathematical economics; Mathematical optimization; Pure mathematics; Mathematical analysis","score_opus":0.009534542447006081,"score_gpt":0.22696353117353757,"score_spread":0.2174289887265315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244074079","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0028467365,0.000268988,0.9926208,0.0035443408,0.0001404442,0.00036759663,7.1844045e-7,0.000011179811,0.00019919948],"genre_scores_gemma":[0.4159025,0.00029470676,0.58342427,0.00021872041,0.000049827286,0.000024304536,0.000004715632,0.000012398071,0.00006857218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878967,0.000047459696,0.0005122754,0.000226304,0.00023040574,0.00019388096],"domain_scores_gemma":[0.9988276,0.0003666936,0.000429703,0.00011880472,0.0001581904,0.000099012286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092090206,0.00012479321,0.00026594984,0.00014862187,0.0001075898,0.00027246415,0.0002007573,0.00005208435,0.000005687141],"category_scores_gemma":[0.00004980001,0.00008201678,0.00006685703,0.00036586446,0.000022740902,0.00034318297,0.000074992706,0.000112574024,5.437794e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040542305,0.00006301217,0.0003301791,0.00002504204,0.000035004963,2.7108632e-7,0.0008610509,0.9660236,0.0004992164,0.02673451,0.000053865937,0.0053337105],"study_design_scores_gemma":[0.0008102619,0.00015683363,0.0006637466,0.000024520612,0.000019954912,0.0000117621075,0.00007036648,0.9927315,0.00010242737,0.004156788,0.0011391749,0.000112668065],"about_ca_topic_score_codex":0.00000787503,"about_ca_topic_score_gemma":0.0000024965598,"teacher_disagreement_score":0.41305578,"about_ca_system_score_codex":0.000041417912,"about_ca_system_score_gemma":0.000036326783,"threshold_uncertainty_score":0.33445472},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0029011762,0.000018423169,0.99615765,0.0004338712,0.00012483806,0.00013750573,0.000002495376,0.000029978923,0.00019407539],"genre_scores_gemma":[0.20577948,0.000033907407,0.79374105,0.00020217725,0.0001362986,0.000015982276,0.00004393223,0.000012140534,0.00003501652],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999216,0.000024081344,0.00024966162,0.00017213135,0.00018898869,0.00014910799],"domain_scores_gemma":[0.99937254,0.000044679764,0.00023877279,0.000050972812,0.00020727402,0.00008574799],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013738201,0.00010113428,0.00018493083,0.00009720878,0.00013242704,0.00012225872,0.00007556504,0.000047443755,0.000013555478],"category_scores_gemma":[0.000012753542,0.00007573981,0.000042514133,0.00039624397,0.000012361023,0.00022180048,0.00001965118,0.000108828935,3.9104668e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005341053,0.0003764496,0.00018168874,0.000056279343,0.00017879758,0.000026438982,0.0045731836,0.14018,0.007950945,0.0008197552,0.0009436541,0.8441787],"study_design_scores_gemma":[0.001380857,0.00050572376,0.00014551042,0.000074312964,0.000040986644,0.00019825065,0.00030882104,0.9917631,0.0038534764,0.00020249539,0.00137208,0.00015436637],"about_ca_topic_score_codex":0.0000011610693,"about_ca_topic_score_gemma":7.128949e-7,"teacher_disagreement_score":0.8515831,"about_ca_system_score_codex":0.000025454618,"about_ca_system_score_gemma":0.00008411393,"threshold_uncertainty_score":0.30885798},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12830634,0.000098872166,0.86991924,0.000023295976,0.00013532721,0.00015139423,0.0000064592728,0.000018040057,0.0013410544],"genre_scores_gemma":[0.61315495,0.00011970699,0.38666445,0.000010091653,0.000014702143,7.442739e-7,0.000017256898,0.000013210591,0.000004907346],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987751,0.000021853886,0.0007920257,0.0000934406,0.000203106,0.000114466384],"domain_scores_gemma":[0.9992271,0.00013099366,0.00037403917,0.00007519151,0.00014566454,0.000047028567],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022796146,0.000113086426,0.00031568916,0.00027375316,0.000020734486,0.000013274683,0.00007333442,0.00008841213,0.00007546145],"category_scores_gemma":[0.000045235673,0.000109864406,0.00004253696,0.00040860366,0.000025237978,0.00015034465,0.000019222483,0.0001453317,0.0000010761696],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005671621,0.000043344524,0.002937085,0.0000513124,0.00003096705,3.4243743e-7,0.00061975315,0.9946607,0.00013781538,0.00007470365,0.000010851435,0.0013764304],"study_design_scores_gemma":[0.0010135588,0.00008493014,0.0010666142,0.000072435614,0.000023191024,0.0000025411236,0.00037493612,0.9968747,0.00034539192,0.000031090363,0.00001275383,0.000097891665],"about_ca_topic_score_codex":0.000001643791,"about_ca_topic_score_gemma":1.01326656e-7,"teacher_disagreement_score":0.4848486,"about_ca_system_score_codex":0.000027383805,"about_ca_system_score_gemma":0.000026078334,"threshold_uncertainty_score":0.44801405},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010998247,0.00007765078,0.9976733,0.00052870635,0.00018510716,0.00025893032,7.6196756e-7,0.000016367807,0.00015936994],"genre_scores_gemma":[0.017252477,0.000034844812,0.9823445,0.0002885077,0.000043419903,0.0000034570983,0.0000018209902,0.0000078869725,0.000023100836],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991647,0.00002933666,0.00029672624,0.00018288265,0.0001848887,0.00014147708],"domain_scores_gemma":[0.999232,0.0001630886,0.00029524902,0.00009892287,0.00010104621,0.000109684996],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00048159508,0.00009728211,0.00024272714,0.000077605895,0.00006886682,0.000079858946,0.00015402933,0.000060337083,0.0000037521932],"category_scores_gemma":[0.000025993679,0.00007662693,0.00003353273,0.00013365295,0.000014482912,0.00021454332,0.00008803033,0.000104512044,0.0000013799851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022741985,0.0001291383,0.0003623288,0.00011430578,0.0000613059,0.0000057127204,0.0014998479,0.89187104,0.0035466761,0.009140357,0.00033978454,0.0927021],"study_design_scores_gemma":[0.0011173874,0.0002575169,0.00026476764,0.00004037949,0.00001505825,0.00006277067,0.000020102292,0.9958209,0.00019904505,0.0016059628,0.00049691997,0.00009918067],"about_ca_topic_score_codex":0.0000011871214,"about_ca_topic_score_gemma":6.7873374e-9,"teacher_disagreement_score":0.10394989,"about_ca_system_score_codex":0.000022072536,"about_ca_system_score_gemma":0.00003358995,"threshold_uncertainty_score":0.31247553},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000079184225,0.0002286534,0.99910545,0.0001555385,0.00016735146,0.00005962584,8.5372767e-7,0.000013761769,0.00018960198],"genre_scores_gemma":[0.020876398,0.00020557667,0.9787909,0.0000650522,0.000033742992,0.000001933279,0.00000383729,0.000011675353,0.000010906198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982097,0.0005597142,0.00056672853,0.00021371935,0.0002747092,0.00017542855],"domain_scores_gemma":[0.99775434,0.000807577,0.0004541659,0.0001994866,0.00066844915,0.0001159911],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018040801,0.00010862164,0.0004062779,0.00015709549,0.00005973853,0.000052893487,0.00027637466,0.00008437516,0.00001930535],"category_scores_gemma":[0.0005374097,0.00009852369,0.00004773794,0.00074063224,0.000047993923,0.00028780656,0.00027655563,0.0002034968,2.8961884e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000056784706,0.000039374576,0.000017374425,0.000016999431,0.000026367388,0.000006708357,0.00014423284,0.8890353,0.0021564025,0.00016692189,0.0000036186916,0.10832993],"study_design_scores_gemma":[0.00042922332,0.00011580192,0.00040534028,0.000013013049,0.00000975359,0.0001061522,0.000021656653,0.9933997,0.0049281754,0.00045365078,0.000026173877,0.00009140279],"about_ca_topic_score_codex":0.000008803737,"about_ca_topic_score_gemma":6.95465e-7,"teacher_disagreement_score":0.108238526,"about_ca_system_score_codex":0.00003928849,"about_ca_system_score_gemma":0.00010476174,"threshold_uncertainty_score":0.40176797},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021382016,0.00042127777,0.98598784,0.00084591797,0.00004753246,0.00025535474,0.0000028193567,0.00006912218,0.010231941],"genre_scores_gemma":[0.9948866,0.0004153953,0.004308506,0.00020047069,0.00015806533,0.000014466148,0.000001220602,0.0000106937505,0.0000046082037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996175,0.000012444578,0.0001818012,0.000054135315,0.00007551373,0.000058571575],"domain_scores_gemma":[0.9997441,0.000059608923,0.00006496874,0.000037538182,0.000026001138,0.0000677881],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008887663,0.00006768485,0.00010845944,0.000022383523,0.000092990675,0.000053530013,0.00004881837,0.00003418367,0.0000031376294],"category_scores_gemma":[0.0000047065387,0.000044306627,0.00002010726,0.000092263916,0.000026221156,0.000050304305,0.000007694157,0.00010981106,8.600363e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00058126124,0.000065163236,0.00008581838,0.00011630514,0.00022207866,0.0000064436613,0.0021228604,0.5730109,0.0066615716,0.20832957,0.0025798376,0.20621814],"study_design_scores_gemma":[0.0018028823,0.0015811601,0.0006233214,0.00013961627,0.000187704,0.00012564175,0.0015956833,0.72705126,0.022747777,0.020092065,0.22317532,0.00087757345],"about_ca_topic_score_codex":9.3449195e-8,"about_ca_topic_score_gemma":1.6807322e-8,"teacher_disagreement_score":0.9927484,"about_ca_system_score_codex":0.000007090333,"about_ca_system_score_gemma":0.0000030935207,"threshold_uncertainty_score":0.18067719},"labels":[],"label_agreement":null},{"id":"W4245074662","doi":"10.23952/jano.2.2020.2.08","title":"The effect of deterministic noise on a quasi-subgradient method for quasi-convex feasibility problems","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Education of Guangdong Province; Natural Science Foundation of Guangdong Province; Natural Science Foundation of Chongqing; Chongqing University; Shenzhen University; National Natural Science Foundation of China","keywords":"Subgradient method; Mathematical optimization; Regular polygon; Noise (video); Mathematics; Convex optimization; Applied mathematics; Computer science; Artificial intelligence; Geometry","score_opus":0.015804789809167923,"score_gpt":0.2717489569966035,"score_spread":0.25594416718743557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4245074662","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005152154,0.000035037534,0.9963451,0.0026185657,0.00006459516,0.00031050039,0.0000024783456,0.000011663861,0.00009682645],"genre_scores_gemma":[0.68056977,0.00003773346,0.3189271,0.00036679336,0.00006763263,0.000014956262,0.0000030751742,0.000007798699,0.0000051282186],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987513,0.00012283502,0.0005312389,0.00019532832,0.00028227226,0.00011701726],"domain_scores_gemma":[0.9980579,0.0009063235,0.0005849029,0.00012872364,0.00018443081,0.00013769064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075286435,0.00011939822,0.00035256622,0.000058206053,0.0001439544,0.00008558819,0.0002620996,0.00004579031,0.000004190196],"category_scores_gemma":[0.00029809022,0.00007202628,0.00014013903,0.00035055686,0.00003093298,0.00011075803,0.000038460737,0.0001029575,7.2706484e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006761312,0.00014092769,0.00011933218,0.000058770973,0.00007716975,5.753523e-7,0.00047819378,0.96056336,0.00019399733,0.0171068,0.000066665765,0.020518055],"study_design_scores_gemma":[0.0009432227,0.002203947,0.000120435936,0.000009975327,0.00006708558,0.000003085797,0.000011383401,0.9949875,0.0004923574,0.0008496872,0.00023357528,0.0000777644],"about_ca_topic_score_codex":0.0000011452419,"about_ca_topic_score_gemma":9.7715734e-8,"teacher_disagreement_score":0.68005455,"about_ca_system_score_codex":0.000026543601,"about_ca_system_score_gemma":0.00004113737,"threshold_uncertainty_score":0.29371467},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004067717,0.00003252405,0.9932987,0.0007156715,0.0000831873,0.00021315824,0.0000017142116,0.000023214376,0.0015640974],"genre_scores_gemma":[0.13454175,0.00010148275,0.8649494,0.0002601573,0.00010692227,0.000003381737,0.000001934608,0.000025455804,0.000009492269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985638,0.00007696498,0.00077599287,0.00014151342,0.0003170726,0.0001246187],"domain_scores_gemma":[0.9985499,0.00022949753,0.0007571048,0.00009209538,0.00019809784,0.00017332558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038791195,0.00013177971,0.00048450567,0.00007501772,0.000040018876,0.000020644053,0.00012568511,0.00009848565,0.00009230299],"category_scores_gemma":[0.00061215856,0.000107315595,0.00008154652,0.0003914843,0.000083910236,0.00015696338,0.00004977359,0.00019770797,0.0000011724468],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0028408635,0.0009010854,0.00085129205,0.0017728882,0.0005390061,0.000017397258,0.011158985,0.62810755,0.13718727,0.18246241,0.00284448,0.031316776],"study_design_scores_gemma":[0.0056088674,0.0015298424,0.000045271212,0.00020975221,0.00047305436,0.000049506725,0.0010918047,0.6675604,0.01767541,0.3019361,0.0031980982,0.0006218944],"about_ca_topic_score_codex":7.9154e-7,"about_ca_topic_score_gemma":1.1664725e-8,"teacher_disagreement_score":0.13047403,"about_ca_system_score_codex":0.000022760198,"about_ca_system_score_gemma":0.000040924206,"threshold_uncertainty_score":0.4376203},"labels":[],"label_agreement":null},{"id":"W4246059835","doi":"10.23952/jano.1.2019.3.07","title":"Karush-Kuhn-Tucker optimality conditions and duality for set optimization problems with mixed constraints","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Duality (order theory); Set (abstract data type); Mathematical optimization; Mathematics; Computer science; Combinatorics","score_opus":0.010954508190814213,"score_gpt":0.2360023193427086,"score_spread":0.22504781115189437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246059835","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021548062,0.0000240472,0.9953325,0.0011219275,0.000080851365,0.00038927578,0.00002103764,0.000028952398,0.0008466031],"genre_scores_gemma":[0.44006518,0.0000548029,0.5594509,0.00028911026,0.000035281806,0.000012575809,0.00005664633,0.000010098672,0.000025385403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862814,0.000055010325,0.00053038786,0.00029711614,0.0003168481,0.00017248892],"domain_scores_gemma":[0.99843466,0.000179781,0.0005816247,0.00015209151,0.00048746757,0.00016437596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047928837,0.00016980614,0.0003616166,0.0001594709,0.00016511555,0.00021163806,0.00015946632,0.00009062275,0.000087658875],"category_scores_gemma":[0.000038783204,0.00013310413,0.000063474756,0.0003950393,0.0000916299,0.0006266314,0.000050733805,0.000120516794,0.0000016073709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000084524385,0.000080615166,0.00033755787,0.000029422004,0.00008493578,5.66256e-7,0.00021472255,0.9638174,0.000055863973,0.03455364,0.00006746569,0.00067327893],"study_design_scores_gemma":[0.0016887576,0.00025168696,0.0009608305,0.000023062667,0.000078310186,0.00003926469,0.00008351979,0.9952216,0.00006528005,0.001213101,0.00018161676,0.00019292788],"about_ca_topic_score_codex":0.0000019001116,"about_ca_topic_score_gemma":2.3088413e-7,"teacher_disagreement_score":0.43791035,"about_ca_system_score_codex":0.000035376328,"about_ca_system_score_gemma":0.000097223005,"threshold_uncertainty_score":0.54278284},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13539967,0.00012453883,0.8613826,0.00007227372,0.00017223282,0.000088829394,0.00001034723,0.000017718072,0.0027317673],"genre_scores_gemma":[0.9777484,0.00018813761,0.022015175,0.000011716202,0.000020320995,0.0000020903403,0.000003886622,0.00000825699,0.0000020505413],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992327,0.00001512425,0.00036835647,0.000074947464,0.00017127584,0.00013758549],"domain_scores_gemma":[0.999565,0.000037012298,0.00017232035,0.000080258375,0.000083082145,0.00006230274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016839414,0.00007622255,0.00021191343,0.00006371112,0.00003486291,0.00001694235,0.00007565054,0.000051215276,0.00002471504],"category_scores_gemma":[0.00002160562,0.00006623242,0.000047374662,0.00021438472,0.000053056585,0.00011139904,0.00002421775,0.000088361514,4.2520466e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025389456,0.00008213071,0.000007669652,0.00004823951,0.000019892466,8.7740887e-7,0.00012086195,0.9556182,0.03784414,0.005019537,0.000007640525,0.0012054329],"study_design_scores_gemma":[0.00027896333,0.00014818161,0.00008041328,0.00006708873,0.000032633205,0.000017755652,0.0001056817,0.98597354,0.010114037,0.0030634687,0.00002398521,0.00009426215],"about_ca_topic_score_codex":0.0000025893341,"about_ca_topic_score_gemma":4.0725618e-7,"teacher_disagreement_score":0.8423487,"about_ca_system_score_codex":0.000020978903,"about_ca_system_score_gemma":0.000033101154,"threshold_uncertainty_score":0.27008796},"labels":[],"label_agreement":null},{"id":"W4247170081","doi":"10.23952/jano.2.2020.2.07","title":"Two inertial linesearch extragradient algorithms for the bilevel split pseudomonotone variational inequality with constraints","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Shanghai Municipal Education Commission; Ministry of Education of the People's Republic of China","keywords":"Variational inequality; Inertial frame of reference; Algorithm; Mathematics; Inequality; Applied mathematics; Computer science; Mathematical optimization; Mathematical analysis; Physics; Classical mechanics","score_opus":0.035579502305967216,"score_gpt":0.2832461937927081,"score_spread":0.2476666914867409,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247170081","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00017773648,0.000024844427,0.98840696,0.010977992,0.000055442208,0.00021807945,0.000008209723,0.000015192051,0.0001155294],"genre_scores_gemma":[0.37812048,0.000031265063,0.6205775,0.0009915848,0.00024511467,0.000012537479,0.000010617671,0.000006383982,0.00000447886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987163,0.00004258875,0.00046358234,0.00020467966,0.00043348063,0.00013935815],"domain_scores_gemma":[0.99852717,0.00035832365,0.00036330524,0.00009596754,0.00048565364,0.00016956423],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047471945,0.000118097545,0.0002304778,0.00007382691,0.00017826875,0.0001600917,0.00027883195,0.000038600858,0.00004571428],"category_scores_gemma":[0.000101901256,0.00007050509,0.00006985434,0.0005305156,0.0000709669,0.00025537846,0.00005462255,0.00014611377,0.0000011061583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021979112,0.0000813742,0.00006780365,0.0000072058942,0.000100766396,0.0000012491383,0.00037184719,0.9067487,0.00008170942,0.080073304,0.000058961283,0.012187264],"study_design_scores_gemma":[0.0014624494,0.00018585278,0.00061265443,0.00000432081,0.00004905256,0.000014738691,0.000039610102,0.9964088,0.00005817085,0.00086096855,0.00020253802,0.00010080753],"about_ca_topic_score_codex":0.0000037935972,"about_ca_topic_score_gemma":1.4516078e-7,"teacher_disagreement_score":0.37794274,"about_ca_system_score_codex":0.000025144825,"about_ca_system_score_gemma":0.00015033607,"threshold_uncertainty_score":0.2875114},"labels":[],"label_agreement":null},{"id":"W4247835158","doi":"10.23952/jano.1.2019.1.06","title":"Karush-Kuhn-Tucker optimality conditions for nonsmooth multiobjective semidefinite and semi-infinite programming","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Semidefinite programming; Mathematical optimization; Mathematics; Semidefinite embedding; Computer science; Applied mathematics; Quadratically constrained quadratic program; Quadratic programming","score_opus":0.007635573047310998,"score_gpt":0.24028631975403486,"score_spread":0.23265074670672387,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247835158","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024612143,0.00005393885,0.99546,0.00063981675,0.000090032605,0.00030047953,0.00000992432,0.00002826097,0.00095638674],"genre_scores_gemma":[0.42164314,0.000092086484,0.577723,0.00039434456,0.000056061657,0.00001536827,0.000023882689,0.000010170232,0.000041957428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988602,0.0000345365,0.00045370776,0.00024976127,0.0002380403,0.0001637876],"domain_scores_gemma":[0.99861366,0.00029445955,0.00046292486,0.0001209579,0.0003701383,0.00013789242],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003610198,0.000142322,0.00030548123,0.00019159634,0.000164173,0.00019721614,0.00014000821,0.000080725826,0.000029576839],"category_scores_gemma":[0.00006110156,0.000121003126,0.00008882291,0.0003988309,0.000038406517,0.0005234993,0.00006128372,0.00013190879,0.0000031344418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012636214,0.00015623163,0.0008648433,0.000033612974,0.00014195248,8.5269164e-7,0.0006183857,0.9292493,0.00033265274,0.059194908,0.0000878864,0.00919303],"study_design_scores_gemma":[0.0010358742,0.00018655932,0.0015897856,0.000018975985,0.000067791436,0.000019345998,0.00008090743,0.99335986,0.000108804656,0.001907312,0.0014461606,0.00017859653],"about_ca_topic_score_codex":0.0000029048942,"about_ca_topic_score_gemma":1.8046232e-7,"teacher_disagreement_score":0.4191819,"about_ca_system_score_codex":0.000035706285,"about_ca_system_score_gemma":0.0000640975,"threshold_uncertainty_score":0.49343643},"labels":[],"label_agreement":null},{"id":"W4247884247","doi":"10.23952/jano.1.2019.3.01","title":"A special issue dedicated to Christiane Tammer","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"History","score_opus":0.004380773534918199,"score_gpt":0.21134893315077513,"score_spread":0.20696815961585693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247884247","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00038144636,0.000010892668,0.9877159,0.003914264,0.00032043524,0.00009058681,6.6258053e-7,0.000015216133,0.007550588],"genre_scores_gemma":[0.20433861,0.00008388596,0.7889109,0.0034275749,0.0027097794,0.0000033092351,0.000009174419,0.000015218422,0.00050154136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990486,0.000019219879,0.00034888487,0.00016019403,0.0003092443,0.00011388386],"domain_scores_gemma":[0.99924237,0.000042182994,0.00024279846,0.000110710964,0.00018932353,0.00017261846],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015412693,0.000090276626,0.00021931462,0.00019335459,0.000049672668,0.00011284439,0.00022678052,0.000048840273,0.00068743207],"category_scores_gemma":[0.000028566754,0.00007340963,0.000049154798,0.0006128884,0.000009704752,0.0002601492,0.00006095657,0.00010481587,0.000089775065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007321914,0.00008130423,0.00013628148,0.0000050410395,0.000041597705,0.0000024117803,0.0002706872,0.9679717,0.0001510836,0.011560811,0.008667862,0.011038012],"study_design_scores_gemma":[0.0007522447,0.00018302686,0.0006812206,0.000010857293,0.000029411,0.000017974351,0.00004349254,0.9410488,0.00014824969,0.00039263573,0.05652123,0.00017088247],"about_ca_topic_score_codex":0.0000028123252,"about_ca_topic_score_gemma":8.6750966e-8,"teacher_disagreement_score":0.20395716,"about_ca_system_score_codex":0.000026383641,"about_ca_system_score_gemma":0.000050105686,"threshold_uncertainty_score":0.7526899},"labels":[],"label_agreement":null},{"id":"W4248042746","doi":"10.23952/jano.3.2021.2.07","title":"A posteriori error control for variational inequalities with linear constraints in an abstract framework","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"A priori and a posteriori; Variational inequality; Mathematics; Inequality; Control (management); Applied mathematics; Mathematical optimization; Computer science; Mathematical analysis; Artificial intelligence; Philosophy; Epistemology","score_opus":0.016380383272252816,"score_gpt":0.2677829618036052,"score_spread":0.2514025785313524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248042746","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0015339941,0.000018757168,0.9966098,0.0015443463,0.000056538636,0.00008905384,0.000008601471,0.000009878502,0.00012903898],"genre_scores_gemma":[0.49882537,0.000008143523,0.5005609,0.00051582226,0.00006389698,0.000004165893,0.000013225717,0.0000043527125,0.000004170263],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99899924,0.000041467632,0.00043884484,0.00016729104,0.0002402988,0.00011284211],"domain_scores_gemma":[0.99870497,0.00030178265,0.00033268167,0.00008882942,0.00047550627,0.00009623734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033590558,0.00009687485,0.00025297044,0.00012261422,0.00006624996,0.00013124383,0.00012008421,0.000070616516,0.000063583444],"category_scores_gemma":[0.00010365315,0.00007834046,0.000043939664,0.0003226849,0.000028873348,0.00043915366,0.000015752434,0.00011943145,4.4150502e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018017391,0.00014638664,0.00041293865,0.000009230017,0.00004446633,0.000006214255,0.0004296563,0.8908691,0.0000835304,0.1061578,0.000004643393,0.0016558629],"study_design_scores_gemma":[0.0014349065,0.00015486323,0.0034230838,0.000024156387,0.000028113483,0.00002672157,0.00013551678,0.9899542,0.000038043097,0.0046170712,0.000045459663,0.00011790211],"about_ca_topic_score_codex":0.0000012856968,"about_ca_topic_score_gemma":7.104245e-7,"teacher_disagreement_score":0.49729136,"about_ca_system_score_codex":0.000027112956,"about_ca_system_score_gemma":0.00019540862,"threshold_uncertainty_score":0.31946313},"labels":[],"label_agreement":null},{"id":"W4248114642","doi":"10.23952/jano.2.2020.2.02","title":"Some new iterative algorithms for finding fixed points of nonexpansive mappings","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities","keywords":"Fixed point; Algorithm; Mathematics; Computer science; Discrete mathematics; Mathematical analysis","score_opus":0.023667283085235857,"score_gpt":0.2526007596630225,"score_spread":0.22893347657778662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248114642","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012672969,0.000045604258,0.9925922,0.0069715576,0.000059177553,0.00010725804,0.000003368001,0.000010366667,0.00008371943],"genre_scores_gemma":[0.07631706,0.00007404293,0.921782,0.0015460504,0.00024342624,0.0000022701565,0.000008999999,0.000007234885,0.00001890314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907243,0.00001735374,0.00044467687,0.00015320154,0.00021811677,0.00009423924],"domain_scores_gemma":[0.99885386,0.000116953175,0.00054296886,0.000055136512,0.00027617035,0.0001549095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012317915,0.000094949624,0.00028470185,0.000110970184,0.00006396351,0.00007151545,0.00017825096,0.000045840137,0.000018141169],"category_scores_gemma":[0.0000863358,0.000079791884,0.0000888572,0.00038805153,0.00001535326,0.00045304126,0.000044170392,0.00007617866,9.141048e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014100327,0.00005734387,0.000021955855,0.00002149742,0.000120700075,0.0000011940481,0.0029229356,0.93624836,0.0009543871,0.053196553,0.00075385626,0.005560227],"study_design_scores_gemma":[0.00093135005,0.00019446768,0.000054751126,0.000012254039,0.000035030214,0.0000029888295,0.00007087082,0.9941993,0.0011735468,0.0029165843,0.00031659484,0.000092303315],"about_ca_topic_score_codex":0.0000011279958,"about_ca_topic_score_gemma":1.1416753e-8,"teacher_disagreement_score":0.07619032,"about_ca_system_score_codex":0.000016879596,"about_ca_system_score_gemma":0.00007670519,"threshold_uncertainty_score":0.32538188},"labels":[],"label_agreement":null},{"id":"W4248519834","doi":"10.23952/jano.1.2019.3.09","title":"The role of nonlinear scalarization functions in characterizing generalized convex vector functions","year":2019,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii","keywords":"Nonlinear system; Mathematics; Regular polygon; Convex function; Vector-valued function; Applied mathematics; Pure mathematics; Physics; Geometry","score_opus":0.0045039012846747155,"score_gpt":0.1969571943526005,"score_spread":0.1924532930679258,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248519834","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.010106138,0.000080695325,0.98758346,0.0010287906,0.00020147601,0.00011960608,0.0000024181606,0.000011883925,0.00086551014],"genre_scores_gemma":[0.91754013,0.00015208904,0.08191426,0.00017266476,0.00008987194,0.000005081877,0.000022401353,0.000008969851,0.00009455144],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989763,0.000046382895,0.0005061405,0.00012880233,0.0002393123,0.000103045706],"domain_scores_gemma":[0.9990019,0.00011465182,0.00046082606,0.00012483676,0.00024089101,0.000056850997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028008854,0.00008399156,0.00021349397,0.00017248816,0.000108820226,0.00009076987,0.00016332473,0.00005399685,0.00004723102],"category_scores_gemma":[0.000035457768,0.000060746726,0.00006417117,0.00065272336,0.000022321163,0.00034138255,0.000041545078,0.00011854949,0.000005566516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011093802,0.00012680085,0.0027455748,0.0000062034674,0.00005911589,2.8134394e-7,0.00022301059,0.9500055,0.0065353727,0.034317248,0.000023645442,0.005846313],"study_design_scores_gemma":[0.00054363493,0.000060223076,0.0031633317,0.0000086658,0.000020680623,0.000004157452,0.0000820663,0.99367905,0.0003748862,0.0004149548,0.0015765692,0.00007181212],"about_ca_topic_score_codex":0.000004723816,"about_ca_topic_score_gemma":4.2374288e-7,"teacher_disagreement_score":0.907434,"about_ca_system_score_codex":0.00002924679,"about_ca_system_score_gemma":0.000063371255,"threshold_uncertainty_score":0.24771796},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025917067,0.000025498524,0.9931126,0.0025214234,0.00013548376,0.0002875742,0.000005140959,0.00003895691,0.0038474002],"genre_scores_gemma":[0.024346525,0.00036567377,0.9721754,0.0006227196,0.0023992555,0.00001928258,0.000029520628,0.00002116817,0.00002044233],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982753,0.00007486086,0.00058103807,0.00035637757,0.0005312463,0.000181195],"domain_scores_gemma":[0.9985106,0.00023658545,0.00036999644,0.00017725023,0.00033985052,0.00036571966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024745293,0.00017735628,0.00041860418,0.00036186934,0.00017682585,0.00029842916,0.0002977693,0.000092296796,0.0002684752],"category_scores_gemma":[0.00017395346,0.00016125166,0.00007616816,0.0019965065,0.000093251925,0.00034414636,0.00009375289,0.00020814402,0.000005695111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002533699,0.00006113631,0.000021354053,0.000010590124,0.00015328586,0.0000038699386,0.00029931887,0.95696074,0.00001498844,0.0073030307,0.00020683196,0.03471147],"study_design_scores_gemma":[0.0016930279,0.00036919344,0.000052509622,0.0000038279422,0.00015214665,0.0000051617108,0.000050784656,0.9937484,0.00007193038,0.00006590209,0.003626805,0.00016027692],"about_ca_topic_score_codex":8.5029285e-7,"about_ca_topic_score_gemma":6.8833614e-8,"teacher_disagreement_score":0.03678768,"about_ca_system_score_codex":0.000036273417,"about_ca_system_score_gemma":0.00009566705,"threshold_uncertainty_score":0.65756524},"labels":[],"label_agreement":null},{"id":"W4248792414","doi":"10.23952/jano.2.2020.3.07","title":"Strong convergence of a modified inertial forward-backward splitting algorithm for a inclusion problem","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Algorithm; Inertial frame of reference; Inclusion (mineral); Mathematics; Computer science; Mathematical optimization; Physics; Classical mechanics; Economics","score_opus":0.013296763590287608,"score_gpt":0.23489089749541092,"score_spread":0.2215941339051233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248792414","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024668782,0.000030760883,0.9974863,0.0018362765,0.000044977198,0.0001576896,0.0000037873585,0.000014876577,0.0001786603],"genre_scores_gemma":[0.34083357,0.0000319325,0.65875995,0.00027465893,0.00008196754,0.0000036024453,0.000005671661,0.0000054151724,0.0000032082903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987887,0.000023698643,0.00059089565,0.00017288545,0.00030983603,0.000113991984],"domain_scores_gemma":[0.99873024,0.00008429209,0.0006276934,0.00006564567,0.00035446123,0.0001376748],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025678577,0.00010209453,0.00029736068,0.00009100914,0.00013236458,0.000045823617,0.00024176839,0.00005436781,0.000012297894],"category_scores_gemma":[0.000052606494,0.00008468142,0.000097418364,0.0004251903,0.00002056972,0.00030431236,0.00020498302,0.000086704764,3.38983e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089388384,0.000056765617,0.000015809052,0.000024963621,0.000047174228,4.979691e-7,0.0007943777,0.9549199,0.0006163318,0.01512082,0.000050384268,0.028263588],"study_design_scores_gemma":[0.0008695071,0.00020499867,0.0000174518,0.00001140486,0.00004014551,0.000002436805,0.000034814606,0.99681413,0.00072779675,0.0010506524,0.00013723152,0.00008943156],"about_ca_topic_score_codex":0.0000021970015,"about_ca_topic_score_gemma":3.0430897e-8,"teacher_disagreement_score":0.3405869,"about_ca_system_score_codex":0.00002134106,"about_ca_system_score_gemma":0.00007947263,"threshold_uncertainty_score":0.34532082},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024637491,0.000057911,0.99613214,0.000674438,0.00031865484,0.000116251256,0.0000070820893,0.000010099023,0.00021970498],"genre_scores_gemma":[0.8491973,0.00006606497,0.15027846,0.0002600283,0.00009332068,0.0000070364686,0.00000785638,0.0000056376716,0.000084280975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999242,0.000023017985,0.00032717927,0.00012709327,0.00018523162,0.000095478405],"domain_scores_gemma":[0.9988965,0.0004894884,0.00028055607,0.00006809015,0.00020265242,0.00006271264],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043910253,0.000081597755,0.00018574904,0.0000785487,0.00006047313,0.000112178,0.000126578,0.00004457859,0.000032180233],"category_scores_gemma":[0.000059787893,0.00006947864,0.00003308516,0.000098834345,0.0000053442805,0.00034327153,0.000052274325,0.00006182876,0.0000011160137],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059734357,0.00002214464,0.00006562844,0.000024550176,0.000020960157,1.7444667e-7,0.00034842646,0.029598124,0.00024588563,0.968245,0.00004804025,0.0013212771],"study_design_scores_gemma":[0.0006561046,0.00015071918,0.0005092722,0.000013338305,0.000010691882,0.000006470317,0.00010194353,0.9637888,0.00013160426,0.03328091,0.0012448388,0.000105323204],"about_ca_topic_score_codex":0.000002725394,"about_ca_topic_score_gemma":9.161063e-8,"teacher_disagreement_score":0.9349641,"about_ca_system_score_codex":0.000014699779,"about_ca_system_score_gemma":0.000058611757,"threshold_uncertainty_score":0.2833257},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0012964875,0.00006396377,0.9979785,0.00038862915,0.000073791416,0.000116794836,0.0000011756676,0.000008350585,0.0000723151],"genre_scores_gemma":[0.36868554,0.0000096440735,0.6311611,0.00009769488,0.00003495955,0.0000032007395,4.5995742e-7,0.0000050202566,0.0000023914906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992827,0.000011751379,0.00034122818,0.00009581672,0.00017694512,0.00009155478],"domain_scores_gemma":[0.99907833,0.00022642314,0.00027166138,0.000104329534,0.00027712897,0.000042103762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015341304,0.0000706653,0.00019183428,0.000029086608,0.000044626522,0.000029037084,0.00016102151,0.00003661957,0.0000030944127],"category_scores_gemma":[0.00017824004,0.000049644754,0.00006286332,0.0001739946,0.000022984865,0.0001968735,0.000050697025,0.00009372352,1.3128872e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026654187,0.000035049005,0.0000027048297,0.000016821896,0.000022152717,3.612136e-7,0.00014176639,0.9719512,0.0017748013,0.021594536,0.000003135393,0.004430815],"study_design_scores_gemma":[0.0005674976,0.000055842804,0.000018461657,0.000026874959,0.000022027654,0.0000115996445,0.000019190873,0.989889,0.005491212,0.0037905609,0.000053134492,0.000054554435],"about_ca_topic_score_codex":8.972515e-8,"about_ca_topic_score_gemma":6.0804672e-9,"teacher_disagreement_score":0.36738905,"about_ca_system_score_codex":0.000016441933,"about_ca_system_score_gemma":0.000045112825,"threshold_uncertainty_score":0.20244543},"labels":[],"label_agreement":null},{"id":"W4249757450","doi":"10.23952/jano.2.2020.3.03","title":"$L^\\infty$-stability for a class of parametric optimal control problems with mixed pointwise constraints","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Ministry of Science and Technology, Taiwan; National Foundation for Science and Technology Development","keywords":"Pointwise; Class (philosophy); Stability (learning theory); Mathematics; Parametric statistics; Applied mathematics; Control (management); Mathematical optimization; Pure mathematics; Mathematical analysis; Computer science; Statistics; Artificial intelligence","score_opus":0.013711567518721511,"score_gpt":0.20823951385260372,"score_spread":0.1945279463338822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249757450","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0017150065,0.000026123294,0.9951262,0.0026246351,0.000027206741,0.00026986576,0.000008798137,0.00001563934,0.00018651137],"genre_scores_gemma":[0.62105674,0.000013048244,0.378592,0.00029728876,0.000026083013,0.0000054625157,0.000003636426,0.000004837796,9.05039e-7],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873936,0.000040072977,0.00058399956,0.00020318279,0.00030412982,0.00012922344],"domain_scores_gemma":[0.9982688,0.00024825498,0.00068641314,0.00009393034,0.00051778933,0.00018482293],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030912,0.00012264482,0.0004061579,0.00012603163,0.00005906455,0.00006928554,0.00020379477,0.000057520603,0.000028799843],"category_scores_gemma":[0.00014396041,0.000090489826,0.00009632407,0.0007391759,0.00008248294,0.00027088934,0.000027548882,0.000104299164,4.531064e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003590041,0.00012353837,0.00021399016,0.000033851116,0.00010129267,7.1202464e-7,0.00024536147,0.9859912,0.00017029239,0.010451044,0.000034519988,0.0022752178],"study_design_scores_gemma":[0.002387014,0.0005591419,0.0002574452,0.00000941468,0.00008502466,0.000008330513,0.00005736367,0.9958435,0.00030199363,0.00028406223,0.00009745669,0.000109233326],"about_ca_topic_score_codex":8.4045877e-7,"about_ca_topic_score_gemma":7.326542e-8,"teacher_disagreement_score":0.61934173,"about_ca_system_score_codex":0.000021348182,"about_ca_system_score_gemma":0.00011413055,"threshold_uncertainty_score":0.3690068},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.069599055,0.00009327563,0.9295522,0.00014047367,0.000039840736,0.00007978847,0.000003952374,0.00001003328,0.00048140384],"genre_scores_gemma":[0.6389349,0.000050456114,0.36080754,0.0000970398,0.000048380625,0.0000036238484,0.0000052733276,0.000014562567,0.000038226783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.99915344,0.00003587333,0.0004246588,0.00010454081,0.00019385414,0.00008765706],"domain_scores_gemma":[0.9988668,0.00024221253,0.0003766391,0.00009035664,0.00034195278,0.00008202359],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000138174,0.000094459436,0.00032089496,0.000026191223,0.000037452468,0.000019302437,0.00006606634,0.000060893784,0.00011915318],"category_scores_gemma":[0.00039533593,0.00007440447,0.00003301164,0.00018552864,0.000044016113,0.0001680381,0.00001681703,0.00010869019,2.6718587e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023474533,0.0027034753,0.000037685797,0.001325233,0.0005033365,0.000085259824,0.0107489545,0.13811202,0.20788729,0.6247221,0.0017230796,0.00980408],"study_design_scores_gemma":[0.0008196906,0.0004105332,0.0000023789262,0.00009178586,0.00008384915,0.000058086873,0.00083533715,0.068722814,0.55090183,0.3778021,0.00008677429,0.00018482163],"about_ca_topic_score_codex":1.0304265e-7,"about_ca_topic_score_gemma":3.879088e-8,"teacher_disagreement_score":0.5693358,"about_ca_system_score_codex":0.000011508268,"about_ca_system_score_gemma":0.000041401792,"threshold_uncertainty_score":0.30341262},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004586306,0.000027673443,0.9940656,0.00064730726,0.00014409408,0.00019526732,0.0000028208003,0.000014395416,0.0003165724],"genre_scores_gemma":[0.76527727,0.000011840069,0.23445253,0.000098612894,0.00009904897,0.00000884624,0.0000059149193,0.000007356663,0.000038584833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925065,0.0000103594775,0.0002992862,0.00012672064,0.0002030188,0.00010995155],"domain_scores_gemma":[0.9991694,0.00015529596,0.00032947163,0.00007336702,0.00021634353,0.00005613795],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002483742,0.00008495424,0.00018556206,0.00006451553,0.00004607425,0.00013057685,0.00013286297,0.000036044534,0.000015436344],"category_scores_gemma":[0.000017915423,0.00006244208,0.00002998518,0.00010419417,0.000003926662,0.00030644727,0.000041413223,0.000062265135,7.5935526e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009364899,0.000034899855,0.0000635724,0.000028351114,0.00003349138,3.110391e-7,0.0002500024,0.41687757,0.0014081891,0.580904,0.000008053507,0.0002978952],"study_design_scores_gemma":[0.0009448463,0.00038860017,0.00048313217,0.00002586711,0.000012699898,0.000016287628,0.000022444632,0.9920273,0.00036328382,0.004497736,0.001106008,0.000111786074],"about_ca_topic_score_codex":0.0000016136775,"about_ca_topic_score_gemma":1.8177286e-7,"teacher_disagreement_score":0.7606909,"about_ca_system_score_codex":0.000020035674,"about_ca_system_score_gemma":0.00009021282,"threshold_uncertainty_score":0.25463143},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00024827576,0.000092990296,0.9983275,0.00026785434,0.00009557277,0.0003370004,0.000107731306,0.00001718043,0.0005059143],"genre_scores_gemma":[0.021202026,0.00020390683,0.9781974,0.000057410205,0.00010131366,0.0000067589745,0.00017108311,0.000028847979,0.000031274853],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980893,0.00006862567,0.00096497085,0.00027403937,0.00041698996,0.00018605501],"domain_scores_gemma":[0.99665874,0.0007939214,0.0007991584,0.00033872895,0.001266365,0.00014308059],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007125672,0.0001532385,0.0005708952,0.00011805224,0.000087058455,0.000041153686,0.00022099451,0.00010983508,0.00017474766],"category_scores_gemma":[0.0012659268,0.00013769756,0.00007191883,0.0003734596,0.00013603288,0.00030571356,0.00010517708,0.00017523256,2.5948557e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024801344,0.00029952335,0.000017353354,0.0001319712,0.00008833467,0.00000328922,0.00012416154,0.9866617,0.00024852637,0.0046193507,0.00024641227,0.0073113777],"study_design_scores_gemma":[0.0018580322,0.00013252026,0.000009506036,0.000031353662,0.00008339093,0.00003281199,0.00027766643,0.9886332,0.0017375511,0.006825592,0.00024341152,0.0001349641],"about_ca_topic_score_codex":5.5554324e-7,"about_ca_topic_score_gemma":1.6317281e-7,"teacher_disagreement_score":0.02095375,"about_ca_system_score_codex":0.000043355354,"about_ca_system_score_gemma":0.00022986345,"threshold_uncertainty_score":0.5615144},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011957847,0.000039734394,0.9969874,0.00013317275,0.00013348846,0.0007402937,0.000005777714,0.000022246502,0.00074207096],"genre_scores_gemma":[0.06492126,0.000056855322,0.93473655,0.00007190499,0.00007623083,0.00002120156,0.000007224001,0.000030044523,0.00007874523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871975,0.000034754077,0.0005197823,0.00021665935,0.00031293172,0.00019611848],"domain_scores_gemma":[0.99772674,0.0007094819,0.0006276766,0.00013347094,0.0006803951,0.0001222542],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006802207,0.00014935757,0.00041797766,0.0001207367,0.00007831993,0.000040965388,0.00009360734,0.000086621636,0.000048927996],"category_scores_gemma":[0.00028718956,0.0001097529,0.000055302346,0.00026396208,0.00005747781,0.00019652136,0.000027008356,0.0002020034,0.0000019967345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01904687,0.00041807117,0.00019982886,0.00019264664,0.00036237802,0.0000046354075,0.0009304154,0.9160373,0.0016913828,0.023630757,0.0007366894,0.036748987],"study_design_scores_gemma":[0.007042913,0.002033793,0.0001685396,0.000073551164,0.00013876297,0.000041359905,0.00061464997,0.96176237,0.0024448738,0.024499103,0.0008872929,0.00029277703],"about_ca_topic_score_codex":0.0000010079865,"about_ca_topic_score_gemma":2.5812503e-7,"teacher_disagreement_score":0.06372548,"about_ca_system_score_codex":0.000072352654,"about_ca_system_score_gemma":0.00008056332,"threshold_uncertainty_score":0.44755933},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025473288,0.00014877021,0.99620324,0.00024192991,0.00006894701,0.00018147039,0.000006936607,0.0000087893795,0.0005925557],"genre_scores_gemma":[0.50232375,0.00003378005,0.4974148,0.000059892773,0.00008451584,0.000014108208,0.000005358183,0.000018526378,0.00004528589],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872226,0.000083972605,0.00064694666,0.0001363695,0.00027137273,0.00013910807],"domain_scores_gemma":[0.99787974,0.0006421336,0.000690514,0.00010201481,0.0005797051,0.000105884275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002932851,0.00012871322,0.0005792068,0.00007776051,0.000059045404,0.000052833053,0.000068218425,0.00009179699,0.0000144491205],"category_scores_gemma":[0.00016160564,0.0000930079,0.00008466007,0.00020958672,0.000052871896,0.000085479536,0.000013982765,0.00009401369,6.822086e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006186391,0.0033482588,0.000061492865,0.0011724214,0.0017218458,0.000022934815,0.0012277476,0.42286465,0.037145715,0.4789468,0.00052118953,0.046780556],"study_design_scores_gemma":[0.007991067,0.0024311268,0.00002719979,0.00036827064,0.0010552277,0.00010694682,0.00055843685,0.93215793,0.005251092,0.04781393,0.0017899366,0.0004488265],"about_ca_topic_score_codex":0.000002731332,"about_ca_topic_score_gemma":2.4504646e-7,"teacher_disagreement_score":0.5092933,"about_ca_system_score_codex":0.000025878924,"about_ca_system_score_gemma":0.00008554165,"threshold_uncertainty_score":0.3792752},"labels":[],"label_agreement":null},{"id":"W4252466691","doi":"10.23952/jano.2.2020.3.01","title":"Projection-type methods with alternating inertial steps for solving multivalued variational inequalities beyond monotonicity","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation","keywords":"Monotonic function; Variational inequality; Type (biology); Inertial frame of reference; Projection (relational algebra); Mathematics; Projection method; Applied mathematics; Inequality; Mathematical analysis; Mathematical optimization; Dykstra's projection algorithm; Algorithm; Physics; Classical mechanics","score_opus":0.026495487289215598,"score_gpt":0.2956079964048903,"score_spread":0.26911250911567475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252466691","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000501341,0.00001989222,0.9965843,0.002334714,0.00009162996,0.00017270287,0.000002122048,0.00002884652,0.00026442914],"genre_scores_gemma":[0.15255314,0.0000148921345,0.84648484,0.00071150094,0.00020003252,0.000007264047,0.000009913834,0.000009314006,0.000009133785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988155,0.00006951101,0.0004885884,0.00020881974,0.00029511866,0.00012248121],"domain_scores_gemma":[0.9984169,0.00028386773,0.0005696155,0.00006500397,0.0005454053,0.00011918234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005205263,0.00012430611,0.00027124898,0.000114015114,0.0001695719,0.00016763748,0.00018148765,0.00005121086,0.000015897873],"category_scores_gemma":[0.00026462672,0.00009567542,0.000058476468,0.0004922067,0.000018818939,0.00051055825,0.00005313936,0.00012369113,3.445164e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025450665,0.000048085563,0.000077319426,0.00001531838,0.00009681374,4.738992e-7,0.001104738,0.9554218,0.0007558843,0.038478382,0.00003607779,0.0037106099],"study_design_scores_gemma":[0.00092816807,0.00025267198,0.00011104546,0.000007280991,0.00004930255,0.00000609384,0.000090075715,0.996509,0.00058834656,0.0011697427,0.0001629228,0.00012533828],"about_ca_topic_score_codex":0.0000064502137,"about_ca_topic_score_gemma":1.4603292e-7,"teacher_disagreement_score":0.15205179,"about_ca_system_score_codex":0.00003607599,"about_ca_system_score_gemma":0.00012869075,"threshold_uncertainty_score":0.39015305},"labels":[],"label_agreement":null},{"id":"W4252738740","doi":"10.23952/jano.3.2021.1.10","title":"On global optimality conditions for D.C. minimization problems with D.C. constraints","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Minification; Mathematical optimization; Computer science; Mathematics","score_opus":0.010066415683730939,"score_gpt":0.24448335597363383,"score_spread":0.2344169402899029,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252738740","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00032535044,0.00001902597,0.9957079,0.001658921,0.00006588387,0.00013017713,0.000016746773,0.000020161437,0.0020558173],"genre_scores_gemma":[0.38925803,0.000033995755,0.6098547,0.000715511,0.00004545538,0.000010005086,0.000054681244,0.000006074315,0.000021541626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989853,0.000033790035,0.00037642394,0.00021142942,0.00027149005,0.00012155773],"domain_scores_gemma":[0.9986192,0.00013592244,0.0003701658,0.00011420089,0.0006406012,0.00011988632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001515719,0.000114069546,0.00023161917,0.00006969059,0.00014354302,0.0001533585,0.00012501345,0.000058036938,0.000060982213],"category_scores_gemma":[0.000072388364,0.0000907359,0.000064955704,0.00052026624,0.00005079203,0.0002856626,0.000024615734,0.0000691224,0.000001105153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053429838,0.00013168018,0.00004438812,0.000008466813,0.000054692366,0.0000021417904,0.000044990586,0.7782207,0.00002272367,0.22004597,0.0001764049,0.0011944246],"study_design_scores_gemma":[0.0014821785,0.00024003559,0.00042172294,0.000025337875,0.00006956606,0.00006548813,0.000039302013,0.9862097,0.00013548869,0.010924859,0.00023740817,0.00014893095],"about_ca_topic_score_codex":4.7122873e-7,"about_ca_topic_score_gemma":2.1608123e-7,"teacher_disagreement_score":0.38893268,"about_ca_system_score_codex":0.00004823829,"about_ca_system_score_gemma":0.0001708009,"threshold_uncertainty_score":0.37001026},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.720786,0.0033015239,0.13191403,0.002048883,0.0021740259,0.0013219159,0.000046548863,0.0000882131,0.13831887],"genre_scores_gemma":[0.9973515,0.000087070744,0.0021982936,0.00015331196,0.00012265725,0.0000029247963,0.0000017802265,0.0000070028227,0.00007542247],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993361,0.000011219496,0.0003032579,0.00008234505,0.00014846174,0.00011861047],"domain_scores_gemma":[0.999474,0.000034444987,0.00021777044,0.000059798247,0.0001528961,0.000061103754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012743028,0.000078494995,0.00020513813,0.00015138624,0.0000686027,0.000030753607,0.00006980758,0.000023838254,0.00044791275],"category_scores_gemma":[0.000009051589,0.000058413887,0.00007362313,0.000112393616,0.000096990385,0.00013038957,0.00003099536,0.000079709476,0.0000041897424],"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.00080790627,0.0007316221,0.0027229786,0.00045706693,0.0005827733,0.000004312639,0.10449751,0.44105965,0.0077050976,0.43064004,0.0031600494,0.0076309987],"study_design_scores_gemma":[0.021826744,0.02216768,0.016891947,0.002835366,0.0023370052,0.00017036349,0.12009604,0.18446395,0.010024536,0.06370507,0.54928285,0.0061984393],"about_ca_topic_score_codex":0.000010032209,"about_ca_topic_score_gemma":0.0000014875213,"teacher_disagreement_score":0.5461228,"about_ca_system_score_codex":0.000004895018,"about_ca_system_score_gemma":0.000013607501,"threshold_uncertainty_score":0.49043304},"labels":[],"label_agreement":null},{"id":"W4253114670","doi":"10.23952/jano.3.2021.2.04","title":"A Tikhonov-type regularization for Brézis pseudomonotone equilibrium problems in Banach spaces","year":2021,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Tikhonov regularization; Banach space; Regularization (linguistics); Mathematics; Type (biology); Applied mathematics; Pure mathematics; Mathematical analysis; Computer science; Inverse problem; Artificial intelligence; Geology","score_opus":0.01128739405459117,"score_gpt":0.23319282345994366,"score_spread":0.2219054294053525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253114670","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007515548,0.00014780619,0.99626714,0.0020898776,0.00011489677,0.0001307633,0.0000010787443,0.000014819412,0.0004820497],"genre_scores_gemma":[0.28541392,0.00025583172,0.7136368,0.00037899686,0.00010942858,0.000008938185,0.000035789886,0.000013523624,0.00014674048],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988879,0.00003932437,0.000486441,0.00021491609,0.00023355757,0.00013785751],"domain_scores_gemma":[0.9988554,0.00009578357,0.00035265865,0.00012047624,0.00049074576,0.00008493258],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003109058,0.00010582282,0.0002691524,0.00020007457,0.00005754451,0.00018467245,0.00015524666,0.000076459386,0.000024377634],"category_scores_gemma":[0.00010045492,0.000095554315,0.00006169305,0.0010162514,0.000016659604,0.00045707184,0.000055915076,0.00009129175,9.0126844e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040006882,0.00011578843,0.00018324718,0.000017092758,0.000028659791,0.0000019134397,0.00021333863,0.969823,0.0010556432,0.026442502,0.00010549828,0.0019733214],"study_design_scores_gemma":[0.0008650784,0.00009131977,0.00025473203,0.0000177273,0.000026787167,0.00001767222,0.00003282874,0.99148273,0.00069222687,0.0056915632,0.00070806855,0.000119251934],"about_ca_topic_score_codex":0.0000017886763,"about_ca_topic_score_gemma":5.018755e-7,"teacher_disagreement_score":0.28466237,"about_ca_system_score_codex":0.000043952896,"about_ca_system_score_gemma":0.0001365187,"threshold_uncertainty_score":0.38965917},"labels":[],"label_agreement":null},{"id":"W4253456546","doi":"10.23952/jano.2.2020.2.04","title":"Strong convergence of two inertial projection algorithms in Hilbert spaces","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Inertial frame of reference; Hilbert space; Convergence (economics); Algorithm; Projection (relational algebra); Mathematics; Computer science; Pure mathematics; Physics; Classical mechanics; Economics","score_opus":0.014073114877043255,"score_gpt":0.24559639989761287,"score_spread":0.23152328502056962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4253456546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020963307,0.000026652851,0.99514437,0.0022640827,0.00006266575,0.00006149557,5.852587e-7,0.000008558223,0.00033526012],"genre_scores_gemma":[0.7350213,0.00006297158,0.26460883,0.00022656121,0.00006989881,0.0000012194835,0.000002099171,0.0000034051363,0.0000037048826],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990994,0.000029895626,0.00042327607,0.00013079378,0.00023889972,0.000077750796],"domain_scores_gemma":[0.9993118,0.00003744667,0.00037712217,0.000048919588,0.00014438425,0.000080335005],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00014626278,0.0000744036,0.00021208926,0.00012712684,0.000028705745,0.000042944605,0.00014546988,0.000033037933,0.000027429824],"category_scores_gemma":[0.00003602217,0.00006218479,0.000041726737,0.0006530077,0.00001921395,0.0003508466,0.00004175887,0.000096054726,7.161081e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055956483,0.00005598071,0.00068619533,0.0000075677735,0.000019040268,0.0000011859917,0.00051279075,0.9836798,0.00040068504,0.011234237,0.000030616495,0.0033159906],"study_design_scores_gemma":[0.0006313918,0.00010682109,0.0004682626,0.000006645139,0.000013749062,0.0000035568742,0.000046286634,0.9978456,0.0005554451,0.00018901733,0.00006777948,0.00006544083],"about_ca_topic_score_codex":0.000013719158,"about_ca_topic_score_gemma":3.6017533e-7,"teacher_disagreement_score":0.732925,"about_ca_system_score_codex":0.00002000801,"about_ca_system_score_gemma":0.00005854223,"threshold_uncertainty_score":0.2535822},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002031765,0.00003124817,0.9964203,0.00110006,0.00006523435,0.00023763333,0.000035558303,0.000017054233,0.000061106344],"genre_scores_gemma":[0.0776164,0.000018705145,0.9218743,0.00033134004,0.00011330383,0.0000065948293,0.000016343813,0.000016733897,0.0000063046923],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869907,0.00004024702,0.00065490557,0.00016188461,0.0003025591,0.0001413443],"domain_scores_gemma":[0.9982773,0.0006737007,0.00061422616,0.000057047233,0.00019081298,0.0001869052],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026527906,0.00014132644,0.00047731205,0.000060806673,0.000058867692,0.000019633218,0.00008798552,0.000079795485,0.00007906604],"category_scores_gemma":[0.00040402164,0.000109203516,0.00008171808,0.0002837694,0.00004774146,0.00011434742,0.00002966938,0.00013144765,0.0000013524843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030227029,0.00041944528,0.000009461657,0.00044428973,0.00020399856,0.000008710403,0.00045054773,0.8883292,0.0022368375,0.053978596,0.0028048984,0.0480913],"study_design_scores_gemma":[0.0015468678,0.00045278372,0.000030875344,0.000033009106,0.00018130789,0.000011861008,0.000042015658,0.96057284,0.0016524266,0.035254914,0.000097962395,0.00012310842],"about_ca_topic_score_codex":0.000004965896,"about_ca_topic_score_gemma":6.0878854e-8,"teacher_disagreement_score":0.075584635,"about_ca_system_score_codex":0.000020173897,"about_ca_system_score_gemma":0.00003556094,"threshold_uncertainty_score":0.44531903},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1877359,0.000054499404,0.81047195,0.00020876077,0.00001647439,0.00038032568,0.0000060274756,0.000008246357,0.0011178206],"genre_scores_gemma":[0.6598884,0.000046637986,0.34001428,0.0000072003777,0.000014784774,0.0000027010108,0.000007650293,0.000008863142,0.000009516982],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987037,0.000042781707,0.00077323796,0.000103090315,0.00028357297,0.000093596725],"domain_scores_gemma":[0.99844223,0.0001473518,0.0010133402,0.00010941005,0.0002330032,0.00005464388],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046667038,0.00009957666,0.0004412855,0.00019116735,0.000077001096,0.000015185342,0.000071474184,0.00007280884,0.00004674156],"category_scores_gemma":[0.00004112701,0.00007907526,0.000070257396,0.00026575086,0.000046110057,0.00016390077,0.00015028188,0.000114588256,4.4500018e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012121494,0.0038748176,0.0015943113,0.0029543268,0.0008285236,0.000001641019,0.010691074,0.39769116,0.069967404,0.46313974,0.00016546219,0.04787938],"study_design_scores_gemma":[0.0015389362,0.00044784052,0.00026027014,0.00024805043,0.00039126258,0.000013069312,0.0003711719,0.8131564,0.002273282,0.18110585,0.00002291661,0.0001709351],"about_ca_topic_score_codex":0.000007392159,"about_ca_topic_score_gemma":0.0000010366914,"teacher_disagreement_score":0.47215247,"about_ca_system_score_codex":0.00002750985,"about_ca_system_score_gemma":0.00003353221,"threshold_uncertainty_score":0.32245955},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.021222996,0.0002820856,0.9775191,0.00026398545,0.00017080145,0.000107501815,9.937395e-7,0.000024526704,0.00040804228],"genre_scores_gemma":[0.9757767,0.0001350829,0.02382347,0.00016285603,0.0000774943,0.000006092909,0.000003626521,0.000008662683,0.000006054674],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999419,0.000027229516,0.00027023832,0.00006747902,0.00011703393,0.00009907337],"domain_scores_gemma":[0.9997754,0.000051128103,0.000054952605,0.000047336605,0.000036168774,0.00003497497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016951909,0.00008132309,0.0001773877,0.0000612751,0.000027221615,0.000042356798,0.000054515574,0.000037364676,0.00003351871],"category_scores_gemma":[0.000010341898,0.000058321035,0.00004557508,0.0001392798,0.000010759933,0.00006344178,0.0000058687747,0.000151462,0.0000010141353],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014006623,0.00006414561,0.0000022944112,0.000010731946,0.000037174443,0.00001880132,0.00036281554,0.9780022,0.00042847035,0.000045995963,0.00015144801,0.020735867],"study_design_scores_gemma":[0.0025790627,0.000048759044,0.00033882266,0.000011005199,0.000041764764,0.000030131478,0.0003651943,0.99545115,0.000022058799,0.000007761208,0.0010374727,0.000066843175],"about_ca_topic_score_codex":6.026594e-7,"about_ca_topic_score_gemma":0.0000013376423,"teacher_disagreement_score":0.95455366,"about_ca_system_score_codex":0.000026760537,"about_ca_system_score_gemma":0.000009279398,"threshold_uncertainty_score":0.23782627},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009095108,0.00003111272,0.9902238,0.00026235974,0.000035674755,0.00013642263,0.000005084,0.0000530219,0.00015741246],"genre_scores_gemma":[0.50363743,0.00004188561,0.49613127,0.00007481586,0.000084764026,0.0000018667508,0.0000051814673,0.000021110322,0.00000164848],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929726,0.0000049550604,0.0002975647,0.00011905337,0.00014629452,0.0001348945],"domain_scores_gemma":[0.9994915,0.0000895899,0.00015267926,0.00004898049,0.00010429502,0.00011295672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006764921,0.0001294397,0.00024851505,0.000048585312,0.000054273634,0.00009385378,0.000054547716,0.000035015157,0.0000037176276],"category_scores_gemma":[0.000033724602,0.00010582332,0.000034340555,0.000088929926,0.000034971396,0.00020652146,0.000012128801,0.00013878677,6.068188e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007837043,0.000011519557,0.0000065939876,0.00004350257,0.00003195412,0.0000039030783,0.00027193694,0.9600082,0.014231089,0.000015275353,0.000078617966,0.025219034],"study_design_scores_gemma":[0.00058211776,0.00011170944,0.00004962365,0.000025190717,0.000042176125,0.000020440191,0.000048102058,0.9944102,0.0044835885,0.0000567696,0.000038420865,0.00013164814],"about_ca_topic_score_codex":2.074619e-7,"about_ca_topic_score_gemma":1.3712051e-8,"teacher_disagreement_score":0.49454233,"about_ca_system_score_codex":0.000027317667,"about_ca_system_score_gemma":0.00002163232,"threshold_uncertainty_score":0.43153498},"labels":[],"label_agreement":null},{"id":"W4256472077","doi":"10.23952/jano.2.2020.3.04","title":"The subgradient extragradient-type algorithms for solving a class of monotone variational inclusion problems","year":2020,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Fundamental Research Funds for the Central Universities","keywords":"Subgradient method; Monotone polygon; Class (philosophy); Inclusion (mineral); Mathematics; Type (biology); Applied mathematics; Mathematical optimization; Variational inequality; Algorithm; Algebra over a field; Computer science; Pure mathematics; Artificial intelligence; Psychology; Social psychology","score_opus":0.016708107747700325,"score_gpt":0.2328252932967818,"score_spread":0.2161171855490815,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256472077","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015900959,0.00013020926,0.99380434,0.0054670675,0.00015576655,0.00017477645,0.0000019673462,0.000011220743,0.000095618874],"genre_scores_gemma":[0.38448456,0.00017692789,0.61475056,0.00038895395,0.00016820472,0.0000063161488,0.000009164777,0.000007544053,0.000007789083],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880284,0.000024041832,0.00054618245,0.00015631657,0.00035167366,0.000118940785],"domain_scores_gemma":[0.9984937,0.00021519602,0.0006129541,0.000080207166,0.000478395,0.00011956336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039024622,0.000095029696,0.00021217504,0.000072157745,0.00034101083,0.00008328029,0.00028403048,0.000046250283,0.000007060257],"category_scores_gemma":[0.00010874158,0.000064983506,0.00008294359,0.00050740177,0.000028962748,0.00022765336,0.00015993399,0.00009012449,3.3496949e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099184595,0.00006168577,0.000016676724,0.000011691457,0.000054851476,2.388498e-7,0.00109172,0.92195004,0.00036470883,0.07187616,0.00013031103,0.004342724],"study_design_scores_gemma":[0.0005696156,0.00022895515,0.00007827338,0.000007513118,0.000033957003,0.0000030849285,0.000023110813,0.9926657,0.00012755302,0.004573893,0.0016137518,0.0000745753],"about_ca_topic_score_codex":0.0000014502338,"about_ca_topic_score_gemma":1.14268474e-7,"teacher_disagreement_score":0.38432553,"about_ca_system_score_codex":0.000028358187,"about_ca_system_score_gemma":0.000078120625,"threshold_uncertainty_score":0.26499504},"labels":[],"label_agreement":null},{"id":"W4285116060","doi":"10.23952/jano.4.2022.2.04","title":"Parallel projection method for solving split equilibrium problems","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Projection (relational algebra); Computer science; Mathematical optimization; Mathematical economics; Mathematics; Algorithm","score_opus":0.015174813360367327,"score_gpt":0.2575961429409186,"score_spread":0.24242132958055126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285116060","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000046359044,0.000043828906,0.99752295,0.001560862,0.00013302876,0.00019879334,0.0000018454497,0.000024323614,0.00046800752],"genre_scores_gemma":[0.029190391,0.000020523092,0.97018313,0.00038929703,0.000089887566,0.000040791314,0.000010550145,0.000008985789,0.00006642911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894416,0.000043051365,0.00040545553,0.00018121669,0.0003010814,0.000125009],"domain_scores_gemma":[0.9990975,0.00010888818,0.0004602788,0.00008681764,0.00017665008,0.00006986647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006410758,0.00008865716,0.00020064009,0.00018623662,0.00023456024,0.000112346526,0.00021239811,0.000028998369,0.000044800523],"category_scores_gemma":[0.000028465862,0.0000785356,0.00008705148,0.0004881287,0.0000078492685,0.0003307149,0.000109393746,0.0001235709,3.585866e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057525143,0.00007361301,0.000010967022,0.000010793489,0.000031659565,3.444608e-7,0.0002682104,0.96296364,0.00022075602,0.031397883,0.00021390998,0.004750676],"study_design_scores_gemma":[0.00058487145,0.00018671787,0.000036459627,0.0000024224398,0.000031400225,0.000026219459,0.000050937528,0.9916001,0.000041379128,0.0045085163,0.0028348642,0.000096126816],"about_ca_topic_score_codex":0.0000024095975,"about_ca_topic_score_gemma":3.8268364e-8,"teacher_disagreement_score":0.029144034,"about_ca_system_score_codex":0.000058062877,"about_ca_system_score_gemma":0.000070869784,"threshold_uncertainty_score":0.3202589},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6463222,0.00029977498,0.35214287,0.00014942996,0.00005566089,0.00019846749,0.000013699999,0.000007515093,0.00081036496],"genre_scores_gemma":[0.9679902,0.00011162307,0.03186114,0.000010352992,0.000007162674,0.000003264562,0.000002104991,0.000008023993,0.000006079032],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901193,0.00006197806,0.00050493627,0.000072604395,0.00027439417,0.00007414648],"domain_scores_gemma":[0.9984869,0.0004325359,0.0008460085,0.00006891156,0.00012829274,0.000037358022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004406488,0.000075555756,0.00038110386,0.00050763285,0.00003857254,0.000008882104,0.000076136595,0.000023260289,0.00016459737],"category_scores_gemma":[0.00010982952,0.00005728853,0.00005515196,0.0012911657,0.000042892716,0.000092499155,0.000022019904,0.00016209978,6.0793965e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00072961964,0.0004300783,0.0027252666,0.000051227635,0.00018086238,0.000005007631,0.00058252347,0.95888567,0.001143825,0.034811918,0.000076020886,0.00037799787],"study_design_scores_gemma":[0.011588112,0.005590804,0.013404221,0.00026978753,0.0022540048,0.00029072564,0.013114699,0.7806741,0.016502602,0.15477398,0.00041146128,0.0011254968],"about_ca_topic_score_codex":0.000015594132,"about_ca_topic_score_gemma":7.115996e-7,"teacher_disagreement_score":0.32166803,"about_ca_system_score_codex":0.000026619926,"about_ca_system_score_gemma":0.000035829442,"threshold_uncertainty_score":0.23361585},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00040741594,0.000063777494,0.99583894,0.00042946066,0.00012648424,0.00014145613,9.670144e-7,0.000013462089,0.0029780173],"genre_scores_gemma":[0.040511012,0.00013221466,0.95644736,0.00042666687,0.0023723515,0.000035487636,0.0000018191442,0.00001105193,0.00006202151],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99938226,0.000085514315,0.00020321898,0.00014824347,0.00010289503,0.000077879624],"domain_scores_gemma":[0.9995053,0.00013378539,0.00020145012,0.000069781636,0.00002866767,0.000061053164],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061831955,0.00007423432,0.00014055095,0.00009740952,0.0002939333,0.00007985666,0.00009877234,0.000021602873,0.000024006747],"category_scores_gemma":[0.000012051803,0.000058343903,0.000019533678,0.00022752979,0.000025680572,0.00012795304,0.00010813126,0.00017228747,2.4256858e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000860804,0.00007732999,0.000005897716,0.00001170782,0.000015291736,0.000001118943,0.001155863,0.026524456,0.0003075173,0.0445301,0.0001378005,0.92714685],"study_design_scores_gemma":[0.0008271886,0.0006331795,0.000081152546,0.000009505706,0.000021470467,0.0002586819,0.00084803725,0.8725862,0.0009237266,0.02570625,0.097884536,0.00022006487],"about_ca_topic_score_codex":5.212458e-7,"about_ca_topic_score_gemma":8.5140455e-9,"teacher_disagreement_score":0.9269268,"about_ca_system_score_codex":0.000018001552,"about_ca_system_score_gemma":0.000016655855,"threshold_uncertainty_score":0.23791954},"labels":[],"label_agreement":null},{"id":"W4285221937","doi":"10.23952/jano.4.2022.2.11","title":"Superiorization with a projected subgradient method","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subgradient method; Mathematics; Mathematical optimization","score_opus":0.005466644890986958,"score_gpt":0.21366184018363155,"score_spread":0.20819519529264457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4285221937","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00041937505,0.000024093384,0.9976998,0.0011090718,0.000056383302,0.00009234483,0.0000011755232,0.000023257757,0.00057448173],"genre_scores_gemma":[0.27478424,0.000019442836,0.7247706,0.00032888557,0.000036671303,0.0000106516745,0.000010048589,0.0000070998376,0.00003234598],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99895626,0.00007657646,0.00030169307,0.00015943052,0.00040765546,0.00009839183],"domain_scores_gemma":[0.99926335,0.00005186336,0.00032787898,0.00009304538,0.00018594276,0.00007793282],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003125187,0.00008620439,0.00018629193,0.00021931762,0.00022932515,0.0000898189,0.00019047878,0.000019568673,0.000097623284],"category_scores_gemma":[0.000014243476,0.00006639579,0.000038319748,0.0009861927,0.000011491172,0.00026891657,0.000076421136,0.00012996826,4.6980907e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008459544,0.00008987056,0.00007841801,0.0000025825223,0.000036916976,0.0000029891264,0.00057522696,0.9611546,0.000099902536,0.034889877,0.000057777168,0.0029272458],"study_design_scores_gemma":[0.00057564507,0.00028559455,0.00025747358,0.0000020455939,0.00003415409,0.0000724927,0.000088749104,0.9964778,0.00007227297,0.00039981783,0.0016345889,0.00009938144],"about_ca_topic_score_codex":0.0000028415716,"about_ca_topic_score_gemma":7.474354e-8,"teacher_disagreement_score":0.27436486,"about_ca_system_score_codex":0.000055860375,"about_ca_system_score_gemma":0.00009155891,"threshold_uncertainty_score":0.27075416},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007847886,0.00011060028,0.9965199,0.0026097307,0.00030550812,0.00013130292,0.00001083832,0.000012261094,0.00022136072],"genre_scores_gemma":[0.3490115,0.000091658134,0.64984447,0.00060139695,0.00021838676,0.000080515936,0.000013717473,0.000010335214,0.00012799853],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886674,0.00010153149,0.00043424388,0.00011990205,0.00035112,0.00012649258],"domain_scores_gemma":[0.9981833,0.0010574315,0.0004308952,0.000096403215,0.00017319113,0.0000587528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016044775,0.000081441125,0.00015425542,0.00006700385,0.00053596136,0.00014436204,0.00027836647,0.000021702162,0.000015317075],"category_scores_gemma":[0.0000849638,0.00006047106,0.00006781921,0.00018439446,0.000004908917,0.00013803958,0.00010360147,0.00013031844,1.11383414e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007576361,0.00003914015,0.0000015068019,0.00000366506,0.000027433422,4.1697197e-7,0.0005235271,0.15251829,0.00012215954,0.84030485,0.00021964232,0.00616359],"study_design_scores_gemma":[0.00044357448,0.00024404797,0.000027212502,0.0000016657052,0.00001362965,0.000019065381,0.00033372673,0.92816424,0.000079507954,0.05549569,0.015093498,0.00008415966],"about_ca_topic_score_codex":0.0000066912426,"about_ca_topic_score_gemma":1.5074215e-7,"teacher_disagreement_score":0.7848092,"about_ca_system_score_codex":0.000070255,"about_ca_system_score_gemma":0.00013908686,"threshold_uncertainty_score":0.41222358},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00048563338,0.000053835836,0.99522704,0.0034802565,0.0002615442,0.00025063122,0.000008915647,0.000026474141,0.00020565845],"genre_scores_gemma":[0.8866242,0.0000107371,0.111785,0.0012347497,0.00019349586,0.00007006601,0.000011369178,0.000009802526,0.000060567025],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991338,0.000020164896,0.00032332196,0.00018356557,0.00016852401,0.0001706021],"domain_scores_gemma":[0.9993017,0.00011147255,0.00023573109,0.00013149249,0.00007701083,0.0001426067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018942871,0.00009473763,0.00017265504,0.00007143986,0.00038001148,0.00009271465,0.00027560696,0.000022151706,0.000014823501],"category_scores_gemma":[0.000009796874,0.000084260784,0.00008259754,0.00043413244,0.000021329357,0.00015817938,0.000108077,0.00017712076,3.9751308e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070078546,0.00004043646,0.000010343029,0.0000016878827,0.000010389863,9.712226e-7,0.000058418318,0.96168804,0.000026239199,0.01493176,0.002958257,0.020203354],"study_design_scores_gemma":[0.00039428682,0.00023304224,0.000052875333,0.0000019907768,0.000014671259,0.00003691521,0.00005618407,0.9866509,0.0000052666296,0.0010049614,0.011448262,0.000100673664],"about_ca_topic_score_codex":5.6379736e-7,"about_ca_topic_score_gemma":9.0394416e-8,"teacher_disagreement_score":0.88613856,"about_ca_system_score_codex":0.000031687196,"about_ca_system_score_gemma":0.000021757944,"threshold_uncertainty_score":0.3436055},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.060798705,0.0001659932,0.9379089,0.00009160431,0.000044581084,0.00011749311,0.00000732565,0.000076014236,0.00078936765],"genre_scores_gemma":[0.9073024,0.00008314996,0.092398025,0.00014347961,0.000043783737,0.0000046897358,0.000006562793,0.000013604584,0.000004309894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943,0.000013927974,0.00022659384,0.00008303162,0.00014772027,0.0000987127],"domain_scores_gemma":[0.99971795,0.000026811718,0.000112979666,0.000035071145,0.000047405472,0.000059800615],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011421489,0.000090154055,0.00017219139,0.00006643334,0.000102268736,0.000030619412,0.000038343653,0.00003658212,0.00002099885],"category_scores_gemma":[0.000003933835,0.00008851583,0.000024898896,0.00006356894,0.00002258866,0.00009837513,0.00003379841,0.00020482071,1.1711547e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003421446,0.000020561574,0.0000023100915,0.0000071835143,0.000024319133,0.00000403903,0.00009898976,0.98932344,0.0047690384,0.0021733444,0.0000910144,0.0034515595],"study_design_scores_gemma":[0.00043909156,0.00007766283,0.000027250308,0.000010530299,0.000023715747,0.00008328107,0.000069843525,0.993365,0.0016250925,0.004122734,0.00005643522,0.000099345074],"about_ca_topic_score_codex":4.6877966e-7,"about_ca_topic_score_gemma":8.96875e-9,"teacher_disagreement_score":0.8465037,"about_ca_system_score_codex":0.000035536024,"about_ca_system_score_gemma":0.000017083868,"threshold_uncertainty_score":0.3609571},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005133873,0.000063360654,0.99808264,0.0006853952,0.000298219,0.00021926689,0.0000071543077,0.000016452164,0.00011410767],"genre_scores_gemma":[0.5179263,0.000025002751,0.48166564,0.00018251147,0.00011616671,0.000054213775,0.00000769662,0.0000054889542,0.000017017626],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903333,0.00013593999,0.00038781244,0.00014494716,0.00020224674,0.00009573756],"domain_scores_gemma":[0.998791,0.00047201608,0.000439062,0.00005318479,0.00019320786,0.00005152188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011740993,0.00008741095,0.00019730565,0.000147034,0.00026109803,0.00009099292,0.00009335022,0.000035488883,0.000010120722],"category_scores_gemma":[0.00007646478,0.000080890815,0.000040947645,0.00015278446,0.0000064230926,0.00035772944,0.00007436346,0.00013444042,3.975691e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044637526,0.00006614174,0.0000018355602,0.000006808073,0.00004064412,2.8583327e-7,0.00085204514,0.13274339,0.0013910822,0.84656227,0.000024467878,0.017864669],"study_design_scores_gemma":[0.00088550354,0.00042861621,0.00006219517,0.0000024988708,0.00002266681,0.000030637424,0.00025037566,0.9584159,0.00022410997,0.039053373,0.00052897236,0.000095131356],"about_ca_topic_score_codex":0.000015943004,"about_ca_topic_score_gemma":1.1938977e-7,"teacher_disagreement_score":0.8256725,"about_ca_system_score_codex":0.00006761109,"about_ca_system_score_gemma":0.00009165058,"threshold_uncertainty_score":0.32986316},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0048328913,0.000058514626,0.9941518,0.0001592485,0.000068256624,0.00024267795,0.000015109221,0.0000108386985,0.00046069094],"genre_scores_gemma":[0.38113874,0.000008951007,0.61871725,0.00003355097,0.000042115942,0.000021477148,0.0000045562797,0.000013443243,0.000019899282],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989294,0.000045817673,0.0005614189,0.00008767799,0.00026886124,0.00010684264],"domain_scores_gemma":[0.9982798,0.00082480046,0.0005805803,0.00009197135,0.00016517345,0.000057671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000582677,0.00008771935,0.0003714671,0.0001338933,0.00013083445,0.000013822928,0.00010309338,0.0000308651,0.00018094199],"category_scores_gemma":[0.0006515182,0.00007497303,0.00008682577,0.00029500722,0.000047097124,0.00008920961,0.00006167844,0.000107579806,9.291515e-8],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005325432,0.00031381074,0.0000026835867,0.00013068838,0.00005763942,6.5065706e-7,0.00037363608,0.08396337,0.0016726812,0.9114489,0.0001999254,0.0013034608],"study_design_scores_gemma":[0.0012028392,0.00030032537,0.000005440132,0.000007436335,0.00015089718,0.000014885241,0.00021281504,0.113706306,0.0019132978,0.8820945,0.0002865391,0.000104690596],"about_ca_topic_score_codex":2.490833e-7,"about_ca_topic_score_gemma":1.2294945e-8,"teacher_disagreement_score":0.37630585,"about_ca_system_score_codex":0.000044223136,"about_ca_system_score_gemma":0.00003508109,"threshold_uncertainty_score":0.30573115},"labels":[],"label_agreement":null},{"id":"W4312340192","doi":"10.23952/jano.4.2022.3.04","title":"On split equality generalized equilibrium problems and fixed point problems of Bregman relatively nonexpansive semigroups","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation","keywords":"Fixed point; Mathematics; Bregman divergence; Applied mathematics; Fixed-point theorem; Point (geometry); Pure mathematics; Mathematical analysis; Geometry","score_opus":0.014802408140596576,"score_gpt":0.22547439034662203,"score_spread":0.21067198220602545,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312340192","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01208354,0.00009380466,0.9852563,0.0014877911,0.00006627688,0.00020756458,0.0000089619425,0.000018754785,0.00077701197],"genre_scores_gemma":[0.8331796,0.000083164974,0.1660861,0.0005074474,0.000034259014,0.000014717524,0.000021957525,0.000012077209,0.00006067132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982887,0.00014378801,0.00067467254,0.000250538,0.00050360715,0.00013870186],"domain_scores_gemma":[0.9984764,0.00015246504,0.00087801006,0.0001399702,0.00023515786,0.00011801139],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061780174,0.0001413622,0.00037200438,0.00020969217,0.00016002027,0.00007001039,0.00021979751,0.000046608773,0.00008252124],"category_scores_gemma":[0.00003886799,0.00012005658,0.00007550381,0.00055766624,0.00004334788,0.00032194742,0.00018957842,0.00021180425,6.5408267e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010618803,0.00016109791,0.000056685916,0.000021767817,0.00006191914,0.0000010351242,0.0012155022,0.9277749,0.00078455755,0.06900959,0.000086674685,0.0007201006],"study_design_scores_gemma":[0.0012472115,0.00046649872,0.0004463766,0.000017004086,0.000043744556,0.000022257625,0.0000845703,0.9877516,0.00015914817,0.009358675,0.00024244013,0.00016044063],"about_ca_topic_score_codex":0.000012563523,"about_ca_topic_score_gemma":1.745139e-7,"teacher_disagreement_score":0.82109606,"about_ca_system_score_codex":0.000055621385,"about_ca_system_score_gemma":0.00005456223,"threshold_uncertainty_score":0.48957655},"labels":[],"label_agreement":null},{"id":"W4312736249","doi":"10.23952/jano.4.2022.3.03","title":"A stochastic selective projection method for solving a constrained stochastic variational inequality problem","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Variational inequality; Projection (relational algebra); Inequality; Mathematical optimization; Mathematics; Applied mathematics; Computer science; Mathematical analysis; Algorithm","score_opus":0.013479440996961495,"score_gpt":0.26671886377582676,"score_spread":0.25323942277886524,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312736249","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000025397005,0.000013708411,0.9982725,0.0010513571,0.00010396498,0.00035899333,0.000010454108,0.00002898936,0.00013464136],"genre_scores_gemma":[0.29072288,0.0000011524282,0.7088535,0.00024226883,0.000071735725,0.00007008178,0.000018267487,0.000007588754,0.000012568022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985527,0.00009569898,0.0005391514,0.0002412862,0.00042221093,0.00014897498],"domain_scores_gemma":[0.9982781,0.00040813565,0.00070127525,0.00007617731,0.00044950724,0.000086798056],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010076652,0.00012206459,0.00027285164,0.00027496132,0.00042070073,0.000103044666,0.00018407188,0.000039347946,0.000040068928],"category_scores_gemma":[0.00013924604,0.00011337132,0.00009099238,0.0007500595,0.000015635615,0.00030343447,0.00008600165,0.00018848364,2.5301e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015431792,0.00013022605,0.0000024368937,0.000007429476,0.00007967256,2.698695e-7,0.0006786581,0.9080711,0.00011321971,0.08817125,0.000051610143,0.0025397767],"study_design_scores_gemma":[0.0010083864,0.00027553324,0.000041270505,0.000004122531,0.00006912151,0.000045664838,0.00011035097,0.98452544,0.000010687114,0.013747915,0.00003467384,0.00012685137],"about_ca_topic_score_codex":0.000004986837,"about_ca_topic_score_gemma":1.636931e-7,"teacher_disagreement_score":0.29069746,"about_ca_system_score_codex":0.00014129658,"about_ca_system_score_gemma":0.0002667032,"threshold_uncertainty_score":0.46231484},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009918985,0.00002999011,0.9973519,0.0011854343,0.00008970614,0.00025740408,0.0000054766892,0.0000143727375,0.00007383444],"genre_scores_gemma":[0.6789725,0.00003135448,0.32058346,0.00025177255,0.00007078591,0.000033038916,0.000024081433,0.000009718785,0.000023299397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912935,0.000045698453,0.00029891462,0.00016379709,0.00026208212,0.0001001303],"domain_scores_gemma":[0.99917126,0.00009152373,0.0004146121,0.00007006543,0.0001901753,0.0000623649],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000374374,0.00009462079,0.00017381413,0.000115427065,0.00024178038,0.000117903255,0.00012841324,0.000025388017,0.000011797403],"category_scores_gemma":[0.000022267222,0.000078277815,0.000025280257,0.00019762243,0.000007725118,0.00034443513,0.00009606309,0.000099206525,2.9426934e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016386175,0.000050636776,0.00000836362,0.000009534829,0.00002339025,6.6108146e-7,0.0007671526,0.8232955,0.00024341299,0.17458245,0.000018909119,0.0008361788],"study_design_scores_gemma":[0.0010544462,0.00063195615,0.000024870542,0.000008345332,0.000016991333,0.000024993105,0.0001179407,0.99063665,0.000257003,0.0069529237,0.00016668798,0.00010718427],"about_ca_topic_score_codex":0.0000066797243,"about_ca_topic_score_gemma":2.490595e-7,"teacher_disagreement_score":0.6779806,"about_ca_system_score_codex":0.000054539672,"about_ca_system_score_gemma":0.000059480688,"threshold_uncertainty_score":0.31920767},"labels":[],"label_agreement":null},{"id":"W4312874287","doi":"10.23952/jano.4.2022.3.02","title":"Pareto subdifferential calculus for convex set-valued mappings and applications to set optimization","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subderivative; Pareto principle; Mathematics; Convex analysis; Set (abstract data type); Mathematical optimization; Regular polygon; Convex set; Calculus (dental); Convex optimization; Applied mathematics; Pure mathematics; Computer science; Medicine; Geometry","score_opus":0.014846795698720229,"score_gpt":0.2519294366041357,"score_spread":0.23708264090541548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312874287","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025960634,0.000042175343,0.99711066,0.0018542921,0.0001069979,0.0004341153,0.000022712775,0.00003063369,0.00013878923],"genre_scores_gemma":[0.29462,0.00006754891,0.7030378,0.0016573789,0.000187288,0.00020881393,0.00012104857,0.000022567734,0.00007757537],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986042,0.00005434441,0.0005079306,0.00029182975,0.00037168793,0.00017002744],"domain_scores_gemma":[0.99886644,0.00009761838,0.0004092707,0.00013905822,0.00028095944,0.00020662617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003597739,0.00014467981,0.00030113888,0.00028712992,0.0004888413,0.00016901741,0.00026939725,0.000048431073,0.00007330231],"category_scores_gemma":[0.000032939257,0.0001380408,0.000071979004,0.00070151617,0.00003293864,0.0002475872,0.00017981452,0.00012902686,7.9467065e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000898805,0.000059511178,0.00002427173,0.000010561367,0.000046335834,4.5599674e-7,0.00048789784,0.9643612,0.000062788335,0.032546967,0.00037088458,0.0019392814],"study_design_scores_gemma":[0.0008306083,0.0001740812,0.0000733366,0.0000031328732,0.00006374501,0.000019799489,0.00019005494,0.99363124,0.000037723818,0.0009045272,0.0039040355,0.00016771303],"about_ca_topic_score_codex":0.0000035117566,"about_ca_topic_score_gemma":1.2750525e-7,"teacher_disagreement_score":0.2943604,"about_ca_system_score_codex":0.000070633214,"about_ca_system_score_gemma":0.00007090481,"threshold_uncertainty_score":0.5629141},"labels":[],"label_agreement":null},{"id":"W4312982452","doi":"10.23952/jano.4.2022.3.08","title":"Revisiting inertial subgradient extragradient algorithms for solving bilevel variational inequality problems","year":2022,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"China Scholarship Council","keywords":"Subgradient method; Variational inequality; Inertial frame of reference; Inequality; Bilevel optimization; Mathematics; Applied mathematics; Algorithm; Mathematical optimization; Computer science; Mathematical analysis; Optimization problem; Physics","score_opus":0.02305230992120919,"score_gpt":0.24771067076882358,"score_spread":0.2246583608476144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4312982452","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00039837693,0.000075631535,0.99737394,0.0016287245,0.00019661302,0.0001806993,0.000009422794,0.000021504648,0.00011508626],"genre_scores_gemma":[0.39833924,0.00002865235,0.60091996,0.0003803717,0.00023614196,0.00003609921,0.000035046964,0.000009456639,0.000015048668],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983754,0.000057876823,0.0006822386,0.00023434081,0.0004827646,0.00016734263],"domain_scores_gemma":[0.9986049,0.00018227639,0.00070031337,0.000103963575,0.0002954993,0.000113043025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016793,0.00011898534,0.00025775298,0.00021164077,0.00043379221,0.00013136075,0.0002614973,0.000031934527,0.00005892528],"category_scores_gemma":[0.00008046097,0.00010596591,0.00011032703,0.0005429388,0.000014409002,0.00030852295,0.00013377458,0.00015656042,3.07271e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043084983,0.00010267249,0.000059623104,0.000011840597,0.000044272652,7.4827585e-7,0.00047879445,0.9243085,0.00013774511,0.0656693,0.000057713,0.0090857325],"study_design_scores_gemma":[0.00079064304,0.00012934527,0.00040068885,0.000006086893,0.000034467754,0.000020506994,0.0000378057,0.9940221,0.000024509705,0.0033575231,0.0010424948,0.00013387948],"about_ca_topic_score_codex":0.0000042306197,"about_ca_topic_score_gemma":5.4359194e-8,"teacher_disagreement_score":0.39794084,"about_ca_system_score_codex":0.00011209349,"about_ca_system_score_gemma":0.00009830352,"threshold_uncertainty_score":0.43211645},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0023348732,0.000024392757,0.99618274,0.00064584095,0.00010757327,0.0001542852,2.096874e-7,0.000058517635,0.00049155677],"genre_scores_gemma":[0.8871481,0.000034400055,0.11261997,0.000061353676,0.000029161218,0.000027803933,0.000009247099,0.0000050129706,0.0000649385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992385,0.000023696488,0.0002565156,0.00012935346,0.00026282415,0.00008912381],"domain_scores_gemma":[0.99934345,0.0000661815,0.00040940844,0.00007727532,0.00006738617,0.00003630475],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027449746,0.000066102184,0.00010654226,0.00014256747,0.0003166701,0.0000636604,0.00011984728,0.000029569163,0.000025163223],"category_scores_gemma":[0.000022118147,0.00005497122,0.000030110241,0.00022865961,0.000018874292,0.00046313615,0.000055867473,0.00023491173,3.7455223e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003853236,0.00004958135,0.00010989025,0.000005716623,0.000014978536,7.551158e-7,0.000105383486,0.90616727,0.00085069984,0.05941372,0.000058687427,0.032838017],"study_design_scores_gemma":[0.0012279239,0.0016932791,0.00087668415,0.0000054837233,0.000032861568,0.000040979845,0.0003891211,0.97549176,0.00057692145,0.0057398123,0.013784526,0.00014065996],"about_ca_topic_score_codex":3.8009978e-7,"about_ca_topic_score_gemma":2.2634831e-8,"teacher_disagreement_score":0.88481325,"about_ca_system_score_codex":0.000070494265,"about_ca_system_score_gemma":0.000029605628,"threshold_uncertainty_score":0.24356024},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010086174,0.00015481432,0.9959746,0.003074263,0.00037348043,0.00016949988,0.0000075290845,0.0000045739116,0.00014040196],"genre_scores_gemma":[0.94706064,0.000031064566,0.052416023,0.0003198372,0.00009164291,0.00003073528,0.0000018150047,0.000004684418,0.000043574975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991814,0.000097591445,0.0002963238,0.00006455442,0.00029084124,0.00006928714],"domain_scores_gemma":[0.99848527,0.00076033775,0.00048319632,0.00012184648,0.00012933135,0.000019993355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012253182,0.0000482191,0.00010473199,0.000022237391,0.00076644216,0.00012117132,0.0003716251,0.000013078876,0.0000047591275],"category_scores_gemma":[0.000033177475,0.00002287207,0.00007072458,0.00015370497,0.000010642053,0.00010818239,0.00012569976,0.00011448192,4.294049e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005339563,0.000013537347,0.00000116438,0.00000781019,0.000026326356,1.0645087e-7,0.000294582,0.12349948,0.00012117017,0.87164575,0.00019431338,0.004142364],"study_design_scores_gemma":[0.00029719327,0.000109819724,0.00010621091,0.0000055917244,0.000027683978,0.000026203594,0.00063647114,0.97631526,0.00018637441,0.013515658,0.0087347515,0.000038764505],"about_ca_topic_score_codex":0.0000049271966,"about_ca_topic_score_gemma":1.7741672e-7,"teacher_disagreement_score":0.94695973,"about_ca_system_score_codex":0.000042879463,"about_ca_system_score_gemma":0.00009576169,"threshold_uncertainty_score":0.5894931},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032233705,0.000029030432,0.99505657,0.0009973303,0.00018678996,0.00004735252,0.00000764782,0.000025304507,0.00042662563],"genre_scores_gemma":[0.94455665,0.00006849055,0.055083055,0.00013357715,0.000111129,0.000002623357,0.000009035276,0.0000047663166,0.00003067953],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990106,0.000046186295,0.0004384824,0.000090089656,0.00032322668,0.00009141658],"domain_scores_gemma":[0.998961,0.00031179743,0.00037685985,0.00008130585,0.00021454702,0.000054489432],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074862916,0.00006907097,0.00019732733,0.0001409108,0.000049280345,0.000048302518,0.00015395986,0.000041495136,0.000029073046],"category_scores_gemma":[0.00008413142,0.00005794252,0.000048366688,0.00035957093,0.0000070079022,0.00024128417,0.00006294147,0.00007062858,0.0000016568945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031700947,0.000034685036,0.000031750846,0.000019805138,0.000025915151,0.0000010735295,0.00086115627,0.02370511,0.00053682167,0.97347885,0.000114052964,0.0011590656],"study_design_scores_gemma":[0.00063644315,0.00016816976,0.004385307,0.00002102757,0.000018748648,0.000008139182,0.00017843304,0.929111,0.0006381241,0.064000264,0.0006942376,0.00014009644],"about_ca_topic_score_codex":0.000009475012,"about_ca_topic_score_gemma":1.4963832e-7,"teacher_disagreement_score":0.9413333,"about_ca_system_score_codex":0.000016572743,"about_ca_system_score_gemma":0.00006729739,"threshold_uncertainty_score":0.23628275},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054486483,0.000057959154,0.9435858,0.00032205455,0.00006859779,0.000451114,0.000010370787,0.00002063799,0.0009969695],"genre_scores_gemma":[0.932561,0.00009818406,0.06725212,0.000009488961,0.000040451505,0.000008300774,0.000001964628,0.000014938843,0.000013580368],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847,0.00011392165,0.0008185693,0.000089219306,0.00038068273,0.00012762126],"domain_scores_gemma":[0.9957667,0.0028473632,0.0008952044,0.0002021872,0.0002406505,0.000047904075],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066206325,0.00010459897,0.00036837536,0.00008245653,0.00013934268,0.000018641154,0.0001799014,0.00005745633,0.00002312203],"category_scores_gemma":[0.0016285658,0.000054818487,0.00010847128,0.00093119027,0.0002150815,0.00007845333,0.000100151556,0.00017710924,5.1093554e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00052205834,0.0004238808,0.000077582255,0.00052417786,0.00017016307,0.0000010972834,0.0011158749,0.061959922,0.0019249058,0.92818755,0.00021301661,0.0048797983],"study_design_scores_gemma":[0.0006339431,0.00018821102,0.00020106844,0.00012262804,0.00019083728,0.000006734555,0.00049381726,0.078784965,0.0050016283,0.91420454,0.000059312235,0.00011232435],"about_ca_topic_score_codex":5.9545994e-7,"about_ca_topic_score_gemma":6.204558e-8,"teacher_disagreement_score":0.87807447,"about_ca_system_score_codex":0.000025565927,"about_ca_system_score_gemma":0.00004346727,"threshold_uncertainty_score":0.2235433},"labels":[],"label_agreement":null},{"id":"W4318332805","doi":"10.23952/jano.5.2023.1.09","title":"On the lower semicontinuity and subdifferentiability of the value function for conic linear programming problems","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Conic section; Mathematics; Linear programming; Value (mathematics); Mathematical optimization; Function (biology); Bellman equation; Applied mathematics; Geometry; Statistics","score_opus":0.010704904426451695,"score_gpt":0.22028324289249643,"score_spread":0.20957833846604473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332805","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025410553,0.000011275277,0.97223353,0.001934105,0.000104262006,0.00024571997,0.0000013738133,0.000013220069,0.000045932054],"genre_scores_gemma":[0.9780653,0.000029176734,0.021656314,0.000171744,0.000036355777,0.000010059783,0.0000024859926,0.000004472061,0.000024106641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927187,0.000044142882,0.0002876796,0.000116934745,0.00019726259,0.00008212225],"domain_scores_gemma":[0.9990786,0.0002734853,0.00033014553,0.00010793525,0.00017562283,0.000034253295],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005209672,0.0000676606,0.0001414196,0.000053351574,0.00013818633,0.000056793895,0.00014186156,0.00003794908,0.0000062552745],"category_scores_gemma":[0.000104999235,0.00003586351,0.00007107159,0.0004287814,0.000040582872,0.000100456724,0.000054816806,0.000088401845,2.859567e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008969637,0.00011774973,0.00030813031,0.000023523378,0.000057436508,5.611119e-8,0.00024554084,0.902937,0.00022502236,0.09000441,0.00009802436,0.005893439],"study_design_scores_gemma":[0.00031726374,0.00014894953,0.0020079904,0.000013282119,0.000040559087,0.0000010970099,0.000022658061,0.9886801,0.00013234241,0.008396373,0.00019335735,0.000046015215],"about_ca_topic_score_codex":0.0000012623311,"about_ca_topic_score_gemma":1.6396775e-7,"teacher_disagreement_score":0.9526547,"about_ca_system_score_codex":0.000013115797,"about_ca_system_score_gemma":0.000028057073,"threshold_uncertainty_score":0.14624715},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20139594,0.0004634302,0.7624807,0.016581988,0.0005943293,0.0010415488,0.0000135362,0.0002170032,0.017211562],"genre_scores_gemma":[0.95009655,0.00046610725,0.048810743,0.00006688921,0.00013226215,0.000007974086,0.000003096062,0.000025433244,0.00039093662],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986872,0.00007718333,0.00061541836,0.0001215158,0.00031148412,0.00018719821],"domain_scores_gemma":[0.99835986,0.0006664854,0.00057881366,0.00015461519,0.00015423694,0.0000859679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009756477,0.00012614217,0.00042126724,0.00010179758,0.00014530988,0.00005423677,0.00016130276,0.00008241214,0.000115788265],"category_scores_gemma":[0.0005137697,0.00005986309,0.00013200947,0.0004484565,0.00013547865,0.000094442425,0.000059566704,0.00018719773,0.000006253268],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0036079038,0.0013463759,0.00038190515,0.0003452454,0.0012662214,0.000050956296,0.0043878555,0.23119396,0.013347349,0.6895007,0.036019705,0.018551836],"study_design_scores_gemma":[0.0022694515,0.0017361488,0.00046273557,0.00016478436,0.00064663874,0.00010107229,0.0043032393,0.5324742,0.009140621,0.44359145,0.0044761696,0.0006334764],"about_ca_topic_score_codex":0.0000057483226,"about_ca_topic_score_gemma":6.855643e-7,"teacher_disagreement_score":0.7487006,"about_ca_system_score_codex":0.00002804056,"about_ca_system_score_gemma":0.000031912445,"threshold_uncertainty_score":0.2441146},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13215241,0.000034880908,0.8629434,0.0007641764,0.00030925442,0.00012471057,0.00003282404,0.00003069307,0.0036076128],"genre_scores_gemma":[0.98633456,0.0005145802,0.013089388,0.0000069487487,0.00001959822,5.641858e-7,0.0000040116042,0.000005176984,0.00002519452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994772,0.000013051413,0.00022245616,0.000067951376,0.0001522749,0.00006707522],"domain_scores_gemma":[0.9996854,0.000039309925,0.00012990166,0.000045724846,0.00007281713,0.000026820515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015847065,0.00006474765,0.00018114413,0.0001934702,0.000026789045,0.00001000069,0.000078029996,0.000030890686,0.00004046934],"category_scores_gemma":[0.000022322563,0.000049233196,0.000031943116,0.0005286671,0.00004465503,0.000056532055,0.000025253788,0.000057069115,2.2273446e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035057445,0.000016519312,0.0006645154,0.000011478383,0.00008116134,5.5226866e-7,0.00022308255,0.9967396,0.0011151473,0.0009465842,0.000032378037,0.00013391743],"study_design_scores_gemma":[0.00033971661,0.000023023465,0.014089335,0.000020061132,0.000051670595,9.0837085e-7,0.00012132773,0.98488355,0.00031103392,0.000053851258,0.000050542298,0.000054997894],"about_ca_topic_score_codex":0.000006952785,"about_ca_topic_score_gemma":0.000001033146,"teacher_disagreement_score":0.8541821,"about_ca_system_score_codex":0.00001791397,"about_ca_system_score_gemma":0.000013251377,"threshold_uncertainty_score":0.20076716},"labels":[],"label_agreement":null},{"id":"W4318332836","doi":"10.23952/jano.5.2023.1.06","title":"On nonsmooth multiobjective semi-infinite programming with switching constraints","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Mathematics; Multiobjective programming; Semi-infinite programming; Multi-objective optimization; Computer science; Geometry","score_opus":0.007485384557642302,"score_gpt":0.22649303926863382,"score_spread":0.2190076547109915,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014495847,0.0000041249523,0.9964265,0.0005871602,0.000048858063,0.00009175188,7.3380824e-7,0.000056486348,0.001334801],"genre_scores_gemma":[0.70770186,0.000025550606,0.2919315,0.00026817553,0.00004057172,0.0000040350383,0.0000047744643,0.000007855033,0.000015682863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904424,0.000026864407,0.00028960328,0.0001724336,0.00032737193,0.00013948375],"domain_scores_gemma":[0.9991111,0.0001858047,0.0003268181,0.00008619168,0.00018414385,0.00010593986],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026190808,0.00010927622,0.00019513904,0.00028785554,0.000144189,0.000149998,0.00013984556,0.00004310036,0.00001635187],"category_scores_gemma":[0.00004782496,0.00007884103,0.000044998982,0.000930066,0.000029003204,0.00027779245,0.00003494365,0.00014912646,0.0000064789488],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006386284,0.00005420392,0.000075075804,0.00000393754,0.000056034027,0.0000073317765,0.00045515414,0.95021266,0.000043249114,0.025021408,0.000030312718,0.023976775],"study_design_scores_gemma":[0.0007282779,0.00019049793,0.0005363509,0.000025303925,0.000025017416,0.000019426932,0.00010574054,0.9971432,0.0000639078,0.00092927867,0.00011442963,0.000118548654],"about_ca_topic_score_codex":0.0000013478658,"about_ca_topic_score_gemma":1.1644699e-7,"teacher_disagreement_score":0.7062523,"about_ca_system_score_codex":0.000029399593,"about_ca_system_score_gemma":0.00006017903,"threshold_uncertainty_score":0.3215044},"labels":[],"label_agreement":null},{"id":"W4318332838","doi":"10.23952/jano.5.2023.1.04","title":"Cone enlargements and applications to vector optimization","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Unitatea Executiva pentru Finantarea Invatamantului Superior, a Cercetarii, Dezvoltarii si Inovarii; Ministerul Cercetării, Inovării şi Digitalizării","keywords":"Cone (formal languages); Vector (molecular biology); Computer science; Biology; Algorithm; Recombinant DNA; Genetics","score_opus":0.010940995224264113,"score_gpt":0.24648181870624686,"score_spread":0.23554082348198274,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332838","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013382336,0.000026336069,0.9968041,0.0021152948,0.000060528742,0.00017245646,0.0000023673574,0.00005273814,0.00063234306],"genre_scores_gemma":[0.17788734,0.00045832962,0.8201502,0.0011352503,0.00017360646,0.000036408004,0.00003145549,0.000016817088,0.00011058366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989845,0.000023789444,0.00037890932,0.00020180206,0.00027786812,0.00013308607],"domain_scores_gemma":[0.99915737,0.00007808071,0.00023871545,0.00011669072,0.00022298291,0.0001861794],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027036958,0.00010394143,0.00019952768,0.00034150438,0.00014890409,0.00015432492,0.00017643132,0.00004875295,0.00003360269],"category_scores_gemma":[0.000039104172,0.00009252591,0.000034504243,0.0012338889,0.000017219621,0.0003150275,0.000104401726,0.00007270716,0.000012073406],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016273718,0.00003629916,0.000050803857,0.000005675697,0.000029971467,7.9800463e-7,0.00014187662,0.9695836,0.000073980045,0.02440742,0.00027254995,0.005380754],"study_design_scores_gemma":[0.00041031028,0.00006448032,0.00059476355,0.000005964719,0.000027180029,0.000006296922,0.000034432942,0.99597174,0.000047980848,0.0006709541,0.0020530454,0.00011284247],"about_ca_topic_score_codex":0.000001092357,"about_ca_topic_score_gemma":5.4382145e-8,"teacher_disagreement_score":0.17775351,"about_ca_system_score_codex":0.000024238047,"about_ca_system_score_gemma":0.0000334025,"threshold_uncertainty_score":0.3773097},"labels":[],"label_agreement":null},{"id":"W4318332842","doi":"10.23952/jano.5.2023.1.05","title":"Convexity and continuity of specific set-valued maps and their extremal value functions","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft","keywords":"Convexity; Mathematics; Set (abstract data type); Value (mathematics); Combinatorics; Applied mathematics; Statistics; Computer science; Economics; Financial economics","score_opus":0.01607627434821768,"score_gpt":0.22365710738346953,"score_spread":0.20758083303525185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008510429,0.00009506625,0.9899662,0.0006815233,0.00007991053,0.000069082205,0.000007363836,0.000023176834,0.0005672538],"genre_scores_gemma":[0.91787523,0.0005091753,0.08136048,0.000112964146,0.00006728562,0.0000017732882,0.000013276862,0.000006764104,0.000053055497],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913704,0.000045805682,0.000371129,0.00016485355,0.00018256488,0.00009861095],"domain_scores_gemma":[0.9991788,0.0001300463,0.00032084738,0.000091631286,0.00017071211,0.00010792285],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038340673,0.000099427416,0.00026795143,0.00019027128,0.000113026064,0.00008460871,0.00009794972,0.000053802636,0.000018715447],"category_scores_gemma":[0.00002922348,0.00007589772,0.000045863155,0.0005617455,0.00006784737,0.00024711047,0.000082106875,0.00009685843,0.0000012470558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002302472,0.00018287683,0.0022374475,0.00004708578,0.00023226024,0.000004850483,0.0024477183,0.7641056,0.0015272228,0.20523839,0.0013101049,0.022436177],"study_design_scores_gemma":[0.0006996272,0.00008300094,0.007529463,0.000010396744,0.000027829577,0.000019232722,0.00017431944,0.986504,0.00014177822,0.0040999684,0.0006073889,0.00010298995],"about_ca_topic_score_codex":0.0000026474354,"about_ca_topic_score_gemma":1.262015e-7,"teacher_disagreement_score":0.9093648,"about_ca_system_score_codex":0.000011265281,"about_ca_system_score_gemma":0.000028277516,"threshold_uncertainty_score":0.30950192},"labels":[],"label_agreement":null},{"id":"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":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.70132655,0.000006828196,0.29787168,0.00014437786,0.000117352225,0.00013896146,0.0000041386693,0.000046595444,0.00034350582],"genre_scores_gemma":[0.98976016,0.00013630907,0.009670065,0.00011899218,0.00020313478,0.000006941678,0.000021561338,0.000026104422,0.000056748813],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898845,0.000050780225,0.00044353635,0.00013100363,0.00022787531,0.00015837149],"domain_scores_gemma":[0.99931884,0.00007777768,0.00028924466,0.00009364945,0.00010168382,0.0001187995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036341266,0.00013263006,0.00032773122,0.00012681974,0.00010856886,0.00006381317,0.00009556643,0.000102273894,0.00008076903],"category_scores_gemma":[0.000080834085,0.00010275514,0.000054577893,0.00028349712,0.000041836603,0.00015771213,0.000037631657,0.00018005111,0.00001008215],"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.006398113,0.0028326635,0.0124357985,0.00077228335,0.0012511351,0.00018502315,0.018172892,0.10831878,0.52902085,0.25674158,0.0034260326,0.06044486],"study_design_scores_gemma":[0.009935993,0.001148524,0.01758375,0.00032111802,0.0007041905,0.00023709278,0.0015365218,0.8697522,0.03833038,0.056130935,0.0025819046,0.0017373639],"about_ca_topic_score_codex":6.483185e-7,"about_ca_topic_score_gemma":5.7795674e-8,"teacher_disagreement_score":0.7614334,"about_ca_system_score_codex":0.000027685091,"about_ca_system_score_gemma":0.000037363272,"threshold_uncertainty_score":0.4190233},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0041721994,0.00004518747,0.99280643,0.00071717426,0.00008427504,0.000076743236,3.7774595e-7,0.000043142758,0.0020544701],"genre_scores_gemma":[0.5871515,0.000093351904,0.41202042,0.00058740715,0.00009521078,0.00000442175,0.000002253641,0.0000072832377,0.00003812626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992673,0.000015896328,0.00022555134,0.000166247,0.00019097945,0.00013405793],"domain_scores_gemma":[0.9995216,0.00006837035,0.00012208328,0.00007774294,0.0000646495,0.00014551138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022184847,0.00008282076,0.00016696645,0.00016641499,0.00010337119,0.00009366793,0.00012867487,0.000042026943,0.000002601563],"category_scores_gemma":[0.000029578345,0.00006469148,0.000024709412,0.000642862,0.000019980305,0.00024607117,0.00009536751,0.00010521068,0.000003668779],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007642877,0.000067982415,0.00007231764,0.000015950522,0.00002410152,0.0000057251423,0.0005508041,0.8625305,0.0010551139,0.09175079,0.00049051037,0.04335974],"study_design_scores_gemma":[0.000812677,0.00024323068,0.0032134152,0.00001985053,0.000018806008,0.00009291991,0.00024074137,0.9715802,0.00021985082,0.021141721,0.0021660745,0.00025052318],"about_ca_topic_score_codex":3.1356925e-7,"about_ca_topic_score_gemma":9.832233e-9,"teacher_disagreement_score":0.5829793,"about_ca_system_score_codex":0.000012103444,"about_ca_system_score_gemma":0.00001881267,"threshold_uncertainty_score":0.2638042},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004366095,0.000116360825,0.993839,0.001183772,0.00014372548,0.00020300185,0.0000014699597,0.00004074962,0.000105776926],"genre_scores_gemma":[0.5844632,0.0008366894,0.41449183,0.000085886524,0.00007001568,0.000010567574,0.000009188718,0.000012358195,0.000020261883],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981542,0.00013223337,0.0007401393,0.00021578486,0.0005176193,0.00024001372],"domain_scores_gemma":[0.9989501,0.00009719053,0.00040021454,0.00015457773,0.00028169338,0.000116220275],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086095737,0.00012571824,0.0003480655,0.00043989305,0.000072564704,0.00008243387,0.00031207583,0.000106077234,0.000023874914],"category_scores_gemma":[0.0002867424,0.00009967108,0.00004662824,0.0011254717,0.00008429417,0.0005012974,0.00015332503,0.00018686967,0.0000034170757],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009478741,0.00007971699,0.000051530744,0.000024403837,0.000013139121,0.0000071992304,0.0003039195,0.9924944,0.00058469805,0.0030019202,0.00006931044,0.0032749563],"study_design_scores_gemma":[0.00072604895,0.00015803956,0.00030662966,0.000028067927,0.000007655549,0.0000126063815,0.000052584295,0.9966615,0.00085336727,0.0010610927,0.000027535742,0.00010486717],"about_ca_topic_score_codex":0.0000047271956,"about_ca_topic_score_gemma":2.2392312e-7,"teacher_disagreement_score":0.5800971,"about_ca_system_score_codex":0.000043393404,"about_ca_system_score_gemma":0.00012293404,"threshold_uncertainty_score":0.40644687},"labels":[],"label_agreement":null},{"id":"W4318332889","doi":"10.23952/jano.5.2023.1.03","title":"Subdifferential calculus for ordered multifunctions with applications to set-valued optimization","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subderivative; Mathematics; Calculus (dental); Set (abstract data type); Pure mathematics; Mathematical optimization; Applied mathematics; Algebra over a field; Computer science; Regular polygon; Geometry; Convex optimization; Medicine","score_opus":0.016155330983677545,"score_gpt":0.25938858929646325,"score_spread":0.2432332583127857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4318332889","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012520303,0.000007627114,0.99726707,0.0017641017,0.00009069997,0.0004612605,0.000009295943,0.0000913734,0.00018339517],"genre_scores_gemma":[0.09024704,0.00004034032,0.90880674,0.00037974317,0.0001565565,0.00013233708,0.00010125259,0.000021538386,0.000114456416],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987238,0.00002725994,0.00045342906,0.00027271383,0.00033018828,0.00019262003],"domain_scores_gemma":[0.99863344,0.00011772598,0.00032027924,0.00016991851,0.00055478833,0.00020385195],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023226919,0.00014978288,0.00026738376,0.0004276682,0.00028420318,0.0001807313,0.0002374678,0.00006967801,0.000029721856],"category_scores_gemma":[0.00004701727,0.00011978641,0.00007530031,0.0016927609,0.00002247575,0.00030530017,0.000059503294,0.00008779712,0.0000069530915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011423133,0.00006585006,0.000016465206,0.000009002617,0.00006144198,4.832944e-7,0.00019623169,0.9757925,0.00006382741,0.020652786,0.00034299996,0.0026841708],"study_design_scores_gemma":[0.0009991355,0.00016866026,0.00014015123,0.000007437732,0.0000743934,0.000007490523,0.00006613577,0.99688107,0.000070890346,0.00035433873,0.0010726275,0.00015767259],"about_ca_topic_score_codex":0.0000028278391,"about_ca_topic_score_gemma":5.636324e-7,"teacher_disagreement_score":0.09012184,"about_ca_system_score_codex":0.00004429366,"about_ca_system_score_gemma":0.00008600037,"threshold_uncertainty_score":0.48847482},"labels":[],"label_agreement":null},{"id":"W4384574966","doi":"10.23952/jano.5.2023.2.06","title":"Iterative solutions of split fixed point and monotone inclusion problems in Hilbert spaces","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Research Foundation","keywords":"Fixed point; Lipschitz continuity; Monotone polygon; Mathematics; Hilbert space; Spectral radius; Convergence (economics); Strongly monotone; Fixed-point theorem; Operator (biology); Applied mathematics; Iterative method; Computation; Bounded function; Discrete mathematics; Pure mathematics; Mathematical optimization; Mathematical analysis; Algorithm","score_opus":0.011545052402500398,"score_gpt":0.22943313813430838,"score_spread":0.21788808573180798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384574966","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0066063986,0.00007382326,0.98936874,0.003468221,0.000033604032,0.00010110598,0.0000014706148,0.000013991782,0.0003326703],"genre_scores_gemma":[0.8623703,0.00038294512,0.13705462,0.00012779362,0.000022268023,0.000004119578,0.00000774108,0.0000048174816,0.000025402675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990875,0.000037219706,0.00041507947,0.00013441699,0.00022185034,0.00010389894],"domain_scores_gemma":[0.99930483,0.000100823694,0.0003173009,0.00006801191,0.00014193974,0.00006706839],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003854636,0.00007984197,0.00022348958,0.00034073708,0.00012404584,0.000057277484,0.0001114411,0.000045666224,0.000011589291],"category_scores_gemma":[0.000040259412,0.00006453729,0.00003416832,0.000912262,0.000029801355,0.00035029315,0.0002522574,0.00008569622,7.952002e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002372623,0.000071238755,0.00030716535,0.000012083058,0.000021450827,0.0000011497427,0.0021705492,0.96497715,0.00042577245,0.030087646,0.000059027327,0.001843045],"study_design_scores_gemma":[0.0004939084,0.00007623917,0.0025827978,0.000025549283,0.000012627346,0.0000048343954,0.000069070666,0.9906007,0.000093152594,0.005899741,0.00006971099,0.00007168926],"about_ca_topic_score_codex":0.0000099532,"about_ca_topic_score_gemma":9.1472873e-7,"teacher_disagreement_score":0.8557639,"about_ca_system_score_codex":0.000023834826,"about_ca_system_score_gemma":0.000033998374,"threshold_uncertainty_score":0.26317543},"labels":[],"label_agreement":null},{"id":"W4384574973","doi":"10.23952/jano.5.2023.2.07","title":"A note on the subdifferential of convex multi-composite functionals","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subderivative; Minimax; Mathematics; Regular polygon; Constraint (computer-aided design); Composite number; Convex analysis; Convex function; Mathematical optimization; Applied mathematics; Pure mathematics; Convex optimization; Geometry; Algorithm","score_opus":0.016859116991125394,"score_gpt":0.24352579363967303,"score_spread":0.22666667664854764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384574973","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024583212,0.000008565016,0.99424946,0.0027727806,0.00011982528,0.00005942563,0.0000020755815,0.000018436986,0.00031107958],"genre_scores_gemma":[0.918653,0.00008527982,0.08055802,0.0005487836,0.00007683767,0.0000030240078,0.000008069848,0.0000063461594,0.000060630056],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990783,0.000041345884,0.00035456897,0.00011104012,0.00032962626,0.00008515349],"domain_scores_gemma":[0.9990497,0.00024121752,0.00035916662,0.00010071163,0.0001923419,0.00005683453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027574235,0.00007963653,0.00018842595,0.00018140838,0.00010011733,0.000058223475,0.00019418023,0.000039918832,0.000054455086],"category_scores_gemma":[0.000042568274,0.00005017161,0.000080004334,0.00063772144,0.00002836646,0.00012344173,0.000048433518,0.00009922486,0.000008492031],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007136722,0.00009675611,0.0000788844,0.000004512615,0.000054781547,9.3931345e-7,0.00021486996,0.9524127,0.0008516886,0.04422736,0.0002859563,0.0017001798],"study_design_scores_gemma":[0.000451422,0.00006493061,0.0031707508,0.000007983888,0.00002378922,0.0000031729194,0.000017150762,0.9945344,0.00061324163,0.00090015575,0.00015401767,0.000059030193],"about_ca_topic_score_codex":0.0000012765972,"about_ca_topic_score_gemma":4.792105e-8,"teacher_disagreement_score":0.9161947,"about_ca_system_score_codex":0.000012837566,"about_ca_system_score_gemma":0.000031459276,"threshold_uncertainty_score":0.2045939},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003090465,0.000029546687,0.9986778,0.0003875884,0.00018706059,0.00024268501,1.5797993e-7,0.000052426047,0.00011367105],"genre_scores_gemma":[0.6061676,0.00006510926,0.39347225,0.00017075457,0.00005512069,0.00000947877,0.0000022356844,0.0000097398715,0.000047715854],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988026,0.000030768428,0.000506311,0.00015170146,0.0002654127,0.0002432321],"domain_scores_gemma":[0.99892753,0.0004312873,0.0003287215,0.000108738575,0.000114337745,0.00008940976],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051293656,0.00011320011,0.00030175532,0.00020324708,0.00008997731,0.00012153174,0.00022770467,0.00008596822,0.0000059934773],"category_scores_gemma":[0.0003259993,0.000100778074,0.00006865932,0.0003780361,0.000022930539,0.00022525188,0.0000535895,0.00029346146,0.0000037546904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006385638,0.000016666987,0.00020047928,0.000018099689,0.000024296474,0.000004404697,0.00030857697,0.98821306,0.00007662349,0.005237695,0.00003643178,0.005799809],"study_design_scores_gemma":[0.0016111622,0.00028412134,0.00032619678,0.00004563882,0.000015003787,0.000004105963,0.00010564444,0.9965022,0.000037379676,0.0002782046,0.00067951315,0.00011083471],"about_ca_topic_score_codex":0.0000012971777,"about_ca_topic_score_gemma":2.9608458e-8,"teacher_disagreement_score":0.60585856,"about_ca_system_score_codex":0.00004715164,"about_ca_system_score_gemma":0.00003779406,"threshold_uncertainty_score":0.41096106},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019732175,0.0002270811,0.9775049,0.00012896283,0.00019019614,0.00011736024,0.0000014478153,0.00015450058,0.0019433958],"genre_scores_gemma":[0.966224,0.0007291315,0.032909743,0.00001842957,0.00008448121,0.0000025413228,0.0000021632968,0.00001440699,0.000015105839],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99952954,0.00000771933,0.0002168959,0.000041301762,0.00011678196,0.00008776755],"domain_scores_gemma":[0.9997,0.00006553082,0.00008959764,0.00005479605,0.000055941873,0.00003414204],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008313141,0.00006261329,0.00013809623,0.000055159213,0.000046900153,0.000022863005,0.00006634745,0.000038104907,0.000002909246],"category_scores_gemma":[0.000009566397,0.00004076771,0.000028703535,0.00017078915,0.000031313128,0.000030772404,0.000016406462,0.00010083447,6.9764593e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078602585,0.000024938172,0.000044458702,0.000015414176,0.00008603324,0.000007636765,0.0002701344,0.6844741,0.00797637,0.000783251,0.0016941493,0.3045449],"study_design_scores_gemma":[0.00016765301,0.000060778253,0.00045542273,0.00002046497,0.000015262973,0.000009210905,0.00005389291,0.98841065,0.008962047,0.0011865181,0.0005983334,0.000059734713],"about_ca_topic_score_codex":4.848788e-7,"about_ca_topic_score_gemma":1.715983e-8,"teacher_disagreement_score":0.94649184,"about_ca_system_score_codex":0.000007861727,"about_ca_system_score_gemma":0.000007458001,"threshold_uncertainty_score":0.1662459},"labels":[],"label_agreement":null},{"id":"W4384574993","doi":"10.23952/jano.5.2023.2.03","title":"Existence and stability to vector optimization problems via improvement sets","year":2023,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Bộ Giáo dục và Ðào tạo","keywords":"Vector optimization; Optimization problem; Mathematical optimization; Stability (learning theory); Mathematics; Parametric statistics; Continuous optimization; Computer science; Applied mathematics; Multi-swarm optimization","score_opus":0.014264775075372974,"score_gpt":0.23458838648716213,"score_spread":0.22032361141178916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384574993","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0024466119,0.000017126253,0.99455506,0.0024316772,0.00009068474,0.0001932656,0.0000019668996,0.000050003153,0.00021358828],"genre_scores_gemma":[0.3514286,0.00016177716,0.64780784,0.0004984582,0.000051139363,0.00001325189,0.000012103405,0.000010616535,0.000016191243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873054,0.00003144318,0.0004698081,0.00025912304,0.00034878743,0.00016032558],"domain_scores_gemma":[0.99902457,0.00007738374,0.00028594604,0.00013751155,0.000270839,0.00020376647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045070873,0.00012457115,0.00023161409,0.00022580639,0.00013500756,0.00016526075,0.00018067243,0.0000526067,0.00003120161],"category_scores_gemma":[0.00005672649,0.000104398874,0.00004148911,0.0010137191,0.000022641956,0.0003959366,0.00012780665,0.00008948267,0.000003979382],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026388225,0.000049100043,0.000065001754,0.0000150634905,0.000023060808,9.752882e-7,0.00043846198,0.98771733,0.00034701545,0.0033943937,0.00004616922,0.007877056],"study_design_scores_gemma":[0.00034839814,0.00018248706,0.0005285154,0.000009577535,0.000019490531,0.000005903475,0.000038175567,0.99726254,0.00021235058,0.0011723907,0.00009668456,0.0001234662],"about_ca_topic_score_codex":0.0000039591723,"about_ca_topic_score_gemma":2.2549871e-7,"teacher_disagreement_score":0.34898198,"about_ca_system_score_codex":0.00004592746,"about_ca_system_score_gemma":0.00004213633,"threshold_uncertainty_score":0.42572626},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.032822873,0.000010101951,0.964647,0.00028968917,0.000087388406,0.00008777161,5.626941e-7,0.00009860006,0.001955996],"genre_scores_gemma":[0.7188635,0.000012219363,0.2808405,0.00011217318,0.000073042844,0.000003853795,0.0000203603,0.0000100506995,0.000064313055],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885267,0.00007831474,0.00034050108,0.00023243907,0.0003263784,0.00016971228],"domain_scores_gemma":[0.9991852,0.00007171869,0.00030490317,0.00016172306,0.00009664761,0.0001798176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008094303,0.00010032199,0.00017628612,0.00022440289,0.00020435029,0.00025008526,0.00030076268,0.000037152953,0.0000035688117],"category_scores_gemma":[0.00010076718,0.0000856493,0.000025265374,0.0007597396,0.000015249225,0.00024412527,0.00012197557,0.00025146623,0.00001283428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021900581,0.00010397602,0.000103807426,0.000009678008,0.0000058218693,0.0000015594884,0.00081109325,0.9697666,0.0009849477,0.009652938,0.000047294227,0.018490352],"study_design_scores_gemma":[0.0004462821,0.00013893686,0.0009949395,0.000009257437,0.000007025433,0.000008300688,0.00016953963,0.9974414,0.00007342035,0.000059823244,0.00054824835,0.000102839585],"about_ca_topic_score_codex":0.00000475079,"about_ca_topic_score_gemma":5.127884e-8,"teacher_disagreement_score":0.68604064,"about_ca_system_score_codex":0.000023655006,"about_ca_system_score_gemma":0.000025597032,"threshold_uncertainty_score":0.34926772},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031989985,0.00020652858,0.9976561,0.00010632526,0.000040088984,0.0011429706,0.000120835044,0.000128138,0.00027910955],"genre_scores_gemma":[0.9689551,0.00008482616,0.030467026,0.00002746885,0.0001148771,0.00021215725,0.000040882664,0.000060867238,0.000036791815],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99861443,0.000022220685,0.00066399324,0.00016875188,0.00031130167,0.00021928978],"domain_scores_gemma":[0.9989789,0.00010519535,0.00032639282,0.00013781477,0.00025762804,0.00019402655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020396228,0.00020537787,0.0005617568,0.00019564705,0.000053674154,0.000028551362,0.000119525845,0.00009742148,0.00000292403],"category_scores_gemma":[0.000019225909,0.00016557405,0.000046742007,0.0005119139,0.00003023549,0.00019512067,0.000010686851,0.00015854294,0.0000036514455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028833048,0.000026969294,0.000014981131,0.00006873188,0.00014192564,5.7140824e-7,0.000115979674,0.99172395,0.0069230134,0.00015328123,0.00016740897,0.00037485454],"study_design_scores_gemma":[0.0021904444,0.00025237183,0.000008062174,0.000065413435,0.00010762138,0.0000072263038,0.0000508433,0.9967388,0.00015715133,0.000048952315,0.0002061984,0.00016689982],"about_ca_topic_score_codex":0.0000013278508,"about_ca_topic_score_gemma":6.899629e-8,"teacher_disagreement_score":0.9686352,"about_ca_system_score_codex":0.00006580999,"about_ca_system_score_gemma":0.000026931659,"threshold_uncertainty_score":0.67519134},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.039249845,0.000650714,0.92257726,0.002157196,0.0011649446,0.0007510831,0.0000010083608,0.00018003123,0.033267934],"genre_scores_gemma":[0.9938965,0.000041167932,0.0046747834,0.0004744437,0.0008180514,0.0000048461948,0.000009785831,0.000019453442,0.00006096557],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902135,0.000005023909,0.00041053828,0.00016752057,0.0002501438,0.0001453969],"domain_scores_gemma":[0.99956053,0.000026712161,0.00021374678,0.00007924596,0.000096704636,0.000023054643],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042782415,0.00012413031,0.00017946122,0.00022590779,0.00009980596,0.0003524567,0.00008381991,0.000049966126,0.00014043371],"category_scores_gemma":[0.000021553358,0.00009902147,0.00007224282,0.00031961384,0.000020519163,0.0008711348,0.00006082401,0.00013299233,0.000016123418],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029071415,0.00030092985,0.001612839,0.0012852554,0.00014599087,0.000019933574,0.00034789334,0.8881364,0.0010173866,0.05325852,0.005422751,0.04816137],"study_design_scores_gemma":[0.00041630326,0.000030122615,0.0005941277,0.000074745854,0.00009037189,0.0000057517705,0.000068795234,0.9648194,0.00002400187,0.0077573257,0.025969889,0.00014921703],"about_ca_topic_score_codex":0.000007827569,"about_ca_topic_score_gemma":2.3780947e-7,"teacher_disagreement_score":0.95464665,"about_ca_system_score_codex":0.000053391785,"about_ca_system_score_gemma":0.0000118638045,"threshold_uncertainty_score":0.40379784},"labels":[],"label_agreement":null},{"id":"W4392403996","doi":"10.23952/jano.6.2024.1.03","title":"Numerical computation of entropy-regularized quadratic optimization problems","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Zhejiang Province; National Natural Science Foundation of China","keywords":"Computation; Quadratic equation; Applied mathematics; Mathematics; Entropy (arrow of time); Mathematical optimization; Computer science; Algorithm; Physics; Geometry; Thermodynamics","score_opus":0.007662265125497311,"score_gpt":0.2274391926198778,"score_spread":0.2197769274943805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392403996","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014537411,0.00024177125,0.9975468,0.0012428348,0.00020128342,0.00014453511,0.0000013219557,0.000054592587,0.00042147675],"genre_scores_gemma":[0.48889658,0.00013466128,0.51076025,0.000093667055,0.00006928384,0.0000036989459,0.0000145476,0.000011775493,0.000015526319],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818045,0.000075632735,0.0008511221,0.00024804732,0.000499728,0.00014502405],"domain_scores_gemma":[0.9987596,0.00014288082,0.000499378,0.00011530397,0.00035639206,0.00012644289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037774554,0.00016227554,0.0003883841,0.00037904302,0.00008406585,0.0002419675,0.00021668336,0.00009077713,0.000054064792],"category_scores_gemma":[0.00005106767,0.0001318435,0.00012915436,0.0011099649,0.00003967767,0.00065656815,0.000045979534,0.00015710318,0.0000030305625],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003487164,0.00010237375,0.000013529716,0.000057889774,0.000093267765,0.0000024320625,0.00035031783,0.95732933,0.00024341856,0.038103666,0.00007272718,0.0035961769],"study_design_scores_gemma":[0.00049937115,0.00014348552,0.00004425797,0.00006178671,0.000082244704,0.000025953937,0.000020322866,0.996034,0.00015712812,0.0026967234,0.00009900289,0.00013567459],"about_ca_topic_score_codex":0.0000035999492,"about_ca_topic_score_gemma":3.7064684e-8,"teacher_disagreement_score":0.4887512,"about_ca_system_score_codex":0.00005260871,"about_ca_system_score_gemma":0.00012203694,"threshold_uncertainty_score":0.5376422},"labels":[],"label_agreement":null},{"id":"W4392404031","doi":"10.23952/jano.6.2024.1.07","title":"On the linear convergence rate of generalized ADMM for convex composite programming","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Henan Province; National Natural Science Foundation of China","keywords":"Convergence (economics); Rate of convergence; Mathematics; Composite number; Regular polygon; Mathematical optimization; Applied mathematics; Linear programming; Computer science; Algorithm; Economics; Geometry","score_opus":0.013037206758040057,"score_gpt":0.2509826683118481,"score_spread":0.23794546155380808,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392404031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0008402569,0.00008838864,0.99593925,0.0027337796,0.00013828104,0.0001340668,0.0000021013982,0.00001595472,0.00010793204],"genre_scores_gemma":[0.5385737,0.00011867079,0.46049434,0.0006680363,0.00008295473,0.00000936123,0.0000066057387,0.000008018309,0.000038329512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99924237,0.000036540903,0.00035963577,0.00012297192,0.00015706774,0.00008143929],"domain_scores_gemma":[0.99908966,0.00033917231,0.00023060883,0.00008029336,0.00020740913,0.00005288743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039786883,0.0000795687,0.000184766,0.00009904251,0.00007937108,0.00009961226,0.00017408705,0.000033751425,0.000029502755],"category_scores_gemma":[0.000041441184,0.00004922546,0.00008860133,0.0003903772,0.000028721932,0.0001466892,0.000025928075,0.00008005515,0.0000013373848],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000070290844,0.000038464168,0.000005208736,0.000018383222,0.00006871602,7.145687e-7,0.00016491841,0.68618536,0.00046438674,0.3103648,0.00020900661,0.0024097501],"study_design_scores_gemma":[0.0002716577,0.00010975118,0.000015224328,0.000021899217,0.000038567792,0.0000034889251,0.00001113444,0.9938505,0.001097259,0.0032623163,0.0012586878,0.00005950695],"about_ca_topic_score_codex":0.0000010315453,"about_ca_topic_score_gemma":2.4014788e-8,"teacher_disagreement_score":0.53773344,"about_ca_system_score_codex":0.000013049679,"about_ca_system_score_gemma":0.000047835325,"threshold_uncertainty_score":0.2007356},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00014527202,0.00017305081,0.9983221,0.00016708435,0.00044230642,0.00012695124,0.000007854335,0.00015623093,0.00045911781],"genre_scores_gemma":[0.19168778,0.00010088941,0.8077884,0.00004689682,0.0002563529,0.000012647894,0.00005526285,0.000039265982,0.000012549251],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993031,0.000014188201,0.00034970773,0.00010819357,0.000115837945,0.00010894387],"domain_scores_gemma":[0.9995667,0.00012164501,0.00005542195,0.00005990944,0.00011257784,0.00008378118],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023825801,0.00010876411,0.00016741025,0.00021495351,0.000075556796,0.00008621143,0.000071390474,0.00011213117,0.000054573964],"category_scores_gemma":[0.000025746036,0.000101598154,0.000035845776,0.00029715986,0.000013531967,0.00031551433,0.000010352701,0.00013443881,6.495643e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022940534,0.0000150150145,0.0000017756793,0.00003585293,0.000048267306,8.957839e-7,0.00019023103,0.97261745,0.0030447429,0.019072596,0.00020685306,0.004743369],"study_design_scores_gemma":[0.00026864308,0.000056233555,0.000031204392,0.000016585629,0.00004805363,0.000025586563,0.000021634572,0.995283,0.00063748565,0.0023200964,0.0011840342,0.000107436696],"about_ca_topic_score_codex":2.3099656e-7,"about_ca_topic_score_gemma":2.7991264e-8,"teacher_disagreement_score":0.1915425,"about_ca_system_score_codex":0.00005134527,"about_ca_system_score_gemma":0.000030713556,"threshold_uncertainty_score":0.41430527},"labels":[],"label_agreement":null},{"id":"W4392404093","doi":"10.23952/jano.6.2024.1.04","title":"A new hybrid Halpern-based extragradient algorithm for a pseudomonotone equilibrium problem and a fixed point problem of nonexpansive mappings in Banach spaces","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Banach space; Fixed point; Mathematics; Algorithm; Point (geometry); Pure mathematics; Applied mathematics; Mathematical analysis; Geometry","score_opus":0.0063825247507114345,"score_gpt":0.22055230662088773,"score_spread":0.2141697818701763,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392404093","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005557318,0.0002697411,0.99585134,0.0028066563,0.000040553678,0.0003276681,0.0000054227353,0.00001989197,0.00012301847],"genre_scores_gemma":[0.12783048,0.00007321092,0.8718676,0.000118931646,0.000046731402,0.000016026648,0.000008680437,0.000010677001,0.000027687773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871016,0.000026631988,0.0005940552,0.00026367564,0.00024962903,0.00015582604],"domain_scores_gemma":[0.9991273,0.0001508811,0.00031642843,0.00007942372,0.00018975777,0.00013618544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033771954,0.000144027,0.00035782822,0.00038193844,0.00003737327,0.00018532401,0.00014250215,0.000048981354,0.000011582944],"category_scores_gemma":[0.00001434556,0.00011755774,0.00008868548,0.0005727872,0.000028110897,0.0003681408,0.00004334451,0.00011210201,2.841527e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113970396,0.0001495957,0.000024699422,0.00012918097,0.000107244705,0.00000941923,0.0011164289,0.9260905,0.0011494274,0.013175895,0.00025814297,0.057675485],"study_design_scores_gemma":[0.0010160859,0.00025075217,0.000034702625,0.00010506127,0.000048938786,0.000025110145,0.00004839075,0.9931837,0.000762863,0.004231195,0.00016422858,0.00012897473],"about_ca_topic_score_codex":0.000019388306,"about_ca_topic_score_gemma":4.602278e-7,"teacher_disagreement_score":0.12727475,"about_ca_system_score_codex":0.00004501131,"about_ca_system_score_gemma":0.0001847024,"threshold_uncertainty_score":0.47938657},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0005966536,0.00023325512,0.99571735,0.0011749589,0.00009635327,0.0005638837,0.000007951359,0.00004336279,0.0015662415],"genre_scores_gemma":[0.03939164,0.00027618412,0.9597233,0.000060195427,0.00015849007,0.000050539194,0.000010492703,0.00004827594,0.0002808932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99828964,0.000050518505,0.0007657685,0.00024895289,0.00038572313,0.00025938224],"domain_scores_gemma":[0.99860317,0.0006789352,0.0002561602,0.000113573435,0.00021045242,0.00013769027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00091173773,0.00017017827,0.00041257596,0.00029097951,0.000068966285,0.00014638738,0.00012663072,0.00012972427,0.00003810138],"category_scores_gemma":[0.0002618837,0.00013789767,0.000087025044,0.00052913063,0.00005491983,0.0002997324,0.000044931472,0.00032710604,0.000001443052],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048477104,0.00022579437,0.000009460524,0.00037907774,0.00007109078,0.000011509046,0.00092357106,0.87547225,0.00011360022,0.09689301,0.00052705104,0.024888838],"study_design_scores_gemma":[0.0010673186,0.00015447133,0.000009553119,0.000107921245,0.000032936754,0.0000208033,0.00014782301,0.90532273,0.00012576887,0.09165113,0.0011977219,0.00016180419],"about_ca_topic_score_codex":0.0000027833973,"about_ca_topic_score_gemma":3.9033606e-7,"teacher_disagreement_score":0.03879499,"about_ca_system_score_codex":0.00013254702,"about_ca_system_score_gemma":0.00010257402,"threshold_uncertainty_score":0.56233037},"labels":[],"label_agreement":null},{"id":"W4392404120","doi":"10.23952/jano.6.2024.1.02","title":"Tseng-type algorithms for solving variational inequalities over the solution sets of split variational inclusion problems with an application to a bilevel optimization problem","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Technion-Israel Institute of Technology","keywords":"Bilevel optimization; Variational inequality; Inclusion (mineral); Mathematical optimization; Type (biology); Mathematics; Optimization problem; Algorithm; Inequality; Computer science; Mathematical analysis; Sociology","score_opus":0.016482215035793793,"score_gpt":0.2631354231861637,"score_spread":0.2466532081503699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392404120","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020302995,0.00007345871,0.99645513,0.0024020285,0.000121472265,0.00060359546,0.000017900464,0.00004647394,0.00007688256],"genre_scores_gemma":[0.1753099,0.00004513892,0.823984,0.00026817224,0.00016992459,0.000056971534,0.00012974018,0.000020147103,0.000015979545],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99792916,0.00007217499,0.000777335,0.00034737197,0.0006949376,0.00017902568],"domain_scores_gemma":[0.9978062,0.00034982673,0.0005654073,0.00018032856,0.0009755055,0.00012275811],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012191583,0.00019121279,0.0002864892,0.00037100964,0.00039436412,0.00026865327,0.0003232039,0.00010225697,0.00002645188],"category_scores_gemma":[0.00007151115,0.00013182953,0.0000723403,0.001225225,0.00003624611,0.00097517495,0.00016524702,0.00013906695,7.9769796e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012485094,0.00011292619,0.000017819528,0.000053039374,0.00008271689,2.231442e-7,0.0015607151,0.87210375,0.0002635657,0.11909075,0.00005192743,0.0065377057],"study_design_scores_gemma":[0.00048732365,0.0003907696,0.00031615177,0.00005823927,0.000089461835,0.000013630655,0.000037481106,0.9875228,0.000049126083,0.010577234,0.0002841438,0.00017364077],"about_ca_topic_score_codex":0.000019515883,"about_ca_topic_score_gemma":0.0000014580629,"teacher_disagreement_score":0.17510685,"about_ca_system_score_codex":0.000108898355,"about_ca_system_score_gemma":0.0002914326,"threshold_uncertainty_score":0.5375852},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0011800034,0.00010792416,0.99787235,0.00007540957,0.000070597496,0.00016657052,0.000008972572,0.000024915005,0.00049327273],"genre_scores_gemma":[0.2113748,0.0003219932,0.78819025,0.00004790176,0.000030009038,0.0000037254433,0.0000132623345,0.00001327276,0.0000047779245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883926,0.00003950459,0.0006098306,0.000108671804,0.00028575555,0.00011696064],"domain_scores_gemma":[0.9988756,0.00024335206,0.00037965603,0.00008535536,0.00030076373,0.000115241484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037628136,0.00012621032,0.0003143711,0.0002592025,0.00005416727,0.00006970515,0.00007583389,0.00006322385,0.00007912304],"category_scores_gemma":[0.00014962266,0.00008759457,0.00003376865,0.0006665715,0.000042732332,0.00086479227,0.000021743097,0.00014875762,6.233998e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022730409,0.000083333325,0.000008278109,0.0002060893,0.000043465465,0.000003155844,0.0003385143,0.91084856,0.000063977735,0.028190715,0.000058434103,0.059928197],"study_design_scores_gemma":[0.00048425337,0.0005559942,0.00004062296,0.00013337217,0.00012569905,0.000035583842,0.000108251086,0.97776794,0.00040484886,0.02000098,0.00019249412,0.0001499471],"about_ca_topic_score_codex":0.0000022271238,"about_ca_topic_score_gemma":8.577478e-8,"teacher_disagreement_score":0.2101948,"about_ca_system_score_codex":0.000031074236,"about_ca_system_score_gemma":0.00004603058,"threshold_uncertainty_score":0.3572003},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008382664,0.001132115,0.988988,0.0008979573,0.0001948747,0.000233662,0.0000035637388,0.000042938747,0.00012425544],"genre_scores_gemma":[0.25320137,0.0009162647,0.7455738,0.00014485062,0.0001041336,0.000021461525,0.000006805165,0.000019098901,0.000012162551],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855477,0.00008293506,0.00056917913,0.00037963223,0.00019669851,0.00021679487],"domain_scores_gemma":[0.999183,0.00019973764,0.00020276023,0.00013730387,0.00006983906,0.00020736629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035371346,0.00022464106,0.00042299734,0.00025974543,0.00010973655,0.00039785446,0.0002000568,0.00009630442,0.0000127422945],"category_scores_gemma":[0.000023127543,0.00016053942,0.00006776181,0.00051029143,0.0000874976,0.00041881934,0.0001551301,0.0002745298,4.7957246e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028546344,0.00049800536,0.00053714943,0.00022053871,0.0001974888,0.000029902902,0.0037274456,0.42157996,0.0019577695,0.09291504,0.00016226862,0.47788897],"study_design_scores_gemma":[0.0005999761,0.00018363535,0.00045855352,0.000063490406,0.000024683894,0.000051143084,0.00006843022,0.9917092,0.00022967305,0.005637011,0.0007741549,0.0002000469],"about_ca_topic_score_codex":0.000006345302,"about_ca_topic_score_gemma":2.4737525e-7,"teacher_disagreement_score":0.5701293,"about_ca_system_score_codex":0.000041874137,"about_ca_system_score_gemma":0.00003613079,"threshold_uncertainty_score":0.65466076},"labels":[],"label_agreement":null},{"id":"W4393443251","doi":"10.23952/jano.6.2024.2.07","title":"On approximate positively properly efficient solutions in nonsmooth semi-infinite multiobjective optimization problems with data uncertainty","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Multi-objective optimization; Mathematics; Applied mathematics; Computer science","score_opus":0.016073939679707213,"score_gpt":0.23526598263677026,"score_spread":0.21919204295706304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393443251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025285257,0.00008478136,0.99695426,0.0012434595,0.000076268625,0.0002937086,0.000015600779,0.0000527685,0.0010262695],"genre_scores_gemma":[0.6314337,0.00011384222,0.36802453,0.00023822603,0.000052280873,0.000016321417,0.00008230767,0.000019305284,0.000019432],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983376,0.000074017466,0.0005042068,0.0004321709,0.0004420093,0.00020999131],"domain_scores_gemma":[0.9989405,0.00017904572,0.00026556794,0.0002358821,0.000268781,0.00011021808],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005468505,0.00018571,0.00027465262,0.00047504157,0.00015409094,0.00034677272,0.00034712968,0.00007266368,0.000017453893],"category_scores_gemma":[0.000050263865,0.000130379,0.00004214176,0.0013518664,0.00004841489,0.00061152846,0.000119077755,0.00025733304,0.000002656219],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011200559,0.0002126088,0.000010825092,0.000020596808,0.00006260918,0.000007370732,0.00054100016,0.97371995,0.000023792472,0.023251738,0.000036226822,0.0020012427],"study_design_scores_gemma":[0.00067807635,0.00023204606,0.00008456806,0.0001323082,0.000049718405,0.000025422449,0.00005356152,0.998199,0.000012544067,0.00029210807,0.000066984496,0.00017364866],"about_ca_topic_score_codex":0.000014032493,"about_ca_topic_score_gemma":0.0000014244218,"teacher_disagreement_score":0.6311809,"about_ca_system_score_codex":0.00016414482,"about_ca_system_score_gemma":0.00019599703,"threshold_uncertainty_score":0.53167015},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00866556,0.00015700322,0.98978263,0.00009544779,0.00016731852,0.000069536,0.0000024712888,0.00001498453,0.0010450352],"genre_scores_gemma":[0.9267539,0.000040566687,0.072991356,0.00000791296,0.00010375928,0.000002404758,0.0000026992188,0.000010032747,0.000087356435],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929464,0.000013523103,0.00042414197,0.00006484983,0.00014430417,0.00005852998],"domain_scores_gemma":[0.9994288,0.0002195889,0.00017412617,0.00004975539,0.000078531375,0.000049166993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011287631,0.000064823216,0.00020795433,0.000086232285,0.000031597974,0.000026626534,0.000034166827,0.00003984447,0.000057651137],"category_scores_gemma":[0.00006395019,0.000044774435,0.000057382138,0.0001769062,0.000025471265,0.00009021864,0.000010229938,0.00008111742,0.0000013627731],"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.00023960839,0.0004086539,0.000052198775,0.00066972966,0.0002417279,0.0000065995246,0.0007809727,0.35873193,0.005841829,0.59145504,0.0009019386,0.040669803],"study_design_scores_gemma":[0.00047750954,0.00023437277,0.000057732428,0.00018547114,0.00020175405,0.000034280012,0.0002833059,0.85372293,0.00022539824,0.14361387,0.000821768,0.00014160783],"about_ca_topic_score_codex":0.0000010307471,"about_ca_topic_score_gemma":1.1842435e-7,"teacher_disagreement_score":0.9180884,"about_ca_system_score_codex":0.000014863019,"about_ca_system_score_gemma":0.000020750707,"threshold_uncertainty_score":0.18258485},"labels":[],"label_agreement":null},{"id":"W4393443269","doi":"10.23952/jano.6.2024.2.05","title":"Pontryagin optimality conditions for generalized bilevel optimal control problems with pure state inequality constraints","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Pontryagin's minimum principle; Optimal control; Bilevel optimization; Inequality; Mathematics; Mathematical economics; Control (management); State (computer science); Mathematical optimization; Maximum principle; Applied mathematics; Economics; Optimization problem; Mathematical analysis","score_opus":0.01176881556444719,"score_gpt":0.25060960242217994,"score_spread":0.23884078685773275,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393443269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001039125,0.0000934515,0.9955636,0.002579466,0.00009950006,0.00033109772,0.000074060896,0.000059425187,0.00016022418],"genre_scores_gemma":[0.5649218,0.000048293892,0.43450478,0.0003573316,0.00006763295,0.000026999305,0.000036291236,0.000011556002,0.000025319521],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850994,0.000061256265,0.00061242847,0.00028813342,0.0003326092,0.00019564062],"domain_scores_gemma":[0.99869907,0.00021785908,0.00033808907,0.00012657547,0.0004442316,0.00017420451],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00057855266,0.000176512,0.00037397235,0.00020101898,0.00015135811,0.00039070222,0.00019983288,0.00006669909,0.000058247126],"category_scores_gemma":[0.00003721887,0.00012700279,0.00011046997,0.00049851707,0.00008889681,0.00056102074,0.000028116618,0.00015743126,0.0000014937287],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012734503,0.00008938035,0.000030362447,0.000042276908,0.00020581527,0.000004580699,0.00025650734,0.93933535,0.00016150893,0.057188798,0.00017121705,0.0023868494],"study_design_scores_gemma":[0.0017420857,0.00019476839,0.00017269753,0.000031769632,0.00013358222,0.0000466653,0.000022061715,0.9927296,0.00006539498,0.004367595,0.00031519216,0.00017859992],"about_ca_topic_score_codex":0.0000029390233,"about_ca_topic_score_gemma":2.7741305e-7,"teacher_disagreement_score":0.5638827,"about_ca_system_score_codex":0.00005055822,"about_ca_system_score_gemma":0.00020748768,"threshold_uncertainty_score":0.5179023},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.029531002,0.000032854627,0.96922207,0.0002634188,0.00006725718,0.00028649758,0.000004545201,0.00002519511,0.000567167],"genre_scores_gemma":[0.21907344,0.000030167326,0.7806647,0.000055047316,0.00010235704,0.000010199558,0.0000035214962,0.000030396219,0.000030154379],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884874,0.00009232664,0.00043228368,0.00018655062,0.00031059305,0.0001294929],"domain_scores_gemma":[0.99902445,0.00032043,0.00034394313,0.000121705685,0.000094834395,0.00009462508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042148493,0.0001476078,0.00030418727,0.000097979115,0.000072254355,0.00007422269,0.000107912885,0.000076866854,0.0000611226],"category_scores_gemma":[0.00007519191,0.00008677593,0.0000353565,0.0002676135,0.00016137789,0.00020393191,0.000036538913,0.00023804171,7.866349e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047568427,0.0022365502,0.00044919393,0.001746372,0.0013188502,0.0001039012,0.011740935,0.23025787,0.047326118,0.35173365,0.0009794759,0.34735024],"study_design_scores_gemma":[0.0005253887,0.0008017337,0.000046410616,0.0002893134,0.00013478241,0.00006490633,0.00013776374,0.96969163,0.0023561283,0.025757639,0.000038614937,0.00015570148],"about_ca_topic_score_codex":0.0000011088486,"about_ca_topic_score_gemma":4.2377607e-8,"teacher_disagreement_score":0.73943377,"about_ca_system_score_codex":0.000030202102,"about_ca_system_score_gemma":0.00005061199,"threshold_uncertainty_score":0.353862},"labels":[],"label_agreement":null},{"id":"W4393616030","doi":"10.23952/jano.6.2024.2.01","title":"Primal and dual second-order necessary optimality conditions in bilevel programming","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Bilevel optimization; Dual (grammatical number); Order (exchange); Mathematical optimization; Computer science; Mathematics; Economics; Optimization problem; Philosophy","score_opus":0.009523742768348347,"score_gpt":0.2521858338886716,"score_spread":0.24266209112032325,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393616030","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0027916967,0.00020421753,0.994421,0.0015689991,0.000085991975,0.00008695865,0.00000325706,0.000029863515,0.00080798764],"genre_scores_gemma":[0.566609,0.00009098371,0.4329942,0.00020102985,0.000056932313,0.000005149446,0.000009676289,0.0000062468953,0.000026749198],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990411,0.000032028034,0.00040593787,0.00019889719,0.00020158057,0.000120473705],"domain_scores_gemma":[0.9994738,0.00010879572,0.00013566637,0.00006632105,0.000117288386,0.000098099255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031619842,0.0001012788,0.00019747217,0.00026781287,0.00007690483,0.00029575074,0.000093544375,0.000059329082,0.00008889361],"category_scores_gemma":[0.000025696996,0.00008368586,0.000038039103,0.0007272045,0.000037080994,0.0006439829,0.000061460225,0.00016886824,0.0000013369277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000404381,0.00018046568,0.00047994487,0.00006369685,0.00009265288,0.000029346418,0.0008041541,0.84806836,0.00014929177,0.12836899,0.00019057828,0.021532105],"study_design_scores_gemma":[0.00034259312,0.000058358564,0.001789973,0.000023390208,0.000023999279,0.000056549336,0.000044434513,0.9942526,0.000027506856,0.0025179505,0.0007516451,0.000110977846],"about_ca_topic_score_codex":0.0000026285747,"about_ca_topic_score_gemma":3.960302e-7,"teacher_disagreement_score":0.5638174,"about_ca_system_score_codex":0.0000303117,"about_ca_system_score_gemma":0.00009297082,"threshold_uncertainty_score":0.34126106},"labels":[],"label_agreement":null},{"id":"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015458734,0.00091890915,0.9962783,0.0012603755,0.00020174946,0.00015025215,0.0000018233814,0.000062418156,0.00097158446],"genre_scores_gemma":[0.040865872,0.0017632487,0.95689255,0.00022293818,0.00013613536,0.0000062372637,0.000008385946,0.000021034133,0.000083568455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862325,0.000059458904,0.00047037343,0.00026335786,0.00039598328,0.00018757964],"domain_scores_gemma":[0.9991757,0.00012471805,0.0001593288,0.00013877459,0.00019209494,0.00020937836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046228082,0.00014313866,0.0002590847,0.00033926452,0.00010428153,0.0005160947,0.00021532817,0.00007700858,0.00007050312],"category_scores_gemma":[0.00004978553,0.00011493796,0.000047207894,0.0006679308,0.00004669589,0.0004949336,0.000106896725,0.00018971061,0.0000027784283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036565634,0.000034178556,0.000005477307,0.00003194076,0.00004874649,0.000015173951,0.0001953495,0.93902725,0.00022342466,0.018912064,0.00034217266,0.041127667],"study_design_scores_gemma":[0.00052680104,0.0000999048,0.000025284431,0.000025045973,0.000026579253,0.00009349643,0.000015141854,0.9969933,0.00013221503,0.0007056609,0.00123474,0.000121850586],"about_ca_topic_score_codex":0.0000024553563,"about_ca_topic_score_gemma":3.3500562e-8,"teacher_disagreement_score":0.05796604,"about_ca_system_score_codex":0.000038870974,"about_ca_system_score_gemma":0.00007585538,"threshold_uncertainty_score":0.49767128},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004851603,0.000072850984,0.99382246,0.0008559003,0.000074835494,0.000057222827,0.000008369782,0.00002040012,0.00023638931],"genre_scores_gemma":[0.8611565,0.00002088212,0.13861851,0.0001295868,0.000052432948,0.0000014688579,0.0000068701556,0.000004302509,0.000009404147],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991398,0.000053266638,0.00035938952,0.00013566417,0.00022787202,0.000083998144],"domain_scores_gemma":[0.999245,0.00022151587,0.0001880687,0.00009267197,0.0001719441,0.00008081939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047349362,0.00007960459,0.00025478116,0.00030885747,0.000053365955,0.00015596849,0.00009133348,0.00004431598,0.000019611207],"category_scores_gemma":[0.000014345512,0.000063446096,0.00009647189,0.0006033611,0.0000077196155,0.0004167054,0.00002447067,0.00010274488,3.1628323e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025065414,0.000043757922,0.0000037107072,0.000006154763,0.00023868683,0.0000023220018,0.00035841216,0.6201446,0.00053791545,0.37606925,0.0000054679813,0.0025646754],"study_design_scores_gemma":[0.00018805596,0.00012629834,0.00047278486,0.000009975066,0.00025498465,0.000010458643,0.00006023965,0.9956181,0.00010679323,0.0030085538,0.00007158679,0.000072188355],"about_ca_topic_score_codex":0.000007940504,"about_ca_topic_score_gemma":9.4964264e-7,"teacher_disagreement_score":0.85630494,"about_ca_system_score_codex":0.00002436117,"about_ca_system_score_gemma":0.00008134858,"threshold_uncertainty_score":0.25872567},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0013926781,0.000054926953,0.9978449,0.00037180987,0.00006854485,0.000110451125,2.4248968e-7,0.00006249777,0.00009395613],"genre_scores_gemma":[0.36333528,0.000013672756,0.636477,0.00002791486,0.00011256813,0.0000074298323,0.0000025153877,0.000008650566,0.000014966828],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941665,0.000022342465,0.00016761904,0.0001386971,0.0001428034,0.00011189866],"domain_scores_gemma":[0.99952054,0.00019725766,0.000107185595,0.000032481654,0.00008341654,0.00005913438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018859061,0.00007961143,0.00013441814,0.00009811608,0.00012634075,0.00023862915,0.00007724841,0.000031119514,0.0000045033603],"category_scores_gemma":[0.000038682796,0.000055736215,0.000033119813,0.00031761944,0.000012474318,0.00026445827,0.000013738463,0.00021029572,3.8634442e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074637974,0.000025216372,0.00004277782,0.000035104833,0.00003395923,0.0000012266912,0.0007158167,0.625298,0.000104604886,0.0036605168,0.000012026297,0.36999607],"study_design_scores_gemma":[0.0003104484,0.00057759683,0.000032470438,0.000036598856,0.000021838205,0.00003496995,0.000074637814,0.9954226,0.00017016681,0.000519238,0.002720601,0.000078824],"about_ca_topic_score_codex":0.00000418503,"about_ca_topic_score_gemma":1.2341316e-7,"teacher_disagreement_score":0.37012458,"about_ca_system_score_codex":0.000023609311,"about_ca_system_score_gemma":0.000051170387,"threshold_uncertainty_score":0.23011063},"labels":[],"label_agreement":null},{"id":"W4400959697","doi":"10.23952/jano.6.2024.3.09","title":"A self-adaptive algorithm with multi-step inertia for solving convex bilevel optimization problems","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Tianjin Municipal Education Commission","keywords":"Bilevel optimization; Inertia; Mathematical optimization; Computer science; Regular polygon; Algorithm; Convex optimization; Mathematics; Optimization problem; Physics","score_opus":0.012680389766965283,"score_gpt":0.22778450855343294,"score_spread":0.21510411878646765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400959697","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000058572514,0.0001972966,0.9984395,0.00068301347,0.00012967705,0.00029958508,0.000005116151,0.00009488057,0.00014506889],"genre_scores_gemma":[0.020382423,0.00016669139,0.9790352,0.000196929,0.00011540909,0.000026134949,0.000016799544,0.000022106104,0.000038322243],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986808,0.000023641836,0.00050231605,0.00030046792,0.00031473575,0.00017804014],"domain_scores_gemma":[0.99879795,0.0001518785,0.00032671966,0.00010578044,0.0004835112,0.00013417067],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003165496,0.00018116178,0.0003043887,0.00029904896,0.0001485837,0.0003648517,0.00019906997,0.00008544144,0.000017490793],"category_scores_gemma":[0.00002149058,0.00013172699,0.00008528442,0.00075245544,0.00002607338,0.000747838,0.000047014222,0.00014416839,0.0000014365147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003846025,0.000107807224,0.0000051885736,0.000032487467,0.00016197193,0.0000027504952,0.0004647091,0.97613925,0.000019498246,0.008876585,0.00006982494,0.014081448],"study_design_scores_gemma":[0.0009129042,0.00026434826,0.00001435902,0.00005064783,0.00011461431,0.000033792014,0.00004607686,0.99757963,0.000048191967,0.00023262684,0.00051633775,0.00018645948],"about_ca_topic_score_codex":0.0000027490842,"about_ca_topic_score_gemma":2.2707908e-7,"teacher_disagreement_score":0.021440374,"about_ca_system_score_codex":0.000069440546,"about_ca_system_score_gemma":0.00015712665,"threshold_uncertainty_score":0.53716713},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009607514,0.00021101676,0.99620044,0.00024171814,0.00015649738,0.00021163371,0.0000014884556,0.000051391733,0.0019650378],"genre_scores_gemma":[0.24316889,0.000012574493,0.756498,0.00013970045,0.00013739454,0.0000077627055,0.0000019767256,0.000015371304,0.00001834116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988132,0.000036598725,0.00038768744,0.00027479118,0.00026582854,0.00022189446],"domain_scores_gemma":[0.999195,0.0001924439,0.00017061114,0.0001320359,0.0001609795,0.00014894294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006490062,0.00016506611,0.00029880842,0.00018290356,0.00011587908,0.00039843412,0.00023272909,0.0000632225,0.0000055934674],"category_scores_gemma":[0.000026531861,0.000114663184,0.00009171325,0.00038172439,0.00007085792,0.0002470701,0.000048960213,0.00020076663,0.0000010414066],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003869466,0.00013941556,0.0000039620845,0.00014859968,0.000083352934,0.000061995954,0.00095182477,0.9104596,0.0073352,0.006397133,0.00013161315,0.07390038],"study_design_scores_gemma":[0.001063953,0.00027291945,0.000009062902,0.00004780786,0.0000497781,0.0002331421,0.000058528803,0.9947714,0.0027183224,0.00044562205,0.00016571196,0.00016370576],"about_ca_topic_score_codex":0.0000010233974,"about_ca_topic_score_gemma":8.816783e-9,"teacher_disagreement_score":0.24220814,"about_ca_system_score_codex":0.000040625666,"about_ca_system_score_gemma":0.00012394832,"threshold_uncertainty_score":0.46758288},"labels":[],"label_agreement":null},{"id":"W4400959818","doi":"10.23952/jano.6.2024.3.08","title":"On fixed point iterative methods for solving non-Lipschitz quasi-monotone variational inequalities","year":2024,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Lipschitz continuity; Monotone polygon; Variational inequality; Fixed point; Mathematics; Applied mathematics; Inequality; Fixed-point theorem; Iterative method; Point (geometry); Mathematical analysis; Mathematical optimization; Geometry","score_opus":0.015111775827970629,"score_gpt":0.3083736395106421,"score_spread":0.2932618636826715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400959818","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000040796294,0.00007959352,0.9959558,0.0028961548,0.00028295832,0.0001415758,0.000004824664,0.000032545322,0.00056570227],"genre_scores_gemma":[0.12300849,0.000047753096,0.87597996,0.00066901825,0.00017980601,0.000016962984,0.000018197547,0.000011589846,0.00006823869],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987722,0.000072119845,0.00054503063,0.00023233872,0.00024639405,0.00013190645],"domain_scores_gemma":[0.9981619,0.0010962579,0.00027312717,0.00009471565,0.00027626188,0.00009774383],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009669354,0.00014262497,0.00028599857,0.0003105756,0.0001504961,0.00039779322,0.00016974099,0.00006743147,0.000050010553],"category_scores_gemma":[0.00017763936,0.00011195835,0.00012363747,0.00045334615,0.00001879207,0.0005493455,0.00004285856,0.00014604654,0.0000024656663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006630477,0.00007313697,0.0000013945514,0.000018129149,0.00009403838,8.467253e-7,0.0009252942,0.5930985,0.00019052663,0.3960297,0.0002589919,0.00924307],"study_design_scores_gemma":[0.00040215533,0.00022110403,0.000028398932,0.000033764292,0.000042698874,0.000008090369,0.00004438711,0.96622413,0.00025842266,0.0320918,0.00051601423,0.00012901383],"about_ca_topic_score_codex":0.0000017712648,"about_ca_topic_score_gemma":5.259708e-8,"teacher_disagreement_score":0.3731256,"about_ca_system_score_codex":0.000058096226,"about_ca_system_score_gemma":0.000108821696,"threshold_uncertainty_score":0.4565529},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019884773,0.00050094235,0.99556357,0.0012018811,0.00031029072,0.00012461175,0.0000027407837,0.00016261154,0.00014487116],"genre_scores_gemma":[0.51335794,0.00011667738,0.48609716,0.00005007134,0.00028234517,0.000002778319,0.000012794237,0.00003631014,0.000043930857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99914515,0.000012757685,0.0003422954,0.00012573654,0.00021547764,0.00015858731],"domain_scores_gemma":[0.9993964,0.00016434776,0.000051235063,0.00008362431,0.000074810945,0.00022957256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016607523,0.00016040268,0.00025167508,0.00031720535,0.0000432304,0.00018584717,0.00008359721,0.000107031825,0.000019254667],"category_scores_gemma":[0.000027487455,0.0001399353,0.00007527281,0.0006476233,0.000012673602,0.00018531138,0.000014086089,0.00024152541,0.0000014333481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029588913,0.0000099704985,0.0000017575073,0.00005341667,0.00006931219,0.000005472166,0.00020659261,0.9831682,0.0017191622,0.00033863058,0.0005526186,0.013845318],"study_design_scores_gemma":[0.00037386108,0.000087609136,0.000024729165,0.000062659,0.00003925196,0.000010960075,0.00003577061,0.9945888,0.0006429511,0.00026584306,0.0037101682,0.00015740898],"about_ca_topic_score_codex":0.0000012509292,"about_ca_topic_score_gemma":1.4774982e-7,"teacher_disagreement_score":0.51136947,"about_ca_system_score_codex":0.000040948915,"about_ca_system_score_gemma":0.00002325186,"threshold_uncertainty_score":0.5706396},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010904646,0.0002652533,0.99771804,0.00018360515,0.00025687838,0.00015509091,0.0000016059087,0.00007484614,0.00025421556],"genre_scores_gemma":[0.24215484,0.00003414807,0.7574916,0.000016432496,0.00025816762,0.000003018489,0.000003814825,0.000029309487,0.00000868082],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993873,0.000008348927,0.00026831176,0.000102999904,0.00011124865,0.000121793375],"domain_scores_gemma":[0.9996363,0.00013094563,0.0000544056,0.00004826095,0.00006138935,0.0000687352],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019446596,0.00009648369,0.0001658176,0.00011927517,0.000036382633,0.000068197114,0.000039675062,0.000050665803,0.0000036501535],"category_scores_gemma":[0.00004202679,0.00008179419,0.000056535668,0.00015781737,0.000015636497,0.000108415465,0.000005379471,0.00014874041,0.0000011426956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047026733,0.000012094519,1.5448161e-7,0.00006227085,0.00003766906,0.0000022566924,0.00026226594,0.96620595,0.013262131,0.0010258341,0.0001092616,0.018973064],"study_design_scores_gemma":[0.00022261737,0.000074739626,0.000007676275,0.000043503656,0.00006122013,0.00005969385,0.000054152537,0.99606127,0.0025178036,0.00037316215,0.00043540954,0.00008878055],"about_ca_topic_score_codex":2.539467e-7,"about_ca_topic_score_gemma":1.6856243e-8,"teacher_disagreement_score":0.24106438,"about_ca_system_score_codex":0.000074045405,"about_ca_system_score_gemma":0.00002059942,"threshold_uncertainty_score":0.33354703},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015566508,0.00055284245,0.99648273,0.00011075039,0.00016323807,0.000093960836,0.0000014475305,0.0002860899,0.0021532525],"genre_scores_gemma":[0.5649203,0.00064976723,0.43408456,0.00006162084,0.0001934641,0.000011716614,0.000021341684,0.000040535986,0.00001670138],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910057,0.000011743576,0.00043910797,0.00012612766,0.00019659712,0.00012583671],"domain_scores_gemma":[0.99960774,0.000053769327,0.00009038044,0.00007676061,0.00007861811,0.00009273303],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012131316,0.00014135838,0.00023384782,0.00024042506,0.000057868016,0.00008323012,0.00006419421,0.00008636201,0.00009314352],"category_scores_gemma":[0.000013449142,0.00011951996,0.00007576341,0.00056001334,0.000028895593,0.00040209264,0.000014016521,0.00021836504,0.0000046338514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025255262,0.00002041602,0.000002390804,0.000037393038,0.000060870057,0.000001858908,0.00004903235,0.96869415,0.000787686,0.0009906715,0.0002857606,0.02904453],"study_design_scores_gemma":[0.00011519838,0.00007214141,0.0000107997585,0.000026727543,0.00010472272,0.000020077403,0.000020774965,0.99453706,0.0005782732,0.0025044044,0.0018785035,0.00013133013],"about_ca_topic_score_codex":4.8150355e-7,"about_ca_topic_score_gemma":2.807063e-8,"teacher_disagreement_score":0.5647646,"about_ca_system_score_codex":0.00006936891,"about_ca_system_score_gemma":0.000011102355,"threshold_uncertainty_score":0.48738825},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0068828342,0.00032669253,0.99209595,0.000033102,0.0002619079,0.00008423596,0.0000020376344,0.000075822165,0.00023741068],"genre_scores_gemma":[0.37413943,0.000360464,0.62539536,0.000012510055,0.000059821556,0.00000528929,0.000005155291,0.000018117473,0.000003877931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934083,0.000029977564,0.00031635823,0.0000957772,0.00010620702,0.00011081913],"domain_scores_gemma":[0.99979365,0.000058474092,0.000050756124,0.000042909956,0.0000131414,0.00004109897],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025960786,0.000100715355,0.00016738901,0.00023294962,0.000026118394,0.000041495845,0.000038412418,0.00008049885,0.00005260674],"category_scores_gemma":[0.000012275765,0.00009238223,0.000037754184,0.00017575975,0.000017646818,0.00011455597,0.000010810187,0.00023578804,0.0000037860477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017110282,0.000009308728,0.00000237523,0.000023836466,0.000015085122,0.0000057887323,0.00009702818,0.83065146,0.012557976,0.000017240533,0.000005762145,0.15659705],"study_design_scores_gemma":[0.0001993201,0.000059749476,0.00037610676,0.000011433796,0.000013041443,0.00004042238,0.00006327869,0.99193305,0.0054352637,0.00122428,0.0005517391,0.000092311355],"about_ca_topic_score_codex":6.921495e-7,"about_ca_topic_score_gemma":8.732999e-8,"teacher_disagreement_score":0.36725658,"about_ca_system_score_codex":0.00015017613,"about_ca_system_score_gemma":0.0000053832264,"threshold_uncertainty_score":0.3767238},"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":"methods","genre_gemma":"editorial","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"editorial","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[3.23026e-8,0.000113561386,0.62500346,0.00023356013,0.3733619,0.00021642256,0.000015773412,0.00006111918,0.0009941902],"genre_scores_gemma":[0.0000031042468,0.0011624522,0.27165282,0.00007656484,0.72693664,0.000032504922,0.000057693847,0.000027641272,0.00005058584],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9976952,0.000061288505,0.0007107243,0.00043927258,0.0009186989,0.00017481246],"domain_scores_gemma":[0.9980512,0.00039532557,0.0006185056,0.0002476347,0.00047043385,0.0002168719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005742829,0.00029908758,0.00047369464,0.00030963004,0.000123986,0.0005649016,0.000416368,0.00048744184,0.00001811504],"category_scores_gemma":[0.00011602366,0.00023264618,0.000073126575,0.00033048532,0.00009713791,0.0006263971,0.00015409199,0.0009500047,0.000008826119],"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.00004310588,0.000057765872,5.8402465e-9,0.000049779235,0.000027200309,0.0000024712697,0.00023854742,0.0018796091,0.000051392803,0.0007920892,0.929296,0.067562014],"study_design_scores_gemma":[0.00040173938,0.00030873483,6.330917e-8,0.000094069466,0.0000466797,0.000005432136,0.000037005644,0.1107948,0.0003322876,0.010935038,0.87678033,0.00026383466],"about_ca_topic_score_codex":0.0000030205133,"about_ca_topic_score_gemma":9.671073e-8,"teacher_disagreement_score":0.35357475,"about_ca_system_score_codex":0.00012314184,"about_ca_system_score_gemma":0.00021740186,"threshold_uncertainty_score":0.9487036},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00015701393,0.0000358683,0.99878776,0.00041271324,0.0001663792,0.00022264573,6.399683e-7,0.00003471926,0.00018225216],"genre_scores_gemma":[0.0060551753,0.00006048793,0.99360114,0.00018723962,0.000060816394,0.000014165414,0.0000023064147,0.0000037978093,0.000014858871],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929523,0.000019384024,0.00033025595,0.00013957689,0.00012508979,0.00009046076],"domain_scores_gemma":[0.99936646,0.00008895388,0.0002553668,0.000058424284,0.00016548642,0.00006529866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000300792,0.00007282008,0.00015359418,0.00012875986,0.00008138793,0.00014638466,0.000080108075,0.000057117755,0.000004860923],"category_scores_gemma":[0.000044296878,0.000063246815,0.000027484839,0.00019353395,0.000044881483,0.0004565382,0.000037418187,0.00009175992,1.510033e-7],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017715967,0.000030230027,0.0000060644547,0.00001759546,0.00001576369,6.835881e-7,0.00013196998,0.00041115226,0.0019257597,0.0013635615,0.000077615994,0.9960019],"study_design_scores_gemma":[0.0009061611,0.00018931471,0.00020410876,0.000037290793,0.000030199093,0.000058211048,0.00006545738,0.9867106,0.007530106,0.0040860935,0.00008759584,0.00009486864],"about_ca_topic_score_codex":0.0000013037659,"about_ca_topic_score_gemma":1.5004137e-8,"teacher_disagreement_score":0.995907,"about_ca_system_score_codex":0.000030378851,"about_ca_system_score_gemma":0.00004296532,"threshold_uncertainty_score":0.25791302},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0003565121,0.00017618698,0.9903155,0.00014625162,0.00005681758,0.00016773533,0.000016387408,0.00007066739,0.008693966],"genre_scores_gemma":[0.42533597,0.00023379004,0.57384926,0.0002788114,0.000059761824,0.00001299614,0.00003179783,0.00004048259,0.000157116],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99911684,0.000015010763,0.00037990953,0.0001236016,0.0001615344,0.00020310734],"domain_scores_gemma":[0.99954647,0.0000422037,0.00013945899,0.00007055412,0.000099294666,0.00010204046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016076902,0.00015749974,0.0002734753,0.00013028322,0.00009336428,0.00010660198,0.00007429523,0.000066704444,0.0000765337],"category_scores_gemma":[0.0000053873396,0.0001284291,0.000038152593,0.00030519164,0.000043948796,0.00013777775,0.000018005592,0.0002142181,8.603085e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004927699,0.00005347532,0.00004770432,0.000057805682,0.00006108135,0.0000024835276,0.00033874591,0.9834644,0.00022467539,0.00065734907,0.00078428123,0.01425869],"study_design_scores_gemma":[0.0015948288,0.00008141086,0.0000105209265,0.00008789885,0.000040486502,0.000016175105,0.0003629315,0.98937577,0.00030945725,0.000121026686,0.007839382,0.00016011781],"about_ca_topic_score_codex":0.0000020480984,"about_ca_topic_score_gemma":7.526742e-7,"teacher_disagreement_score":0.42497945,"about_ca_system_score_codex":0.00004028722,"about_ca_system_score_gemma":0.000040532108,"threshold_uncertainty_score":0.5237187},"labels":[],"label_agreement":null},{"id":"W4408578012","doi":"10.23952/jano.7.2025.1.04","title":"Explicit iterative methods for the split feasibility problem with multiple output sets","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Iterative method; Computer science; Mathematical optimization; Algorithm; Mathematics","score_opus":0.019025794215610275,"score_gpt":0.3115094066775586,"score_spread":0.2924836124619483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408578012","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00005423023,0.00007614957,0.99521035,0.0036486802,0.00005201167,0.00031241224,0.0000015520982,0.000014493848,0.0006301089],"genre_scores_gemma":[0.08095559,0.000033712644,0.91826683,0.00059860793,0.000025286825,0.000022878461,0.0000033854242,0.0000042603842,0.00008946585],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991446,0.00006247073,0.00035656593,0.00018500643,0.00014671682,0.00010460927],"domain_scores_gemma":[0.9984526,0.000647036,0.00030648365,0.00014375229,0.00039418347,0.000055940323],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058157544,0.00010517593,0.00022327462,0.000103718034,0.00020847225,0.0001794595,0.00023544487,0.000041498413,0.0000065751333],"category_scores_gemma":[0.00008078748,0.000059755028,0.000068595386,0.0005174965,0.000025608917,0.00026401077,0.00005275547,0.00010095525,2.477464e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019566694,0.00008983031,0.00022793972,0.000013094348,0.00012083581,1.9503238e-7,0.00040095468,0.90977854,0.000030233157,0.061117362,0.00017531187,0.027850058],"study_design_scores_gemma":[0.0008064357,0.000092243914,0.0008404523,0.000011705925,0.000066096116,0.000003270918,0.000057555586,0.99229795,0.00012024242,0.004375839,0.0012539246,0.000074314084],"about_ca_topic_score_codex":0.0000019233833,"about_ca_topic_score_gemma":2.6525112e-7,"teacher_disagreement_score":0.082519405,"about_ca_system_score_codex":0.000037737187,"about_ca_system_score_gemma":0.00007905841,"threshold_uncertainty_score":0.24367394},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.39611217,0.0060004,0.53632903,0.00736025,0.0015873045,0.0011409459,0.000071560775,0.00006337158,0.05133498],"genre_scores_gemma":[0.99202347,0.000039342056,0.007270112,0.0003491276,0.00025278918,0.0000022162944,0.000009213177,0.0000086084565,0.000045116758],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920785,0.000024992029,0.00033521667,0.00012621553,0.0001706202,0.00013512983],"domain_scores_gemma":[0.99935657,0.000080630445,0.0003079951,0.00010940815,0.00008633952,0.00005908398],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000114169925,0.00012885378,0.00024852567,0.000063725965,0.00016425618,0.00014481237,0.00016310727,0.000044706736,0.00051244855],"category_scores_gemma":[0.0000073604747,0.00007789814,0.00007284873,0.00016447455,0.000030933043,0.00011989011,0.000047337435,0.00021502085,5.534275e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008370541,0.00023370211,0.011832482,0.0001901125,0.0013983735,0.000005206351,0.0027853912,0.5441292,0.018462196,0.2343147,0.031903688,0.15390792],"study_design_scores_gemma":[0.008143787,0.00055752404,0.0099994885,0.0008666342,0.0020246252,0.000055452558,0.007379756,0.38262185,0.03260877,0.35093287,0.20290755,0.0019016945],"about_ca_topic_score_codex":0.000012182694,"about_ca_topic_score_gemma":1.4299137e-7,"teacher_disagreement_score":0.59591126,"about_ca_system_score_codex":0.000016582393,"about_ca_system_score_gemma":0.00004016454,"threshold_uncertainty_score":0.56109524},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00493239,0.0000374523,0.9940124,0.00033630495,0.000098553406,0.00010974435,8.512231e-7,0.000025128464,0.00044713455],"genre_scores_gemma":[0.80806106,0.0001030776,0.19147253,0.0002688678,0.00003317101,0.0000064423243,0.0000030558838,0.0000041316525,0.00004764112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926,0.000018652141,0.00030320778,0.00016612258,0.00014234029,0.00010969233],"domain_scores_gemma":[0.99940157,0.00004225813,0.00020427688,0.000091038164,0.0001812528,0.000079603495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019054355,0.000089399466,0.0001909817,0.00017761406,0.00013645746,0.000101156744,0.000112060094,0.000067605004,0.0000042206143],"category_scores_gemma":[0.000021413747,0.00007591702,0.00006996488,0.0003486744,0.0000137836805,0.000296758,0.00002932534,0.00008976974,6.74665e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007783328,0.00005465104,7.9032753e-7,0.000010561541,0.000022365684,1.7147994e-7,0.00016579646,0.79541963,0.016497826,0.0011273042,0.000025702257,0.18659739],"study_design_scores_gemma":[0.00060257793,0.00008959552,0.000012109801,0.000013383853,0.000034926525,0.0000029713315,0.000038922324,0.97783184,0.016323665,0.004915385,0.000053249118,0.00008134482],"about_ca_topic_score_codex":4.5368844e-7,"about_ca_topic_score_gemma":4.213567e-7,"teacher_disagreement_score":0.80312866,"about_ca_system_score_codex":0.000026690415,"about_ca_system_score_gemma":0.00003842392,"threshold_uncertainty_score":0.30958062},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0026786611,0.00004295147,0.9961159,0.00070941943,0.0001334101,0.00017469148,0.00001425185,0.0000021169096,0.00012859252],"genre_scores_gemma":[0.7391355,0.0000069286484,0.26055926,0.00019137605,0.00005423421,0.000010055655,0.0000028585243,0.0000033066935,0.000036484165],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990176,0.00007256379,0.0005102957,0.00008670261,0.0002314321,0.00008143515],"domain_scores_gemma":[0.99856466,0.0007164182,0.00041579164,0.00009127269,0.00019740695,0.000014439581],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00078730914,0.00007130683,0.00020285226,0.00010550657,0.00006276982,0.00004959586,0.00024109994,0.000044017503,0.000005229033],"category_scores_gemma":[0.00009532208,0.000044284116,0.000060163427,0.0002963199,0.000014995394,0.0001388633,0.000051988485,0.00010353134,2.8329794e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010208645,0.00024368102,0.00004283302,0.00008999665,0.000047137066,2.6721918e-7,0.002457032,0.107040375,0.00043513227,0.8828684,0.000037039543,0.0066359886],"study_design_scores_gemma":[0.00058708264,0.0001562248,0.00033243367,0.000047240585,0.000016494301,0.0000035908931,0.00027814234,0.97574645,0.0006058649,0.022001248,0.00018057117,0.000044635166],"about_ca_topic_score_codex":0.0000059537997,"about_ca_topic_score_gemma":0.0000016448865,"teacher_disagreement_score":0.8687061,"about_ca_system_score_codex":0.000022631086,"about_ca_system_score_gemma":0.00017301032,"threshold_uncertainty_score":0.18058538},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0021421849,0.00010758749,0.9963485,0.00011079424,0.0002015714,0.00015709158,0.0000036051222,0.00004101607,0.00088761916],"genre_scores_gemma":[0.3584069,0.000039026047,0.6414308,0.0000464941,0.000046447796,0.0000035934631,0.000002475831,0.000017332699,0.000006963626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985259,0.000075046126,0.00078531203,0.00014502909,0.0003074478,0.0001612553],"domain_scores_gemma":[0.99808466,0.0012187277,0.0003322728,0.00011698951,0.00016200158,0.00008533943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003242179,0.00017897853,0.00046819812,0.0002965377,0.00008623029,0.000023154933,0.000114268914,0.000109552915,0.000017713606],"category_scores_gemma":[0.00044751455,0.00016049985,0.000093313094,0.00063568034,0.00005089402,0.00013508223,0.000030688836,0.00027687408,9.0669164e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013018344,0.00010583438,0.000014898606,0.0000686546,0.000050900897,9.580515e-7,0.00009857426,0.9754489,0.0030017847,0.0075412677,0.000025388852,0.013512664],"study_design_scores_gemma":[0.00041339215,0.00012970307,0.00010899756,0.00011554562,0.00007277386,0.0000055222345,0.000045843342,0.97949994,0.0016185696,0.017722953,0.00013470172,0.00013205016],"about_ca_topic_score_codex":0.0000017414602,"about_ca_topic_score_gemma":1.578355e-8,"teacher_disagreement_score":0.3562647,"about_ca_system_score_codex":0.00011320257,"about_ca_system_score_gemma":0.000036466612,"threshold_uncertainty_score":0.6544994},"labels":[],"label_agreement":null},{"id":"W4408578410","doi":"10.23952/jano.7.2025.1.05","title":"Approximate weak and proper subdifferentials of the difference of two vector convex mappings and applications","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Regular polygon; Mathematics; Vector (molecular biology); Pure mathematics; Geometry; Biology","score_opus":0.006293103049162445,"score_gpt":0.2214991119194109,"score_spread":0.21520600887024846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408578410","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0034711782,0.00010954465,0.99476594,0.0007840262,0.000028660173,0.00015925705,0.00000207364,0.0000052348228,0.00067410443],"genre_scores_gemma":[0.930939,0.00020520082,0.06866925,0.000105181345,0.000015978381,0.000007413482,0.000001299006,0.0000030278666,0.000053604224],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992012,0.00003374102,0.0004027771,0.00013032295,0.00016699734,0.000064989035],"domain_scores_gemma":[0.99911606,0.00008017372,0.00044158654,0.00011375326,0.0002045386,0.000043861815],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015273245,0.00008132185,0.0002579552,0.00011405215,0.000079542624,0.000049517334,0.00017353277,0.000035655008,0.000006859786],"category_scores_gemma":[0.000021952068,0.000051778778,0.00003787846,0.0004224547,0.000090624264,0.0001026037,0.00011374423,0.00007323136,6.333082e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001089605,0.00034536206,0.0058162124,0.00025543652,0.00026530138,1.7905056e-7,0.0007434514,0.10618421,0.015125752,0.8473103,0.000052343654,0.023792498],"study_design_scores_gemma":[0.00097091385,0.00005180973,0.019195398,0.00005864548,0.00012702063,0.00000612743,0.00005107634,0.9659027,0.0036556206,0.009740039,0.00012803348,0.00011264694],"about_ca_topic_score_codex":0.00000464884,"about_ca_topic_score_gemma":1.7475628e-7,"teacher_disagreement_score":0.9274679,"about_ca_system_score_codex":0.000008729229,"about_ca_system_score_gemma":0.00004362316,"threshold_uncertainty_score":0.21114773},"labels":[],"label_agreement":null},{"id":"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008149925,0.0002633803,0.9892315,0.0016462682,0.00005976818,0.00011230317,9.0188244e-8,0.000019820533,0.0005169202],"genre_scores_gemma":[0.86055624,0.00031658958,0.13879265,0.00024677435,0.00005168294,0.000006659172,0.0000020382574,0.0000050816634,0.000022263412],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992067,0.00003883986,0.00036007684,0.00015005317,0.00013035157,0.000113969465],"domain_scores_gemma":[0.9993387,0.0002302058,0.00021262452,0.00008174571,0.00008854525,0.000048205235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018055945,0.000085496366,0.00018002928,0.00015966666,0.00010531149,0.00007800936,0.00014514753,0.00006661305,0.000004136901],"category_scores_gemma":[0.000049605947,0.00007227386,0.000031356823,0.00076973595,0.000022451837,0.0004759981,0.000048516926,0.00028071122,0.0000011858206],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027174216,0.00004487083,0.00077047653,0.0000045059396,0.000010352883,0.0000013485126,0.0002935739,0.8944923,0.00029268046,0.08445933,0.000010380229,0.019593002],"study_design_scores_gemma":[0.0006530157,0.000050221293,0.0053892904,0.000035650282,0.000010885825,0.0000027203646,0.000025907031,0.97930884,0.000110083514,0.014026112,0.0003048941,0.0000823883],"about_ca_topic_score_codex":0.0000022991383,"about_ca_topic_score_gemma":3.1157685e-7,"teacher_disagreement_score":0.8524063,"about_ca_system_score_codex":0.0000328018,"about_ca_system_score_gemma":0.00003266473,"threshold_uncertainty_score":0.29472426},"labels":[],"label_agreement":null},{"id":"W4412767575","doi":"10.23952/jano.7.2025.2.08","title":"An inertial extragradient algorithm with non-monotone step sizes for variational inequality problems and fixed point problems of nonexpansive semigroups","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Strong","keywords":"Variational inequality; Monotone polygon; Fixed point; Inertial frame of reference; Mathematics; Applied mathematics; Algorithm; Mathematical optimization; Mathematical analysis; Physics; Geometry","score_opus":0.006690705911487792,"score_gpt":0.22845132810469052,"score_spread":0.22176062219320272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767575","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0019059816,0.00004071331,0.99675936,0.00079184904,0.00004975778,0.00034422643,0.000009476449,0.000012497953,0.00008614243],"genre_scores_gemma":[0.376604,0.000055320263,0.623082,0.00016053276,0.00003982904,0.000021913744,0.000023027478,0.0000057781717,0.000007639185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986716,0.000043939162,0.0006321437,0.00024588435,0.00027872808,0.00012769476],"domain_scores_gemma":[0.9984008,0.00015863874,0.0005999085,0.00012232561,0.0006120241,0.00010628596],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043794792,0.00014427752,0.00036791785,0.00021454645,0.0001138559,0.000101731675,0.00016638225,0.00007110266,0.0000058151472],"category_scores_gemma":[0.000030439925,0.000108368564,0.000052459956,0.00050681183,0.00004631328,0.00045940027,0.00004334759,0.000097599506,6.679576e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001747399,0.000329995,0.0002070585,0.000061955725,0.00014747443,4.3473e-7,0.00082628237,0.9693887,0.00084354053,0.020445783,0.000025184689,0.0075488016],"study_design_scores_gemma":[0.0017061984,0.00047142545,0.0015856555,0.000045215264,0.00008320073,0.000006311092,0.00007256519,0.9934934,0.00029329918,0.0020697128,0.000046640045,0.00012638362],"about_ca_topic_score_codex":0.000016788485,"about_ca_topic_score_gemma":0.0000013499591,"teacher_disagreement_score":0.374698,"about_ca_system_score_codex":0.00003288992,"about_ca_system_score_gemma":0.00010900991,"threshold_uncertainty_score":0.44191417},"labels":[],"label_agreement":null},{"id":"W4412767577","doi":"10.23952/jano.7.2025.2.03","title":"Strong convergence of an inertial Tseng’s extragradient algorithm for pseudomonotone variational inequalities with applications to optimal control problems","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Centre Scientifique et Technique du Bâtiment; Fundamental Research Funds for the Central Universities; Natural Science Foundation of Chongqing","keywords":"Variational inequality; Inertial frame of reference; Convergence (economics); Algorithm; Mathematics; Applied mathematics; Computer science; Physics; Economics","score_opus":0.00856190637897728,"score_gpt":0.24556300266634484,"score_spread":0.23700109628736757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767577","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0002755285,0.000022872175,0.99823034,0.0008096833,0.00005577051,0.00046573766,0.000019012614,0.000015808044,0.000105254294],"genre_scores_gemma":[0.24876626,0.000013042562,0.7508178,0.00021425444,0.000059355494,0.00008210836,0.000018977351,0.0000056241315,0.000022618597],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871975,0.00004181622,0.0006043347,0.00021765547,0.0002820777,0.00013433711],"domain_scores_gemma":[0.9984837,0.0001597541,0.0004363177,0.00013214721,0.0006623241,0.00012573325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038862356,0.00012658088,0.00031297057,0.00026979286,0.0001184954,0.00008001816,0.00024988528,0.00005224656,0.000012009459],"category_scores_gemma":[0.000023769584,0.00010221359,0.000057673322,0.0005914856,0.000035372494,0.0003519871,0.000031830055,0.000076240365,2.6001197e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000111296715,0.00017066527,0.000023098377,0.000013537461,0.00009087938,1.6581997e-7,0.00026162426,0.8597333,0.00016999197,0.13068517,0.000015871825,0.008724398],"study_design_scores_gemma":[0.0013542778,0.00030904385,0.0001993497,0.000015135753,0.00007607665,0.0000043391306,0.000086969114,0.99635893,0.00023664434,0.0009775053,0.00026884108,0.00011289278],"about_ca_topic_score_codex":0.000006785075,"about_ca_topic_score_gemma":4.953826e-7,"teacher_disagreement_score":0.24849072,"about_ca_system_score_codex":0.000041533585,"about_ca_system_score_gemma":0.00017235639,"threshold_uncertainty_score":0.41681492},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0006827357,0.00009720433,0.9971427,0.00020962073,0.0002974672,0.0006740446,0.0000032766034,0.000041624215,0.0008513283],"genre_scores_gemma":[0.06946047,0.000037817674,0.9300037,0.0002586542,0.00013043272,0.000014385393,0.000016355953,0.000037884136,0.000040306866],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946579,0.0006674319,0.0021363427,0.0007662599,0.0013869018,0.0003851885],"domain_scores_gemma":[0.99518585,0.0009049462,0.0017767269,0.00041419567,0.0014436347,0.00027462016],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0039413404,0.00038239823,0.00088082784,0.0011787047,0.0005110556,0.0009105831,0.00056051806,0.0002635323,0.00013636731],"category_scores_gemma":[0.0011173715,0.00030377568,0.00016503825,0.0021026735,0.000092331495,0.0013839474,0.00018052671,0.00040233933,0.0000010751377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00046333662,0.00029542585,0.00008349037,0.00002082885,0.00005057526,0.000003596839,0.0009021316,0.9734428,0.00064829545,0.0004249028,0.00005432434,0.023610301],"study_design_scores_gemma":[0.0015004281,0.0001213966,0.0000641659,0.00008731792,0.00012562938,0.00005434199,0.001342441,0.99475986,0.00016535932,0.0014513299,0.000030651434,0.00029705543],"about_ca_topic_score_codex":0.000026720923,"about_ca_topic_score_gemma":7.226334e-7,"teacher_disagreement_score":0.06877773,"about_ca_system_score_codex":0.0003496994,"about_ca_system_score_gemma":0.00027577384,"threshold_uncertainty_score":0.9999414},"labels":[],"label_agreement":null},{"id":"W4412767601","doi":"10.23952/jano.7.2025.2.04","title":"Calculus rules of generalized proper $\\epsilon$-subdifferential for vector valued mappings and applications","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subderivative; Calculus (dental); Mathematics; Pure mathematics; Geometry; Medicine; Regular polygon; Orthodontics","score_opus":0.007807725067741243,"score_gpt":0.2367515569242589,"score_spread":0.22894383185651765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767601","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00076427567,0.00011174376,0.9974649,0.0010446913,0.000056251938,0.00023539521,0.0000043338014,0.000012002653,0.00030639747],"genre_scores_gemma":[0.23800606,0.00013427611,0.7613471,0.00028829562,0.000063750806,0.000036449645,0.000014857331,0.000006663358,0.000102526436],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913836,0.00002249227,0.00043445715,0.00015920785,0.0001562318,0.0000892518],"domain_scores_gemma":[0.9991314,0.00006516991,0.00033234537,0.000093725415,0.00031260602,0.00006476049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016596234,0.00009388806,0.00026950327,0.00019190073,0.00011632824,0.00007331503,0.00015716776,0.000055618548,0.0000110568135],"category_scores_gemma":[0.000027589847,0.000073379546,0.00006918553,0.00030136987,0.00005023119,0.00015349255,0.000054858607,0.00005750418,2.546494e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016173824,0.00017943734,0.000050009494,0.00007405188,0.00017380202,1.8158309e-7,0.00022793033,0.2164036,0.0016346036,0.7714983,0.00024953388,0.009346799],"study_design_scores_gemma":[0.0010862233,0.000058438625,0.00050807494,0.000013986445,0.00009840567,0.0000026405833,0.000017346038,0.99020517,0.0005649421,0.006295695,0.0010592316,0.00008986062],"about_ca_topic_score_codex":0.0000029248129,"about_ca_topic_score_gemma":7.7332906e-8,"teacher_disagreement_score":0.77380157,"about_ca_system_score_codex":0.000018317083,"about_ca_system_score_gemma":0.00006260946,"threshold_uncertainty_score":0.2992331},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001926918,0.0001453183,0.99614316,0.0008431022,0.0002636745,0.00022077201,7.613026e-7,0.000026634529,0.00042965738],"genre_scores_gemma":[0.3703229,0.000066964865,0.6289135,0.00040201252,0.00023018094,0.0000121540015,0.0000016951938,0.000008304168,0.00004224613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990053,0.000021558471,0.00045647324,0.00018028151,0.00017250246,0.00016387399],"domain_scores_gemma":[0.99923956,0.0001453644,0.00027218682,0.0001044716,0.00015878558,0.000079639336],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006291207,0.000114895134,0.00024466304,0.0001421576,0.0003663855,0.00013391972,0.00027827948,0.000068814195,0.0000044246935],"category_scores_gemma":[0.00006133217,0.00009122672,0.00006233256,0.00030618414,0.000022710143,0.0003216347,0.00033058383,0.00014037664,3.5891105e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002303342,0.00018120589,0.000023645991,0.00011576318,0.00006955347,0.0000055329924,0.0014104254,0.6672672,0.00994109,0.070636176,0.0002167136,0.24990235],"study_design_scores_gemma":[0.0008938387,0.00012717217,0.000013642584,0.000054671204,0.000015616275,0.000011141563,0.000028623563,0.98199266,0.0032517116,0.012216338,0.0012851794,0.000109402135],"about_ca_topic_score_codex":0.0000011208508,"about_ca_topic_score_gemma":2.9079102e-8,"teacher_disagreement_score":0.36839598,"about_ca_system_score_codex":0.000033326967,"about_ca_system_score_gemma":0.00006688036,"threshold_uncertainty_score":0.37201178},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000017158598,0.00012739298,0.9955806,0.00023774776,0.00025614948,0.0003105375,0.0000037239445,0.00008129965,0.0033853855],"genre_scores_gemma":[0.0628746,0.0002503341,0.936473,0.000109027904,0.0001247855,0.000046533074,0.00003893803,0.000029639164,0.000053132862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990827,0.000009906782,0.00047555784,0.00010506509,0.0001338218,0.00019296318],"domain_scores_gemma":[0.9994639,0.00008240694,0.000139872,0.000060994123,0.00017491936,0.0000778979],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002355306,0.00012566209,0.0002287676,0.00017066809,0.00015667944,0.00008868959,0.000068306486,0.00009978304,0.00004912717],"category_scores_gemma":[0.000048123176,0.000115357034,0.00006949838,0.00025839722,0.000035491747,0.00021463008,0.000020358384,0.00013606713,5.935415e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000039916846,0.000060830007,0.0000014181682,0.000120067554,0.00005728838,1.7178978e-7,0.000045871548,0.985398,0.00008033571,0.010979707,0.0004996502,0.0027167595],"study_design_scores_gemma":[0.00071533525,0.000037209273,0.0000016694737,0.000039560357,0.00007507449,0.0000065099994,0.000049452017,0.99581456,0.00007154107,0.0018961714,0.0011844862,0.000108419576],"about_ca_topic_score_codex":2.6976073e-7,"about_ca_topic_score_gemma":5.1476988e-8,"teacher_disagreement_score":0.06285744,"about_ca_system_score_codex":0.000057896395,"about_ca_system_score_gemma":0.0000329124,"threshold_uncertainty_score":0.47041234},"labels":[],"label_agreement":null},{"id":"W4412767620","doi":"10.23952/jano.7.2025.2.06","title":"On approximate efficient solutions of nonsmooth minimax programming problems involving inequality and equality constraints with applications","year":2025,"lang":"en","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Minimax; Inequality; Mathematical optimization; Mathematics; Mathematical economics; Applied mathematics; Mathematical analysis","score_opus":0.013837618799269535,"score_gpt":0.2451002029475536,"score_spread":0.23126258414828407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412767620","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0010264782,0.00006518715,0.9972077,0.00068387244,0.000017509794,0.00026211565,0.0000031900724,0.000018603776,0.00071531796],"genre_scores_gemma":[0.6548767,0.00003011137,0.34492403,0.00013125947,0.000008465624,0.000017219325,0.000004689052,0.0000033350836,0.000004181436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99881935,0.000052953565,0.00053397974,0.00020545472,0.0002574383,0.00013081655],"domain_scores_gemma":[0.9987712,0.00017922437,0.00051906874,0.00013758757,0.00030950623,0.000083442246],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005576031,0.00011245165,0.00027114147,0.0002182997,0.00017572167,0.000091777576,0.00014718296,0.000050491006,0.0000051380794],"category_scores_gemma":[0.00004211021,0.00008553367,0.000040460396,0.000738441,0.00013037233,0.00012818904,0.00007056033,0.000117940544,1.808733e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003689411,0.00024055081,0.00014618924,0.000052641324,0.00005232608,1.7217221e-7,0.00021209885,0.594978,0.00007313147,0.39499256,0.000005894654,0.009209536],"study_design_scores_gemma":[0.0007317074,0.00012071573,0.00046508072,0.00007022297,0.00006426406,0.0000050750546,0.000105391075,0.9944244,0.00008240262,0.0037235168,0.000094349045,0.00011289829],"about_ca_topic_score_codex":0.0000047768,"about_ca_topic_score_gemma":4.214501e-7,"teacher_disagreement_score":0.6538502,"about_ca_system_score_codex":0.000041954296,"about_ca_system_score_gemma":0.00010377049,"threshold_uncertainty_score":0.34879616},"labels":[],"label_agreement":null},{"id":"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.048312843,0.0009363078,0.94954383,0.000082454586,0.00011144553,0.0008219372,0.000028398343,0.000008471987,0.00015432271],"genre_scores_gemma":[0.79721725,0.0014260007,0.20119515,0.000030034505,0.00002155948,0.000016135044,0.000011885857,0.00002494998,0.000057010533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966411,0.0001350151,0.0016273924,0.00036746185,0.000855428,0.0003736059],"domain_scores_gemma":[0.9949862,0.0012874497,0.0019704807,0.00028684075,0.0013104343,0.0001586406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012516467,0.00031087804,0.0012143422,0.0011321005,0.00042335992,0.00014516922,0.00023819391,0.00023117069,0.000025670495],"category_scores_gemma":[0.00056069734,0.00022824614,0.00029864543,0.00597052,0.0005577658,0.00033822883,0.0001672369,0.00048756812,2.018137e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014229935,0.0006144948,0.00025213993,0.00024842,0.0020142088,0.0000016000989,0.0017293177,0.9609475,0.00007105659,0.0010194498,0.0000064322917,0.031672385],"study_design_scores_gemma":[0.0020841903,0.00043631738,0.0003180978,0.0001481469,0.0027576424,0.00000431783,0.0020886522,0.98858315,0.0012750436,0.0021088787,0.000020091598,0.00017548443],"about_ca_topic_score_codex":0.000015403088,"about_ca_topic_score_gemma":0.0000013403,"teacher_disagreement_score":0.7489044,"about_ca_system_score_codex":0.00012045087,"about_ca_system_score_gemma":0.00014728153,"threshold_uncertainty_score":0.93076074},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000008952535,0.0006593351,0.9949587,0.00080902263,0.0013698519,0.0013554299,0.00003094205,0.00006085891,0.00074689573],"genre_scores_gemma":[0.011995051,0.001259249,0.98542285,0.0006585077,0.0003760665,0.000061855935,0.000046501587,0.000049809067,0.00013012675],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964743,0.00013727973,0.0016501626,0.0007540391,0.0004966397,0.000487532],"domain_scores_gemma":[0.99476284,0.00054009806,0.0017659861,0.00031351479,0.0023307856,0.0002867815],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006687578,0.00053323,0.000942301,0.00087174925,0.0005710498,0.0004264849,0.00047709406,0.0003675953,0.000031629774],"category_scores_gemma":[0.00024625633,0.00053355255,0.00026763434,0.0016029753,0.00018001374,0.0013149913,0.00020487118,0.00048135684,0.0000015490666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039066546,0.00042164003,0.000002346114,0.00004343122,0.00016783974,0.0000034377267,0.00037549585,0.73053235,0.0000671561,0.0018586027,0.000060089373,0.26607692],"study_design_scores_gemma":[0.005581596,0.00079768285,0.00002773939,0.00019999049,0.00027483926,0.000044184486,0.00017512988,0.98916066,0.0013426081,0.0016351417,0.00030152933,0.00045892718],"about_ca_topic_score_codex":0.0000031383768,"about_ca_topic_score_gemma":1.3982138e-7,"teacher_disagreement_score":0.265618,"about_ca_system_score_codex":0.00043169683,"about_ca_system_score_gemma":0.000423758,"threshold_uncertainty_score":0.9997116},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00028217552,0.00094538386,0.9949779,0.0012978889,0.0007729868,0.00066766544,0.000024472107,0.00001222024,0.0010192952],"genre_scores_gemma":[0.085228585,0.0006716848,0.9124167,0.00032445035,0.0004969006,0.000022729406,0.0000064302267,0.00003652851,0.0007959955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9952929,0.00018671386,0.0020108363,0.0006278744,0.001299546,0.0005821463],"domain_scores_gemma":[0.99315995,0.0036128636,0.0011685073,0.00029351772,0.0013828116,0.00038232128],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036583075,0.00036745178,0.0011633228,0.00085376523,0.00051140133,0.00061995967,0.000687566,0.00028833532,0.0003170772],"category_scores_gemma":[0.0018588088,0.0002908152,0.00030692568,0.0013357109,0.00025058718,0.0006638826,0.00026890475,0.00065948494,0.000005074697],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022673125,0.00014926666,0.000010943165,0.00003755712,0.00012977388,0.0000068996433,0.00024693852,0.8031765,0.00029115292,0.0010774753,0.0010925229,0.19151363],"study_design_scores_gemma":[0.003661741,0.00071930845,0.000088922614,0.000109617205,0.00014586208,0.000034907436,0.0012889095,0.9795957,0.0012933732,0.003525037,0.009258858,0.0002777631],"about_ca_topic_score_codex":0.0000030356623,"about_ca_topic_score_gemma":2.1624106e-7,"teacher_disagreement_score":0.19123586,"about_ca_system_score_codex":0.00018439238,"about_ca_system_score_gemma":0.0004563031,"threshold_uncertainty_score":0.9999544},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00004299779,0.00015708125,0.99688554,0.0013290395,0.0001478866,0.00029687068,0.0000017537602,0.000035720626,0.0011031047],"genre_scores_gemma":[0.02341238,0.00010580744,0.97560245,0.00075151486,0.0000648943,0.000016500484,0.000008749236,0.000009768556,0.000027919335],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885947,0.000047907066,0.0004511884,0.0002729554,0.00020859197,0.00015990337],"domain_scores_gemma":[0.99907976,0.00008444006,0.00028250073,0.00014792725,0.00025620623,0.00014917523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038137773,0.00014414516,0.00025502415,0.00027283037,0.00014631986,0.00015884079,0.0002003362,0.00010423635,0.0000039277074],"category_scores_gemma":[0.000057087156,0.00013065145,0.000025289308,0.0008557859,0.000013191769,0.0004541619,0.00009438912,0.00012251503,0.0000012644888],"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.000032789307,0.000072582734,0.000007884701,0.000029537814,0.000023818147,7.3410956e-7,0.00020996878,0.16776963,0.0006274508,0.16260883,0.00019647497,0.6684203],"study_design_scores_gemma":[0.00041902892,0.00007696444,0.000103890125,0.000030518408,0.000033841774,0.000011920012,0.000007642636,0.9139967,0.00061464193,0.083948776,0.0006352238,0.00012083459],"about_ca_topic_score_codex":0.0000018100376,"about_ca_topic_score_gemma":4.251845e-8,"teacher_disagreement_score":0.7462271,"about_ca_system_score_codex":0.00004186401,"about_ca_system_score_gemma":0.00007486126,"threshold_uncertainty_score":0.5327811},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000767774,0.0011132902,0.9946988,0.0012175025,0.00038895084,0.00080809713,0.000028036615,0.000008914742,0.0009686412],"genre_scores_gemma":[0.7666386,0.0001669114,0.23281276,0.00013531731,0.00010356149,0.000027256352,0.0000014285251,0.000027255885,0.00008693688],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983368,0.000050673603,0.0009532949,0.00017609267,0.00021756647,0.00026557836],"domain_scores_gemma":[0.998517,0.00034124107,0.00063975906,0.00016219918,0.00024943447,0.00009038573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004973131,0.00023907925,0.00073384255,0.0001321323,0.00011385078,0.00008063835,0.00023093667,0.00016471332,0.000015490705],"category_scores_gemma":[0.000065926426,0.00017240155,0.0002980183,0.00034378533,0.0000617579,0.000098999975,0.000041299543,0.00029930274,1.212575e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00083927525,0.00011238707,0.00006947812,0.0001526205,0.0004159928,6.017867e-7,0.00018946666,0.9594454,0.0060887556,0.007994792,0.00011022099,0.024580972],"study_design_scores_gemma":[0.0043337625,0.0002022868,0.0001978648,0.00015875693,0.0005867713,0.000008673827,0.0001716919,0.9912705,0.00050240784,0.001274973,0.0011350946,0.00015724683],"about_ca_topic_score_codex":0.0000044652015,"about_ca_topic_score_gemma":3.8084076e-7,"teacher_disagreement_score":0.7658708,"about_ca_system_score_codex":0.00007097113,"about_ca_system_score_gemma":0.00011581379,"threshold_uncertainty_score":0.7030331},"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":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000278633,0.00016336357,0.9823983,0.0060075256,0.006210982,0.0010224014,0.000033339245,0.000022332486,0.003863129],"genre_scores_gemma":[0.024989674,0.025444333,0.90267414,0.0014772069,0.043662943,0.00011214807,0.00011283652,0.00028535916,0.0012413656],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953801,0.00031591125,0.0019449663,0.0005639398,0.0013316517,0.00046340062],"domain_scores_gemma":[0.9961836,0.000994621,0.0012202831,0.00037884546,0.0008943168,0.00032838894],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0014376321,0.0004931957,0.0010577744,0.0016581547,0.00025609502,0.00015538951,0.00037041013,0.0004351811,0.00053370546],"category_scores_gemma":[0.00084244757,0.0003752007,0.00011281697,0.0028158373,0.00019349565,0.00032742697,0.00019186467,0.0009350539,0.0000028265952],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002344164,0.0007779637,0.00000429873,0.00006453692,0.00008236723,0.00000378569,0.0008845094,0.8827343,0.000029301753,0.0027427883,0.020440629,0.08989133],"study_design_scores_gemma":[0.003053446,0.0011683998,0.000022144926,0.00049259135,0.00010902647,0.000004978708,0.00040334233,0.98010427,0.0005060761,0.0025003925,0.0113069005,0.00032845113],"about_ca_topic_score_codex":0.0000065348477,"about_ca_topic_score_gemma":7.538807e-7,"teacher_disagreement_score":0.097369924,"about_ca_system_score_codex":0.00043449187,"about_ca_system_score_gemma":0.00020778447,"threshold_uncertainty_score":0.99987},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.01175542,0.001319037,0.98460585,0.00029120213,0.0001204546,0.00016273171,0.000008231387,0.00002165038,0.0017154323],"genre_scores_gemma":[0.8077577,0.0018341236,0.19017977,0.00007186038,0.000053196756,0.000014038522,0.0000051816164,0.000018458959,0.00006570037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935174,0.000005514715,0.00033765828,0.000088473396,0.00008066733,0.00013592312],"domain_scores_gemma":[0.99969596,0.00010058833,0.000065341526,0.00003636727,0.00007014082,0.000031600255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012590471,0.00010882868,0.0002693515,0.00014298028,0.000071575276,0.000051034793,0.000055674085,0.000048023005,0.0000022045845],"category_scores_gemma":[0.000032686,0.0000943005,0.00004407968,0.00018089499,0.000028211398,0.000081684346,0.000013557898,0.00010110788,8.519413e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018927424,0.000022639424,0.00005746153,0.000080676866,0.00004399184,0.000001559111,0.00014293546,0.9954772,0.00041760394,0.0022108543,0.0002699884,0.0010858028],"study_design_scores_gemma":[0.0009009486,0.00002670076,0.0003658468,0.00008497676,0.000030343168,0.0000013936462,0.00007376567,0.9961083,0.00005371443,0.0014827272,0.000774812,0.00009645501],"about_ca_topic_score_codex":4.9275616e-7,"about_ca_topic_score_gemma":0.0000025892064,"teacher_disagreement_score":0.79600227,"about_ca_system_score_codex":0.000048551494,"about_ca_system_score_gemma":0.000014685703,"threshold_uncertainty_score":0.38454628},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00009857236,0.0027504696,0.99487764,0.0006133045,0.00044481026,0.0007175895,0.000003812961,0.000016443948,0.00047735247],"genre_scores_gemma":[0.48343563,0.0026193473,0.51361835,0.00011124058,0.0001282567,0.000032934182,0.0000034514326,0.000027800266,0.000022977638],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978244,0.00022584008,0.0012381095,0.00022071235,0.00018285871,0.00030809324],"domain_scores_gemma":[0.9962671,0.0021832571,0.00073858025,0.00012470294,0.0005727358,0.000113651],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013345123,0.0003037926,0.000775064,0.00016331903,0.00027540364,0.00012635137,0.00017504078,0.00035938498,0.000013909454],"category_scores_gemma":[0.00026893438,0.00021120686,0.000121564204,0.00043270845,0.0001633925,0.00014646223,0.00003433071,0.00037211613,7.8951615e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016495712,0.000044307973,0.0000069881685,0.00006339645,0.00042983057,9.0033564e-7,0.00015169279,0.9566973,0.0005259102,0.01780557,0.00013537827,0.022489147],"study_design_scores_gemma":[0.0020900862,0.00047886174,0.000018557796,0.00013909167,0.0003331171,0.000015497279,0.00030563402,0.993485,0.0010608735,0.0015755511,0.00032116956,0.00017658228],"about_ca_topic_score_codex":0.0000037041002,"about_ca_topic_score_gemma":1.2057563e-7,"teacher_disagreement_score":0.48333707,"about_ca_system_score_codex":0.0000893177,"about_ca_system_score_gemma":0.00008232679,"threshold_uncertainty_score":0.8612766},"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":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0001286954,0.000102644386,0.99730414,0.0007805872,0.00071332214,0.00013899997,2.7477185e-7,0.000029232104,0.0008021272],"genre_scores_gemma":[0.3762472,0.000024835646,0.6231151,0.00031475985,0.00027529942,0.000004239849,0.0000024156652,0.0000071591066,0.000008983157],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906677,0.000035781435,0.00037557347,0.00018130215,0.00016326385,0.00017731638],"domain_scores_gemma":[0.99916244,0.00021202327,0.0002995178,0.0001154209,0.00013587455,0.00007470428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032975397,0.00012081684,0.0002616104,0.0001268576,0.00016119471,0.00013108487,0.00033960948,0.000087818655,0.0000067680025],"category_scores_gemma":[0.0001229679,0.00010229014,0.00007586782,0.00031408764,0.000034250017,0.00030650897,0.00012654773,0.00022296916,1.2137589e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015706653,0.000021525568,0.000028514078,0.000007812476,0.000024560459,0.0000013650382,0.000082880986,0.9003902,0.000008991529,0.023482397,0.00008825222,0.075706415],"study_design_scores_gemma":[0.0010204319,0.00009251359,0.00014212955,0.000009567969,0.00003386976,0.0000072894613,0.00003184898,0.9960439,0.000016688276,0.0019483601,0.00055670616,0.00009667343],"about_ca_topic_score_codex":0.0000027796198,"about_ca_topic_score_gemma":1.4299466e-7,"teacher_disagreement_score":0.3761185,"about_ca_system_score_codex":0.000040151986,"about_ca_system_score_gemma":0.000047147198,"threshold_uncertainty_score":0.4171271},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004692113,0.0005972502,0.99121124,0.0011340277,0.00083832693,0.0010283706,0.000007010401,0.0000130707185,0.00047857242],"genre_scores_gemma":[0.7762791,0.00085329864,0.22235061,0.0001306191,0.00022009488,0.000029485916,0.000028720511,0.000021137836,0.000086959204],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958052,0.00013107508,0.0023870824,0.0004906124,0.00077639555,0.00040964416],"domain_scores_gemma":[0.9957855,0.0011092339,0.0017828905,0.00019453626,0.00095920276,0.0001686538],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0032280798,0.00029392156,0.0007903358,0.0011111922,0.0003414716,0.0005259787,0.0002446655,0.00031606507,0.00003559594],"category_scores_gemma":[0.0012564696,0.0002599325,0.00016617839,0.0017009634,0.00013315711,0.0007139316,0.00008087794,0.00036717023,0.0000018480434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014314641,0.000197451,0.0001997086,0.000029560368,0.000037201917,0.000001385991,0.0005614962,0.84049124,0.00015599128,0.0025551987,0.00018648953,0.15415283],"study_design_scores_gemma":[0.0029518532,0.0003973263,0.00037025413,0.00021611106,0.00018768746,0.000012145282,0.00071664614,0.9855794,0.00033013764,0.006660446,0.0023127077,0.00026529355],"about_ca_topic_score_codex":0.00000849278,"about_ca_topic_score_gemma":7.8826736e-7,"teacher_disagreement_score":0.77158695,"about_ca_system_score_codex":0.000183384,"about_ca_system_score_gemma":0.00044158517,"threshold_uncertainty_score":0.9999853},"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":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35472572,0.019227812,0.5717818,0.020024564,0.0066466536,0.003835057,0.00017927085,0.00017419018,0.023404945],"genre_scores_gemma":[0.9598458,0.0023692066,0.03600364,0.0012928736,0.00023684159,0.000003134604,0.00000825049,0.000036933336,0.00020331371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972304,0.00019771793,0.0014850763,0.00039411,0.0003723856,0.00032031216],"domain_scores_gemma":[0.997541,0.00075878063,0.00090537104,0.0002646173,0.00024221052,0.00028798427],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009637496,0.00040951528,0.0009234278,0.00048301765,0.00044577403,0.00015937848,0.0002186927,0.00052320166,0.00004200121],"category_scores_gemma":[0.00048222175,0.00031227502,0.00014067304,0.0005708738,0.00022267805,0.00017250584,0.00019272197,0.0007708696,7.130187e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0065962095,0.00030601476,0.00005615161,0.00048186333,0.0010073396,0.00003509015,0.008826914,0.20145935,0.0007944922,0.7386641,0.0041758073,0.03759667],"study_design_scores_gemma":[0.010535441,0.0014404526,0.0012475743,0.0008133244,0.0011217685,0.00014870212,0.0010215339,0.042211715,0.0017108213,0.93285465,0.0060665733,0.00082743866],"about_ca_topic_score_codex":0.0000025858803,"about_ca_topic_score_gemma":1.7697836e-7,"teacher_disagreement_score":0.60512006,"about_ca_system_score_codex":0.000058899484,"about_ca_system_score_gemma":0.00010056177,"threshold_uncertainty_score":0.99993294},"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":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06268136,0.005882619,0.8379489,0.0015572794,0.0016785127,0.0003196208,0.00011422588,0.000009510901,0.089807965],"genre_scores_gemma":[0.9867168,0.0033139775,0.009097685,0.00024721888,0.0001712553,0.0000030181925,0.000014900136,0.000020377405,0.00041475397],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754864,0.00001860506,0.0018806901,0.00027483667,0.000050513463,0.00022671006],"domain_scores_gemma":[0.99737006,0.00013437452,0.0020688968,0.00017977974,0.00012687995,0.00011998499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006093392,0.00020856809,0.00096117833,0.0004099917,0.000081028564,0.000085736334,0.00020291093,0.00022371292,0.0003640749],"category_scores_gemma":[0.00005433347,0.00023525095,0.00019153384,0.00031081281,0.00015875744,0.00039870708,0.00009649325,0.0002594111,0.000005455833],"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.00064103067,0.0002448912,0.00063710613,0.0001966023,0.0002860117,0.0000011160843,0.00028959988,0.43524697,0.00016348118,0.55746865,0.0009528092,0.0038717405],"study_design_scores_gemma":[0.006200438,0.0009310804,0.001831242,0.0003733669,0.00031113587,0.000023826993,0.0011792633,0.66207665,0.0018107848,0.30573675,0.018748738,0.000776722],"about_ca_topic_score_codex":0.000008147858,"about_ca_topic_score_gemma":1.1098506e-7,"teacher_disagreement_score":0.92403543,"about_ca_system_score_codex":0.00009093111,"about_ca_system_score_gemma":0.00009309007,"threshold_uncertainty_score":0.95932555},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00012002802,0.00017893229,0.99119663,0.0010336889,0.00061532395,0.0020040895,0.000023153054,0.000018543018,0.004809604],"genre_scores_gemma":[0.072837085,0.00041509408,0.9261959,0.00021296111,0.00016755004,0.00006418353,0.0000024291064,0.00003998544,0.00006481533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9965781,0.00034366807,0.0018949839,0.00034865036,0.0004554469,0.0003791642],"domain_scores_gemma":[0.98737144,0.008512895,0.002827821,0.00020637183,0.00093472085,0.00014671758],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003343258,0.00035820197,0.0010978138,0.00026498627,0.00032310732,0.000100353274,0.0002491625,0.00025748197,0.000034232828],"category_scores_gemma":[0.0021280057,0.00026164387,0.00032134645,0.0006624975,0.00035090954,0.00016658888,0.00012516866,0.0006143249,3.2469708e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026694448,0.0004883821,0.000030751587,0.0008045031,0.0013035997,0.0000022394188,0.0019265268,0.5377099,0.007911803,0.04730709,0.00020474383,0.39964104],"study_design_scores_gemma":[0.0037108236,0.00047081837,0.000020346548,0.000521031,0.0013097628,0.000041460582,0.002343808,0.9437349,0.012646953,0.03398495,0.00094185286,0.00027332894],"about_ca_topic_score_codex":0.000009224559,"about_ca_topic_score_gemma":1.4660924e-7,"teacher_disagreement_score":0.406025,"about_ca_system_score_codex":0.00019565252,"about_ca_system_score_gemma":0.00024591218,"threshold_uncertainty_score":0.99998355},"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.003841389,0.0005179115,0.9908299,0.00087454973,0.00058616756,0.0012950927,0.000018452316,0.0000365422,0.0020000262],"genre_scores_gemma":[0.5961099,0.0002058873,0.40286684,0.00020317029,0.0003214028,0.000057289846,0.000035985093,0.000055458186,0.00014403445],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99588776,0.00018138876,0.0018387998,0.0005670486,0.000853274,0.00067172083],"domain_scores_gemma":[0.99636215,0.001190468,0.00108711,0.0002852705,0.0006371598,0.00043786285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0016855431,0.00048150893,0.001167998,0.00070172286,0.0004866855,0.00027164727,0.00040744958,0.00040157427,0.00013123566],"category_scores_gemma":[0.0018609236,0.00041825502,0.00030209744,0.00080204895,0.00021807439,0.00047314906,0.00031051642,0.00085798063,9.692607e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005032395,0.00059044146,0.00013067783,0.00058410334,0.00039295282,0.000015798161,0.00044211466,0.977255,0.00028105552,0.000473845,0.00018205341,0.0146195935],"study_design_scores_gemma":[0.003955701,0.00238796,0.000114532,0.00029931893,0.00044842513,0.00011428426,0.0007456081,0.99130976,0.000022280068,0.000195232,0.00008663516,0.00032024967],"about_ca_topic_score_codex":0.0000039653764,"about_ca_topic_score_gemma":2.5104702e-8,"teacher_disagreement_score":0.5922685,"about_ca_system_score_codex":0.0002635004,"about_ca_system_score_gemma":0.00036409197,"threshold_uncertainty_score":0.9998269},"labels":[],"label_agreement":null},{"id":"W7142865936","doi":"10.23952/jano.8.2026.1.03","title":"A fast three-operator splitting method with $o(1/k)$ last-iterate convergence rates for monotone inclusions","year":2025,"lang":"","type":"article","venue":"Journal of Applied and Numerical Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Convergence (economics); Monotone polygon; Rate of convergence; Sequence (biology); Differential inclusion","score_opus":0.008348923102842342,"score_gpt":0.2830043175382748,"score_spread":0.27465539443543247,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7142865936","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00051841553,0.00025774824,0.9944284,0.0035548788,0.00027264815,0.00047386863,0.000011916253,0.000020056583,0.00046207427],"genre_scores_gemma":[0.19257915,0.00030179668,0.8056284,0.0011399658,0.00014508855,0.000026142792,0.000013562877,0.000019055264,0.00014683539],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974445,0.00011049183,0.0011948424,0.0004998438,0.00042585545,0.00032446312],"domain_scores_gemma":[0.996621,0.00050323294,0.0010749254,0.00021909944,0.0013357048,0.00024602772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00093282264,0.00034109366,0.0007368909,0.00045825145,0.0007155983,0.00056447956,0.0004173044,0.0001557068,0.00008701438],"category_scores_gemma":[0.00012756605,0.00026501677,0.00016658536,0.0017796074,0.0000817772,0.0006814673,0.00023261267,0.00029192877,0.0000018622336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053506996,0.00021825489,0.00034945016,0.00006006731,0.00033868445,0.000002675233,0.00058878394,0.9422896,0.00036413895,0.041340094,0.00010038077,0.013812786],"study_design_scores_gemma":[0.0019381291,0.0003321726,0.000299504,0.00014720407,0.00035757976,0.000013118081,0.00014063844,0.9934346,0.00068997504,0.001842766,0.0005187409,0.00028558972],"about_ca_topic_score_codex":0.000007058287,"about_ca_topic_score_gemma":0.0000016596323,"teacher_disagreement_score":0.19206072,"about_ca_system_score_codex":0.00008939963,"about_ca_system_score_gemma":0.000483291,"threshold_uncertainty_score":0.9999802},"labels":[],"label_agreement":null},{"id":"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":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00019021258,0.00010704165,0.98911214,0.0049443017,0.0004660473,0.0035060497,0.00015982128,0.000048963902,0.001465444],"genre_scores_gemma":[0.037857268,0.0005263496,0.9593421,0.0012986248,0.00030627256,0.00023806024,0.00016710527,0.00009704197,0.00016714733],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953289,0.00028357888,0.0022151305,0.0004810806,0.0010635366,0.0006277483],"domain_scores_gemma":[0.99490803,0.0018481411,0.0013668104,0.00038574147,0.0011843217,0.00030692157],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001840229,0.0005695244,0.001006286,0.00062593777,0.00068218115,0.00028561437,0.000510795,0.00027689122,0.0006052549],"category_scores_gemma":[0.00030361072,0.00042384252,0.0003568121,0.0010742455,0.0002484323,0.0004164108,0.00011887778,0.0009236614,0.0000041876756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003975781,0.001977031,0.000018325616,0.0010320791,0.00066353247,0.000004954561,0.0018834553,0.8769813,0.00018479861,0.023897832,0.0032502457,0.08613065],"study_design_scores_gemma":[0.00639893,0.0012904078,0.000009474334,0.00061533885,0.00034200333,0.0000087828,0.0008607057,0.9752596,0.0012167753,0.011725653,0.0019161078,0.00035621296],"about_ca_topic_score_codex":0.0000048324173,"about_ca_topic_score_gemma":8.8825425e-7,"teacher_disagreement_score":0.09827829,"about_ca_system_score_codex":0.0006023118,"about_ca_system_score_gemma":0.0005201567,"threshold_uncertainty_score":0.99982136},"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":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.075598024,0.005070381,0.9183956,0.00016825568,0.00007402292,0.0003753999,0.0000046778073,0.0000048536726,0.00030882115],"genre_scores_gemma":[0.9525972,0.001776118,0.04548163,0.000031346124,0.000080003534,0.000010942559,0.000004286356,0.000012213232,0.000006253016],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986127,0.000056833873,0.0008790146,0.00015635647,0.00014256146,0.00015254189],"domain_scores_gemma":[0.9983406,0.00032064735,0.0011321025,0.00008130468,0.000071196235,0.000054169144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026389767,0.00018129955,0.00046225902,0.00019438226,0.00017726958,0.00007224963,0.000063327774,0.00006918584,0.000006061398],"category_scores_gemma":[0.000014824531,0.0001305961,0.00006291357,0.0003090501,0.00007942568,0.00015216655,0.000024594987,0.00019279755,1.7194635e-8],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005271463,0.00014053476,0.0076495083,0.000014584506,0.00012824246,0.0000012694536,0.0007457097,0.45136112,0.0015583942,0.0020581344,0.0000029125288,0.53581244],"study_design_scores_gemma":[0.0033993728,0.00085364265,0.0010912879,0.00026713323,0.00011619074,0.0000022642544,0.001294852,0.9844925,0.004978693,0.0026795596,0.0006329079,0.00019164226],"about_ca_topic_score_codex":0.00000763073,"about_ca_topic_score_gemma":6.538997e-8,"teacher_disagreement_score":0.8769992,"about_ca_system_score_codex":0.00011284309,"about_ca_system_score_gemma":0.000073219584,"threshold_uncertainty_score":0.53255546},"labels":[],"label_agreement":null}]}