{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":119,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":119,"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":"29c566451c22","filters":{"venue":"Journal of Optimization Theory and Applications"}},"results":[{"id":"W1575435306","doi":"10.1023/a:1017547630113","title":"Cooperative Advertising in a Marketing Channel","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":155,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Goodwill; Stackelberg competition; Business; Marginal cost; Channel (broadcasting); Promotion (chess); Microeconomics; Advertising; Stock (firearms); Marketing channel; Marketing; Industrial organization; Economics; Computer science; Finance; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.01097388527567893,"gpt":0.2432348558083769,"spread":0.232260970532698,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001370391,0.00007152409,0.0001163076,0.0002490195,0.0001445904,0.0001063702,0.00007794166,0.0000291161,0.0001634307],"category_scores_gemma":[0.0001542486,0.00006495522,0.00002815732,0.0004603711,0.00003098765,0.0006632118,0.00003233709,0.0001068987,0.000002835124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001141052,"about_ca_system_score_gemma":0.00001308363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005056624,"about_ca_topic_score_gemma":0.000004425212,"domain_scores_codex":[0.9994097,0.00004559562,0.0002908758,0.00008517161,0.0000773288,0.00009132714],"domain_scores_gemma":[0.9993401,0.0001762992,0.000241378,0.00006199011,0.0001692038,0.00001106429],"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.002030185,0.0006705348,0.116814,0.000215519,0.00009252596,0.00006133515,0.0008198321,0.4093505,0.001139964,0.1206398,0.0004380708,0.3477278],"study_design_scores_gemma":[0.01241747,0.0001128303,0.2883519,0.002130157,0.001155305,0.0009902436,0.01626798,0.4451637,0.0002229174,0.07466372,0.155836,0.002687765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1708153,0.000839645,0.8061365,0.0008475032,0.0001173396,0.0003979965,9.267621e-7,0.00003349315,0.0208113],"genre_scores_gemma":[0.9980263,0.0002502693,0.0009168744,0.0003643754,0.0002763429,0.00001470656,0.00000365071,0.00001043487,0.0001370929],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.827211,"threshold_uncertainty_score":0.2648797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975919871","doi":"10.1007/s10957-005-6538-5","title":"On Stability and Stabilizability of Singular Stochastic Systems with Delays","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":105,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Impulse (physics); Theory of computation; Control theory (sociology); Stability (learning theory); Full state feedback; Class (philosophy); Applied mathematics; Control (management); Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.006176934297306274,"gpt":0.1997355901681808,"spread":0.1935586558708745,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009331678,0.0001015863,0.000243032,0.00006519109,0.00006499352,0.00002604565,0.00006894579,0.00004984765,0.0000202024],"category_scores_gemma":[0.00007886017,0.00007894723,0.00003038548,0.0001227092,0.0001336954,0.0001526019,0.000006941449,0.0001045427,2.834034e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004592822,"about_ca_system_score_gemma":0.00002516523,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001104577,"about_ca_topic_score_gemma":0.000001176649,"domain_scores_codex":[0.9991207,0.0001102626,0.0004417468,0.0001030217,0.000139932,0.00008437899],"domain_scores_gemma":[0.9987814,0.0005641518,0.000175611,0.000180144,0.0002214663,0.00007723241],"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.0001497393,0.00007381441,0.000147297,0.00009807476,0.0000389566,1.013308e-7,0.0002800577,0.9699167,0.0002244169,0.0274605,0.000002850701,0.001607463],"study_design_scores_gemma":[0.002251412,0.0006505004,0.0005645768,0.0002453507,0.0002334923,0.0001072281,0.002641354,0.9817771,0.0007935667,0.009853489,0.0005039544,0.0003779154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1757994,0.001021249,0.8225332,0.00004049048,0.00002297939,0.0003201943,0.00001051685,0.00001875481,0.0002331936],"genre_scores_gemma":[0.9975271,0.00003637061,0.002326444,0.000009324847,0.00005696904,0.00002785254,0.00000161195,0.00001055407,0.000003733544],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8217277,"threshold_uncertainty_score":0.3219375,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W48523452","doi":"10.1023/a:1004649211111","title":"Convergence Properties of Two-Stage Stochastic Programming","year":2000,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":97,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Science North","funders":"","keywords":"Mathematics; Proofs of convergence of random variables; Convergence (economics); Mathematical optimization; Stochastic programming; Exponential function; Rate of convergence; Theory of computation; Convergence tests; Compact convergence; Applied mathematics; Stochastic optimization; Normal convergence; Convergence of random variables; Quadratic programming; Random variable; Computer science; Algorithm; Statistics; Algebra of random variables; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.04315506297365662,"gpt":0.3381747733330435,"spread":0.2950197103593869,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002087665,0.00008676112,0.0002108506,0.0001892384,0.0001575727,0.00008639016,0.0002686349,0.00003966622,0.0007494816],"category_scores_gemma":[0.0002859487,0.00006093645,0.00006733108,0.000591881,0.0001764692,0.0004421014,0.00001727095,0.00008602375,0.00001038223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008444211,"about_ca_system_score_gemma":0.00006995024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001724362,"about_ca_topic_score_gemma":4.021622e-7,"domain_scores_codex":[0.998341,0.0001862288,0.0008199809,0.0001403429,0.000415702,0.0000967087],"domain_scores_gemma":[0.9981724,0.0002551675,0.0006793473,0.0002084519,0.0005981524,0.0000864726],"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.00009355441,0.00006722574,0.0001783966,0.000003661205,0.00001283512,3.301962e-7,0.000379047,0.9017427,0.0001651552,0.0289564,0.00002879968,0.06837187],"study_design_scores_gemma":[0.005121205,0.0008778351,0.0009654233,0.0003604628,0.0005026456,0.0004419412,0.01016163,0.7562362,0.009400138,0.1445143,0.0702021,0.00121614],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03782001,0.0005703586,0.9602161,0.0001095896,0.00004221042,0.0002572447,0.000005084446,0.000009831268,0.0009695686],"genre_scores_gemma":[0.9772376,0.0006878833,0.02001929,0.00004704951,0.00008160818,0.00001985024,0.000002396017,0.000008805656,0.001895449],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9401968,"threshold_uncertainty_score":0.8206298,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3021784020","doi":"10.1023/a:1017515721760","title":"Robust Stability and Stabilizability of Markov Jump Linear Uncertain Systems with Mode-Dependent Time Delays","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":75,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Control theory (sociology); Mathematics; Theory of computation; Stability (learning theory); Class (philosophy); State (computer science); Jump; Linear system; Mode (computer interface); Controller (irrigation); Computer science; Control (management); Algorithm; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.01248494133695252,"gpt":0.21361769179469,"spread":0.2011327504577375,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001444147,0.0001523031,0.0003771827,0.00008561897,0.00009301248,0.00003590565,0.0001229873,0.00008650315,0.00006595892],"category_scores_gemma":[0.00006543062,0.0001214138,0.0000486967,0.0002202453,0.0001629305,0.0002437678,0.00001751012,0.0001481608,6.941158e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006762221,"about_ca_system_score_gemma":0.00004777222,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008747373,"about_ca_topic_score_gemma":0.000003569994,"domain_scores_codex":[0.9986262,0.0002117502,0.0006543624,0.0001643383,0.0002067355,0.0001365833],"domain_scores_gemma":[0.9985015,0.0004623597,0.0002552884,0.0002676955,0.0003921664,0.000120931],"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.0002785886,0.00009350287,0.001829801,0.0001645421,0.00007520111,8.874446e-7,0.000244153,0.9938627,0.0005291365,0.001942628,0.000006966263,0.0009718255],"study_design_scores_gemma":[0.001139206,0.000201955,0.0003242208,0.00009051859,0.0001408999,0.0001488432,0.00152411,0.9940969,0.0002635214,0.001492885,0.000348307,0.0002285689],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.142615,0.001272807,0.854681,0.00004993877,0.00003721522,0.0005479043,0.00003680114,0.00003785482,0.0007215622],"genre_scores_gemma":[0.9949093,0.0003389637,0.004552831,0.000007684296,0.00008005682,0.00005004939,0.000006622549,0.00001903143,0.00003544369],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8522944,"threshold_uncertainty_score":0.495111,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964713924","doi":"10.1007/s10957-010-9668-3","title":"Parametric Integer Programming Algorithm for Bilevel Mixed Integer Programs","year":2010,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Integer (computer science); Mathematics; Integer programming; Infimum and supremum; Polynomial; Parametric statistics; Bilevel optimization; Mathematical optimization; Theory of computation; Logarithm; Discrete mathematics; Algorithm; Optimization problem; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.04092759352393528,"gpt":0.3582411616101763,"spread":0.317313568086241,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004958418,0.0001510778,0.0002867583,0.0005956998,0.0002971168,0.0004173805,0.0004258059,0.000142695,0.0000876962],"category_scores_gemma":[0.001572529,0.000106101,0.0001602366,0.001403307,0.0001748396,0.0005615463,0.00004172627,0.0002822468,0.000007561249],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001348437,"about_ca_system_score_gemma":0.0001029149,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.89919e-7,"about_ca_topic_score_gemma":0.0000012692,"domain_scores_codex":[0.9979406,0.0001526475,0.0009895713,0.0002659454,0.0004620684,0.0001891518],"domain_scores_gemma":[0.9955311,0.001372182,0.001009815,0.0003094777,0.001596175,0.0001812916],"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.00004250971,0.0001783567,0.000283151,0.000002219316,0.00002472355,4.15904e-7,0.0001298879,0.02220294,0.00002666744,0.04214276,0.000315884,0.9346505],"study_design_scores_gemma":[0.001876407,0.0004851025,0.0003229605,0.00003926326,0.0002141104,0.0002784279,0.002481695,0.5033526,0.000563491,0.2134965,0.2763511,0.0005383576],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001141893,0.0001336265,0.9969277,0.0002790574,0.0003359942,0.0007782023,0.00001076064,0.00002526239,0.0003674874],"genre_scores_gemma":[0.144768,0.0002692009,0.853192,0.0001184035,0.0005128199,0.00028323,0.00003793001,0.00002955841,0.0007889172],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9341121,"threshold_uncertainty_score":0.4326675,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074089254","doi":"10.1023/b:jota.0000026133.56615.cf","title":"Zero-Sum Stochastic Games with Partial Information","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":65,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Zero-sum game; Zero (linguistics); Theory of computation; Example of a game without a value; Mathematical economics; Space (punctuation); State (computer science); State space; Complete information; Mathematical optimization; Game theory; Repeated game; Combinatorial game theory; Computer science; Statistics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.02090452493649449,"gpt":0.3071967091041004,"spread":0.2862921841676059,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002146099,0.0001141983,0.0001973675,0.0002583968,0.0003019989,0.0002292927,0.0003356407,0.00005507907,0.0001315417],"category_scores_gemma":[0.0004389373,0.0000771636,0.00005873074,0.0006626112,0.0002149913,0.001164941,0.00003268041,0.0001485983,0.00005460676],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002467709,"about_ca_system_score_gemma":0.0001179531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.431846e-7,"about_ca_topic_score_gemma":3.235272e-7,"domain_scores_codex":[0.9984233,0.0001272952,0.0007196511,0.0001351388,0.000469367,0.0001251874],"domain_scores_gemma":[0.9975559,0.0005935343,0.0007828707,0.000291368,0.000632886,0.0001434036],"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.00009589277,0.00004893554,0.00001868324,0.000001693871,0.00001205532,2.094424e-7,0.0003185719,0.5744827,0.00003026644,0.4185434,0.00004885148,0.006398791],"study_design_scores_gemma":[0.001627395,0.0002389275,0.0003039943,0.00004767213,0.0001028529,0.0002645916,0.002274515,0.003342116,0.0006510087,0.9746274,0.01628046,0.0002390831],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01032741,0.00006609105,0.9872659,0.0009206442,0.00003414897,0.0002702309,0.0000110015,0.00001973624,0.001084874],"genre_scores_gemma":[0.9782108,0.00002888643,0.02114062,0.0002974242,0.0001048433,0.00006016708,0.000008495413,0.000008011343,0.0001407289],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9678834,"threshold_uncertainty_score":0.3146641,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1973799058","doi":"10.1007/s10957-007-9263-4","title":"New Branch-and-Cut Algorithm for Bilevel Linear Programming","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":62,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Transpose; Branch and bound; Mathematics; Branch and cut; Bilevel optimization; Linear programming; Algorithm; Integer programming; Theory of computation; Mathematical optimization; Branching (polymer chemistry); Set (abstract data type); Optimization problem; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01117445259928318,"gpt":0.2768035725164913,"spread":0.2656291199172081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001118751,0.00007884268,0.0001287935,0.0001846067,0.0002025138,0.0001023496,0.0001780157,0.00004747673,0.00001623261],"category_scores_gemma":[0.00006310004,0.00006758897,0.00005936337,0.0004041691,0.00002650586,0.0004021467,0.00003281543,0.00006580708,8.87428e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001336576,"about_ca_system_score_gemma":0.00006716167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.343389e-7,"about_ca_topic_score_gemma":4.080606e-7,"domain_scores_codex":[0.9992313,0.00003230238,0.0003671394,0.0001358668,0.0001283118,0.0001050121],"domain_scores_gemma":[0.9987677,0.0003228558,0.0003108328,0.0001097341,0.0003483592,0.000140539],"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.00001177316,0.00004369403,0.00002249573,0.000005261488,0.00003978578,2.235061e-7,0.0001541752,0.0463891,0.00001916424,0.3246758,0.00005576589,0.6285828],"study_design_scores_gemma":[0.00117215,0.0001228268,0.0002416863,0.0000202312,0.0001126132,0.00009078818,0.0001077051,0.9009352,0.000534338,0.07092709,0.02550657,0.0002288325],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001280645,0.0001929533,0.9986866,0.0007306581,0.00004127081,0.0002011217,0.00000256202,0.00002247166,0.00010963],"genre_scores_gemma":[0.00370747,0.0001296727,0.9952095,0.0002524135,0.0002515443,0.00001122217,0.0000075415,0.000006835374,0.0004237791],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8545461,"threshold_uncertainty_score":0.2756198,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036651327","doi":"10.1007/s10957-012-0228-x","title":"Second-Order Optimality Conditions for Mathematical Programs with Equilibrium Constraints","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":61,"is_retracted":false,"has_abstract":false,"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":"Constraint (computer-aided design); Theory of computation; Mathematical optimization; Mathematics; Order (exchange); Mathematical economics; Independence (probability theory); Optimality criterion; Nonlinear system; Economics; Algorithm; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01473810147112159,"gpt":0.275257527337355,"spread":0.2605194258662334,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000951522,0.0001065311,0.000184421,0.0001182523,0.0001822619,0.0001329381,0.0002166876,0.00005159809,0.0002941604],"category_scores_gemma":[0.0000730429,0.00008164273,0.00006844688,0.0004254134,0.0001476174,0.0009025504,0.00003279767,0.00007988274,0.000003912106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001841768,"about_ca_system_score_gemma":0.00008428814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.71363e-8,"about_ca_topic_score_gemma":8.031049e-8,"domain_scores_codex":[0.9990545,0.0000939298,0.0003969773,0.0001263583,0.0001651074,0.0001631574],"domain_scores_gemma":[0.9982993,0.0003326657,0.0003860793,0.0001768285,0.0006315015,0.0001736198],"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.0000209582,0.000286607,0.0001290558,0.00002142287,0.00008772913,1.388862e-7,0.0001983829,0.06018556,0.00003302483,0.9372852,0.00006068743,0.001691253],"study_design_scores_gemma":[0.003750387,0.000533447,0.0008707325,0.0001057852,0.0006449408,0.000801807,0.0009849693,0.7326011,0.0007825374,0.2487276,0.009321503,0.0008751921],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000348876,0.00006172182,0.9969479,0.0006609176,0.00002822021,0.0003607701,0.00001379064,0.0000303304,0.001547411],"genre_scores_gemma":[0.2750767,0.00001385057,0.724032,0.0002715779,0.0001361445,0.0001296392,0.00004113685,0.00001053206,0.0002884233],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6885576,"threshold_uncertainty_score":0.3329294,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1997539213","doi":"10.1007/s10957-006-9029-4","title":"Optimization Techniques for State-Constrained Control and Obstacle Problems","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Hamilton–Jacobi–Bellman equation; Minimax; Mathematical optimization; Reachability; Duality (order theory); Bellman equation; Mathematics; State (computer science); Variational inequality; Obstacle; Dynamic programming; Optimal control; Class (philosophy); Computer science; Law; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.004767419257291239,"gpt":0.222882289590336,"spread":0.2181148703330448,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007588427,0.0001053151,0.0001768231,0.0002019745,0.0002354471,0.0001923861,0.0001673051,0.00005117183,0.00001411348],"category_scores_gemma":[0.00005804148,0.00009258979,0.00005636667,0.0003299809,0.00006631997,0.0006042453,0.0000219102,0.00005973098,2.709284e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001905176,"about_ca_system_score_gemma":0.00005513498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001688279,"about_ca_topic_score_gemma":5.410595e-7,"domain_scores_codex":[0.9990372,0.0000894472,0.0004719592,0.0001681393,0.0001287259,0.0001045509],"domain_scores_gemma":[0.9984661,0.0003065986,0.000473954,0.0001238992,0.0005624297,0.00006698782],"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.00001571863,0.00005605647,0.00004335476,0.000009602087,0.00002606343,1.163031e-7,0.00003967537,0.7349586,0.00007069846,0.2605249,0.00004437986,0.004210781],"study_design_scores_gemma":[0.0007997679,0.00007432971,0.00007849548,0.00001334716,0.00006949344,0.00003446565,0.00002516869,0.9345019,0.0002039759,0.06266241,0.001405202,0.000131471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003596464,0.0002360857,0.9978185,0.001106333,0.00001977015,0.0004294271,0.0000157023,0.00004743199,0.0002907591],"genre_scores_gemma":[0.1183431,0.0002037079,0.8806117,0.0003026639,0.0001154591,0.0001140386,0.00003076334,0.00001244705,0.0002661273],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1995432,"threshold_uncertainty_score":0.3775702,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2033978783","doi":"10.1023/b:jota.0000005040.78280.a6","title":"Agreeability and Time Consistency in Linear-State Differential Games","year":2003,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":55,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Consistency (knowledge bases); Theory of computation; Differential (mechanical device); State (computer science); Mathematics; Mathematical economics; Rationality; Time consistency; Applied mathematics; Mathematical optimization; Economics; Algorithm; Discrete mathematics; Actuarial science; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.0112732528071694,"gpt":0.2098095758464072,"spread":0.1985363230392378,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008324659,0.00006832819,0.0002199061,0.0000983849,0.00006641646,0.00003070418,0.000052542,0.00003879972,0.000258383],"category_scores_gemma":[0.00009564947,0.00006969335,0.00003667521,0.00007318038,0.00009588495,0.0001609841,0.00001330451,0.00008161557,0.000006502445],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001850694,"about_ca_system_score_gemma":0.00001535983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001653288,"about_ca_topic_score_gemma":5.738249e-7,"domain_scores_codex":[0.9992207,0.00004298536,0.0005161627,0.0001271414,0.00001145123,0.00008153244],"domain_scores_gemma":[0.9993423,0.0001264294,0.0003370513,0.0001032659,0.00003490851,0.00005601568],"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.0000274812,0.00006332551,0.002453015,0.000009349023,0.00001685107,2.654064e-7,0.0002169922,0.01410211,0.00001238687,0.9823132,0.000010566,0.0007744969],"study_design_scores_gemma":[0.0008474644,0.00005156028,0.001869673,0.00001195436,0.00001162481,0.00003093222,0.0001582325,0.01182688,0.00005587498,0.980468,0.004514467,0.0001533178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2519695,0.001823896,0.7366046,0.0002190275,0.00008367519,0.0002348497,0.00004276843,0.000007254107,0.009014443],"genre_scores_gemma":[0.9936451,0.0008549886,0.004730002,0.00005893653,0.00003131751,0.00001113962,0.00000297375,0.000008089496,0.0006573906],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7416756,"threshold_uncertainty_score":0.2842012,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2137362083","doi":"10.1007/s10957-007-9340-8","title":"Pricing and Advertising of Private and National Brands in a Dynamic Marketing Channel","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":52,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Junta de Castilla y León; Ministerio de Economía y Competitividad","keywords":"Goodwill; Brand equity; Advertising; Business; Brand management; National brand; Brand awareness; Purchasing; Private label; Brand extension; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.009195399602621276,"gpt":0.2332958263610669,"spread":0.2241004267584457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001205037,0.00007005312,0.0001365122,0.0003004238,0.0001564237,0.00003624723,0.00004663926,0.00003049624,0.00001550164],"category_scores_gemma":[0.0001827703,0.00006626049,0.00001906156,0.0002726473,0.00007348074,0.0004976342,0.0000444145,0.00008508096,1.211718e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009178773,"about_ca_system_score_gemma":0.0000155991,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003495089,"about_ca_topic_score_gemma":0.000001601532,"domain_scores_codex":[0.9993764,0.00003125766,0.0003212863,0.00009053183,0.0001095909,0.00007098335],"domain_scores_gemma":[0.9992325,0.0002660231,0.0003297846,0.00003992407,0.000119963,0.00001179135],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.002101252,0.0005964877,0.5335257,0.001637292,0.0001899584,0.00002650313,0.002381151,0.09117743,0.007851365,0.092439,0.00005754072,0.2680163],"study_design_scores_gemma":[0.003703335,0.00003127493,0.7416013,0.0006894987,0.0002282866,0.0004272516,0.0009297252,0.2267816,0.0001018176,0.02320694,0.001778147,0.0005208359],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8679183,0.0007469467,0.129533,0.0001542479,0.00002374462,0.0001784346,0.000001094328,0.000009289293,0.001435022],"genre_scores_gemma":[0.9970918,0.0007927836,0.001947753,0.00008122556,0.00005207633,0.000005571117,0.000002548018,0.000007709199,0.00001848507],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2674955,"threshold_uncertainty_score":0.2702024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2056214914","doi":"10.1007/s10957-008-9454-7","title":"Advertising Strategies in a Differential Game with Negative Competitor’s Interference","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Business Strategy and Innovation","field":"Business, Management and Accounting","cited_by":43,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Goodwill; Differential game; Nash equilibrium; Advertising; Stochastic game; Differential (mechanical device); Strategy; Stock (firearms); Mathematical economics; Economics; Microeconomics; Game theory; Mathematics; Business; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.01166342920138888,"gpt":0.2236923759240588,"spread":0.2120289467226699,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001553999,0.00008635879,0.0001302702,0.0002184846,0.0001270502,0.0001096414,0.00008668293,0.00003469926,0.00008699184],"category_scores_gemma":[0.00002440409,0.00006720761,0.00001689201,0.000466332,0.000119335,0.001510117,0.00001861098,0.0001246997,0.000002109851],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001198381,"about_ca_system_score_gemma":0.0000414243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009032373,"about_ca_topic_score_gemma":0.000005391983,"domain_scores_codex":[0.9994448,0.00001710894,0.0002809899,0.00008810451,0.0000913739,0.00007763012],"domain_scores_gemma":[0.9992171,0.00005116259,0.0003495121,0.0000607007,0.0003139536,0.000007553359],"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.0004435375,0.0001792371,0.004105631,0.00005770618,0.00002598061,0.000006741053,0.000267095,0.1489281,0.0004350852,0.843709,0.0000330928,0.001808856],"study_design_scores_gemma":[0.01529287,0.0005048938,0.3443722,0.002105022,0.0005016301,0.0008798571,0.02036965,0.2106628,0.001542044,0.3922097,0.00913021,0.002429095],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1833927,0.00003849859,0.8129537,0.0002035012,0.00004144658,0.0001303462,5.407525e-7,0.00001411163,0.003225145],"genre_scores_gemma":[0.997659,0.0000509311,0.001856964,0.0001156726,0.0002630905,0.00001188806,0.000007188459,0.000007571917,0.00002775276],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8142662,"threshold_uncertainty_score":0.2740647,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2082889410","doi":"10.1023/b:jota.0000025708.31430.22","title":"Reflection-Projection Method for Convex Feasibility Problems with an Obtuse Cone","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Guelph","funders":"","keywords":"Mathematics; Orthant; Projection (relational algebra); Intersection (aeronautics); Cone (formal languages); Convex cone; Regular polygon; Conic optimization; Convex set; Reflection (computer programming); Convex optimization; Euclidean space; Dual cone and polar cone; Theory of computation; Set (abstract data type); Combinatorics; Algorithm; Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.02683320622498632,"gpt":0.3268623808754776,"spread":0.3000291746504913,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001243869,0.000100567,0.0001731711,0.0001887214,0.0003166461,0.0001450383,0.0002000378,0.00005461855,0.00001437651],"category_scores_gemma":[0.0000619592,0.00007912706,0.00005725394,0.0005692032,0.00004080426,0.0009404139,0.00001693874,0.00008856432,6.98491e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006175531,"about_ca_system_score_gemma":0.0001509804,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003543079,"about_ca_topic_score_gemma":0.000003890134,"domain_scores_codex":[0.9989966,0.0001495952,0.0003755343,0.0002213981,0.0001626304,0.00009424558],"domain_scores_gemma":[0.9982296,0.0001699436,0.0004651271,0.0002117104,0.0008197873,0.0001038657],"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.00006711007,0.000150095,0.00002191587,0.000008489362,0.00003579494,9.846158e-8,0.0001579986,0.6170569,0.0000962688,0.3803857,0.00000426952,0.002015417],"study_design_scores_gemma":[0.003083918,0.0009192694,0.0002401988,0.00003066906,0.0001916239,0.0001898699,0.0002520561,0.7193059,0.001236552,0.2724516,0.001805943,0.000292377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001881648,0.00003910818,0.9980183,0.001070771,0.0000345192,0.0004551148,0.00000450742,0.00004103254,0.0001484445],"genre_scores_gemma":[0.03540239,0.00006283633,0.9639404,0.0002867928,0.00009641999,0.00008788935,0.00001902476,0.000009411841,0.0000948087],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.107934,"threshold_uncertainty_score":0.3226708,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1990402864","doi":"10.1007/s10957-013-0493-3","title":"Enhanced Karush–Kuhn–Tucker Conditions for Mathematical Programs with Equilibrium Constraints","year":2013,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":40,"is_retracted":false,"has_abstract":false,"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","keywords":"Theory of computation; Normality; Mathematics; Constraint (computer-aided design); Mathematical optimization; Karush–Kuhn–Tucker conditions; Applied mathematics; Stationary point; Function (biology); Mathematical economics; Mathematical analysis; Algorithm; Statistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.008820990722988718,"gpt":0.2486634758377036,"spread":0.2398424851147149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004003766,0.0001099364,0.0001874208,0.0001337553,0.0001774217,0.000239144,0.0002534059,0.00005062884,0.0003245739],"category_scores_gemma":[0.0000633646,0.00008208334,0.0000742694,0.0003845684,0.0001537766,0.0007666202,0.00002967843,0.00007545022,0.00001423834],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001695456,"about_ca_system_score_gemma":0.00008295095,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.259009e-7,"about_ca_topic_score_gemma":8.971391e-8,"domain_scores_codex":[0.9990411,0.00007017374,0.0004187471,0.0001637987,0.0001748562,0.0001313138],"domain_scores_gemma":[0.9981515,0.0003170745,0.000392949,0.000181156,0.0008228768,0.000134389],"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.000013574,0.0001898344,0.00001399714,0.00001629316,0.00008664484,1.886013e-7,0.0001674456,0.08910013,0.0002654822,0.9041033,0.0001078043,0.005935265],"study_design_scores_gemma":[0.001710202,0.0003170028,0.0001547195,0.00007261635,0.0001980805,0.0001316118,0.0004630758,0.6278,0.001135262,0.3669078,0.0007490989,0.000360444],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004606711,0.0000233056,0.9961281,0.001390602,0.00001970263,0.0005888338,0.00000536814,0.00003491568,0.001348545],"genre_scores_gemma":[0.4366439,0.00002277814,0.5619569,0.00035632,0.00009254558,0.000389935,0.00003851616,0.00001257346,0.00048649],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5386999,"threshold_uncertainty_score":0.3553857,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071414521","doi":"10.1023/b:jota.0000042599.46775.a9","title":"Robust H∞ Filtering for a Class of Nonlinear Discrete-Time Markovian Jump Systems","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":39,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Nonlinear system; Control theory (sociology); Filtering problem; Lipschitz continuity; Theory of computation; Filter (signal processing); Discrete time and continuous time; Applied mathematics; Jump; Bounded function; Norm (philosophy); Markov process; Mathematical analysis; Kalman filter; Computer science; Algorithm; Extended Kalman filter","retraction":null,"screen_n_in":null,"score":{"opus":0.00881651396054664,"gpt":0.211560146234998,"spread":0.2027436322744514,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005247766,0.00008612468,0.0002251367,0.00008209543,0.00006612756,0.0000324459,0.0001053848,0.00005682241,0.0000104417],"category_scores_gemma":[0.00004155088,0.00007648024,0.0000761371,0.0001155688,0.00004220784,0.0001495449,0.000007558308,0.00006693793,7.714522e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003789095,"about_ca_system_score_gemma":0.00002553522,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001165101,"about_ca_topic_score_gemma":3.362256e-7,"domain_scores_codex":[0.9992611,0.00003305468,0.0004579082,0.00007142861,0.00008552443,0.0000909541],"domain_scores_gemma":[0.9992705,0.0001903686,0.0001922731,0.0001213743,0.0001657261,0.00005975692],"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.00005770535,0.00002488556,0.000009502394,0.0001330182,0.00005313856,1.726767e-7,0.0001116584,0.9843071,0.001368187,0.01344988,0.00001631168,0.0004684583],"study_design_scores_gemma":[0.002183456,0.0001816389,0.0000425286,0.0002815881,0.0001560154,0.00006925387,0.0009518996,0.9851772,0.001045898,0.004446454,0.005213452,0.0002505999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003248399,0.0006321482,0.9950507,0.00007692946,0.00007584993,0.0003825772,0.00004007696,0.00002347578,0.0004698951],"genre_scores_gemma":[0.9614342,0.0001342525,0.03783061,0.0000173384,0.0003401423,0.0001066249,0.0000165958,0.00002848765,0.00009169996],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9581859,"threshold_uncertainty_score":0.3118774,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2035396114","doi":"10.1023/b:jota.0000042522.65261.51","title":"Conic Formulation for l p -Norm Optimization","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Duality gap; Conic section; Mathematics; Duality (order theory); Conic optimization; Norm (philosophy); Strong duality; Theory of computation; Weak duality; Optimization problem; Perturbation function; Mathematical optimization; Interior point method; Wolfe duality; Applied mathematics; Discrete mathematics; Algorithm; Convex optimization; Geometry; Convex analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.03102397558523285,"gpt":0.3627764058717622,"spread":0.3317524302865294,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001050247,0.0001351398,0.0002260048,0.0002409207,0.0003014677,0.0000681587,0.0001581712,0.00009750048,0.00008283459],"category_scores_gemma":[0.0007113233,0.000123726,0.00008715861,0.0003689509,0.00005978304,0.0005848391,0.00002674511,0.0001353521,0.000001347723],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001099929,"about_ca_system_score_gemma":0.0001289595,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":2.291078e-7,"about_ca_topic_score_gemma":3.286418e-7,"domain_scores_codex":[0.9987446,0.00006963222,0.000626564,0.0001583878,0.0002307275,0.0001700966],"domain_scores_gemma":[0.9974738,0.000680526,0.0006098713,0.0001828971,0.0009342975,0.0001186416],"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.00006995106,0.00007536451,0.000002991172,0.0000239325,0.00002099982,1.828977e-7,0.00008811164,0.5994488,0.00002410848,0.3987788,0.00002090926,0.001445865],"study_design_scores_gemma":[0.003006979,0.0002021729,0.000006588147,0.00005633118,0.0001123263,0.00008000666,0.0003740713,0.2587742,0.0008564258,0.7349812,0.001325026,0.0002246522],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001751501,0.0001500144,0.9979014,0.0004153133,0.00004644707,0.0008628987,0.00001336529,0.00003901915,0.0003963488],"genre_scores_gemma":[0.02789866,0.0004050739,0.97089,0.00009632124,0.0002114143,0.0001488864,0.00004063256,0.00004158965,0.0002674453],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3406746,"threshold_uncertainty_score":0.50454,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2074318081","doi":"10.1007/s10957-008-9413-3","title":"A Fast MPC Algorithm Using Nonfeasible Active Set Methods","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Control Systems Optimization","field":"Engineering","cited_by":38,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; Ontario Tech University","funders":"","keywords":"Model predictive control; Quadratic programming; Theory of computation; Active set method; Mathematical optimization; Set (abstract data type); Mathematics; Minification; Quadratic equation; Algorithm; Computer science; Control (management); Nonlinear programming; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.01808822104082608,"gpt":0.3021934967127353,"spread":0.2841052756719092,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003807461,0.0001159868,0.0002085132,0.0001569953,0.0001852357,0.0000209981,0.0000910137,0.00006706155,0.00002763194],"category_scores_gemma":[0.00003807294,0.0001123634,0.00005103884,0.0002996245,0.00005474603,0.0004391578,0.00001262776,0.0001364827,0.000001331092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006456381,"about_ca_system_score_gemma":0.00003340525,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.45741e-7,"about_ca_topic_score_gemma":6.051962e-8,"domain_scores_codex":[0.9991916,0.0001347715,0.0003691779,0.00009227356,0.00009976537,0.0001123421],"domain_scores_gemma":[0.9991736,0.0001613698,0.0002289732,0.0001216348,0.0002290369,0.00008542678],"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.00001455503,0.00001593204,0.00000741634,0.000008922464,0.00004954466,0.000001252647,0.0002833906,0.9673535,0.0009155372,0.002077065,0.00001297898,0.02925988],"study_design_scores_gemma":[0.0005162868,0.00002321275,0.00002375869,0.00002288045,0.0000609262,0.0004253223,0.0003877544,0.9933688,0.00126665,0.002306592,0.001453769,0.0001440437],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0003971751,0.0005223162,0.9981042,0.0000181917,0.00007599202,0.0002311506,0.0000121602,0.00005168936,0.0005871091],"genre_scores_gemma":[0.03501152,0.0006104899,0.9639484,0.00003231807,0.0002325917,0.00003260159,0.00001007518,0.00003517673,0.00008685956],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.03461434,"threshold_uncertainty_score":0.4582045,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2085259781","doi":"10.1007/s10957-006-9070-3","title":"Enumeration of All the Extreme Equilibria in Game Theory: Bimatrix and Polymatrix Games","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":37,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Enumeration; Theory of computation; Mathematics; Game theory; Mathematical economics; Combinatorics; Mathematical optimization; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04046932685072907,"gpt":0.332936384393702,"spread":0.2924670575429729,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006030945,0.0001270654,0.0002734972,0.0003186672,0.000142136,0.0001445392,0.0003910883,0.00007269277,0.0001315097],"category_scores_gemma":[0.0004864022,0.00008211005,0.00007862714,0.0007491354,0.0003458156,0.0004202113,0.00006318228,0.0001537418,0.000005097353],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001426125,"about_ca_system_score_gemma":0.00005398001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003783671,"about_ca_topic_score_gemma":0.000003053757,"domain_scores_codex":[0.9975644,0.0006803155,0.001044652,0.000207823,0.0003680796,0.0001347675],"domain_scores_gemma":[0.9956769,0.002668891,0.0009348777,0.0003517331,0.0003051988,0.00006235816],"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.0001338053,0.0001136349,0.0006602526,0.000005269894,0.00001522066,4.251944e-7,0.0004462455,0.03764369,0.003489029,0.9456608,0.0001414941,0.01169013],"study_design_scores_gemma":[0.0005737255,0.00005029682,0.003007117,0.00001983499,0.0000631667,0.00006885108,0.001155316,0.008652695,0.001127955,0.9796292,0.005532837,0.0001190441],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1643594,0.002218183,0.8290834,0.001868787,0.00004001088,0.0004716477,0.00002157588,0.00001320243,0.001923742],"genre_scores_gemma":[0.9953169,0.0002436155,0.003546871,0.0001128858,0.0001242614,0.00003608301,0.00000633009,0.00001078501,0.0006022815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8309575,"threshold_uncertainty_score":0.3348351,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108293203","doi":"10.1007/s10957-007-9297-7","title":"Measure-Valued Differentiation for Markov Chains","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Markov Chains and Monte Carlo Methods","field":"Mathematics","cited_by":35,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Deutsche Forschungsgemeinschaft; Natural Sciences and Engineering Research Council of Canada; Government of Canada","keywords":"Markov chain; Mathematics; Measure (data warehouse); Markov kernel; Estimator; Kernel (algebra); Applied mathematics; Generality; Markov model; Discrete mathematics; Combinatorics; Mathematical optimization; Variable-order Markov model; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.03489857493065025,"gpt":0.3465355127841554,"spread":0.3116369378535052,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00427645,0.00009472885,0.0001885232,0.0001366354,0.0001637309,0.00002947542,0.00009548909,0.00007335388,0.00001678444],"category_scores_gemma":[0.0006128293,0.00007838343,0.00009821677,0.0001370111,0.0000385165,0.0001044083,0.0000135397,0.00008904676,1.900185e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002871722,"about_ca_system_score_gemma":0.00002515954,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.236798e-7,"about_ca_topic_score_gemma":8.829205e-7,"domain_scores_codex":[0.9990471,0.0001259299,0.0004682988,0.00009859315,0.0001404662,0.0001195991],"domain_scores_gemma":[0.9978829,0.000997256,0.0004823787,0.0001347941,0.0004110576,0.00009162237],"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.0002688144,0.000143527,0.00004114245,0.00006043715,0.00006417853,3.522044e-7,0.0003006449,0.0006783868,0.0008971355,0.9655915,0.0002467556,0.03170709],"study_design_scores_gemma":[0.008425003,0.0007220632,0.0006180404,0.0003167078,0.001425388,0.0002520465,0.004481939,0.06185456,0.01339883,0.8868876,0.02047124,0.001146582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002677171,0.0001663959,0.9952717,0.0001220649,0.00008074902,0.000438683,0.000006705706,0.00001683537,0.001219727],"genre_scores_gemma":[0.2126675,0.0001176277,0.7851022,0.0001712758,0.0006118842,0.00006771187,0.00001408928,0.00003641294,0.001211324],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2101695,"threshold_uncertainty_score":0.3196383,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1504470592","doi":"10.1023/a:1004674330768","title":"Quasi-P*-Maps, P(τ, α, β)-Maps, Exceptional Family of Elements, and Complementarity Problems","year":2000,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Mathematics and Applications","field":"Mathematics","cited_by":34,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Mixed complementarity problem; Complementarity (molecular biology); Theory of computation; Complementarity theory; Nonlinear complementarity problem; Nonlinear system; Pure mathematics; Applied mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.03204118252148728,"gpt":0.3056292706500901,"spread":0.2735880881286028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00104047,0.0001214643,0.0002581977,0.00009123611,0.0001915626,0.00003543724,0.0001433413,0.00004870992,0.0006839759],"category_scores_gemma":[0.00003969196,0.0001061426,0.00005796899,0.0001751838,0.0001336766,0.0001438435,0.00002816484,0.0001142257,0.000002469712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000166537,"about_ca_system_score_gemma":0.00003636916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000198099,"about_ca_topic_score_gemma":0.000001212656,"domain_scores_codex":[0.9986479,0.00008907363,0.0008133905,0.0001304203,0.0002095766,0.0001096682],"domain_scores_gemma":[0.9985631,0.0003621689,0.0005816416,0.0001887817,0.00021323,0.00009113612],"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.00004245614,0.00107779,0.0002438871,0.0002015368,0.0001105004,2.210418e-7,0.0005044019,0.002352089,0.0004689207,0.9796225,0.003889037,0.0114867],"study_design_scores_gemma":[0.001162824,0.0001828808,0.0002310281,0.0001121173,0.0002089043,0.00005668456,0.0007559293,0.003537725,0.0001233854,0.940156,0.05325207,0.0002204438],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03113897,0.0004587873,0.9623113,0.0005331296,0.00001695322,0.0008734044,0.0001732951,0.00002353281,0.004470594],"genre_scores_gemma":[0.3716644,0.003174281,0.6227182,0.0002811859,0.0002683234,0.0002747818,0.0001586184,0.00005601619,0.001404208],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3405254,"threshold_uncertainty_score":0.7489057,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018020262","doi":"10.1007/s10957-005-4722-2","title":"Credibility of Incentive Equilibrium Strategies in Linear-State Differential Games","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Credibility; Incentive; Differential (mechanical device); Mathematical economics; Class (philosophy); State (computer science); Mathematics; Nonlinear system; Theory of computation; Mathematical optimization; Applied mathematics; Computer science; Economics; Microeconomics; Algorithm; Political science; Artificial intelligence; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.01477998174083027,"gpt":0.2403004037157513,"spread":0.225520421974921,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006186987,0.00006876003,0.0002469374,0.00012628,0.00002910727,0.00002735345,0.0001071705,0.0000395491,0.0001748614],"category_scores_gemma":[0.00003351958,0.00007047488,0.00005648395,0.00009558291,0.0001001477,0.0004108305,0.00002804177,0.00008961376,0.000002697543],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002911455,"about_ca_system_score_gemma":0.00002559891,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003907642,"about_ca_topic_score_gemma":0.000002312874,"domain_scores_codex":[0.9990442,0.00002807298,0.0007097214,0.0001161498,0.00001690108,0.00008498831],"domain_scores_gemma":[0.9990728,0.00009291483,0.0006182169,0.0001157777,0.00006071465,0.00003951696],"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.00007923604,0.0001071692,0.001039268,0.00001336949,0.00002067659,9.178582e-8,0.0005024141,0.3179239,0.00004817695,0.6792353,0.000008356312,0.0010221],"study_design_scores_gemma":[0.001265517,0.00009750856,0.003531906,0.00002922631,0.00001663866,0.000006497281,0.001034349,0.09623308,0.0006949978,0.8944148,0.002476261,0.0001991965],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3206942,0.000620803,0.6761517,0.0001606859,0.00004993151,0.0001187241,0.00004909538,0.000003863699,0.002150996],"genre_scores_gemma":[0.9942183,0.0004691052,0.00501124,0.00002276938,0.00009200702,0.000008148763,0.000004987283,0.000006814656,0.0001665642],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6735242,"threshold_uncertainty_score":0.2873882,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981779786","doi":"10.1007/s10957-009-9511-x","title":"Coordination of Advertising Strategies in a Fashion Licensing Contract","year":2009,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Merger and Competition Analysis","field":"Economics, Econometrics and Finance","cited_by":33,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Licensee; Business; Incentive; Product (mathematics); Renting; Advertising; Product line; Process (computing); Industrial organization; Computer science; Commerce; License; Microeconomics; Economics; Mathematics; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.01046858329820695,"gpt":0.2364976651587425,"spread":0.2260290818605355,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006126034,0.0000463177,0.0001841425,0.0002723068,0.00004368544,0.00003243045,0.00005094208,0.00003216791,0.0001061826],"category_scores_gemma":[0.00004471129,0.00004968394,0.00004801933,0.000277077,0.00002142788,0.0003098761,0.0000034074,0.00006238093,0.000001405833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001767263,"about_ca_system_score_gemma":0.00001333629,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001942637,"about_ca_topic_score_gemma":0.000001246615,"domain_scores_codex":[0.9992811,0.00003034406,0.0005413816,0.00007117935,0.00002499023,0.00005100929],"domain_scores_gemma":[0.9992265,0.00005873869,0.0005394203,0.00006400949,0.00008479139,0.00002659915],"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.00002025647,0.00008039991,0.001252844,0.000005430918,0.00001215034,2.770061e-7,0.000195523,0.09002038,0.0002168072,0.9045532,0.000006006762,0.003636776],"study_design_scores_gemma":[0.002497503,0.0002787642,0.0573086,0.0001611961,0.0000844451,0.00005043026,0.003683001,0.1754322,0.0006821906,0.7574906,0.001903321,0.0004276513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04737143,0.0006732178,0.9460741,0.0003755347,0.00001813272,0.00007124274,0.000003026235,0.000003974332,0.005409392],"genre_scores_gemma":[0.9963577,0.0003452012,0.003142021,0.00008386173,0.00002861636,0.000001649815,0.000003930756,0.000002784289,0.00003426013],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9489862,"threshold_uncertainty_score":0.2026052,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2283656494","doi":"10.1023/a:1004661928043","title":"H∞-Control for Linear Time-Delay Systems with Markovian Jumping Parameters","year":2000,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":31,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Jumping; Mathematics; Control theory (sociology); Theory of computation; Bounded function; Markov process; Norm (philosophy); Attenuation; Control (management); Applied mathematics; Computer science; Mathematical analysis; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.004192982776474372,"gpt":0.1941705820119981,"spread":0.1899775992355238,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000595965,0.00009838467,0.0002107782,0.0000639533,0.0001047224,0.00005103237,0.00008899963,0.00005255204,0.0000459296],"category_scores_gemma":[0.00001636339,0.00007835712,0.00005483703,0.000109609,0.00003917773,0.0001667214,0.00000149338,0.00007727358,0.000003570395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002579034,"about_ca_system_score_gemma":0.00001745527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.034976e-7,"about_ca_topic_score_gemma":1.691705e-7,"domain_scores_codex":[0.9993073,0.00006458374,0.000346731,0.00008406299,0.00008708247,0.0001102758],"domain_scores_gemma":[0.999217,0.0003575642,0.0001100336,0.0001180419,0.0001233954,0.0000740017],"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.0002111202,0.00001722419,0.0000202901,0.00004446126,0.0000936734,3.770101e-7,0.00006385238,0.9926653,0.00005777251,0.002164067,0.00005254678,0.004609344],"study_design_scores_gemma":[0.001458628,0.0001240358,0.00001517355,0.0000738485,0.000130523,0.00008192678,0.0001588715,0.9871663,0.0000299597,0.000619219,0.009992491,0.0001490357],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005012618,0.0005698634,0.9929464,0.00007607012,0.00003716465,0.0005577055,0.0000174978,0.00004192036,0.0007407116],"genre_scores_gemma":[0.9853387,0.0001114462,0.01364388,0.00007234878,0.0002594516,0.0002109831,0.000008071298,0.00003092832,0.0003241984],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9803261,"threshold_uncertainty_score":0.3195311,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W13220323","doi":"10.1023/a:1017543626630","title":"Some Predictor-Corrector Algorithms for Multivalued Variational Inequalities","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":29,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University","funders":"","keywords":"Mathematics; Variational inequality; Monotonic function; Theory of computation; Convergence (economics); Predictor–corrector method; Operator (biology); Class (philosophy); Algorithm; Applied mathematics; Mathematical optimization; Mathematical analysis; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.02040302328598153,"gpt":0.2790420760848995,"spread":0.258639052798918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001206136,0.0001058929,0.0001771782,0.0002313786,0.0002619036,0.000140233,0.0002988988,0.00005797648,0.00006091167],"category_scores_gemma":[0.0002530084,0.00009212554,0.00009838033,0.0003984742,0.00003819343,0.0009293824,0.00003825375,0.00007401124,0.000002074779],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003357227,"about_ca_system_score_gemma":0.0001013468,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001061485,"about_ca_topic_score_gemma":1.543463e-7,"domain_scores_codex":[0.9988307,0.0001657882,0.0004987888,0.0001668152,0.0002248422,0.0001130383],"domain_scores_gemma":[0.9978468,0.0007565204,0.0004723478,0.0001574908,0.000664593,0.0001022143],"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.00002700723,0.00008087837,0.00006491321,0.000004757222,0.00005198417,2.099736e-7,0.000171247,0.3202278,0.00001694669,0.6766463,0.0001123286,0.002595608],"study_design_scores_gemma":[0.0006899237,0.00005321645,0.0002178759,0.000008999216,0.00005176573,0.00003184336,0.00008941109,0.8105748,0.00003943041,0.1832992,0.004826315,0.0001171803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005814112,0.0002266573,0.9978911,0.001226345,0.0001403867,0.0002306346,0.00001857899,0.0000357559,0.0001724433],"genre_scores_gemma":[0.03873126,0.0007814919,0.9564806,0.0009533088,0.001313129,0.0001730643,0.00008486626,0.0000202989,0.001461965],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4933471,"threshold_uncertainty_score":0.375677,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2481787546","doi":"10.1007/s10957-016-0988-9","title":"Generalized Derivatives of Differential–Algebraic Equations","year":2016,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Numerical methods for differential equations","field":"Mathematics","cited_by":28,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Novartis-MIT Center for Continuous Manufacturing","keywords":"Mathematics; Differential algebraic geometry; Differential algebraic equation; Parametric statistics; Lipschitz continuity; Differential equation; Applied mathematics; Algebraic number; Algebraic differential equation; Mathematical analysis; Ordinary differential equation","retraction":null,"screen_n_in":null,"score":{"opus":0.03979303655429359,"gpt":0.337834703030837,"spread":0.2980416664765433,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006078049,0.0001110194,0.0002859429,0.0001780284,0.0001198352,0.00001752542,0.0001614564,0.00005737179,0.0004503303],"category_scores_gemma":[0.001458878,0.00007138342,0.0001104369,0.000268473,0.0001807741,0.0002098647,0.00003492035,0.00006891099,0.000001623648],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002040745,"about_ca_system_score_gemma":0.00004209927,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.347725e-7,"about_ca_topic_score_gemma":2.101561e-7,"domain_scores_codex":[0.9985391,0.0003797649,0.0006838252,0.000109949,0.0001847567,0.0001025463],"domain_scores_gemma":[0.9958458,0.002670062,0.0008294674,0.0001952255,0.0003697599,0.00008966869],"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.00004979914,0.0001830055,0.00004488408,0.00002144977,0.00008531554,1.045682e-7,0.0001485799,0.0004254887,0.01859846,0.9557289,0.00001840617,0.02469564],"study_design_scores_gemma":[0.0007238783,0.00006677167,0.0001409486,0.00005805083,0.0001579652,0.000007135855,0.00009104032,0.0004752988,0.007845779,0.9901397,0.0001922262,0.000101234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01737269,0.00007853138,0.9816606,0.0004309259,0.00004906795,0.0002315914,0.00001669867,0.00001784058,0.0001420402],"genre_scores_gemma":[0.5424283,0.000211753,0.456819,0.00002873277,0.0001224951,0.00005093715,0.000003845713,0.00002335959,0.0003115467],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5250556,"threshold_uncertainty_score":0.4930801,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2084284149","doi":"10.1023/b:jota.0000043989.95285.51","title":"Dynamic Model of R&D, Spillovers, and Efficiency of Bertrand and Cournot Equilibria","year":2004,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Merger and Competition Analysis","field":"Economics, Econometrics and Finance","cited_by":25,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Cournot competition; Bertrand competition; Duopoly; Economics; Differential game; Mathematical economics; Stackelberg competition; Bertrand paradox (economics); Productivity; Competition (biology); Theory of computation; Investment (military); Mathematics; Mathematical optimization; Oligopoly","retraction":null,"screen_n_in":null,"score":{"opus":0.01286507358390533,"gpt":0.2254042925420402,"spread":0.2125392189581349,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004351715,0.00005607599,0.0002227619,0.0001686463,0.00005152844,0.00001421087,0.00005526938,0.00003318093,0.00007062905],"category_scores_gemma":[0.00002909185,0.00005609107,0.00004581273,0.0001489685,0.0001036755,0.0001209942,0.00001439867,0.00004736976,5.991025e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009169039,"about_ca_system_score_gemma":0.00001606147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002322185,"about_ca_topic_score_gemma":8.96858e-7,"domain_scores_codex":[0.9993419,0.00001133449,0.0004759226,0.00009105548,0.00002973308,0.00005007797],"domain_scores_gemma":[0.9992576,0.00004433792,0.0004922597,0.00008698722,0.00006937464,0.00004941087],"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.00003326309,0.00008749594,0.0005173665,0.00003038101,0.00004206481,5.543238e-8,0.0002487224,0.3357472,0.0005709685,0.6624542,0.000003341777,0.0002650329],"study_design_scores_gemma":[0.002261672,0.0001385858,0.001022318,0.00006424774,0.000142649,0.00003519748,0.0003375363,0.3690833,0.0003264001,0.6258662,0.0004850612,0.0002367658],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.158883,0.001703215,0.83808,0.0001789508,0.000009953923,0.00006037739,0.00003505058,0.000001914385,0.001047612],"genre_scores_gemma":[0.9829592,0.002798491,0.01409807,0.00003251539,0.000007646777,0.000002378063,0.000004548825,0.000004987973,0.00009213399],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8240763,"threshold_uncertainty_score":0.2287328,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2018846914","doi":"10.1007/s10957-008-9440-0","title":"EP Theorem for Dual Linear Complementarity Problems","year":2008,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":24,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Complementarity (molecular biology); Dual (grammatical number); Linear complementarity problem; Mathematics; Matrix (chemical analysis); Complementarity theory; Time complexity; Property (philosophy); Pure mathematics; Discrete mathematics; Combinatorics; Algebra over a field; Nonlinear system; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.03453408348496048,"gpt":0.3151265720819593,"spread":0.2805924885969988,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009517759,0.00006022558,0.0001095996,0.00007702257,0.0008454591,0.00002348703,0.00008052327,0.00004856829,0.0000967901],"category_scores_gemma":[0.00008679095,0.00005589977,0.0000488053,0.0001775918,0.0001942548,0.0002331159,0.00000371235,0.00007134587,9.837557e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001932873,"about_ca_system_score_gemma":0.00008633759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007342506,"about_ca_topic_score_gemma":0.000008764074,"domain_scores_codex":[0.9992278,0.0001213721,0.0003154063,0.0000841463,0.0001502458,0.0001010433],"domain_scores_gemma":[0.9988921,0.0003051812,0.0002931647,0.00005697376,0.0003698631,0.00008267847],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007542835,0.0001001065,0.001293909,0.00001159574,0.00002711563,5.226715e-7,0.005690713,0.4671803,0.00001581548,0.5243713,0.0004140817,0.0008190777],"study_design_scores_gemma":[0.007369628,0.0007391653,0.00537201,0.0001733499,0.0005821268,0.000174464,0.02259263,0.05868508,0.0004720113,0.2397501,0.6629537,0.001135656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002713637,0.0001166521,0.9944581,0.0006364095,0.00005314322,0.0003810896,0.00002370202,0.00002439126,0.001592868],"genre_scores_gemma":[0.8097323,0.001415109,0.1862656,0.0003736577,0.0006499971,0.00010236,0.0001588444,0.00002094621,0.001281164],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8081925,"threshold_uncertainty_score":0.6502673,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W252470463","doi":"10.1023/a:1022170404978","title":"Guaranteed Cost Control of a Markov Jump Linear Uncertain System Using a Time-Multiplied Cost Function","year":2003,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Mathematics; Quadratic growth; Control theory (sociology); Theory of computation; Linear system; Constant (computer programming); Jump; Norm (philosophy); Bounded function; Jump process; Mathematical optimization; Average cost; Cost control; Function (biology); Control (management); Computer science; Statistics; Algorithm; Mathematical analysis; Law; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.008841609008711667,"gpt":0.2217040934708908,"spread":0.2128624844621791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001188377,0.0001344555,0.0003432749,0.0001384259,0.0001159244,0.0000261849,0.00009031937,0.00009275191,0.00004154634],"category_scores_gemma":[0.00008930951,0.0001220499,0.0000937828,0.0002566092,0.00006229353,0.0001382842,0.000004331665,0.0001235565,0.000002706752],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000904567,"about_ca_system_score_gemma":0.00004995625,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000015194,"about_ca_topic_score_gemma":2.957026e-7,"domain_scores_codex":[0.9987317,0.0002253198,0.0006599464,0.0001047451,0.0001494531,0.0001288045],"domain_scores_gemma":[0.9987311,0.0003823163,0.0003470628,0.0001657849,0.0002943947,0.00007935761],"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.000265982,0.00004515835,0.0001329584,0.0001119851,0.000129085,5.639588e-7,0.00009127845,0.9760617,0.004849743,0.01713123,0.00001357135,0.001166761],"study_design_scores_gemma":[0.00243505,0.0000619452,0.00003745537,0.0001346483,0.0002393621,0.00009302972,0.0008956196,0.9928557,0.0004626686,0.0004009143,0.002223756,0.0001599033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004045322,0.000695568,0.9934016,0.00001187699,0.000102781,0.0007415189,0.00002705929,0.0000400529,0.0009342146],"genre_scores_gemma":[0.9948205,0.00003097265,0.004898021,0.00002739106,0.0001044593,0.00006296509,0.000004856944,0.00002085279,0.00003001801],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9907752,"threshold_uncertainty_score":0.4977049,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W81936770","doi":"10.1023/a:1021246912554","title":"Optimal Transient Response Shaping of the Servomechanism Problem","year":2002,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Control Systems in Engineering","field":"Engineering","cited_by":23,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Servomechanism; Theory of computation; Mathematics; Transient response; Control theory (sociology); Diagonal; Transient (computer programming); Controller (irrigation); Linear system; LTI system theory; Optimal control; Mathematical optimization; Computer science; Algorithm; Control (management); Mathematical analysis; Engineering; Control engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.008088129491491423,"gpt":0.1904980384190099,"spread":0.1824099089275185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006069473,0.00007052358,0.0001216715,0.00007784953,0.00005968985,0.00001496928,0.0001291645,0.00003875437,0.0000396238],"category_scores_gemma":[0.00002654184,0.00005511135,0.00005582533,0.0001904861,0.0000240625,0.0001030976,0.00001038429,0.0001083461,6.308659e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000240285,"about_ca_system_score_gemma":0.000005703166,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.80105e-8,"about_ca_topic_score_gemma":5.687523e-8,"domain_scores_codex":[0.9993674,0.00006968371,0.0003388062,0.00004826223,0.0001017735,0.00007406633],"domain_scores_gemma":[0.9995093,0.0001377218,0.0001172649,0.0001222146,0.00007666065,0.00003685026],"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.00001920115,0.000014045,0.000002774686,0.00003348613,0.00002733727,2.076729e-7,0.0004186826,0.9819281,0.009101567,0.0072078,0.0000296919,0.001217076],"study_design_scores_gemma":[0.000554242,0.00004038239,0.00008315586,0.0001285102,0.00006269073,0.0001134768,0.0002400218,0.9901593,0.003515538,0.0008097648,0.004168162,0.0001247832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01520274,0.0009754931,0.9829609,0.000122236,0.00006628122,0.0002133404,0.000003846176,0.00002664103,0.0004284959],"genre_scores_gemma":[0.9852639,0.0001385932,0.01441885,0.00001266214,0.00005784125,0.00002312755,2.407473e-7,0.00001617189,0.00006863588],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9700611,"threshold_uncertainty_score":0.2247376,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3036623140","doi":"10.1007/s10957-023-02297-y","title":"Unified Analysis of Stochastic Gradient Methods for Composite Convex and Smooth Optimization","year":2023,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stochastic Gradient Optimization Techniques","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Global Collaborative Research, King Abdullah University of Science and Technology; Institut de Valorisation des Données; King Abdullah University of Science and Technology","keywords":"Mathematics; Convexity; Stochastic gradient descent; Convex function; Theory of computation; Convergence (economics); Mathematical optimization; Convex optimization; Applied mathematics; Variance (accounting); Regular polygon; Algorithm; Computer science; Artificial intelligence; Artificial neural network","retraction":null,"screen_n_in":null,"score":{"opus":0.01997888666737985,"gpt":0.3296915564201645,"spread":0.3097126697527846,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001651971,0.0001257511,0.0003623411,0.001050771,0.0001798808,0.00007560514,0.0002927536,0.00006616234,0.000008030246],"category_scores_gemma":[0.0002200752,0.0001169905,0.0001029334,0.002221515,0.0001240968,0.0002982793,0.00007895998,0.00007194743,1.570127e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002118543,"about_ca_system_score_gemma":0.00003955265,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":6.418002e-7,"about_ca_topic_score_gemma":8.722086e-8,"domain_scores_codex":[0.9987174,0.0001880223,0.0006024913,0.0002188544,0.0001421997,0.0001309816],"domain_scores_gemma":[0.9971714,0.001189097,0.0007067976,0.0002515015,0.0005754941,0.0001056926],"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.00002278202,0.0000334548,0.00001420335,0.00001298087,0.0001519054,9.528527e-8,0.0002511229,0.721257,0.0001326533,0.273998,0.00001295629,0.004112837],"study_design_scores_gemma":[0.0003562534,0.0001005856,0.0001392292,0.00001804189,0.0004541283,0.000007966722,0.00009103995,0.9735177,0.000269915,0.02489204,0.00004550619,0.000107551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001828173,0.0001695917,0.9987539,0.0002288826,0.00005432805,0.0004778955,0.00001386893,0.00007790751,0.00004081464],"genre_scores_gemma":[0.04205905,0.0001877958,0.9574853,0.00006694868,0.00002238402,0.00008816701,0.00004231723,0.00001293836,0.00003507991],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2522607,"threshold_uncertainty_score":0.4770735,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3007500615","doi":"10.1007/s10957-020-01633-w","title":"Connectedness of Solution Sets for Weak Generalized Symmetric Ky Fan Inequality Problems via Addition-Invariant Sets","year":2020,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":false,"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":"Social connectedness; Mathematics; Invariant (physics); Solution set; Inequality; Equivalence (formal languages); Pure mathematics; Combinatorics; Mathematical analysis; Set (abstract data type)","retraction":null,"screen_n_in":null,"score":{"opus":0.02784079282427759,"gpt":0.2731701944249676,"spread":0.24532940160069,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009898413,0.0001243091,0.0002898786,0.0002421755,0.00022456,0.00008111228,0.0003210912,0.00007581693,0.00007436499],"category_scores_gemma":[0.0003180806,0.0001111877,0.0001270848,0.00123787,0.00004842622,0.0005535798,0.00005378476,0.0000891633,0.000001605884],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002728155,"about_ca_system_score_gemma":0.0001078585,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002480009,"about_ca_topic_score_gemma":4.955065e-7,"domain_scores_codex":[0.9984,0.0002655553,0.0007593828,0.0002183553,0.0002398455,0.0001168833],"domain_scores_gemma":[0.9972677,0.000446152,0.0009701232,0.0001746134,0.0009892938,0.0001521703],"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.00005033431,0.0001380068,0.00003184507,0.00005267758,0.00009735617,1.506958e-7,0.0003458908,0.4945747,0.0004662015,0.5009342,0.0001832592,0.003125301],"study_design_scores_gemma":[0.0009924733,0.0001182601,0.0001170136,0.00001799762,0.0001128603,0.00001367077,0.00006352089,0.9603473,0.0006294287,0.03660696,0.0008353032,0.0001451856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0002303951,0.0001253877,0.9957877,0.003165613,0.00004657496,0.0004031424,0.00006903178,0.00003105863,0.0001410866],"genre_scores_gemma":[0.6188967,0.0002689453,0.379402,0.0008602972,0.0001628927,0.0001195628,0.0002349456,0.00001687315,0.0000377731],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6186663,"threshold_uncertainty_score":0.4534101,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008340888","doi":"10.1007/s10957-009-9550-3","title":"Guaranteed Cost Control for Uncertain Neutral Stochastic Systems via Dynamic Output Feedback Controllers","year":2009,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stability and Control of Uncertain Systems","field":"Engineering","cited_by":20,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Theory of computation; Control theory (sociology); Bounded function; Linear matrix inequality; Bellman equation; Upper and lower bounds; Norm (philosophy); Mathematical optimization; Stochastic control; Output feedback; Control (management); Optimal control; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.007015884263474808,"gpt":0.2297611491718002,"spread":0.2227452649083254,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000816436,0.0001670039,0.0004063805,0.0001227188,0.0001516042,0.0000852701,0.0001555982,0.00009520609,0.000005415277],"category_scores_gemma":[0.00006187618,0.0001476279,0.000127737,0.0001392172,0.00005597418,0.0001644195,0.000002618725,0.0001318542,0.000001517566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008301911,"about_ca_system_score_gemma":0.0000325318,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":9.137848e-7,"about_ca_topic_score_gemma":6.604162e-7,"domain_scores_codex":[0.9988345,0.00009903817,0.0006327427,0.0001248901,0.000112099,0.0001967583],"domain_scores_gemma":[0.9986371,0.0005819054,0.0002591929,0.00015321,0.0002541555,0.0001143842],"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.0003871321,0.00004183005,0.000003853183,0.00003489152,0.00009758501,4.219075e-7,0.0001006278,0.9766734,0.0003733616,0.01805719,0.00005655348,0.004173111],"study_design_scores_gemma":[0.003702827,0.0001541141,0.00004744418,0.00004963075,0.0001507005,0.00006001059,0.0004450154,0.9890214,0.000007376346,0.005343403,0.0008547633,0.0001633518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001037047,0.001684336,0.9950876,0.0002630487,0.0001929838,0.001459891,0.00004681856,0.00005591298,0.0001723501],"genre_scores_gemma":[0.9983931,0.00004222356,0.0009453122,0.0001405989,0.0002003856,0.0001831721,0.00001042765,0.00001851394,0.00006624564],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9973561,"threshold_uncertainty_score":0.6020091,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2052424630","doi":"10.1007/s10957-011-9886-3","title":"Optimal Keyword Bids in Search-Based Advertising with Stochastic Advertisement Positions","year":2011,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Selection (genetic algorithm); Advertising; Budget constraint; Probabilistic logic; Construct (python library); Constraint (computer-aided design); Process (computing); Search advertising; Keyword search; Operations research; Online advertising; Microeconomics; Economics; Business; Information retrieval; Mathematics; The Internet; World Wide Web; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0149214922640769,"gpt":0.2335077405867891,"spread":0.2185862483227122,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005362782,0.00009868506,0.0001292028,0.0003778319,0.0001685936,0.0000723308,0.0001107395,0.00003103541,0.0002784445],"category_scores_gemma":[0.00002000134,0.00008395762,0.0000349945,0.0004501666,0.00007599971,0.0005494172,0.00002945504,0.000132281,0.000003391658],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002035121,"about_ca_system_score_gemma":0.00003943903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001906775,"about_ca_topic_score_gemma":0.000006552913,"domain_scores_codex":[0.9992911,0.00003044758,0.000300665,0.0001138412,0.0001366333,0.0001272691],"domain_scores_gemma":[0.9994031,0.00007279683,0.0002016283,0.0001058899,0.0001934846,0.00002313236],"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.0008239095,0.0005114748,0.0132595,0.00007527632,0.00004466471,0.00001412553,0.0003545105,0.924006,0.0002064433,0.03926335,0.00002446113,0.02141623],"study_design_scores_gemma":[0.01579996,0.0006454695,0.2377246,0.00240648,0.002652415,0.0003058511,0.007600569,0.7077352,0.001000949,0.01790336,0.003596651,0.002628397],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08084334,0.0001004618,0.9167018,0.0001353308,0.00002504973,0.0002468821,0.000001446011,0.00001847297,0.001927208],"genre_scores_gemma":[0.9865981,0.00001188615,0.01301583,0.0002089463,0.00008461624,0.00002829067,0.000008451676,0.00001468246,0.00002919386],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9057547,"threshold_uncertainty_score":0.3423693,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979042447","doi":"10.1007/s10957-009-9536-1","title":"Social Relationship and Transactional Marketing Policies—Maximizing Customer Lifetime Value","year":2009,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Customer Service Quality and Loyalty","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Athabasca University","funders":"","keywords":"Customer lifetime value; Value (mathematics); Marketing; Mathematics; Relationship marketing; Theory of computation; Transactional leadership; Customer value; Social marketing; Business; Microeconomics; Loyalty business model; Economics; Marketing management; Statistics; Management; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01728210891174901,"gpt":0.2693270062542027,"spread":0.2520448973424537,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001621569,0.000103973,0.0001523945,0.0002370236,0.0005947287,0.0001874291,0.0000934323,0.0000719893,0.00009124816],"category_scores_gemma":[0.00009265905,0.00009960771,0.00005815195,0.0003832606,0.00006379857,0.0008613826,0.0000147615,0.0001856691,0.000007141876],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001534029,"about_ca_system_score_gemma":0.00001775602,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004246834,"about_ca_topic_score_gemma":6.105014e-7,"domain_scores_codex":[0.9991546,0.00007383613,0.0003768003,0.0001150248,0.0001629727,0.0001167887],"domain_scores_gemma":[0.9990641,0.0002542229,0.0003999392,0.00006456809,0.0001931175,0.00002402921],"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.0002716997,0.0001414046,0.001622675,0.00008543203,0.00003795178,8.495311e-7,0.0004864167,0.02920857,0.00009985016,0.9533849,0.0004301424,0.01423005],"study_design_scores_gemma":[0.005176075,0.00008514388,0.3500859,0.0003111358,0.001323653,0.000277346,0.006812433,0.05706353,0.0000456885,0.4240856,0.15318,0.001553546],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1196053,0.0009145568,0.8173473,0.02578446,0.0001676608,0.000656281,0.000008672064,0.0001496871,0.03536606],"genre_scores_gemma":[0.9935285,0.00005270688,0.002713517,0.002428142,0.001109924,0.000006735769,0.000009426347,0.00001111097,0.0001399411],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8739232,"threshold_uncertainty_score":0.4574232,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072337808","doi":"10.1007/s10957-010-9758-2","title":"Equivalent Conditions for Jacobian Nonsingularity in Linear Symmetric Cone Programming","year":2010,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":17,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Jacobian matrix and determinant; Mathematics; Theory of computation; Cone (formal languages); Interior point method; Constraint (computer-aided design); Applied mathematics; Mathematical optimization; Algorithm; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.03391072149333239,"gpt":0.3880796826192206,"spread":0.3541689611258882,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001586535,0.0001064063,0.0002171176,0.0004414474,0.0002192062,0.00005238265,0.0001508443,0.00009864105,0.00008343015],"category_scores_gemma":[0.001713099,0.0001008819,0.00006693976,0.000655941,0.0001441405,0.0001999774,0.00003218465,0.0003475862,0.000001086522],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003391847,"about_ca_system_score_gemma":0.00009320689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":4.140783e-7,"about_ca_topic_score_gemma":0.000003280547,"domain_scores_codex":[0.9988444,0.00009524309,0.0005569943,0.0001451548,0.0001816556,0.0001765238],"domain_scores_gemma":[0.9973401,0.001287601,0.0004015821,0.0001801654,0.0006643106,0.0001262626],"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.00009613747,0.0006382718,0.0001440281,0.00009383792,0.00004406905,0.000002142835,0.0002476283,0.08604321,0.001003919,0.8969333,0.00006667784,0.0146868],"study_design_scores_gemma":[0.004005922,0.0002693926,0.0001837486,0.0001077237,0.0001661593,0.0002182403,0.0009736481,0.2923099,0.001406331,0.6885334,0.01136308,0.0004624132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003501994,0.0000525782,0.9948815,0.0003473706,0.00007674185,0.0008894611,0.00002319942,0.00001858761,0.0002085922],"genre_scores_gemma":[0.09343231,0.00009779831,0.9057547,0.00005271456,0.0001962618,0.0001924916,0.00002429175,0.00002978648,0.000219567],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2083998,"threshold_uncertainty_score":0.4113843,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1968081969","doi":"10.1007/s10957-006-9086-8","title":"Equilibrium Investment Strategies in Foreign Environmental Projects","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Climate Change Policy and Economics","field":"Economics, Econometrics and Finance","cited_by":16,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Theory of computation; Differential game; Joint (building); Time horizon; Kyoto Protocol; Operations research; Horizon; Investment (military); Mathematical economics; Computer science; Game theory; Mathematical optimization; Microeconomics; Business; Economics; Mathematics; Engineering; Climate change","retraction":null,"screen_n_in":null,"score":{"opus":0.02904846062245564,"gpt":0.2271271458555321,"spread":0.1980786852330765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004331645,0.00006710117,0.000151834,0.0001699328,0.00003771017,0.00005464079,0.00007154172,0.0000421566,0.000114924],"category_scores_gemma":[0.000008235676,0.00007322309,0.0000353085,0.00007986581,0.00005414819,0.0003318173,0.00001865257,0.0000633752,0.00001059742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000550522,"about_ca_system_score_gemma":0.00001153543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008523956,"about_ca_topic_score_gemma":0.000002395512,"domain_scores_codex":[0.9993017,0.00001415237,0.0004725264,0.00009993753,0.00001381936,0.00009788087],"domain_scores_gemma":[0.9994665,0.00004634368,0.0003698128,0.00007987647,0.000006301404,0.00003115241],"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.00001684091,0.00009001757,0.003484024,0.000008752437,0.000006880073,4.673004e-7,0.0001545264,0.06798596,0.00003318511,0.9281098,0.00004335492,0.00006619934],"study_design_scores_gemma":[0.0006649739,0.0000556045,0.003178392,0.00001062318,0.00000753185,0.00002701685,0.001461775,0.009331667,0.0001180445,0.9804355,0.00455757,0.0001512847],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4894075,0.004325493,0.3873716,0.0006669719,0.0001090208,0.0007752579,0.0002267742,0.00002197132,0.1170954],"genre_scores_gemma":[0.9955748,0.0004456482,0.003430795,0.0001792489,0.0001475325,0.00003386525,0.00002572275,0.00001037399,0.0001520105],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5061673,"threshold_uncertainty_score":0.2985951,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969251391","doi":"10.1007/s10957-007-9252-7","title":"An Algorithm for Portfolio Optimization with Variable Transaction Costs, Part 1: Theory","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Transaction cost; Mathematical optimization; Portfolio optimization; Portfolio; Optimization problem; Key (lock); Computer science; Function (biology); Variable (mathematics); Sequence (biology); Merton's portfolio problem; Heuristics; Reduction (mathematics); Mathematics; Economics; Replicating portfolio; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.009780566260296204,"gpt":0.2266601281063399,"spread":0.2168795618460437,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002068344,0.0001215072,0.0002321252,0.0002083926,0.000335959,0.00006996447,0.0001233466,0.00009792856,0.00009952354],"category_scores_gemma":[0.00004303811,0.0001189538,0.00004855824,0.0004126228,0.0000766885,0.0004581605,0.000005168714,0.000106062,0.000001725455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005234294,"about_ca_system_score_gemma":0.00004222219,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003207388,"about_ca_topic_score_gemma":8.383186e-7,"domain_scores_codex":[0.9989114,0.0000122162,0.0006568648,0.0002155163,0.00004167659,0.0001623093],"domain_scores_gemma":[0.9984393,0.0002274041,0.0007353163,0.0001742635,0.0003033834,0.0001203685],"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.0001116968,0.0001531475,0.00001214313,0.00001004759,0.00003538945,0.000001176387,0.00007848621,0.1360184,0.000004678096,0.8361053,0.00001075934,0.02745875],"study_design_scores_gemma":[0.001906811,0.0005864516,0.00005076457,0.00004059413,0.0001736733,0.0007391449,0.001175329,0.2280111,0.0001208333,0.7532535,0.01347712,0.0004646261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005866688,0.0005450666,0.9971636,0.00005392964,0.00006738917,0.0005032265,0.0001026085,0.00002349555,0.001482017],"genre_scores_gemma":[0.0452471,0.0002621381,0.9532437,0.0002259176,0.0005052141,0.0002141048,0.00009217919,0.00004423545,0.0001653645],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.09199268,"threshold_uncertainty_score":0.4850795,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W259673802","doi":"10.1023/a:1026465906067","title":"Duality of Nonscalarized Multiobjective Linear Programs: Dual Balance, Level Sets, and Dual Clusters of Optimal Vectors","year":2001,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Duality (order theory); Mathematics; Duality gap; Mathematical optimization; Minimax; Theory of computation; Dual (grammatical number); Linear programming; Parametric statistics; Weak duality; Set (abstract data type); Strong duality; Computation; Perturbation function; Pareto principle; Applied mathematics; Optimization problem; Combinatorics; Computer science; Algorithm; Convex analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.04886264297294288,"gpt":0.3625795594452303,"spread":0.3137169164722874,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001293542,0.0001556187,0.0004130197,0.00022819,0.0001378349,0.00002239942,0.0001110745,0.0001106202,0.00005893984],"category_scores_gemma":[0.0005909343,0.0001378234,0.00008203825,0.0005072524,0.0003889638,0.0003105314,0.00007374389,0.0002272402,3.82664e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003504249,"about_ca_system_score_gemma":0.0000976797,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001857238,"about_ca_topic_score_gemma":8.542245e-7,"domain_scores_codex":[0.998205,0.0002818863,0.0008283473,0.0001815721,0.0003360502,0.0001671619],"domain_scores_gemma":[0.9969985,0.0008259777,0.0009030051,0.0001987815,0.0009416462,0.0001320564],"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.003206622,0.002888666,0.003182337,0.000552871,0.0007501594,0.00001414262,0.005085135,0.8371874,0.001430328,0.1201815,0.0001275628,0.02539321],"study_design_scores_gemma":[0.01458873,0.001554412,0.002400916,0.00053653,0.0007692689,0.001111429,0.01209984,0.8844923,0.006897348,0.07326385,0.001182348,0.001103058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03699,0.0001244281,0.9618558,0.0001145217,0.00002461752,0.0006091773,0.00005748593,0.0000175377,0.0002064096],"genre_scores_gemma":[0.2282816,0.0007369496,0.7704788,0.00002255729,0.00008695335,0.00005508145,0.00003383832,0.00003506168,0.0002691188],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.191377,"threshold_uncertainty_score":0.5620276,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1979589904","doi":"10.1007/s10957-006-9140-6","title":"Generalized Motzkin Theorems of the Alternative and Vector Optimization Problems","year":2006,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Saskatchewan Polytechnic","funders":"","keywords":"Mathematics; Hausdorff space; Convexity; Saddle point; Lagrangian; Vector optimization; Applied mathematics; Mathematical optimization; Optimization problem; Pure mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.006239397431636806,"gpt":0.218451802306674,"spread":0.2122124048750372,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006545285,0.000101472,0.0001724005,0.0001445264,0.0002016181,0.00009603793,0.0003214876,0.00004644662,0.00003433579],"category_scores_gemma":[0.00005752726,0.00006970696,0.00007282921,0.0005762698,0.0001114868,0.0004142057,0.00007653796,0.00008079853,3.065468e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001831743,"about_ca_system_score_gemma":0.00004829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000662724,"about_ca_topic_score_gemma":8.494586e-7,"domain_scores_codex":[0.9988374,0.0002274867,0.0004859201,0.0001487819,0.0002195295,0.00008093055],"domain_scores_gemma":[0.9983672,0.0001822238,0.0007459662,0.0001964962,0.0004629634,0.00004518796],"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.00000574767,0.0000396329,0.00007654847,0.00000427872,0.00001921744,5.181483e-8,0.00008312381,0.5589072,0.00007118012,0.4404504,0.00001635781,0.0003262717],"study_design_scores_gemma":[0.0005386444,0.00003019707,0.0004839239,0.00002062785,0.00006349542,0.0000247549,0.00003566085,0.9121485,0.0006719313,0.08553589,0.0003465615,0.00009981822],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0007638886,0.0002701371,0.9970588,0.001093568,0.000050155,0.0002126129,0.000005755189,0.00001252872,0.0005325485],"genre_scores_gemma":[0.6491356,0.0006133911,0.3492552,0.0002651886,0.0002065963,0.00003712733,0.00001562747,0.00001615698,0.0004550985],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6483718,"threshold_uncertainty_score":0.2842567,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006609776","doi":"10.1007/s10957-005-2098-y","title":"Approximate Maximum Likelihood Estimation of Circle Parameters","year":2005,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Estimator; Upper and lower bounds; Applied mathematics; Cramér–Rao bound; Maximum likelihood sequence estimation; Theory of computation; Estimation theory; Nonlinear system; Maximum likelihood; Algorithm; Mathematical optimization; Mathematical analysis; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.005287962378319345,"gpt":0.2358070412351026,"spread":0.2305190788567832,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006618916,0.00006195332,0.0001187878,0.0001699689,0.00008961172,0.00005491219,0.0002215922,0.0000396089,0.000008482013],"category_scores_gemma":[0.00004205108,0.00005904411,0.00004931812,0.0002797427,0.00004714816,0.0006669331,0.00003193055,0.00008050932,0.000001446209],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001872302,"about_ca_system_score_gemma":0.00003121204,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.161969e-7,"about_ca_topic_score_gemma":7.254909e-8,"domain_scores_codex":[0.9992779,0.00007059729,0.0003587453,0.00009499086,0.0001192451,0.00007847444],"domain_scores_gemma":[0.9990819,0.00009812223,0.0004053849,0.0001815279,0.0001833417,0.00004974854],"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.00001838361,0.0001042673,0.00000509812,0.00001739992,0.00001786513,3.290039e-7,0.0002519136,0.1509764,0.0005388266,0.02956652,0.00005038697,0.8184527],"study_design_scores_gemma":[0.0007175675,0.0002584422,0.0001435363,0.00005891545,0.00006145043,0.0002084154,0.0001601627,0.4092155,0.2803411,0.3074733,0.001117229,0.0002444048],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001039853,0.0001471513,0.9978878,0.0002954372,0.00002241675,0.0001413735,8.785512e-7,0.00004213451,0.0004229461],"genre_scores_gemma":[0.4207622,0.0001297174,0.5789202,0.000118312,0.00003344487,0.00001631813,9.271611e-7,0.000004746923,0.00001402106],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8182082,"threshold_uncertainty_score":0.2407749,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2065752008","doi":"10.1007/s10957-012-0156-9","title":"Cooperating and Non-cooperating Firms in Inventive and Absorptive Research","year":2012,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","cited_by":15,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Duopoly; Joint venture; Absorptive capacity; Industrial organization; Investment (military); Business; Microeconomics; Production (economics); Unit (ring theory); Computer science; Economics; Mathematics; Commerce; Cournot competition","retraction":null,"screen_n_in":null,"score":{"opus":0.04022187909509641,"gpt":0.2934510619695515,"spread":0.2532291828744551,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002044552,0.00005784416,0.0001673087,0.0002588225,0.0001977571,0.00007701978,0.00004184989,0.00004223114,0.00004696825],"category_scores_gemma":[0.0001162358,0.00005357286,0.00001990606,0.0002841603,0.0001091224,0.0004086658,0.00003560002,0.0001519815,0.000003637904],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002194697,"about_ca_system_score_gemma":0.000008569952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001004557,"about_ca_topic_score_gemma":0.000002631448,"domain_scores_codex":[0.9993383,0.00005210053,0.0003658411,0.0001007666,0.0000281911,0.0001147724],"domain_scores_gemma":[0.9994074,0.0001749187,0.0002039267,0.00005585024,0.00008221645,0.00007566671],"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.00001936326,0.0000950934,0.02573745,0.00001476739,0.00004054519,3.876448e-7,0.003630381,0.005971779,0.00008235061,0.9633227,0.00003892451,0.001046256],"study_design_scores_gemma":[0.005468169,0.0006477545,0.09146269,0.000353385,0.0001677773,0.0001571092,0.03365097,0.3401841,0.001647337,0.5188189,0.006118247,0.001323634],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8703577,0.03158675,0.09322488,0.0004927553,0.00004651424,0.0003798529,0.00001656901,0.000005365096,0.003889618],"genre_scores_gemma":[0.9908527,0.005062338,0.003689689,0.00006230411,0.00009577125,0.00001918592,0.000003856656,0.000006639294,0.0002075787],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4445039,"threshold_uncertainty_score":0.2184638,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W77613094","doi":"10.1023/a:1004608800846","title":"Universal Near-Optimal Feedbacks","year":2000,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Guidance and Control Systems","field":"Engineering","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Concordia University; McGill University","funders":"","keywords":"Mathematics; Theory of computation; Construct (python library); Bounded function; Saddle; Optimal control; Set (abstract data type); Mathematical optimization; Differential inclusion; Saddle point; Type (biology); Applied mathematics; Mathematical analysis; Computer science; Algorithm; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.002529516883140039,"gpt":0.1835226070190804,"spread":0.1809930901359403,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001838663,0.00005676777,0.00009430348,0.00003183596,0.00008162985,0.00004059604,0.00007115833,0.00003539769,0.0003454232],"category_scores_gemma":[0.00000341446,0.00005193301,0.00003332333,0.0001038163,0.00003306046,0.0001706269,0.000002692334,0.00007355514,0.00001427663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001341807,"about_ca_system_score_gemma":0.00001280654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.21128e-7,"about_ca_topic_score_gemma":9.121219e-8,"domain_scores_codex":[0.9996141,0.00002648011,0.0001902334,0.00004273325,0.00005876031,0.00006769331],"domain_scores_gemma":[0.9997387,0.00003974696,0.00004784742,0.00007028358,0.0000506663,0.0000527651],"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.00002214974,0.00001117495,0.00001955315,0.000005445258,0.00002394892,6.996529e-7,0.0001126535,0.9733467,0.00009962033,0.007690275,0.0002142941,0.01845346],"study_design_scores_gemma":[0.002109176,0.0001348602,0.0005338959,0.00007320094,0.000169076,0.0002970177,0.0009925991,0.7555096,0.0003080709,0.004254993,0.2352072,0.0004103799],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03971765,0.0009656894,0.9451533,0.0000921439,0.00005166339,0.0001353616,0.000004280513,0.00005195328,0.01382799],"genre_scores_gemma":[0.9921825,0.0005721053,0.006157159,0.00005155341,0.0002100403,0.00001082877,0.000003240055,0.00001474029,0.0007978549],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9524648,"threshold_uncertainty_score":0.3782142,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W160223189","doi":"10.1023/a:1016087702231","title":"Estimation of Circle Parameters by Centroiding","year":2002,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Estimator; Theory of computation; Mathematics; Arc (geometry); Noise (video); RADIUS; Algorithm; Arc length; Set (abstract data type); Outlier; Applied mathematics; Mathematical optimization; Computer science; Statistics; Geometry; Artificial intelligence; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.006333910256015525,"gpt":0.2204735389759632,"spread":0.2141396287199477,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003577425,0.00004471873,0.00008827695,0.0001052904,0.00008729241,0.00004497345,0.0001608717,0.00002769253,0.00001477346],"category_scores_gemma":[0.00005029336,0.00004365664,0.00003464076,0.0002390938,0.0000356491,0.0004646671,0.00001814018,0.00006074095,9.55618e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001334483,"about_ca_system_score_gemma":0.000006071767,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.979022e-7,"about_ca_topic_score_gemma":1.014724e-8,"domain_scores_codex":[0.9994505,0.00006549316,0.0002612288,0.00007147871,0.00009497656,0.00005634165],"domain_scores_gemma":[0.9993048,0.0001158007,0.0003201299,0.0001211012,0.0001011938,0.00003695443],"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.00001329694,0.0001815436,0.0000150457,0.00002346541,0.00003130408,6.855535e-7,0.0005250134,0.1493945,0.003394865,0.05093565,0.001142383,0.7943422],"study_design_scores_gemma":[0.000565953,0.000221132,0.00004192143,0.00004735667,0.00004390208,0.0001312826,0.0001514065,0.6125908,0.3357636,0.04877673,0.001468489,0.0001974672],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001056532,0.0003182029,0.9979616,0.0001704477,0.00002143175,0.00008870089,9.165049e-7,0.00002619572,0.0003559565],"genre_scores_gemma":[0.8216856,0.0003565476,0.1777767,0.00009587299,0.00001603357,0.000009524191,7.886919e-7,0.000004100627,0.00005479163],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8206291,"threshold_uncertainty_score":0.1780266,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983447810","doi":"10.1007/s10957-007-9289-7","title":"R&D Equilibrium Strategies with Surfers","year":2007,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Subgame perfect equilibrium; Cournot competition; Competitor analysis; Nash equilibrium; Microeconomics; Mathematical economics; Game theory; Economics; Industrial organization; Business; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.01779247636883217,"gpt":0.2315554521449394,"spread":0.2137629757761073,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001312239,0.00007264861,0.0001752058,0.000125308,0.00007608169,0.00007119073,0.00009925066,0.00004236034,0.000154032],"category_scores_gemma":[0.00001821874,0.00006703712,0.00003833291,0.0001144723,0.00008847428,0.000387728,0.00001321519,0.00008162851,0.000009558476],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002189906,"about_ca_system_score_gemma":0.00002321021,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001978156,"about_ca_topic_score_gemma":0.000001857882,"domain_scores_codex":[0.9993016,0.00001043341,0.0004536101,0.000106432,0.00001722381,0.0001106629],"domain_scores_gemma":[0.9991406,0.000116613,0.0004815357,0.0001229079,0.00006539223,0.00007294699],"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.00008260767,0.00002724128,0.0003777188,0.000006014756,0.00002942428,3.631746e-7,0.0001840278,0.09238843,0.00001589956,0.9065008,0.00003354831,0.0003539625],"study_design_scores_gemma":[0.001014387,0.0001584574,0.0006925165,0.00001984316,0.00003045555,0.000108373,0.002200432,0.00150217,0.000132582,0.9408922,0.05294841,0.0003001515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03340207,0.0006670541,0.944098,0.0001516775,0.00004482961,0.00009642956,0.00001269234,0.000009166747,0.02151811],"genre_scores_gemma":[0.9754793,0.0002302213,0.02331923,0.0001079344,0.0001481207,0.000005543365,0.000007201029,0.00001479623,0.00068766],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9420772,"threshold_uncertainty_score":0.2733695,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1989390764","doi":"10.1007/s10957-010-9747-5","title":"Convexity of the Proximal Average","year":2010,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":14,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Okanagan University College; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Convexity; Interpolation (computer graphics); Regular polygon; Mathematics; Factor (programming language); Function (biology); Convex function; Applied mathematics; Mathematical analysis; Combinatorics; Mathematical optimization; Computer science; Geometry; Artificial intelligence; Image (mathematics)","retraction":null,"screen_n_in":null,"score":{"opus":0.01747137975868668,"gpt":0.3263128521392824,"spread":0.3088414723805957,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009492278,0.00006823368,0.0001389897,0.00007135028,0.0001518524,0.00001946922,0.0002301828,0.00005816654,0.0002227545],"category_scores_gemma":[0.0007616854,0.00004583711,0.00005921768,0.0002666478,0.0002312789,0.0001620056,0.00005261253,0.000299672,7.162151e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008997496,"about_ca_system_score_gemma":0.00007403202,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":1.405752e-7,"about_ca_topic_score_gemma":3.51036e-7,"domain_scores_codex":[0.9991299,0.0001187674,0.00038375,0.00007504922,0.0002125979,0.00007994943],"domain_scores_gemma":[0.9981827,0.0005040604,0.0005073383,0.0002357789,0.0005100777,0.00006002618],"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.00005420834,0.0001941758,0.0002225813,0.00004104665,0.00003190269,3.136475e-7,0.0002225202,0.07134674,0.002021409,0.9226211,0.00008888882,0.003155094],"study_design_scores_gemma":[0.001368636,0.00008409308,0.0004503995,0.00004754445,0.0000931778,0.0001765137,0.0003619683,0.067276,0.01662502,0.9093942,0.003912342,0.0002101176],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005779857,0.00002497563,0.9921787,0.0003019741,0.00005734792,0.0003284914,0.000007171156,0.000008872507,0.00131259],"genre_scores_gemma":[0.4775326,0.0001134384,0.5209414,0.00008796187,0.0002001954,0.00004110693,0.000002468708,0.00002734542,0.001053486],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4717528,"threshold_uncertainty_score":0.2439005,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1975965350","doi":"10.1007/s10957-013-0433-2","title":"Research and Development with Stock-Dependent Spillovers and Price Competition in a Duopoly","year":2013,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Capital Investment and Risk Analysis","field":"Economics, Econometrics and Finance","cited_by":13,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Microeconomics; Economics; Stock (firearms); Duopoly; Observability; Industrial organization; Nash equilibrium; Converse; Cournot competition; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02564965946714757,"gpt":0.2486700278748607,"spread":0.2230203684077131,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006922293,0.00004992952,0.0001250984,0.0002900791,0.0001192291,0.00008028645,0.00004056996,0.00002896685,0.0001035889],"category_scores_gemma":[0.00001230428,0.00004294246,0.000008409947,0.0001846008,0.00009498241,0.0002446455,0.00002107632,0.00009414582,0.000006105288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003238117,"about_ca_system_score_gemma":0.00001473903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001547456,"about_ca_topic_score_gemma":0.000006083981,"domain_scores_codex":[0.9994751,0.00002213114,0.000279199,0.0001074502,0.00003894664,0.00007718514],"domain_scores_gemma":[0.9995465,0.00007329891,0.00018416,0.00005378548,0.00008156457,0.00006065921],"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.00003456564,0.0001197718,0.009785599,0.00001708599,0.00004318364,6.963469e-7,0.0007221401,0.005169767,0.00001720422,0.9827768,0.00002465221,0.001288524],"study_design_scores_gemma":[0.005790084,0.0009511291,0.1655721,0.0002091043,0.0000617799,0.0001924557,0.01243341,0.03414091,0.0005405139,0.7633944,0.01577884,0.0009352435],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7166848,0.008622771,0.2699477,0.0009484048,0.00001828637,0.0005872582,0.000007437867,0.000007044048,0.003176257],"genre_scores_gemma":[0.9874702,0.00396924,0.0079912,0.00005698554,0.00002467139,0.00004508542,0.000005190216,0.000006570311,0.0004308378],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2707854,"threshold_uncertainty_score":0.1751143,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W135291411","doi":"10.1023/a:1004603023018","title":"Unbiased Estimates of Circle Parameters","year":2000,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Image and Object Detection Techniques","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Nonlinear system; Noise (video); Arc length; Theory of computation; Arc (geometry); Applied mathematics; Set (abstract data type); RADIUS; Unbiased Estimation; Unit circle; Algorithm; Mathematical analysis; Mathematical optimization; Statistics; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.005505320253797789,"gpt":0.236017201538664,"spread":0.2305118812848662,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003746834,0.0000461886,0.00009912705,0.00009733086,0.00007438043,0.0000396127,0.0001926981,0.00002700741,0.00006071746],"category_scores_gemma":[0.00002985836,0.00004274867,0.00004019707,0.0002515332,0.00005447704,0.0003363458,0.00001184378,0.00005660339,0.000001494983],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007401714,"about_ca_system_score_gemma":0.00002173351,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.781399e-7,"about_ca_topic_score_gemma":3.438598e-8,"domain_scores_codex":[0.9994905,0.00005081246,0.0002521144,0.00007172346,0.00008061637,0.00005421217],"domain_scores_gemma":[0.9993472,0.0001528678,0.0001922997,0.0001460682,0.0001235919,0.00003795872],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0000536697,0.0001594805,0.0000379182,0.00002073833,0.00003795863,0.00000175813,0.0003344435,0.09646841,0.001468553,0.0369456,0.0001631279,0.8643084],"study_design_scores_gemma":[0.001138143,0.0005629839,0.0009791041,0.0001052363,0.0001026289,0.0003710599,0.0001925033,0.0711548,0.5729793,0.3478024,0.004225909,0.0003859506],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002548221,0.0001204652,0.9960947,0.0001066676,0.00001252798,0.00008432024,7.249138e-7,0.00003060656,0.001001786],"genre_scores_gemma":[0.5275038,0.0003569255,0.471803,0.0001891935,0.00002758629,0.0000156206,9.370937e-7,0.000005874238,0.00009699961],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8639224,"threshold_uncertainty_score":0.174324,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2898479565","doi":"10.1007/s10957-018-1414-2","title":"Variational Analysis on the Signed Distance Functions","year":2018,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Signed distance function; Mathematics; Set function; Subderivative; Hausdorff distance; Complement (music); Function (biology); Boundary (topology); Distance transform; Minkowski distance; Closed set; Theory of computation; Level set (data structures); Set (abstract data type); Discrete mathematics; Mathematical analysis; Algorithm; Regular polygon; Euclidean distance; Convex optimization; Artificial intelligence; Geometry; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.007556437567237859,"gpt":0.2343761490812336,"spread":0.2268197115139957,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001043809,0.0000902887,0.0001418357,0.0003040426,0.0005741204,0.0001750286,0.0003761594,0.00003754903,0.0004167535],"category_scores_gemma":[0.0001524781,0.00006067512,0.0001219632,0.002016306,0.0001017721,0.000356817,0.00003748866,0.00009230708,0.00001856351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000254688,"about_ca_system_score_gemma":0.00006206848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":5.286088e-7,"about_ca_topic_score_gemma":9.594714e-7,"domain_scores_codex":[0.9988964,0.0002152374,0.0003697816,0.0001657852,0.0002656645,0.00008712027],"domain_scores_gemma":[0.9978318,0.0006719394,0.0004308415,0.0002881612,0.0007049372,0.00007229552],"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.00001446695,0.00005702708,0.00006092016,5.714648e-7,0.000198299,9.560179e-8,0.00009220304,0.2901995,0.000006717906,0.7084312,0.0002300384,0.0007090011],"study_design_scores_gemma":[0.0002868698,0.0001113648,0.001326126,0.000006326698,0.0004586746,0.00001043685,0.0001330851,0.9211661,0.00006621836,0.06842804,0.007853699,0.0001531161],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00004983735,0.00003447503,0.9927546,0.004346107,0.00005658723,0.0001026988,0.000007755943,0.00002107854,0.002626907],"genre_scores_gemma":[0.8679792,0.00007041513,0.1274036,0.002298294,0.0005241694,0.00005277459,0.00002766344,0.00001015473,0.001633701],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8679294,"threshold_uncertainty_score":0.4563159,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W66820110","doi":"10.1023/a:1013040428127","title":"Complexity of a Noninterior Path-Following Method for the Linear Complementarity Problem","year":2002,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":12,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Combinatorics; Mathematics; Lambda; Linear complementarity problem; Eigenvalues and eigenvectors; Matrix (chemical analysis); Upper and lower bounds; Positive-definite matrix; Interior point method; Mathematical analysis; Physics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1135553928563568,"gpt":0.4153717938177717,"spread":0.3018164009614149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001742685,0.00009701221,0.0002453801,0.00008523413,0.0002982019,0.00002755301,0.0002268732,0.00003793403,0.0002396615],"category_scores_gemma":[0.0003406763,0.00006956851,0.0001296979,0.0002410671,0.0001510872,0.0001587052,0.00004916938,0.0001451031,5.759549e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002914388,"about_ca_system_score_gemma":0.00002178762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001076564,"about_ca_topic_score_gemma":8.155482e-7,"domain_scores_codex":[0.9987662,0.0001945485,0.0005967991,0.000109435,0.0002105227,0.000122534],"domain_scores_gemma":[0.9968099,0.001894128,0.0005796758,0.0001909073,0.0004643996,0.00006098285],"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.0001425547,0.0005086672,0.0000631668,0.0001550017,0.0002948623,6.744435e-7,0.001250948,0.2984018,0.0002560569,0.6810163,0.0004945713,0.01741534],"study_design_scores_gemma":[0.001099533,0.000122018,0.00001071729,0.00004839497,0.000159849,0.0000300604,0.0008258792,0.7994561,0.0004507515,0.1948402,0.002850447,0.0001060778],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000758911,0.0001992755,0.997824,0.0007765614,0.0000249517,0.0008231528,0.00003612158,0.00001191129,0.000228196],"genre_scores_gemma":[0.007876814,0.0001518062,0.991509,0.00006767417,0.00007788004,0.0001008614,0.000006339686,0.00001823247,0.0001914123],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5010542,"threshold_uncertainty_score":0.2836922,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2012569716","doi":"10.1007/s10957-014-0576-9","title":"A Weighted Sequential Sampling Method Considering Influences of Sample Qualities in Input and Output Parameter Spaces for Global Optimization","year":2014,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Metamodeling; Weighting; Sampling (signal processing); Adaptive sampling; Sample (material); Mathematics; Mathematical optimization; Sample space; Quality (philosophy); Process (computing); Algorithm; Computer science; Statistics; Monte Carlo method","retraction":null,"screen_n_in":null,"score":{"opus":0.03182126986910357,"gpt":0.3417841240154184,"spread":0.3099628541463149,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001269667,0.0001311424,0.0002870708,0.0002017396,0.0001390187,0.0001231441,0.0001900562,0.00007010136,0.000003774501],"category_scores_gemma":[0.0007761383,0.0001225772,0.00004634907,0.0003875351,0.0001256156,0.0007456177,0.00007023504,0.00008098924,5.961424e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003718427,"about_ca_system_score_gemma":0.00006334766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005397881,"about_ca_topic_score_gemma":0.00000199406,"domain_scores_codex":[0.998607,0.0002886633,0.0006035078,0.0002231288,0.00014369,0.0001339794],"domain_scores_gemma":[0.996683,0.001958932,0.0006808854,0.0001543085,0.0004497815,0.00007306654],"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.0000337608,0.00003233836,0.0003051903,0.00002507675,0.00002030884,8.317664e-8,0.0004328532,0.8280587,0.00002583177,0.1585114,7.495906e-7,0.01255371],"study_design_scores_gemma":[0.0007809686,0.00006945903,0.0001257872,0.00004479829,0.0000261735,0.00002817464,0.0003311878,0.9017383,0.0003273146,0.09622537,0.0001740773,0.0001283549],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001129463,0.0001711185,0.9980507,0.0001755823,0.00005200785,0.0003443962,0.00001575095,0.00002090917,0.00004003349],"genre_scores_gemma":[0.04524464,0.0001380982,0.9544168,0.00009016784,0.00004408402,0.00004296939,0.000007100129,0.000008252524,0.000007942933],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0736796,"threshold_uncertainty_score":0.4998552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}