{"meta":{"query_hash":"29c566451c22","filters":{"venue":"Journal of Optimization Theory and Applications"},"cohort_total":119,"direct_labels_cover":0,"predictions_cover":119,"exported":119,"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/29c566451c22","api":"https://metacan.xera.ac/api/v1/cohort?venue=Journal+of+Optimization+Theory+and+Applications"},"results":[{"id":"W108851041","doi":"10.1023/a:1004622313930","title":"A Class of Learning/Estimation Algorithms Using Nominal Values: Asymptotic Analysis and Applications","year":2000,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Control Systems and Identification","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convergence (economics); Stochastic approximation; Rate of convergence; Nonlinear system; Fault detection and isolation; Computer science; Algorithm; Kernel (algebra); Process (computing); Class (philosophy); Fault (geology); Mathematics; Applied mathematics; Artificial intelligence; Key (lock)","score_opus":0.005151857398619779,"score_gpt":0.2262133565244078,"score_spread":0.221061499125788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W108851041","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.030290592,0.00067747897,0.9683948,0.00001824976,0.000014181359,0.0002438567,0.000007511543,0.000023132476,0.00033020123],"genre_scores_gemma":[0.97932225,0.00050733006,0.019806677,0.000005607297,0.00011371188,0.000045411012,0.0000230338,0.000014957361,0.00016101442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910545,0.00007668134,0.000519762,0.00010518976,0.00011500007,0.000077936405],"domain_scores_gemma":[0.9992503,0.00012558255,0.000266472,0.00012490778,0.00016733119,0.0000654234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004681579,0.000093702685,0.0002312859,0.0002796113,0.00014284968,0.000055263157,0.00007223501,0.000058457073,0.00008044327],"category_scores_gemma":[0.000018304954,0.00009271516,0.00007082233,0.000552688,0.000059691865,0.00023711946,0.0000061986966,0.000101552956,0.0000017230889],"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.000012200062,0.000028480255,0.0001660392,0.000034956785,0.00016811203,8.51552e-8,0.00013096296,0.95500064,0.0010317453,0.0028916653,0.0000039276606,0.04053119],"study_design_scores_gemma":[0.00027376402,0.000023313285,0.0012272368,0.000021866348,0.00065775594,0.000028152746,0.00019456596,0.99492323,0.0001540857,0.0016174292,0.00078238937,0.00009617918],"about_ca_topic_score_codex":0.00000380474,"about_ca_topic_score_gemma":6.641575e-7,"teacher_disagreement_score":0.94903165,"about_ca_system_score_codex":0.000030299892,"about_ca_system_score_gemma":0.000017050943,"threshold_uncertainty_score":0.37808147},"labels":[],"label_agreement":null},{"id":"W1117774183","doi":"10.1007/s10957-015-0790-0","title":"A New Nonmonotone Adaptive Retrospective Trust Region Method for Unconstrained Optimization Problems","year":2015,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Theory of computation; Mathematics; Convergence (economics); Mathematical optimization; Regular polygon; Rate of convergence; Applied mathematics; Computer science; Algorithm","score_opus":0.06317282710001523,"score_gpt":0.3707044478296285,"score_spread":0.30753162072961326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1117774183","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.000009949778,0.00015043587,0.9967195,0.0004980381,0.000056629047,0.0015086555,0.000016162916,0.000050838426,0.0009898219],"genre_scores_gemma":[0.0012448075,0.00014493839,0.9968225,0.000060325605,0.00029917987,0.00018589824,0.000022194392,0.000050235452,0.0011699192],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819684,0.00027041303,0.0007154875,0.00026828086,0.0003364777,0.00021247467],"domain_scores_gemma":[0.995893,0.0008048304,0.0009172964,0.00024114075,0.0018122558,0.00033145622],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019024636,0.00019958481,0.00038667253,0.00029683058,0.00021148266,0.00008110803,0.000211209,0.00013768143,0.000048054557],"category_scores_gemma":[0.0013841348,0.00018066424,0.00010251364,0.0006288527,0.00010387576,0.0005542501,0.000042817574,0.0002262698,0.0000010309699],"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.00032368882,0.00009890635,0.00001518413,0.000018232256,0.00006807145,7.993192e-7,0.000465453,0.7901361,0.000010903346,0.20168027,0.0006186526,0.006563731],"study_design_scores_gemma":[0.0024029762,0.00034174853,0.000002893537,0.000046404453,0.000119806085,0.00013099582,0.0012596073,0.62246776,0.00016886745,0.3720401,0.00082098175,0.00019785938],"about_ca_topic_score_codex":0.0000020467537,"about_ca_topic_score_gemma":0.0000013077921,"teacher_disagreement_score":0.17035982,"about_ca_system_score_codex":0.0002115641,"about_ca_system_score_gemma":0.00035586985,"threshold_uncertainty_score":0.7367274},"labels":[],"label_agreement":null},{"id":"W13220323","doi":"10.1023/a:1017543626630","title":"Some Predictor-Corrector Algorithms for Multivalued Variational Inequalities","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Variational inequality; Monotonic function; Theory of computation; Convergence (economics); Predictor–corrector method; Operator (biology); Class (philosophy); Algorithm; Applied mathematics; Mathematical optimization; Mathematical analysis; Computer science; Artificial intelligence","score_opus":0.020403023285981526,"score_gpt":0.2790420760848995,"score_spread":0.25863905279891797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W13220323","genre_codex":"methods","genre_gemma":"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.000058141122,0.00022665733,0.99789107,0.0012263451,0.00014038669,0.00023063464,0.000018578992,0.000035755904,0.00017244332],"genre_scores_gemma":[0.03873126,0.0007814919,0.9564806,0.00095330883,0.0013131287,0.00017306427,0.00008486626,0.0000202989,0.0014619655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883074,0.00016578821,0.0004987888,0.00016681523,0.00022484224,0.00011303825],"domain_scores_gemma":[0.99784684,0.0007565204,0.0004723478,0.00015749078,0.000664593,0.00010221429],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012061356,0.000105892905,0.00017717823,0.00023137861,0.00026190362,0.00014023295,0.00029889878,0.000057976482,0.000060911672],"category_scores_gemma":[0.0002530084,0.00009212554,0.00009838033,0.00039847416,0.000038193426,0.0009293824,0.000038253755,0.000074011245,0.0000020747786],"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.000027007229,0.000080878366,0.00006491321,0.000004757222,0.000051984167,2.0997359e-7,0.000171247,0.32022783,0.000016946695,0.6766463,0.00011232865,0.0025956081],"study_design_scores_gemma":[0.0006899237,0.000053216452,0.00021787595,0.000008999216,0.00005176573,0.00003184336,0.000089411085,0.8105748,0.000039430408,0.18329921,0.0048263147,0.00011718031],"about_ca_topic_score_codex":0.0000010614854,"about_ca_topic_score_gemma":1.5434627e-7,"teacher_disagreement_score":0.49334708,"about_ca_system_score_codex":0.000033572273,"about_ca_system_score_gemma":0.000101346755,"threshold_uncertainty_score":0.37567705},"labels":[],"label_agreement":null},{"id":"W135291411","doi":"10.1023/a:1004603023018","title":"Unbiased Estimates of Circle Parameters","year":2000,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Nonlinear system; Noise (video); Arc length; Theory of computation; Arc (geometry); Applied mathematics; Set (abstract data type); RADIUS; Unbiased Estimation; Unit circle; Algorithm; Mathematical analysis; Mathematical optimization; Statistics; Geometry; Computer science","score_opus":0.005505320253797789,"score_gpt":0.23601720153866404,"score_spread":0.23051188128486624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W135291411","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.0025482206,0.000120465214,0.9960947,0.00010666757,0.000012527985,0.000084320236,7.249138e-7,0.000030606556,0.0010017861],"genre_scores_gemma":[0.52750385,0.00035692554,0.47180304,0.00018919345,0.000027586295,0.000015620604,9.370937e-7,0.0000058742376,0.00009699961],"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9994905,0.000050812458,0.00025211443,0.00007172346,0.00008061637,0.000054212174],"domain_scores_gemma":[0.9993472,0.0001528678,0.00019229975,0.00014606824,0.00012359188,0.00003795872],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037468344,0.0000461886,0.00009912705,0.00009733086,0.000074380434,0.000039612703,0.00019269812,0.000027007414,0.00006071746],"category_scores_gemma":[0.000029858364,0.000042748667,0.00004019707,0.00025153317,0.000054477037,0.00033634584,0.000011843784,0.000056603385,0.0000014949826],"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.000053669697,0.00015948046,0.000037918202,0.00002073833,0.00003795863,0.0000017581303,0.00033444352,0.09646841,0.0014685525,0.036945604,0.00016312786,0.86430836],"study_design_scores_gemma":[0.0011381431,0.00056298386,0.0009791041,0.00010523629,0.000102628874,0.00037105993,0.00019250328,0.0711548,0.5729793,0.34780243,0.004225909,0.0003859506],"about_ca_topic_score_codex":8.781399e-7,"about_ca_topic_score_gemma":3.438598e-8,"teacher_disagreement_score":0.8639224,"about_ca_system_score_codex":0.0000074017144,"about_ca_system_score_gemma":0.000021733513,"threshold_uncertainty_score":0.17432399},"labels":[],"label_agreement":null},{"id":"W140476297","doi":"10.1023/a:1020836221527","title":"Radial Solutions and Orthogonal Trajectories in Multiobjective Global Optimization","year":2002,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Mathematics; Karush–Kuhn–Tucker conditions; Vector optimization; Theory of computation; Nonlinear programming; Mathematical optimization; Nonlinear system; Lagrange multiplier; Applied mathematics; Pareto principle; Set (abstract data type); Optimization problem; Multi-objective optimization; Computer science; Algorithm","score_opus":0.012555732355580673,"score_gpt":0.25020690630586456,"score_spread":0.2376511739502839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W140476297","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.00026893825,0.0008749529,0.9975004,0.00034088464,0.00009679766,0.00032189634,0.000012771149,0.000040027346,0.0005432857],"genre_scores_gemma":[0.1731652,0.0014956326,0.82488066,0.00014902573,0.00014592832,0.000066524815,0.000007794902,0.0000148472645,0.000074413125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986466,0.00022372084,0.00048279518,0.00026826398,0.0001873077,0.0001913248],"domain_scores_gemma":[0.99867666,0.00026537164,0.00038056332,0.0001724323,0.0003729024,0.00013208199],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052517356,0.00015766206,0.00021520165,0.00022956046,0.00029751885,0.000120892415,0.00022179184,0.00008678419,0.000028906712],"category_scores_gemma":[0.00020575627,0.00015581131,0.000046521593,0.00087528856,0.00016919976,0.0012690545,0.00007664314,0.00016845742,0.000001129253],"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.000019484292,0.00012926431,0.00027773413,0.000004154974,0.000016425603,0.0000021397284,0.00042506398,0.85388625,0.000007566793,0.1331311,0.000011235655,0.01208956],"study_design_scores_gemma":[0.0011834654,0.00007370248,0.0010208753,0.000018636465,0.000020912543,0.00019565171,0.00024233069,0.9866563,0.000019806977,0.010216858,0.00016913585,0.00018231683],"about_ca_topic_score_codex":0.0000015453708,"about_ca_topic_score_gemma":0.0000030481544,"teacher_disagreement_score":0.17289625,"about_ca_system_score_codex":0.000113503906,"about_ca_system_score_gemma":0.0000505883,"threshold_uncertainty_score":0.6353801},"labels":[],"label_agreement":null},{"id":"W1504470592","doi":"10.1023/a:1004674330768","title":"Quasi-P*-Maps, P(τ, α, β)-Maps, Exceptional Family of Elements, and Complementarity Problems","year":2000,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Mathematics and Applications","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Mixed complementarity problem; Complementarity (molecular biology); Theory of computation; Complementarity theory; Nonlinear complementarity problem; Nonlinear system; Pure mathematics; Applied mathematics; Algorithm","score_opus":0.03204118252148728,"score_gpt":0.3056292706500901,"score_spread":0.2735880881286028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1504470592","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.031138971,0.00045878734,0.9623113,0.00053312955,0.000016953223,0.0008734044,0.00017329508,0.000023532808,0.004470594],"genre_scores_gemma":[0.37166438,0.0031742807,0.6227182,0.00028118587,0.0002683234,0.00027478178,0.00015861841,0.000056016193,0.0014042082],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864787,0.000089073634,0.00081339054,0.00013042026,0.00020957662,0.00010966818],"domain_scores_gemma":[0.99856305,0.00036216885,0.0005816416,0.00018878169,0.00021323,0.00009113612],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010404702,0.00012146426,0.00025819772,0.00009123611,0.00019156263,0.000035437242,0.00014334134,0.00004870992,0.00068397593],"category_scores_gemma":[0.000039691964,0.00010614259,0.00005796899,0.0001751838,0.0001336766,0.0001438435,0.000028164843,0.00011422566,0.0000024697117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004245614,0.0010777902,0.00024388715,0.00020153678,0.000110500376,2.210418e-7,0.0005044019,0.002352089,0.0004689207,0.9796225,0.0038890366,0.011486704],"study_design_scores_gemma":[0.0011628235,0.00018288083,0.00023102808,0.00011211735,0.00020890428,0.000056684563,0.0007559293,0.0035377252,0.00012338537,0.940156,0.05325207,0.00022044379],"about_ca_topic_score_codex":0.00000198099,"about_ca_topic_score_gemma":0.000001212656,"teacher_disagreement_score":0.3405254,"about_ca_system_score_codex":0.000016653701,"about_ca_system_score_gemma":0.00003636916,"threshold_uncertainty_score":0.74890566},"labels":[],"label_agreement":null},{"id":"W1571504332","doi":"10.1023/a:1015360805050","title":"Dynamical Systems with Multiple Time-Varying Delays: Stability and Stabilizability","year":2002,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Robustness (evolution); Control theory (sociology); Mathematics; Bounded function; Norm (philosophy); Stability (learning theory); Class (philosophy); Dynamical systems theory; Applied mathematics; Computer science; Control (management); Mathematical analysis; Physics; Artificial intelligence","score_opus":0.00898347345075405,"score_gpt":0.19014555029254673,"score_spread":0.1811620768417927,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1571504332","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.12464757,0.002370183,0.87145925,0.00007355584,0.000042606414,0.0005173504,0.000020067358,0.00006827447,0.0008011341],"genre_scores_gemma":[0.9970162,0.00015240996,0.0026665865,0.000011052123,0.00006684587,0.000051488994,0.000003126365,0.0000154136,0.000016880533],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898064,0.00016307466,0.00044974155,0.00014193184,0.00013968628,0.00012494808],"domain_scores_gemma":[0.99869645,0.0006690892,0.0001336053,0.00019419809,0.0001855889,0.00012107266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080257654,0.0001273642,0.00026106264,0.00005882079,0.00012790474,0.00007142744,0.00008720866,0.00007018173,0.00008248392],"category_scores_gemma":[0.00008866604,0.00010137827,0.00003600985,0.00015635681,0.0001430049,0.00026730934,0.000012734483,0.00014882049,0.0000017935259],"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.00011915441,0.00012216701,0.0034319384,0.00018273373,0.00008602251,9.472351e-7,0.00054746453,0.989059,0.00060210977,0.0033401311,0.000017930253,0.0024904383],"study_design_scores_gemma":[0.0007239035,0.000082832805,0.0002172574,0.000038933977,0.00005745893,0.00008305198,0.0005360265,0.9970675,0.00005438414,0.0005642258,0.00042931124,0.0001450916],"about_ca_topic_score_codex":0.0000017286416,"about_ca_topic_score_gemma":0.0000010254845,"teacher_disagreement_score":0.87236863,"about_ca_system_score_codex":0.000058034457,"about_ca_system_score_gemma":0.000010351296,"threshold_uncertainty_score":0.41340858},"labels":[],"label_agreement":null},{"id":"W1575435306","doi":"10.1023/a:1017547630113","title":"Cooperative Advertising in a Marketing Channel","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":155,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Goodwill; Stackelberg competition; Business; Marginal cost; Channel (broadcasting); Promotion (chess); Microeconomics; Advertising; Stock (firearms); Marketing channel; Marketing; Industrial organization; Economics; Computer science; Finance; Telecommunications","score_opus":0.010973885275678927,"score_gpt":0.24323485580837695,"score_spread":0.232260970532698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1575435306","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.1708153,0.00083964504,0.8061365,0.0008475032,0.00011733955,0.00039799645,9.2676214e-7,0.000033493154,0.020811304],"genre_scores_gemma":[0.99802625,0.0002502693,0.0009168744,0.00036437545,0.00027634294,0.0000147065575,0.0000036507101,0.000010434875,0.00013709294],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994097,0.000045595618,0.0002908758,0.00008517161,0.000077328805,0.000091327136],"domain_scores_gemma":[0.99934006,0.00017629919,0.000241378,0.00006199011,0.00016920382,0.000011064288],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013703909,0.00007152409,0.00011630755,0.00024901947,0.00014459039,0.000106370215,0.00007794166,0.000029116103,0.0001634307],"category_scores_gemma":[0.00015424856,0.000064955224,0.000028157325,0.0004603711,0.00003098765,0.0006632118,0.00003233709,0.00010689865,0.0000028351237],"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.002030185,0.0006705348,0.116813965,0.00021551902,0.00009252596,0.00006133515,0.00081983214,0.40935045,0.0011399635,0.12063977,0.0004380708,0.34772784],"study_design_scores_gemma":[0.012417468,0.00011283027,0.2883519,0.0021301573,0.0011553053,0.0009902436,0.016267978,0.44516367,0.00022291741,0.07466372,0.15583603,0.0026877653],"about_ca_topic_score_codex":0.000005056624,"about_ca_topic_score_gemma":0.000004425212,"teacher_disagreement_score":0.82721096,"about_ca_system_score_codex":0.000011410518,"about_ca_system_score_gemma":0.00001308363,"threshold_uncertainty_score":0.2648797},"labels":[],"label_agreement":null},{"id":"W160223189","doi":"10.1023/a:1016087702231","title":"Estimation of Circle Parameters by Centroiding","year":2002,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Estimator; Theory of computation; Mathematics; Arc (geometry); Noise (video); RADIUS; Algorithm; Arc length; Set (abstract data type); Outlier; Applied mathematics; Mathematical optimization; Computer science; Statistics; Geometry; Artificial intelligence; Image (mathematics)","score_opus":0.006333910256015525,"score_gpt":0.22047353897596317,"score_spread":0.21413962871994766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W160223189","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.0010565318,0.00031820286,0.99796164,0.00017044773,0.000021431752,0.000088700894,9.1650486e-7,0.000026195721,0.0003559565],"genre_scores_gemma":[0.8216856,0.0003565476,0.17777672,0.000095872994,0.000016033568,0.000009524191,7.8869186e-7,0.000004100627,0.00005479163],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994505,0.000065493165,0.00026122876,0.00007147871,0.00009497656,0.00005634165],"domain_scores_gemma":[0.99930483,0.00011580068,0.00032012985,0.00012110123,0.00010119377,0.00003695443],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035774254,0.00004471873,0.000088276945,0.00010529043,0.00008729241,0.00004497345,0.00016087173,0.000027692535,0.000014773458],"category_scores_gemma":[0.000050293358,0.000043656644,0.00003464076,0.00023909377,0.0000356491,0.00046466713,0.00001814018,0.00006074095,9.55618e-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.000013296938,0.00018154357,0.000015045697,0.000023465414,0.000031304076,6.855535e-7,0.00052501337,0.14939451,0.0033948647,0.050935652,0.0011423831,0.7943422],"study_design_scores_gemma":[0.000565953,0.00022113204,0.00004192143,0.000047356665,0.00004390208,0.00013128258,0.00015140651,0.6125908,0.3357636,0.048776735,0.0014684891,0.00019746718],"about_ca_topic_score_codex":3.9790223e-7,"about_ca_topic_score_gemma":1.01472395e-8,"teacher_disagreement_score":0.82062906,"about_ca_system_score_codex":0.000013344831,"about_ca_system_score_gemma":0.000006071767,"threshold_uncertainty_score":0.17802663},"labels":[],"label_agreement":null},{"id":"W1964713924","doi":"10.1007/s10957-010-9668-3","title":"Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs","year":2010,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":72,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integer (computer science); Mathematics; Integer programming; Infimum and supremum; Polynomial; Parametric statistics; Bilevel optimization; Mathematical optimization; Theory of computation; Logarithm; Discrete mathematics; Algorithm; Optimization problem; Computer science; Statistics","score_opus":0.040927593523935275,"score_gpt":0.3582411616101763,"score_spread":0.317313568086241,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964713924","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.0011418929,0.00013362651,0.99692774,0.00027905742,0.0003359942,0.0007782023,0.000010760643,0.000025262389,0.00036748743],"genre_scores_gemma":[0.14476797,0.00026920086,0.853192,0.000118403485,0.00051281985,0.00028323,0.000037930015,0.000029558414,0.00078891724],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979406,0.00015264748,0.0009895713,0.0002659454,0.0004620684,0.00018915177],"domain_scores_gemma":[0.9955311,0.0013721816,0.0010098154,0.00030947768,0.0015961746,0.00018129157],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004958418,0.00015107784,0.00028675832,0.0005956998,0.00029711684,0.0004173805,0.00042580595,0.00014269505,0.0000876962],"category_scores_gemma":[0.001572529,0.00010610103,0.00016023662,0.0014033073,0.00017483959,0.0005615463,0.000041726267,0.0002822468,0.0000075612493],"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.000042509713,0.00017835673,0.00028315102,0.0000022193155,0.000024723553,4.1590397e-7,0.00012988792,0.022202937,0.000026667441,0.042142764,0.00031588404,0.9346505],"study_design_scores_gemma":[0.0018764074,0.00048510247,0.00032296052,0.000039263257,0.00021411038,0.00027842793,0.0024816955,0.5033526,0.000563491,0.21349654,0.2763511,0.00053835765],"about_ca_topic_score_codex":8.8991897e-7,"about_ca_topic_score_gemma":0.0000012692004,"teacher_disagreement_score":0.93411213,"about_ca_system_score_codex":0.000013484368,"about_ca_system_score_gemma":0.00010291491,"threshold_uncertainty_score":0.43266746},"labels":[],"label_agreement":null},{"id":"W1967756118","doi":"10.1007/s10957-004-0943-z","title":"Analysis of Random Restart and Iterated Improvement for Global Optimization with Application to the Traveling Salesman Problem","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Travelling salesman problem; Mathematics; Iterated function; Theory of computation; A priori and a posteriori; Convergence (economics); Speedup; Mathematical optimization; Combinatorics; Rate of convergence; Applied mathematics; Algorithm; Computer science; Mathematical analysis","score_opus":0.007913086695719185,"score_gpt":0.2766126644019262,"score_spread":0.26869957770620706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967756118","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.00041342532,0.00011871387,0.996365,0.0018095557,0.000010105464,0.0011617056,0.000018939081,0.000015012818,0.00008752316],"genre_scores_gemma":[0.11148808,0.00019221108,0.8876968,0.0002099817,0.00006798308,0.00024497707,0.000033487733,0.000009485937,0.00005701234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986264,0.00013740754,0.0005933196,0.00023496874,0.00027646174,0.00013143693],"domain_scores_gemma":[0.99780536,0.00032362205,0.00051769573,0.00028615238,0.0009641639,0.000103033395],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016984332,0.00011514802,0.0002554863,0.00023265029,0.00023323714,0.0001548046,0.00033557674,0.000042116764,0.000007941871],"category_scores_gemma":[0.000092702234,0.00007949607,0.000054559245,0.0016273973,0.000068724585,0.0003265472,0.000053755466,0.000071323906,2.645639e-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.00014130199,0.0000662918,0.00006179482,0.000012850146,0.00017605066,6.627467e-8,0.0002341673,0.9171121,0.00004413338,0.051409245,0.000014507953,0.03072749],"study_design_scores_gemma":[0.00092675176,0.00015285226,0.000108985354,0.0000128868,0.00029116572,0.000009565962,0.00007935119,0.99644417,0.00014850311,0.001037653,0.0006995642,0.00008857049],"about_ca_topic_score_codex":0.0000012950824,"about_ca_topic_score_gemma":0.0000038432504,"teacher_disagreement_score":0.111074656,"about_ca_system_score_codex":0.000041850988,"about_ca_system_score_gemma":0.000082320934,"threshold_uncertainty_score":0.3241756},"labels":[],"label_agreement":null},{"id":"W1968081969","doi":"10.1007/s10957-006-9086-8","title":"Equilibrium Investment Strategies in Foreign Environmental Projects","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Theory of computation; Differential game; Joint (building); Time horizon; Kyoto Protocol; Operations research; Horizon; Investment (military); Mathematical economics; Computer science; Game theory; Mathematical optimization; Microeconomics; Business; Economics; Mathematics; Engineering; Climate change","score_opus":0.029048460622455644,"score_gpt":0.22712714585553212,"score_spread":0.19807868523307648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968081969","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.4894075,0.004325493,0.38737163,0.0006669719,0.00010902084,0.00077525794,0.00022677415,0.000021971317,0.11709538],"genre_scores_gemma":[0.99557483,0.00044564818,0.0034307954,0.0001792489,0.00014753245,0.000033865246,0.000025722748,0.00001037399,0.00015201047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993017,0.0000141523715,0.00047252644,0.00009993753,0.000013819361,0.000097880875],"domain_scores_gemma":[0.99946654,0.00004634368,0.00036981283,0.00007987647,0.0000063014036,0.000031152405],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043316453,0.00006710117,0.00015183401,0.00016993283,0.000037710168,0.000054640794,0.00007154172,0.0000421566,0.00011492397],"category_scores_gemma":[0.000008235676,0.00007322309,0.000035308498,0.000079865815,0.00005414819,0.00033181728,0.000018652569,0.0000633752,0.000010597416],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016840908,0.00009001757,0.0034840237,0.000008752437,0.0000068800728,4.6730037e-7,0.00015452642,0.06798596,0.00003318511,0.92810977,0.000043354918,0.00006619934],"study_design_scores_gemma":[0.0006649739,0.000055604498,0.003178392,0.000010623178,0.0000075318503,0.000027016855,0.0014617753,0.009331667,0.00011804448,0.9804355,0.0045575695,0.00015128466],"about_ca_topic_score_codex":0.000008523956,"about_ca_topic_score_gemma":0.0000023955115,"teacher_disagreement_score":0.5061673,"about_ca_system_score_codex":0.000055052198,"about_ca_system_score_gemma":0.00001153543,"threshold_uncertainty_score":0.2985951},"labels":[],"label_agreement":null},{"id":"W1969251391","doi":"10.1007/s10957-007-9252-7","title":"An Algorithm for Portfolio Optimization with Variable Transaction Costs, Part 1: Theory","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Transaction cost; Mathematical optimization; Portfolio optimization; Portfolio; Optimization problem; Key (lock); Computer science; Function (biology); Variable (mathematics); Sequence (biology); Merton's portfolio problem; Heuristics; Reduction (mathematics); Mathematics; Economics; Replicating portfolio; Finance","score_opus":0.009780566260296204,"score_gpt":0.2266601281063399,"score_spread":0.2168795618460437,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969251391","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.000058666883,0.0005450666,0.9971636,0.000053929638,0.00006738917,0.0005032265,0.00010260852,0.000023495553,0.0014820175],"genre_scores_gemma":[0.0452471,0.00026213806,0.95324373,0.00022591755,0.00050521415,0.00021410485,0.00009217919,0.000044235454,0.00016536453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891144,0.000012216205,0.0006568648,0.00021551628,0.00004167659,0.00016230933],"domain_scores_gemma":[0.99843925,0.00022740412,0.00073531625,0.00017426348,0.0003033834,0.000120368495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020683436,0.00012150723,0.00023212518,0.00020839256,0.00033595896,0.000069964466,0.00012334663,0.00009792856,0.00009952354],"category_scores_gemma":[0.00004303811,0.00011895379,0.000048558242,0.00041262282,0.0000766885,0.00045816047,0.0000051687143,0.00010606204,0.0000017254546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011169677,0.00015314751,0.000012143132,0.000010047589,0.000035389447,0.0000011763871,0.00007848621,0.13601844,0.000004678096,0.8361053,0.000010759342,0.027458752],"study_design_scores_gemma":[0.0019068106,0.00058645156,0.000050764575,0.000040594132,0.0001736733,0.00073914486,0.0011753289,0.22801113,0.00012083334,0.7532535,0.013477123,0.0004646261],"about_ca_topic_score_codex":0.0000032073879,"about_ca_topic_score_gemma":8.383186e-7,"teacher_disagreement_score":0.09199268,"about_ca_system_score_codex":0.00005234294,"about_ca_system_score_gemma":0.000042222186,"threshold_uncertainty_score":0.48507947},"labels":[],"label_agreement":null},{"id":"W1970351398","doi":"10.1007/s10957-008-9409-z","title":"On Minimizing Some Merit Functions for Nonlinear Complementarity Problems under H-Differentiability","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Thompson Rivers University","funders":"","keywords":"Nonlinear complementarity problem; Mathematics; Complementarity (molecular biology); Differentiable function; Theory of computation; Mixed complementarity problem; Nonlinear system; Complementarity theory; Applied mathematics; Convergence (economics); Mathematical optimization; Mathematical analysis; Algorithm","score_opus":0.07448926588929954,"score_gpt":0.3608122905417831,"score_spread":0.28632302465248355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970351398","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.0031434277,0.00007952484,0.99514735,0.0004999645,0.00005189682,0.00084418454,0.000072458126,0.00003116031,0.00013003606],"genre_scores_gemma":[0.03294478,0.00049761066,0.964325,0.0003035478,0.00038146082,0.00035378648,0.00013012462,0.000059615653,0.0010040682],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99864864,0.00015083665,0.0005890814,0.0001894805,0.00025034993,0.00017162073],"domain_scores_gemma":[0.99717283,0.0014990101,0.00041968992,0.00022332658,0.0005615097,0.00012362022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007839745,0.0001377222,0.00025190238,0.00016869142,0.0005952814,0.000024479397,0.00014950607,0.000062894214,0.00019762777],"category_scores_gemma":[0.0003858527,0.000121336525,0.00010139747,0.00022534546,0.0001752821,0.00029414264,0.000035328823,0.00020211111,0.0000022139413],"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.00022831545,0.0009042136,0.000055422977,0.00008990961,0.00011808344,4.7480773e-7,0.00024462806,0.5910811,0.00009955793,0.40495187,0.00093790074,0.0012885166],"study_design_scores_gemma":[0.0027244848,0.00038955454,0.00008332952,0.000055735065,0.00014414897,0.00008602908,0.0007842765,0.14419356,0.00046167793,0.84575653,0.0050036553,0.0003169901],"about_ca_topic_score_codex":4.0894986e-7,"about_ca_topic_score_gemma":6.6836617e-7,"teacher_disagreement_score":0.44688755,"about_ca_system_score_codex":0.000072413524,"about_ca_system_score_gemma":0.000077066965,"threshold_uncertainty_score":0.49479598},"labels":[],"label_agreement":null},{"id":"W1973799058","doi":"10.1007/s10957-007-9263-4","title":"New Branch-and-Cut Algorithm for Bilevel Linear Programming","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Transpose; Branch and bound; Mathematics; Branch and cut; Bilevel optimization; Linear programming; Algorithm; Integer programming; Theory of computation; Mathematical optimization; Branching (polymer chemistry); Set (abstract data type); Optimization problem; Computer science","score_opus":0.011174452599283177,"score_gpt":0.2768035725164913,"score_spread":0.2656291199172081,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1973799058","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012806449,0.00019295329,0.99868655,0.00073065807,0.000041270807,0.00020112171,0.00000256202,0.00002247166,0.00010962995],"genre_scores_gemma":[0.0037074701,0.00012967268,0.9952095,0.00025241353,0.00025154432,0.000011222172,0.0000075414996,0.000006835374,0.0004237791],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923134,0.00003230238,0.0003671394,0.00013586675,0.0001283118,0.00010501214],"domain_scores_gemma":[0.9987677,0.00032285578,0.00031083275,0.00010973411,0.00034835923,0.00014053899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011187505,0.000078842684,0.00012879352,0.00018460673,0.00020251384,0.00010234961,0.00017801566,0.000047476726,0.000016232612],"category_scores_gemma":[0.000063100044,0.00006758897,0.000059363374,0.0004041691,0.000026505855,0.00040214675,0.000032815435,0.00006580708,8.87428e-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.000011773158,0.00004369403,0.000022495733,0.000005261488,0.000039785784,2.2350609e-7,0.00015417524,0.0463891,0.000019164241,0.32467577,0.00005576589,0.6285828],"study_design_scores_gemma":[0.0011721499,0.0001228268,0.0002416863,0.000020231204,0.000112613176,0.000090788184,0.000107705106,0.9009352,0.000534338,0.07092709,0.02550657,0.00022883248],"about_ca_topic_score_codex":8.3433895e-7,"about_ca_topic_score_gemma":4.080606e-7,"teacher_disagreement_score":0.85454607,"about_ca_system_score_codex":0.000013365762,"about_ca_system_score_gemma":0.000067161665,"threshold_uncertainty_score":0.2756198},"labels":[],"label_agreement":null},{"id":"W1975919871","doi":"10.1007/s10957-005-6538-5","title":"On Stability and Stabilizability of Singular Stochastic Systems with Delays","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":105,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Impulse (physics); Theory of computation; Control theory (sociology); Stability (learning theory); Full state feedback; Class (philosophy); Applied mathematics; Control (management); Computer science; Algorithm","score_opus":0.006176934297306274,"score_gpt":0.1997355901681808,"score_spread":0.1935586558708745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975919871","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.17579944,0.0010212492,0.8225332,0.000040490482,0.000022979395,0.00032019432,0.000010516848,0.000018754812,0.00023319364],"genre_scores_gemma":[0.9975271,0.000036370613,0.0023264438,0.000009324847,0.000056969042,0.000027852537,0.0000016119498,0.000010554066,0.0000037335435],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912065,0.0001102626,0.00044174676,0.000103021666,0.000139932,0.00008437899],"domain_scores_gemma":[0.9987814,0.0005641518,0.000175611,0.00018014398,0.00022146628,0.000077232406],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009331678,0.00010158634,0.00024303199,0.00006519109,0.00006499352,0.000026045645,0.00006894579,0.00004984765,0.000020202397],"category_scores_gemma":[0.00007886017,0.00007894723,0.000030385478,0.00012270921,0.00013369542,0.00015260193,0.000006941449,0.0001045427,2.8340338e-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.00014973928,0.00007381441,0.00014729705,0.000098074765,0.0000389566,1.0133081e-7,0.00028005766,0.9699167,0.0002244169,0.027460504,0.000002850701,0.0016074632],"study_design_scores_gemma":[0.0022514116,0.00065050035,0.00056457677,0.00024535067,0.00023349233,0.00010722809,0.002641354,0.98177713,0.0007935667,0.009853489,0.0005039544,0.00037791542],"about_ca_topic_score_codex":0.000001104577,"about_ca_topic_score_gemma":0.0000011766487,"teacher_disagreement_score":0.8217277,"about_ca_system_score_codex":0.000045928224,"about_ca_system_score_gemma":0.00002516523,"threshold_uncertainty_score":0.32193747},"labels":[],"label_agreement":null},{"id":"W1975965350","doi":"10.1007/s10957-013-0433-2","title":"Research and Development with Stock-Dependent Spillovers and Price Competition in a Duopoly","year":2013,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Microeconomics; Economics; Stock (firearms); Duopoly; Observability; Industrial organization; Nash equilibrium; Converse; Cournot competition; Mathematics","score_opus":0.025649659467147565,"score_gpt":0.2486700278748607,"score_spread":0.22302036840771314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975965350","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.7166848,0.008622771,0.2699477,0.00094840484,0.000018286366,0.0005872582,0.000007437867,0.0000070440483,0.0031762572],"genre_scores_gemma":[0.9874702,0.0039692395,0.0079912,0.000056985537,0.00002467139,0.000045085417,0.0000051902157,0.000006570311,0.00043083783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99947506,0.000022131137,0.00027919895,0.0001074502,0.00003894664,0.00007718514],"domain_scores_gemma":[0.9995465,0.000073298914,0.00018415997,0.000053785483,0.00008156457,0.000060659215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00069222925,0.00004992952,0.00012509839,0.00029007913,0.00011922907,0.000080286445,0.000040569957,0.000028966853,0.000103588856],"category_scores_gemma":[0.000012304279,0.00004294246,0.0000084099465,0.0001846008,0.00009498241,0.00024464555,0.000021076323,0.00009414582,0.0000061052883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034565644,0.000119771765,0.009785599,0.00001708599,0.000043183638,6.963469e-7,0.00072214013,0.0051697674,0.00001720422,0.9827768,0.000024652207,0.0012885239],"study_design_scores_gemma":[0.0057900837,0.0009511291,0.16557208,0.00020910431,0.0000617799,0.0001924557,0.012433411,0.034140915,0.0005405139,0.7633944,0.015778843,0.0009352435],"about_ca_topic_score_codex":0.000015474561,"about_ca_topic_score_gemma":0.000006083981,"teacher_disagreement_score":0.27078536,"about_ca_system_score_codex":0.000032381166,"about_ca_system_score_gemma":0.000014739028,"threshold_uncertainty_score":0.17511427},"labels":[],"label_agreement":null},{"id":"W1979042447","doi":"10.1007/s10957-009-9536-1","title":"Social Relationship and Transactional Marketing Policies—Maximizing Customer Lifetime Value","year":2009,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Customer Service Quality and Loyalty","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Athabasca University","funders":"","keywords":"Customer lifetime value; Value (mathematics); Marketing; Mathematics; Relationship marketing; Theory of computation; Transactional leadership; Customer value; Social marketing; Business; Microeconomics; Loyalty business model; Economics; Marketing management; Statistics; Management; Algorithm","score_opus":0.017282108911749007,"score_gpt":0.26932700625420275,"score_spread":0.2520448973424537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979042447","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.11960527,0.0009145568,0.81734735,0.025784465,0.00016766082,0.00065628096,0.000008672064,0.00014968708,0.035366062],"genre_scores_gemma":[0.9935285,0.000052706884,0.0027135173,0.0024281417,0.0011099239,0.0000067357687,0.000009426347,0.000011110975,0.00013994105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99915457,0.000073836134,0.0003768003,0.00011502483,0.00016297275,0.00011678874],"domain_scores_gemma":[0.99906415,0.00025422295,0.0003999392,0.00006456809,0.00019311754,0.000024029207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016215688,0.00010397302,0.00015239447,0.00023702362,0.0005947287,0.00018742908,0.000093432296,0.0000719893,0.00009124816],"category_scores_gemma":[0.00009265905,0.000099607714,0.000058151945,0.00038326057,0.00006379857,0.0008613826,0.000014761503,0.00018566914,0.0000071418763],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027169968,0.00014140463,0.0016226755,0.00008543203,0.000037951777,8.495311e-7,0.0004864167,0.029208574,0.000099850164,0.95338494,0.00043014245,0.01423005],"study_design_scores_gemma":[0.0051760753,0.00008514388,0.35008585,0.0003111358,0.0013236532,0.00027734597,0.0068124332,0.05706353,0.000045688503,0.42408556,0.15318002,0.0015535457],"about_ca_topic_score_codex":0.0000042468337,"about_ca_topic_score_gemma":6.1050144e-7,"teacher_disagreement_score":0.87392324,"about_ca_system_score_codex":0.00001534029,"about_ca_system_score_gemma":0.000017756023,"threshold_uncertainty_score":0.45742324},"labels":[],"label_agreement":null},{"id":"W1979589904","doi":"10.1007/s10957-006-9140-6","title":"Generalized Motzkin Theorems of the Alternative and Vector Optimization Problems","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saskatchewan Polytechnic","funders":"","keywords":"Mathematics; Hausdorff space; Convexity; Saddle point; Lagrangian; Vector optimization; Applied mathematics; Mathematical optimization; Optimization problem; Pure mathematics","score_opus":0.006239397431636806,"score_gpt":0.21845180230667405,"score_spread":0.21221240487503723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1979589904","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007638886,0.0002701371,0.9970588,0.0010935678,0.000050155002,0.00021261293,0.0000057551892,0.000012528721,0.0005325485],"genre_scores_gemma":[0.64913565,0.00061339105,0.34925517,0.0002651886,0.00020659629,0.00003712733,0.000015627467,0.000016156979,0.00045509846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883735,0.00022748674,0.00048592009,0.0001487819,0.00021952954,0.00008093055],"domain_scores_gemma":[0.9983672,0.00018222384,0.0007459662,0.00019649617,0.00046296345,0.00004518796],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006545285,0.00010147197,0.00017240051,0.00014452638,0.00020161811,0.000096037926,0.00032148763,0.000046446625,0.000034335786],"category_scores_gemma":[0.00005752726,0.00006970696,0.000072829214,0.00057626975,0.00011148679,0.00041420574,0.00007653796,0.000080798534,3.0654684e-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.0000057476705,0.0000396329,0.000076548466,0.00000427872,0.000019217445,5.1814826e-8,0.000083123814,0.55890715,0.00007118012,0.44045043,0.000016357813,0.0003262717],"study_design_scores_gemma":[0.00053864444,0.000030197072,0.00048392388,0.000020627846,0.00006349542,0.000024754903,0.000035660854,0.9121485,0.00067193125,0.08553589,0.0003465615,0.00009981822],"about_ca_topic_score_codex":0.0000066272396,"about_ca_topic_score_gemma":8.4945856e-7,"teacher_disagreement_score":0.64837176,"about_ca_system_score_codex":0.00001831743,"about_ca_system_score_gemma":0.00004829,"threshold_uncertainty_score":0.28425673},"labels":[],"label_agreement":null},{"id":"W1981779786","doi":"10.1007/s10957-009-9511-x","title":"Coordination of Advertising Strategies in a Fashion Licensing Contract","year":2009,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Merger and Competition Analysis","field":"Economics, Econometrics and Finance","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Licensee; Business; Incentive; Product (mathematics); Renting; Advertising; Product line; Process (computing); Industrial organization; Computer science; Commerce; License; Microeconomics; Economics; Mathematics; Law","score_opus":0.01046858329820695,"score_gpt":0.23649766515874246,"score_spread":0.2260290818605355,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981779786","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.047371432,0.00067321776,0.94607407,0.0003755347,0.00001813272,0.00007124274,0.0000030262347,0.000003974332,0.0054093916],"genre_scores_gemma":[0.9963577,0.00034520117,0.0031420207,0.000083861734,0.000028616356,0.0000016498147,0.000003930756,0.0000027842893,0.000034260134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992811,0.000030344056,0.0005413816,0.00007117935,0.000024990228,0.000051009287],"domain_scores_gemma":[0.99922645,0.00005873869,0.00053942035,0.00006400949,0.00008479139,0.000026599146],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006126034,0.0000463177,0.00018414247,0.00027230676,0.00004368544,0.000032430453,0.00005094208,0.00003216791,0.00010618257],"category_scores_gemma":[0.000044711294,0.000049683942,0.000048019327,0.00027707702,0.000021427884,0.00030987608,0.0000034074003,0.00006238093,0.0000014058332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020256466,0.000080399914,0.0012528445,0.000005430918,0.000012150342,2.7700614e-7,0.00019552298,0.09002038,0.00021680724,0.9045532,0.000006006762,0.0036367755],"study_design_scores_gemma":[0.0024975026,0.0002787642,0.057308603,0.00016119609,0.0000844451,0.00005043026,0.0036830008,0.17543225,0.00068219064,0.75749063,0.0019033209,0.0004276513],"about_ca_topic_score_codex":0.000001942637,"about_ca_topic_score_gemma":0.0000012466152,"teacher_disagreement_score":0.94898623,"about_ca_system_score_codex":0.00001767263,"about_ca_system_score_gemma":0.000013336286,"threshold_uncertainty_score":0.20260525},"labels":[],"label_agreement":null},{"id":"W1982355939","doi":"10.1007/s10957-015-0716-x","title":"On the Existence of Minimizers of Proximity Functions for Split Feasibility Problems","year":2015,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Dual polyhedron; Mathematics; Regular polygon; Mathematical optimization; Inverse problem; Convex function; Point (geometry); Function (biology); Inverse; Applied mathematics; Mathematical analysis; Combinatorics; Geometry","score_opus":0.04676003462394457,"score_gpt":0.27819052789319826,"score_spread":0.2314304932692537,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982355939","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009976971,0.000057133788,0.99635524,0.001468336,0.000035700607,0.000411947,0.000014475101,0.0000074978016,0.0006519772],"genre_scores_gemma":[0.6962543,0.00005674344,0.3028487,0.00023932621,0.00006135881,0.000106924446,0.000012379757,0.000008493186,0.00041174222],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989584,0.00015245363,0.0004902755,0.00012444235,0.00021055377,0.000063843996],"domain_scores_gemma":[0.99711925,0.0007037346,0.0007294807,0.00026023886,0.0011168682,0.000070455644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017512417,0.00007103504,0.000169368,0.000110644774,0.00011590683,0.000031055006,0.00031245942,0.00003582432,0.000017194936],"category_scores_gemma":[0.0004932031,0.000047646186,0.00009672609,0.00048525285,0.00010395071,0.00029310552,0.000033229444,0.00006310647,5.4478073e-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.000048631868,0.00014612032,0.00006683292,0.00001248982,0.00002908366,1.4061604e-8,0.00020166335,0.385893,0.000021152146,0.613025,0.000114477414,0.00044152697],"study_design_scores_gemma":[0.0012857626,0.0004262111,0.00039556457,0.00005007438,0.00015437361,0.00001260459,0.00070952054,0.54443634,0.00067221903,0.45083487,0.0008667418,0.00015571153],"about_ca_topic_score_codex":8.5098907e-7,"about_ca_topic_score_gemma":3.0303633e-7,"teacher_disagreement_score":0.69525665,"about_ca_system_score_codex":0.000022373648,"about_ca_system_score_gemma":0.00013171423,"threshold_uncertainty_score":0.19429551},"labels":[],"label_agreement":null},{"id":"W1983447810","doi":"10.1007/s10957-007-9289-7","title":"R&D Equilibrium Strategies with Surfers","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Subgame perfect equilibrium; Cournot competition; Competitor analysis; Nash equilibrium; Microeconomics; Mathematical economics; Game theory; Economics; Industrial organization; Business; Marketing","score_opus":0.01779247636883217,"score_gpt":0.23155545214493944,"score_spread":0.21376297577610728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983447810","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.03340207,0.0006670541,0.944098,0.00015167746,0.000044829605,0.00009642956,0.000012692335,0.000009166747,0.021518111],"genre_scores_gemma":[0.9754793,0.00023022134,0.023319226,0.00010793441,0.00014812071,0.000005543365,0.0000072010293,0.000014796234,0.00068765995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993016,0.0000104334085,0.0004536101,0.00010643202,0.00001722381,0.000110662935],"domain_scores_gemma":[0.9991406,0.00011661301,0.00048153574,0.00012290792,0.000065392225,0.00007294699],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013122394,0.00007264861,0.00017520583,0.00012530798,0.00007608169,0.00007119073,0.00009925066,0.00004236034,0.00015403201],"category_scores_gemma":[0.000018218736,0.00006703712,0.00003833291,0.0001144723,0.00008847428,0.000387728,0.000013215193,0.00008162851,0.000009558476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008260767,0.000027241278,0.00037771882,0.000006014756,0.000029424278,3.6317456e-7,0.0001840278,0.09238843,0.000015899563,0.90650076,0.000033548306,0.0003539625],"study_design_scores_gemma":[0.0010143874,0.00015845743,0.0006925165,0.000019843164,0.000030455547,0.000108373,0.0022004324,0.0015021699,0.00013258202,0.9408922,0.05294841,0.00030015153],"about_ca_topic_score_codex":0.000001978156,"about_ca_topic_score_gemma":0.0000018578819,"teacher_disagreement_score":0.9420772,"about_ca_system_score_codex":0.000021899055,"about_ca_system_score_gemma":0.000023210214,"threshold_uncertainty_score":0.27336946},"labels":[],"label_agreement":null},{"id":"W1983925543","doi":"10.1007/s10957-012-0159-6","title":"The Chebyshev–Shamanskii Method for Solving Systems of Nonlinear Equations","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Iterative Methods for Nonlinear Equations","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Sherbrooke","keywords":"Chebyshev filter; Jacobian matrix and determinant; Chebyshev iteration; Chebyshev equation; Chebyshev nodes; Applied mathematics; Chebyshev polynomials; Nonlinear system; Convergence (economics); Mathematics; Equioscillation theorem; Quintic function; Chebyshev pseudospectral method; Process (computing); Focus (optics); Mathematical optimization; Computer science; Mathematical analysis; Orthogonal polynomials; Classical orthogonal polynomials; Physics; Gegenbauer polynomials","score_opus":0.06274660337622259,"score_gpt":0.4000703358602336,"score_spread":0.33732373248401104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983925543","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.0002614253,0.0008578922,0.9975877,0.00019462024,0.00012877998,0.00064617733,0.000036080957,0.000011810373,0.00027551773],"genre_scores_gemma":[0.021998556,0.00008758917,0.9767969,0.000022900842,0.00052437827,0.00015555993,0.000012972767,0.00002630932,0.00037477846],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848944,0.00036974603,0.0007434963,0.00007831422,0.00016497115,0.00015405376],"domain_scores_gemma":[0.9894367,0.008591863,0.0009268055,0.00021263736,0.00075550505,0.00007651588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00608679,0.000104764724,0.00023270417,0.00011175059,0.00046433095,0.000056106597,0.00017095478,0.000061031646,0.000013920538],"category_scores_gemma":[0.0023812896,0.0000727415,0.00011261464,0.00024294294,0.00009200678,0.0002724043,0.000026245632,0.000122514,7.3360627e-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.00003441658,0.00014302554,0.00003244623,0.000056531597,0.00008802254,2.1179568e-8,0.00070675614,0.02164075,0.00056270126,0.9721788,0.00006442701,0.0044920584],"study_design_scores_gemma":[0.0011862363,0.00017275827,0.00003346715,0.00012451693,0.0007176363,0.00006899874,0.004117428,0.51378024,0.004040104,0.4581968,0.01725111,0.00031068368],"about_ca_topic_score_codex":5.6129494e-7,"about_ca_topic_score_gemma":4.2186124e-7,"teacher_disagreement_score":0.51398206,"about_ca_system_score_codex":0.000026859292,"about_ca_system_score_gemma":0.00005266214,"threshold_uncertainty_score":0.3571305},"labels":[],"label_agreement":null},{"id":"W1987426864","doi":"10.1007/s10957-008-9431-1","title":"Quasiconvex Minimization on a Locally Finite Union of Convex Sets","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Quasiconvex function; Mathematics; Theory of computation; Bilevel optimization; Banach space; Mathematical optimization; Subderivative; Convex optimization; Convex function; Regular polygon; Convex analysis; Finite set; Optimization problem; Pure mathematics; Mathematical analysis; Algorithm","score_opus":0.012378892796792258,"score_gpt":0.24132721737783436,"score_spread":0.2289483245810421,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987426864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0004822799,0.00008503615,0.99752426,0.0008518007,0.000045536137,0.0001362113,0.000005094323,0.000020106547,0.00084967463],"genre_scores_gemma":[0.81454664,0.0009784995,0.18323255,0.00073284126,0.00008988557,0.000018207353,0.000032045104,0.0000138172145,0.00035550035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99866587,0.00024084072,0.0005722546,0.00015901787,0.00027525367,0.00008677996],"domain_scores_gemma":[0.99782664,0.00046713493,0.0007168088,0.0002237601,0.0006717106,0.000093976036],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006241202,0.000108293614,0.00022068316,0.00032276308,0.00019467896,0.000034842924,0.00028840196,0.000067020505,0.00006314848],"category_scores_gemma":[0.00015247278,0.0000948753,0.0000849284,0.0007264034,0.00009318942,0.00044454017,0.000036254976,0.00009887408,0.0000046264995],"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.000029502255,0.00015189398,0.00012808402,0.00000732518,0.000037018373,9.3257086e-7,0.00027754824,0.6909942,0.000025015766,0.3055953,0.0000965917,0.0026565816],"study_design_scores_gemma":[0.0011751733,0.000278569,0.001057819,0.000048128775,0.00007198398,0.00009145896,0.00012166487,0.97590905,0.0008819993,0.018104302,0.0020359175,0.000223949],"about_ca_topic_score_codex":7.53542e-7,"about_ca_topic_score_gemma":1.2913394e-7,"teacher_disagreement_score":0.8142917,"about_ca_system_score_codex":0.000019834833,"about_ca_system_score_gemma":0.000116673844,"threshold_uncertainty_score":0.38689023},"labels":[],"label_agreement":null},{"id":"W1989390764","doi":"10.1007/s10957-010-9747-5","title":"Convexity of the Proximal Average","year":2010,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Convexity; Interpolation (computer graphics); Regular polygon; Mathematics; Factor (programming language); Function (biology); Convex function; Applied mathematics; Mathematical analysis; Combinatorics; Mathematical optimization; Computer science; Geometry; Artificial intelligence; Image (mathematics)","score_opus":0.017471379758686678,"score_gpt":0.3263128521392824,"score_spread":0.3088414723805957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989390764","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.0057798573,0.000024975632,0.99217874,0.0003019741,0.000057347923,0.00032849144,0.000007171156,0.000008872507,0.0013125904],"genre_scores_gemma":[0.47753263,0.00011343844,0.5209414,0.000087961875,0.00020019535,0.000041106934,0.0000024687079,0.000027345422,0.0010534857],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991299,0.00011876744,0.00038374995,0.00007504922,0.00021259792,0.00007994943],"domain_scores_gemma":[0.9981827,0.00050406036,0.00050733826,0.00023577886,0.00051007775,0.00006002618],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094922783,0.00006823368,0.0001389897,0.00007135028,0.00015185241,0.00001946922,0.00023018276,0.00005816654,0.00022275446],"category_scores_gemma":[0.00076168537,0.00004583711,0.000059217677,0.00026664778,0.0002312789,0.0001620056,0.000052612526,0.00029967204,7.162151e-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.000054208336,0.00019417582,0.00022258132,0.00004104665,0.000031902688,3.136475e-7,0.00022252016,0.07134674,0.002021409,0.92262113,0.00008888882,0.0031550936],"study_design_scores_gemma":[0.0013686359,0.00008409308,0.0004503995,0.000047544447,0.0000931778,0.00017651374,0.00036196827,0.067276,0.016625023,0.9093942,0.003912342,0.0002101176],"about_ca_topic_score_codex":1.4057518e-7,"about_ca_topic_score_gemma":3.5103602e-7,"teacher_disagreement_score":0.47175276,"about_ca_system_score_codex":0.0000089974965,"about_ca_system_score_gemma":0.000074032025,"threshold_uncertainty_score":0.24390051},"labels":[],"label_agreement":null},{"id":"W1990402864","doi":"10.1007/s10957-013-0493-3","title":"Enhanced Karush–Kuhn–Tucker Conditions for Mathematical Programs with Equilibrium Constraints","year":2013,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Normality; Mathematics; Constraint (computer-aided design); Mathematical optimization; Karush–Kuhn–Tucker conditions; Applied mathematics; Stationary point; Function (biology); Mathematical economics; Mathematical analysis; Algorithm; Statistics; Geometry","score_opus":0.008820990722988718,"score_gpt":0.24866347583770362,"score_spread":0.2398424851147149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1990402864","genre_codex":"methods","genre_gemma":"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.00046067112,0.000023305596,0.9961281,0.0013906021,0.000019702626,0.00058883376,0.00000536814,0.000034915684,0.0013485452],"genre_scores_gemma":[0.4366439,0.00002277814,0.56195694,0.00035631997,0.000092545575,0.000389935,0.00003851616,0.0000125734605,0.00048648997],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99904114,0.00007017374,0.00041874713,0.00016379869,0.00017485625,0.00013131382],"domain_scores_gemma":[0.99815154,0.00031707453,0.00039294903,0.00018115604,0.0008228768,0.00013438896],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004003766,0.000109936416,0.00018742082,0.00013375525,0.00017742165,0.00023914404,0.00025340586,0.000050628838,0.00032457392],"category_scores_gemma":[0.0000633646,0.000082083345,0.0000742694,0.0003845684,0.00015377656,0.0007666202,0.000029678431,0.00007545022,0.000014238343],"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.0000135739965,0.0001898344,0.000013997143,0.000016293157,0.00008664484,1.8860129e-7,0.00016744557,0.08910013,0.0002654822,0.90410334,0.000107804284,0.005935265],"study_design_scores_gemma":[0.0017102016,0.00031700276,0.00015471947,0.00007261635,0.00019808054,0.00013161181,0.0004630758,0.62780005,0.0011352621,0.3669078,0.0007490989,0.000360444],"about_ca_topic_score_codex":2.2590095e-7,"about_ca_topic_score_gemma":8.9713915e-8,"teacher_disagreement_score":0.5386999,"about_ca_system_score_codex":0.000016954556,"about_ca_system_score_gemma":0.00008295095,"threshold_uncertainty_score":0.3553857},"labels":[],"label_agreement":null},{"id":"W1991452775","doi":"10.1007/s10957-006-9095-7","title":"Adaptive Large-Neighborhood Self-Regular Predictor-Corrector Interior-Point Methods for Linear Optimization","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Interior point method; Mathematics; Predictor–corrector method; Logarithm; Function (biology); Path (computing); Quadratic equation; Combinatorics; Affine transformation; Theory of computation; Scaling; Applied mathematics; Discrete mathematics; Mathematical optimization; Algorithm; Mathematical analysis; Pure mathematics; Geometry","score_opus":0.02557483011133986,"score_gpt":0.3966613630238401,"score_spread":0.3710865329125002,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991452775","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.000036140053,0.0002981684,0.9976075,0.00013636069,0.00014103712,0.0012546689,0.000031732507,0.000100348065,0.00039402046],"genre_scores_gemma":[0.0025598395,0.0003238243,0.9961514,0.00009143975,0.0003524785,0.00013038919,0.00003465687,0.000072337316,0.00028365734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976531,0.0003774751,0.0010496145,0.00028986586,0.00028484318,0.00034504902],"domain_scores_gemma":[0.99435526,0.0025717358,0.00094155053,0.00031055155,0.0015662198,0.00025470133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005411472,0.00024261705,0.00041538736,0.00041547976,0.00036611693,0.000064260596,0.00029221398,0.00018018854,0.00020058622],"category_scores_gemma":[0.0015340382,0.00021907974,0.00015954796,0.00059507595,0.000104467916,0.00054432714,0.000081831524,0.0002978977,0.0000012702727],"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.00066624925,0.00047757063,0.000025286361,0.00009902949,0.00026982353,0.0000017743685,0.0009695634,0.724409,0.00013036077,0.2596546,0.00017830919,0.01311846],"study_design_scores_gemma":[0.0017567957,0.00030601994,0.0000056907284,0.000066719316,0.00020250825,0.00007340994,0.0013423249,0.89920557,0.0012571771,0.093067385,0.0024523453,0.00026407445],"about_ca_topic_score_codex":1.5052181e-7,"about_ca_topic_score_gemma":3.0373417e-7,"teacher_disagreement_score":0.17479657,"about_ca_system_score_codex":0.00014693072,"about_ca_system_score_gemma":0.00012717342,"threshold_uncertainty_score":0.89338124},"labels":[],"label_agreement":null},{"id":"W1994134237","doi":"10.1007/s10957-012-0190-7","title":"Study of Limit Cycles and Stability Analysis of Fractional Arneodo Oscillator","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Fractional Differential Equations Solutions","field":"Mathematics","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Limit (mathematics); Stability (learning theory); Limit cycle; Reliability (semiconductor); Range (aeronautics); Oscillation (cell signaling); Theory of computation; Focus (optics); Parametric statistics; Describing function; Function (biology); Applied mathematics; Amplitude; Numerical analysis; Mathematical analysis; Nonlinear system; Statistics; Computer science; Physics; Algorithm; Power (physics)","score_opus":0.059066596651597934,"score_gpt":0.3435511104868124,"score_spread":0.2844845138352145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994134237","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.5078351,0.00011939823,0.4916026,0.000037463953,0.000021925389,0.00018411005,0.000025253836,0.00000492274,0.00016921366],"genre_scores_gemma":[0.98491406,0.00007064573,0.014906615,0.000006212072,0.000052951105,0.000019222565,0.000007861591,0.0000070873516,0.000015310772],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9987462,0.00021644087,0.00063931814,0.00008673058,0.0002355941,0.00007571897],"domain_scores_gemma":[0.9970308,0.0014360108,0.0008302344,0.00016745596,0.00045401303,0.00008147821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010165601,0.00008209051,0.00029699176,0.00034333358,0.00013449244,0.000011536182,0.00006969983,0.000049376747,0.00018768902],"category_scores_gemma":[0.0004644827,0.00007230871,0.00008761605,0.0005733037,0.00011416134,0.00029370966,0.00002832746,0.00010088574,2.9860604e-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.00017793408,0.0047975346,0.049855396,0.000058859077,0.0020673275,1.0635014e-7,0.0026156332,0.071930565,0.0008297726,0.8664294,0.000044310516,0.0011931818],"study_design_scores_gemma":[0.0035573705,0.0008229255,0.58021665,0.000090294765,0.018361572,0.0000775965,0.03410687,0.04290865,0.002084501,0.31650528,0.00053644093,0.00073183945],"about_ca_topic_score_codex":0.000003293551,"about_ca_topic_score_gemma":0.0000043314153,"teacher_disagreement_score":0.5499241,"about_ca_system_score_codex":0.000026435599,"about_ca_system_score_gemma":0.00003381807,"threshold_uncertainty_score":0.29486635},"labels":[],"label_agreement":null},{"id":"W1994576520","doi":"10.1007/s10957-013-0410-9","title":"Approximation in p-Norm of Univariate Concave Functions","year":2013,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Subgradient method; Mathematics; Norm (philosophy); Univariate; Uniform norm; Concave function; Mathematical optimization; Applied mathematics; Discrete mathematics; Algorithm; Regular polygon; Statistics; Multivariate statistics","score_opus":0.02009323997641423,"score_gpt":0.3141583261122085,"score_spread":0.2940650861357943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994576520","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.0025087807,0.00007496283,0.99463814,0.00021084076,0.000022094973,0.0005100062,0.0000053688264,0.00001227891,0.0020175288],"genre_scores_gemma":[0.31130537,0.00046756514,0.6863352,0.00006321581,0.00011836214,0.00020397296,0.000024050272,0.000040471143,0.0014417629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988005,0.00016371997,0.0006434684,0.00009958642,0.00018488016,0.00010783515],"domain_scores_gemma":[0.9978763,0.000661521,0.0005638608,0.00016018336,0.0006658623,0.00007230674],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080895895,0.000087700246,0.00020855347,0.00031437955,0.000078397556,0.00002800107,0.0001223657,0.000066223176,0.0003747578],"category_scores_gemma":[0.00042365122,0.00007802384,0.00004239418,0.0005334899,0.00010470616,0.00048406795,0.000029666133,0.0001630409,0.0000044605313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051101862,0.0003054003,0.00016475581,0.000067961395,0.000041789128,4.6096574e-7,0.00046627148,0.41235542,0.00043853474,0.57655525,0.00016842362,0.009384644],"study_design_scores_gemma":[0.0018731772,0.00013301306,0.0004822744,0.00009117887,0.000067696106,0.00005524997,0.002848667,0.24456717,0.00094315194,0.7481306,0.0005835913,0.00022422278],"about_ca_topic_score_codex":0.0000019581335,"about_ca_topic_score_gemma":5.667956e-7,"teacher_disagreement_score":0.3087966,"about_ca_system_score_codex":0.000044585006,"about_ca_system_score_gemma":0.000061964674,"threshold_uncertainty_score":0.41033348},"labels":[],"label_agreement":null},{"id":"W1997539213","doi":"10.1007/s10957-006-9029-4","title":"Optimization Techniques for State-Constrained Control and Obstacle Problems","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Hamilton–Jacobi–Bellman equation; Minimax; Mathematical optimization; Reachability; Duality (order theory); Bellman equation; Mathematics; State (computer science); Variational inequality; Obstacle; Dynamic programming; Optimal control; Class (philosophy); Computer science; Law; Algorithm","score_opus":0.004767419257291239,"score_gpt":0.22288228959033604,"score_spread":0.2181148703330448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997539213","genre_codex":"methods","genre_gemma":"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.000035964636,0.00023608572,0.9978185,0.0011063332,0.000019770147,0.00042942713,0.000015702297,0.00004743199,0.0002907591],"genre_scores_gemma":[0.118343055,0.00020370792,0.8806117,0.00030266386,0.000115459094,0.000114038616,0.00003076334,0.000012447046,0.0002661273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990372,0.0000894472,0.00047195924,0.00016813929,0.00012872588,0.00010455087],"domain_scores_gemma":[0.99846613,0.00030659855,0.000473954,0.00012389918,0.00056242966,0.00006698782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075884274,0.00010531512,0.00017682312,0.00020197449,0.00023544706,0.00019238614,0.00016730514,0.00005117183,0.0000141134815],"category_scores_gemma":[0.00005804148,0.00009258979,0.000056366665,0.00032998095,0.00006631997,0.00060424535,0.000021910198,0.000059730977,2.7092844e-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.000015718631,0.000056056473,0.000043354758,0.000009602087,0.000026063433,1.1630309e-7,0.00003967537,0.73495865,0.00007069846,0.26052487,0.000044379856,0.0042107813],"study_design_scores_gemma":[0.0007997679,0.000074329706,0.00007849548,0.00001334716,0.000069493435,0.00003446565,0.000025168687,0.9345019,0.00020397591,0.06266241,0.0014052019,0.00013147097],"about_ca_topic_score_codex":0.0000016882794,"about_ca_topic_score_gemma":5.410595e-7,"teacher_disagreement_score":0.19954321,"about_ca_system_score_codex":0.000019051762,"about_ca_system_score_gemma":0.00005513498,"threshold_uncertainty_score":0.3775702},"labels":[],"label_agreement":null},{"id":"W2000277859","doi":"10.1007/s10957-014-0623-6","title":"S-adapted Equilibria in Games Played Over Event Trees with Coupled Constraints","year":2014,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical economics; Uniqueness; Simple (philosophy); Event (particle physics); Constraint (computer-aided design); Class (philosophy); Mathematics; Node (physics); Game theory; Equilibrium selection; Sample (material); Best response; Mathematical optimization; Repeated game; Computer science; Artificial intelligence","score_opus":0.009688673372311603,"score_gpt":0.21168001357188934,"score_spread":0.20199134019957773,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000277859","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.12838233,0.00030115613,0.8669115,0.00020156603,0.00003546612,0.00015668724,0.000018553048,0.000007004582,0.0039857957],"genre_scores_gemma":[0.9951269,0.00020446075,0.004273661,0.000113268135,0.000068338,0.000017561528,0.000006784369,0.000011716507,0.00017732671],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917495,0.000029519386,0.00053770037,0.00013507831,0.0000199288,0.00010280725],"domain_scores_gemma":[0.99907875,0.00015744304,0.00053590175,0.00012789543,0.00003801506,0.00006199378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094112987,0.00008586478,0.000260987,0.00014755038,0.00005468273,0.000040960553,0.00010090246,0.000048115973,0.0003178543],"category_scores_gemma":[0.00004806564,0.000080117374,0.000039974686,0.000108008884,0.000109804365,0.0002145621,0.000014935905,0.00008703902,0.000004619187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100580095,0.00005132854,0.0012383055,0.0000048105976,0.000027313354,2.698414e-7,0.00014663386,0.14953388,0.00002102738,0.8480212,0.000013916058,0.000840729],"study_design_scores_gemma":[0.0042010495,0.0002807241,0.0059175175,0.00007073182,0.00003472388,0.000059450278,0.00054610666,0.40476322,0.000058551253,0.57421315,0.009456144,0.0003986459],"about_ca_topic_score_codex":0.0000031608727,"about_ca_topic_score_gemma":0.0000040181967,"teacher_disagreement_score":0.8667446,"about_ca_system_score_codex":0.000027918539,"about_ca_system_score_gemma":0.000019278968,"threshold_uncertainty_score":0.34802818},"labels":[],"label_agreement":null},{"id":"W2006609776","doi":"10.1007/s10957-005-2098-y","title":"Approximate Maximum Likelihood Estimation of Circle Parameters","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Estimator; Upper and lower bounds; Applied mathematics; Cramér–Rao bound; Maximum likelihood sequence estimation; Theory of computation; Estimation theory; Nonlinear system; Maximum likelihood; Algorithm; Mathematical optimization; Mathematical analysis; Statistics","score_opus":0.005287962378319345,"score_gpt":0.2358070412351026,"score_spread":0.23051907885678324,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006609776","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.0010398533,0.00014715127,0.9978878,0.0002954372,0.000022416749,0.0001413735,8.785512e-7,0.00004213451,0.00042294606],"genre_scores_gemma":[0.42076224,0.00012971736,0.57892025,0.00011831205,0.000033444874,0.00001631813,9.271611e-7,0.0000047469225,0.000014021061],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99927795,0.000070597285,0.00035874525,0.00009499086,0.00011924514,0.00007847444],"domain_scores_gemma":[0.99908185,0.000098122226,0.0004053849,0.0001815279,0.00018334172,0.00004974854],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006618916,0.00006195332,0.0001187878,0.00016996889,0.00008961172,0.00005491219,0.00022159216,0.0000396089,0.000008482013],"category_scores_gemma":[0.000042051084,0.00005904411,0.00004931812,0.00027974273,0.000047148158,0.00066693313,0.000031930547,0.00008050932,0.0000014462088],"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.000018383607,0.00010426726,0.0000050981203,0.000017399918,0.000017865126,3.290039e-7,0.00025191356,0.15097636,0.00053882657,0.029566517,0.000050386974,0.81845266],"study_design_scores_gemma":[0.0007175675,0.00025844225,0.00014353632,0.000058915448,0.00006145043,0.00020841544,0.00016016267,0.4092155,0.2803411,0.30747327,0.0011172288,0.00024440477],"about_ca_topic_score_codex":5.161969e-7,"about_ca_topic_score_gemma":7.254909e-8,"teacher_disagreement_score":0.8182082,"about_ca_system_score_codex":0.000018723016,"about_ca_system_score_gemma":0.000031212036,"threshold_uncertainty_score":0.24077488},"labels":[],"label_agreement":null},{"id":"W2008340888","doi":"10.1007/s10957-009-9550-3","title":"Guaranteed Cost Control for Uncertain Neutral Stochastic Systems via Dynamic Output Feedback Controllers","year":2009,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Theory of computation; Control theory (sociology); Bounded function; Linear matrix inequality; Bellman equation; Upper and lower bounds; Norm (philosophy); Mathematical optimization; Stochastic control; Output feedback; Control (management); Optimal control; Computer science","score_opus":0.007015884263474808,"score_gpt":0.22976114917180018,"score_spread":0.22274526490832539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008340888","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.0010370465,0.0016843361,0.9950876,0.00026304874,0.00019298383,0.0014598911,0.00004681856,0.000055912977,0.00017235013],"genre_scores_gemma":[0.9983931,0.00004222356,0.0009453122,0.00014059893,0.00020038559,0.00018317207,0.000010427645,0.000018513938,0.000066245644],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988345,0.00009903817,0.0006327427,0.00012489012,0.000112099005,0.00019675826],"domain_scores_gemma":[0.99863714,0.00058190536,0.0002591929,0.00015321003,0.00025415551,0.0001143842],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000816436,0.00016700389,0.00040638054,0.00012271879,0.00015160417,0.0000852701,0.00015559817,0.00009520609,0.000005415277],"category_scores_gemma":[0.000061876184,0.0001476279,0.00012773702,0.0001392172,0.000055974182,0.00016441953,0.0000026187254,0.00013185425,0.0000015175661],"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.00038713214,0.000041830048,0.0000038531825,0.000034891516,0.00009758501,4.2190754e-7,0.00010062778,0.9766734,0.00037336157,0.018057186,0.00005655348,0.004173111],"study_design_scores_gemma":[0.0037028266,0.00015411405,0.000047444184,0.00004963075,0.0001507005,0.00006001059,0.00044501535,0.98902136,0.0000073763463,0.005343403,0.00085476326,0.00016335181],"about_ca_topic_score_codex":9.137848e-7,"about_ca_topic_score_gemma":6.6041616e-7,"teacher_disagreement_score":0.99735606,"about_ca_system_score_codex":0.000083019106,"about_ca_system_score_gemma":0.000032531796,"threshold_uncertainty_score":0.6020091},"labels":[],"label_agreement":null},{"id":"W2012066853","doi":"10.1007/s10957-007-9344-4","title":"REFE-Acceptable Mappings: Necessary and Sufficient Condition for the Nonexistence of a Regular Exceptional Family of Elements","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Iterative Methods for Nonlinear Equations","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Uniqueness; Mathematics; Complementarity (molecular biology); Mathematical analysis","score_opus":0.07403505187528658,"score_gpt":0.3638723416970181,"score_spread":0.2898372898217315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012066853","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.046321094,0.00029365727,0.95250195,0.00009257778,0.00002174712,0.00044827952,0.00006311825,0.0000041731732,0.00025340825],"genre_scores_gemma":[0.38271126,0.00044206233,0.61630654,0.0000454301,0.00008386456,0.00008658676,0.00002882882,0.000013702622,0.00028171678],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989683,0.000132162,0.00058040634,0.00008520172,0.0001662397,0.00006770912],"domain_scores_gemma":[0.99738157,0.0010909835,0.0008201256,0.00013041365,0.00054667407,0.000030228392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013673637,0.0000741239,0.00018179587,0.000099646284,0.00024408859,0.000010752114,0.00010162654,0.00003596469,0.000033849083],"category_scores_gemma":[0.00030603242,0.00005491691,0.000058866775,0.00018187266,0.0002444951,0.00014174626,0.000022711309,0.000067329274,1.4865968e-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.00024290688,0.000559476,0.00040811108,0.00021705669,0.00019234825,2.876295e-7,0.002760288,0.03796695,0.010722009,0.9437596,0.0005466866,0.0026242486],"study_design_scores_gemma":[0.0043717762,0.0009122752,0.005660197,0.00037604902,0.0008378192,0.00028231964,0.01181678,0.15172058,0.010973703,0.80506915,0.00749254,0.00048678461],"about_ca_topic_score_codex":4.9328e-7,"about_ca_topic_score_gemma":1.5916426e-7,"teacher_disagreement_score":0.33639017,"about_ca_system_score_codex":0.0000135008395,"about_ca_system_score_gemma":0.000045974466,"threshold_uncertainty_score":0.22394466},"labels":[],"label_agreement":null},{"id":"W2012329717","doi":"10.1007/s10957-009-9558-8","title":"Stabilization of Singular Markovian Jump Systems with Discontinuities and Saturating Inputs","year":2009,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Classification of discontinuities; Mathematics; Theory of computation; Control theory (sociology); Linear matrix inequality; Stability (learning theory); Singular control; State (computer science); Matrix (chemical analysis); Markov process; Jump; Applied mathematics; Domain (mathematical analysis); Mathematical optimization; Optimal control; Control (management); Mathematical analysis; Computer science; Algorithm","score_opus":0.0029520827917513467,"score_gpt":0.18437186844186543,"score_spread":0.18141978565011407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012329717","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.06384625,0.0021233335,0.93313795,0.00007366061,0.000031670486,0.0002499472,0.00000466849,0.00002207501,0.0005104253],"genre_scores_gemma":[0.9966448,0.00014618195,0.0030866102,0.000013909604,0.00007019332,0.00000880853,0.0000033775652,0.0000075497974,0.000018594907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933505,0.000067411565,0.00036429372,0.000065599226,0.00010040203,0.000067227185],"domain_scores_gemma":[0.99935645,0.00013643695,0.00020721866,0.000088883055,0.00016648274,0.00004450716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00042812966,0.000082261184,0.00019294588,0.00008046165,0.000068222085,0.00005434097,0.000050583236,0.00004029932,0.0000031978054],"category_scores_gemma":[0.000031983887,0.00006457435,0.00002084853,0.00013109019,0.00005832559,0.0002362732,0.0000037491347,0.000067163586,5.179586e-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.000091436814,0.000034136912,0.0008768863,0.00015179295,0.00005237521,5.394041e-7,0.0011098557,0.9420836,0.0016806048,0.047009435,0.000009007739,0.0069003315],"study_design_scores_gemma":[0.005097791,0.0014025939,0.0095695825,0.0017217349,0.00064670085,0.00055107777,0.017551675,0.93289006,0.00301622,0.023555664,0.0028521393,0.0011447774],"about_ca_topic_score_codex":8.3232413e-7,"about_ca_topic_score_gemma":8.317719e-7,"teacher_disagreement_score":0.9327985,"about_ca_system_score_codex":0.000016668146,"about_ca_system_score_gemma":0.000015775802,"threshold_uncertainty_score":0.26332656},"labels":[],"label_agreement":null},{"id":"W2012569716","doi":"10.1007/s10957-014-0576-9","title":"A Weighted Sequential Sampling Method Considering Influences of Sample Qualities in Input and Output Parameter Spaces for Global Optimization","year":2014,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Metamodeling; Weighting; Sampling (signal processing); Adaptive sampling; Sample (material); Mathematics; Mathematical optimization; Sample space; Quality (philosophy); Process (computing); Algorithm; Computer science; Statistics; Monte Carlo method","score_opus":0.031821269869103566,"score_gpt":0.3417841240154184,"score_spread":0.30996285414631486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2012569716","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.0011294626,0.0001711185,0.99805075,0.0001755823,0.00005200785,0.00034439616,0.000015750953,0.000020909169,0.000040033487],"genre_scores_gemma":[0.045244638,0.00013809821,0.95441675,0.000090167836,0.00004408402,0.000042969394,0.0000071001286,0.000008252524,0.000007942933],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99860704,0.00028866326,0.0006035078,0.0002231288,0.00014369002,0.00013397935],"domain_scores_gemma":[0.996683,0.0019589316,0.0006808854,0.00015430845,0.00044978154,0.00007306654],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012696672,0.00013114235,0.00028707084,0.00020173965,0.00013901865,0.00012314407,0.0001900562,0.000070101356,0.000003774501],"category_scores_gemma":[0.0007761383,0.00012257717,0.000046349072,0.0003875351,0.00012561562,0.00074561767,0.000070235044,0.000080989244,5.961424e-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.0000337608,0.000032338357,0.00030519033,0.000025076753,0.000020308838,8.317664e-8,0.0004328532,0.8280587,0.000025831765,0.15851136,7.4959064e-7,0.012553714],"study_design_scores_gemma":[0.0007809686,0.000069459034,0.0001257872,0.00004479829,0.000026173499,0.00002817464,0.00033118782,0.90173835,0.00032731457,0.096225366,0.00017407729,0.00012835495],"about_ca_topic_score_codex":0.0000053978806,"about_ca_topic_score_gemma":0.00000199406,"teacher_disagreement_score":0.0736796,"about_ca_system_score_codex":0.00003718427,"about_ca_system_score_gemma":0.00006334766,"threshold_uncertainty_score":0.4998552},"labels":[],"label_agreement":null},{"id":"W2015033819","doi":"10.1007/s10957-004-1709-3","title":"On the Exact Controllability of the Wave Equation with Interior and Boundary Controls","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Controllability of Differential Equations","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Controllability; Mathematics; Wave equation; Boundary (topology); Bounded function; Domain (mathematical analysis); Mathematical analysis; Theory of computation; Boundary value problem; Applied mathematics","score_opus":0.00826082663681671,"score_gpt":0.20238348130747633,"score_spread":0.19412265467065962,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2015033819","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.25641662,0.00027272027,0.7397304,0.0025534248,0.000029834262,0.0005740394,0.000014672695,0.000013761273,0.00039448775],"genre_scores_gemma":[0.9988141,0.000049509836,0.00089002965,0.00012800917,0.000054149565,0.000040718543,0.0000012511182,0.000007097688,0.000015144895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920523,0.00016848274,0.00034961427,0.000074780364,0.00013330832,0.00006855547],"domain_scores_gemma":[0.9984016,0.0010050501,0.0001875969,0.00019305253,0.00017599466,0.0000366956],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076252705,0.00008737633,0.00016944959,0.000036897007,0.00017424286,0.000046954956,0.00009485784,0.000038083108,0.0000734965],"category_scores_gemma":[0.00023073096,0.00004745394,0.000052819498,0.00011677441,0.00021728525,0.00013605357,0.000012087485,0.00013784089,3.710655e-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.00072763726,0.0001902149,0.00041931155,0.000059312646,0.00024377591,8.0094566e-8,0.0011950101,0.66717285,0.0033538106,0.29309192,0.000035637764,0.03351042],"study_design_scores_gemma":[0.006315566,0.0006774945,0.014058503,0.00022420542,0.00067012233,0.00005382979,0.0025672663,0.78686875,0.0057185115,0.18015169,0.0022459952,0.00044803985],"about_ca_topic_score_codex":4.5662148e-7,"about_ca_topic_score_gemma":0.000004424455,"teacher_disagreement_score":0.7423975,"about_ca_system_score_codex":0.000029094417,"about_ca_system_score_gemma":0.000033285134,"threshold_uncertainty_score":0.19351155},"labels":[],"label_agreement":null},{"id":"W2016711560","doi":"10.1007/s10957-005-6547-4","title":"Separable Augmented Lagrangian Algorithm with Multidimensional Scaling for Monotropic Programming","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Augmented Lagrangian method; Scaling; Mathematics; Separable space; Convergence (economics); Theory of computation; Mathematical optimization; Class (philosophy); Lagrangian; Regular polygon; Flow (mathematics); Applied mathematics; Lagrangian relaxation; Algorithm; Computer science; Mathematical analysis; Artificial intelligence; Geometry","score_opus":0.005935164888217662,"score_gpt":0.24406989569141335,"score_spread":0.2381347308031957,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016711560","genre_codex":"methods","genre_gemma":"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.00013100903,0.00018514837,0.9982379,0.0010890883,0.000019503173,0.00024574078,0.00000378681,0.000026848002,0.000060987273],"genre_scores_gemma":[0.012241962,0.00007892178,0.9870348,0.00016522766,0.000135923,0.00005397145,0.000016859007,0.000007784485,0.0002645298],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919915,0.00005463503,0.00033028913,0.00014656658,0.00016118064,0.00010819698],"domain_scores_gemma":[0.99880874,0.00014221332,0.00034189166,0.00011756658,0.0005006004,0.00008896641],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047306693,0.00008870928,0.00013298963,0.00015061046,0.00027274457,0.00008294569,0.0001586801,0.000035416426,0.00002493426],"category_scores_gemma":[0.000024143035,0.00006926038,0.00006067919,0.0003853581,0.000026125017,0.0005384786,0.000021886402,0.00006321,0.0000014145854],"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.000024320481,0.00010879281,0.00002770527,0.0000049457612,0.000061466315,1.8999417e-7,0.00010841133,0.81333005,0.000024468343,0.1100016,0.000035327368,0.0762727],"study_design_scores_gemma":[0.00073767814,0.00005723916,0.000052426672,0.000013604961,0.00006457828,0.000030856376,0.000063482235,0.9859514,0.00018466993,0.0023169562,0.010423261,0.00010381837],"about_ca_topic_score_codex":3.700103e-7,"about_ca_topic_score_gemma":3.725757e-7,"teacher_disagreement_score":0.17262137,"about_ca_system_score_codex":0.000026696878,"about_ca_system_score_gemma":0.00005005788,"threshold_uncertainty_score":0.28243563},"labels":[],"label_agreement":null},{"id":"W2017842236","doi":"10.1007/s10957-006-9033-8","title":"Dynamic Network-Based Discriminatory Pricing","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Merger and Competition Analysis","field":"Economics, Econometrics and Finance","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Dynamic pricing; Nash equilibrium; Computer science; Pricing strategies; Differential (mechanical device); Theory of computation; Microeconomics; Service provider; Scheme (mathematics); Service (business); Mathematical optimization; Economics; Business; Mathematics; Marketing","score_opus":0.007111410002167931,"score_gpt":0.20621788237360592,"score_spread":0.19910647237143797,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017842236","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.0016863918,0.0013682048,0.98833156,0.0003018164,0.000042144824,0.00006218468,0.00000707259,0.000009250911,0.00819138],"genre_scores_gemma":[0.9809824,0.00017170426,0.017886516,0.0002316183,0.00011467194,0.000014373677,0.000019968298,0.000010191485,0.00056855567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993021,0.000028230217,0.00046817688,0.00009588908,0.000026304415,0.000079291945],"domain_scores_gemma":[0.999264,0.00006668278,0.00046897636,0.000103075254,0.00005879053,0.00003847573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006234804,0.000060493505,0.00016310228,0.00015219093,0.00013418049,0.000038843587,0.00008065225,0.00003115965,0.0003671265],"category_scores_gemma":[0.000015409061,0.000062097904,0.00007799359,0.00023651402,0.000037939983,0.00011186715,0.000008157618,0.000068477064,0.000010746988],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000064053074,0.000038782826,0.0011093343,0.000004968503,0.0000111862255,2.173623e-7,0.000009438609,0.44288427,0.000004084744,0.5555967,0.00009465619,0.00023997786],"study_design_scores_gemma":[0.00075762614,0.000048828675,0.0064323884,0.000031106025,0.00008645287,0.000016043969,0.000129045,0.29313377,0.000031994026,0.67202705,0.027022595,0.00028309645],"about_ca_topic_score_codex":0.0000020757086,"about_ca_topic_score_gemma":9.8062e-7,"teacher_disagreement_score":0.979296,"about_ca_system_score_codex":0.000023808258,"about_ca_system_score_gemma":0.000012116849,"threshold_uncertainty_score":0.40197775},"labels":[],"label_agreement":null},{"id":"W2018020262","doi":"10.1007/s10957-005-4722-2","title":"Credibility of Incentive Equilibrium Strategies in Linear-State Differential Games","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Credibility; Incentive; Differential (mechanical device); Mathematical economics; Class (philosophy); State (computer science); Mathematics; Nonlinear system; Theory of computation; Mathematical optimization; Applied mathematics; Computer science; Economics; Microeconomics; Algorithm; Political science; Artificial intelligence; Physics","score_opus":0.01477998174083027,"score_gpt":0.2403004037157513,"score_spread":0.225520421974921,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018020262","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.32069418,0.000620803,0.6761517,0.00016068589,0.000049931507,0.00011872412,0.000049095383,0.000003863699,0.0021509964],"genre_scores_gemma":[0.99421835,0.00046910523,0.0050112396,0.000022769378,0.00009200702,0.000008148763,0.000004987283,0.0000068146564,0.00016656419],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990442,0.000028072978,0.0007097214,0.00011614982,0.000016901076,0.000084988314],"domain_scores_gemma":[0.99907285,0.00009291483,0.00061821693,0.000115777686,0.000060714647,0.00003951696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061869866,0.000068760026,0.0002469374,0.00012627998,0.00002910727,0.00002735345,0.00010717047,0.000039549104,0.00017486139],"category_scores_gemma":[0.000033519576,0.00007047488,0.00005648395,0.00009558291,0.00010014774,0.0004108305,0.000028041768,0.000089613764,0.0000026975433],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007923604,0.00010716917,0.0010392681,0.000013369492,0.00002067659,9.178582e-8,0.0005024141,0.31792387,0.00004817695,0.6792353,0.000008356312,0.0010221001],"study_design_scores_gemma":[0.001265517,0.00009750856,0.003531906,0.000029226312,0.000016638662,0.0000064972814,0.0010343487,0.096233085,0.00069499784,0.89441484,0.0024762608,0.00019919654],"about_ca_topic_score_codex":0.0000039076417,"about_ca_topic_score_gemma":0.0000023128737,"teacher_disagreement_score":0.6735242,"about_ca_system_score_codex":0.00002911455,"about_ca_system_score_gemma":0.000025598913,"threshold_uncertainty_score":0.28738824},"labels":[],"label_agreement":null},{"id":"W2018846914","doi":"10.1007/s10957-008-9440-0","title":"EP Theorem for Dual Linear Complementarity Problems","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":24,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Complementarity (molecular biology); Dual (grammatical number); Linear complementarity problem; Mathematics; Matrix (chemical analysis); Complementarity theory; Time complexity; Property (philosophy); Pure mathematics; Discrete mathematics; Combinatorics; Algebra over a field; Nonlinear system; Physics","score_opus":0.03453408348496048,"score_gpt":0.31512657208195927,"score_spread":0.2805924885969988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018846914","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.0027136367,0.0001166521,0.9944581,0.0006364095,0.000053143216,0.00038108963,0.000023702018,0.00002439126,0.0015928679],"genre_scores_gemma":[0.8097323,0.0014151087,0.1862656,0.0003736577,0.0006499971,0.00010236003,0.00015884443,0.000020946209,0.0012811645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99922776,0.00012137207,0.00031540633,0.000084146304,0.00015024582,0.00010104325],"domain_scores_gemma":[0.9988921,0.0003051812,0.00029316475,0.000056973764,0.00036986306,0.00008267847],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095177593,0.000060225582,0.00010959956,0.00007702257,0.00084545906,0.000023487026,0.00008052327,0.00004856829,0.0000967901],"category_scores_gemma":[0.00008679095,0.000055899774,0.0000488053,0.00017759179,0.00019425483,0.00023311589,0.00000371235,0.00007134587,9.837557e-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.00007542835,0.00010010648,0.0012939094,0.00001159574,0.000027115633,5.2267154e-7,0.0056907134,0.46718028,0.000015815476,0.5243713,0.00041408173,0.00081907766],"study_design_scores_gemma":[0.0073696277,0.00073916535,0.00537201,0.00017334992,0.0005821268,0.00017446403,0.02259263,0.05868508,0.00047201134,0.23975015,0.66295373,0.0011356559],"about_ca_topic_score_codex":0.0000073425063,"about_ca_topic_score_gemma":0.000008764074,"teacher_disagreement_score":0.8081925,"about_ca_system_score_codex":0.000019328725,"about_ca_system_score_gemma":0.00008633759,"threshold_uncertainty_score":0.6502673},"labels":[],"label_agreement":null},{"id":"W2027162300","doi":"10.1023/b:jota.0000042529.80440.04","title":"On Two-Point Boundary Conditions in Optimal Control Problems","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Differential Equations and Numerical Methods","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Differentiable function; Boundary (topology); Combinatorics; Piecewise; Mathematical analysis; Boundary value problem","score_opus":0.019300351015327354,"score_gpt":0.3326374704938885,"score_spread":0.31333711947856113,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027162300","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.012405845,0.00006745681,0.985658,0.0005294891,0.000038667917,0.00035154377,0.000012403275,0.00001514962,0.0009214609],"genre_scores_gemma":[0.8394849,0.00007005722,0.15995751,0.00021919078,0.00008759031,0.00009952079,0.000007451744,0.000017414195,0.000056371875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989669,0.00018888309,0.00049535127,0.00010775809,0.00013272256,0.00010842671],"domain_scores_gemma":[0.9984847,0.0008338569,0.00033167857,0.00012784397,0.00013873985,0.000083190505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095836836,0.00009985644,0.00021648547,0.00018601402,0.00015111658,0.000052269872,0.000097357326,0.000046573896,0.00013653457],"category_scores_gemma":[0.0003280535,0.000082438906,0.00006576664,0.00024938094,0.00010033456,0.0001769223,0.000011271749,0.00018526662,0.000003313229],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050085015,0.0003066294,0.000007131769,0.000009335582,0.00001829693,8.160475e-7,0.000093890005,0.3633973,0.00010687892,0.63495266,0.000015440255,0.0010415633],"study_design_scores_gemma":[0.002170002,0.00017272569,0.000070032685,0.0000775965,0.000059872593,0.000033027158,0.00013557042,0.0043072584,0.0001455158,0.99251944,0.00020679788,0.00010213978],"about_ca_topic_score_codex":0.0000010439777,"about_ca_topic_score_gemma":7.959035e-7,"teacher_disagreement_score":0.82707906,"about_ca_system_score_codex":0.000049354396,"about_ca_system_score_gemma":0.000060909595,"threshold_uncertainty_score":0.3361761},"labels":[],"label_agreement":null},{"id":"W2031535169","doi":"10.1007/s10957-010-9777-z","title":"The Q Method for Symmetric Cone Programming","year":2011,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Second-order cone programming; Interior point method; Cone (formal languages); Semidefinite programming; Eigenvalues and eigenvectors; Invertible matrix; Euclidean geometry; Newton's method; Applied mathematics; Algebra over a field; Pure mathematics; Algorithm; Mathematical optimization; Convex optimization; Geometry; Regular polygon","score_opus":0.06321141336508737,"score_gpt":0.3915314996434185,"score_spread":0.3283200862783311,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031535169","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.000011191764,0.00031891785,0.99795294,0.00016377721,0.00003066553,0.00065985793,0.0000035522723,0.000018535544,0.00084058335],"genre_scores_gemma":[0.00095981755,0.00039560505,0.9977261,0.00003477047,0.00009126277,0.00019990368,0.0000021668602,0.000020579959,0.00056983694],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990158,0.00016898982,0.00042720567,0.00009703731,0.00015099466,0.00013996151],"domain_scores_gemma":[0.9960682,0.0025352864,0.000458512,0.00016315229,0.0006921216,0.00008277412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025000293,0.00008058453,0.00014274308,0.00014094893,0.00042205295,0.00005230914,0.00019518464,0.00004612057,0.000033406137],"category_scores_gemma":[0.0012741664,0.000054516895,0.000062945546,0.00043459123,0.00009779349,0.00016779783,0.000028383984,0.00012255003,7.2959097e-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.000097372125,0.000091980895,0.000004604269,0.000019409781,0.000048278194,2.390641e-7,0.00024017046,0.0071854815,0.000009797278,0.8811904,0.00008901939,0.11102323],"study_design_scores_gemma":[0.0009227944,0.00017523377,0.000009721509,0.000019914287,0.00012234639,0.000081765065,0.0012632512,0.07918323,0.00069497916,0.8952189,0.022159409,0.00014844265],"about_ca_topic_score_codex":1.7921101e-7,"about_ca_topic_score_gemma":1.9318345e-7,"teacher_disagreement_score":0.11087479,"about_ca_system_score_codex":0.000021734859,"about_ca_system_score_gemma":0.000045231824,"threshold_uncertainty_score":0.32461327},"labels":[],"label_agreement":null},{"id":"W2033978783","doi":"10.1023/b:jota.0000005040.78280.a6","title":"Agreeability and Time Consistency in Linear-State Differential Games","year":2003,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Consistency (knowledge bases); Theory of computation; Differential (mechanical device); State (computer science); Mathematics; Mathematical economics; Rationality; Time consistency; Applied mathematics; Mathematical optimization; Economics; Algorithm; Discrete mathematics; Actuarial science; Epistemology","score_opus":0.011273252807169397,"score_gpt":0.20980957584640722,"score_spread":0.19853632303923782,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033978783","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.25196955,0.001823896,0.7366046,0.0002190275,0.000083675186,0.00023484971,0.000042768428,0.0000072541075,0.0090144435],"genre_scores_gemma":[0.99364513,0.0008549886,0.0047300025,0.00005893653,0.000031317508,0.000011139618,0.0000029737503,0.000008089496,0.00065739057],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992207,0.000042985357,0.00051616266,0.00012714144,0.000011451234,0.00008153244],"domain_scores_gemma":[0.9993423,0.00012642935,0.00033705132,0.00010326594,0.00003490851,0.000056015684],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008324659,0.00006832819,0.00021990605,0.0000983849,0.00006641646,0.000030704177,0.000052542004,0.000038799724,0.00025838296],"category_scores_gemma":[0.00009564947,0.00006969335,0.000036675214,0.00007318038,0.00009588495,0.00016098411,0.000013304508,0.00008161557,0.0000065024446],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027481203,0.00006332551,0.002453015,0.0000093490235,0.000016851069,2.6540644e-7,0.00021699216,0.014102113,0.00001238687,0.98231316,0.000010565998,0.00077449693],"study_design_scores_gemma":[0.00084746437,0.000051560284,0.0018696734,0.000011954356,0.0000116248075,0.000030932217,0.00015823252,0.011826881,0.00005587498,0.98046803,0.0045144674,0.00015331784],"about_ca_topic_score_codex":0.0000016532881,"about_ca_topic_score_gemma":5.7382493e-7,"teacher_disagreement_score":0.7416756,"about_ca_system_score_codex":0.00001850694,"about_ca_system_score_gemma":0.000015359832,"threshold_uncertainty_score":0.2842012},"labels":[],"label_agreement":null},{"id":"W2035396114","doi":"10.1023/b:jota.0000042522.65261.51","title":"Conic Formulation for l p -Norm Optimization","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Duality gap; Conic section; Mathematics; Duality (order theory); Conic optimization; Norm (philosophy); Strong duality; Theory of computation; Weak duality; Optimization problem; Perturbation function; Mathematical optimization; Interior point method; Wolfe duality; Applied mathematics; Discrete mathematics; Algorithm; Convex optimization; Geometry; Convex analysis","score_opus":0.03102397558523285,"score_gpt":0.36277640587176224,"score_spread":0.3317524302865294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035396114","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.00017515007,0.00015001436,0.99790144,0.00041531335,0.00004644707,0.00086289865,0.000013365291,0.000039019153,0.00039634883],"genre_scores_gemma":[0.027898662,0.00040507392,0.97089,0.000096321244,0.0002114143,0.00014888644,0.00004063256,0.000041589647,0.00026744528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987446,0.000069632224,0.000626564,0.00015838776,0.00023072747,0.00017009662],"domain_scores_gemma":[0.9974738,0.00068052596,0.0006098713,0.00018289707,0.0009342975,0.000118641634],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010502472,0.00013513978,0.0002260048,0.00024092066,0.0003014677,0.0000681587,0.0001581712,0.00009750048,0.000082834595],"category_scores_gemma":[0.0007113233,0.000123726,0.00008715861,0.0003689509,0.000059783037,0.00058483914,0.000026745112,0.00013535214,0.0000013477226],"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.000069951064,0.00007536451,0.0000029911723,0.000023932498,0.00002099982,1.8289767e-7,0.00008811164,0.5994488,0.000024108476,0.3987788,0.00002090926,0.0014458646],"study_design_scores_gemma":[0.0030069791,0.00020217287,0.000006588147,0.000056331177,0.00011232633,0.00008000666,0.00037407127,0.25877422,0.0008564258,0.73498124,0.0013250256,0.00022465218],"about_ca_topic_score_codex":2.2910784e-7,"about_ca_topic_score_gemma":3.286418e-7,"teacher_disagreement_score":0.34067458,"about_ca_system_score_codex":0.00010999289,"about_ca_system_score_gemma":0.00012895951,"threshold_uncertainty_score":0.50454},"labels":[],"label_agreement":null},{"id":"W2036651327","doi":"10.1007/s10957-012-0228-x","title":"Second-Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Constraint (computer-aided design); Theory of computation; Mathematical optimization; Mathematics; Order (exchange); Mathematical economics; Independence (probability theory); Optimality criterion; Nonlinear system; Economics; Algorithm; Statistics","score_opus":0.014738101471121593,"score_gpt":0.275257527337355,"score_spread":0.2605194258662334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036651327","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000348876,0.000061721825,0.99694794,0.0006609176,0.000028220207,0.00036077012,0.000013790636,0.000030330399,0.0015474107],"genre_scores_gemma":[0.27507666,0.000013850575,0.72403204,0.00027157794,0.0001361445,0.00012963924,0.000041136853,0.000010532056,0.00028842333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990545,0.0000939298,0.00039697732,0.00012635828,0.00016510743,0.00016315735],"domain_scores_gemma":[0.9982993,0.00033266575,0.00038607928,0.00017682846,0.00063150155,0.00017361977],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00095152203,0.00010653112,0.00018442102,0.000118252334,0.00018226187,0.00013293806,0.00021668758,0.000051598094,0.00029416042],"category_scores_gemma":[0.0000730429,0.000081642735,0.00006844688,0.0004254134,0.00014761741,0.0009025504,0.00003279767,0.00007988274,0.0000039121064],"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.000020958201,0.000286607,0.00012905577,0.000021422873,0.00008772913,1.3888618e-7,0.00019838286,0.060185555,0.00003302483,0.9372852,0.000060687435,0.0016912534],"study_design_scores_gemma":[0.0037503866,0.000533447,0.00087073253,0.00010578517,0.00064494077,0.00080180704,0.0009849693,0.7326011,0.0007825374,0.24872762,0.009321503,0.00087519205],"about_ca_topic_score_codex":5.7136305e-8,"about_ca_topic_score_gemma":8.0310485e-8,"teacher_disagreement_score":0.68855757,"about_ca_system_score_codex":0.000018417677,"about_ca_system_score_gemma":0.00008428814,"threshold_uncertainty_score":0.3329294},"labels":[],"label_agreement":null},{"id":"W2047707165","doi":"10.1007/s10957-007-9265-2","title":"Merit-Function Piecewise SQP Algorithm for Mathematical Programs with Equilibrium Constraints","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Piecewise; Theory of computation; Mathematics; Sequential quadratic programming; Mathematical optimization; Complementarity theory; Constraint (computer-aided design); Complementarity (molecular biology); Stationary point; Point (geometry); Function (biology); Independence (probability theory); Piecewise linear function; Algorithm; Quadratic programming; Nonlinear system; Mathematical analysis","score_opus":0.008362994103040132,"score_gpt":0.2365910185940447,"score_spread":0.22822802449100454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047707165","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.00020820668,0.00013183671,0.9974306,0.00003800383,0.000043521115,0.0005709292,0.0000036158874,0.00009120907,0.0014820592],"genre_scores_gemma":[0.059077576,0.000045050278,0.9403702,0.00005141521,0.00018633793,0.000092860566,0.000023654662,0.000042318854,0.000110565314],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991521,0.00001852734,0.00043874752,0.00009199426,0.00013051415,0.00016808328],"domain_scores_gemma":[0.99913347,0.0002449438,0.00015034765,0.00009816247,0.00023133322,0.00014177135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008640285,0.00012173947,0.00018758759,0.00010164766,0.00008270528,0.000068081696,0.000076283075,0.00007036137,0.00006619823],"category_scores_gemma":[0.000037327474,0.00009706991,0.00005322955,0.00021183361,0.00015002822,0.0002182071,0.000008279022,0.000106469415,0.0000021829853],"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.00010069493,0.0002612072,0.0000073643837,0.00019366918,0.00015032077,0.0000016422549,0.00021848826,0.16769515,0.00020594225,0.21510261,0.00005600086,0.6160069],"study_design_scores_gemma":[0.002465336,0.0006083931,0.00001084866,0.00020620144,0.00044745422,0.00038462042,0.0016917486,0.89220226,0.001304738,0.09235492,0.007814211,0.00050923787],"about_ca_topic_score_codex":2.1881538e-8,"about_ca_topic_score_gemma":6.759034e-8,"teacher_disagreement_score":0.72450715,"about_ca_system_score_codex":0.000020507081,"about_ca_system_score_gemma":0.000017623619,"threshold_uncertainty_score":0.3958396},"labels":[],"label_agreement":null},{"id":"W2052424630","doi":"10.1007/s10957-011-9886-3","title":"Optimal Keyword Bids in Search-Based Advertising with Stochastic Advertisement Positions","year":2011,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Selection (genetic algorithm); Advertising; Budget constraint; Probabilistic logic; Construct (python library); Constraint (computer-aided design); Process (computing); Search advertising; Keyword search; Operations research; Online advertising; Microeconomics; Economics; Business; Information retrieval; Mathematics; The Internet; World Wide Web; Artificial intelligence","score_opus":0.014921492264076896,"score_gpt":0.2335077405867891,"score_spread":0.2185862483227122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052424630","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.08084334,0.00010046179,0.9167018,0.00013533083,0.000025049725,0.0002468821,0.0000014460105,0.000018472969,0.0019272083],"genre_scores_gemma":[0.98659813,0.000011886149,0.013015828,0.00020894627,0.000084616244,0.000028290668,0.000008451676,0.00001468246,0.000029193856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992911,0.000030447578,0.000300665,0.00011384123,0.00013663329,0.00012726914],"domain_scores_gemma":[0.99940306,0.00007279683,0.00020162831,0.00010588989,0.00019348461,0.000023132361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053627824,0.000098685065,0.00012920285,0.0003778319,0.0001685936,0.000072330804,0.0001107395,0.000031035408,0.00027844447],"category_scores_gemma":[0.000020001344,0.000083957624,0.000034994504,0.0004501666,0.00007599971,0.00054941716,0.000029455043,0.00013228097,0.0000033916579],"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.0008239095,0.00051147485,0.013259499,0.00007527632,0.000044664706,0.00001412553,0.00035451047,0.92400604,0.0002064433,0.03926335,0.000024461133,0.021416228],"study_design_scores_gemma":[0.015799964,0.0006454695,0.23772465,0.0024064805,0.0026524148,0.00030585108,0.0076005687,0.70773524,0.0010009488,0.017903361,0.0035966514,0.0026283974],"about_ca_topic_score_codex":0.00001906775,"about_ca_topic_score_gemma":0.0000065529125,"teacher_disagreement_score":0.90575475,"about_ca_system_score_codex":0.000020351208,"about_ca_system_score_gemma":0.000039439034,"threshold_uncertainty_score":0.34236926},"labels":[],"label_agreement":null},{"id":"W2056214914","doi":"10.1007/s10957-008-9454-7","title":"Advertising Strategies in a Differential Game with Negative Competitor’s Interference","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Business Strategy and Innovation","field":"Business, Management and Accounting","cited_by":43,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Goodwill; Differential game; Nash equilibrium; Advertising; Stochastic game; Differential (mechanical device); Strategy; Stock (firearms); Mathematical economics; Economics; Microeconomics; Game theory; Mathematics; Business; Mathematical optimization","score_opus":0.011663429201388879,"score_gpt":0.2236923759240588,"score_spread":0.21202894672266992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2056214914","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.1833927,0.000038498587,0.8129537,0.00020350117,0.000041446576,0.0001303462,5.407525e-7,0.000014111629,0.003225145],"genre_scores_gemma":[0.99765897,0.000050931096,0.0018569637,0.00011567263,0.00026309054,0.000011888062,0.000007188459,0.0000075719167,0.000027752756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994448,0.000017108938,0.00028098992,0.00008810451,0.0000913739,0.000077630124],"domain_scores_gemma":[0.9992171,0.000051162595,0.00034951215,0.0000607007,0.00031395358,0.0000075533585],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015539989,0.00008635879,0.00013027019,0.00021848464,0.00012705021,0.000109641434,0.00008668293,0.000034699264,0.000086991844],"category_scores_gemma":[0.000024404088,0.00006720761,0.000016892014,0.00046633199,0.000119334996,0.0015101165,0.000018610981,0.0001246997,0.0000021098513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004435375,0.00017923712,0.004105631,0.000057706176,0.00002598061,0.0000067410533,0.00026709496,0.14892806,0.0004350852,0.843709,0.0000330928,0.0018088565],"study_design_scores_gemma":[0.015292866,0.00050489383,0.3443722,0.002105022,0.0005016301,0.0008798571,0.020369649,0.21066277,0.001542044,0.39220974,0.00913021,0.002429095],"about_ca_topic_score_codex":0.000009032373,"about_ca_topic_score_gemma":0.0000053919834,"teacher_disagreement_score":0.8142662,"about_ca_system_score_codex":0.000011983805,"about_ca_system_score_gemma":0.000041424304,"threshold_uncertainty_score":0.2740647},"labels":[],"label_agreement":null},{"id":"W2057756204","doi":"10.1007/s10957-013-0345-1","title":"The Shape of the Borwein–Affleck–Girgensohn Function Generated by Completely Monotone and Bernstein Functions","year":2013,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Functional Equations Stability Results","field":"Mathematics","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Convexity; Mathematics; Monotone polygon; Theory of computation; Reciprocal; Function (biology); Monotonic function; Pure mathematics; Combinatorics; Applied mathematics; Discrete mathematics; Mathematical analysis; Algorithm; Geometry","score_opus":0.017223021333610238,"score_gpt":0.24990241541562913,"score_spread":0.2326793940820189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2057756204","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.14140357,0.00089966157,0.85264707,0.002904228,0.00015891281,0.0011494241,0.0000778162,0.000025937965,0.0007334025],"genre_scores_gemma":[0.9900505,0.00039336737,0.007262195,0.00018291427,0.0001651104,0.00021537663,0.00003363428,0.00003052637,0.0016663986],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99859095,0.0002679311,0.00065457553,0.00013549296,0.00023774279,0.00011328863],"domain_scores_gemma":[0.9968762,0.0013651159,0.0006495524,0.00027980577,0.00075624295,0.00007308566],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008658801,0.00012213472,0.00017449797,0.0000618048,0.0006870999,0.00008178096,0.00015961881,0.00007014627,0.00017973996],"category_scores_gemma":[0.00052023464,0.000074820186,0.00007426647,0.00037136566,0.0002896937,0.00023684777,0.00004775202,0.00017963021,0.0000038953744],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054845633,0.0008226128,0.00088935316,0.00011420832,0.0005491005,1.327594e-7,0.0006363908,0.062327128,0.022160543,0.86202365,0.024920989,0.02500746],"study_design_scores_gemma":[0.0030404176,0.0005647881,0.0056639398,0.0001147442,0.00087968545,0.00015146716,0.003406927,0.19243677,0.002915135,0.7463925,0.043850128,0.00058350305],"about_ca_topic_score_codex":0.000006155156,"about_ca_topic_score_gemma":0.0000037990612,"teacher_disagreement_score":0.8486469,"about_ca_system_score_codex":0.000031944703,"about_ca_system_score_gemma":0.00005804062,"threshold_uncertainty_score":0.5284686},"labels":[],"label_agreement":null},{"id":"W2059083091","doi":"10.1007/s10957-014-0659-7","title":"On the Finite Convergence of a Projected Cutter Method","year":2014,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Subgradient method; Convergence (economics); Regular polygon; Mathematics; Projection (relational algebra); Point (geometry); Limiting; Set (abstract data type); Mathematical optimization; Fixed point; Variational inequality; Applied mathematics; Finite set; Computer science; Algorithm; Mathematical analysis; Geometry; Engineering; Economics","score_opus":0.008663999138381527,"score_gpt":0.2577945133223376,"score_spread":0.24913051418395607,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059083091","genre_codex":"methods","genre_gemma":"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.00008161038,0.000016461656,0.99650985,0.002314543,0.000025464436,0.00010457274,0.000001618847,0.0000090618805,0.0009368178],"genre_scores_gemma":[0.42977598,0.000111643894,0.56742114,0.002149906,0.000094536656,0.000035001744,0.000005003418,0.000008492951,0.00039830143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990074,0.00034830385,0.0003254216,0.000098851,0.00016498985,0.00005501986],"domain_scores_gemma":[0.9975241,0.0013854995,0.00045664722,0.00020143641,0.0003937973,0.000038516428],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013310807,0.00006258313,0.00011952488,0.00012846793,0.000126403,0.000045378485,0.00031263687,0.000028643313,0.00010307439],"category_scores_gemma":[0.00032057916,0.00003970405,0.000057597063,0.00052822614,0.000040182436,0.00018568875,0.000032571686,0.00007954361,0.0000029938426],"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.000008062085,0.00003282923,0.00001382817,0.0000023501825,0.000019017429,3.0617002e-8,0.000104525585,0.3623118,0.000031467378,0.63599646,0.000072543895,0.0014070692],"study_design_scores_gemma":[0.00019094127,0.000059032503,0.00010828334,0.000012019543,0.000033591252,0.0000075635426,0.000035989437,0.90544343,0.00056580856,0.09218461,0.0012988223,0.00005993611],"about_ca_topic_score_codex":4.5689302e-7,"about_ca_topic_score_gemma":7.0509046e-8,"teacher_disagreement_score":0.54381186,"about_ca_system_score_codex":0.000006431329,"about_ca_system_score_gemma":0.00003529787,"threshold_uncertainty_score":0.16190842},"labels":[],"label_agreement":null},{"id":"W2064437833","doi":"10.1007/s10957-013-0349-x","title":"Maximum Entropy Estimates for Risk-Neutral Probability Measures with Non-Strictly-Convex Data","year":2013,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convexity; Bounded function; Mathematics; Probability measure; Mathematical economics; Probability density function; Convex analysis; Duality (order theory); Entropy (arrow of time); Convex optimization; Entropy maximization; Mathematical optimization; Econometrics; Principle of maximum entropy; Regular polygon; Economics; Financial economics; Statistics; Combinatorics; Mathematical analysis","score_opus":0.02520487302510333,"score_gpt":0.23136289879665495,"score_spread":0.20615802577155162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064437833","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.0012332161,0.00078330695,0.9960723,0.00041229549,0.000038849084,0.0008984378,0.0002382238,0.000013544742,0.0003098259],"genre_scores_gemma":[0.47434688,0.0004310347,0.52335984,0.00017428654,0.00051294983,0.0009618559,0.000119960074,0.0000367973,0.000056385255],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990092,0.000007378876,0.00055189774,0.00025368447,0.00003444711,0.00014341786],"domain_scores_gemma":[0.99819654,0.0002551776,0.0008300884,0.0003480083,0.0002778361,0.000092354916],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000694293,0.00011559017,0.0002693809,0.00009602081,0.00025278548,0.00010289578,0.00033538806,0.000060440565,0.000042354633],"category_scores_gemma":[0.00024732543,0.00009897891,0.000043597185,0.00023095528,0.00010910741,0.00043681767,0.000041068477,0.000112169066,0.000011949824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006839965,0.00019219171,0.0016615236,0.000043076303,0.00007521236,6.424161e-8,0.000087324384,0.01781614,0.000019167577,0.97508705,0.00025274794,0.0046971324],"study_design_scores_gemma":[0.00059799367,0.0001103473,0.0014873052,0.0000110991505,0.000062559375,0.000010985555,0.00007350708,0.028934203,0.000056782505,0.96556985,0.0029367974,0.00014858942],"about_ca_topic_score_codex":0.000013200802,"about_ca_topic_score_gemma":0.0000011757722,"teacher_disagreement_score":0.47311366,"about_ca_system_score_codex":0.000022370847,"about_ca_system_score_gemma":0.000043119275,"threshold_uncertainty_score":0.4036243},"labels":[],"label_agreement":null},{"id":"W2065752008","doi":"10.1007/s10957-012-0156-9","title":"Cooperating and Non-cooperating Firms in Inventive and Absorptive Research","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Duopoly; Joint venture; Absorptive capacity; Industrial organization; Investment (military); Business; Microeconomics; Production (economics); Unit (ring theory); Computer science; Economics; Mathematics; Commerce; Cournot competition","score_opus":0.040221879095096405,"score_gpt":0.29345106196955145,"score_spread":0.25322918287445506,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2065752008","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.8703577,0.03158675,0.09322488,0.00049275527,0.000046514237,0.00037985292,0.000016569014,0.0000053650956,0.0038896182],"genre_scores_gemma":[0.99085265,0.005062338,0.0036896886,0.00006230411,0.00009577125,0.000019185924,0.0000038566563,0.000006639294,0.00020757875],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993383,0.00005210053,0.0003658411,0.00010076658,0.000028191102,0.00011477236],"domain_scores_gemma":[0.9994074,0.00017491872,0.0002039267,0.000055850236,0.00008221645,0.00007566671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020445515,0.000057844165,0.00016730867,0.00025882255,0.00019775705,0.00007701978,0.000041849886,0.000042231135,0.000046968253],"category_scores_gemma":[0.000116235795,0.000053572858,0.000019906063,0.00028416028,0.00010912237,0.00040866583,0.000035600024,0.00015198154,0.0000036379042],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019363262,0.0000950934,0.025737451,0.000014767385,0.000040545186,3.8764477e-7,0.003630381,0.005971779,0.000082350605,0.9633227,0.00003892451,0.0010462564],"study_design_scores_gemma":[0.005468169,0.00064775447,0.09146269,0.00035338497,0.00016777728,0.00015710917,0.033650972,0.3401841,0.0016473365,0.51881886,0.006118247,0.0013236338],"about_ca_topic_score_codex":0.000010045566,"about_ca_topic_score_gemma":0.0000026314478,"teacher_disagreement_score":0.44450387,"about_ca_system_score_codex":0.000021946975,"about_ca_system_score_gemma":0.000008569952,"threshold_uncertainty_score":0.21846378},"labels":[],"label_agreement":null},{"id":"W2066559849","doi":"10.1007/s10957-011-9971-7","title":"Existence and Uniqueness of Solutions for Homogeneous Cone Complementarity Problems","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Nonlinear complementarity problem; Uniqueness; Complementarity (molecular biology); Homogeneous; Complementarity theory; Mixed complementarity problem; Mathematics; Monotone polygon; Nonlinear system; Homogeneous function; Cone (formal languages); Mathematical analysis; Applied mathematics; Mathematical optimization; Geometry; Physics; Algorithm; Combinatorics","score_opus":0.03145824916363664,"score_gpt":0.2753879869377373,"score_spread":0.24392973777410065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066559849","genre_codex":"methods","genre_gemma":"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.0005875546,0.00054878456,0.9979921,0.0004652208,0.000027694532,0.00022407468,0.00001707009,0.000009141985,0.00012834281],"genre_scores_gemma":[0.48660722,0.00044758085,0.5125562,0.0001676159,0.00007198834,0.0000533465,0.000019731031,0.000005823325,0.00007047642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992456,0.000088181536,0.00036309546,0.00008702224,0.000103357466,0.00011274327],"domain_scores_gemma":[0.9986784,0.00027071152,0.0004096125,0.000118553646,0.0004340701,0.0000886656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010668417,0.000065505,0.00014597124,0.00011513209,0.00024077648,0.000039407973,0.00015903683,0.00002995578,0.000017787019],"category_scores_gemma":[0.00004727908,0.000058132173,0.000044770968,0.00026178738,0.00007346833,0.00044849984,0.000057195743,0.000042116084,2.1027836e-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.000009292889,0.00012602088,0.00030940413,0.000021610074,0.000041729698,2.5217524e-8,0.00026374016,0.08275919,0.00012399409,0.9143582,0.000019990215,0.0019668287],"study_design_scores_gemma":[0.0022233555,0.00030257768,0.0030729356,0.00007544311,0.00045190824,0.00022127251,0.00071151805,0.70806825,0.0018217526,0.2726297,0.009925745,0.00049551047],"about_ca_topic_score_codex":0.000001931888,"about_ca_topic_score_gemma":7.279993e-7,"teacher_disagreement_score":0.64172846,"about_ca_system_score_codex":0.000014258168,"about_ca_system_score_gemma":0.000040755713,"threshold_uncertainty_score":0.23705612},"labels":[],"label_agreement":null},{"id":"W2071414521","doi":"10.1023/b:jota.0000042599.46775.a9","title":"Robust H∞ Filtering for a Class of Nonlinear Discrete-Time Markovian Jump Systems","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Nonlinear system; Control theory (sociology); Filtering problem; Lipschitz continuity; Theory of computation; Filter (signal processing); Discrete time and continuous time; Applied mathematics; Jump; Bounded function; Norm (philosophy); Markov process; Mathematical analysis; Kalman filter; Computer science; Algorithm; Extended Kalman filter","score_opus":0.00881651396054664,"score_gpt":0.211560146234998,"score_spread":0.20274363227445136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071414521","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.003248399,0.00063214824,0.99505067,0.000076929464,0.00007584993,0.00038257716,0.00004007696,0.000023475783,0.00046989508],"genre_scores_gemma":[0.96143425,0.00013425254,0.03783061,0.000017338403,0.00034014226,0.000106624866,0.000016595803,0.000028487648,0.00009169996],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926114,0.000033054675,0.00045790823,0.00007142861,0.00008552443,0.0000909541],"domain_scores_gemma":[0.9992705,0.00019036864,0.00019227315,0.0001213743,0.0001657261,0.00005975692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052477664,0.00008612468,0.00022513674,0.00008209543,0.000066127555,0.000032445903,0.000105384766,0.000056822406,0.0000104417],"category_scores_gemma":[0.000041550877,0.00007648024,0.000076137105,0.00011556877,0.00004220784,0.00014954488,0.0000075583084,0.00006693793,7.714522e-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.000057705347,0.000024885558,0.000009502394,0.00013301817,0.000053138563,1.726767e-7,0.00011165835,0.9843071,0.0013681873,0.0134498775,0.000016311678,0.00046845825],"study_design_scores_gemma":[0.0021834564,0.0001816389,0.0000425286,0.00028158812,0.0001560154,0.000069253874,0.00095189956,0.9851772,0.0010458982,0.004446454,0.005213452,0.0002505999],"about_ca_topic_score_codex":0.0000011651007,"about_ca_topic_score_gemma":3.362256e-7,"teacher_disagreement_score":0.95818585,"about_ca_system_score_codex":0.000037890946,"about_ca_system_score_gemma":0.00002553522,"threshold_uncertainty_score":0.31187737},"labels":[],"label_agreement":null},{"id":"W2072337808","doi":"10.1007/s10957-010-9758-2","title":"Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming","year":2010,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Jacobian matrix and determinant; Mathematics; Theory of computation; Cone (formal languages); Interior point method; Constraint (computer-aided design); Applied mathematics; Mathematical optimization; Algorithm; Geometry","score_opus":0.033910721493332394,"score_gpt":0.3880796826192206,"score_spread":0.3541689611258882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072337808","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.0035019938,0.000052578198,0.99488145,0.0003473706,0.000076741846,0.0008894611,0.000023199424,0.000018587614,0.00020859219],"genre_scores_gemma":[0.093432315,0.00009779831,0.90575475,0.00005271456,0.00019626175,0.00019249159,0.000024291747,0.000029786484,0.00021956702],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99884444,0.000095243086,0.0005569943,0.00014515482,0.00018165562,0.00017652378],"domain_scores_gemma":[0.9973401,0.0012876013,0.00040158213,0.00018016543,0.0006643106,0.00012626256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015865347,0.000106406296,0.00021711762,0.00044144737,0.00021920621,0.000052382646,0.00015084428,0.000098641045,0.00008343015],"category_scores_gemma":[0.0017130986,0.00010088187,0.00006693976,0.00065594097,0.00014414046,0.00019997738,0.000032184646,0.00034758623,0.0000010865219],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009613747,0.0006382718,0.00014402806,0.000093837916,0.000044069053,0.0000021428348,0.00024762825,0.08604321,0.0010039188,0.89693326,0.00006667784,0.014686801],"study_design_scores_gemma":[0.0040059225,0.00026939262,0.0001837486,0.00010772365,0.00016615931,0.00021824027,0.0009736481,0.29230988,0.0014063314,0.6885334,0.0113630835,0.00046241324],"about_ca_topic_score_codex":4.1407827e-7,"about_ca_topic_score_gemma":0.0000032805474,"teacher_disagreement_score":0.20839982,"about_ca_system_score_codex":0.00003391847,"about_ca_system_score_gemma":0.00009320689,"threshold_uncertainty_score":0.41138434},"labels":[],"label_agreement":null},{"id":"W2074089254","doi":"10.1023/b:jota.0000026133.56615.cf","title":"Zero-Sum Stochastic Games with Partial Information","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":65,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Zero-sum game; Zero (linguistics); Theory of computation; Example of a game without a value; Mathematical economics; Space (punctuation); State (computer science); State space; Complete information; Mathematical optimization; Game theory; Repeated game; Combinatorial game theory; Computer science; Statistics; Algorithm","score_opus":0.020904524936494494,"score_gpt":0.3071967091041004,"score_spread":0.28629218416760593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074089254","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.010327405,0.00006609105,0.9872659,0.0009206442,0.00003414897,0.00027023087,0.000011001497,0.000019736237,0.0010848744],"genre_scores_gemma":[0.9782108,0.000028886428,0.021140616,0.00029742418,0.000104843275,0.000060167084,0.000008495413,0.000008011343,0.00014072888],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99842334,0.00012729519,0.0007196511,0.00013513879,0.00046936696,0.00012518738],"domain_scores_gemma":[0.9975559,0.0005935343,0.0007828707,0.000291368,0.00063288596,0.00014340361],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021460988,0.000114198294,0.00019736745,0.0002583968,0.0003019989,0.0002292927,0.0003356407,0.00005507907,0.00013154172],"category_scores_gemma":[0.0004389373,0.000077163604,0.00005873074,0.00066261116,0.00021499135,0.0011649407,0.00003268041,0.00014859831,0.000054606757],"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.00009589277,0.000048935537,0.000018683244,0.0000016938711,0.000012055316,2.094424e-7,0.00031857193,0.5744827,0.000030266436,0.41854337,0.00004885148,0.0063987914],"study_design_scores_gemma":[0.0016273948,0.00023892746,0.00030399428,0.000047672125,0.00010285286,0.0002645916,0.002274515,0.0033421158,0.0006510087,0.9746274,0.016280463,0.00023908308],"about_ca_topic_score_codex":5.431846e-7,"about_ca_topic_score_gemma":3.2352716e-7,"teacher_disagreement_score":0.9678834,"about_ca_system_score_codex":0.000024677087,"about_ca_system_score_gemma":0.00011795313,"threshold_uncertainty_score":0.31466407},"labels":[],"label_agreement":null},{"id":"W2074318081","doi":"10.1007/s10957-008-9413-3","title":"A Fast MPC Algorithm Using Nonfeasible Active Set Methods","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; Ontario Tech University","funders":"","keywords":"Model predictive control; Quadratic programming; Theory of computation; Active set method; Mathematical optimization; Set (abstract data type); Mathematics; Minification; Quadratic equation; Algorithm; Computer science; Control (management); Nonlinear programming; Artificial intelligence","score_opus":0.01808822104082608,"score_gpt":0.30219349671273527,"score_spread":0.2841052756719092,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074318081","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.00039717506,0.0005223162,0.9981042,0.000018191698,0.00007599202,0.00023115064,0.000012160204,0.000051689363,0.00058710907],"genre_scores_gemma":[0.03501152,0.00061048986,0.96394837,0.000032318072,0.00023259174,0.000032601587,0.00001007518,0.000035176734,0.00008685956],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919164,0.00013477152,0.0003691779,0.00009227356,0.00009976537,0.00011234208],"domain_scores_gemma":[0.9991736,0.00016136984,0.0002289732,0.00012163477,0.00022903694,0.00008542678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003807461,0.00011598675,0.00020851316,0.00015699533,0.00018523567,0.000020998099,0.000091013695,0.00006706155,0.000027631937],"category_scores_gemma":[0.000038072943,0.00011236337,0.00005103884,0.0002996245,0.000054746026,0.00043915783,0.000012627758,0.00013648269,0.0000013310917],"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.000014555035,0.00001593204,0.0000074163404,0.000008922464,0.000049544662,0.0000012526467,0.00028339057,0.9673535,0.0009155372,0.0020770647,0.000012978984,0.02925988],"study_design_scores_gemma":[0.0005162868,0.000023212751,0.000023758686,0.000022880455,0.0000609262,0.00042532233,0.00038775444,0.9933688,0.0012666496,0.0023065924,0.0014537688,0.00014404373],"about_ca_topic_score_codex":5.4574105e-7,"about_ca_topic_score_gemma":6.051962e-8,"teacher_disagreement_score":0.034614343,"about_ca_system_score_codex":0.00006456381,"about_ca_system_score_gemma":0.00003340525,"threshold_uncertainty_score":0.45820454},"labels":[],"label_agreement":null},{"id":"W2081400262","doi":"10.1007/s10957-013-0439-9","title":"Sensitivity Analysis of Merit Function in Solving Nonlinear Equations by Optimization","year":2013,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Nanofluid Flow and Heat Transfer","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Hessian matrix; Scaling; Jacobian matrix and determinant; Nonlinear system; Mathematics; Norm (philosophy); Applied mathematics; Diagonal; Mathematical optimization; Mathematical analysis; Physics; Geometry","score_opus":0.004969220639500327,"score_gpt":0.2046621721091188,"score_spread":0.19969295146961846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081400262","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.010708219,0.00033607672,0.98839974,0.000061573475,0.000030144343,0.00018175146,0.000018256284,0.000019301659,0.00024493216],"genre_scores_gemma":[0.97302353,0.00069836504,0.026041918,0.000034377063,0.000049616014,0.00003150526,0.00007756455,0.000015803413,0.00002728891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99920297,0.00007625717,0.00045333238,0.0000785268,0.00010317894,0.0000857096],"domain_scores_gemma":[0.99931675,0.00023231356,0.00008616079,0.00009591753,0.00021626009,0.000052606647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046028584,0.00008466,0.00021852506,0.0004052501,0.000057628207,0.000027709553,0.00004293696,0.000068428555,0.00020550644],"category_scores_gemma":[0.000031460684,0.00008338686,0.000068779635,0.00084255566,0.000034040087,0.00036899545,0.0000051348547,0.00010358171,0.0000013171783],"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.000010412609,0.000056605924,0.00023245554,0.0000142112885,0.00015323094,1.0679852e-7,0.00009554025,0.98851174,0.006053663,0.0031771297,0.000045715537,0.001649178],"study_design_scores_gemma":[0.0002342209,0.000021257392,0.00049153523,0.000013815841,0.0003380312,0.0000018608921,0.00011611907,0.997409,0.0008832729,0.00031211754,0.000096394244,0.00008237568],"about_ca_topic_score_codex":0.0000064851256,"about_ca_topic_score_gemma":0.000003820188,"teacher_disagreement_score":0.9623578,"about_ca_system_score_codex":0.000025520765,"about_ca_system_score_gemma":0.000014717587,"threshold_uncertainty_score":0.34004176},"labels":[],"label_agreement":null},{"id":"W2081691140","doi":"10.1007/s10957-006-9035-6","title":"Duality of Implicit Complementarity Problems by Using Inversions and Scalar Derivatives","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Iterative Methods for Nonlinear Equations","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Infinitesimal; Theory of computation; Complementarity (molecular biology); Duality (order theory); Scalar (mathematics); Hilbert space; Pure mathematics; Mathematical analysis; Algorithm; Geometry","score_opus":0.05819998788388162,"score_gpt":0.367817745985324,"score_spread":0.3096177581014424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081691140","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.12587674,0.00013113455,0.87336224,0.00012995253,0.000008559549,0.00026302424,0.000068629095,0.0000065922345,0.00015311474],"genre_scores_gemma":[0.35714754,0.00004807586,0.64259106,0.000038667495,0.000058425707,0.000012736134,0.000034074274,0.000014168368,0.00005528858],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9988926,0.00029458987,0.00052507664,0.00009382275,0.000117407515,0.00007651078],"domain_scores_gemma":[0.9983207,0.00064889475,0.000596055,0.00010555898,0.0002850469,0.000043734686],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011238116,0.00008707031,0.00020298405,0.00009145723,0.00022126666,0.000026458465,0.00006874183,0.00003775862,0.000041945368],"category_scores_gemma":[0.00014089815,0.00007634381,0.000039910487,0.0001936347,0.00017510577,0.00019912269,0.00003658796,0.00009329171,1.04102725e-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.00004314379,0.00057379354,0.0047449023,0.00014311145,0.000104436476,2.0613992e-7,0.00082333025,0.017410139,0.025310474,0.94939834,0.00029702962,0.0011510788],"study_design_scores_gemma":[0.00089224486,0.000082384875,0.0006734628,0.00007427087,0.0002092108,0.00003842848,0.0008512435,0.019686177,0.0072051464,0.9691867,0.00092650164,0.00017422614],"about_ca_topic_score_codex":0.000009269954,"about_ca_topic_score_gemma":0.000002202739,"teacher_disagreement_score":0.23127079,"about_ca_system_score_codex":0.000022362772,"about_ca_system_score_gemma":0.00002802043,"threshold_uncertainty_score":0.31132102},"labels":[],"label_agreement":null},{"id":"W2082889410","doi":"10.1023/b:jota.0000025708.31430.22","title":"Reflection-Projection Method for Convex Feasibility Problems with an Obtuse Cone","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Orthant; Projection (relational algebra); Intersection (aeronautics); Cone (formal languages); Convex cone; Regular polygon; Conic optimization; Convex set; Reflection (computer programming); Convex optimization; Euclidean space; Dual cone and polar cone; Theory of computation; Set (abstract data type); Combinatorics; Algorithm; Computer science; Geometry","score_opus":0.026833206224986323,"score_gpt":0.32686238087547764,"score_spread":0.30002917465049134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082889410","genre_codex":"methods","genre_gemma":"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.00018816483,0.000039108178,0.9980183,0.0010707715,0.000034519202,0.00045511484,0.0000045074203,0.000041032537,0.00014844452],"genre_scores_gemma":[0.035402387,0.00006283633,0.96394044,0.0002867928,0.00009641999,0.00008788935,0.00001902476,0.000009411841,0.0000948087],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989966,0.00014959523,0.00037553426,0.00022139806,0.00016263041,0.00009424558],"domain_scores_gemma":[0.99822956,0.00016994363,0.00046512712,0.00021171037,0.00081978727,0.000103865714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012438688,0.00010056698,0.00017317107,0.00018872143,0.00031664612,0.00014503826,0.00020003784,0.000054618547,0.000014376511],"category_scores_gemma":[0.0000619592,0.00007912706,0.000057253936,0.0005692032,0.000040804258,0.00094041385,0.000016938739,0.000088564324,6.98491e-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.00006711007,0.00015009496,0.00002191587,0.000008489362,0.00003579494,9.8461584e-8,0.00015799863,0.6170569,0.0000962688,0.38038567,0.00000426952,0.002015417],"study_design_scores_gemma":[0.0030839175,0.0009192694,0.00024019876,0.000030669056,0.00019162387,0.00018986994,0.00025205614,0.71930593,0.0012365518,0.2724516,0.0018059426,0.00029237702],"about_ca_topic_score_codex":0.0000035430794,"about_ca_topic_score_gemma":0.000003890134,"teacher_disagreement_score":0.10793404,"about_ca_system_score_codex":0.00006175531,"about_ca_system_score_gemma":0.0001509804,"threshold_uncertainty_score":0.32267076},"labels":[],"label_agreement":null},{"id":"W2083045602","doi":"10.1007/s10957-012-0036-3","title":"Gradient-Constrained Minimum Networks. III. Fixed Topology","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Steiner tree problem; Mathematics; Embedding; Topology (electrical circuits); Network topology; Theory of computation; Combinatorics; Heuristic; Discrete mathematics; Mathematical optimization; Algorithm; Computer science","score_opus":0.006527470420823994,"score_gpt":0.221985977791401,"score_spread":0.215458507370577,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083045602","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.0019818887,0.001261257,0.9941438,0.000043374504,0.000096194264,0.00011701734,0.0000018081158,0.000065242944,0.0022894053],"genre_scores_gemma":[0.98017925,0.00068207725,0.018662244,0.00006519723,0.00030836058,0.00002445131,0.000005924396,0.00001276591,0.000059719532],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99951005,0.00004150278,0.00024219602,0.000040790223,0.00004210866,0.0001233365],"domain_scores_gemma":[0.99958646,0.00010432982,0.00008956999,0.00007940401,0.000051412073,0.00008883737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040042365,0.000072586634,0.00011866024,0.00008318984,0.00006818491,0.000014806037,0.00007271895,0.00006619911,0.00008344874],"category_scores_gemma":[0.000012992686,0.00006495093,0.000036934252,0.00011848129,0.000061008122,0.00017635834,0.000007815619,0.00010390723,0.000001284806],"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.000049406848,0.00013646914,0.00052715297,0.00002887825,0.00012781897,0.0000012700617,0.00055011385,0.5515896,0.00154713,0.408764,0.002475184,0.034202993],"study_design_scores_gemma":[0.0056548393,0.00068254705,0.0017661374,0.00022529319,0.0010329016,0.0017851276,0.00433145,0.7559964,0.021022297,0.11189163,0.0933197,0.0022916615],"about_ca_topic_score_codex":1.0985302e-7,"about_ca_topic_score_gemma":5.8900266e-8,"teacher_disagreement_score":0.9781974,"about_ca_system_score_codex":0.000013751838,"about_ca_system_score_gemma":0.00000618721,"threshold_uncertainty_score":0.2648622},"labels":[],"label_agreement":null},{"id":"W2084284149","doi":"10.1023/b:jota.0000043989.95285.51","title":"Dynamic Model of R&D, Spillovers, and Efficiency of Bertrand and Cournot Equilibria","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Merger and Competition Analysis","field":"Economics, Econometrics and Finance","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Cournot competition; Bertrand competition; Duopoly; Economics; Differential game; Mathematical economics; Stackelberg competition; Bertrand paradox (economics); Productivity; Competition (biology); Theory of computation; Investment (military); Mathematics; Mathematical optimization; Oligopoly","score_opus":0.012865073583905335,"score_gpt":0.22540429254204022,"score_spread":0.21253921895813488,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084284149","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.15888296,0.0017032148,0.83808,0.00017895075,0.000009953923,0.00006037739,0.000035050583,0.000001914385,0.0010476122],"genre_scores_gemma":[0.9829592,0.002798491,0.014098071,0.000032515385,0.000007646777,0.0000023780628,0.0000045488255,0.000004987973,0.00009213399],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9993419,0.000011334491,0.0004759226,0.00009105548,0.000029733079,0.00005007797],"domain_scores_gemma":[0.9992576,0.000044337918,0.00049225974,0.00008698722,0.00006937464,0.00004941087],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004351715,0.000056075995,0.00022276185,0.0001686463,0.00005152844,0.000014210874,0.000055269382,0.000033180928,0.00007062905],"category_scores_gemma":[0.000029091849,0.000056091074,0.00004581273,0.00014896854,0.00010367554,0.00012099425,0.000014398673,0.000047369762,5.9910246e-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.00003326309,0.000087495944,0.0005173665,0.000030381014,0.00004206481,5.543238e-8,0.00024872244,0.33574715,0.0005709685,0.6624542,0.0000033417768,0.00026503287],"study_design_scores_gemma":[0.0022616717,0.00013858582,0.0010223185,0.00006424774,0.00014264903,0.000035197478,0.00033753633,0.36908334,0.00032640013,0.62586623,0.0004850612,0.0002367658],"about_ca_topic_score_codex":0.0000023221846,"about_ca_topic_score_gemma":8.96858e-7,"teacher_disagreement_score":0.8240763,"about_ca_system_score_codex":0.000009169039,"about_ca_system_score_gemma":0.00001606147,"threshold_uncertainty_score":0.22873276},"labels":[],"label_agreement":null},{"id":"W2085259781","doi":"10.1007/s10957-006-9070-3","title":"Enumeration of All the Extreme Equilibria in Game Theory: Bimatrix and Polymatrix Games","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Enumeration; Theory of computation; Mathematics; Game theory; Mathematical economics; Combinatorics; Mathematical optimization; Algorithm","score_opus":0.04046932685072907,"score_gpt":0.332936384393702,"score_spread":0.2924670575429729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085259781","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.16435938,0.0022181827,0.82908344,0.0018687866,0.000040010884,0.0004716477,0.00002157588,0.000013202426,0.0019237425],"genre_scores_gemma":[0.99531686,0.00024361549,0.0035468705,0.00011288578,0.00012426137,0.000036083013,0.00000633009,0.000010785008,0.00060228154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9975644,0.00068031554,0.0010446521,0.00020782302,0.00036807964,0.00013476748],"domain_scores_gemma":[0.99567693,0.0026688909,0.0009348777,0.0003517331,0.0003051988,0.00006235816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060309446,0.00012706543,0.00027349722,0.00031866715,0.00014213596,0.00014453921,0.0003910883,0.00007269277,0.00013150969],"category_scores_gemma":[0.00048640225,0.000082110055,0.00007862714,0.0007491354,0.00034581558,0.00042021132,0.000063182284,0.00015374181,0.0000050973526],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013380527,0.00011363494,0.00066025264,0.0000052698942,0.000015220657,4.2519437e-7,0.0004462455,0.03764369,0.0034890291,0.9456608,0.00014149408,0.011690133],"study_design_scores_gemma":[0.0005737255,0.00005029682,0.0030071174,0.000019834992,0.0000631667,0.00006885108,0.0011553164,0.008652695,0.0011279549,0.97962916,0.005532837,0.000119044074],"about_ca_topic_score_codex":0.0000037836705,"about_ca_topic_score_gemma":0.0000030537567,"teacher_disagreement_score":0.83095753,"about_ca_system_score_codex":0.000014261247,"about_ca_system_score_gemma":0.00005398001,"threshold_uncertainty_score":0.33483508},"labels":[],"label_agreement":null},{"id":"W2088134026","doi":"10.1007/s10957-010-9716-z","title":"Annealing a Genetic Algorithm for Constrained Optimization","year":2010,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematical optimization; Simulated annealing; Penalty method; Convergence (economics); Computer science; Optimization problem; Genetic algorithm; Forcing (mathematics); Algorithm; Mathematics","score_opus":0.01071977768036943,"score_gpt":0.28486966622273735,"score_spread":0.27414988854236794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2088134026","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.000026001104,0.00011617325,0.998427,0.00042014505,0.00017641787,0.0005293333,0.00001300303,0.00003942223,0.0002525226],"genre_scores_gemma":[0.001709827,0.00017211177,0.99748576,0.00012836602,0.00025783625,0.00008608165,0.0000126884925,0.000016011767,0.00013129442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986553,0.00012973131,0.0005639951,0.00022517979,0.0002454143,0.00018034577],"domain_scores_gemma":[0.9974011,0.0006119344,0.00046352466,0.00029717974,0.0010384549,0.00018777583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014892225,0.00012596071,0.00019968206,0.00028384503,0.00029711556,0.00024959113,0.00049370626,0.00009245191,0.000088739645],"category_scores_gemma":[0.00039174533,0.00011608747,0.00007274434,0.0004908042,0.00013363906,0.0004578076,0.00006168199,0.0002145528,0.0000015348239],"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.000009215771,0.000056299512,0.000004919409,0.000009449369,0.000024209574,9.997925e-7,0.000072093535,0.775779,0.000099940095,0.096270554,0.00004681713,0.12762648],"study_design_scores_gemma":[0.00064416684,0.000068650304,0.000010789687,0.0000073975693,0.000026831745,0.00014907641,0.000042488657,0.9879053,0.00021154089,0.009383878,0.0014297784,0.00012009423],"about_ca_topic_score_codex":3.0877945e-7,"about_ca_topic_score_gemma":8.6671285e-8,"teacher_disagreement_score":0.21212628,"about_ca_system_score_codex":0.000014063534,"about_ca_system_score_gemma":0.00016990384,"threshold_uncertainty_score":0.47339094},"labels":[],"label_agreement":null},{"id":"W2090884848","doi":"10.1007/s10957-014-0668-6","title":"Optimal Control of a Multistate Failure-Prone Manufacturing System under a Conditional Value-at-Risk Cost Criterion","year":2014,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"CVAR; Mathematical optimization; Expected shortfall; Control (management); Constant (computer programming); Computer science; Optimal control; Risk aversion (psychology); Value (mathematics); Point (geometry); Product (mathematics); Economics; Econometrics; Mathematics; Mathematical economics; Risk management; Expected utility hypothesis","score_opus":0.005414435977579333,"score_gpt":0.22217061612411113,"score_spread":0.21675618014653178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090884848","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.030900467,0.000053261636,0.96816236,0.00018656156,0.00003277735,0.00026728178,0.000020482836,0.000029541383,0.000347297],"genre_scores_gemma":[0.9869527,0.000015582777,0.012325439,0.00019467059,0.000355631,0.00003771001,0.00004198825,0.000019946357,0.000056328812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988526,0.00012294907,0.0005539388,0.00015706159,0.00018736658,0.00012605118],"domain_scores_gemma":[0.9978423,0.00035000156,0.0013060545,0.000161374,0.00031238323,0.000027878177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013695998,0.00013798548,0.00028885956,0.0002537729,0.00033542461,0.00008997673,0.0001479715,0.000053776224,0.00009847477],"category_scores_gemma":[0.00011502378,0.0001230408,0.0001035196,0.00017217845,0.00012835233,0.0006355275,0.000046221357,0.00012746819,0.000009567527],"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.00017275823,0.000043682252,0.00007018274,0.00006499442,0.000071950766,4.867847e-7,0.000017526536,0.7115783,0.00034419418,0.28693032,0.000015739477,0.000689862],"study_design_scores_gemma":[0.0035580883,0.00005147301,0.0006754581,0.00018526972,0.0010685568,0.00007276945,0.0011265051,0.92454565,0.0011610802,0.05933966,0.007832682,0.0003828204],"about_ca_topic_score_codex":0.0000034974464,"about_ca_topic_score_gemma":9.551858e-7,"teacher_disagreement_score":0.95605224,"about_ca_system_score_codex":0.000051532345,"about_ca_system_score_gemma":0.000010710763,"threshold_uncertainty_score":0.50174576},"labels":[],"label_agreement":null},{"id":"W2100939679","doi":"10.1007/s10957-007-9249-2","title":"An Algorithm for Portfolio Optimization with Variable Transaction Costs, Part 2: Computational Analysis","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematical optimization; Transaction cost; Computer science; Variable (mathematics); Portfolio optimization; Portfolio; Optimization problem; Point (geometry); Sequence (biology); Algorithm; Mathematics; Economics; Financial economics","score_opus":0.01039593642916784,"score_gpt":0.2283072835997105,"score_spread":0.21791134717054267,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100939679","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.0004454081,0.00024364004,0.99673283,0.000044877426,0.000045148583,0.00026628963,0.000087567,0.000012632999,0.0021215803],"genre_scores_gemma":[0.11414546,0.00025949374,0.884761,0.00018987103,0.00021677974,0.00004852358,0.00021490053,0.000020673247,0.00014330218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990849,0.000020875463,0.0005786535,0.00016161271,0.000040715702,0.000113278],"domain_scores_gemma":[0.99882096,0.0001313766,0.0006387515,0.00009750033,0.00023064355,0.00008078237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014561086,0.00009385293,0.00022965999,0.00034958616,0.00023818012,0.000089337664,0.000067849156,0.00006363545,0.00017318704],"category_scores_gemma":[0.00001499753,0.00009101857,0.00006288464,0.0005770448,0.000057997015,0.00056290487,0.0000026393284,0.000065070344,5.109414e-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.000052815933,0.00008653571,0.0001558527,0.000004132491,0.000116289964,9.631882e-7,0.000033508928,0.63548857,4.8908083e-7,0.36041117,0.000015409047,0.0036342845],"study_design_scores_gemma":[0.00088373985,0.00030443145,0.0004946481,0.000010340648,0.00028200538,0.000122705,0.00042144532,0.93235373,0.00001384866,0.060576044,0.0043298677,0.00020716511],"about_ca_topic_score_codex":0.0000051853144,"about_ca_topic_score_gemma":0.0000014556448,"teacher_disagreement_score":0.29983512,"about_ca_system_score_codex":0.000043985056,"about_ca_system_score_gemma":0.000030698448,"threshold_uncertainty_score":0.37116295},"labels":[],"label_agreement":null},{"id":"W2108293203","doi":"10.1007/s10957-007-9297-7","title":"Measure-Valued Differentiation for Markov Chains","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Markov chain; Mathematics; Measure (data warehouse); Markov kernel; Estimator; Kernel (algebra); Applied mathematics; Generality; Markov model; Discrete mathematics; Combinatorics; Mathematical optimization; Variable-order Markov model; Computer science; Statistics","score_opus":0.03489857493065025,"score_gpt":0.3465355127841554,"score_spread":0.31163693785350516,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108293203","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.0026771713,0.00016639588,0.9952717,0.00012206491,0.00008074902,0.00043868303,0.000006705706,0.000016835367,0.0012197274],"genre_scores_gemma":[0.21266751,0.00011762772,0.7851022,0.00017127584,0.0006118842,0.00006771187,0.0000140892835,0.000036412937,0.0012113238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990471,0.00012592995,0.00046829882,0.00009859315,0.00014046616,0.00011959906],"domain_scores_gemma":[0.9978829,0.000997256,0.0004823787,0.00013479406,0.0004110576,0.000091622365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00427645,0.00009472885,0.00018852319,0.00013663541,0.00016373086,0.000029475415,0.00009548909,0.00007335388,0.000016784443],"category_scores_gemma":[0.00061282935,0.00007838343,0.00009821677,0.00013701105,0.0000385165,0.000104408304,0.0000135397,0.000089046756,1.9001845e-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.0002688144,0.00014352701,0.000041142448,0.00006043715,0.00006417853,3.522044e-7,0.0003006449,0.0006783868,0.0008971355,0.96559155,0.00024675563,0.031707086],"study_design_scores_gemma":[0.008425003,0.00072206324,0.0006180404,0.0003167078,0.0014253879,0.0002520465,0.0044819387,0.061854556,0.0133988345,0.8868876,0.020471236,0.0011465824],"about_ca_topic_score_codex":1.236798e-7,"about_ca_topic_score_gemma":8.8292046e-7,"teacher_disagreement_score":0.21016951,"about_ca_system_score_codex":0.00002871722,"about_ca_system_score_gemma":0.000025159541,"threshold_uncertainty_score":0.31963834},"labels":[],"label_agreement":null},{"id":"W2113793814","doi":"10.1023/a:1019672829007","title":"Suboptimal Regulators for Discrete-Time Jump Linear Systems with Time-Multiplied Performance Index","year":2002,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Discrete time and continuous time; Control theory (sociology); Jump; Constant (computer programming); Index (typography); Mathematics; Linear regulator; Control (management); Linear system; Time constant; Computer science; State (computer science); Mathematical optimization; Applied mathematics; Regulator; Algorithm; Mathematical analysis; Statistics; Engineering; Physics","score_opus":0.005096351887693274,"score_gpt":0.18606585952141513,"score_spread":0.18096950763372185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113793814","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.020836905,0.00073251245,0.97667056,0.00005936677,0.000052411728,0.00065080577,0.000017333905,0.00008700378,0.000893107],"genre_scores_gemma":[0.99411553,0.000093447714,0.0048621125,0.000012731421,0.00025518335,0.00012160719,0.000008463275,0.000027911856,0.00050301914],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991992,0.000040351035,0.00039367433,0.00010450807,0.00012915624,0.00013312456],"domain_scores_gemma":[0.99916714,0.00021968743,0.00018402084,0.00015700709,0.00018549831,0.00008666354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004487706,0.00012818095,0.00024336048,0.00009279884,0.00014538344,0.00005058797,0.00011574374,0.00007350686,0.00004089286],"category_scores_gemma":[0.000019752635,0.00010093168,0.000052533982,0.00015969145,0.00006240209,0.000250574,0.0000064554365,0.00009970354,0.000007829671],"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.00012411713,0.000027387852,0.00015929468,0.00007012061,0.00007037939,1.727726e-7,0.00011722134,0.9969206,0.00019150213,0.0012826627,0.00014571506,0.00089082454],"study_design_scores_gemma":[0.000846827,0.00010524774,0.000081230195,0.000052170013,0.000056769648,0.000036864614,0.00009554168,0.9963963,0.00007678942,0.00006185607,0.0020573996,0.0001329823],"about_ca_topic_score_codex":2.4982558e-7,"about_ca_topic_score_gemma":6.0961824e-8,"teacher_disagreement_score":0.97327864,"about_ca_system_score_codex":0.00003508091,"about_ca_system_score_gemma":0.000010808646,"threshold_uncertainty_score":0.41158742},"labels":[],"label_agreement":null},{"id":"W2137362083","doi":"10.1007/s10957-007-9340-8","title":"Pricing and Advertising of Private and National Brands in a Dynamic Marketing Channel","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":52,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Junta de Castilla y León; Ministerio de Economía y Competitividad","keywords":"Goodwill; Brand equity; Advertising; Business; Brand management; National brand; Brand awareness; Purchasing; Private label; Brand extension; Marketing","score_opus":0.009195399602621276,"score_gpt":0.23329582636106694,"score_spread":0.22410042675844566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2137362083","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.86791825,0.00074694667,0.129533,0.00015424791,0.000023744617,0.00017843462,0.0000010943285,0.000009289293,0.0014350221],"genre_scores_gemma":[0.9970918,0.0007927836,0.0019477529,0.00008122556,0.000052076328,0.000005571117,0.0000025480178,0.000007709199,0.000018485065],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99937636,0.000031257656,0.0003212863,0.00009053183,0.00010959088,0.00007098335],"domain_scores_gemma":[0.99923253,0.0002660231,0.00032978455,0.000039924067,0.00011996301,0.000011791347],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012050366,0.00007005312,0.00013651223,0.0003004238,0.00015642375,0.00003624723,0.00004663926,0.000030496238,0.00001550164],"category_scores_gemma":[0.00018277032,0.00006626049,0.000019061556,0.00027264727,0.00007348074,0.00049763423,0.000044414504,0.00008508096,1.2117181e-7],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021012516,0.0005964877,0.5335257,0.001637292,0.00018995839,0.00002650313,0.002381151,0.091177434,0.007851365,0.092438996,0.00005754072,0.26801634],"study_design_scores_gemma":[0.0037033353,0.00003127493,0.74160135,0.0006894987,0.00022828658,0.00042725157,0.00092972524,0.22678156,0.000101817604,0.023206938,0.0017781472,0.00052083586],"about_ca_topic_score_codex":0.0000034950888,"about_ca_topic_score_gemma":0.0000016015316,"teacher_disagreement_score":0.26749548,"about_ca_system_score_codex":0.000009178773,"about_ca_system_score_gemma":0.0000155991,"threshold_uncertainty_score":0.27020243},"labels":[],"label_agreement":null},{"id":"W2161105844","doi":"10.1023/a:1017555931930","title":"Random-Direction Optimization Algorithms with Applications to Threshold Controls","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Simulation Techniques and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Convergence (economics); Mathematical optimization; Stochastic optimization; Computer science; Rate of convergence; Class (philosophy); Algorithm; Stochastic approximation; Mathematics; Key (lock); Artificial intelligence","score_opus":0.035395414333277087,"score_gpt":0.35788658585160116,"score_spread":0.32249117151832407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161105844","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.00054936664,0.00021955745,0.99173915,0.0016120275,0.00003718272,0.001555593,0.000015793059,0.00008712197,0.0041842153],"genre_scores_gemma":[0.4457859,0.0010046081,0.54485327,0.0016641112,0.0009435884,0.0020871223,0.0000573322,0.00008309924,0.0035209213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972977,0.00020371286,0.0011470385,0.00041214522,0.00073386973,0.0002055139],"domain_scores_gemma":[0.9954008,0.0011744265,0.00090251566,0.0005577397,0.001674855,0.0002896647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002968525,0.00021076419,0.000402513,0.00062399596,0.0005598899,0.00034268518,0.0004975925,0.00011393173,0.00037195586],"category_scores_gemma":[0.00030544313,0.0001561454,0.00011635915,0.002149362,0.00013490254,0.0006185899,0.000052399617,0.00019220903,0.00002466329],"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.00030199176,0.00014233052,0.00039949542,0.0000021373694,0.00002995999,7.08168e-7,0.00008589062,0.9156487,0.000103252736,0.050177164,0.0003429444,0.032765456],"study_design_scores_gemma":[0.0060865246,0.0007136712,0.00083266303,0.00008675781,0.00038827813,0.00069119333,0.0020871565,0.49883604,0.0008669562,0.12789768,0.3605234,0.0009896738],"about_ca_topic_score_codex":0.0000018533498,"about_ca_topic_score_gemma":0.0000015570488,"teacher_disagreement_score":0.44688585,"about_ca_system_score_codex":0.00006186269,"about_ca_system_score_gemma":0.00009415366,"threshold_uncertainty_score":0.6367425},"labels":[],"label_agreement":null},{"id":"W2163580726","doi":"10.1007/s10957-005-4713-3","title":"Sensitivity of Pareto Solutions in Multiobjective Optimization","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Sensitivity (control systems); Mathematical optimization; Mathematics; Pareto principle; Theory of computation; Multi-objective optimization; Scalar (mathematics); Applied mathematics; Nonlinear system; Computation; Pareto interpolation; Algorithm","score_opus":0.009415201946547677,"score_gpt":0.2469129794044059,"score_spread":0.23749777745785822,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163580726","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025173186,0.00013784732,0.9979078,0.0010195154,0.000023360795,0.00015339478,0.0000056749077,0.00001559835,0.00048505043],"genre_scores_gemma":[0.6017431,0.00026499984,0.397719,0.00012974485,0.000066985056,0.000013757127,0.0000087999215,0.000005641467,0.000047976544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865925,0.00034096633,0.00055609486,0.0001517828,0.00018423275,0.000107675],"domain_scores_gemma":[0.9982502,0.0004085672,0.00052694813,0.00017134144,0.0005747545,0.00006817678],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001585526,0.00009289933,0.00020099008,0.00038458488,0.000130122,0.000045600475,0.00016288507,0.00006000838,0.000036902617],"category_scores_gemma":[0.00019042593,0.00008815455,0.00007104057,0.0008470086,0.000060278533,0.0008547716,0.00005324182,0.00010665041,0.0000014475092],"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.000014123393,0.0001515585,0.00017846267,0.0000037782734,0.0000217334,3.114259e-7,0.00024858437,0.83996266,0.000054594333,0.1541699,0.000011732433,0.005182567],"study_design_scores_gemma":[0.0003468607,0.000023695751,0.0007079138,0.000015490494,0.000029320388,0.00002352419,0.00012025402,0.9952952,0.00025846867,0.0029269725,0.00016200569,0.00009026524],"about_ca_topic_score_codex":0.000003712592,"about_ca_topic_score_gemma":0.000006388471,"teacher_disagreement_score":0.6014914,"about_ca_system_score_codex":0.000053996682,"about_ca_system_score_gemma":0.00008822396,"threshold_uncertainty_score":0.3594838},"labels":[],"label_agreement":null},{"id":"W2269291726","doi":"10.1023/a:1017514422146","title":"New Complexity Analysis of the Primal–Dual Method for Semidefinite Optimization Based on the Nesterov–Todd Direction","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Interior point method; Semidefinite programming; Theory of computation; Mathematics; Mathematical optimization; Point (geometry); Dual (grammatical number); Algorithm","score_opus":0.06823277375741253,"score_gpt":0.38709290536516644,"score_spread":0.3188601316077539,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2269291726","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.00008360781,0.000043683627,0.9964458,0.0018226675,0.000041600822,0.00080167834,0.000029003344,0.00001992087,0.0007120524],"genre_scores_gemma":[0.0060061566,0.00016019843,0.9926005,0.00036172252,0.00012391026,0.00009492773,0.000031548778,0.000032018954,0.000589013],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99806213,0.00055067457,0.0006819448,0.00018188865,0.00037752007,0.00014580987],"domain_scores_gemma":[0.99421614,0.00353867,0.0010088233,0.00040149555,0.00074883073,0.00008601578],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020958518,0.00015116,0.00033183588,0.00035690315,0.00041034416,0.00006306036,0.00026702965,0.000081981176,0.00027258752],"category_scores_gemma":[0.0011246724,0.00009569065,0.00023081996,0.0018442236,0.0001262172,0.00018626223,0.000039495066,0.0001967266,3.1884468e-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.00016673538,0.00011272005,0.00007373725,0.000013234485,0.00016671768,9.337073e-8,0.000090521266,0.88494986,0.000027258371,0.11201298,0.00015944507,0.0022267115],"study_design_scores_gemma":[0.00055913144,0.00006863936,0.00012182036,0.000027562784,0.0006329171,0.0000100745365,0.00015921943,0.9547228,0.00024559585,0.042465046,0.00089036,0.0000968129],"about_ca_topic_score_codex":0.0000023368343,"about_ca_topic_score_gemma":0.0000029862265,"teacher_disagreement_score":0.06977297,"about_ca_system_score_codex":0.00006372293,"about_ca_system_score_gemma":0.000118824464,"threshold_uncertainty_score":0.39021516},"labels":[],"label_agreement":null},{"id":"W2283656494","doi":"10.1023/a:1004661928043","title":"H∞-Control for Linear Time-Delay Systems with Markovian Jumping Parameters","year":2000,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Jumping; Mathematics; Control theory (sociology); Theory of computation; Bounded function; Markov process; Norm (philosophy); Attenuation; Control (management); Applied mathematics; Computer science; Mathematical analysis; Algorithm","score_opus":0.004192982776474372,"score_gpt":0.19417058201199813,"score_spread":0.18997759923552376,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2283656494","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.005012618,0.0005698634,0.99294645,0.000076070115,0.000037164646,0.00055770547,0.000017497803,0.000041920364,0.00074071164],"genre_scores_gemma":[0.9853387,0.00011144624,0.013643879,0.000072348776,0.00025945163,0.00021098314,0.000008071298,0.000030928317,0.0003241984],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993073,0.00006458374,0.000346731,0.000084062995,0.000087082466,0.000110275774],"domain_scores_gemma":[0.999217,0.00035756425,0.00011003362,0.00011804193,0.00012339535,0.0000740017],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00059596496,0.00009838467,0.00021077823,0.000063953295,0.00010472242,0.000051032373,0.00008899963,0.000052552045,0.000045929595],"category_scores_gemma":[0.000016363389,0.00007835712,0.00005483703,0.000109609005,0.000039177732,0.00016672137,0.0000014933796,0.00007727358,0.0000035703954],"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.00021112023,0.000017224194,0.000020290103,0.00004446126,0.0000936734,3.7701005e-7,0.00006385238,0.9926653,0.000057772515,0.002164067,0.000052546777,0.004609344],"study_design_scores_gemma":[0.0014586275,0.00012403581,0.000015173546,0.0000738485,0.000130523,0.00008192678,0.00015887147,0.9871663,0.000029959705,0.000619219,0.0099924905,0.00014903574],"about_ca_topic_score_codex":8.034976e-7,"about_ca_topic_score_gemma":1.6917052e-7,"teacher_disagreement_score":0.98032606,"about_ca_system_score_codex":0.000025790336,"about_ca_system_score_gemma":0.00001745527,"threshold_uncertainty_score":0.31953105},"labels":[],"label_agreement":null},{"id":"W2481787546","doi":"10.1007/s10957-016-0988-9","title":"Generalized Derivatives of Differential–Algebraic Equations","year":2016,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Novartis-MIT Center for Continuous Manufacturing","keywords":"Mathematics; Differential algebraic geometry; Differential algebraic equation; Parametric statistics; Lipschitz continuity; Differential equation; Applied mathematics; Algebraic number; Algebraic differential equation; Mathematical analysis; Ordinary differential equation","score_opus":0.039793036554293594,"score_gpt":0.33783470303083696,"score_spread":0.29804166647654334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2481787546","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.017372688,0.00007853138,0.9816606,0.00043092587,0.000049067952,0.00023159139,0.000016698667,0.000017840583,0.00014204017],"genre_scores_gemma":[0.5424283,0.00021175301,0.45681903,0.000028732771,0.00012249505,0.000050937153,0.0000038457133,0.000023359593,0.00031154667],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99853915,0.00037976494,0.0006838252,0.00010994904,0.00018475672,0.000102546255],"domain_scores_gemma":[0.9958458,0.0026700615,0.00082946743,0.00019522553,0.0003697599,0.00008966869],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060780486,0.000111019384,0.0002859429,0.00017802842,0.000119835175,0.000017525417,0.00016145635,0.000057371788,0.00045033032],"category_scores_gemma":[0.0014588777,0.000071383416,0.00011043691,0.00026847297,0.00018077406,0.00020986472,0.00003492035,0.000068910995,0.0000016236477],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049799142,0.00018300553,0.000044884076,0.000021449772,0.00008531554,1.0456816e-7,0.00014857987,0.0004254887,0.018598463,0.9557289,0.000018406172,0.024695642],"study_design_scores_gemma":[0.0007238783,0.000066771674,0.00014094857,0.000058050828,0.00015796523,0.0000071358554,0.00009104032,0.00047529876,0.007845779,0.99013966,0.00019222619,0.000101234],"about_ca_topic_score_codex":3.3477252e-7,"about_ca_topic_score_gemma":2.1015614e-7,"teacher_disagreement_score":0.5250556,"about_ca_system_score_codex":0.00002040745,"about_ca_system_score_gemma":0.000042099273,"threshold_uncertainty_score":0.49308014},"labels":[],"label_agreement":null},{"id":"W252470463","doi":"10.1023/a:1022170404978","title":"Guaranteed Cost Control of a Markov Jump Linear Uncertain System Using a Time-Multiplied Cost Function","year":2003,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Quadratic growth; Control theory (sociology); Theory of computation; Linear system; Constant (computer programming); Jump; Norm (philosophy); Bounded function; Jump process; Mathematical optimization; Average cost; Cost control; Function (biology); Control (management); Computer science; Statistics; Algorithm; Mathematical analysis; Law; Economics","score_opus":0.008841609008711667,"score_gpt":0.2217040934708908,"score_spread":0.21286248446217912,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W252470463","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.004045322,0.00069556804,0.9934016,0.000011876987,0.00010278097,0.0007415189,0.000027059292,0.0000400529,0.00093421456],"genre_scores_gemma":[0.9948205,0.000030972646,0.0048980215,0.000027391055,0.00010445934,0.00006296509,0.0000048569436,0.000020852793,0.000030018015],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873173,0.00022531976,0.0006599464,0.00010474514,0.00014945307,0.00012880455],"domain_scores_gemma":[0.9987311,0.00038231627,0.00034706283,0.00016578494,0.00029439473,0.00007935761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011883774,0.00013445546,0.00034327488,0.00013842591,0.00011592443,0.000026184898,0.00009031937,0.00009275191,0.00004154634],"category_scores_gemma":[0.00008930951,0.00012204985,0.0000937828,0.00025660917,0.000062293526,0.00013828419,0.000004331665,0.0001235565,0.0000027067515],"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.000265982,0.000045158355,0.00013295843,0.000111985064,0.00012908503,5.639588e-7,0.000091278445,0.9760617,0.0048497426,0.017131228,0.000013571354,0.0011667612],"study_design_scores_gemma":[0.0024350504,0.0000619452,0.00003745537,0.00013464827,0.00023936205,0.000093029725,0.00089561957,0.99285567,0.00046266863,0.00040091426,0.002223756,0.00015990327],"about_ca_topic_score_codex":0.0000015193997,"about_ca_topic_score_gemma":2.9570262e-7,"teacher_disagreement_score":0.99077517,"about_ca_system_score_codex":0.0000904567,"about_ca_system_score_gemma":0.000049956252,"threshold_uncertainty_score":0.49770486},"labels":[],"label_agreement":null},{"id":"W259673802","doi":"10.1023/a:1026465906067","title":"Duality of Nonscalarized Multiobjective Linear Programs: Dual Balance, Level Sets, and Dual Clusters of Optimal Vectors","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Duality (order theory); Mathematics; Duality gap; Mathematical optimization; Minimax; Theory of computation; Dual (grammatical number); Linear programming; Parametric statistics; Weak duality; Set (abstract data type); Strong duality; Computation; Perturbation function; Pareto principle; Applied mathematics; Optimization problem; Combinatorics; Computer science; Algorithm; Convex analysis","score_opus":0.048862642972942884,"score_gpt":0.3625795594452303,"score_spread":0.3137169164722874,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W259673802","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.036989998,0.00012442814,0.9618558,0.0001145217,0.000024617517,0.00060917734,0.00005748593,0.000017537697,0.00020640956],"genre_scores_gemma":[0.22828163,0.0007369496,0.7704788,0.00002255729,0.00008695335,0.000055081455,0.00003383832,0.00003506168,0.0002691188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998205,0.00028188634,0.0008283473,0.00018157208,0.0003360502,0.00016716191],"domain_scores_gemma":[0.99699855,0.0008259777,0.0009030051,0.00019878152,0.00094164617,0.00013205636],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012935422,0.00015561872,0.00041301973,0.00022819002,0.0001378349,0.000022399423,0.00011107449,0.0001106202,0.000058939837],"category_scores_gemma":[0.0005909343,0.00013782342,0.00008203825,0.0005072524,0.00038896376,0.0003105314,0.00007374389,0.00022724022,3.8266396e-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.003206622,0.002888666,0.0031823374,0.00055287103,0.00075015944,0.000014142623,0.005085135,0.8371874,0.0014303277,0.12018154,0.0001275628,0.025393207],"study_design_scores_gemma":[0.014588726,0.0015544118,0.0024009158,0.00053653005,0.0007692689,0.0011114287,0.012099841,0.8844923,0.0068973484,0.073263854,0.0011823477,0.0011030575],"about_ca_topic_score_codex":0.0000018572382,"about_ca_topic_score_gemma":8.5422454e-7,"teacher_disagreement_score":0.19137701,"about_ca_system_score_codex":0.000035042485,"about_ca_system_score_gemma":0.0000976797,"threshold_uncertainty_score":0.5620276},"labels":[],"label_agreement":null},{"id":"W2738359971","doi":"10.1007/s10957-017-1139-7","title":"Optimal Timing to Initiate Medical Treatment for a Disease Evolving as a Semi-Markov Process","year":2017,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Statistical Methods in Clinical Trials","field":"Mathematics","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Theory of computation; Mathematics; Process (computing); Markov process; Markov decision process; Mathematical optimization; Markov chain; Calculus (dental); Applied mathematics; Computer science; Medicine; Algorithm; Statistics","score_opus":0.2880180947609726,"score_gpt":0.5617737587265674,"score_spread":0.2737556639655948,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2738359971","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.0020954534,0.00004999528,0.9950666,0.0012004104,0.00007514695,0.0007795738,0.00004202076,0.000015868894,0.00067496736],"genre_scores_gemma":[0.093072265,0.000119991484,0.90534467,0.00027377493,0.00054291036,0.0003931848,0.0000024453188,0.000029127794,0.000221619],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984953,0.00022065212,0.00068939145,0.00018431987,0.00026228276,0.00014806566],"domain_scores_gemma":[0.98575306,0.012321952,0.0007310458,0.00031085793,0.00041186708,0.0004712381],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.002967459,0.00012908663,0.00035391602,0.00007226378,0.00047360876,0.00014281782,0.00030500855,0.000081256825,0.0002461918],"category_scores_gemma":[0.060434792,0.00009928583,0.00011059349,0.00006176987,0.00012684212,0.00017430387,0.000051756044,0.000107560125,0.0000025131287],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033534747,0.0014862177,0.00027274774,0.00041110464,0.0004444129,0.00003330317,0.0010833931,0.02636348,0.000040342944,0.84247583,0.0006986204,0.123337045],"study_design_scores_gemma":[0.0014676285,0.00028017245,0.000048936272,0.00023732663,0.00033322492,0.000026461545,0.00013214393,0.024382623,0.00013854554,0.9723593,0.00044476482,0.00014884872],"about_ca_topic_score_codex":4.5680585e-7,"about_ca_topic_score_gemma":2.0650702e-7,"teacher_disagreement_score":0.12988347,"about_ca_system_score_codex":0.000038345464,"about_ca_system_score_gemma":0.00019970565,"threshold_uncertainty_score":0.94747955},"labels":[],"label_agreement":null},{"id":"W2803334141","doi":"10.1007/s10957-018-1309-2","title":"Generalized Derivatives of Lexicographic Linear Programs","year":2018,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Process Optimization and Integration","field":"Engineering","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Lexicographical order; Theory of computation; Applied mathematics; Mathematical optimization; Algebra over a field; Combinatorics; Pure mathematics; Algorithm","score_opus":0.01094717925663567,"score_gpt":0.2521632804427691,"score_spread":0.24121610118613343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2803334141","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.0088629965,0.00039901288,0.98907715,0.00004173236,0.000042710562,0.00013724565,0.0000024728934,0.000037547827,0.0013991202],"genre_scores_gemma":[0.87253535,0.001213156,0.12584312,0.00005905566,0.00020923855,0.00002859761,0.000018882502,0.000019684076,0.00007291735],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999407,0.00003959324,0.00034810093,0.000057266916,0.00008423716,0.00006382779],"domain_scores_gemma":[0.9992125,0.000035918107,0.00018544409,0.00008109548,0.00043703444,0.00004798088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026657217,0.00007583483,0.0001283956,0.00015176526,0.00006902765,0.000019818583,0.000087911845,0.000048605256,0.000097271804],"category_scores_gemma":[0.000036184934,0.000064279,0.00004035987,0.00037475207,0.00014248169,0.00023365206,0.0000071695017,0.00006644721,9.771132e-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.00009454365,0.00014117161,0.00028380766,0.00007433247,0.00012276607,1.7436992e-7,0.00081594544,0.7516726,0.0038482626,0.20680784,0.00013465951,0.0360039],"study_design_scores_gemma":[0.0016261386,0.00051788794,0.0002565847,0.00016175737,0.00015878273,0.00005754194,0.0009076904,0.8997435,0.051023077,0.031276938,0.0138578415,0.00041225337],"about_ca_topic_score_codex":1.8716275e-7,"about_ca_topic_score_gemma":3.193847e-7,"teacher_disagreement_score":0.8636724,"about_ca_system_score_codex":0.000007062243,"about_ca_system_score_gemma":0.000017240764,"threshold_uncertainty_score":0.26212215},"labels":[],"label_agreement":null},{"id":"W2883514251","doi":"10.1007/s10957-018-1344-z","title":"Complexity of Interior Point Methods for a Class of Linear Complementarity Problems Using a Kernel Function with Trigonometric Growth Term","year":2018,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Shiraz University of Technology; York University","keywords":"Mathematics; Interior point method; Theory of computation; Mathematical optimization; Applied mathematics; Mixed complementarity problem; Complementarity (molecular biology); Term (time); Algorithm; Nonlinear system","score_opus":0.12883433508910186,"score_gpt":0.43512796934725667,"score_spread":0.3062936342581548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883514251","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.0028407052,0.00005018615,0.99602455,0.00006403152,0.000022094844,0.000863101,0.00003627031,0.000009691395,0.00008937502],"genre_scores_gemma":[0.061623808,0.00003686268,0.9381603,0.000018455985,0.00006208117,0.000041641226,0.000012899983,0.000020548761,0.000023374609],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998576,0.00022894308,0.00077275606,0.0001396714,0.00016283193,0.00011981159],"domain_scores_gemma":[0.9960463,0.0007253992,0.0012109033,0.00017129586,0.001772899,0.00007318334],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018092972,0.0001139564,0.00035552713,0.0004008168,0.00017084762,0.00001743561,0.000151939,0.000048672453,0.00009603195],"category_scores_gemma":[0.00040333424,0.00009161133,0.00007363134,0.00072451914,0.0004396994,0.00024579026,0.000049147282,0.00011306053,1.1905033e-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.004763604,0.0015249599,0.00092255947,0.0016614696,0.00093774626,3.2459545e-7,0.0023019265,0.14397624,0.01064553,0.8134035,0.0000611893,0.019800927],"study_design_scores_gemma":[0.0033199373,0.0015779642,0.00013984369,0.00019173155,0.0003709466,0.000053763128,0.0009933821,0.6562454,0.010343829,0.3262983,0.00024364807,0.0002212257],"about_ca_topic_score_codex":0.000002315078,"about_ca_topic_score_gemma":0.0000013836753,"teacher_disagreement_score":0.5122692,"about_ca_system_score_codex":0.000058360358,"about_ca_system_score_gemma":0.00008410298,"threshold_uncertainty_score":0.37358016},"labels":[],"label_agreement":null},{"id":"W2897088789","doi":"10.1007/s10957-018-1411-5","title":"The Valuation of American Passport Options: A Viscosity Solution Approach","year":2018,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Viscosity solution; Uniqueness; Variational inequality; Convexity; Theory of computation; Mathematics; Valuation of options; Valuation (finance); Mathematical economics; Viscosity; Put option; Mathematical optimization; Applied mathematics; Actuarial science; Mathematical analysis; Econometrics; Economics; Finance","score_opus":0.024412122416141598,"score_gpt":0.24706060888106768,"score_spread":0.22264848646492608,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2897088789","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.0010193468,0.0009747,0.99556595,0.00036787544,0.000044194574,0.00024138433,0.00002158129,0.000007850432,0.0017571445],"genre_scores_gemma":[0.9361185,0.0007116113,0.0625884,0.00007351845,0.00029753824,0.00010753777,0.000012654289,0.000011416342,0.00007883683],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906355,0.000018391009,0.00063756615,0.00013096511,0.000052544292,0.00009697876],"domain_scores_gemma":[0.9980531,0.00013893393,0.0012341783,0.000183159,0.0003442034,0.00004643586],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014057757,0.00007255793,0.00018991716,0.00010988547,0.0004178943,0.000036700334,0.000175806,0.00003679645,0.00001032244],"category_scores_gemma":[0.00016595879,0.00006185239,0.0000607646,0.0004705614,0.00040925387,0.00016063605,0.00002561695,0.000081982726,0.0000064733463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003788558,0.00008982562,0.00016213687,0.000006207671,0.00002309613,1.5033486e-8,0.00013972231,0.00215389,0.000024283621,0.99164987,0.000032308228,0.0056807827],"study_design_scores_gemma":[0.0003403151,0.00019110536,0.00388225,0.000012045869,0.00004652266,0.000020027552,0.0004519694,0.032703005,0.00008647375,0.955916,0.006214356,0.00013594158],"about_ca_topic_score_codex":0.000008053019,"about_ca_topic_score_gemma":0.0000011673209,"teacher_disagreement_score":0.9350991,"about_ca_system_score_codex":0.000027920154,"about_ca_system_score_gemma":0.000038407856,"threshold_uncertainty_score":0.32141474},"labels":[],"label_agreement":null},{"id":"W2898479565","doi":"10.1007/s10957-018-1414-2","title":"Variational Analysis on the Signed Distance Functions","year":2018,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Signed distance function; Mathematics; Set function; Subderivative; Hausdorff distance; Complement (music); Function (biology); Boundary (topology); Distance transform; Minkowski distance; Closed set; Theory of computation; Level set (data structures); Set (abstract data type); Discrete mathematics; Mathematical analysis; Algorithm; Regular polygon; Euclidean distance; Convex optimization; Artificial intelligence; Geometry; Computer science","score_opus":0.007556437567237859,"score_gpt":0.23437614908123358,"score_spread":0.22681971151399571,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2898479565","genre_codex":"methods","genre_gemma":"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.000049837352,0.000034475026,0.9927546,0.004346107,0.00005658723,0.00010269877,0.0000077559425,0.000021078537,0.0026269066],"genre_scores_gemma":[0.8679792,0.00007041513,0.12740362,0.002298294,0.0005241694,0.000052774594,0.00002766344,0.0000101547275,0.001633701],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988964,0.00021523742,0.00036978157,0.00016578515,0.00026566454,0.00008712027],"domain_scores_gemma":[0.9978318,0.0006719394,0.00043084146,0.00028816116,0.0007049372,0.00007229552],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010438095,0.000090288704,0.00014183566,0.00030404262,0.00057412044,0.0001750286,0.00037615938,0.000037549034,0.00041675352],"category_scores_gemma":[0.00015247808,0.000060675116,0.0001219632,0.0020163062,0.000101772086,0.00035681698,0.00003748866,0.000092307084,0.000018563507],"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.000014466952,0.00005702708,0.000060920156,5.714648e-7,0.00019829898,9.560179e-8,0.00009220304,0.29019946,0.0000067179058,0.70843124,0.00023003841,0.00070900115],"study_design_scores_gemma":[0.00028686976,0.00011136482,0.0013261257,0.000006326698,0.00045867462,0.0000104368455,0.0001330851,0.92116606,0.00006621836,0.06842804,0.007853699,0.00015311605],"about_ca_topic_score_codex":5.286088e-7,"about_ca_topic_score_gemma":9.594714e-7,"teacher_disagreement_score":0.8679294,"about_ca_system_score_codex":0.000025468804,"about_ca_system_score_gemma":0.00006206848,"threshold_uncertainty_score":0.4563159},"labels":[],"label_agreement":null},{"id":"W3007500615","doi":"10.1007/s10957-020-01633-w","title":"Connectedness of Solution Sets for Weak Generalized Symmetric Ky Fan Inequality Problems via Addition-Invariant Sets","year":2020,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; Kelowna General Hospital; University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Social connectedness; Mathematics; Invariant (physics); Solution set; Inequality; Equivalence (formal languages); Pure mathematics; Combinatorics; Mathematical analysis; Set (abstract data type)","score_opus":0.02784079282427759,"score_gpt":0.2731701944249676,"score_spread":0.24532940160069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3007500615","genre_codex":"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.00023039515,0.00012538773,0.9957877,0.0031656134,0.000046574958,0.00040314236,0.00006903178,0.00003105863,0.00014108658],"genre_scores_gemma":[0.6188967,0.00026894532,0.379402,0.00086029724,0.00016289268,0.00011956277,0.00023494556,0.000016873153,0.000037773098],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984,0.00026555525,0.0007593828,0.00021835526,0.00023984548,0.00011688327],"domain_scores_gemma":[0.99726766,0.000446152,0.0009701232,0.00017461342,0.0009892938,0.00015217025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009898413,0.0001243091,0.0002898786,0.00024217552,0.00022456005,0.00008111228,0.00032109115,0.00007581693,0.00007436499],"category_scores_gemma":[0.00031808057,0.00011118766,0.0001270848,0.0012378703,0.000048426224,0.0005535798,0.000053784763,0.000089163295,0.0000016058837],"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.000050334307,0.00013800683,0.000031845066,0.000052677584,0.00009735617,1.506958e-7,0.00034589082,0.49457473,0.0004662015,0.50093424,0.00018325915,0.0031253009],"study_design_scores_gemma":[0.0009924733,0.00011826006,0.00011701364,0.000017997623,0.0001128603,0.000013670774,0.00006352089,0.9603473,0.0006294287,0.03660696,0.00083530316,0.00014518558],"about_ca_topic_score_codex":0.0000024800095,"about_ca_topic_score_gemma":4.9550647e-7,"teacher_disagreement_score":0.6186663,"about_ca_system_score_codex":0.00002728155,"about_ca_system_score_gemma":0.0001078585,"threshold_uncertainty_score":0.45341012},"labels":[],"label_agreement":null},{"id":"W3016379773","doi":"10.1007/s10957-020-01760-4","title":"Optimal Dividend and Capital Structure with Debt Covenants","year":2020,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Credit Risk and Financial Regulations","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Dividend; Capital structure; Debt; Creditor; Bankruptcy; Capital (architecture); Economics; Covenant; Variational inequality; Mathematics; Mathematical economics; Finance; Mathematical optimization","score_opus":0.009743008380331772,"score_gpt":0.19768367126598352,"score_spread":0.18794066288565175,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3016379773","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.21141702,0.0016968828,0.7855261,0.0007744116,0.000022522327,0.00012472151,0.0000935314,0.0000072024113,0.00033763694],"genre_scores_gemma":[0.9828495,0.00063362176,0.016183585,0.000080955455,0.00018922522,0.0000053591607,0.000009963538,0.0000104372175,0.000037356895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9994527,0.000011258751,0.00030836268,0.00012383053,0.00002928441,0.00007452612],"domain_scores_gemma":[0.99936575,0.000057890524,0.00034734147,0.000065459746,0.000059463808,0.000104082734],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00015502064,0.00007482898,0.00017712274,0.000066937806,0.00013971081,0.000058794838,0.000069343485,0.000044836517,0.00008212025],"category_scores_gemma":[0.000059472062,0.00006624213,0.000024128125,0.00015654355,0.00008293986,0.00023986715,0.000018956029,0.000097451426,0.0000023972311],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011067936,0.00003439976,0.01238077,0.000017609176,0.000046253077,0.0000014626938,0.0009779423,0.13124779,0.000036324473,0.8529818,0.000109002205,0.0020559644],"study_design_scores_gemma":[0.0100172255,0.0023911167,0.2523416,0.00018206023,0.00046883168,0.00091423217,0.0046929736,0.098262146,0.00069367443,0.50686246,0.120905794,0.002267917],"about_ca_topic_score_codex":0.0000010649487,"about_ca_topic_score_gemma":6.2977733e-7,"teacher_disagreement_score":0.77143246,"about_ca_system_score_codex":0.000009148984,"about_ca_system_score_gemma":0.00001821812,"threshold_uncertainty_score":0.27012756},"labels":[],"label_agreement":null},{"id":"W3021784020","doi":"10.1023/a:1017515721760","title":"Robust Stability and Stabilizability of Markov Jump Linear Uncertain Systems with Mode-Dependent Time Delays","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":75,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Control theory (sociology); Mathematics; Theory of computation; Stability (learning theory); Class (philosophy); State (computer science); Jump; Linear system; Mode (computer interface); Controller (irrigation); Computer science; Control (management); Algorithm; Mathematical analysis","score_opus":0.012484941336952519,"score_gpt":0.21361769179469,"score_spread":0.20113275045773749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3021784020","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.14261496,0.0012728069,0.85468096,0.00004993877,0.000037215224,0.0005479043,0.00003680114,0.000037854817,0.0007215622],"genre_scores_gemma":[0.99490935,0.00033896373,0.0045528314,0.000007684296,0.00008005682,0.00005004939,0.000006622549,0.000019031431,0.000035443685],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862623,0.00021175016,0.00065436243,0.00016433827,0.00020673548,0.00013658327],"domain_scores_gemma":[0.99850154,0.00046235975,0.0002552884,0.00026769546,0.0003921664,0.00012093104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014441467,0.0001523031,0.00037718273,0.000085618965,0.00009301248,0.000035905654,0.00012298735,0.000086503154,0.00006595892],"category_scores_gemma":[0.00006543062,0.00012141379,0.000048696704,0.00022024527,0.0001629305,0.00024376782,0.000017510118,0.00014816083,6.941158e-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.00027858856,0.000093502866,0.0018298015,0.0001645421,0.00007520111,8.874446e-7,0.00024415297,0.99386275,0.00052913645,0.0019426277,0.000006966263,0.0009718255],"study_design_scores_gemma":[0.001139206,0.00020195496,0.0003242208,0.00009051859,0.00014089992,0.00014884317,0.0015241102,0.99409693,0.00026352145,0.0014928853,0.00034830705,0.0002285689],"about_ca_topic_score_codex":0.000008747373,"about_ca_topic_score_gemma":0.0000035699936,"teacher_disagreement_score":0.8522944,"about_ca_system_score_codex":0.00006762221,"about_ca_system_score_gemma":0.000047772224,"threshold_uncertainty_score":0.49511105},"labels":[],"label_agreement":null},{"id":"W3036623140","doi":"10.1007/s10957-023-02297-y","title":"Unified Analysis of Stochastic Gradient Methods for Composite Convex and Smooth Optimization","year":2023,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Global Collaborative Research, King Abdullah University of Science and Technology; Institut de Valorisation des Données; King Abdullah University of Science and Technology","keywords":"Mathematics; Convexity; Stochastic gradient descent; Convex function; Theory of computation; Convergence (economics); Mathematical optimization; Convex optimization; Applied mathematics; Variance (accounting); Regular polygon; Algorithm; Computer science; Artificial intelligence; Artificial neural network","score_opus":0.019978886667379847,"score_gpt":0.32969155642016446,"score_spread":0.3097126697527846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3036623140","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.00018281734,0.00016959175,0.9987539,0.00022888262,0.00005432805,0.0004778955,0.0000138689265,0.000077907505,0.000040814644],"genre_scores_gemma":[0.04205905,0.00018779578,0.9574853,0.00006694868,0.000022384018,0.000088167006,0.00004231723,0.000012938355,0.000035079906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987174,0.00018802234,0.00060249126,0.00021885437,0.00014219973,0.00013098164],"domain_scores_gemma":[0.9971714,0.0011890973,0.00070679764,0.00025150148,0.00057549414,0.00010569259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016519706,0.00012575115,0.00036234106,0.0010507714,0.00017988082,0.00007560514,0.00029275363,0.00006616234,0.000008030246],"category_scores_gemma":[0.00022007516,0.00011699053,0.00010293342,0.0022215152,0.00012409678,0.00029827925,0.00007895998,0.00007194743,1.5701272e-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.000022782022,0.0000334548,0.000014203346,0.000012980867,0.00015190545,9.528527e-8,0.00025112292,0.721257,0.00013265325,0.27399802,0.000012956295,0.004112837],"study_design_scores_gemma":[0.00035625344,0.000100585574,0.00013922922,0.000018041888,0.0004541283,0.000007966722,0.000091039954,0.9735177,0.000269915,0.024892038,0.000045506185,0.00010755099],"about_ca_topic_score_codex":6.418002e-7,"about_ca_topic_score_gemma":8.722086e-8,"teacher_disagreement_score":0.25226074,"about_ca_system_score_codex":0.000021185433,"about_ca_system_score_gemma":0.000039552648,"threshold_uncertainty_score":0.47707352},"labels":[],"label_agreement":null},{"id":"W3040442494","doi":"10.1007/s10957-020-01706-w","title":"On Approximate Stationary Points of the Regularized Mathematical Program with Complementarity Constraints","year":2020,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph; Université de Sherbrooke","funders":"Fonds de recherche du Québec – Nature et technologies; Conseil Régional de Bretagne; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; Agence Nationale de la Recherche","keywords":"Stationary point; Mathematics; Theory of computation; Complementarity (molecular biology); Stationary sequence; Sequence (biology); Stationary solution; Applied mathematics; Regularization (linguistics); Convergence (economics); Stationary state; Mathematical optimization; Weak convergence; Constraint (computer-aided design); Stationary process; Mathematical analysis; Stochastic process; Algorithm; Computer science; Geometry","score_opus":0.01314037019398161,"score_gpt":0.2549632184526553,"score_spread":0.24182284825867367,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3040442494","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031817897,0.00000749225,0.99264,0.006039394,0.000008328829,0.0003368872,0.00001023597,0.000017332377,0.00062215806],"genre_scores_gemma":[0.2628423,0.000015926798,0.73557645,0.0014518565,0.000028828606,0.000034549725,0.000013619547,0.000007385889,0.000029105202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989747,0.00016654558,0.0003922388,0.00012138754,0.00027852913,0.000066630615],"domain_scores_gemma":[0.99867105,0.00024812104,0.00051706284,0.00015943924,0.00032458233,0.000079757345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00037330744,0.00007999308,0.00016089685,0.000053969132,0.00014502041,0.000054945278,0.00030865314,0.000024616571,0.00012529118],"category_scores_gemma":[0.00009005711,0.00004998959,0.000058716876,0.00046817094,0.00015244824,0.00020775295,0.000051842653,0.00009641964,0.0000011595413],"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.00005366592,0.00019671168,0.000044960394,0.000016995875,0.000059150796,2.6706928e-7,0.00024759214,0.13871844,0.000026454436,0.85846895,0.000057748723,0.0021090708],"study_design_scores_gemma":[0.0014236683,0.00029799595,0.0004330155,0.000049977887,0.000116536066,0.000039732917,0.00025836457,0.81899583,0.0003972201,0.17751619,0.0003282215,0.00014326324],"about_ca_topic_score_codex":1.2597214e-7,"about_ca_topic_score_gemma":7.1003136e-8,"teacher_disagreement_score":0.6809527,"about_ca_system_score_codex":0.000011537103,"about_ca_system_score_gemma":0.0000748915,"threshold_uncertainty_score":0.20385163},"labels":[],"label_agreement":null},{"id":"W3096467617","doi":"10.1007/s10957-020-01769-9","title":"Measure-Driven Nonlinear Dynamic Systems with Applications to Optimal Impulsive Controls","year":2020,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Theory of computation; Mathematics; Nonlinear system; Optimal control; Class (philosophy); Impulse (physics); Measure (data warehouse); Mathematical optimization; Control theory (sociology); Control (management); Applied mathematics; Computer science; Algorithm","score_opus":0.013305504361725133,"score_gpt":0.27358812244913294,"score_spread":0.2602826180874078,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3096467617","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.00020957895,0.0005737877,0.9932184,0.004614546,0.000014737802,0.0010356865,0.000010734032,0.000053613963,0.00026889535],"genre_scores_gemma":[0.50622004,0.00035349999,0.49183756,0.0007027205,0.0002241831,0.0005548318,0.00001557515,0.000028575483,0.000063013125],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984438,0.0002871861,0.0004789293,0.0002500274,0.00035736844,0.00018269567],"domain_scores_gemma":[0.99742305,0.00040681954,0.00041473954,0.00049807143,0.0008877821,0.0003695433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062773464,0.00013989428,0.00026224236,0.00015060586,0.00028728452,0.00026985543,0.0011125497,0.000059406666,0.000008046863],"category_scores_gemma":[0.00006656418,0.00011574517,0.000050778155,0.0009350703,0.00009248477,0.0004449051,0.00017882543,0.00027847965,0.00001367001],"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.000077413344,0.00006398044,0.000016012491,0.000012906935,0.000052917516,0.0000011820689,0.00038109455,0.910741,0.00027422162,0.081982374,0.00006435896,0.0063325786],"study_design_scores_gemma":[0.000667775,0.00022481302,0.000028537901,0.00003778062,0.00003206567,0.00007368332,0.0003923505,0.9890374,0.00005564407,0.00032322723,0.008956515,0.0001702268],"about_ca_topic_score_codex":5.91584e-7,"about_ca_topic_score_gemma":4.1370194e-7,"teacher_disagreement_score":0.5060105,"about_ca_system_score_codex":0.000047739544,"about_ca_system_score_gemma":0.00016039712,"threshold_uncertainty_score":0.47199512},"labels":[],"label_agreement":null},{"id":"W3120315277","doi":"10.1007/s10957-020-01796-6","title":"A Nonmonotone Trust Region Method for Unconstrained Optimization Problems on Riemannian Manifolds","year":2021,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Trust region; Mathematics; Theory of computation; Convergence (economics); Mathematical optimization; Order (exchange); Applied mathematics; Rate of convergence; Stationary point; Quadratic equation; Riemannian geometry; Mathematical analysis; Computer science; Algorithm; Geometry","score_opus":0.04020131094185135,"score_gpt":0.3669768293300348,"score_spread":0.3267755183881834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120315277","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.000031600302,0.00012682802,0.99629873,0.0010862662,0.000052335716,0.00096372317,0.000021021162,0.000042627897,0.0013768482],"genre_scores_gemma":[0.001468135,0.0004285682,0.99535275,0.0002177001,0.0002149532,0.000255075,0.00005734816,0.000056125064,0.0019493464],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99812424,0.0003277122,0.0007538056,0.00029305188,0.00028625285,0.0002149085],"domain_scores_gemma":[0.9961065,0.0013932985,0.0007102062,0.0003146404,0.0013097753,0.00016556386],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013629077,0.00019569203,0.00035233577,0.00025619767,0.00034600892,0.00010557782,0.00017705471,0.0001407732,0.0001442585],"category_scores_gemma":[0.0010371808,0.00018213018,0.0001301545,0.0005877787,0.00009245547,0.00031842722,0.00003847768,0.00021910238,0.0000013237734],"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.00013327754,0.00023111263,0.000004841588,0.000070845046,0.000060932944,0.0000037537695,0.00016936824,0.74556816,0.000058519814,0.24818878,0.00017365241,0.005336769],"study_design_scores_gemma":[0.002513614,0.00026750375,0.0000036327215,0.00014232726,0.00017547814,0.0004018189,0.0008841641,0.7770188,0.0015626985,0.2124659,0.004249789,0.00031426392],"about_ca_topic_score_codex":2.0745337e-7,"about_ca_topic_score_gemma":4.6741226e-7,"teacher_disagreement_score":0.03572288,"about_ca_system_score_codex":0.00008138085,"about_ca_system_score_gemma":0.00017294845,"threshold_uncertainty_score":0.74270535},"labels":[],"label_agreement":null},{"id":"W3129421534","doi":"10.1007/s10957-021-01920-0","title":"Sampled-Data Nash Equilibria in Differential Games with Impulse Controls","year":2021,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Air Force Office of Scientific Research; Fonds de recherche du Québec – Nature et technologies; Science and Engineering Research Board; University of Illinois at Urbana-Champaign","keywords":"Mathematics; Nash equilibrium; Differential game; Piecewise; Equilibrium point; Nonlinear system; Impulse (physics); Impulse control; Applied mathematics; Initial value problem; Control theory (sociology); Differential equation; Mathematical optimization; Computer science; Mathematical analysis; Control (management)","score_opus":0.007673408380927536,"score_gpt":0.23303954369394975,"score_spread":0.22536613531302221,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3129421534","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.006271024,0.0010618098,0.9918948,0.00009221249,0.000050065053,0.00020898116,0.00002565868,0.000032078973,0.00036336257],"genre_scores_gemma":[0.95808583,0.0005681551,0.040853344,0.000036422203,0.00020257683,0.00003975237,0.00009803018,0.000032689702,0.00008317022],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991325,0.000096728174,0.0004085597,0.00013397518,0.00011187698,0.00011635418],"domain_scores_gemma":[0.9991114,0.00021481504,0.00016457633,0.00027882252,0.00016482026,0.00006554412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026834605,0.00010891129,0.00023750938,0.00009776316,0.000046704215,0.000063926615,0.00015660716,0.000051968484,0.000057447767],"category_scores_gemma":[0.000075819924,0.0000952699,0.000023476086,0.0002566978,0.00003453172,0.00044580162,0.000033334407,0.00012796475,8.2204366e-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.00006992115,0.000038717866,0.00017533537,0.000022470866,0.000057713707,0.0000042138645,0.00007099207,0.9822656,0.002393945,0.010925846,0.000026215255,0.003949032],"study_design_scores_gemma":[0.0032160745,0.000050717368,0.00051535474,0.00011635233,0.0001256108,0.00022123162,0.00041026904,0.9869149,0.00041566716,0.0054025226,0.0023416607,0.00026968296],"about_ca_topic_score_codex":3.9077906e-7,"about_ca_topic_score_gemma":0.0000036478832,"teacher_disagreement_score":0.95181483,"about_ca_system_score_codex":0.000030111865,"about_ca_system_score_gemma":0.000042095446,"threshold_uncertainty_score":0.38849935},"labels":[],"label_agreement":null},{"id":"W3184722921","doi":"10.1007/s10957-021-01892-1","title":"Nonlinear Optimal Approach to Spacecraft Formation Flying Using Lorentz and Impulsive Actuation","year":2021,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Spacecraft Dynamics and Control","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Control theory (sociology); Optimal control; Nonlinear system; Lorentz force; Lorentz transformation; Hamilton–Jacobi–Bellman equation; Spacecraft; Hybrid system; Mathematics; Nonlinear control; Computer science; Mathematical optimization; Control (management); Classical mechanics; Physics; Engineering; Aerospace engineering","score_opus":0.006652974233293743,"score_gpt":0.22347874411267651,"score_spread":0.21682576987938276,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3184722921","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.04532693,0.00031821165,0.9538013,0.000091073,0.000034535424,0.00016757373,0.000007094657,0.000017228806,0.00023609056],"genre_scores_gemma":[0.688321,0.00040934983,0.31089023,0.000088811634,0.00018470887,0.000025082994,0.000028884784,0.00002395808,0.0000279942],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994511,0.000030404255,0.00024908115,0.000084769825,0.00009251113,0.000092113485],"domain_scores_gemma":[0.99946207,0.00005772358,0.00010604158,0.00008339005,0.00020011923,0.0000906728],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025042912,0.00008986731,0.00013397654,0.000113248076,0.00013240082,0.00008731905,0.000045554396,0.000048998045,0.000007640229],"category_scores_gemma":[0.000033335127,0.00008882194,0.000032344447,0.0002043461,0.000017380124,0.00030633018,0.000018927365,0.00009645205,6.007702e-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.000014921861,0.000028075749,0.000016761896,0.00002471425,0.000031835603,4.7037733e-7,0.00046130441,0.9785968,0.010165676,0.005005086,0.0000086983955,0.0056456598],"study_design_scores_gemma":[0.0003244929,0.000016352174,0.00003784935,0.000020871252,0.00005861787,0.00012185414,0.00087395776,0.99646765,0.0009013782,0.0006731993,0.00040828297,0.00009549125],"about_ca_topic_score_codex":2.8598802e-7,"about_ca_topic_score_gemma":2.8639107e-7,"teacher_disagreement_score":0.64299405,"about_ca_system_score_codex":0.00003765505,"about_ca_system_score_gemma":0.000020789439,"threshold_uncertainty_score":0.36220533},"labels":[],"label_agreement":null},{"id":"W3190397611","doi":"10.1007/s10957-021-01909-9","title":"Optimal Replenishment Strategy for Inventory Mechanism with Step-Shaped Demand","year":2021,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Fredericton; University of New Brunswick","funders":"National Natural Science Foundation of China","keywords":"Theory of computation; Counterintuitive; Mathematical optimization; Time horizon; Economic order quantity; Mathematics; Minification; Order (exchange); Economics","score_opus":0.018154689552088748,"score_gpt":0.24044607024125275,"score_spread":0.22229138068916401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3190397611","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.0028915924,0.00026659225,0.99330056,0.0005345039,0.00007232417,0.00041477653,0.00000297168,0.00002259282,0.002494068],"genre_scores_gemma":[0.9076517,0.00048060293,0.080304384,0.0045902524,0.0025844637,0.00048046646,0.00019169744,0.00009495386,0.003621439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991614,0.000027807362,0.0003430223,0.00017309214,0.00016411341,0.0001305472],"domain_scores_gemma":[0.99889404,0.000059594073,0.0004257698,0.00015236571,0.00044155514,0.000026705382],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00073714333,0.000119185956,0.00016915161,0.00013616137,0.00022758872,0.00020877787,0.000119481265,0.000040809195,0.00027372545],"category_scores_gemma":[0.00003974069,0.00010040656,0.00006550684,0.00022410252,0.000045804358,0.00056897686,0.000049117007,0.000075633114,0.0000032597911],"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.00020847977,0.00019890095,0.00009839785,0.00013854883,0.000122051286,0.0000060781163,0.000040419174,0.15980616,0.00015043143,0.8360099,0.0013496478,0.0018709577],"study_design_scores_gemma":[0.008685328,0.0004312758,0.0002384303,0.00031153802,0.0014770792,0.00015894642,0.011337543,0.44833806,0.0013824672,0.16474214,0.36177814,0.0011190668],"about_ca_topic_score_codex":8.9056897e-7,"about_ca_topic_score_gemma":0.0000014241782,"teacher_disagreement_score":0.9129962,"about_ca_system_score_codex":0.000022548395,"about_ca_system_score_gemma":0.00004619391,"threshold_uncertainty_score":0.40944606},"labels":[],"label_agreement":null},{"id":"W3205428754","doi":"10.1007/s10957-023-02219-y","title":"Calculus Rules of the Generalized Concave Kurdyka–Łojasiewicz Property","year":2023,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Approximation Theory and Sequence Spaces","field":"Mathematics","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Property (philosophy); Differentiable function; Mathematics; Concave function; Theory of computation; Function (biology); Class (philosophy); Calculus (dental); Applied mathematics; Computer science; Pure mathematics; Algorithm; Geometry; Regular polygon","score_opus":0.034540673689496496,"score_gpt":0.3066063765173234,"score_spread":0.27206570282782694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3205428754","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.059892543,0.00018867152,0.9350914,0.0013477153,0.0000956569,0.00067454716,0.00002745209,0.000053907534,0.0026281334],"genre_scores_gemma":[0.91653234,0.0007707516,0.07263971,0.00037293453,0.0003740498,0.0001714954,0.000022116134,0.000060178412,0.009056417],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99885267,0.00030257684,0.00047476997,0.00008909685,0.00018385325,0.00009705353],"domain_scores_gemma":[0.99836874,0.00044563648,0.000653828,0.00020504132,0.00027578446,0.000050942217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001463048,0.00009194428,0.00020349496,0.000089866844,0.00021686786,0.0000253268,0.00021870119,0.00005973892,0.00009473638],"category_scores_gemma":[0.00043172392,0.000048743812,0.00009336778,0.00033898503,0.00022160006,0.00015912867,0.000045960263,0.000109640125,0.0000041658473],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046646994,0.000051309606,0.000026650147,0.000054921667,0.000040290284,4.349682e-7,0.00072205946,0.015083279,0.0010312697,0.98082674,0.00043603618,0.0016803643],"study_design_scores_gemma":[0.0006650246,0.000045804045,0.00006516506,0.00007014552,0.00014420741,0.000055761735,0.0015237526,0.015656216,0.006583684,0.9725283,0.002525761,0.00013622311],"about_ca_topic_score_codex":6.671036e-7,"about_ca_topic_score_gemma":2.3734893e-7,"teacher_disagreement_score":0.8624517,"about_ca_system_score_codex":0.000015097831,"about_ca_system_score_gemma":0.000064244465,"threshold_uncertainty_score":0.1987715},"labels":[],"label_agreement":null},{"id":"W353671651","doi":"10.1023/a:1017595513275","title":"On the Convergence of Cone Splitting Algorithms with ω-Subdivisions","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Hyperplane; Polytope; Mathematics; Cone (formal languages); Subdivision; Theory of computation; Convergence (economics); Algorithm; Minification; Function (biology); Dual cone and polar cone; Path (computing); Combinatorics; Discrete mathematics; Mathematical optimization; Geometry; Computer science; Regular polygon","score_opus":0.031888483803697354,"score_gpt":0.33531596593877283,"score_spread":0.3034274821350755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W353671651","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.0039176866,0.000078024634,0.99383456,0.00058162725,0.000017448625,0.00033576268,0.000006452753,0.0000126482355,0.0012157793],"genre_scores_gemma":[0.40517917,0.0014773061,0.5915041,0.00025619546,0.00017159038,0.00009815915,0.0000077653185,0.000056609108,0.0012491195],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99882996,0.00017464673,0.00045465742,0.00011311043,0.0003086252,0.00011897375],"domain_scores_gemma":[0.9960954,0.0023798998,0.00058316503,0.0002356549,0.000626076,0.00007977926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011874919,0.0001015279,0.00018864189,0.00012250664,0.00023592982,0.000026061423,0.00020602456,0.000041113813,0.0003432678],"category_scores_gemma":[0.00067722244,0.00006238621,0.000042741576,0.000507397,0.000222238,0.00016070262,0.000031569183,0.00019940044,0.000002112985],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014655503,0.00019283783,0.00007403798,0.00001695359,0.000057713423,0.0000023292232,0.00023401779,0.25287485,0.000096160424,0.7422997,0.00009806437,0.0039068055],"study_design_scores_gemma":[0.0025188685,0.0007347757,0.00014115704,0.0003602017,0.0002133044,0.0004571816,0.004062572,0.19289178,0.0044799023,0.7911894,0.002509227,0.0004416815],"about_ca_topic_score_codex":2.940018e-7,"about_ca_topic_score_gemma":1.5892478e-7,"teacher_disagreement_score":0.4023305,"about_ca_system_score_codex":0.000019347943,"about_ca_system_score_gemma":0.00005626812,"threshold_uncertainty_score":0.3758542},"labels":[],"label_agreement":null},{"id":"W4321454809","doi":"10.1007/s10957-023-02167-7","title":"Uniqueness in Nuclear Norm Minimization: Flatness of the Nuclear Norm Sphere and Simultaneous Polarization","year":2023,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Uniqueness; Mathematics; Norm (philosophy); Subderivative; Operator norm; Convex hull; Pure mathematics; Matrix norm; Dual norm; Affine transformation; Subspace topology; Theory of computation; Regular polygon; Applied mathematics; Mathematical analysis; Convex optimization; Operator theory; Geometry; Banach space; Algorithm; Physics","score_opus":0.005006997611517314,"score_gpt":0.2045037808553128,"score_spread":0.19949678324379547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4321454809","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.5552812,0.0005456179,0.43945184,0.0005259235,0.00018689458,0.00078849785,0.000020190972,0.00034191288,0.0028579151],"genre_scores_gemma":[0.9957037,0.0005772059,0.0035659496,0.000040009993,0.000038020265,0.0000034246286,0.000004368109,0.000024547448,0.000042769694],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994354,0.000046161887,0.00028605643,0.00007174733,0.00008799956,0.00007259997],"domain_scores_gemma":[0.9994278,0.00013926026,0.00014586396,0.00012861635,0.00012729889,0.000031157346],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019006066,0.0000798866,0.00013141065,0.000110450674,0.00009607035,0.000029309445,0.00011546239,0.00007058938,0.000018387096],"category_scores_gemma":[0.00004914126,0.00006660129,0.000026882499,0.00049859646,0.0000704102,0.00013779943,0.000034820783,0.00010783166,6.649888e-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.000022961476,0.000019435338,0.00018111872,0.00002557966,0.00001565433,0.0000014750957,0.00037743917,0.9729508,0.0018926088,0.019021394,0.000063845866,0.0054276823],"study_design_scores_gemma":[0.000484074,0.00004406406,0.0015369266,0.00020348316,0.00006114969,0.00007593625,0.000921796,0.980177,0.002792736,0.009912612,0.003585992,0.00020423435],"about_ca_topic_score_codex":0.0000016019127,"about_ca_topic_score_gemma":0.0000014821663,"teacher_disagreement_score":0.4404225,"about_ca_system_score_codex":0.000016398133,"about_ca_system_score_gemma":0.000012956486,"threshold_uncertainty_score":0.2715922},"labels":[],"label_agreement":null},{"id":"W4379653531","doi":"10.1007/s10957-023-02246-9","title":"Optimal Contraception Control Problems in a Nonlinear Size-Structured Vermin Model","year":2023,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Nonlinear Partial Differential Equations","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"Natural Science Foundation of Shanxi Province; National Natural Science Foundation of China","keywords":"Mathematics; Theory of computation; Optimal control; Control variable; Applied mathematics; Nonlinear system; Separable space; Mathematical analysis; Mathematical optimization; Statistics; Physics; Algorithm","score_opus":0.023392923190000768,"score_gpt":0.3088603105648445,"score_spread":0.28546738737484373,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4379653531","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.05891563,0.000035309615,0.94001806,0.0002815906,0.00003373478,0.0005324415,0.00004141623,0.000042989857,0.000098845],"genre_scores_gemma":[0.8604645,0.00015417415,0.13853301,0.000074540876,0.00023898759,0.00012489305,0.000031548265,0.000035988538,0.00034232455],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987561,0.00016526101,0.0006170383,0.00013008657,0.00017980768,0.00015168467],"domain_scores_gemma":[0.9983751,0.00078745495,0.0003948964,0.00014310564,0.0002170106,0.00008243922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009874079,0.000117874275,0.00025039873,0.00019731479,0.00011032692,0.000044548324,0.0001223234,0.00009179619,0.000065989225],"category_scores_gemma":[0.0005772623,0.0001058325,0.00007018896,0.00042144104,0.00006735265,0.00020704781,0.000019986015,0.00018478371,0.0000061247974],"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.000080442005,0.000120373195,0.00004963625,0.000025735919,0.000028346405,9.1960464e-7,0.00034328876,0.93765223,0.0017535812,0.05893624,0.000057667974,0.0009515096],"study_design_scores_gemma":[0.0014946241,0.000043506792,0.00016384968,0.00003564815,0.000079306075,0.000014918062,0.00016712402,0.8570995,0.00016398489,0.14051445,0.00011134126,0.00011176899],"about_ca_topic_score_codex":5.812029e-7,"about_ca_topic_score_gemma":0.0000037371117,"teacher_disagreement_score":0.8015489,"about_ca_system_score_codex":0.000031294338,"about_ca_system_score_gemma":0.00007428374,"threshold_uncertainty_score":0.4315724},"labels":[],"label_agreement":null},{"id":"W4391956260","doi":"10.1007/s10957-024-02383-9","title":"A Mirror Inertial Forward–Reflected–Backward Splitting: Convergence Analysis Beyond Convexity and Lipschitz Smoothness","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Convexity; Smoothness; Inertial frame of reference; Mathematics; Lipschitz continuity; Theory of computation; Applied mathematics; Rate of convergence; Function (biology); Convergence (economics); Mathematical optimization; Mathematical analysis; Computer science; Key (lock); Algorithm; Classical mechanics","score_opus":0.00657811400616399,"score_gpt":0.2477912233952005,"score_spread":0.2412131093890365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4391956260","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.061424527,0.0018641386,0.9356441,0.00011696657,0.00007908607,0.00012068062,0.00000876613,0.00014672463,0.00059503596],"genre_scores_gemma":[0.9805673,0.0009330933,0.018286033,0.00004682164,0.00007715203,0.000014802387,0.000008765037,0.000016830332,0.000049214905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999343,0.000049788956,0.00030170023,0.00012096644,0.000091972805,0.00009260884],"domain_scores_gemma":[0.9994549,0.00014635707,0.00007986341,0.00011550408,0.00012469784,0.00007865671],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030767635,0.00010863496,0.00019626098,0.00024580603,0.000089253466,0.00010027172,0.00008219856,0.00006488581,0.000048950165],"category_scores_gemma":[0.000023894507,0.00009632748,0.00007403352,0.00053563964,0.00007908875,0.00018194674,0.000021445088,0.00015550472,0.0000012432208],"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.00022940336,0.00016529328,0.001985043,0.00036575377,0.0034845946,0.00003434666,0.002071249,0.6615563,0.033367954,0.25454423,0.0014084687,0.040787365],"study_design_scores_gemma":[0.00035047083,0.00007819781,0.0012966311,0.0001288628,0.0015348565,0.0001427515,0.00027479458,0.9373457,0.014143855,0.035071045,0.009232825,0.00040003352],"about_ca_topic_score_codex":0.000001668644,"about_ca_topic_score_gemma":0.0000010496898,"teacher_disagreement_score":0.9191428,"about_ca_system_score_codex":0.000014913887,"about_ca_system_score_gemma":0.000019613617,"threshold_uncertainty_score":0.39281207},"labels":[],"label_agreement":null},{"id":"W4394678881","doi":"10.1007/s10957-024-02419-0","title":"Infeasible and Critically Feasible Optimal Control","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"University of South Australia","keywords":"Mathematics; Theory of computation; Mathematical optimization; Optimal control; Algorithm","score_opus":0.003623036416750435,"score_gpt":0.228363450566542,"score_spread":0.22474041414979157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394678881","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.0005718123,0.0054727155,0.9922579,0.00019521707,0.00008703255,0.00022440193,0.000009237123,0.00010372222,0.0010779551],"genre_scores_gemma":[0.9438039,0.0010648606,0.05458007,0.00008689644,0.00025088663,0.00005582456,0.0000046776604,0.000035225297,0.00011768173],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993363,0.000048315065,0.00032770893,0.000095074465,0.00008912661,0.00010344674],"domain_scores_gemma":[0.99933267,0.00026721886,0.000049329326,0.00008163286,0.00017259266,0.0000965372],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039684577,0.00010111746,0.00016099607,0.00014991475,0.0000773561,0.00012878659,0.00005968907,0.000058894486,0.00003111352],"category_scores_gemma":[0.00006654881,0.0000924514,0.000034029406,0.00019077658,0.000055282162,0.00044916326,0.000008450921,0.00013178616,0.0000028055563],"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.000017447737,0.000009502143,0.000024931165,0.00006423086,0.000049138827,0.00000203648,0.000060817205,0.86754483,0.00042941168,0.12695503,0.000065560766,0.0047770613],"study_design_scores_gemma":[0.0006825623,0.000055004242,0.00005442368,0.000098708486,0.00012912625,0.00024488606,0.00016466832,0.98226875,0.00010628377,0.010550399,0.0054829232,0.0001622728],"about_ca_topic_score_codex":1.2268896e-7,"about_ca_topic_score_gemma":8.487606e-8,"teacher_disagreement_score":0.94323206,"about_ca_system_score_codex":0.000026298787,"about_ca_system_score_gemma":0.000023673498,"threshold_uncertainty_score":0.37700588},"labels":[],"label_agreement":null},{"id":"W4396781416","doi":"10.1007/s10957-024-02438-x","title":"Robust Risk Management via Multi-marginal Optimal Transport","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Toxic Organic Pollutants Impact","field":"Environmental Science","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Centre National de la Recherche Scientifique; Université Paris-Sud; Agence Nationale de la Recherche","keywords":"Mathematics; Marginal distribution; Equivalence (formal languages); Joint probability distribution; Lipschitz continuity; Function (biology); Stability (learning theory); Mathematical optimization; Equivalence class (music); Random variable; Bellman equation; Applied mathematics; Theory of computation; Mathematical analysis; Statistics; Computer science; Discrete mathematics","score_opus":0.008078527203957053,"score_gpt":0.22992667189589994,"score_spread":0.2218481446919429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396781416","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.0033303213,0.0002661452,0.9940412,0.0001255113,0.000057381036,0.00016869466,0.000025624287,0.000028532178,0.0019565937],"genre_scores_gemma":[0.8469412,0.0007703794,0.15124127,0.00006266421,0.000078036996,0.00000955464,0.0000018599752,0.000019324421,0.0008757443],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992411,0.000059354526,0.00027637,0.00014329267,0.00016123906,0.00011863403],"domain_scores_gemma":[0.9995809,0.000058056194,0.00012866444,0.000117104515,0.0000039045203,0.0001113802],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00068924815,0.00009490703,0.000097554315,0.0000692812,0.00013494829,0.00004580295,0.00014273396,0.000034319906,0.001354782],"category_scores_gemma":[0.000008988468,0.00007772876,0.00005368319,0.00027612134,0.00011161998,0.00031287025,0.000025258241,0.00015083358,0.00004677817],"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.00004808828,0.0001267712,0.0002996286,0.000011250427,0.000084155996,0.000018070255,0.00030084339,0.81215686,0.0002998562,0.0036598928,0.00010901466,0.18288559],"study_design_scores_gemma":[0.0032901058,0.00049052323,0.07156769,0.00023241954,0.0018152028,0.0019254579,0.0015038293,0.8064462,0.0017107672,0.017954594,0.09174856,0.001314683],"about_ca_topic_score_codex":0.0000010089054,"about_ca_topic_score_gemma":5.058992e-7,"teacher_disagreement_score":0.8436108,"about_ca_system_score_codex":0.000066468165,"about_ca_system_score_gemma":0.000010593397,"threshold_uncertainty_score":0.9995581},"labels":[],"label_agreement":null},{"id":"W4399525519","doi":"10.1007/s10957-024-02469-4","title":"Directional Derivative of the Value Function for Parametric Set-Constrained Optimization Problems","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Theory of computation; Directional derivative; Parametric statistics; Mathematical optimization; Set (abstract data type); Function (biology); Derivative (finance); Value (mathematics); Parametric programming; Bellman equation; Applied mathematics; Algorithm; Mathematical analysis; Computer science; Statistics","score_opus":0.011051055988377318,"score_gpt":0.24836058291853402,"score_spread":0.2373095269301567,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399525519","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000038737486,0.00039425652,0.9973771,0.0012197805,0.00019572036,0.00038910148,0.000013861272,0.000032992124,0.00033842394],"genre_scores_gemma":[0.39664584,0.00041492225,0.601345,0.00034428676,0.00029674877,0.0001856722,0.000047320613,0.000024928535,0.00069524895],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998817,0.00016048126,0.00052011805,0.00018284285,0.00023240091,0.00008715511],"domain_scores_gemma":[0.99801147,0.00068676774,0.00044711755,0.00015971385,0.0006435789,0.000051332237],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009606744,0.00010488784,0.00015966714,0.00032912844,0.0002462716,0.0001466829,0.00025963187,0.00006315336,0.000036802398],"category_scores_gemma":[0.00021062711,0.00007500968,0.00015212118,0.0016674115,0.000081729464,0.0005880064,0.000040423958,0.00010225505,5.3461844e-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.000010709146,0.000032571996,0.000014351138,0.000020749643,0.000070691225,2.942873e-8,0.000092299575,0.5970414,0.00003463983,0.40065205,0.000038417787,0.001992079],"study_design_scores_gemma":[0.0002530156,0.0000628437,0.000091661524,0.000041031926,0.00012941918,0.000021588605,0.000059691807,0.9498832,0.00022844765,0.047443647,0.0017016169,0.000083837615],"about_ca_topic_score_codex":6.682456e-7,"about_ca_topic_score_gemma":1.4972471e-7,"teacher_disagreement_score":0.39660713,"about_ca_system_score_codex":0.00003777313,"about_ca_system_score_gemma":0.00016759595,"threshold_uncertainty_score":0.3058806},"labels":[],"label_agreement":null},{"id":"W4400259585","doi":"10.1007/s10957-024-02485-4","title":"State-Dependent Sweeping Processes: Asymptotic Behavior and Algorithmic Approaches","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Theory of computation; Mathematics; State (computer science); State dependent; Applied mathematics; Mathematical optimization; Mathematical economics; Algorithm","score_opus":0.01581851546151451,"score_gpt":0.24916689482874468,"score_spread":0.23334837936723019,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400259585","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00031904047,0.0015027235,0.9971262,0.00062054093,0.000043586024,0.00016606657,0.0000043718974,0.000044198536,0.00017326041],"genre_scores_gemma":[0.6652142,0.0021511407,0.33149764,0.00019077149,0.00020704286,0.00012827224,0.00001637398,0.000023770637,0.0005707926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991277,0.000080148384,0.00033879105,0.00019199053,0.00017568543,0.00008571897],"domain_scores_gemma":[0.9991966,0.00021882413,0.00016931731,0.00011295756,0.0002130555,0.000089269524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00066097773,0.00009373556,0.00012872179,0.00024120713,0.00016905606,0.00041513363,0.00019022233,0.00003619677,0.000021333084],"category_scores_gemma":[0.000045852412,0.00007833435,0.00003641642,0.00057378213,0.000043817156,0.0007731344,0.000054540884,0.00010793938,0.0000027608635],"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.0000072905355,0.000113967166,0.00011108618,0.00009187433,0.00009470436,0.0000043700643,0.00070386886,0.44376364,0.000024587789,0.50700605,0.0000142996105,0.04806428],"study_design_scores_gemma":[0.000305477,0.00006038813,0.00026565033,0.00006522167,0.00018966096,0.0002569888,0.00025244374,0.9548789,0.0001849466,0.04259662,0.0007316041,0.00021210147],"about_ca_topic_score_codex":4.879315e-7,"about_ca_topic_score_gemma":2.632608e-7,"teacher_disagreement_score":0.6656286,"about_ca_system_score_codex":0.000022269343,"about_ca_system_score_gemma":0.00011606298,"threshold_uncertainty_score":0.4003143},"labels":[],"label_agreement":null},{"id":"W4401893304","doi":"10.1007/s10957-024-02518-y","title":"An Adaptive Distributionally Robust Optimization Approach for Optimal Sizing of Hybrid Renewable Energy Systems","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Electric Power System Optimization","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Sizing; Mathematical optimization; Renewable energy; Robust optimization; Theory of computation; Stochastic programming; Mathematics; Computer science; Engineering; Algorithm","score_opus":0.008154231816268995,"score_gpt":0.21059023431970939,"score_spread":0.2024360025034404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401893304","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.000037928236,0.0045399354,0.9938819,0.000010731907,0.0001507205,0.00039459637,0.0001005213,0.000105938176,0.00077775976],"genre_scores_gemma":[0.583736,0.0007716189,0.41436437,0.000007732518,0.00031506477,0.00020592811,0.00043115596,0.000063647974,0.00010448893],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99863505,0.0001138964,0.0007025174,0.00019167025,0.00019189923,0.0001649834],"domain_scores_gemma":[0.9987144,0.0002582741,0.00026613325,0.00016933249,0.00048708686,0.00010477912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008557386,0.00017325228,0.00028579246,0.0002835163,0.00012693554,0.00013528895,0.00017526012,0.00008231557,0.000010256685],"category_scores_gemma":[0.000037910977,0.0001686883,0.00008529681,0.0004813811,0.000050544037,0.00064707134,0.000011303958,0.00010042561,1.3245426e-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.00006644921,0.00006111443,0.0000022035822,0.00016344334,0.00012099679,6.406641e-7,0.00004844007,0.9579653,0.00018404769,0.040654916,0.00020155744,0.00053084834],"study_design_scores_gemma":[0.00025685795,0.00014269685,6.7594414e-7,0.000088982444,0.00013046272,0.00011674365,0.00019257607,0.99727577,0.000895105,0.00040260697,0.0003380615,0.00015944075],"about_ca_topic_score_codex":0.0000034442503,"about_ca_topic_score_gemma":1.6838372e-7,"teacher_disagreement_score":0.58369803,"about_ca_system_score_codex":0.00010789685,"about_ca_system_score_gemma":0.00009302859,"threshold_uncertainty_score":0.68789095},"labels":[],"label_agreement":null},{"id":"W4403829686","doi":"10.1007/s10957-024-02556-6","title":"The “Black-Box” Optimization Problem: Zero-Order Accelerated Stochastic Method via Kernel Approximation","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Artificial Intelligence in Medicine (Canada)","funders":"Analytical Center for the Government of the Russian Federation","keywords":"Mathematics; Theory of computation; Zero order; Applied mathematics; Zero (linguistics); Mathematical optimization; Kernel (algebra); Order (exchange); Stochastic optimization; First order; Algorithm; Combinatorics","score_opus":0.01322407823589315,"score_gpt":0.28370880503282225,"score_spread":0.2704847267969291,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403829686","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.000004367134,0.00066664454,0.9964396,0.0011867044,0.00016835707,0.0008065433,0.000003568477,0.00025973967,0.00046448543],"genre_scores_gemma":[0.016335227,0.00036058124,0.98249024,0.00014128796,0.00013132242,0.00020310332,0.000021165257,0.00003614874,0.00028094073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979568,0.00031897618,0.00079832744,0.00034173788,0.00036017795,0.00022398648],"domain_scores_gemma":[0.9971091,0.0009612867,0.0005240541,0.00038484504,0.0008933399,0.00012738287],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021589247,0.00022008804,0.00022042179,0.00035292833,0.0005224109,0.00081813347,0.0006436349,0.00011759299,0.000027791557],"category_scores_gemma":[0.00020640431,0.00016253999,0.00008395752,0.0015467766,0.00015330367,0.0011583207,0.00011313052,0.00028088363,0.0000058987944],"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.000013841353,0.00003483412,4.860841e-7,0.000016875993,0.00003758088,5.444079e-7,0.0002441902,0.6325471,0.000060266135,0.35294825,0.00015509782,0.013940948],"study_design_scores_gemma":[0.00020198694,0.000068684734,0.0000019088448,0.00005759192,0.00006094905,0.00011698514,0.000058088444,0.8795253,0.00025391483,0.1190879,0.00041032635,0.0001563695],"about_ca_topic_score_codex":9.13577e-7,"about_ca_topic_score_gemma":1.359651e-7,"teacher_disagreement_score":0.24697821,"about_ca_system_score_codex":0.000078194236,"about_ca_system_score_gemma":0.0001570273,"threshold_uncertainty_score":0.788928},"labels":[],"label_agreement":null},{"id":"W4405839059","doi":"10.1007/s10957-024-02598-w","title":"Optimality of Vaccination for an SIR Epidemic with an ICU Constraint","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"COVID-19 epidemiological studies","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université Laval; Actua","funders":"","keywords":"Theory of computation; Mathematics; Vaccination; Constraint (computer-aided design); Epidemic model; Mathematical optimization; Mathematical economics; Medicine; Virology; Algorithm","score_opus":0.14500561164266992,"score_gpt":0.4394207211698556,"score_spread":0.29441510952718564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405839059","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.012518,0.00027708264,0.9858285,0.00062028645,0.000017272703,0.0004591007,0.000035290246,0.00003163128,0.00021283508],"genre_scores_gemma":[0.70240015,0.000196201,0.29699534,0.00012743901,0.00012631388,0.00008863229,0.000013554172,0.000014607987,0.000037780756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99887973,0.00022720815,0.0005544425,0.00015345088,0.000095064686,0.00009012682],"domain_scores_gemma":[0.9957643,0.0032786657,0.0003984302,0.00014121365,0.00034209274,0.000075305616],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0029337914,0.00009847324,0.00027781635,0.00008353428,0.0001184703,0.000026774995,0.000108123604,0.00006110427,0.000063095096],"category_scores_gemma":[0.0009963545,0.000066372435,0.00006191124,0.00016854377,0.0001011446,0.00026429075,0.000015952128,0.000104912164,2.6533263e-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.00017207494,0.00017855526,0.00016120668,0.00020000101,0.00008600939,3.8808952e-7,0.00027951633,0.066627994,0.00013530898,0.9209577,0.00012917673,0.011072109],"study_design_scores_gemma":[0.00045770322,0.00074655423,0.0003648289,0.00008853455,0.00024820925,0.00004350106,0.00076452864,0.07810046,0.00030663048,0.9175121,0.0012247278,0.00014218557],"about_ca_topic_score_codex":0.000001167097,"about_ca_topic_score_gemma":0.0000018647513,"teacher_disagreement_score":0.6898821,"about_ca_system_score_codex":0.000034802677,"about_ca_system_score_gemma":0.000056215526,"threshold_uncertainty_score":0.27065894},"labels":[],"label_agreement":null},{"id":"W4405882182","doi":"10.1007/s10957-024-02558-4","title":"Polynomial Optimization: Tightening RLT-Based Branch-and-Bound Schemes with Conic Constraints","year":2024,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; Consellería de Cultura, Educación e Ordenación Universitaria, Xunta de Galicia","keywords":"Mathematics; Conic section; Theory of computation; Branch and bound; Mathematical optimization; Polynomial; Applied mathematics; Geometry; Mathematical analysis; Algorithm","score_opus":0.019067063736665012,"score_gpt":0.3252841599980738,"score_spread":0.3062170962614088,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405882182","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.0003656497,0.0012231973,0.99659,0.00064258906,0.000045681023,0.0003941803,0.000015961825,0.000075041986,0.00064770377],"genre_scores_gemma":[0.119608276,0.0007281522,0.87847644,0.00016369617,0.0002948467,0.00008461415,0.000028261447,0.00007716122,0.00053856324],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986444,0.00014394135,0.00050703576,0.00023549021,0.00028603777,0.00018307114],"domain_scores_gemma":[0.99788284,0.0010701043,0.0002781657,0.00017328384,0.00043155954,0.00016403716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00081447035,0.00018095704,0.00026365338,0.00030223836,0.0002941403,0.00026177033,0.00013874061,0.000093060866,0.00042113167],"category_scores_gemma":[0.00021598619,0.00014530664,0.000054591666,0.0004969428,0.0004891168,0.00046967724,0.000031921103,0.0002916007,0.0000023695761],"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.00014376307,0.00007859971,0.000026429509,0.00013083861,0.00012278711,0.000008341421,0.0001679996,0.8774859,0.00005374504,0.11048397,0.00017078425,0.011126877],"study_design_scores_gemma":[0.0021090007,0.0002266965,0.000008598785,0.00040667027,0.00025999956,0.0005523196,0.00047318518,0.96845,0.00069819915,0.020998474,0.0053992607,0.0004175557],"about_ca_topic_score_codex":2.2319587e-7,"about_ca_topic_score_gemma":2.4959084e-7,"teacher_disagreement_score":0.11924263,"about_ca_system_score_codex":0.00005353367,"about_ca_system_score_gemma":0.00028798424,"threshold_uncertainty_score":0.59254324},"labels":[],"label_agreement":null},{"id":"W4408965248","doi":"10.1007/s10957-025-02647-y","title":"Fully Zeroth-Order Bilevel Programming via Gaussian Smoothing","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bilevel optimization; Theory of computation; Mathematics; Gaussian; Smoothing; Mathematical optimization; Order (exchange); Applied mathematics; Zeroth law of thermodynamics; Calculus (dental); Algorithm; Optimization problem; Statistics; Physics","score_opus":0.005682910952490658,"score_gpt":0.2516350456607874,"score_spread":0.24595213470829677,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408965248","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019968662,0.00020230978,0.9948885,0.0030859078,0.00006499934,0.00016885638,9.835354e-7,0.000037245383,0.0015312482],"genre_scores_gemma":[0.07054127,0.00016942312,0.926933,0.0011039989,0.00010454023,0.000048504648,0.000009150091,0.0000091938455,0.0010809146],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989643,0.00012484424,0.0004617817,0.00017156535,0.00016548853,0.0001120396],"domain_scores_gemma":[0.9986245,0.0001940742,0.0003718188,0.00020642237,0.00052539597,0.00007778306],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008294901,0.00010182798,0.00016157595,0.00035244584,0.00032365008,0.00023365622,0.0003582163,0.00005830087,0.00004978101],"category_scores_gemma":[0.0000994767,0.000087260145,0.00006946664,0.0012179879,0.000045995886,0.0005934119,0.000070248905,0.00012459152,0.0000027568829],"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.000009364241,0.00008350095,0.00007870152,0.000009942325,0.000059806935,4.5588985e-7,0.00013941765,0.29969227,0.00003625956,0.6393088,0.00006324367,0.060518254],"study_design_scores_gemma":[0.0008855829,0.00006088758,0.0005117032,0.000069351365,0.00016170203,0.00005272409,0.00019750558,0.83001435,0.00027886362,0.14419211,0.023289556,0.00028564155],"about_ca_topic_score_codex":0.0000011275187,"about_ca_topic_score_gemma":3.4849748e-7,"teacher_disagreement_score":0.5303221,"about_ca_system_score_codex":0.000028398583,"about_ca_system_score_gemma":0.000121696954,"threshold_uncertainty_score":0.35583654},"labels":[],"label_agreement":null},{"id":"W4409575416","doi":"10.1007/s10957-025-02633-4","title":"On Further Notions of Strong Nonexpansiveness and Corresponding Notions of Monotonicity","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Monotonic function; Theory of computation; Mathematical economics; Pure mathematics; Calculus (dental); Mathematical analysis; Algorithm","score_opus":0.0060534767553237084,"score_gpt":0.26060178471429657,"score_spread":0.2545483079589729,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409575416","genre_codex":"methods","genre_gemma":"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.0035398006,0.000100924146,0.99461234,0.00075002975,0.000040118237,0.00013203498,0.0000114571285,0.0000080875425,0.0008051906],"genre_scores_gemma":[0.9417079,0.00016623376,0.057813175,0.00009958733,0.000015545278,0.000012871035,0.000005172744,0.000004035874,0.00017548913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99909925,0.00013153217,0.00044945476,0.00012489123,0.00013213468,0.00006276144],"domain_scores_gemma":[0.99823964,0.0005420126,0.0004813958,0.00017799022,0.00051464955,0.000044300614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005258767,0.00007874655,0.00019757659,0.00041943736,0.00014919118,0.000036153324,0.0002002093,0.000045703648,0.000030596828],"category_scores_gemma":[0.0001222423,0.00006986093,0.000066005174,0.00073205016,0.00008176341,0.0002827142,0.00005061912,0.000082364684,3.6975774e-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.000021070224,0.00008776259,0.00012864542,0.000009152706,0.000039581686,6.187506e-8,0.00013900342,0.43936503,0.00013495627,0.5589298,0.0000074220493,0.001137494],"study_design_scores_gemma":[0.0013732912,0.00017089039,0.0053099585,0.00019046433,0.00027660662,0.000013817773,0.0007080521,0.88573927,0.0030853078,0.10261581,0.00029499878,0.00022155241],"about_ca_topic_score_codex":0.0000016255351,"about_ca_topic_score_gemma":5.0051165e-7,"teacher_disagreement_score":0.9381681,"about_ca_system_score_codex":0.000016962233,"about_ca_system_score_gemma":0.0000867386,"threshold_uncertainty_score":0.2848846},"labels":[],"label_agreement":null},{"id":"W4410460921","doi":"10.1007/s10957-025-02691-8","title":"Adaptive Generalized Conditional Gradient Method for Multiobjective Optimization","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Perimeter Institute","funders":"","keywords":"Mathematics; Theory of computation; Mathematical optimization; Multi-objective optimization; Gradient method; Applied mathematics; Algorithm","score_opus":0.010650661419480616,"score_gpt":0.312289075429338,"score_spread":0.30163841400985736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410460921","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.0000031145053,0.00025989188,0.9976756,0.00047564262,0.00015380987,0.0008669112,0.00002959362,0.00005181435,0.00048364422],"genre_scores_gemma":[0.0024974968,0.00016772465,0.99603105,0.00048532343,0.00009339147,0.00030631127,0.000039114275,0.000013664221,0.00036594408],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852216,0.00028058336,0.0005552796,0.00031373935,0.00016799795,0.00016026541],"domain_scores_gemma":[0.99678063,0.0008756258,0.0006107686,0.0002236643,0.0014137866,0.000095516254],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000918651,0.00017227218,0.00026967816,0.00041406258,0.00041035697,0.00010454775,0.00033401165,0.00008748664,0.000019526971],"category_scores_gemma":[0.00026647898,0.00016353617,0.0001153282,0.0007157284,0.000094860836,0.00078187534,0.000070845985,0.00013404901,6.6420625e-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.00006609732,0.00007831497,0.0000023709547,0.000005344495,0.00005588977,2.5416742e-7,0.00010703849,0.5833791,0.000024958683,0.4103834,0.00005467234,0.0058426023],"study_design_scores_gemma":[0.0015628575,0.00008418294,0.000023626251,0.000020179814,0.000059791415,0.000028835888,0.00017928822,0.89728457,0.00056947075,0.09909286,0.0009532334,0.00014110813],"about_ca_topic_score_codex":6.9683654e-7,"about_ca_topic_score_gemma":2.4601093e-7,"teacher_disagreement_score":0.3139055,"about_ca_system_score_codex":0.00012097338,"about_ca_system_score_gemma":0.00016807966,"threshold_uncertainty_score":0.66688114},"labels":[],"label_agreement":null},{"id":"W4410790929","doi":"10.1007/s10957-025-02696-3","title":"New Trends in Optimization, Control, and Their Applications: Guest Editorial","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus","funders":"","keywords":"Theory of computation; Mathematics; Control (management); Mathematical optimization; Mathematical economics; Computer science; Algorithm; Artificial intelligence","score_opus":0.011263314702512017,"score_gpt":0.3316541827842908,"score_spread":0.3203908680817788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410790929","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.000009297451,0.0007403095,0.99619,0.00079258846,0.0005335861,0.00052249344,0.000014509869,0.000032901306,0.001164277],"genre_scores_gemma":[0.007621523,0.002844242,0.9722862,0.00038162607,0.01213881,0.0005399528,0.00007211437,0.00008494269,0.0040305583],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984227,0.00021097605,0.00075623504,0.00023559749,0.00019792924,0.00017660842],"domain_scores_gemma":[0.99753225,0.0010855122,0.00042666856,0.00025370604,0.0005562484,0.000145587],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011371401,0.00018273218,0.00034502533,0.0007307525,0.00021301873,0.000103518265,0.00022535752,0.00015007315,0.00008047852],"category_scores_gemma":[0.00038119894,0.00015875358,0.00005634703,0.0011819944,0.00012526601,0.0004064874,0.00005391296,0.0002897072,7.381741e-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.00022657574,0.00021913071,0.00009057129,0.00004434454,0.00008570483,5.3275767e-7,0.0002225369,0.68242794,0.00003409475,0.28010175,0.0070528686,0.029493941],"study_design_scores_gemma":[0.010390491,0.00019428029,0.000100150886,0.00022217022,0.00024352726,0.000075774085,0.001540436,0.22348216,0.00023833332,0.6484324,0.114382945,0.0006973653],"about_ca_topic_score_codex":0.0000014239231,"about_ca_topic_score_gemma":0.0000017134018,"teacher_disagreement_score":0.45894578,"about_ca_system_score_codex":0.00006832669,"about_ca_system_score_gemma":0.00015412224,"threshold_uncertainty_score":0.6473783},"labels":[],"label_agreement":null},{"id":"W4410884354","doi":"10.1007/s10957-025-02719-z","title":"A Consensus-based Algorithm for Non-convex Multiplayer Games","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"H2020 Marie Skłodowska-Curie Actions; Natural Sciences and Engineering Research Council of Canada; Karl-Franzens-Universität Graz","keywords":"Theory of computation; Mathematics; Regular polygon; Algorithm; Mathematical optimization; Geometry","score_opus":0.007126461853934904,"score_gpt":0.26190901638560365,"score_spread":0.25478255453166876,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410884354","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.000041929412,0.00026498103,0.9976777,0.0010463713,0.0001285475,0.0005390335,0.000022162565,0.00002664407,0.0002526518],"genre_scores_gemma":[0.14664826,0.00003688235,0.8515101,0.0008236355,0.00012916728,0.00027748043,0.000014938186,0.000010714527,0.0005488433],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999137,0.00008872229,0.0004086388,0.00015419332,0.000098566656,0.00011291566],"domain_scores_gemma":[0.9982151,0.0007019194,0.00034667042,0.00022249956,0.00044714834,0.00006670604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00076793344,0.000094691895,0.0001918929,0.0001688077,0.00016421881,0.00012005212,0.00032455602,0.000056203793,0.000005028163],"category_scores_gemma":[0.00008736457,0.00008342004,0.00008321883,0.00028708056,0.00005154012,0.00014054892,0.00002646824,0.000074384305,0.0000014686145],"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.0001067819,0.0003667471,0.000110557936,0.00007616407,0.00022430492,0.0000027977362,0.00017397625,0.22830753,0.0006593084,0.36143178,0.00224788,0.4062922],"study_design_scores_gemma":[0.0016027251,0.00003687026,0.000053561907,0.00004207479,0.000041295363,0.000010909206,0.00007005426,0.9829765,0.0007850402,0.0055825463,0.008712728,0.00008571134],"about_ca_topic_score_codex":4.3913255e-7,"about_ca_topic_score_gemma":8.9320515e-8,"teacher_disagreement_score":0.75466895,"about_ca_system_score_codex":0.000026256705,"about_ca_system_score_gemma":0.00014086656,"threshold_uncertainty_score":0.34017706},"labels":[],"label_agreement":null},{"id":"W4411140844","doi":"10.1007/s10957-025-02713-5","title":"Efficient Parameter-Free Restarted Accelerated Gradient Methods for Convex and Strongly Convex Optimization","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Air Force Office of Scientific Research","keywords":"Mathematics; Theory of computation; Regular polygon; Convex optimization; Proximal Gradient Methods; Convex analysis; Proper convex function; Convex function; Mathematical optimization; Subderivative; Conic optimization; Applied mathematics; Combinatorics; Geometry; Algorithm","score_opus":0.016976661332291414,"score_gpt":0.308990695650776,"score_spread":0.2920140343184846,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411140844","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.003277257,0.00088108855,0.9947912,0.00012445143,0.000090531816,0.00043074018,0.00000792817,0.000088292196,0.000308511],"genre_scores_gemma":[0.22010668,0.0005285698,0.7790402,0.00009204321,0.000056940655,0.00008747308,0.000018635445,0.000021999278,0.000047434783],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99929273,0.0001015099,0.00034235764,0.00011221692,0.0000502254,0.0001009808],"domain_scores_gemma":[0.99889266,0.0004638138,0.0001404769,0.00017201717,0.00027640513,0.00005464541],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004906845,0.00011082293,0.00019865495,0.00018175789,0.00013452492,0.00006910814,0.00011086644,0.00007090851,0.000010286332],"category_scores_gemma":[0.00013547513,0.00010313298,0.000038758553,0.00022648704,0.000073163545,0.000065169435,0.000025766167,0.000101059435,7.136196e-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.00005370409,0.000029759216,0.0000075179137,0.000020211268,0.000062011066,1.7657425e-7,0.000056442328,0.96714115,0.0007487734,0.024527444,0.00032171534,0.007031072],"study_design_scores_gemma":[0.00056082744,0.0000501187,0.00002920476,0.0000524422,0.000101748185,0.0000102666645,0.00011092118,0.9821434,0.004673144,0.010804549,0.0013662176,0.00009715184],"about_ca_topic_score_codex":3.4813547e-7,"about_ca_topic_score_gemma":8.826975e-8,"teacher_disagreement_score":0.21682942,"about_ca_system_score_codex":0.000024276358,"about_ca_system_score_gemma":0.000021185593,"threshold_uncertainty_score":0.42056412},"labels":[],"label_agreement":null},{"id":"W4412531322","doi":"10.1007/s10957-025-02779-1","title":"Inertial Stochastic Reflected Forward Backward Method with Applications to Traffic Network Problems","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Queen's University; Graduiertenakademie, Technische Universität Dresden; National Natural Science Foundation of China; Centre Scientifique et Technique du Bâtiment; Queen's University Belfast; Natural Science Foundation of Chongqing; London Mathematical Society","keywords":"Inertial frame of reference; Theory of computation; Mathematics; Traffic network; Mathematical optimization; Applied mathematics; Algorithm; Classical mechanics; Physics","score_opus":0.022307215823819712,"score_gpt":0.3735591459496065,"score_spread":0.35125193012578676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412531322","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.000069794645,0.00016100072,0.9964551,0.0008070096,0.000026782778,0.0016321748,0.000008986733,0.00006654796,0.00077260286],"genre_scores_gemma":[0.00553793,0.00008029834,0.9918811,0.0002477745,0.00021294922,0.00082403445,0.000016865857,0.00004079324,0.0011582955],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982559,0.0002565739,0.00068108103,0.00026561818,0.0002851727,0.00025564362],"domain_scores_gemma":[0.99694055,0.0011468246,0.00041782187,0.00032604995,0.0009729559,0.00019576614],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012166322,0.00018929428,0.0003478787,0.00037490745,0.00037139465,0.00008611004,0.00029324892,0.00009574726,0.00006781391],"category_scores_gemma":[0.00032264186,0.0001556377,0.00006239249,0.0018428004,0.00009490594,0.00020795745,0.00006528596,0.00029202187,0.0000037151478],"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.00017465289,0.00012604595,0.0000025349643,0.00004431825,0.00008660565,3.1861543e-7,0.0001432179,0.8405713,0.00004117438,0.14361186,0.0003241119,0.014873868],"study_design_scores_gemma":[0.0039799884,0.00063468004,0.00003303718,0.00051843893,0.0006263496,0.00019030384,0.0011998031,0.5591444,0.000296391,0.4052662,0.027268782,0.00084167597],"about_ca_topic_score_codex":2.4910395e-7,"about_ca_topic_score_gemma":0.000002134846,"teacher_disagreement_score":0.28142694,"about_ca_system_score_codex":0.00008294542,"about_ca_system_score_gemma":0.00019729428,"threshold_uncertainty_score":0.6346721},"labels":[],"label_agreement":null},{"id":"W4412962796","doi":"10.1007/s10957-025-02775-5","title":"On second-order weak sharp minima of general nonconvex set-constrained optimization problems","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Maxima and minima; Mathematics; Theory of computation; Order (exchange); Set (abstract data type); Mathematical optimization; Applied mathematics; Optimization problem; Mathematical analysis; Algorithm; Computer science","score_opus":0.007202094939164196,"score_gpt":0.24986896311350723,"score_spread":0.24266686817434305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412962796","genre_codex":"methods","genre_gemma":"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.00014625871,0.000114692586,0.9889732,0.0013706416,0.000089182715,0.00024724525,0.000011691945,0.000025538598,0.009021564],"genre_scores_gemma":[0.12884283,0.00041840083,0.8624441,0.0015828962,0.00015438178,0.000086936096,0.00008675342,0.00002371862,0.0063599697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849683,0.0001831617,0.0007449017,0.00023105682,0.0002234557,0.00012061814],"domain_scores_gemma":[0.99772024,0.00036585148,0.0006989079,0.0002673304,0.00086460484,0.00008303974],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008007651,0.00014800097,0.00027540527,0.00048529368,0.00019031174,0.00011209875,0.00039773498,0.00009218116,0.00033889126],"category_scores_gemma":[0.00014233097,0.00013144127,0.00010378074,0.0011867947,0.0000869065,0.0004815416,0.000061128914,0.00013150783,0.0000019824004],"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.00001683109,0.00008620856,0.000015034342,0.00001546524,0.00005973178,1.3544943e-7,0.000093116745,0.572334,0.00005443598,0.42614895,0.00017314964,0.0010029641],"study_design_scores_gemma":[0.0008820159,0.00008881605,0.00006645813,0.00005223298,0.00007939228,0.000013170914,0.00009392365,0.96839744,0.0004471775,0.028331926,0.0014016988,0.00014574821],"about_ca_topic_score_codex":8.365428e-7,"about_ca_topic_score_gemma":5.8747867e-7,"teacher_disagreement_score":0.39781702,"about_ca_system_score_codex":0.0000393816,"about_ca_system_score_gemma":0.0002293907,"threshold_uncertainty_score":0.5360019},"labels":[],"label_agreement":null},{"id":"W4413802952","doi":"10.1007/s10957-025-02790-6","title":"Generalized Robust Optimization using the Notion of Set-Valued Probability","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Fuzzy Systems and Optimization","field":"Mathematics","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Acadia University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Theory of computation; Robust optimization; Mathematical optimization; Set (abstract data type); Applied mathematics; Mathematical economics; Algorithm; Computer science","score_opus":0.046525044797828555,"score_gpt":0.31492513625104224,"score_spread":0.2684000914532137,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413802952","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.0065027354,0.00024826106,0.99167454,0.00022752458,0.000093004084,0.0006833185,0.000010920337,0.000017340806,0.0005423294],"genre_scores_gemma":[0.15877362,0.00026135938,0.8401771,0.00011862222,0.00019064994,0.000065902255,0.00002565957,0.000029812429,0.00035725764],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830395,0.00042418318,0.0008465333,0.00013821833,0.00018781974,0.000099286975],"domain_scores_gemma":[0.9975771,0.0004009486,0.0009515097,0.0002728383,0.0007580918,0.000039531224],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019598727,0.00012520349,0.00027905087,0.0001694826,0.0002713406,0.00005165087,0.00017288164,0.000100888166,0.000042323947],"category_scores_gemma":[0.00042895417,0.000089530586,0.00009493488,0.0005811173,0.00012775119,0.00024294149,0.000036612848,0.00012079939,1.114816e-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.00005882069,0.00007525733,0.000056822635,0.00008187339,0.000043612145,6.619567e-8,0.00016383386,0.7112689,0.00007532983,0.28788364,0.000060795766,0.00023105253],"study_design_scores_gemma":[0.0008460711,0.00003903371,0.00003457631,0.00014590491,0.0003055633,0.000021097407,0.00052257447,0.87423724,0.00046007294,0.12312101,0.00014753308,0.00011934713],"about_ca_topic_score_codex":0.0000032227467,"about_ca_topic_score_gemma":7.8135366e-7,"teacher_disagreement_score":0.16476262,"about_ca_system_score_codex":0.000058192865,"about_ca_system_score_gemma":0.00011544902,"threshold_uncertainty_score":0.3650951},"labels":[],"label_agreement":null},{"id":"W4416161692","doi":"10.1007/s10957-025-02878-z","title":"Dynamic Pricing in the Presence of Heterogeneous Social Influence","year":2025,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Revenue; Product (mathematics); Revenue management; Maximization; Quality (philosophy); Market segmentation; Dynamic pricing; Theory of computation","score_opus":0.006760906397671258,"score_gpt":0.2451998407714772,"score_spread":0.23843893437380592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416161692","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.21643512,0.0005593596,0.7669782,0.003126834,0.00011468592,0.0007723383,0.000001547493,0.000017539332,0.011994383],"genre_scores_gemma":[0.9985185,0.000050708797,0.00040538138,0.00088374113,0.000052425516,0.000019604688,0.0000018354974,0.0000029653193,0.000064836895],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99948245,0.000032423894,0.00027085046,0.000060707654,0.000094955765,0.00005862695],"domain_scores_gemma":[0.9994416,0.000098126606,0.00026945607,0.0000768083,0.00011120068,0.0000028081863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007494344,0.000049600243,0.00008690622,0.00019493926,0.00011410525,0.000057521996,0.00019567022,0.000020664476,0.000018766972],"category_scores_gemma":[0.00006539383,0.00003703798,0.000030957548,0.00043057522,0.000062590785,0.0002891454,0.000042489242,0.00006615964,7.084649e-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.00005146643,0.00012369477,0.0013703475,0.00013166323,0.000025284735,0.0000011126585,0.00029277347,0.45562074,0.0001324148,0.5363497,0.00019536025,0.005705431],"study_design_scores_gemma":[0.0034046767,0.00007433115,0.035565015,0.0005979742,0.00056123774,0.000026860047,0.013177009,0.42272693,0.00027206854,0.44688472,0.076089546,0.00061961607],"about_ca_topic_score_codex":0.0000033054152,"about_ca_topic_score_gemma":0.0000017451556,"teacher_disagreement_score":0.7820834,"about_ca_system_score_codex":0.000010888787,"about_ca_system_score_gemma":0.0000111330555,"threshold_uncertainty_score":0.15103649},"labels":[],"label_agreement":null},{"id":"W48523452","doi":"10.1023/a:1004649211111","title":"Convergence Properties of Two-Stage Stochastic Programming","year":2000,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":97,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Science North","funders":"","keywords":"Mathematics; Proofs of convergence of random variables; Convergence (economics); Mathematical optimization; Stochastic programming; Exponential function; Rate of convergence; Theory of computation; Convergence tests; Compact convergence; Applied mathematics; Stochastic optimization; Normal convergence; Convergence of random variables; Quadratic programming; Random variable; Computer science; Algorithm; Statistics; Algebra of random variables; Mathematical analysis","score_opus":0.04315506297365662,"score_gpt":0.3381747733330435,"score_spread":0.2950197103593869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W48523452","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.037820008,0.0005703586,0.9602161,0.00010958962,0.000042210417,0.00025724468,0.000005084446,0.000009831268,0.0009695686],"genre_scores_gemma":[0.97723764,0.0006878833,0.02001929,0.000047049507,0.00008160818,0.000019850238,0.0000023960172,0.000008805656,0.0018954491],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998341,0.00018622879,0.00081998087,0.00014034295,0.00041570197,0.000096708696],"domain_scores_gemma":[0.9981724,0.00025516748,0.0006793473,0.00020845188,0.0005981524,0.0000864726],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020876655,0.000086761116,0.00021085056,0.00018923842,0.00015757271,0.00008639016,0.0002686349,0.00003966622,0.0007494816],"category_scores_gemma":[0.00028594868,0.000060936447,0.00006733108,0.00059188105,0.00017646923,0.0004421014,0.00001727095,0.00008602375,0.000010382226],"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.00009355441,0.00006722574,0.00017839661,0.0000036612046,0.00001283512,3.3019623e-7,0.00037904704,0.9017427,0.00016515523,0.028956398,0.000028799685,0.06837187],"study_design_scores_gemma":[0.005121205,0.0008778351,0.0009654233,0.0003604628,0.0005026456,0.00044194123,0.010161635,0.7562362,0.009400138,0.1445143,0.0702021,0.0012161395],"about_ca_topic_score_codex":0.0000017243618,"about_ca_topic_score_gemma":4.0216216e-7,"teacher_disagreement_score":0.9401968,"about_ca_system_score_codex":0.000008444211,"about_ca_system_score_gemma":0.00006995024,"threshold_uncertainty_score":0.82062984},"labels":[],"label_agreement":null},{"id":"W66820110","doi":"10.1023/a:1013040428127","title":"Complexity of a Noninterior Path-Following Method for the Linear Complementarity Problem","year":2002,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Lambda; Linear complementarity problem; Eigenvalues and eigenvectors; Matrix (chemical analysis); Upper and lower bounds; Positive-definite matrix; Interior point method; Mathematical analysis; Physics; Algorithm","score_opus":0.11355539285635675,"score_gpt":0.4153717938177717,"score_spread":0.30181640096141493,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W66820110","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.000075891105,0.00019927553,0.99782395,0.0007765614,0.000024951702,0.00082315283,0.00003612158,0.000011911293,0.00022819598],"genre_scores_gemma":[0.007876814,0.00015180623,0.99150896,0.00006767417,0.00007788004,0.00010086144,0.000006339686,0.00001823247,0.0001914123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987662,0.00019454848,0.0005967991,0.00010943496,0.00021052273,0.00012253401],"domain_scores_gemma":[0.9968099,0.0018941283,0.00057967583,0.00019090733,0.00046439958,0.000060982853],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001742685,0.000097012206,0.0002453801,0.000085234125,0.00029820192,0.000027553013,0.00022687319,0.00003793403,0.00023966155],"category_scores_gemma":[0.00034067628,0.00006956851,0.00012969786,0.00024106709,0.00015108717,0.00015870524,0.000049169383,0.00014510311,5.7595486e-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.0001425547,0.0005086672,0.0000631668,0.00015500169,0.00029486234,6.744435e-7,0.0012509481,0.29840183,0.0002560569,0.6810163,0.0004945713,0.017415343],"study_design_scores_gemma":[0.0010995329,0.00012201799,0.000010717293,0.00004839497,0.000159849,0.000030060395,0.00082587916,0.79945606,0.00045075145,0.19484021,0.0028504473,0.000106077794],"about_ca_topic_score_codex":0.0000010765643,"about_ca_topic_score_gemma":8.155482e-7,"teacher_disagreement_score":0.5010542,"about_ca_system_score_codex":0.00002914388,"about_ca_system_score_gemma":0.000021787622,"threshold_uncertainty_score":0.28369215},"labels":[],"label_agreement":null},{"id":"W77613094","doi":"10.1023/a:1004608800846","title":"Universal Near-Optimal Feedbacks","year":2000,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Guidance and Control Systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; McGill University","funders":"","keywords":"Mathematics; Theory of computation; Construct (python library); Bounded function; Saddle; Optimal control; Set (abstract data type); Mathematical optimization; Differential inclusion; Saddle point; Type (biology); Applied mathematics; Mathematical analysis; Computer science; Algorithm; Geometry","score_opus":0.0025295168831400393,"score_gpt":0.18352260701908038,"score_spread":0.18099309013594034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W77613094","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.03971765,0.0009656894,0.9451533,0.0000921439,0.000051663388,0.0001353616,0.0000042805127,0.00005195328,0.013827991],"genre_scores_gemma":[0.9921825,0.00057210535,0.006157159,0.000051553412,0.00021004028,0.00001082877,0.000003240055,0.000014740287,0.0007978549],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9996141,0.000026480107,0.00019023339,0.00004273325,0.00005876031,0.000067693305],"domain_scores_gemma":[0.9997387,0.000039746963,0.000047847418,0.00007028358,0.0000506663,0.000052765103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018386633,0.000056767774,0.000094303476,0.000031835963,0.00008162985,0.00004059604,0.00007115833,0.000035397687,0.00034542318],"category_scores_gemma":[0.00000341446,0.000051933013,0.000033323333,0.000103816295,0.00003306046,0.00017062694,0.0000026923342,0.000073555144,0.000014276635],"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.000022149736,0.000011174949,0.000019553152,0.000005445258,0.000023948916,6.996529e-7,0.00011265348,0.9733467,0.00009962033,0.0076902746,0.00021429406,0.018453456],"study_design_scores_gemma":[0.0021091765,0.00013486022,0.0005338959,0.000073200936,0.00016907603,0.00029701774,0.0009925991,0.75550956,0.00030807094,0.004254993,0.2352072,0.0004103799],"about_ca_topic_score_codex":3.21128e-7,"about_ca_topic_score_gemma":9.121219e-8,"teacher_disagreement_score":0.9524648,"about_ca_system_score_codex":0.000013418068,"about_ca_system_score_gemma":0.0000128065385,"threshold_uncertainty_score":0.37821415},"labels":[],"label_agreement":null},{"id":"W81936770","doi":"10.1023/a:1021246912554","title":"Optimal Transient Response Shaping of the Servomechanism Problem","year":2002,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Control Systems in Engineering","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Servomechanism; Theory of computation; Mathematics; Transient response; Control theory (sociology); Diagonal; Transient (computer programming); Controller (irrigation); Linear system; LTI system theory; Optimal control; Mathematical optimization; Computer science; Algorithm; Control (management); Mathematical analysis; Engineering; Control engineering","score_opus":0.008088129491491423,"score_gpt":0.19049803841900995,"score_spread":0.18240990892751852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W81936770","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.015202738,0.00097549305,0.98296094,0.00012223603,0.000066281216,0.00021334038,0.0000038461762,0.00002664103,0.00042849593],"genre_scores_gemma":[0.9852639,0.00013859321,0.014418853,0.000012662144,0.000057841247,0.000023127546,2.4074734e-7,0.000016171894,0.00006863588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993674,0.00006968371,0.00033880625,0.00004826223,0.000101773534,0.00007406633],"domain_scores_gemma":[0.9995093,0.00013772177,0.00011726491,0.00012221457,0.00007666065,0.000036850255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006069473,0.00007052358,0.00012167147,0.00007784953,0.000059689854,0.000014969277,0.0001291645,0.00003875437,0.000039623796],"category_scores_gemma":[0.000026541842,0.000055111348,0.000055825327,0.00019048613,0.000024062501,0.000103097605,0.000010384294,0.00010834606,6.3086594e-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.00001920115,0.0000140449965,0.000002774686,0.00003348613,0.000027337266,2.076729e-7,0.00041868264,0.9819281,0.009101567,0.0072078,0.000029691897,0.0012170762],"study_design_scores_gemma":[0.000554242,0.000040382394,0.000083155865,0.00012851025,0.000062690735,0.00011347675,0.0002400218,0.9901593,0.0035155383,0.00080976484,0.0041681617,0.0001247832],"about_ca_topic_score_codex":9.8010496e-8,"about_ca_topic_score_gemma":5.687523e-8,"teacher_disagreement_score":0.9700611,"about_ca_system_score_codex":0.000024028504,"about_ca_system_score_gemma":0.000005703166,"threshold_uncertainty_score":0.22473755},"labels":[],"label_agreement":null}]}