{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":30,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":30,"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":"88996ac5d38d","filters":{"venue":"Mathematical Methods of Operations Research"}},"results":[{"id":"W1995695651","doi":"10.1007/s001860000073","title":"The efficient frontier for bounded assets","year":2000,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":105,"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":"Efficient frontier; Portfolio; Bounded function; Constraint (computer-aided design); Upper and lower bounds; Selection (genetic algorithm); Variance (accounting); Project portfolio management; Budget constraint; Asset (computer security); Mathematical optimization; Universe; Mathematics; Econometrics; Economics; Mathematical economics; Computer science; Finance; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.4164572100295024,"gpt":0.6420881436023647,"spread":0.2256309335728622,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.0323426,0.00008800464,0.0002581567,0.0002060612,0.001089245,0.0006572378,0.0008158389,0.00007877462,0.001698411],"category_scores_gemma":[0.02086564,0.00004672148,0.0001291391,0.001006744,0.0004272465,0.000119306,0.00007458599,0.0001810027,0.0002748187],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002751769,"about_ca_system_score_gemma":0.0001527439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001140081,"about_ca_topic_score_gemma":0.000008378534,"domain_scores_codex":[0.9950058,0.001881648,0.000849733,0.0003040666,0.00159582,0.0003629262],"domain_scores_gemma":[0.9853255,0.01232657,0.00003818125,0.000831231,0.001366346,0.0001122395],"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.00008996078,0.0002925086,0.00002060324,0.000008463465,0.00002640967,4.487959e-7,0.0008946215,0.03278083,0.0007138749,0.3126907,0.01271025,0.6397713],"study_design_scores_gemma":[0.0001948527,0.00008781122,0.0001182542,0.000008709165,0.000006207357,0.000002415491,0.0003628013,0.6566198,0.002699048,0.2731458,0.06668888,0.0000654188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02354371,0.0001588568,0.9491084,0.002485133,0.00008779323,0.0008892412,0.00001297755,0.00001309898,0.02370079],"genre_scores_gemma":[0.02645135,0.00008591392,0.9452918,0.00002354082,0.00005960134,0.0002646682,0.00000356542,0.00001429464,0.02780529],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.639706,"threshold_uncertainty_score":0.9992142,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2079676062","doi":"10.1007/s001860100116","title":"Dynamic order replenishment policy in internet-based supply chains","year":2001,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Erlang (programming language); Reorder point; Lead time; Markov decision process; Computer science; Holding cost; Supply chain; Mathematical optimization; Operations research; Inventory control; Poisson distribution; Exponential distribution; Markov chain; Erlang distribution; Newsvendor model; Markov process; Economic order quantity; Operations management; Mathematics; Business; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.114768975797243,"gpt":0.455007958257407,"spread":0.3402389824601639,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005306871,0.0001652536,0.000313719,0.001550565,0.0001309655,0.0002706804,0.0005098177,0.00007638472,0.003163502],"category_scores_gemma":[0.00303086,0.0001431484,0.000081602,0.002234206,0.000214862,0.0004043095,0.0003664985,0.0003013608,0.0002954403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001756204,"about_ca_system_score_gemma":0.0000912933,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001170125,"about_ca_topic_score_gemma":0.0003763288,"domain_scores_codex":[0.9976099,0.0002661198,0.0006161339,0.0003577454,0.0006429503,0.0005072176],"domain_scores_gemma":[0.9986274,0.0003583977,0.00004409764,0.0005602909,0.0003777909,0.00003198318],"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.00008909559,0.001615111,0.001694541,0.0007684721,0.00004548548,0.00002963751,0.0004060626,0.00328411,0.002068924,0.9538941,0.002453171,0.03365133],"study_design_scores_gemma":[0.000740746,0.00005009154,0.0009564624,0.0001827241,0.00001074579,0.000001684539,0.0007352934,0.9494146,0.0004359719,0.02537711,0.02189877,0.0001958404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1839433,0.0001267245,0.6487009,0.02971249,0.0002077726,0.002620975,0.000004380452,0.0001529828,0.1345305],"genre_scores_gemma":[0.7043014,0.00002359543,0.2856779,0.001197921,0.0001958216,0.0004628251,0.00003654415,0.00005192445,0.008052146],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9461305,"threshold_uncertainty_score":0.9977477,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2094779358","doi":"10.1007/s001860400369","title":"Dynamic inventory strategies for profit maximization in a service facility with stochastic service, demand and lead time","year":2004,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":45,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Lead time; Markov decision process; Profit maximization; Inventory control; Operations research; Computer science; Profit (economics); Mathematical optimization; Maximization; Erlang (programming language); Supply chain; Poisson process; Poisson distribution; Markov chain; Optimal control; Service level; Holding cost; Markov process; Operations management; Business; Microeconomics; Economics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.09918178702663151,"gpt":0.3948691515617233,"spread":0.2956873645350918,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003117387,0.0001428442,0.0002659392,0.0004493902,0.0001913405,0.0002947741,0.0002112278,0.00006510203,0.0001334015],"category_scores_gemma":[0.0004074817,0.0001159317,0.00002474186,0.0009299643,0.0001276511,0.0008129761,0.0001701392,0.0001576498,0.00005455451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008114478,"about_ca_system_score_gemma":0.00009713738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002836552,"about_ca_topic_score_gemma":0.001014773,"domain_scores_codex":[0.9985731,0.0001140829,0.0003615058,0.0002985436,0.0003579113,0.0002949158],"domain_scores_gemma":[0.9988963,0.0001893826,0.00004141627,0.0002599397,0.000590849,0.00002214004],"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.0005098955,0.000918945,0.0004412462,0.01438032,0.0001646423,0.000006572092,0.00459011,0.3248079,0.01030228,0.6386006,0.0001326977,0.005144723],"study_design_scores_gemma":[0.001160768,0.00005886588,0.0003179884,0.0002413726,0.00002826543,0.000001339571,0.002942956,0.8824418,0.00009752978,0.1124834,0.00006501855,0.000160716],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3410743,0.00003930611,0.6524909,0.002874347,0.00001687796,0.001938601,0.000007029334,0.00003678933,0.001521861],"genre_scores_gemma":[0.6563951,0.000004278878,0.3411261,0.0006296663,0.00005938233,0.001169721,0.0001023557,0.00004606826,0.0004673833],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5576339,"threshold_uncertainty_score":0.4727558,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2060702903","doi":"10.1007/s00186-010-0318-1","title":"Continuous review inventory models for perishable items ordered in batches","year":2010,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","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 Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Perishability; Heuristics; Poisson distribution; Inventory control; Lost sales; Computer science; Mathematical optimization; Heuristic; Food spoilage; Lead time; Holding cost; Operations research; Mathematics; Operations management; Statistics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.2136188641859939,"gpt":0.4628448770691848,"spread":0.2492260128831909,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009817592,0.0001423394,0.0004425087,0.0004710171,0.000183858,0.0002113087,0.0004794423,0.00008612725,0.001402623],"category_scores_gemma":[0.004588044,0.0001210085,0.000111185,0.0007510273,0.0001931206,0.000718426,0.0002615871,0.0003616778,0.00007403288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002138571,"about_ca_system_score_gemma":0.00005337948,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002130556,"about_ca_topic_score_gemma":0.0001728353,"domain_scores_codex":[0.9980472,0.0001576245,0.0006382955,0.0003048122,0.0004491642,0.0004028869],"domain_scores_gemma":[0.9982756,0.0004998911,0.0000540163,0.0004986199,0.0006432608,0.00002856428],"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.0000262102,0.000699846,0.0001387211,0.008140926,0.00003656392,0.00000221895,0.0002449624,0.0004267619,0.005339825,0.9519733,0.01974181,0.01322886],"study_design_scores_gemma":[0.0006754577,0.00003826563,0.00003436235,0.0009536531,0.00003514889,0.000001116205,0.0008422406,0.680549,0.0005922985,0.2265567,0.08946379,0.0002579894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07574534,0.004744263,0.543364,0.02172066,0.001162742,0.01613653,0.00002329192,0.0002726333,0.3368305],"genre_scores_gemma":[0.1470677,0.0005192541,0.8344553,0.002557008,0.0009755644,0.004497913,0.00008122922,0.0001403945,0.009705595],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7254165,"threshold_uncertainty_score":0.9995102,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1967250047","doi":"10.1007/s001860200197","title":"An Attractor-Repeller approach to floorplanning","year":2002,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":32,"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":"Solver; Mathematical optimization; Set (abstract data type); Floorplan; Attractor; Optimization problem; Computer science; Regular polygon; Mathematics; Fixed point; Combinatorial optimization; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.2380313023443612,"gpt":0.4704546168576607,"spread":0.2324233145132994,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001280047,0.0001023998,0.000191919,0.000233221,0.000135934,0.0000722135,0.0002294077,0.00007677259,0.0003661093],"category_scores_gemma":[0.0008668857,0.00009078206,0.00002832872,0.0003421075,0.0000702742,0.0001516114,0.00003730194,0.0002837867,0.00009755498],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003671275,"about_ca_system_score_gemma":0.000005328266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003582918,"about_ca_topic_score_gemma":5.025723e-7,"domain_scores_codex":[0.9987285,0.0002314619,0.0002821823,0.0001838027,0.0002977398,0.0002763397],"domain_scores_gemma":[0.9988775,0.000376019,0.000006175464,0.0004147066,0.0001662776,0.000159267],"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.000001672961,0.0001527344,0.000001084245,0.00008560622,0.0000105155,4.847166e-7,0.001003888,0.9697914,0.006251262,0.01547658,0.0002789875,0.006945827],"study_design_scores_gemma":[0.00007058032,0.00005376695,0.00001589478,0.00001897188,0.000004147236,0.000003451139,0.0002033892,0.9791852,0.01705668,0.002910697,0.0003711771,0.0001060711],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004404445,0.00004867989,0.9608837,0.00004339056,0.00003335718,0.0002708305,0.000004564851,0.0001150777,0.0341959],"genre_scores_gemma":[0.2784344,0.000009491637,0.7210492,0.000006872308,0.00003650384,0.00005723811,0.000004999418,0.00002335712,0.0003779491],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.27403,"threshold_uncertainty_score":0.400864,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2005776335","doi":"10.1007/s00186-011-0361-6","title":"Optimizing capacity, pricing and location decisions on a congested network with balking","year":2011,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":27,"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":"Computer science; Queue; Service (business); Mathematical optimization; Tabu search; Operations research; Poisson distribution; Facility location problem; Heuristic; Node (physics); Process (computing); Queueing theory; Transshipment (information security); Multinomial logistic regression; Computer network; Algorithm; Mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.3506698778758426,"gpt":0.4211256901839838,"spread":0.07045581230814119,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004302659,0.0001231705,0.0002162788,0.0003723557,0.0004462424,0.0001662105,0.000211782,0.00005109129,0.0003847793],"category_scores_gemma":[0.002492229,0.00009415673,0.00002362179,0.001369915,0.0002053445,0.0004489179,0.0002073779,0.0002172864,0.00007655142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002671607,"about_ca_system_score_gemma":0.00002775978,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004627526,"about_ca_topic_score_gemma":0.0002968956,"domain_scores_codex":[0.9984089,0.0001696601,0.0003881795,0.0002764105,0.0004630313,0.0002938022],"domain_scores_gemma":[0.9982939,0.0003806329,0.00002613654,0.0003671061,0.0009025874,0.00002966325],"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.00006058182,0.0003127734,0.0001844246,0.0003260096,0.00005038527,0.000001467767,0.001147556,0.02151412,0.0003663581,0.9612904,0.0001838326,0.01456214],"study_design_scores_gemma":[0.0006840299,0.000178179,0.004616765,0.0009464719,0.00008226161,0.000004404875,0.003203434,0.9340193,0.0008844394,0.05410272,0.0008987453,0.0003792614],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.184088,0.0000415009,0.7771424,0.0006757089,0.00006403791,0.0008644019,6.637621e-7,0.00006250941,0.03706077],"genre_scores_gemma":[0.5352474,0.000008183039,0.4643659,0.0001131826,0.00005717071,0.00007784311,0.000002966789,0.00001322242,0.0001141751],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9125051,"threshold_uncertainty_score":0.4213064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2575679751","doi":"10.1007/s00186-017-0574-4","title":"A maximum principle for Markov regime-switching forward–backward stochastic differential games and applications","year":2017,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Insurance, Mortality, Demography, Risk Management","field":"Social Sciences","cited_by":16,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Canadian Imperial Bank of Commerce (Canada)","funders":"Seventh Framework Programme; Alexander von Humboldt-Stiftung","keywords":"Maximum principle; Mathematics; Differential game; Stochastic differential equation; Markov chain; Corollary; Applied mathematics; Differential (mechanical device); Mathematical optimization; Principle of maximum entropy; Mathematical economics; Optimal control; Discrete mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1352381933958266,"gpt":0.5324272925989078,"spread":0.3971890992030812,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.008407928,0.0001425099,0.0003690749,0.0002803474,0.003295451,0.0006932787,0.0008263689,0.0001163782,0.0001302533],"category_scores_gemma":[0.005315759,0.0001265339,0.0001332769,0.0002241357,0.00111877,0.0003060701,0.0004114214,0.0002722531,0.00001238879],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005694607,"about_ca_system_score_gemma":0.0001387463,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002781958,"about_ca_topic_score_gemma":0.0004009913,"domain_scores_codex":[0.996989,0.0008309651,0.0004644133,0.0004126085,0.0007681572,0.0005349272],"domain_scores_gemma":[0.9966565,0.001517489,0.00009709298,0.0009185579,0.0006121435,0.0001982544],"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.00003229783,0.0002995205,0.0002811358,0.000357705,0.00009739025,5.249624e-7,0.003105182,0.00004694768,0.0006530524,0.9094099,0.0001263657,0.08559003],"study_design_scores_gemma":[0.001395257,0.0002467758,0.00976683,0.0002763473,0.0001925556,0.000002735797,0.006237163,0.05956447,0.0007101237,0.9064286,0.01457842,0.0006007146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02316396,0.00007008344,0.9605793,0.001763821,0.00007505974,0.003101511,0.00002633721,0.00003741407,0.01118251],"genre_scores_gemma":[0.5172732,0.0000574121,0.479188,0.00001274682,0.0001962741,0.001824825,0.000004285081,0.00002373313,0.001419465],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4941093,"threshold_uncertainty_score":0.9980021,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2764314492","doi":"10.1007/s00186-017-0612-2","title":"An M/PH/K queue with constant impatient time","year":2017,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","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 Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Queueing theory; Constant (computer programming); Computer science; Server; Burke's theorem; Reduction (mathematics); Queueing system; Mathematical optimization; Algorithm; Applied mathematics; Mathematics; Queue management system; Computer network; Fork–join queue","retraction":null,"screen_n_in":null,"score":{"opus":0.1163353833401027,"gpt":0.4869793571310019,"spread":0.3706439737908992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005755899,0.0001360132,0.0003474906,0.000329229,0.001103929,0.0007252552,0.0007677475,0.00005743542,0.001434071],"category_scores_gemma":[0.004408055,0.00009618478,0.0000610999,0.0003233499,0.0007563491,0.001388601,0.0002856155,0.0002535195,0.0003349385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003187421,"about_ca_system_score_gemma":0.0000546132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001280695,"about_ca_topic_score_gemma":0.00004537192,"domain_scores_codex":[0.9981945,0.0002705872,0.0003613644,0.0003000228,0.0005456888,0.0003278206],"domain_scores_gemma":[0.9971328,0.000492708,0.0001039743,0.001292729,0.0009396438,0.00003811534],"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.00009281606,0.0004767655,0.0001385259,0.000182785,0.00007414648,0.000009605653,0.0001596393,0.003591541,0.02199087,0.9636135,0.00008599652,0.0095838],"study_design_scores_gemma":[0.000501305,0.0001393046,0.000167524,0.0002059039,0.00008617222,0.000004631433,0.000671622,0.6914085,0.007280889,0.29843,0.0008155798,0.0002885494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3578079,0.00002254073,0.5572345,0.001766105,0.00003814103,0.0008702152,0.000008115939,0.00009936585,0.08215313],"genre_scores_gemma":[0.582872,0.000001569314,0.4160749,0.00006350204,0.0001377554,0.00007760022,0.000008527799,0.00003097002,0.0007331552],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.687817,"threshold_uncertainty_score":0.9994788,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2613233453","doi":"10.1007/s00186-017-0589-x","title":"Portfolio optimization for a large investor under partial information and price impact","year":2017,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"Engineering and Physical Sciences Research Council; Natural Sciences and Engineering Research Council of Canada","keywords":"Utility maximization problem; Stochastic control; Portfolio; Mathematical optimization; Maximization; Complete information; Portfolio optimization; Optimal control; Computer science; Markov chain; Optimization problem; Utility maximization; Economics; Econometrics; Mathematical economics; Mathematics; Financial economics","retraction":null,"screen_n_in":null,"score":{"opus":0.1889138845939967,"gpt":0.4734145068552124,"spread":0.2845006222612158,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003124721,0.00008240464,0.0002653179,0.0002116831,0.000725158,0.0003076631,0.000256053,0.00009113783,0.0001908867],"category_scores_gemma":[0.005340389,0.00007807273,0.0000592141,0.0001586976,0.0001424419,0.0006642436,0.0001283446,0.0001173586,0.00003105856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004392625,"about_ca_system_score_gemma":0.00008085161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008177448,"about_ca_topic_score_gemma":0.000003859457,"domain_scores_codex":[0.9989449,0.00001947857,0.0005465751,0.0001735442,0.00006907125,0.0002464405],"domain_scores_gemma":[0.9987153,0.0002961625,0.0001497543,0.0004245588,0.0003179717,0.00009621633],"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.00001158957,0.00008235405,0.0000702548,0.00008340371,0.00001611214,2.877908e-8,0.0002284098,0.0009210702,0.00003317299,0.9973948,0.00006229617,0.001096524],"study_design_scores_gemma":[0.000360254,0.00009299356,0.001210292,0.00001858571,0.000004557397,0.000001646951,0.00008109411,0.4795772,0.0001496399,0.5173798,0.001034879,0.00008906805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004529023,0.000118009,0.9905186,0.0008525829,0.00003147568,0.0006988897,0.0001788635,0.00001035526,0.003062169],"genre_scores_gemma":[0.2244328,0.0000358941,0.7748122,0.00003981972,0.00005482959,0.0004886449,0.0000246501,0.00001211102,0.00009908457],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.480015,"threshold_uncertainty_score":0.639333,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028962211","doi":"10.1007/s00186-013-0455-4","title":"Fitting concentric circles to measurements","year":2013,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":11,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Royal Ottawa Mental Health Centre; Royal Military College of Canada","funders":"","keywords":"Concentric; Mathematics; Generalization; Least-squares function approximation; Combinatorics; Set (abstract data type); Geometry; Mathematical analysis; Statistics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.2240559773635387,"gpt":0.5157598582568775,"spread":0.2917038808933388,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001895829,0.00009756569,0.0002733925,0.0002191661,0.0001036655,0.00006924001,0.0002930038,0.00005199048,0.0008336714],"category_scores_gemma":[0.003204399,0.00008307542,0.00005629731,0.001047807,0.00008714492,0.0001669795,0.0001069441,0.0002274245,0.0003353628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008133584,"about_ca_system_score_gemma":0.00001414283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000220506,"about_ca_topic_score_gemma":0.00000154708,"domain_scores_codex":[0.9982117,0.0003498236,0.000425002,0.0001642484,0.00051637,0.0003328222],"domain_scores_gemma":[0.9982476,0.0007082451,0.000008702837,0.0003445889,0.0005252098,0.00016564],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.000002233091,0.0001733605,0.00009278758,0.0002460642,0.00009449306,7.663814e-7,0.0005725011,0.02480968,0.7418894,0.009667801,0.001576433,0.2208744],"study_design_scores_gemma":[0.0001206801,0.00009135884,0.0002702206,0.0001202357,0.00001443074,0.000002106121,0.000301753,0.3886462,0.5645052,0.04509927,0.000597316,0.0002311799],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03374768,0.00007670101,0.9593633,0.0002988765,0.00001353727,0.000589205,0.000001380643,0.000146348,0.005762964],"genre_scores_gemma":[0.2853044,0.000006783699,0.7142429,0.00001780444,0.00001622549,0.0002795288,8.118666e-7,0.00001793006,0.0001135877],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3638366,"threshold_uncertainty_score":0.9128117,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1989295643","doi":"10.1007/s00186-005-0008-6","title":"Upper and lower bounds for the solutions of Markov renewal equations","year":2005,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Probability and Risk Models","field":"Decision Sciences","cited_by":10,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Markov chain; Upper and lower bounds; Markov process; Mathematics; Applied mathematics; Markov renewal process; Construct (python library); Renewal theory; Mathematical optimization; Markov model; Markov property; Computer science; Mathematical analysis; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.5802904042036138,"gpt":0.6155566351697195,"spread":0.0352662309661057,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03365747,0.00008415104,0.0002934489,0.0002746654,0.0008292241,0.0001872775,0.0006590285,0.00009115611,0.0006322533],"category_scores_gemma":[0.04710994,0.00004612868,0.0001399653,0.0007593902,0.001169348,0.0002708763,0.0004116527,0.0002096975,0.00002292049],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002937516,"about_ca_system_score_gemma":0.0002208117,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003040952,"about_ca_topic_score_gemma":0.0001171297,"domain_scores_codex":[0.9959922,0.001378611,0.0008899902,0.0002985387,0.001130062,0.0003106015],"domain_scores_gemma":[0.9654524,0.0319806,0.00005106212,0.0008466591,0.001572175,0.00009710195],"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.0000326492,0.0003425225,0.000009997038,0.00002653215,0.0000271679,4.381813e-8,0.001309172,0.002748797,0.003601827,0.8940412,0.000820448,0.09703967],"study_design_scores_gemma":[0.0001403833,0.00008078432,0.00004259276,0.00001418384,0.00001231639,0.00000159006,0.00050786,0.4415596,0.001541972,0.5547237,0.001333043,0.00004189217],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007444082,0.0003760614,0.9741274,0.01376463,0.00004188743,0.0007459606,0.0000439566,0.000007341618,0.003448642],"genre_scores_gemma":[0.2960519,0.00002463837,0.7015814,0.0000268854,0.00004504679,0.0001726746,0.000001039876,0.000006548289,0.002089902],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4388108,"threshold_uncertainty_score":0.995053,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2077707094","doi":"10.1007/s00186-015-0493-1","title":"Downside loss aversion: Winner or loser?","year":2015,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Financial Markets and Investment Strategies","field":"Economics, Econometrics and Finance","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Thompson Rivers University","funders":"","keywords":"CVAR; Downside risk; Expected shortfall; Portfolio; Asset allocation; Econometrics; Stochastic dominance; Asset (computer security); Economics; Risk aversion (psychology); Loss aversion; Expected utility hypothesis; Computer science; Microeconomics; Financial economics","retraction":null,"screen_n_in":null,"score":{"opus":0.4281410796259599,"gpt":0.4699745742157992,"spread":0.04183349458983926,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.006511665,0.0001174723,0.0004294166,0.000315271,0.0001675756,0.0001306739,0.000335962,0.0001106027,0.002543417],"category_scores_gemma":[0.005240913,0.00009312325,0.00007663955,0.000610626,0.0003731571,0.0003399186,0.0001740274,0.0002511788,0.0009402634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008294204,"about_ca_system_score_gemma":0.0001493949,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001153215,"about_ca_topic_score_gemma":0.00001290824,"domain_scores_codex":[0.9982558,0.0002581719,0.0006871802,0.0002973793,0.0001608882,0.000340531],"domain_scores_gemma":[0.9984602,0.0005273357,0.00005166028,0.0004743251,0.0003045292,0.0001819597],"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.0000426525,0.0002009944,0.0001419653,0.00007261984,0.00002069802,0.000006091594,0.0005541184,0.0001053427,0.00009486505,0.9938967,0.00404226,0.0008217501],"study_design_scores_gemma":[0.0006140322,0.0004365863,0.0004250536,0.00006025094,0.000004919682,0.0000127799,0.0009621257,0.017065,0.001989057,0.9403837,0.03781891,0.000227603],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"other","genre_gemma":"methods","genre_scores_codex":[0.1268154,0.001112038,0.2646112,0.007156339,0.0004393328,0.001221575,0.0001042864,0.00007280261,0.598467],"genre_scores_gemma":[0.2088071,0.0001037089,0.776429,0.0001604176,0.0001450961,0.0001157384,0.000008481948,0.00003264991,0.01419777],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5842692,"threshold_uncertainty_score":0.9998376,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053009572","doi":"10.1007/s00186-010-0331-4","title":"On generalized balanced optimization problems","year":2010,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Windsor; Simon Fraser University","funders":"Deutsche Forschungsgemeinschaft","keywords":"Bottleneck; Mathematical optimization; Mathematics; Time complexity; Polynomial; Optimization problem; Computational complexity theory; Computer science; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.1004040725637396,"gpt":0.4622253530535669,"spread":0.3618212804898274,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003245226,0.00009945183,0.0001912104,0.0003404432,0.0002537413,0.0002171385,0.0004975999,0.0001007778,0.001094465],"category_scores_gemma":[0.00272671,0.00008196241,0.0000539362,0.0008131026,0.0001693404,0.0003176309,0.0001297804,0.0004239603,0.00005668921],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000222647,"about_ca_system_score_gemma":0.0001194455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000832378,"about_ca_topic_score_gemma":0.00001066647,"domain_scores_codex":[0.9978953,0.0006549955,0.0003873573,0.0002931432,0.0005305016,0.0002386993],"domain_scores_gemma":[0.9976879,0.0009228335,0.00003172081,0.0006452735,0.0005973648,0.0001149315],"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.000003193802,0.0001223265,0.000004264827,0.00002031207,0.000007044468,3.570818e-7,0.0002310493,0.1831963,0.02235978,0.7771891,0.0000801869,0.01678608],"study_design_scores_gemma":[0.0002526005,0.00007320233,0.00003330322,0.00001936939,0.000001877611,0.000006417657,0.00001495725,0.946156,0.01086701,0.04238769,0.0001036073,0.00008393949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003286493,0.000004278781,0.9855482,0.001653467,0.0001372284,0.0004713724,0.000001987248,0.00007734539,0.008819612],"genre_scores_gemma":[0.04390842,0.000008006991,0.9554759,0.00005982541,0.00002386219,0.0001025494,0.000004474689,0.00000982783,0.0004071893],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7629597,"threshold_uncertainty_score":0.9998187,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2002760368","doi":"10.1007/s001860050004","title":"A convex dual approach to the computation of NMR complex spectra","year":2000,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Advanced Thermodynamics and Statistical Mechanics","field":"Physics and Astronomy","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computation; Duality (order theory); Dual (grammatical number); Spectral line; Regular polygon; Entropy (arrow of time); Statistical physics; Mathematics; Computer science; Algorithm; Combinatorics; Physics; Quantum mechanics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.1515667568102964,"gpt":0.4892947998065489,"spread":0.3377280429962525,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001689843,0.00009276137,0.0002792939,0.00007076409,0.0001829403,0.00003928501,0.0002249747,0.00002707411,0.001502421],"category_scores_gemma":[0.0001721591,0.00006338111,0.00006188035,0.0004283533,0.0001787151,0.00004335412,0.00006672343,0.0002250206,0.00004855585],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001430516,"about_ca_system_score_gemma":0.00004637594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003727271,"about_ca_topic_score_gemma":0.000001236925,"domain_scores_codex":[0.9982222,0.0005756908,0.000405921,0.0001821721,0.0003814158,0.0002326326],"domain_scores_gemma":[0.9984763,0.0008392398,0.00002192482,0.0002857842,0.0002859427,0.00009083297],"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.00001463891,0.0003380922,0.000001202456,0.00003245013,0.00002831864,1.110534e-7,0.0005668866,0.01534973,0.003949746,0.916313,0.00004621017,0.06335963],"study_design_scores_gemma":[0.0001253875,0.00008397539,0.00004487714,0.0000156096,0.000007673293,8.37037e-7,0.0004823494,0.680895,0.001186273,0.3169591,0.0001423074,0.00005670885],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01137471,0.000006737337,0.9498684,0.0003599605,0.00000849125,0.0005478109,0.00006792357,0.000006206294,0.03775981],"genre_scores_gemma":[0.4390535,6.209168e-7,0.5606326,0.000009827071,0.00002691453,0.00005027275,0.00001186706,0.000008847559,0.0002055194],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6655452,"threshold_uncertainty_score":0.9994103,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4396215930","doi":"10.1007/s00186-024-00856-1","title":"Column generation based solution for bi-objective gate assignment problems","year":2024,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Air Traffic Management and Optimization","field":"Engineering","cited_by":8,"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":"Column generation; Robustness (evolution); Mathematical optimization; Column (typography); Computer science; Heuristic; Multi-objective optimization; Solution set; Set (abstract data type); Algorithm; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1762174108771726,"gpt":0.4503761619334017,"spread":0.2741587510562291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003139997,0.0001029145,0.0001607508,0.0003234482,0.0001759464,0.0001953357,0.0001119571,0.00007950555,0.0002411741],"category_scores_gemma":[0.0003842253,0.00009285859,0.00006512727,0.0005227521,0.00007117391,0.0001890135,0.00002753616,0.0001552922,0.00002623817],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001356101,"about_ca_system_score_gemma":0.00005623903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004387456,"about_ca_topic_score_gemma":0.00001072919,"domain_scores_codex":[0.9986273,0.0002551174,0.0003409705,0.0002026281,0.0003320651,0.0002418863],"domain_scores_gemma":[0.9989453,0.0005620447,0.000007531647,0.0001874897,0.0002455996,0.0000520477],"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.000004383984,0.0000788781,3.631418e-7,0.0009974723,0.00005704742,3.598455e-7,0.0004205721,0.895187,0.02496127,0.05219734,0.003215809,0.02287953],"study_design_scores_gemma":[0.0001467105,0.0001037185,0.000002162181,0.0001065021,0.00002255287,3.537859e-7,0.00006329702,0.9793274,0.01534818,0.00333919,0.001446955,0.00009297139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000529448,0.0001820277,0.9936402,0.000504969,0.0001387112,0.0014563,0.0000137992,0.0001748123,0.003359665],"genre_scores_gemma":[0.1160942,0.00002872664,0.8817595,0.000008578754,0.000102077,0.00108378,0.0000627594,0.00003698582,0.0008234364],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1155648,"threshold_uncertainty_score":0.3786663,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2024490033","doi":"10.1007/s001860300295","title":"One-armed bandit models with continuous and delayed responses","year":2003,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":8,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Saskatchewan; University of Manitoba","funders":"","keywords":"Multi-armed bandit; Monotonic function; Markov decision process; Sequence (biology); Optimal stopping; Markov process; Mathematical optimization; Limit (mathematics); Index (typography); Bayesian probability; Markov chain; Mathematics; Time horizon; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.5018446804662678,"gpt":0.6032521031918505,"spread":0.1014074227255827,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["metaresearch"],"category_scores_codex":[0.03120638,0.0001797086,0.0006612436,0.0009237052,0.0005326594,0.0004784345,0.0007306165,0.0001308486,0.001097956],"category_scores_gemma":[0.06461966,0.0001204991,0.00006847142,0.001976847,0.001451948,0.0006188687,0.0002600086,0.0006122018,0.00008915829],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005777715,"about_ca_system_score_gemma":0.0004034227,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002219555,"about_ca_topic_score_gemma":0.00003056109,"domain_scores_codex":[0.9874809,0.006571834,0.0009741376,0.0007056558,0.003580537,0.0006869598],"domain_scores_gemma":[0.9699216,0.02574926,0.0000644883,0.001145835,0.002748918,0.0003698447],"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.001325283,0.001595931,0.0001241487,0.0001342129,0.0002543405,0.00005680432,0.005183689,0.01518485,0.0250455,0.8224453,0.0006926708,0.1279573],"study_design_scores_gemma":[0.0010228,0.0009246806,0.0001265361,0.00006913255,0.00001582202,0.00006603368,0.003667145,0.1637426,0.03345477,0.7958686,0.0007964245,0.0002454481],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05525675,0.0002463257,0.9353731,0.0006675868,0.00001976594,0.0008693182,0.00002233898,0.00002370476,0.007521059],"genre_scores_gemma":[0.2219081,0.00003577592,0.7734496,0.00001700944,0.00001639762,0.0001623396,0.000001211514,0.00002557717,0.004383924],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.1666514,"threshold_uncertainty_score":0.9998152,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019454467","doi":"10.1007/s00186-008-0243-8","title":"Black swans and white eagles: on mathematics and finance","year":2008,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Complex Systems and Time Series Analysis","field":"Economics, Econometrics and Finance","cited_by":7,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Intertek (Canada)","funders":"","keywords":"Black swan theory; Mathematical finance; Parallels; Financial engineering; Financial market; Physical law; Finance; Point (geometry); Mathematical economics; Economics; Computer science; Mathematics; Epistemology; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.228050201469345,"gpt":0.4094744795258505,"spread":0.1814242780565055,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002599621,0.000119764,0.0005553591,0.0003324441,0.0003091603,0.00007712504,0.0001596749,0.00007478541,0.0004848331],"category_scores_gemma":[0.001130179,0.0001092694,0.00006843852,0.000447304,0.0005324759,0.0001170305,0.0001342384,0.0002024524,0.0001445106],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002369858,"about_ca_system_score_gemma":0.00001900616,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006481257,"about_ca_topic_score_gemma":0.00001580832,"domain_scores_codex":[0.9985238,0.0001056754,0.0006947398,0.000320591,0.0001108476,0.0002443358],"domain_scores_gemma":[0.998665,0.000623242,0.00006576227,0.0004441936,0.0001305895,0.00007121171],"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.000004541362,0.0001845948,0.0003776412,0.000173346,0.00004699164,0.000002365096,0.002946536,0.000253724,0.00009820102,0.9949241,0.000226335,0.0007616584],"study_design_scores_gemma":[0.0006415337,0.0004593157,0.00336748,0.0001974259,0.0000172904,0.00005906143,0.002358472,0.573192,0.0005999589,0.4115272,0.007144322,0.0004358652],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.6556678,0.001029574,0.2928184,0.00177608,0.00003177289,0.0006403385,0.00007675267,0.00002284685,0.04793638],"genre_scores_gemma":[0.374468,0.0005314087,0.6190563,0.0000253915,0.00003275493,0.00004876382,0.000002175083,0.00002241657,0.005812734],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5833968,"threshold_uncertainty_score":0.5308582,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019780010","doi":"10.1007/s00186-013-0431-z","title":"Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem","year":2013,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":5,"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":"Cutting-plane method; Mathematical optimization; Relaxation (psychology); Set (abstract data type); Conic section; Cluster analysis; Constraint (computer-aided design); Computer science; Point (geometry); Plane (geometry); Interior point method; Selection (genetic algorithm); Algorithm; Mathematics; Artificial intelligence; Integer programming; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.1633956873692615,"gpt":0.5237032706965733,"spread":0.3603075833273118,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01184599,0.0002054437,0.0006053358,0.0006098182,0.0003626965,0.0001241646,0.0006083011,0.0001797978,0.001061521],"category_scores_gemma":[0.03235557,0.0001503425,0.0001510586,0.001647064,0.0004750855,0.0003685023,0.0003608526,0.0007718619,0.00001259366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002302861,"about_ca_system_score_gemma":0.0003741363,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001558007,"about_ca_topic_score_gemma":0.000117567,"domain_scores_codex":[0.9945477,0.002136554,0.00143455,0.0004112374,0.0008539581,0.0006160396],"domain_scores_gemma":[0.9860305,0.01064777,0.0001963301,0.00056905,0.002428026,0.0001283672],"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.00006964518,0.0008139088,0.0001019684,0.002307385,0.0001574296,6.131833e-7,0.007475853,0.01583584,0.1986801,0.747321,0.001406818,0.02582936],"study_design_scores_gemma":[0.0005475807,0.0001427894,0.00002490022,0.0003126698,0.00001582554,0.00001597925,0.002296149,0.5869949,0.05987005,0.3495944,0.00005651252,0.0001283258],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004970145,0.00002163943,0.9877483,0.001417088,0.00003810756,0.004343608,0.00004126554,0.00003561287,0.001384205],"genre_scores_gemma":[0.01202881,0.000009827105,0.9846953,0.00001479335,0.00002591554,0.001769274,0.000006616453,0.0000522519,0.001397261],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.571159,"threshold_uncertainty_score":0.9998516,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139139599","doi":"10.1007/s00186-013-0446-5","title":"Transshipment games with identical newsvendors and cooperation costs","year":2013,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Transshipment (information security); Clique; Core (optical fiber); Computer science; Mathematical economics; Network topology; Game theory; Set (abstract data type); Mathematical optimization; Cooperative game theory; Limit (mathematics); Microeconomics; Operations research; Economics; Mathematics; Computer network; Combinatorics; Computer security","retraction":null,"screen_n_in":null,"score":{"opus":0.103137110764168,"gpt":0.4079427460139822,"spread":0.3048056352498142,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002560372,0.0001343212,0.0002428984,0.0003603859,0.0002557825,0.0006285215,0.000205438,0.00005101998,0.002561701],"category_scores_gemma":[0.0007223873,0.00009564873,0.00003569105,0.0005280927,0.0003308839,0.0009005865,0.0001519935,0.0001923012,0.0002645527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003781803,"about_ca_system_score_gemma":0.00002413076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003143261,"about_ca_topic_score_gemma":0.00004778692,"domain_scores_codex":[0.998304,0.0001807197,0.0004049575,0.0002665072,0.0005370227,0.0003067828],"domain_scores_gemma":[0.9988174,0.0003160313,0.00002727022,0.0002779553,0.0005209639,0.00004040282],"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.00002887741,0.0003347721,0.0003659085,0.0005526952,0.0000651056,0.000003251061,0.0002980741,0.0002022391,0.006737273,0.9439051,0.002011002,0.0454957],"study_design_scores_gemma":[0.003604527,0.0004824979,0.006630892,0.0008196012,0.0002120547,0.00002050816,0.01086647,0.8112593,0.01173561,0.1271536,0.02611222,0.001102735],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4400155,0.0001387396,0.4794815,0.0130096,0.0001017204,0.003205923,0.000001982589,0.0001026429,0.06394237],"genre_scores_gemma":[0.786009,0.00001743549,0.211283,0.0003925554,0.0002136868,0.0005574554,0.00001187072,0.00003255796,0.001482473],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8167515,"threshold_uncertainty_score":0.9983501,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1570285879","doi":"10.1007/s00186-007-0170-0","title":"S. Nickel and J. Puerto: Location theory: a unified approach","year":2007,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Nickel; Computer science; Materials science","retraction":null,"screen_n_in":null,"score":{"opus":0.1255455380681576,"gpt":0.4706686301258944,"spread":0.3451230920577368,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01200789,0.00008378904,0.0001646912,0.0003506337,0.0002372437,0.0001645271,0.0003257605,0.00008081947,0.00006841891],"category_scores_gemma":[0.002680535,0.00006980538,0.00002739191,0.001056824,0.0002893117,0.0003311985,0.0001818213,0.0002287689,0.00001569188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003496558,"about_ca_system_score_gemma":0.0001064682,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001022329,"about_ca_topic_score_gemma":0.000005688613,"domain_scores_codex":[0.9978124,0.0008930246,0.0003677238,0.0002702817,0.0004122519,0.0002442555],"domain_scores_gemma":[0.9970965,0.001740274,0.00002545889,0.000447253,0.0005679879,0.000122549],"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.000006464533,0.00009266958,0.00001007904,0.00004603724,0.000009062843,5.302493e-7,0.0006646503,0.0004416845,0.002136128,0.8835137,0.00002163893,0.1130573],"study_design_scores_gemma":[0.0003260734,0.00008499614,0.0007988541,0.00003455758,0.000006544046,0.00003368192,0.0009902045,0.8357989,0.00868702,0.1529697,0.0001316779,0.0001378423],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001854107,0.0000584228,0.9816704,0.0005747662,0.0000278414,0.0003824376,6.393122e-7,0.00004538189,0.01538603],"genre_scores_gemma":[0.1416918,0.00001206585,0.8577167,0.00003101707,0.00001283613,0.00002496198,0.000002028086,0.000006172728,0.0005024373],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8353571,"threshold_uncertainty_score":0.416172,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4289780624","doi":"10.1007/s00186-022-00794-w","title":"Minimizing the penalized probability of drawdown for a general insurance company under ambiguity aversion","year":2022,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Insurance and Financial Risk Management","field":"Economics, Econometrics and Finance","cited_by":4,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Actua; University of Waterloo","funders":"Startup Foundation for Introducing Talent of Nanjing University of Information Science and Technology; National Natural Science Foundation of China","keywords":"Reinsurance; Ambiguity aversion; Ambiguity; Bellman equation; Risk aversion (psychology); Drawdown (hydrology); Mathematical optimization; Stochastic control; Mathematics; Mathematical economics; Probability density function; Function (biology); Value (mathematics); Distortion (music); Investment strategy; Expected utility hypothesis; Economics; Computer science; Actuarial science; Optimal control; Microeconomics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.2729761120144579,"gpt":0.4414852252801953,"spread":0.1685091132657374,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01139369,0.00009179958,0.0004496139,0.0001930536,0.0007084566,0.00004355454,0.0005065615,0.00003931763,0.0005088378],"category_scores_gemma":[0.001461159,0.00007814056,0.0001707303,0.0005460944,0.0002944308,0.0001006407,0.0003477982,0.0002705935,0.00001299519],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001159082,"about_ca_system_score_gemma":0.00006013918,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002104695,"about_ca_topic_score_gemma":0.00001373001,"domain_scores_codex":[0.9979103,0.0004981311,0.0008287547,0.0002875107,0.000190745,0.0002845854],"domain_scores_gemma":[0.9982499,0.00084453,0.000123128,0.0005199141,0.0002259967,0.00003652105],"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.00008152308,0.0004391854,0.0004709062,0.0002181593,0.00003534229,1.880438e-7,0.001232865,0.004104829,0.0008336261,0.9903753,0.0002617172,0.001946355],"study_design_scores_gemma":[0.0008936391,0.0003293825,0.008030344,0.0000239629,0.000008497405,0.000001350549,0.001047325,0.1055311,0.002368537,0.8767356,0.004868502,0.0001618274],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5604341,0.0003165374,0.4303223,0.001674607,0.0001081217,0.001712264,0.0002390262,0.00001008038,0.005183019],"genre_scores_gemma":[0.6940028,0.00002504336,0.3045666,0.0000559149,0.00002512665,0.0006299202,0.000007673977,0.00001236331,0.0006745849],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1335687,"threshold_uncertainty_score":0.5571417,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081102656","doi":"10.1007/s00186-013-0432-y","title":"Accelerated modified policy iteration algorithms for Markov decision processes","year":2013,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Markov decision process; Convergence (economics); Markov chain; Operator (biology); Mathematical optimization; Computer science; Markov process; Algorithm; Markov model; Partially observable Markov decision process; Mathematics; Machine learning; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.2714919902690478,"gpt":0.5351392337457531,"spread":0.2636472434767053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.003854922,0.0001494421,0.0002891806,0.0005872145,0.0004163149,0.0009645427,0.0009913023,0.0001187324,0.0001485173],"category_scores_gemma":[0.0160727,0.0001181808,0.00006259329,0.001748621,0.0001383956,0.001083867,0.0003706024,0.0002575664,0.00009018952],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008210746,"about_ca_system_score_gemma":0.0004678654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000436806,"about_ca_topic_score_gemma":0.00000144916,"domain_scores_codex":[0.9971259,0.0005769469,0.0006778726,0.0003755067,0.000783888,0.0004598962],"domain_scores_gemma":[0.9920178,0.004148528,0.00005426645,0.0007325461,0.00289739,0.0001494671],"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.00001723216,0.0003090999,0.000005713352,0.0005840243,0.00004919787,6.835875e-7,0.001768959,0.25402,0.01594427,0.4822529,0.001152939,0.243895],"study_design_scores_gemma":[0.0002703775,0.000197871,0.00003067011,0.00007225565,0.000003067294,0.000003448513,0.00005790544,0.9205285,0.01493796,0.06361915,0.0001664432,0.0001123113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001479163,0.00002574859,0.9927419,0.001796239,0.00005277491,0.00164682,0.000002306979,0.0000715109,0.002183577],"genre_scores_gemma":[0.03762729,0.00001501585,0.959797,0.00005656508,0.00007008629,0.0007448823,0.000008815873,0.00001863481,0.001661729],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6665086,"threshold_uncertainty_score":0.9922153,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2133185406","doi":"10.1007/s00186-015-0516-y","title":"Extensions of the sequential stochastic assignment problem","year":2015,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Optimization and Mathematical Programming","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal; Centre Hospitalier Universitaire Sainte-Justine","funders":"Air Force Office of Scientific Research","keywords":"Mathematical optimization; Extension (predicate logic); Computer science; Assignment problem; Generalized assignment problem; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.26806749435509,"gpt":0.4836843778956902,"spread":0.2156168835406002,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003205326,0.00009310263,0.0002433725,0.0001174489,0.00009433584,0.00003882975,0.0002840231,0.00006835101,0.0001867487],"category_scores_gemma":[0.002595431,0.00006057669,0.0000730741,0.0005370527,0.000283706,0.00008120363,0.0001633098,0.00025849,0.00002443907],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005484819,"about_ca_system_score_gemma":0.00009337642,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004477867,"about_ca_topic_score_gemma":0.000001999291,"domain_scores_codex":[0.9980637,0.000473557,0.000491594,0.0001129044,0.0006230111,0.000235255],"domain_scores_gemma":[0.9983378,0.0005984391,0.00001891671,0.0004021054,0.0005007943,0.0001419126],"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.000006336686,0.0003639174,0.00000139592,0.0004429715,0.00006207035,5.219568e-7,0.001858936,0.6200394,0.02344085,0.3459271,0.0007162882,0.007140208],"study_design_scores_gemma":[0.0002331791,0.00006446439,0.000002576682,0.0001457697,0.00002236266,0.000006318083,0.0006664865,0.9063399,0.01999123,0.07228985,0.000150015,0.00008780635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002409645,0.00005750232,0.9878309,0.0002805741,0.00006634943,0.0006535706,0.00000406427,0.00004596592,0.008651414],"genre_scores_gemma":[0.2740469,0.000001918026,0.7255207,0.000005014729,0.00001538954,0.00008954148,0.000001060792,0.00001891886,0.0003005673],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2863005,"threshold_uncertainty_score":0.3107161,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2093517648","doi":"10.1007/s001860400411","title":"Scheduling Stochastic jobs on a repairable machine with general phase type uptime","year":2005,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Exponential distribution; Erlang (programming language); Erlang distribution; Scheduling (production processes); Mathematical optimization; Permutation (music); Phase-type distribution; Exponential function; Mathematics; Statistics; Theoretical computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1046753650126284,"gpt":0.4631989886852775,"spread":0.3585236236726492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002082833,0.0001473133,0.0002715895,0.000297358,0.0001797713,0.000087354,0.0001976952,0.00008292434,0.0007514588],"category_scores_gemma":[0.001238604,0.0001145784,0.00004239256,0.0007205944,0.0001112703,0.000126459,0.00003626501,0.0004488099,0.0001599444],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006911399,"about_ca_system_score_gemma":0.00005793982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005956977,"about_ca_topic_score_gemma":0.000003919166,"domain_scores_codex":[0.9983476,0.0002685849,0.0003701564,0.0002130866,0.0004702907,0.000330213],"domain_scores_gemma":[0.9984844,0.0005636219,0.00001286737,0.0004123194,0.0003767762,0.0001500233],"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.00004107288,0.0002582976,5.241429e-7,0.00004959642,0.0000424544,0.000001524099,0.0002524565,0.9745656,0.003310238,0.01142453,0.00003664748,0.01001703],"study_design_scores_gemma":[0.0006132172,0.0003114448,0.000001258841,0.00008683737,0.0000132939,0.00001105451,0.0000667092,0.9877289,0.01044441,0.0005286428,0.00006624589,0.0001280085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04307406,0.000168683,0.9529735,0.0002649481,0.00003968541,0.0003202586,0.000007212224,0.0001626778,0.002988991],"genre_scores_gemma":[0.06653847,0.00001040113,0.9324715,0.00002458375,0.0001053586,0.00005776908,0.00001067345,0.00004567796,0.0007355387],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02346441,"threshold_uncertainty_score":0.8227947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2090320702","doi":"10.1007/s001860200266","title":"A transfer/clearing inventory model under sporadic review","year":2003,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Clearing; Computer science; Transfer (computing); Sensitivity (control systems); Operations research; Set (abstract data type); Mathematical optimization; Holding cost; Function (biology); Process (computing); Production (economics); Inventory control; Microeconomics; Mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.2987104621699893,"gpt":0.463743073816939,"spread":0.1650326116469497,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.008641218,0.0001545715,0.0003670499,0.0004389473,0.0002625341,0.0001475289,0.0003753477,0.00006253627,0.00273476],"category_scores_gemma":[0.002147777,0.0001320463,0.0001351995,0.000921863,0.0002056462,0.0005118528,0.0001300973,0.0003120262,0.000273675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005584579,"about_ca_system_score_gemma":0.00006743349,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004187753,"about_ca_topic_score_gemma":0.000008690939,"domain_scores_codex":[0.9977258,0.000324276,0.0005572897,0.0003022104,0.0006976096,0.0003927997],"domain_scores_gemma":[0.9988255,0.0002293762,0.0000238247,0.0005172787,0.0003658289,0.00003822889],"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.000004195089,0.0002341119,0.00001307899,0.00278341,0.00002851091,0.000001538075,0.00005447531,0.004609289,0.001275575,0.9875473,0.00208379,0.001364764],"study_design_scores_gemma":[0.0005111743,0.00002895213,0.00001824448,0.001422727,0.00009758728,0.000002954853,0.000844281,0.6898206,0.001159328,0.2792793,0.02648475,0.0003301187],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02707227,0.002834867,0.7072404,0.004840641,0.00013835,0.002112359,0.000001917361,0.0001219734,0.2556372],"genre_scores_gemma":[0.471329,0.0009110984,0.5066048,0.009274403,0.0003688192,0.0008877613,0.00002391132,0.0001848145,0.01041537],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7082679,"threshold_uncertainty_score":0.9981769,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039023026","doi":"10.1007/s001860000072","title":"The bounce algorithm for mathematical programming","year":2000,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Artificial Intelligence in Games","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Dalhousie University; University of New Brunswick","funders":"","keywords":"Ball (mathematics); Point (geometry); Mathematical optimization; Interior point method; Computer science; Set (abstract data type); Rest (music); Mathematics; Algorithm; Geometry; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.2217521175322165,"gpt":0.538634412973693,"spread":0.3168822954414765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01147795,0.0001314415,0.0002670721,0.0001045238,0.0009974337,0.0006981393,0.001725387,0.00008706222,0.0002992311],"category_scores_gemma":[0.004599907,0.00008405007,0.0001278091,0.0007542029,0.0007570335,0.000329666,0.0002357412,0.0003137755,0.0002624191],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004648895,"about_ca_system_score_gemma":0.0001608205,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000899914,"about_ca_topic_score_gemma":0.00000460382,"domain_scores_codex":[0.9966061,0.0008806403,0.0007001702,0.0003614969,0.00083108,0.0006205398],"domain_scores_gemma":[0.9899371,0.008157732,0.00002671406,0.0009991534,0.0007423519,0.0001369123],"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.000002151752,0.0001059533,1.321695e-7,0.00002056491,0.000009487087,4.732302e-7,0.0005301991,0.0000651337,0.000256319,0.4136654,0.0001010102,0.5852432],"study_design_scores_gemma":[0.0000351112,0.0001095396,7.486399e-7,0.00003157825,0.000003143929,0.000008170295,0.0002126432,0.6072137,0.01308674,0.3702263,0.009002564,0.00006974938],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004236046,0.0001222133,0.9914227,0.002897232,0.0000475036,0.001154213,0.000002822343,0.00006708137,0.003862615],"genre_scores_gemma":[0.001004555,0.0000254484,0.9944429,0.00002758936,0.0000643086,0.000763643,7.099368e-7,0.00001593028,0.003654959],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6071486,"threshold_uncertainty_score":0.7671554,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3129799581","doi":"10.1007/s00186-022-00772-2","title":"Portfolio optimization: not necessarily concave utility and constraints on wealth and allocation","year":2022,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":1,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University","funders":"Technische Universität München","keywords":"Portfolio; Mathematical optimization; Expected utility hypothesis; Terminal (telecommunication); Portfolio optimization; Portfolio allocation; Regular polygon; Legendre transformation; Transformation (genetics); Convex optimization; Mathematics; Computer science; Mathematical economics; Economics; Financial economics","retraction":null,"screen_n_in":null,"score":{"opus":0.17448148640032,"gpt":0.4240910821767344,"spread":0.2496095957764144,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003870737,0.00008770267,0.0002980093,0.0002365008,0.000593418,0.0000693179,0.0001633466,0.00005103411,0.001239373],"category_scores_gemma":[0.001524604,0.00009575739,0.0000269546,0.0004695726,0.0004581657,0.00009027067,0.0001928444,0.0002836621,0.00001439237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004603841,"about_ca_system_score_gemma":0.00007741207,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006250318,"about_ca_topic_score_gemma":0.000002299748,"domain_scores_codex":[0.9986721,0.00009902264,0.0005553131,0.0003507583,0.0001256351,0.0001971946],"domain_scores_gemma":[0.9987132,0.0006779716,0.00007861255,0.0002768179,0.000157042,0.00009636633],"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.00001471649,0.0001564681,0.00003503478,0.00005753634,0.00001119713,3.145831e-7,0.0003897322,0.001150801,0.00004813409,0.9901978,0.00004018334,0.007898047],"study_design_scores_gemma":[0.0004422931,0.0002974072,0.001330581,0.00001658101,0.000006750734,0.00001602385,0.0008600107,0.4618312,0.0002260846,0.5339662,0.0008415017,0.0001653956],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004682404,0.0002542523,0.9785409,0.002086914,0.00003087734,0.0005487852,0.0001580255,0.00001328686,0.01368458],"genre_scores_gemma":[0.6550658,0.00005253846,0.3442563,0.00012412,0.00002063214,0.0003279018,0.000014149,0.0000108817,0.000127705],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6503834,"threshold_uncertainty_score":0.9996736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4414358199","doi":"10.1007/s00186-025-00906-2","title":"On the probability that the optimal solution of the Weber location problem is at a demand point","year":2025,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":0,"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; Royal Ottawa Mental Health Centre","funders":"","keywords":"Probability distribution; Point (geometry); Euclidean geometry; Set (abstract data type); Random walk; Distribution (mathematics); Facility location problem; Convergence (economics); Plane (geometry)","retraction":null,"screen_n_in":null,"score":{"opus":0.1725629340062996,"gpt":0.422044377953618,"spread":0.2494814439473185,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.009848882,0.0001127574,0.000169429,0.0001430972,0.0008216173,0.0001319553,0.0006345537,0.00005554924,0.0009735497],"category_scores_gemma":[0.003386489,0.00005248815,0.0001059303,0.001262638,0.0005066058,0.0002135452,0.000665457,0.0002456801,0.00008669134],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000817742,"about_ca_system_score_gemma":0.00006718685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003479222,"about_ca_topic_score_gemma":0.000329051,"domain_scores_codex":[0.9978284,0.0005660533,0.0004750217,0.0002403104,0.0006675228,0.0002227278],"domain_scores_gemma":[0.9975594,0.0007066829,0.00004423454,0.0008885161,0.0007923809,0.000008798434],"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.00003760426,0.0003345173,0.0001024042,0.0007728304,0.00005081867,2.881151e-8,0.0005035928,0.01230365,0.000775106,0.973597,0.009486394,0.00203598],"study_design_scores_gemma":[0.0003174237,0.00002668392,0.002885213,0.0002957864,0.00007248303,3.713586e-7,0.001439883,0.6967396,0.01134335,0.2836789,0.003077971,0.0001223942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.295954,0.0001003613,0.4808159,0.1749338,0.0002030043,0.00561351,0.000006434159,0.00004382269,0.0423292],"genre_scores_gemma":[0.9657403,0.000008264614,0.02844265,0.0009337644,0.00003132638,0.000571799,0.000003759393,0.00001030741,0.004257799],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6899182,"threshold_uncertainty_score":0.9999397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4403192332","doi":"10.1007/s00186-024-00866-z","title":"How to project onto the intersection of a closed affine subspace and a hyperplane","year":2024,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Advanced Numerical Analysis Techniques","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Hyperplane; Affine transformation; Intersection (aeronautics); Subspace topology; Mathematics; Affine hull; Affine space; Combinatorics; Computer science; Pure mathematics; Mathematical analysis; Geography","retraction":null,"screen_n_in":null,"score":{"opus":0.1063795417632415,"gpt":0.4923671252131184,"spread":0.3859875834498769,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001611776,0.00008013154,0.0002187708,0.0002321128,0.00004894145,0.00009094828,0.0001427508,0.00004221478,0.00003186724],"category_scores_gemma":[0.001371296,0.00004946183,0.00004577183,0.0009432647,0.0001241102,0.000105646,0.00008069328,0.0002421991,0.000003353706],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004938189,"about_ca_system_score_gemma":0.00002083886,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003553128,"about_ca_topic_score_gemma":0.00004596961,"domain_scores_codex":[0.9989806,0.0002685413,0.0002097774,0.0001401801,0.0002524971,0.0001484152],"domain_scores_gemma":[0.9985284,0.001042588,0.000005264302,0.0002413863,0.0001400337,0.0000422834],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002187174,0.00009018689,0.000003356522,0.0009708948,0.000147303,0.000002649073,0.003451812,0.001718681,0.7738306,0.0839088,0.000891995,0.1349619],"study_design_scores_gemma":[0.00006863386,0.0002900848,0.00002398838,0.0002617293,0.00003481858,0.00001698234,0.001573543,0.6870628,0.2892838,0.01803817,0.003223066,0.0001223537],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04403308,0.0002671751,0.9522811,0.001484533,0.00001505257,0.0004988297,0.000005764839,0.0001003415,0.001314154],"genre_scores_gemma":[0.4167261,0.00002330352,0.5826492,0.000003232772,0.00001776918,0.0001328115,9.35426e-7,0.00001368866,0.0004330503],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6853441,"threshold_uncertainty_score":0.2016995,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2067468128","doi":"10.1007/s00186-006-0139-4","title":"Correction on “Optimal portfolio selection when stock prices follow an jump-diffusion process”","year":2007,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":0,"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":"Jump diffusion; Portfolio; Jump; Selection (genetic algorithm); Stock (firearms); Computer science; Stock price; Econometrics; Mathematical optimization; Mathematics; Financial economics; Economics; Artificial intelligence; Series (stratigraphy); Physics; Biology","retraction":null,"screen_n_in":null,"score":{"opus":0.1531988684995458,"gpt":0.4507471260640896,"spread":0.2975482575645438,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005552017,0.0001499038,0.0003767783,0.000677641,0.0005015188,0.0001084224,0.0003178875,0.0001729914,0.0004977881],"category_scores_gemma":[0.002652566,0.0001487263,0.00008225111,0.001107274,0.0001360342,0.0003144056,0.00005941855,0.0004174112,0.000169504],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000118874,"about_ca_system_score_gemma":0.0000847759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001536344,"about_ca_topic_score_gemma":0.00005302781,"domain_scores_codex":[0.997997,0.00004654376,0.0008471457,0.0004829828,0.0002134935,0.0004128306],"domain_scores_gemma":[0.998247,0.0006145812,0.0001308748,0.0003624645,0.0004871,0.0001579374],"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.00007338581,0.0009288446,0.0001496738,0.0000780413,0.00001929054,6.740052e-7,0.001200573,0.0005982444,0.001282458,0.9786801,0.0001882137,0.01680045],"study_design_scores_gemma":[0.0004172391,0.0009903482,0.002439552,0.00007361032,0.00001136042,0.00001522164,0.0007050445,0.2684389,0.007763088,0.7175567,0.001297589,0.0002913186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06780585,0.00007379401,0.9144421,0.0001962512,0.000141191,0.0006600801,0.00001483115,0.00004807099,0.01661789],"genre_scores_gemma":[0.3682649,0.000009832987,0.6299131,0.00003876665,0.0001714247,0.0002715936,0.00001664148,0.0000338433,0.001279982],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.300459,"threshold_uncertainty_score":0.6064884,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}