{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Adrian S. Lewis","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003859539,0.001101379,0.001271343,0.00153782,0.001011158,0.001906077,0.002052102,0.002642955,0.007490873],"category_scores_gemma":[0.01139162,0.0007436997,0.0009492782,0.001799378,0.002548299,0.003340899,0.004495159,0.00414724,0.003351535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001159644,"about_ca_system_score_gemma":0.003529972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002987667,"about_ca_topic_score_gemma":0.003224635,"domain_scores_codex":[0.9977603,0.0007283918,0.0001187727,0.000312048,0.000870958,0.000209431],"domain_scores_gemma":[0.9969572,0.001365304,0.0001534145,0.0005881031,0.0007766741,0.0001593447],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002134463,0.0001143366,0.0006688741,0.0002116974,0.00007276382,0.0001320651,0.0003322898,0.1309948,0.005417937,0.625008,0.00898194,0.2278517],"study_design_scores_gemma":[0.0000906744,0.0001126968,0.000259237,0.00008053343,0.00001810438,0.0002657937,0.00007663031,0.7788267,0.006120372,0.197651,0.01643246,0.00006576057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002649321,0.0002864916,0.9923707,0.0003775589,0.00006023114,0.00005608878,0.00003493939,0.0002456206,0.003918977],"genre_scores_gemma":[0.06957828,0.0006723064,0.9182022,0.0003577617,0.00009607068,0.0003788102,0.0001678672,0.0003696672,0.01017698],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007490873,"threshold_uncertainty_score":0.02505946,"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","authors":[{"name":"Soheyl Khalilpourazari","is_ca":true},{"name":"Abolfazl Mirzazadeh","is_ca":false},{"name":"Gerhard‐Wilhelm Weber","is_ca":false},{"name":"Seyed Hamid Reza Pasandideh","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001843675,0.001195594,0.001398107,0.001012877,0.0003804338,0.001686298,0.001804143,0.001465425,0.002956116],"category_scores_gemma":[0.002430353,0.0007676215,0.00165182,0.001034453,0.0007051572,0.001502555,0.0009446034,0.001316315,0.0003243929],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001208669,"about_ca_system_score_gemma":0.00145775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005804609,"about_ca_topic_score_gemma":0.003395231,"domain_scores_codex":[0.9991955,0.0002181698,0.00004809945,0.0001775387,0.0002825463,0.00007814679],"domain_scores_gemma":[0.9992777,0.0004046672,0.00009182224,0.00004357002,0.000154973,0.00002734096],"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.00001746846,0.00001385685,0.00008609411,0.00009630484,0.00003128419,0.0000682511,0.00002401496,0.9704437,0.00104972,0.016378,0.0002889329,0.01150239],"study_design_scores_gemma":[0.000003195141,0.00002007017,0.00003429346,0.000007301958,0.000006459085,0.00001131074,0.000004456805,0.9955096,0.0002324328,0.003718691,0.0004471768,0.000004951285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0024423,0.000192,0.9957489,0.0000532493,0.00001590503,0.00002285592,0.00002781399,0.00003281123,0.001464189],"genre_scores_gemma":[0.5180904,0.001116238,0.4726332,0.000151902,0.0001302073,0.0003863094,0.0002395162,0.0001468948,0.007105386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005804609,"threshold_uncertainty_score":0.0115416,"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","authors":[{"name":"Yu Guo","is_ca":false},{"name":"Xiao‐Bao Shu","is_ca":false},{"name":"Fei Xu","is_ca":true},{"name":"Cheng Yang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001165031,0.0006215415,0.00107336,0.0006346215,0.0003954349,0.001288702,0.000928488,0.001653382,0.00296845],"category_scores_gemma":[0.002578494,0.0003146719,0.0007243251,0.0005975227,0.001357713,0.001404105,0.00101067,0.001666534,0.0002742297],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000945857,"about_ca_system_score_gemma":0.001055095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005323141,"about_ca_topic_score_gemma":0.002137958,"domain_scores_codex":[0.999245,0.0001783255,0.00003338482,0.0001432089,0.0002971691,0.0001028619],"domain_scores_gemma":[0.9993076,0.0003320571,0.0001238108,0.00002984666,0.0001699297,0.0000368304],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005062919,0.00002896392,0.000832269,0.0001807399,0.00008426783,0.0003634867,0.0001810879,0.4033087,0.004496171,0.579196,0.00271921,0.008558536],"study_design_scores_gemma":[0.00002573241,0.00002998485,0.0004348312,0.00001774589,0.00001745976,0.00006180967,0.00002635048,0.9203013,0.0003227109,0.07733622,0.001400396,0.00002542898],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02873642,0.001929216,0.9458121,0.001947352,0.0003578776,0.00005539373,0.0002180584,0.0001374526,0.02080619],"genre_scores_gemma":[0.9301448,0.002324718,0.03885479,0.0007220058,0.0003881593,0.0002958786,0.0002597432,0.00009956049,0.02691039],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005323141,"threshold_uncertainty_score":0.01058429,"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","authors":[{"name":"Jianmai Shi","is_ca":true},{"name":"Guoqing Zhang","is_ca":true},{"name":"Kin Keung Lai","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002331578,0.001257379,0.002013854,0.0007946483,0.0006792561,0.002253739,0.001657809,0.002408841,0.00320167],"category_scores_gemma":[0.006239674,0.001586643,0.001018072,0.001820093,0.001365355,0.003184343,0.001222622,0.001856514,0.0003045576],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002837042,"about_ca_system_score_gemma":0.002330626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01130869,"about_ca_topic_score_gemma":0.00747999,"domain_scores_codex":[0.9985527,0.0006553819,0.0000542681,0.0002093664,0.0002526978,0.0002755515],"domain_scores_gemma":[0.9973773,0.001842778,0.000302379,0.0001015277,0.0001947913,0.0001813493],"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.00006777079,0.00005022023,0.0003197313,0.00005832281,0.00002584108,0.0001341149,0.00003375472,0.978411,0.0005192761,0.01631702,0.0003097577,0.003753172],"study_design_scores_gemma":[0.00001967258,0.00003050467,0.0001034633,0.000003442389,0.00001177516,0.0000175615,0.00001822996,0.9939927,0.0001752193,0.005407291,0.0002115603,0.000008467182],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1556839,0.0009914858,0.8308358,0.0009031512,0.0001002024,0.0001778469,0.0002877462,0.0001682767,0.01085161],"genre_scores_gemma":[0.9021321,0.0007886253,0.0912228,0.00007094054,0.00008033274,0.0001231768,0.0001733266,0.0000699551,0.005338699],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01130869,"threshold_uncertainty_score":0.02248573,"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","authors":[{"name":"S. Zlobec","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002125938,0.0008280969,0.0007484448,0.00171023,0.0006591741,0.0031431,0.000914849,0.0009707226,0.005747641],"category_scores_gemma":[0.007629556,0.0004245595,0.0007871088,0.0009608068,0.003533783,0.00386412,0.002143307,0.002341934,0.0005159004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001795505,"about_ca_system_score_gemma":0.0008025048,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006643381,"about_ca_topic_score_gemma":0.0003648736,"domain_scores_codex":[0.9986497,0.0003234125,0.00008044556,0.0002825717,0.0004376009,0.0002262721],"domain_scores_gemma":[0.9969036,0.001443031,0.0004135779,0.0003188442,0.0006918568,0.0002290772],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00003201646,0.00002347312,0.0006821166,0.00005863019,0.00001431768,0.0001228862,0.0001841162,0.02330136,0.004975462,0.9566742,0.0006857862,0.01324558],"study_design_scores_gemma":[0.00001515776,0.00007068329,0.001173252,0.00005508354,0.00001536209,0.0001865212,0.0001759254,0.280617,0.007226292,0.7050685,0.005369737,0.0000264966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1862091,0.0005598135,0.7789629,0.0008278104,0.00005000827,0.00007253318,0.0001676238,0.0001676027,0.03298274],"genre_scores_gemma":[0.9441113,0.0004314859,0.04839555,0.0001009974,0.00008317128,0.0001274544,0.0002934833,0.00009711021,0.006359309],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005747641,"threshold_uncertainty_score":0.0192278,"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","authors":[{"name":"S. Fathi-Hafshejani","is_ca":false},{"name":"H. Mansouri","is_ca":false},{"name":"M. Reza Peyghami","is_ca":false},{"name":"Stephen Chen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001708937,0.001232451,0.001914528,0.0006745745,0.0005194628,0.001016249,0.001713366,0.001480186,0.002301073],"category_scores_gemma":[0.002943142,0.0005255816,0.0008947359,0.0008826838,0.001250954,0.001575735,0.001617094,0.003020229,0.0009786087],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007641219,"about_ca_system_score_gemma":0.001414171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00145599,"about_ca_topic_score_gemma":0.0009993798,"domain_scores_codex":[0.9993338,0.0002650566,0.00003077541,0.0000899773,0.000225983,0.00005442991],"domain_scores_gemma":[0.999138,0.0004515196,0.00006711893,0.00008792638,0.0002028545,0.00005253681],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001385796,0.0001538085,0.0004827594,0.0003540438,0.00006873369,0.0001322008,0.0001250399,0.8123974,0.005751894,0.08387239,0.002868,0.09365515],"study_design_scores_gemma":[0.000008355576,0.00001477318,0.00001691958,0.000004303331,0.000003114254,0.00001540471,0.000003409966,0.9955485,0.0003562957,0.003507672,0.0005174071,0.000003852775],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001641814,0.0001388219,0.9974976,0.00005702495,0.00002847746,0.00001437634,0.000005623413,0.00006792981,0.0005482998],"genre_scores_gemma":[0.1407224,0.0004932843,0.8548634,0.0001271172,0.0001040033,0.0002746101,0.0001021938,0.0002000907,0.003112879],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002301073,"threshold_uncertainty_score":0.009037852,"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","authors":[{"name":"Renata Sotirov","is_ca":false},{"name":"Tamás Terlaky","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001683744,0.001019388,0.001130282,0.0005064879,0.0006609065,0.001058597,0.001377043,0.001484449,0.006303459],"category_scores_gemma":[0.003965016,0.0006348115,0.0008077887,0.0004901946,0.001259967,0.001193719,0.001916489,0.002017725,0.001243435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001007076,"about_ca_system_score_gemma":0.001455249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002534622,"about_ca_topic_score_gemma":0.00295027,"domain_scores_codex":[0.9992744,0.0003229754,0.00002483887,0.0001165526,0.0001902466,0.00007086902],"domain_scores_gemma":[0.9978805,0.001456485,0.0001326396,0.0001277263,0.0002838188,0.0001188432],"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.000133714,0.00007133599,0.0003124285,0.0001427711,0.00004552673,0.0001964409,0.0001387268,0.8851364,0.003288939,0.08305286,0.002189549,0.02529137],"study_design_scores_gemma":[0.00001319247,0.00002357402,0.00002162308,0.000005215031,0.000003510166,0.00001489095,0.000008633267,0.987897,0.0006282327,0.01063287,0.0007453173,0.000005938272],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003701509,0.00008743833,0.9935862,0.0001119343,0.00001893137,0.00002945405,0.00001627913,0.0001161859,0.002332046],"genre_scores_gemma":[0.2546322,0.00018831,0.7368879,0.0002158062,0.00005757196,0.0002990856,0.0001384994,0.0003906474,0.007189952],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006303459,"threshold_uncertainty_score":0.02108717,"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","authors":[{"name":"Yun-Bin Zhao","is_ca":false},{"name":"Zhongbo Peng","is_ca":true},{"name":"Xiaoguang Yang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007282122,0.002244581,0.001960392,0.002559032,0.001248797,0.002578926,0.001892386,0.001836857,0.003429262],"category_scores_gemma":[0.02151556,0.0007563337,0.00234319,0.001958071,0.003310559,0.004560337,0.003706638,0.004824462,0.0004981423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00207266,"about_ca_system_score_gemma":0.001913449,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002461728,"about_ca_topic_score_gemma":0.001322418,"domain_scores_codex":[0.9974509,0.001203908,0.0001844223,0.0003369825,0.0006306593,0.0001931034],"domain_scores_gemma":[0.9911164,0.006064703,0.0005291373,0.0004781396,0.001555098,0.0002564719],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009399105,0.00007806085,0.0008968675,0.0005727599,0.0001159195,0.0002911168,0.0004398708,0.2267813,0.006043669,0.7363147,0.002608416,0.02576342],"study_design_scores_gemma":[0.000009789022,0.00007929544,0.000344021,0.00009559002,0.00002336657,0.0001145995,0.00007997522,0.7502947,0.001564066,0.244626,0.002742901,0.00002566492],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01679267,0.002005567,0.9701351,0.0007483232,0.00009399597,0.00006894537,0.0001147223,0.0000814499,0.009959253],"genre_scores_gemma":[0.6727328,0.01008887,0.291818,0.001188485,0.0005223335,0.001349673,0.001037521,0.0006092184,0.02065295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007282122,"threshold_uncertainty_score":0.03851199,"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","authors":[{"name":"V. A. Bulavsky","is_ca":false},{"name":"G. Isac","is_ca":true},{"name":"Vyacheslav V. Kalashnikov","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000787964,0.0003647548,0.0004418559,0.001183942,0.0007755395,0.001295081,0.0004766471,0.000542318,0.001480973],"category_scores_gemma":[0.002693677,0.0001786663,0.0005495836,0.0007871497,0.002088564,0.001946881,0.00203368,0.0008896548,0.000112299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008519925,"about_ca_system_score_gemma":0.0005039051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006462797,"about_ca_topic_score_gemma":0.0004798604,"domain_scores_codex":[0.999604,0.0001630018,0.00001615782,0.00004699852,0.0001158165,0.00005391131],"domain_scores_gemma":[0.9987891,0.0007144547,0.000143192,0.00006788375,0.0001575841,0.0001277085],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001329395,0.00000692798,0.0002475146,0.000038669,0.00001048034,0.00006153309,0.00009148935,0.02345287,0.00099946,0.9694697,0.0002900502,0.005318072],"study_design_scores_gemma":[0.000006951323,0.00002960535,0.0002332576,0.00001403246,0.000006313788,0.00009079278,0.00007976206,0.1834698,0.0005646995,0.8131864,0.002306274,0.00001213871],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1509211,0.00152681,0.8081905,0.00167882,0.0001193296,0.00003400728,0.00006261253,0.00006305079,0.03740382],"genre_scores_gemma":[0.9523718,0.001152316,0.04151271,0.00009096359,0.0001645974,0.00005196744,0.00005561654,0.00002323892,0.004576821],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.001480973,"threshold_uncertainty_score":0.006181657,"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","authors":[{"name":"Paulo Klinger Monteiro","is_ca":false},{"name":"Frank H. Page","is_ca":false},{"name":"Myrna Wooders","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003268235,0.001148955,0.0008355241,0.001989393,0.001287943,0.002737226,0.001003905,0.0007050682,0.00595249],"category_scores_gemma":[0.005197523,0.0003012935,0.001224819,0.00157159,0.003998532,0.005582643,0.002342701,0.002945993,0.0003725043],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001173315,"about_ca_system_score_gemma":0.001038091,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001974303,"about_ca_topic_score_gemma":0.001577555,"domain_scores_codex":[0.9990182,0.0002601179,0.00004386807,0.000142741,0.000332878,0.0002022364],"domain_scores_gemma":[0.9963003,0.001482186,0.0008546683,0.0003090418,0.0005333822,0.0005204784],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002489805,0.00001799543,0.0007144546,0.00004354236,0.000007312589,0.0001009549,0.0001641959,0.008850035,0.0003536633,0.9838435,0.0006546216,0.005224884],"study_design_scores_gemma":[0.00001691876,0.00005647877,0.001073452,0.00006130151,0.00001222144,0.0001795523,0.0003055721,0.04471568,0.0004519105,0.9471567,0.005950895,0.00001934835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2798032,0.004612745,0.5974593,0.001091243,0.0001277395,0.0001453015,0.0003616518,0.0002158025,0.116183],"genre_scores_gemma":[0.9237146,0.00312705,0.06091594,0.0002440897,0.0001673681,0.0001651981,0.0003332189,0.0001472517,0.01118525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00595249,"threshold_uncertainty_score":0.01991302,"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","authors":[{"name":"Mario Lefebvre","is_ca":true},{"name":"Roozbeh Yaghoubi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001178884,0.001210345,0.001127538,0.0004632226,0.0006116579,0.001874718,0.001052598,0.001279718,0.002109687],"category_scores_gemma":[0.002335893,0.000419843,0.0004635135,0.0004380193,0.001823322,0.0008982089,0.00128171,0.001096805,0.0001910615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0027712,"about_ca_system_score_gemma":0.002191433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02006231,"about_ca_topic_score_gemma":0.006228501,"domain_scores_codex":[0.9990668,0.0003421619,0.00002927845,0.000215244,0.0001404172,0.0002060801],"domain_scores_gemma":[0.9991173,0.0004744713,0.0001259843,0.00003248989,0.0001584411,0.00009135666],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007235465,0.00005388933,0.0002112797,0.00005168631,0.00002027989,0.00006567992,0.00004665971,0.9608701,0.001778329,0.03242014,0.0005006313,0.003908879],"study_design_scores_gemma":[0.00001730186,0.00003353861,0.00005780501,0.00000321608,0.000005019488,0.000002844391,0.000007358311,0.99506,0.0001131502,0.004517723,0.0001771303,0.000004794752],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1279331,0.001089292,0.8471383,0.001598225,0.0002160414,0.00011296,0.0001777739,0.0003098773,0.02142446],"genre_scores_gemma":[0.9819797,0.0003176205,0.01309123,0.00008290874,0.00006919065,0.00006616028,0.00004378854,0.00001891136,0.004330547],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02006231,"threshold_uncertainty_score":0.03989112,"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","authors":[{"name":"Kuang Bai","is_ca":false},{"name":"Jane J. Ye","is_ca":true},{"name":"Shangzhi Zeng","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002434047,0.0009323877,0.0009117736,0.000833409,0.0006423285,0.002200584,0.0008802392,0.001577957,0.01294599],"category_scores_gemma":[0.005378396,0.0005247951,0.0013438,0.0008131717,0.002270147,0.00408364,0.002098282,0.003130968,0.001487004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001713311,"about_ca_system_score_gemma":0.001427319,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00168475,"about_ca_topic_score_gemma":0.001602425,"domain_scores_codex":[0.9992458,0.0002566854,0.00003723304,0.0001476791,0.0001620311,0.0001506334],"domain_scores_gemma":[0.9990517,0.0004893224,0.0001144349,0.00008558683,0.0001739027,0.00008495287],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000008744961,0.00002185235,0.00006470839,0.00004088813,0.000004379431,0.00002477067,0.00006360751,0.02257057,0.0004075587,0.9710271,0.001132154,0.00463365],"study_design_scores_gemma":[0.00002880292,0.00005315825,0.0001255562,0.00007080872,0.000007399642,0.00003213314,0.0000613127,0.2418761,0.0007599417,0.7498819,0.007085526,0.00001746309],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02476678,0.0004376509,0.9083542,0.001276952,0.00009553646,0.0001348297,0.000306415,0.0000980714,0.0645296],"genre_scores_gemma":[0.5851703,0.001541682,0.3746772,0.001080991,0.0002651307,0.0009019861,0.0008146554,0.0004592662,0.03508883],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01294599,"threshold_uncertainty_score":0.04330862,"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","authors":[{"name":"Masoud Asgharian","is_ca":true},{"name":"S. Zlobec","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002422474,0.001393318,0.001116601,0.001036556,0.0006427722,0.002877736,0.0006886257,0.001342295,0.002537046],"category_scores_gemma":[0.006702349,0.0005767222,0.0008552831,0.001730333,0.002800463,0.003346165,0.002304556,0.002492605,0.0004096469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001988726,"about_ca_system_score_gemma":0.001022722,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002138639,"about_ca_topic_score_gemma":0.001416006,"domain_scores_codex":[0.9978841,0.001189913,0.00009324801,0.0002555236,0.0004517851,0.0001254264],"domain_scores_gemma":[0.9969081,0.002208227,0.0003117954,0.0001659792,0.0002731779,0.0001325749],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002369288,0.00002368086,0.0001603808,0.0000782706,0.00003005289,0.00006695607,0.0001296422,0.1324154,0.0007481662,0.8550168,0.0009637302,0.01034324],"study_design_scores_gemma":[0.000008313735,0.00002817848,0.0000859376,0.00001932098,0.000006615372,0.00002382458,0.00003432493,0.3387234,0.0001851007,0.6586301,0.002247789,0.000007164078],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03404663,0.004239127,0.935228,0.001826283,0.0001216144,0.00004573655,0.0001463617,0.0001092195,0.02423704],"genre_scores_gemma":[0.8511291,0.004401903,0.1297597,0.0002495193,0.0004421806,0.0002400773,0.0002706939,0.0001247909,0.01338213],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002877736,"threshold_uncertainty_score":0.01442927,"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","authors":[{"name":"S. Z. Németh","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001595142,0.0006737967,0.0005798388,0.001961005,0.001023437,0.003035792,0.0007629087,0.0004863434,0.003112961],"category_scores_gemma":[0.004510148,0.0003712324,0.0009249604,0.001121483,0.003540762,0.003483206,0.001949299,0.002590191,0.0003341008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001026362,"about_ca_system_score_gemma":0.0007751159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001034055,"about_ca_topic_score_gemma":0.001018392,"domain_scores_codex":[0.9986273,0.000314697,0.00009758642,0.0002170845,0.0005598124,0.0001834988],"domain_scores_gemma":[0.9958306,0.001208981,0.0006907866,0.0003840178,0.001178597,0.0007070036],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000345066,0.0000222534,0.001028958,0.00002442189,0.000007087005,0.0001508421,0.0002213729,0.002635633,0.001472717,0.9895085,0.00041503,0.004478577],"study_design_scores_gemma":[0.00001379344,0.00004625992,0.001172865,0.00002187706,0.000006559989,0.0002868937,0.0002059683,0.04548275,0.001358861,0.9491777,0.002195252,0.00003123337],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4908135,0.000703224,0.4683346,0.0006157838,0.00006873355,0.0001375032,0.0004033786,0.0001277987,0.03879559],"genre_scores_gemma":[0.9447803,0.0004707966,0.04705391,0.0001448014,0.0001172846,0.0001266907,0.0005801806,0.00008045114,0.006645628],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003112961,"threshold_uncertainty_score":0.01041394,"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","authors":[{"name":"Mario Lefebvre","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00354555,0.001799611,0.001605957,0.0009762602,0.000884592,0.002473222,0.001567002,0.002941673,0.00600219],"category_scores_gemma":[0.01176999,0.0008283731,0.001331854,0.001147867,0.002431556,0.002109611,0.002894015,0.002585361,0.000455133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002088446,"about_ca_system_score_gemma":0.002247327,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001922577,"about_ca_topic_score_gemma":0.001570361,"domain_scores_codex":[0.9981419,0.0008356604,0.0001044214,0.0003133243,0.0003965681,0.0002080429],"domain_scores_gemma":[0.9966369,0.002501345,0.0003353879,0.0001176136,0.0002551738,0.0001535019],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00002348138,0.00002356769,0.0001217563,0.0001134102,0.00003280341,0.00004011813,0.00007777526,0.2334922,0.0002684983,0.7578084,0.001359408,0.006638527],"study_design_scores_gemma":[0.000046091,0.000036309,0.0000897405,0.00002912506,0.00001062607,0.00001739741,0.00003234129,0.4055974,0.0001242976,0.591423,0.002579799,0.00001397697],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01320162,0.001783442,0.9607149,0.002539641,0.000171413,0.00007680376,0.0001573751,0.00009222095,0.02126262],"genre_scores_gemma":[0.675991,0.006010919,0.286741,0.0008406334,0.00116125,0.001171677,0.0005114508,0.0001778544,0.02739424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00600219,"threshold_uncertainty_score":0.02007931,"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","authors":[{"name":"Heinz H. Bauschke","is_ca":true},{"name":"Walaa M. Moursi","is_ca":true},{"name":"Shambhavi Singh","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003035486,0.0007397858,0.001048222,0.001365373,0.00106553,0.002884059,0.001342361,0.001289398,0.004401396],"category_scores_gemma":[0.009012329,0.0003386283,0.001089365,0.001302516,0.004154515,0.00458693,0.002800818,0.002742335,0.0006693218],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001302009,"about_ca_system_score_gemma":0.00100419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005320853,"about_ca_topic_score_gemma":0.0004046373,"domain_scores_codex":[0.9990484,0.0003747094,0.00004206673,0.0001807384,0.0002542195,0.00009979883],"domain_scores_gemma":[0.9980052,0.001109832,0.0001965909,0.0002141554,0.0003089213,0.0001652632],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000007667531,0.000004394664,0.00005739526,0.00001339114,0.000003595976,0.00002168514,0.00003748894,0.002198787,0.0001652094,0.9946537,0.0004000121,0.002436703],"study_design_scores_gemma":[0.000006982743,0.00001471776,0.00006974422,0.00001349223,0.000003950955,0.00007442899,0.00003596008,0.03190281,0.0003638393,0.9659462,0.00156015,0.000007757358],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07249681,0.001954385,0.8678825,0.002817142,0.0002111423,0.00004964191,0.0001462584,0.00009917314,0.05434289],"genre_scores_gemma":[0.8462306,0.001892125,0.1367748,0.0009004035,0.0003851788,0.0001488634,0.00014079,0.0001500939,0.01337718],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004401396,"threshold_uncertainty_score":0.01605338,"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","authors":[{"name":"Mario Lefebvre","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002187648,0.0008909909,0.001535519,0.000896296,0.0004841496,0.001428798,0.001312269,0.001597238,0.002015042],"category_scores_gemma":[0.006071301,0.00051495,0.0007962688,0.0006664504,0.001630936,0.001957128,0.00123612,0.001110887,0.0002573205],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001852229,"about_ca_system_score_gemma":0.001303279,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001269808,"about_ca_topic_score_gemma":0.0007134998,"domain_scores_codex":[0.999432,0.0002067349,0.00003114575,0.000162604,0.0001045348,0.00006297635],"domain_scores_gemma":[0.9970528,0.002080756,0.000318798,0.0001023899,0.0002351846,0.0002100769],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001043125,0.00005392361,0.0005738343,0.000205141,0.00007699437,0.0001126282,0.00007518922,0.8843148,0.006270973,0.09870262,0.0005625645,0.008947029],"study_design_scores_gemma":[0.00001401035,0.00007422504,0.0002542801,0.00001616258,0.00001588028,0.00004040359,0.00001644818,0.957729,0.001236064,0.04017655,0.0004067296,0.00002012351],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.079431,0.0009643418,0.9143378,0.0007613138,0.00005044186,0.00004384041,0.00009046916,0.000121131,0.00419963],"genre_scores_gemma":[0.8026128,0.001304114,0.1832991,0.0001741304,0.0001011243,0.0002990383,0.0002453546,0.0002871759,0.01167714],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002187648,"threshold_uncertainty_score":0.01343894,"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":"","authors":[{"name":"Patrick Mehlitz","is_ca":false},{"name":"Jacqueline Morgan","is_ca":false},{"name":"Christiane Tammer","is_ca":false},{"name":"Jane J. Ye","is_ca":true},{"name":"Alain B. Zemkoho","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002119773,0.00212565,0.00165836,0.001267958,0.001584032,0.005683592,0.001265496,0.003531937,0.04770833],"category_scores_gemma":[0.009604747,0.0004562194,0.001401322,0.0006767555,0.001372133,0.00323929,0.002024862,0.008506058,0.03326976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00164313,"about_ca_system_score_gemma":0.002033631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006020755,"about_ca_topic_score_gemma":0.001220106,"domain_scores_codex":[0.9982885,0.0002972048,0.00009913549,0.0003922324,0.0007463187,0.0001767249],"domain_scores_gemma":[0.9937888,0.001788655,0.0003654565,0.0003810351,0.002189722,0.001486299],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00001507526,0.00001143803,0.00002653703,0.00005025552,0.000008354969,0.00003078854,0.000006777931,0.0001827026,0.00009620607,0.002757707,0.9897529,0.007061278],"study_design_scores_gemma":[0.00001241738,0.00003855127,0.0001458792,0.0001071123,0.00001206429,0.0001363422,0.00002043736,0.000907523,0.0002009331,0.007297416,0.9911032,0.00001811233],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"editorial","genre_gemma":"editorial","genre_scores_codex":[0.000290037,0.01000203,0.005058601,0.0899419,0.8743284,0.00002848682,0.0003270253,0.0003720865,0.01965126],"genre_scores_gemma":[0.00573464,0.009749426,0.002521924,0.0264403,0.871812,0.00006554856,0.000299695,0.0009339739,0.08244253],"genre_candidate":"editorial","genre_consensus":"editorial","teacher_disagreement_score":0.04770833,"threshold_uncertainty_score":0.1596003,"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","authors":[{"name":"Javier Peña","is_ca":false},{"name":"Hristo S. Sendov","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001202779,0.0006778467,0.0004023663,0.001556957,0.000676702,0.001307552,0.0006666216,0.000539608,0.003223796],"category_scores_gemma":[0.004405499,0.0002153683,0.0003378518,0.000473559,0.002005042,0.00135193,0.001075833,0.000659581,0.0004899459],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007141972,"about_ca_system_score_gemma":0.0004993125,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006918415,"about_ca_topic_score_gemma":0.0004354298,"domain_scores_codex":[0.9993098,0.0002747623,0.00002067302,0.00008027189,0.0002043898,0.0001100229],"domain_scores_gemma":[0.9976429,0.0009473263,0.0003676006,0.0002169299,0.0004697127,0.0003553734],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000192381,0.00007531732,0.001560337,0.000059085,0.00002480948,0.0001998107,0.0002524218,0.04339617,0.006350779,0.9324784,0.001525373,0.013885],"study_design_scores_gemma":[0.00003160076,0.00009411312,0.001542487,0.00002340372,0.000009185783,0.0002850923,0.0001526152,0.4925033,0.005759459,0.4974985,0.0020659,0.00003448964],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.677828,0.0002475928,0.3037956,0.0003779372,0.00004983477,0.00003572818,0.00009975165,0.0001352953,0.01743032],"genre_scores_gemma":[0.9781433,0.0001136954,0.01577748,0.00005407236,0.00003626963,0.00003689783,0.00007779658,0.00003817681,0.005722269],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.003223796,"threshold_uncertainty_score":0.01078469,"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","authors":[{"name":"Landry Djomegne","is_ca":false},{"name":"Cyrille Kenne","is_ca":true},{"name":"Romario Gildas Foko Tiomela","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001644621,0.0009602979,0.001306237,0.0005514415,0.0007006837,0.001295181,0.001142945,0.001458496,0.001907699],"category_scores_gemma":[0.002573776,0.0004189766,0.0009096006,0.0004312402,0.001853789,0.001120367,0.002532078,0.001565854,0.0001604165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001395782,"about_ca_system_score_gemma":0.001309558,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004115163,"about_ca_topic_score_gemma":0.001684821,"domain_scores_codex":[0.9992952,0.0002815437,0.00003556205,0.0001430501,0.0001326323,0.0001119542],"domain_scores_gemma":[0.9990964,0.0004234201,0.0001509919,0.00005692456,0.000116853,0.0001554747],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002533011,0.00009920478,0.001351799,0.0001604149,0.0001339719,0.0006238036,0.0002544831,0.511902,0.007329326,0.4627793,0.001298072,0.0138143],"study_design_scores_gemma":[0.00003628405,0.0001359541,0.0001676229,0.000009859732,0.00001601066,0.00002835726,0.00004330742,0.9351631,0.0004800716,0.06340455,0.0004968991,0.00001791849],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1440968,0.0004196417,0.8413398,0.001240234,0.00009080512,0.00008259578,0.000178179,0.0000970669,0.01245489],"genre_scores_gemma":[0.9618188,0.0002530145,0.02933961,0.0002060728,0.0000585314,0.0001481965,0.0001090524,0.00001647417,0.00805036],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004115163,"threshold_uncertainty_score":0.01012713,"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","authors":[{"name":"Faranak Sharifi Mokhtarian","is_ca":true},{"name":"Jean‐Louis Goffin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001506374,0.001094148,0.0008391421,0.0008411386,0.0006090721,0.0008891222,0.001286947,0.001275002,0.006820611],"category_scores_gemma":[0.001939276,0.0005818307,0.001010057,0.0008318112,0.0008284927,0.001496316,0.001336197,0.003076066,0.0009634923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007868839,"about_ca_system_score_gemma":0.001184757,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001861281,"about_ca_topic_score_gemma":0.001770903,"domain_scores_codex":[0.9994087,0.0001429077,0.00003204554,0.0001310279,0.0002382302,0.00004706128],"domain_scores_gemma":[0.9994465,0.0002845876,0.000039145,0.00005460097,0.0001410171,0.00003408549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001628921,0.0002061548,0.0006887983,0.000437289,0.00009522451,0.0002080925,0.0002174021,0.1835189,0.02172927,0.2352109,0.005558928,0.5519662],"study_design_scores_gemma":[0.00004107551,0.0001286802,0.0001945761,0.00003523558,0.00002343684,0.0001569685,0.00002046905,0.9353724,0.00525127,0.05001301,0.008739598,0.00002331543],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001106584,0.00006032161,0.9981213,0.00003683446,0.00001048333,0.00003350245,0.00001475281,0.00004656148,0.0005696128],"genre_scores_gemma":[0.02700518,0.00015012,0.970648,0.00004614537,0.00002466604,0.0001704489,0.0001179554,0.00006791851,0.00176965],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006820611,"threshold_uncertainty_score":0.02281725,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}