{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":21,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":21,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"cdfd28327e2f","filters":{"venue":"Optimization"}},"results":[{"id":"W2027711030","doi":"10.1080/02331930008844513","title":"Dykstras algorithm with bregman projections: A convergence proof","year":2000,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; Okanagan University College; University of British Columbia, Okanagan Campus","funders":"","keywords":"Bregman divergence; Mathematics; Convergence (economics); Algorithm; Regular polygon; Constraint (computer-aided design); Legendre polynomials; Mathematical optimization; Applied mathematics; Mathematical analysis; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.005520435647381991,"gpt":0.2031312555329953,"spread":0.1976108198856133,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001014037,0.0001180695,0.0001059475,0.0001219103,0.0002072314,0.0001708971,0.0002682583,0.0000471433,0.001682648],"category_scores_gemma":[0.00001098922,0.0001002264,0.00003652104,0.001194898,0.00002803118,0.0008688186,0.00002000199,0.00006140061,0.00008604743],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003781364,"about_ca_system_score_gemma":0.00009421702,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000341334,"about_ca_topic_score_gemma":0.000006983096,"domain_scores_codex":[0.9989882,0.00004815977,0.0001909975,0.0003373882,0.0002792161,0.0001560168],"domain_scores_gemma":[0.9993479,0.00002020727,0.00007356482,0.0002792613,0.0002122422,0.00006688603],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004631179,0.000076702,0.0001044924,0.000002860814,0.00002355575,0.000001855474,0.0001522922,0.9664524,0.000001797638,0.003796981,0.0002498002,0.02913259],"study_design_scores_gemma":[0.0002709696,0.00006198152,0.0001694059,0.000009380741,0.00001507643,0.00001902572,0.00001178559,0.9972625,0.00008447652,0.0001397504,0.001805427,0.0001502225],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000585194,0.00001728593,0.9909407,0.001035756,0.00005204056,0.0002081349,0.000003312882,0.0001745425,0.007509661],"genre_scores_gemma":[0.01323319,0.00007941011,0.9782319,0.000356389,0.00005636979,0.00006277335,0.00006899033,0.00001250886,0.007898469],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03081005,"threshold_uncertainty_score":0.99923,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2955869862","doi":"10.1080/02331934.2019.1630625","title":"A robust fuzzy approach for constrained multi-product economic production quantity with imperfect items and rework process","year":2019,"lang":"en","type":"article","venue":"Optimization","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University","funders":"","keywords":"Mathematical optimization; Rework; Fuzzy logic; Computer science; Mathematics; Robust optimization; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0271079516651244,"gpt":0.2197076757366503,"spread":0.1925997240715259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003410594,0.0001661357,0.0001722783,0.0001537546,0.0001593698,0.0002508825,0.00009256828,0.00004329749,0.00006663846],"category_scores_gemma":[0.00004300634,0.0001466163,0.00002945275,0.000188141,0.00005090249,0.001095196,0.00003602606,0.00005661755,0.00001670358],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004025571,"about_ca_system_score_gemma":0.00001766915,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005710907,"about_ca_topic_score_gemma":0.00001756655,"domain_scores_codex":[0.9990251,0.000008138476,0.0001813703,0.0005025103,0.00009185285,0.0001910491],"domain_scores_gemma":[0.9994767,0.000008062244,0.0001877141,0.0002104204,0.0001061587,0.00001090641],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001376727,0.00008953923,0.01471896,0.0006772747,0.00003754151,2.088646e-7,0.00005644446,0.9803938,0.00003862556,0.002438923,0.0007060839,0.0007049481],"study_design_scores_gemma":[0.001300752,0.00003835309,0.0006373147,0.00004428267,0.00006752751,0.000002977719,0.0005151869,0.9959396,0.00005368966,0.0000498966,0.001067974,0.0002824829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5221734,0.0001944112,0.442827,0.001315893,0.001805084,0.0084413,0.00001055984,0.0005668437,0.02266555],"genre_scores_gemma":[0.9714938,0.00001658559,0.0264194,0.0001795023,0.0007043201,0.0001415101,0.0003037684,0.00004437778,0.0006966748],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4493205,"threshold_uncertainty_score":0.5978838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4311815018","doi":"10.1080/02331934.2022.2154607","title":"HJB equation for optimal control system with random impulses","year":2022,"lang":"en","type":"article","venue":"Optimization","topic":"Stability and Controllability of Differential Equations","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Hamilton–Jacobi–Bellman equation; Mathematics; Impulse control; Impulse (physics); Random function; Bellman equation; Stochastic process; Applied mathematics; Stochastic control; Viscosity solution; Stochastic differential equation; Optimal control; Mathematical optimization; Random variable; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.007511859385783469,"gpt":0.1828965906427405,"spread":0.175384731256957,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002316687,0.0001084003,0.0001790603,0.0000653559,0.0003055529,0.00004685536,0.00008274968,0.00003028138,0.0001482647],"category_scores_gemma":[0.00007649814,0.0001086646,0.00006109582,0.000151913,0.00001793669,0.0001355233,0.000009618079,0.00006640864,0.0000018283],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001711425,"about_ca_system_score_gemma":0.00002895745,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001123512,"about_ca_topic_score_gemma":0.000006338801,"domain_scores_codex":[0.9992272,0.00006394205,0.000214363,0.0001555783,0.0001832512,0.000155681],"domain_scores_gemma":[0.9994185,0.0001950186,0.00004568465,0.0001532369,0.0001513654,0.00003618426],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003444443,0.00002872979,0.00004955681,0.00005677578,0.00004789892,1.243054e-7,0.0001158092,0.9968026,0.00006383454,0.001483198,0.00004405174,0.000962952],"study_design_scores_gemma":[0.00469456,0.0001538053,0.00005530654,0.000006230576,0.00007145733,0.000001309825,0.0004053418,0.9941516,0.00005307255,0.00002811019,0.0002507037,0.000128502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006037636,0.00006833779,0.991558,0.00009605794,0.0002971431,0.001060482,0.0001100398,0.0003235853,0.0004487747],"genre_scores_gemma":[0.9840783,0.000001768599,0.0145568,0.00002085823,0.00008122684,0.0009803333,0.0002169713,0.00002607008,0.00003763187],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9780407,"threshold_uncertainty_score":0.4431213,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065496492","doi":"10.1080/02331934.2011.590485","title":"Optimal ordering and pricing policy with supplier quantity discounts and price-dependent stochastic demand","year":2011,"lang":"en","type":"article","venue":"Optimization","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":23,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; University of Hong Kong; City University of Hong Kong","keywords":"Mathematical optimization; Profit (economics); Nonlinear pricing; Integer programming; Dynamic programming; Economic order quantity; Product (mathematics); Mathematics; Computer science; Supply chain; Microeconomics; Economics; Business; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.01665522622321815,"gpt":0.2077812948908971,"spread":0.1911260686676789,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001788887,0.0001675385,0.0001386062,0.0002501223,0.0002094899,0.0002512037,0.00008056834,0.00003911353,0.000187896],"category_scores_gemma":[0.00003158826,0.0001434067,0.0000125715,0.000245075,0.00006383326,0.001076276,0.0001734324,0.00006272786,0.000009869925],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002943604,"about_ca_system_score_gemma":0.00001230362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005897905,"about_ca_topic_score_gemma":0.00007041232,"domain_scores_codex":[0.9991347,0.000006575018,0.0001602484,0.0002916647,0.0001762069,0.0002306476],"domain_scores_gemma":[0.9996498,0.000009389288,0.0001241378,0.0001356296,0.00005926668,0.00002179057],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003538717,0.0002848631,0.07576396,0.0006982393,0.000155652,0.00002301992,0.001698711,0.8682584,0.00009187157,0.04971445,0.0003468069,0.002610183],"study_design_scores_gemma":[0.001789037,0.0000699644,0.02365493,0.0001301809,0.0001513613,0.0000103135,0.0009862668,0.9715586,0.00004100672,0.0003194804,0.00070725,0.0005816003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3657858,0.00007391003,0.6202354,0.0002158373,0.0001112745,0.0005445302,0.00000142483,0.000102057,0.01292965],"genre_scores_gemma":[0.9922498,0.00003193435,0.006878268,0.0003083881,0.0002148698,0.00002298475,0.00001679767,0.00003039945,0.0002465431],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6264639,"threshold_uncertainty_score":0.5847954,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967710355","doi":"10.1080/02331930600711968","title":"Characterization of convexifiable functions","year":2006,"lang":"en","type":"article","venue":"Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":20,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Lipschitz continuity; Differentiable function; Convex function; Concave function; Class (philosophy); Function (biology); Convex analysis; Transformation (genetics); Linear programming; Analytic function; Pure mathematics; Regular polygon; Characterization (materials science); Convex optimization; Discrete mathematics; Applied mathematics; Mathematical optimization; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02564100181370066,"gpt":0.2985124660899341,"spread":0.2728714642762334,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001453527,0.00009771137,0.0001515453,0.0001640701,0.00009389692,0.00002289164,0.0000849466,0.00007308154,0.0009245041],"category_scores_gemma":[0.000144189,0.0001017429,0.00003801425,0.0005340105,0.00005351048,0.0003101522,0.00002630231,0.00006519986,0.00001836781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004560106,"about_ca_system_score_gemma":0.00004021761,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001251734,"about_ca_topic_score_gemma":0.000002565827,"domain_scores_codex":[0.9990175,0.00004691166,0.0003498693,0.0001673682,0.0002601512,0.0001581564],"domain_scores_gemma":[0.9990606,0.00008127112,0.0002050642,0.0002240289,0.0003972759,0.00003174653],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002487008,0.0002459245,0.0004075846,0.00006133608,0.00001477097,8.080082e-7,0.00004610209,0.9472085,0.02000356,0.03054688,0.0007871838,0.0006525167],"study_design_scores_gemma":[0.0007345351,0.00005020829,0.0002867845,0.00002965628,0.00002666344,0.000004342072,0.00004366266,0.9677224,0.02167141,0.007495087,0.001723495,0.0002117402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006579002,0.000006784403,0.9833679,0.00009376421,0.0001015969,0.0002874641,0.00002814982,0.0001141483,0.009421253],"genre_scores_gemma":[0.111596,0.00004858203,0.8606466,0.00003383711,0.0002105683,0.00008665166,0.001234142,0.00008870484,0.02605494],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1227213,"threshold_uncertainty_score":0.9999888,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2883106675","doi":"10.1080/02331934.2018.1482297","title":"Primal–dual interior-point method for linear optimization based on a kernel function with trigonometric growth term","year":2018,"lang":"en","type":"article","venue":"Optimization","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Shiraz University of Technology; Shahrekord University; K.N.Toosi University of Technology; York University","keywords":"Mathematics; Kernel (algebra); Trigonometric functions; Mathematical optimization; Variable kernel density estimation; Simple (philosophy); Algorithm; Bounded function; Interior point method; Applied mathematics; Kernel method; Computer science; Discrete mathematics; Artificial intelligence; Support vector machine; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.0408754261256368,"gpt":0.3554681554258558,"spread":0.314592729300219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008591743,0.0003858868,0.0004139783,0.00105328,0.000535565,0.0001182964,0.0002210895,0.0002151255,0.0007873032],"category_scores_gemma":[0.001807566,0.0003394815,0.0001134266,0.001930998,0.000122764,0.0005781921,0.00008218728,0.0002162792,0.00001745286],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003522823,"about_ca_system_score_gemma":0.000184187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004512684,"about_ca_topic_score_gemma":0.000003307813,"domain_scores_codex":[0.9973704,0.0002087967,0.0006069062,0.0007380772,0.0005914119,0.0004843973],"domain_scores_gemma":[0.9964983,0.0007332925,0.0004445458,0.0005340012,0.001615427,0.0001744244],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001532111,0.0002465385,0.00004280535,0.0001040791,0.00005109231,0.000001376775,0.0001671378,0.9934064,0.0000333648,0.00156874,0.0002818075,0.002564572],"study_design_scores_gemma":[0.003311323,0.002153239,0.00001762151,0.00009750726,0.0000974064,0.000007744135,0.00006026247,0.9916219,0.001403211,0.0006718447,0.0001611081,0.0003968557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00007410488,0.000007223025,0.994491,0.0003225907,0.0002117985,0.001857525,0.00004077127,0.0003228325,0.002672171],"genre_scores_gemma":[0.007908345,0.0000165784,0.9896402,0.0003024919,0.000379968,0.0003861193,0.0003925772,0.0001710595,0.000802644],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007834241,"threshold_uncertainty_score":0.9999057,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162816032","doi":"10.1080/02331934.2011.568617","title":"Multi-start approach for an integer determinant maximization problem","year":2011,"lang":"en","type":"article","venue":"Optimization","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Integer (computer science); Maximization; Mathematics; Mathematical optimization; TRACE (psycholinguistics); Conic section; Variable (mathematics); Nonlinear system; Matrix (chemical analysis); Constant (computer programming); Term (time); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1090572466309671,"gpt":0.3099000564566249,"spread":0.2008428098256578,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004540862,0.0001443574,0.0001302153,0.000142415,0.0001302028,0.0001258287,0.0004756379,0.00006955564,0.00001257155],"category_scores_gemma":[0.00005932744,0.0001391716,0.00005302413,0.0003237664,0.00002705797,0.001450472,0.0001031336,0.0000566326,0.000003499963],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005044462,"about_ca_system_score_gemma":0.00007378186,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001634313,"about_ca_topic_score_gemma":0.000003168991,"domain_scores_codex":[0.9987652,0.0001360778,0.0002676104,0.0004586437,0.0001661301,0.0002063956],"domain_scores_gemma":[0.9991165,0.00004790611,0.0001388464,0.0003671993,0.0002516042,0.00007796433],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001679198,0.0002220712,0.000102372,0.00001880228,0.000006383279,3.995461e-7,0.001172001,0.9772971,0.00005173874,0.007643441,0.0000426332,0.01342632],"study_design_scores_gemma":[0.0003921986,0.0001193203,0.0003766748,0.000007182901,0.000008442351,0.000007087107,0.000029585,0.996637,0.00057839,0.001590125,0.00006787028,0.0001860556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002529453,0.0000110843,0.9971446,0.00002487526,0.0001589872,0.0006462368,0.000004711891,0.0001693508,0.001587216],"genre_scores_gemma":[0.02474453,0.000003987813,0.9747078,0.00008526795,0.00003508263,0.0001495706,0.0001285627,0.00002144688,0.0001237585],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02449158,"threshold_uncertainty_score":0.5675254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2320499430","doi":"10.1080/02331934.2016.1149711","title":"Semicontinuity and convergence for vector optimization problems with approximate equilibrium constraints","year":2016,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"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":"Mathematics; Convergence (economics); Constraint (computer-aided design); Vector optimization; Mathematical optimization; Variational inequality; Solution set; Set (abstract data type); Optimization problem; Feasible region; Applied mathematics; Function (biology); Computer science; Multi-swarm optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.01040051150337119,"gpt":0.211356619008682,"spread":0.2009561075053108,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002371252,0.0001607732,0.0001742687,0.0001135392,0.0001233562,0.0001708372,0.0002258722,0.00007204567,0.0001343961],"category_scores_gemma":[0.00009452725,0.0001113805,0.00003686922,0.000388706,0.0001019112,0.001062732,0.00006959604,0.00002998527,0.000003288246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004232615,"about_ca_system_score_gemma":0.00007577748,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003387,"about_ca_topic_score_gemma":0.000002254908,"domain_scores_codex":[0.9988075,0.00004813326,0.0002648258,0.0004593596,0.0002002046,0.0002199905],"domain_scores_gemma":[0.9989081,0.000113151,0.000212524,0.0002484293,0.0004182679,0.00009953217],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001939677,0.00003795228,0.000555513,0.00002354113,0.00003477936,3.288762e-7,0.0001239754,0.968576,0.0004145139,0.02764052,0.00008157429,0.002491872],"study_design_scores_gemma":[0.0009531958,0.00007483282,0.0001208484,0.00004036932,0.00002523831,0.000007674332,0.000007353867,0.9977189,0.0004787382,0.0002741355,0.00009566596,0.0002030622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000193089,0.00002014489,0.9963373,0.002362436,0.0000896722,0.0004696255,0.00002349772,0.0001600196,0.000344221],"genre_scores_gemma":[0.1706966,0.00006870987,0.8283758,0.0001509508,0.00003762586,0.00008851647,0.0000533171,0.00001747773,0.0005110601],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1705035,"threshold_uncertainty_score":0.4541964,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4236363547","doi":"10.1080/02331930108844541","title":"Application of topological degree theory to semi-definite complementarity problem","year":2001,"lang":"en","type":"article","venue":"Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Complementarity theory; Degree (music); Complementarity (molecular biology); Existential quantification; Positive-definite matrix; Mixed complementarity problem; Topology (electrical circuits); Discrete mathematics; Combinatorics; Eigenvalues and eigenvectors; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.02674637549524864,"gpt":0.2653576398638682,"spread":0.2386112643686196,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004398395,0.00007544877,0.0001009247,0.00006258674,0.00008157265,0.00003099483,0.0003660055,0.00003857498,0.0001218894],"category_scores_gemma":[0.00002354798,0.00006778321,0.00002779613,0.0003972823,0.00002692181,0.0001812347,0.0001334196,0.00004783925,0.00002319197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002168045,"about_ca_system_score_gemma":0.00001320809,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001750929,"about_ca_topic_score_gemma":0.000003800646,"domain_scores_codex":[0.9992196,0.0001007418,0.0001986334,0.0002172673,0.0001327535,0.0001310034],"domain_scores_gemma":[0.9994152,0.0000760142,0.00008619513,0.0002927087,0.00007739537,0.0000524395],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001978727,0.00009551667,0.001277631,0.000008268365,0.000006122136,9.979257e-7,0.0002323505,0.1937595,0.0001782458,0.7544746,0.00006674357,0.04988022],"study_design_scores_gemma":[0.0004133075,0.0001942886,0.001797092,0.00001468908,0.00001055635,0.0000146302,0.00005191346,0.8872646,0.001194656,0.1039592,0.004853887,0.0002311332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001323457,0.00001287883,0.9914016,0.000478046,0.00004594056,0.0002660133,0.000003484959,0.00008216477,0.006386397],"genre_scores_gemma":[0.3322732,0.00001219093,0.6671461,0.0003194794,0.00003143131,0.00003256964,0.00002277507,0.000004462603,0.0001578068],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6935051,"threshold_uncertainty_score":0.2764119,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2122679316","doi":"10.1080/02331930008844477","title":"Increasing cones, recession cones and global cones","year":2000,"lang":"en","type":"article","venue":"Optimization","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":6,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Cone (formal languages); Closure (psychology); Recession; Arbitrage; Mathematics; Dual cone and polar cone; Mathematical economics; Economics; Geometry; Keynesian economics; Algorithm; Financial economics; Market economy","retraction":null,"screen_n_in":null,"score":{"opus":0.01430711184629315,"gpt":0.2025827657082231,"spread":0.18827565386193,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002679325,0.0001122969,0.0002349329,0.00003976598,0.0001367462,0.00009969065,0.00007167113,0.00009447253,0.001935987],"category_scores_gemma":[0.00003528717,0.0001308052,0.00002989559,0.00009072535,0.00006195353,0.0003518961,0.00002442141,0.00004193119,0.0001128332],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005351498,"about_ca_system_score_gemma":0.000009708747,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003466081,"about_ca_topic_score_gemma":0.00001092033,"domain_scores_codex":[0.9991725,0.00001758797,0.0003498555,0.0002857011,0.00001383951,0.0001605319],"domain_scores_gemma":[0.99959,0.00003053035,0.0001481281,0.0001490944,0.00001838311,0.00006383695],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002394825,0.00008300354,0.06448395,0.00004166711,0.00005738057,0.000002776319,0.0004521752,0.1884104,0.0000121473,0.720511,0.0006877439,0.02501824],"study_design_scores_gemma":[0.003662931,0.0001698936,0.01352481,0.0001157756,0.00003373526,0.0001061473,0.0002979913,0.7301272,0.00007570416,0.1404211,0.1102349,0.001229804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8386933,0.002961873,0.03969061,0.0008623287,0.000402096,0.0002451451,0.0001978396,0.00009318584,0.1168537],"genre_scores_gemma":[0.9864032,0.002410594,0.009437392,0.0002555785,0.00008635217,0.000008268131,0.00007149565,0.00001637801,0.001310802],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5800899,"threshold_uncertainty_score":0.9989763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403922183","doi":"10.1080/02331934.2024.2422040","title":"Optimal control of a queueing system","year":2024,"lang":"en","type":"article","venue":"Optimization","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Mathematics; Layered queueing network; Queueing system; Mathematical optimization; Control (management); Applied mathematics; Computer science; Statistics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.005509324901175521,"gpt":0.2069890211312899,"spread":0.2014796962301144,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002433121,0.00007908256,0.000131971,0.000217947,0.00005401339,0.0001214534,0.00007898733,0.00003342532,0.0001211526],"category_scores_gemma":[0.00005665963,0.00007410731,0.00006410378,0.0005092833,0.00001999782,0.0007909818,0.0000248181,0.00004448654,0.00006038877],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002942122,"about_ca_system_score_gemma":0.000008169522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002994239,"about_ca_topic_score_gemma":0.000001254267,"domain_scores_codex":[0.9994435,0.000009234835,0.0001902939,0.0001506357,0.0001093119,0.00009696846],"domain_scores_gemma":[0.999653,0.00003800113,0.00009408517,0.0001161057,0.00009474381,0.000004024908],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001478957,0.000006073706,0.00005259622,0.0002450169,0.00003273251,0.000004964493,0.00001389298,0.8797413,0.000157703,0.1190388,0.00004843685,0.0006437082],"study_design_scores_gemma":[0.0001331193,0.000002454045,0.000004915781,0.0001601374,0.0001237551,0.000001044102,0.0001103546,0.9977589,0.00004984697,0.0001769957,0.001401922,0.00007658377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004355941,0.0001846011,0.985108,0.0001384313,0.000201282,0.00009886368,0.000001568318,0.000297075,0.009614214],"genre_scores_gemma":[0.9925168,0.000002611504,0.006871969,0.000068832,0.0003270802,0.000008816274,0.00001803734,0.00002137202,0.0001644547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9881609,"threshold_uncertainty_score":0.3022008,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4399041129","doi":"10.1080/02331934.2024.2358086","title":"Optimality conditions for bilevel programmes via Moreau envelope reformulation*","year":2024,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Bilevel optimization; Mathematics; Envelope (radar); Mathematical optimization; Applied mathematics; Mathematical economics; Optimization problem; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01965319608947183,"gpt":0.2972087012561994,"spread":0.2775555051667276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002819167,0.0001407494,0.000134292,0.0002549516,0.0002668632,0.0005120841,0.0002728069,0.00008149722,0.0001642228],"category_scores_gemma":[0.00006968807,0.0001259567,0.0001208259,0.00105361,0.00002627741,0.00118973,0.00005848492,0.00005885708,0.00003997398],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009520287,"about_ca_system_score_gemma":0.0001287602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001968175,"about_ca_topic_score_gemma":0.000003808759,"domain_scores_codex":[0.9987922,0.00003755448,0.0003285479,0.0004163509,0.0002307139,0.0001946036],"domain_scores_gemma":[0.9990999,0.0001108929,0.0000791273,0.0002793776,0.0003516621,0.00007902017],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002549206,0.00004242191,0.0000447104,0.00002206311,0.00004513008,6.367731e-7,0.0001333424,0.7935101,0.00002225639,0.1987243,0.0006890981,0.006763475],"study_design_scores_gemma":[0.0001735042,0.00002921899,0.000299279,0.00001524469,0.00003309505,0.000004925349,0.000005692027,0.9867063,0.00008786796,0.008304585,0.004169334,0.0001709098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002587603,0.00006201857,0.9935526,0.003709524,0.0002845096,0.0004100081,0.00004195899,0.0004849653,0.00142858],"genre_scores_gemma":[0.1232606,0.00003152463,0.8737632,0.0002705632,0.0001124709,0.0002175553,0.00104845,0.0000188232,0.001276847],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1931963,"threshold_uncertainty_score":0.5136366,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2073464705","doi":"10.1080/0233193021000015659","title":"Convex Parametric Programming in Abstract Spaces","year":2002,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Banach space; Parametric statistics; Saddle point; Convex analysis; Mathematical optimization; Stability (learning theory); Metric space; Regular polygon; Measure (data warehouse); Subderivative; Space (punctuation); Applied mathematics; Convex optimization; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.02220396084192254,"gpt":0.2314020322656166,"spread":0.209198071423694,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000150803,0.00008198249,0.0001054526,0.0003761053,0.00006453986,0.0002521218,0.0002291603,0.000050976,0.0004769629],"category_scores_gemma":[0.00009615941,0.00008078184,0.00003610043,0.001957613,0.00001177474,0.0006474976,0.00003499145,0.00006330962,0.00007408631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003965083,"about_ca_system_score_gemma":0.00001057043,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002404273,"about_ca_topic_score_gemma":0.000005073595,"domain_scores_codex":[0.9991715,0.00002852962,0.0002118444,0.0002321521,0.0002069584,0.000149038],"domain_scores_gemma":[0.9995268,0.00005728918,0.0001011356,0.0001816321,0.00008563239,0.00004750722],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[5.531073e-7,0.0000843782,0.002476844,0.000002992073,0.000005650423,0.000002214633,0.0001429115,0.9782401,0.000001430975,0.007265904,0.0001289166,0.01164807],"study_design_scores_gemma":[0.0001967728,0.00001184753,0.002043102,0.000005242456,0.000003385633,0.000001454428,0.00001205958,0.9966244,0.00001184198,0.00008283749,0.0009077421,0.00009934512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004928199,0.00007932951,0.992656,0.001564038,0.00008061729,0.0001137847,4.676621e-7,0.0001050803,0.004907857],"genre_scores_gemma":[0.5749199,0.00009930737,0.4242441,0.0001608324,0.00002208425,0.0000141769,0.00001252166,0.000005781504,0.0005213159],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.574427,"threshold_uncertainty_score":0.5222409,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2088396524","doi":"10.1080/02331930902968365","title":"Characterization of subdual latticial cones in Hilbert spaces by the isotonicity of the metric projection","year":2010,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"","funders":"","keywords":"Mathematics; Cone (formal languages); Projection (relational algebra); Hilbert space; Dual cone and polar cone; Combinatorics; Regular polygon; Pure mathematics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.006904141839578624,"gpt":0.2183593732431272,"spread":0.2114552314035486,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000329419,0.00007340759,0.00011889,0.0001606558,0.00008967212,0.00005123374,0.0003453752,0.00006693724,0.00004301154],"category_scores_gemma":[0.0001683727,0.00004700446,0.00004935818,0.001867593,0.00005313835,0.0003776393,0.00006853473,0.00009777242,8.447188e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001642836,"about_ca_system_score_gemma":0.00006869261,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001749569,"about_ca_topic_score_gemma":0.0001083491,"domain_scores_codex":[0.9990928,0.0001116036,0.0002970975,0.0001520504,0.0002650491,0.00008145339],"domain_scores_gemma":[0.9990849,0.0000749563,0.0003500586,0.0002393479,0.000236711,0.00001401619],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003865693,0.0005879573,0.0555191,0.00003727435,0.00007078317,1.360287e-7,0.00240966,0.7480493,0.09420329,0.09464981,0.0001881949,0.00424589],"study_design_scores_gemma":[0.0001940953,0.00001566323,0.02711766,0.000005332548,0.00001458327,9.397307e-7,0.00001468396,0.9606031,0.0117606,0.00008594952,0.0001279651,0.00005943553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2082806,0.00000724222,0.7876151,0.002962605,0.0003707371,0.0003127023,0.00001096936,0.00002020027,0.0004199013],"genre_scores_gemma":[0.9898313,0.00001966552,0.009791965,0.00009772651,0.00002848142,0.00001185953,0.00003637049,0.000004838081,0.0001778117],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7815507,"threshold_uncertainty_score":0.1916786,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067721388","doi":"10.1080/02331930211987","title":"Probabilistic Solutions to Optimal Control Problems","year":2002,"lang":"en","type":"article","venue":"Optimization","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Converse; Probabilistic logic; Optimal control; Brownian motion; Dynamic programming; Diffusion process; Continuation; Section (typography); Nonlinear system; Wiener process; Applied mathematics; Mathematical optimization; Mathematical analysis; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.03288383664830503,"gpt":0.1973789015388059,"spread":0.1644950648905009,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001214287,0.00009841849,0.0001722656,0.0001160161,0.0001976432,0.00005856938,0.0001370638,0.00006152874,0.0005129813],"category_scores_gemma":[0.0001889696,0.0001196357,0.00004293863,0.0004337071,0.0000270859,0.0001330686,0.00002521547,0.00005870863,0.001137638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006451813,"about_ca_system_score_gemma":0.000006550144,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000263654,"about_ca_topic_score_gemma":0.000004585519,"domain_scores_codex":[0.9990783,0.000002057952,0.0003472358,0.0002999834,0.00002859584,0.0002438635],"domain_scores_gemma":[0.9994894,0.00002264663,0.00012661,0.0002081264,0.00006682867,0.00008643669],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001808129,0.00006916162,0.00003481874,0.000006920413,0.000005168897,1.093402e-7,0.0001690704,0.5821064,0.000002338963,0.4168104,0.0004751834,0.0003186156],"study_design_scores_gemma":[0.0003798314,0.00006822075,0.0002291175,0.000009015153,0.000007108631,0.000002423706,0.00001307768,0.9611955,0.000001228299,0.02808385,0.009814249,0.0001963466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0001695179,0.0004094969,0.9843129,0.002121388,0.0001118101,0.0005488519,0.0001067743,0.00007391163,0.01214536],"genre_scores_gemma":[0.927224,0.00004486382,0.07044069,0.000532302,0.0001541086,0.0006434244,0.0000315851,0.00003130286,0.0008976828],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9270545,"threshold_uncertainty_score":0.9996401,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4415504824","doi":"10.1080/02331934.2025.2577413","title":"Eckstein-Ferris-Pennanen-Robinson duality revisited: paramonotonicity, total Fenchel-Rockafellar duality, and the Chambolle-Pock operator","year":2025,"lang":"en","type":"article","venue":"Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Duality (order theory); Operator (biology); Quasinormal operator; Algebra over a field; Compact operator; Strictly singular operator; Finite-rank operator","retraction":null,"screen_n_in":null,"score":{"opus":0.006124928500828608,"gpt":0.2390705785019549,"spread":0.2329456500011263,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001516402,0.0002422124,0.000354245,0.0001022932,0.000532577,0.0005780404,0.0006067396,0.0001365396,0.00005540557],"category_scores_gemma":[0.0001720302,0.000180779,0.00009174192,0.0007260769,0.000148789,0.0005287441,0.0006211335,0.0002114906,0.00001917869],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005308599,"about_ca_system_score_gemma":0.00009533903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005505584,"about_ca_topic_score_gemma":0.000002997562,"domain_scores_codex":[0.9977875,0.000624628,0.0004494472,0.0005727137,0.0002669958,0.0002986724],"domain_scores_gemma":[0.9985828,0.0002431226,0.0001588284,0.0007770985,0.0001507504,0.00008733117],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001685556,0.0002233328,0.0003791529,0.0002034899,0.0001350185,0.00001624534,0.0016533,0.1804599,0.0001390293,0.8032835,0.003037743,0.01030076],"study_design_scores_gemma":[0.002008458,0.00004876101,0.0003385332,0.00008705215,0.00004309327,0.00002753197,0.00007191176,0.9843569,0.001351491,0.007803128,0.00352931,0.0003338138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01551742,0.001591706,0.9662017,0.005308805,0.000549606,0.000994344,0.00001562088,0.0002360392,0.009584823],"genre_scores_gemma":[0.9073528,0.001734673,0.0782054,0.003299869,0.0002792411,0.0001337351,0.00007580157,0.00003827505,0.008880203],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8918354,"threshold_uncertainty_score":0.7371954,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4412146863","doi":"10.1080/02331934.2025.2531054","title":"Minimization of the expected first-passage area for a one-dimensional diffusion process","year":2025,"lang":"en","type":"article","venue":"Optimization","topic":"Diffusion and Search Dynamics","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Diffusion process; Minification; Diffusion; Process (computing); Mathematical optimization; Computer science; Innovation diffusion; Thermodynamics","retraction":null,"screen_n_in":null,"score":{"opus":0.008937221805970157,"gpt":0.2536525778234265,"spread":0.2447153560174564,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006295953,0.00007498533,0.00007978549,0.00004326289,0.0001240156,0.00001288364,0.0001269718,0.00009853914,0.00002257755],"category_scores_gemma":[0.0002457293,0.00005940812,0.00005837029,0.0001886417,0.00003999616,0.000004025127,0.00007148136,0.00002954553,1.711552e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001167966,"about_ca_system_score_gemma":0.00008641878,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002076606,"about_ca_topic_score_gemma":0.00001601821,"domain_scores_codex":[0.9994245,0.00002710606,0.0001583844,0.0001753667,0.0001183221,0.00009630385],"domain_scores_gemma":[0.999432,0.00001784255,0.00008213662,0.0001909509,0.0002565741,0.00002043969],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003429164,0.0004127043,0.002245565,0.0001252307,0.00004703983,8.658065e-8,0.000112762,0.919663,0.07297524,0.0008047246,0.002440203,0.0008305265],"study_design_scores_gemma":[0.001182907,0.00008007343,0.001619413,0.00008873072,0.00002947106,5.308787e-7,0.0000652126,0.9597567,0.03566937,0.0002106543,0.001185177,0.0001117581],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4205631,0.00007436644,0.57533,0.001041912,0.0002366359,0.0008836134,0.00004557788,0.00001920279,0.001805664],"genre_scores_gemma":[0.9875828,0.00005640015,0.008390302,0.0002724205,0.00002693747,0.00007446574,0.0006023498,0.00001393632,0.002980375],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5670198,"threshold_uncertainty_score":0.2422593,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4414207739","doi":"10.1080/02331934.2025.2548732","title":"Special issue to celebrate the scientific career of Stephan Dempe","year":2025,"lang":"en","type":"article","venue":"Optimization","topic":"Infrastructure Resilience and Vulnerability Analysis","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"University of Southampton","keywords":"","retraction":null,"screen_n_in":null,"score":{"opus":0.004465767575514629,"gpt":0.2126835491210916,"spread":0.208217781545577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001438613,0.00005692236,0.00008320954,0.0001167771,0.0001048061,0.00005785004,0.0001319938,0.000034324,0.0004215213],"category_scores_gemma":[0.00003837641,0.00004368025,0.00003320339,0.0008255963,0.00004244758,0.00007418307,0.00001903934,0.00004758935,0.00001196222],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003050539,"about_ca_system_score_gemma":0.00002082556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001005917,"about_ca_topic_score_gemma":0.00005831035,"domain_scores_codex":[0.9995399,0.00001949731,0.000135263,0.0001003016,0.0001086128,0.00009645221],"domain_scores_gemma":[0.9996586,0.00001854442,0.00001430377,0.0001986781,0.00009153515,0.00001828004],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002278048,0.000002963681,0.0003010145,0.00001531833,0.0000112856,7.378812e-8,0.0002502291,0.9847017,0.0005096524,0.0001682718,0.009388447,0.004648772],"study_design_scores_gemma":[0.0001066756,0.0000119827,0.001438337,0.00002344474,0.00005542035,2.00853e-7,0.0002927975,0.9342642,0.01998646,0.0001512317,0.04355834,0.0001109251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07233985,0.00007147194,0.879831,0.000548735,0.00227426,0.0003557349,0.00001441499,0.00008591872,0.04447858],"genre_scores_gemma":[0.9907115,0.00001199363,0.006399919,0.00008209037,0.0006659722,0.00001095836,0.00002317354,0.000009319586,0.002085062],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9183717,"threshold_uncertainty_score":0.4615362,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005391161","doi":"10.1080/02331930903349466","title":"Spectral self-concordant functions in the space of two-by-two symmetric matrices","year":2010,"lang":"en","type":"article","venue":"Optimization","topic":"Matrix Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Mathematics; Combinatorics; Space (punctuation); Function (biology); Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.005073224888707355,"gpt":0.2271738356874473,"spread":0.2221006107987399,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000506808,0.00007990106,0.00009048362,0.0001802628,0.00008200693,0.00008933151,0.0004757061,0.00002962212,0.000047877],"category_scores_gemma":[0.00003717281,0.0000592693,0.00003488416,0.001422213,0.00002341806,0.0003540622,0.0000470329,0.000153391,0.00001354704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001212538,"about_ca_system_score_gemma":0.00003260166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006149857,"about_ca_topic_score_gemma":0.00001770172,"domain_scores_codex":[0.9992525,0.00009044958,0.0001690645,0.0001746271,0.0001712558,0.0001420883],"domain_scores_gemma":[0.9993524,0.0001452654,0.0001102366,0.000317037,0.00004737305,0.00002768772],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001131546,0.0004709676,0.00164663,0.00002696851,0.00002032969,0.000008917248,0.001378426,0.3527273,0.002209832,0.6321578,0.001539137,0.007802364],"study_design_scores_gemma":[0.0004957385,0.00006035315,0.0001916777,0.000005383573,0.00001185743,0.00002084312,0.00006112373,0.9932483,0.001924114,0.003126445,0.0007349718,0.0001192087],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03076183,0.00006906011,0.9604352,0.0005941591,0.0006198623,0.0001793889,0.000004066836,0.00007527991,0.007261218],"genre_scores_gemma":[0.764954,0.00002676161,0.2346095,0.00006298002,0.0001162646,0.00001092694,0.000007553387,0.000006315997,0.0002056704],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7341922,"threshold_uncertainty_score":0.2416932,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4297630972","doi":"10.1080/02331934.2025.2466032","title":"Stackelberg strategy on a degenerate parabolic equation with missing data","year":2025,"lang":"en","type":"article","venue":"Optimization","topic":"Advanced Mathematical Modeling in Engineering","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Stackelberg competition; Degenerate energy levels; Missing data; Applied mathematics; Mathematics; Computer science; Mathematical optimization; Environmental science; Mathematical economics; Physics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05148200405240271,"gpt":0.291999659038129,"spread":0.2405176549857262,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001211506,0.00009563426,0.0000885766,0.00008257764,0.00007879946,0.0001409601,0.0004288486,0.00003259595,0.000002996231],"category_scores_gemma":[0.00008231556,0.00008303714,0.00000702859,0.0003916762,0.00001058871,0.0005900343,0.00009813029,0.00006619228,0.000004557752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003597212,"about_ca_system_score_gemma":0.00006011205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000174939,"about_ca_topic_score_gemma":9.208128e-7,"domain_scores_codex":[0.9992598,0.00002004304,0.0001456542,0.0003019964,0.0001368918,0.0001355969],"domain_scores_gemma":[0.9991013,0.0000701771,0.00004717824,0.0006870025,0.00006335957,0.00003098662],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003161408,0.00001796657,0.000001958144,0.00001251702,0.000004886831,7.821347e-7,0.00002162533,0.9048437,0.00005991448,0.08527778,0.00002241393,0.009733328],"study_design_scores_gemma":[0.0001577812,0.00002450134,0.000006591638,0.00008512912,0.00000565512,8.911074e-7,0.000003167461,0.9951422,0.0006236574,0.003814451,0.00004638505,0.00008961057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002601681,0.00003973373,0.9971021,0.0002802013,0.00007062358,0.0001131958,0.000001401869,0.0001646298,0.001967976],"genre_scores_gemma":[0.1350212,0.0000118333,0.8646592,0.0001115136,0.0000181653,0.000008694567,0.00003446235,0.000009079165,0.0001258149],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.134761,"threshold_uncertainty_score":0.3386157,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983155329","doi":"10.1080/02331930008844509","title":"A path-following cutting plane method for some monotone variational inequalities<sup>∗</sup>","year":2000,"lang":"en","type":"article","venue":"Optimization","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Mathematics; Monotone polygon; Variational inequality; Cutting-plane method; Path (computing); Affine transformation; Operator (biology); Plane (geometry); Set (abstract data type); Strongly monotone; Regular polygon; Point (geometry); Combinatorics; Applied mathematics; Mathematical optimization; Pure mathematics; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01633240886666431,"gpt":0.2697094271933224,"spread":0.2533770183266581,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008816509,0.0001906604,0.0002489052,0.0001999914,0.0003701015,0.0002991291,0.0003781135,0.0001273247,0.0005345462],"category_scores_gemma":[0.0001823072,0.0001980798,0.0001744811,0.0006521654,0.0000090144,0.001325145,0.0000474487,0.0001080247,0.00003651164],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008069853,"about_ca_system_score_gemma":0.000109249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003949871,"about_ca_topic_score_gemma":4.960539e-7,"domain_scores_codex":[0.9981502,0.0001908638,0.0004891624,0.0004773837,0.00040845,0.0002838917],"domain_scores_gemma":[0.9988934,0.0003727609,0.0001629316,0.0003058056,0.0001675237,0.00009752572],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001103567,0.00005487463,0.00007253194,0.000009027832,0.0000629049,0.000001147881,0.0005674426,0.8974514,0.000007848715,0.0957851,0.0002140214,0.00576265],"study_design_scores_gemma":[0.0006832656,0.00003296041,0.00004749241,0.00001681112,0.00004460232,0.000004294445,0.00003167808,0.9934175,0.00003982914,0.004183027,0.001261525,0.0002370362],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002122232,0.00004574293,0.9961826,0.001889871,0.000103348,0.0002929868,0.00003230856,0.0002058428,0.001035055],"genre_scores_gemma":[0.008666537,0.00004047005,0.9870507,0.0014091,0.000223465,0.0001031408,0.0006051147,0.00002263875,0.001878887],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09596606,"threshold_uncertainty_score":0.8077458,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}