{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":141,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":141,"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":"a689e6b5b14a","filters":{"venue":"Mathematics of Operations Research"}},"results":[{"id":"W2062059813","doi":"10.1287/moor.26.2.248.10558","title":"A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces","year":2001,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":418,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Okanagan University College","funders":"","keywords":"Mathematics; Hilbert space; Monotone polygon; Simple (philosophy); Convergence (economics); Applied mathematics; Class (philosophy); Weak convergence; Mathematical optimization; Pure mathematics; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1493640761500596,"gpt":0.4924049965811565,"spread":0.3430409204310969,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002445469,0.00008316593,0.0002028203,0.0005672827,0.0001917294,0.0001916566,0.000671907,0.00004360499,0.000133944],"category_scores_gemma":[0.001150988,0.00007495198,0.00005515123,0.001760939,0.00004127878,0.0003228112,0.0002346544,0.0001020145,0.00003809212],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006947727,"about_ca_system_score_gemma":0.0001843209,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001038389,"about_ca_topic_score_gemma":0.0002176951,"domain_scores_codex":[0.9984607,0.0001697375,0.0004188395,0.0002588659,0.0004342692,0.0002575666],"domain_scores_gemma":[0.9981133,0.0005470649,0.00003576003,0.0004598922,0.000751495,0.00009246525],"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.000005602806,0.0003285347,0.0003783358,0.00004053453,0.00002507756,6.620182e-7,0.001923333,0.154121,0.002985756,0.8392646,0.0002240645,0.0007024742],"study_design_scores_gemma":[0.0001953766,0.00005577598,0.0002704451,0.00002327245,0.000003259461,0.000001873426,0.0002097415,0.9907671,0.002632257,0.003707814,0.002049788,0.00008329142],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006912806,0.00001929323,0.9848978,0.005593639,0.00003207926,0.0006022069,0.000004741185,0.00001864663,0.001918817],"genre_scores_gemma":[0.09992158,0.00002502226,0.8961238,0.0000350927,0.00001682844,0.000233898,0.000006448874,0.000007781133,0.003629586],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8366461,"threshold_uncertainty_score":0.3056453,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2551153860","doi":"10.1287/moor.2016.0817","title":"A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications","year":2016,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":342,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia","funders":"","keywords":"Lipschitz continuity; Mathematics; Sublinear function; Convexity; Gradient descent; Subgradient method; Lemma (botany); Uniqueness; Applied mathematics; Pointwise; Rate of convergence; Bregman divergence; Convex function; Mathematical optimization; Measure (data warehouse); Regular polygon; Mathematical analysis; Key (lock); Computer science; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.06474276344782105,"gpt":0.3797376502487932,"spread":0.3149948868009722,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007717144,0.0001021061,0.0001963199,0.0002228025,0.0001701878,0.00006941197,0.0001755727,0.00005896358,0.00004163542],"category_scores_gemma":[0.0002443059,0.00007442963,0.00003044126,0.0003534677,0.0001474589,0.00008647882,0.0001095899,0.0001275989,0.00001479679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004073866,"about_ca_system_score_gemma":0.00002050142,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001207212,"about_ca_topic_score_gemma":0.00003460054,"domain_scores_codex":[0.9990362,0.0000805397,0.0002886166,0.0001549094,0.0002283764,0.000211354],"domain_scores_gemma":[0.9986481,0.0003612457,0.00001597407,0.0004587609,0.0004435813,0.00007232185],"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.0000105881,0.0004682164,0.0002187274,0.000661899,0.0002322212,0.000004812386,0.002779719,0.001507942,0.5435165,0.3239858,0.007662383,0.1189513],"study_design_scores_gemma":[0.00130735,0.0002978643,0.0008015786,0.00180941,0.0001036861,0.00007428722,0.0007235745,0.3508985,0.4913865,0.06364337,0.08803673,0.0009171325],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05379301,0.0007621305,0.9382672,0.0004904674,0.00002216967,0.001062386,0.00002495163,0.0002284266,0.005349273],"genre_scores_gemma":[0.5878187,0.0006140092,0.4108951,0.000008681486,0.00004231521,0.0002485413,0.000004294684,0.00003191053,0.0003363495],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5340257,"threshold_uncertainty_score":0.3035152,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3123587043","doi":"10.1287/moor.1120.0577","title":"External Risk Measures and Basel Accords","year":2013,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":169,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Hong Kong University of Science and Technology; Georgia State University; University of Alberta; National Science Foundation","keywords":"Basel II; Operational risk; Dynamic risk measure; Risk measure; Risk-weighted asset; Coherent risk measure; Capital requirement; Mathematics; Risk-adjusted return on capital; Robustness (evolution); Actuarial science; Measure (data warehouse); Econometrics; Risk analysis (engineering); Risk management; Value at risk; Economics; Computer science; Business; Finance; Data mining; Microeconomics; Profit (economics)","retraction":null,"screen_n_in":null,"score":{"opus":0.2633710761696301,"gpt":0.4807259011762479,"spread":0.2173548250066178,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005887613,0.00007662812,0.0001831388,0.000469073,0.0003712803,0.0006578127,0.000446131,0.00005540436,0.0009047976],"category_scores_gemma":[0.006765632,0.00005173907,0.0000395135,0.0006932968,0.0002092275,0.000521102,0.0001542623,0.0001888392,0.000427991],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001240898,"about_ca_system_score_gemma":0.00009594614,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005272504,"about_ca_topic_score_gemma":0.0001036295,"domain_scores_codex":[0.9969019,0.0003311987,0.0005652414,0.0002174626,0.001787706,0.0001965243],"domain_scores_gemma":[0.9962667,0.001104979,0.00006582599,0.0005414105,0.001909899,0.0001112348],"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.00003410573,0.001384281,0.06529111,0.00005912543,0.0001032861,0.000006984447,0.02055011,0.06640042,0.02566162,0.1211919,0.05573585,0.6435812],"study_design_scores_gemma":[0.0003844711,0.000150682,0.0214764,0.0000430559,0.00001178797,0.00001457509,0.004129693,0.8151718,0.005196451,0.1513365,0.001902373,0.0001822169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8699831,0.0002071179,0.121074,0.0004276829,0.00004335893,0.000459838,0.00001465598,0.00001207661,0.007778154],"genre_scores_gemma":[0.9099837,0.0008993789,0.08481812,0.00000963104,0.0000388016,0.00005704776,0.000001727864,0.000009515116,0.004182098],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7487714,"threshold_uncertainty_score":0.9906899,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118679801","doi":"10.1287/moor.1080.0366","title":"Queue-and-Idleness-Ratio Controls in Many-Server Service Systems","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":158,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Queue; Computer science; Limiting; State space; Routing (electronic design automation); Mathematical optimization; Multilevel queue; Service (business); Class (philosophy); State (computer science); Distributed computing; Computer network; Operations research; Queue management system; Mathematics; Engineering; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0640631890681417,"gpt":0.3492090248340123,"spread":0.2851458357658707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002248207,0.0001209992,0.0003118584,0.0006058608,0.0002185012,0.0003853853,0.0003066238,0.00006419582,0.00008101034],"category_scores_gemma":[0.0006347444,0.0001081795,0.00003556906,0.001146591,0.00006071967,0.0009732717,0.0001121534,0.0002018493,0.0001174197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004012626,"about_ca_system_score_gemma":0.00003165106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005885445,"about_ca_topic_score_gemma":0.0005974564,"domain_scores_codex":[0.9985066,0.0000613357,0.0004846459,0.0002135347,0.0004677223,0.0002661841],"domain_scores_gemma":[0.9985586,0.0001961313,0.0000666628,0.0004113524,0.0007525206,0.00001478044],"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.00001715679,0.0002462796,0.0001925144,0.0004368857,0.00002256194,0.000005533228,0.0003457273,0.08541654,0.006093321,0.9069145,0.00006694457,0.0002420133],"study_design_scores_gemma":[0.0005268104,0.00001766163,0.0005065583,0.0002504735,0.00002623431,0.000002099825,0.001707967,0.9536304,0.0002814078,0.04253471,0.0003509756,0.0001647415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.982115,0.0002354774,0.00672758,0.002840088,0.0000389486,0.0007962104,0.000003385876,0.00005229424,0.007191054],"genre_scores_gemma":[0.9978937,0.00001540121,0.001063538,0.0001965083,0.0001171195,0.00005672788,0.00001298462,0.00001535727,0.0006286822],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8682138,"threshold_uncertainty_score":0.4411434,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2071870255","doi":"10.1287/moor.1110.0489","title":"Appointment Scheduling with Discrete Random Durations","year":2011,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":151,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia; Western University","funders":"","keywords":"Submodular set function; Mathematical optimization; Schedule; Scheduling (production processes); Overtime; Discrete time and continuous time; Mathematics; Sequence (biology); Integer programming; Probability distribution; Regular polygon; Job shop scheduling; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.3306439062779563,"gpt":0.509146559540775,"spread":0.1785026532628188,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002969222,0.0001419786,0.0003036015,0.0003641897,0.002026365,0.00003633295,0.0002455593,0.0001399825,0.001552175],"category_scores_gemma":[0.0008678079,0.0001030556,0.00004570445,0.0007399917,0.0001817184,0.0002982787,0.00009689776,0.0006593689,0.0001949563],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001109678,"about_ca_system_score_gemma":0.0009019334,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004619815,"about_ca_topic_score_gemma":0.0009365405,"domain_scores_codex":[0.9970899,0.0006672453,0.0008826783,0.000256495,0.0006220642,0.000481638],"domain_scores_gemma":[0.9966804,0.0004729073,0.00008306387,0.0005979215,0.001999641,0.0001659999],"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.0004142557,0.001923059,0.006652791,0.001744075,0.0002880716,0.00001509966,0.1375726,0.07430843,0.005026625,0.7701024,0.0009257084,0.001026828],"study_design_scores_gemma":[0.007469069,0.001596968,0.003028069,0.00234678,0.0001204965,0.00001849046,0.08494646,0.8858303,0.005283643,0.007197451,0.001278765,0.0008835454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4211821,0.00007158001,0.5088632,0.002538941,0.000125387,0.003829247,0.00004197036,0.0001083453,0.06323928],"genre_scores_gemma":[0.6627735,0.00005048047,0.3349367,0.00003317477,0.0000545838,0.0006101553,0.000043305,0.00002892401,0.001469207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8115218,"threshold_uncertainty_score":0.9993606,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987292194","doi":"10.1287/moor.2014.0663","title":"Partial Monitoring—Classification, Regret Bounds, and Algorithms","year":2014,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":123,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"","keywords":"Regret; Hindsight bias; Logarithm; Minimax; Mathematics; Outcome (game theory); Action (physics); Mathematical optimization; Mathematical economics; Statistics; Psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.4399227455027039,"gpt":0.5509132329952277,"spread":0.1109904874925237,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.01331864,0.0001398347,0.0003619232,0.0007266058,0.0007185513,0.0007027714,0.0009872518,0.000105246,0.0002510945],"category_scores_gemma":[0.01849598,0.0001055416,0.000057395,0.001454317,0.0008139422,0.0005053089,0.0003940274,0.0004196684,0.0002935521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000605054,"about_ca_system_score_gemma":0.0001861152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003706817,"about_ca_topic_score_gemma":0.0000227815,"domain_scores_codex":[0.993762,0.0006443029,0.0009071517,0.0005319063,0.003678105,0.00047655],"domain_scores_gemma":[0.9920276,0.003616151,0.00008345014,0.001233094,0.002815476,0.0002241752],"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.0001017524,0.00243794,0.008668742,0.0003902378,0.0001870971,0.00001780123,0.01859344,0.01066301,0.06138299,0.4737054,0.01676194,0.4070896],"study_design_scores_gemma":[0.0006105094,0.000304937,0.003805149,0.00007394556,0.00000702436,0.0000190896,0.004450608,0.8376048,0.02250534,0.1170473,0.01332193,0.0002493899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3317425,0.000330385,0.6536236,0.004022265,0.0003224887,0.001248085,0.00004804568,0.00007511886,0.008587533],"genre_scores_gemma":[0.8922712,0.00009161435,0.1027601,0.000006189352,0.0002646275,0.0001251567,0.000005760638,0.00002628303,0.004449041],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8269418,"threshold_uncertainty_score":0.9897717,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169572499","doi":"10.1287/moor.28.2.382.14484","title":"Optimal Replacement Under Partial Observations","year":2003,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":106,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Mathematics; Optimal stopping; Bellman equation; Piecewise; State (computer science); Projection (relational algebra); Markov process; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.109759728247854,"gpt":0.3453108476573518,"spread":0.2355511194094978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009295926,0.00006996231,0.0001120587,0.000109189,0.0001502143,0.00005716832,0.0001114451,0.00005181933,0.0002636524],"category_scores_gemma":[0.0004817379,0.0000658688,0.00003153292,0.0003623918,0.00008325187,0.0001559153,0.00002025792,0.000146257,0.00003921704],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007059743,"about_ca_system_score_gemma":0.00006645494,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008326698,"about_ca_topic_score_gemma":0.00001704327,"domain_scores_codex":[0.9990004,0.00006044342,0.0003074423,0.0001050707,0.0003172461,0.000209372],"domain_scores_gemma":[0.9991356,0.0001072415,0.000008673089,0.0003463364,0.0003546517,0.00004752978],"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.000001167329,0.00008564183,0.00001396344,0.00005822724,0.00001305588,1.368593e-7,0.000451417,0.823271,0.004355598,0.1710136,0.0007188249,0.00001739061],"study_design_scores_gemma":[0.0002122306,0.0000559841,0.00006683576,0.0000361377,0.000006269717,0.000002283474,0.001158348,0.976741,0.01768597,0.002394413,0.001545173,0.00009533847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4376779,0.00006743844,0.5486867,0.0002648884,0.00009861442,0.0005499463,0.000009522189,0.00007753965,0.01256752],"genre_scores_gemma":[0.8037218,0.00008505094,0.1949344,0.000006394983,0.00001146406,0.0001212171,0.00001450756,0.00001941725,0.001085704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.366044,"threshold_uncertainty_score":0.2886809,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156211713","doi":"10.1287/moor.1090.0397","title":"Markov Decision Processes with Arbitrary Reward Processes","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":102,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov decision process; Regret; Hindsight bias; Reinforcement learning; Mathematical optimization; Mathematics; Q-learning; Markov process; Realization (probability); Function (biology); Trajectory; Markov chain; Process (computing); Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.205043330395209,"gpt":0.5069362652545172,"spread":0.3018929348593081,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.005981836,0.0002159745,0.000483933,0.001278002,0.0006492659,0.0007381237,0.001850633,0.0001090678,0.000551271],"category_scores_gemma":[0.0491695,0.0001346057,0.00005413499,0.006631904,0.0005196418,0.001168688,0.0002331456,0.0005318077,0.0002831775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007448259,"about_ca_system_score_gemma":0.002212335,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001257019,"about_ca_topic_score_gemma":0.0003074862,"domain_scores_codex":[0.9910055,0.0002257569,0.001019356,0.0006615821,0.006440941,0.000646831],"domain_scores_gemma":[0.9822537,0.00698715,0.0001032933,0.001283109,0.009140673,0.0002321256],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.003492234,0.02207252,0.003188232,0.006688403,0.0004561912,0.0007507571,0.05096899,0.1515315,0.01873965,0.04335505,0.07353304,0.6252235],"study_design_scores_gemma":[0.003538978,0.005989485,0.003038308,0.002677854,0.00003969661,0.0003287962,0.01844151,0.06616969,0.1143317,0.7757308,0.008209879,0.001503256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3998399,0.0013592,0.5688211,0.004250044,0.00006961729,0.002887183,0.00009140901,0.0001466088,0.02253491],"genre_scores_gemma":[0.6772392,0.000274021,0.3175356,0.00003598225,0.00008609535,0.0001142259,0.00001029622,0.00003215648,0.00467244],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7323758,"threshold_uncertainty_score":0.9588398,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164655620","doi":"10.1287/moor.1070.0285","title":"A 2-Approximation Algorithm for Stochastic Inventory Control Models with Lost Sales","year":2008,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":100,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Independent and identically distributed random variables; Dual (grammatical number); Mathematical optimization; Multiplicative function; Inventory control; Computer science; Lost sales; Marginal cost; Autoregressive model; Holding cost; Order (exchange); Mathematical economics; Random variable; Mathematics; Econometrics; Operations research; Economics; Microeconomics; Statistics; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.1217961590905095,"gpt":0.3130105024189769,"spread":0.1912143433284674,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001338699,0.0001311798,0.0002192199,0.0005214109,0.0004236676,0.0001423502,0.0002731112,0.00004413035,0.0001349579],"category_scores_gemma":[0.0001885168,0.0001076847,0.00005792045,0.0004307344,0.0002226894,0.0008282093,0.00008311254,0.0001128321,0.00009749577],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006259392,"about_ca_system_score_gemma":0.0000909521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008624454,"about_ca_topic_score_gemma":0.00006260638,"domain_scores_codex":[0.998307,0.00002426969,0.0003362799,0.0002143494,0.0008265295,0.0002915701],"domain_scores_gemma":[0.9982369,0.0001023018,0.00006570989,0.0003274279,0.001248637,0.00001902159],"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.00009174788,0.002046723,0.00008438048,0.001684559,0.0002995111,0.000008395527,0.00232338,0.2933018,0.0005862148,0.6775249,0.01767047,0.004378001],"study_design_scores_gemma":[0.001256573,0.00004712913,0.00001150428,0.0000812455,0.00003766034,0.000002437001,0.001112502,0.9877509,0.00004629367,0.009062937,0.0004674918,0.0001233177],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04728898,0.00008785148,0.9407428,0.0005091522,0.0000642454,0.003120446,0.00001908647,0.00004656182,0.008120898],"genre_scores_gemma":[0.9612408,0.000006243095,0.03611627,0.0001170692,0.0002875142,0.0008527811,0.00009842085,0.00004233437,0.00123852],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9139519,"threshold_uncertainty_score":0.4391254,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2100210445","doi":"10.1287/moor.27.3.567.317","title":"Approximating Subdifferentials by Random Sampling of Gradients","year":2002,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":98,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Lipschitz continuity; Differentiable function; Almost everywhere; Subderivative; Convex hull; Euclidean space; Function (biology); Euclidean geometry; Applied mathematics; Convex function; Point (geometry); Mathematical analysis; Regular polygon; Pure mathematics; Mathematical optimization; Convex optimization; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.3146180574641937,"gpt":0.465711267282209,"spread":0.1510932098180153,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002582384,0.0001814631,0.0005947209,0.0005239467,0.0003396499,0.00008390332,0.0005783876,0.0001104521,0.00129912],"category_scores_gemma":[0.007311989,0.0001621131,0.0001125165,0.0009758056,0.0003548115,0.0002449708,0.0002364823,0.0003888319,0.0000365999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007864443,"about_ca_system_score_gemma":0.00004050921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001984293,"about_ca_topic_score_gemma":0.000009122879,"domain_scores_codex":[0.9960477,0.000324881,0.001252926,0.0002901189,0.001580692,0.0005037149],"domain_scores_gemma":[0.9953815,0.002165482,0.0001655062,0.00071985,0.001437449,0.0001302115],"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.0001511382,0.01699024,0.0003462413,0.01039734,0.001003232,0.000009919021,0.04934205,0.03623422,0.3446092,0.5003008,0.02158114,0.01903445],"study_design_scores_gemma":[0.002080507,0.0001567599,0.000004495143,0.0003290809,0.00002736775,0.000007772808,0.00197785,0.8807395,0.06961699,0.04470382,0.00009475474,0.0002611315],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1960595,0.0002958442,0.7964155,0.0001980299,0.00004569768,0.001689947,0.0001110394,0.00006320276,0.005121211],"genre_scores_gemma":[0.348828,0.0001606193,0.6476347,0.000002916111,0.0000282513,0.0001518056,0.00002465645,0.00006248232,0.003106537],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8445053,"threshold_uncertainty_score":0.9996138,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036785419","doi":"10.1287/moor.28.1.154.14259","title":"A Generalized Stochastic Differential Utility","year":2003,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Isoelastic utility; Stochastic differential equation; Mathematics; Risk aversion (psychology); Expected utility hypothesis; Mathematical economics; Mathematical optimization; Quadratic variation; Monotonic function; Generalization; Portfolio; Econometrics; Brownian motion; Applied mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.1407506360794377,"gpt":0.3447168680473967,"spread":0.203966231967959,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008767205,0.00009203603,0.0002889973,0.0002364626,0.0002775792,0.00006938724,0.0002545469,0.000068824,0.0007800081],"category_scores_gemma":[0.00129763,0.00009656062,0.00006962622,0.0005234195,0.0001564735,0.00008341997,0.00005537739,0.0001675436,0.0003276571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003471332,"about_ca_system_score_gemma":0.0000741328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001199919,"about_ca_topic_score_gemma":0.00003086096,"domain_scores_codex":[0.9987719,0.0000141368,0.0005877861,0.0002503004,0.0001101322,0.0002657677],"domain_scores_gemma":[0.9990525,0.0001199022,0.00006100745,0.00044925,0.0002466264,0.000070729],"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.000002221397,0.0003031581,0.00002242524,0.00004285347,0.00001360986,1.433713e-7,0.0004415626,0.0002227977,0.0002643076,0.9985324,0.00007809092,0.00007640202],"study_design_scores_gemma":[0.0004392974,0.0000544158,0.0003393571,0.00001870394,0.000004924439,0.000003594248,0.0002005623,0.07080179,0.0005900579,0.926569,0.0008225572,0.0001557153],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1006506,0.0002926901,0.8884792,0.0001422327,0.00005656873,0.0004067405,0.00009540855,0.00001526504,0.009861256],"genre_scores_gemma":[0.9685687,0.00001215294,0.03053014,0.000007545592,0.00002893577,0.0002126219,0.00001055751,0.00001562663,0.0006136924],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8679181,"threshold_uncertainty_score":0.8540542,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019408419","doi":"10.1287/moor.1070.0294","title":"Truncation Strategies in Matching Markets","year":2008,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":78,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Truncation (statistics); Ranking (information retrieval); Matching (statistics); Linear programming; Mathematical economics; Mathematics; Advice (programming); Complete information; Mathematical optimization; Computer science; Statistics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1842064859521359,"gpt":0.3546812017191083,"spread":0.1704747157669724,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003037935,0.00006142841,0.0002185885,0.0004344115,0.0001686278,0.00006113377,0.0002038188,0.00005242649,0.0002141837],"category_scores_gemma":[0.0003542491,0.00006625259,0.00003325423,0.0003865466,0.00009985852,0.000271571,0.00003981368,0.0001712512,0.0002686796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004907611,"about_ca_system_score_gemma":0.00005317876,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003035961,"about_ca_topic_score_gemma":0.00009227308,"domain_scores_codex":[0.9989296,0.00006936048,0.000582643,0.0001500738,0.00008255481,0.000185757],"domain_scores_gemma":[0.9993698,0.0001825084,0.00005451085,0.0002766375,0.00008895342,0.00002758834],"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.000003768701,0.0001624731,0.001401811,0.000109268,0.000007527106,0.000002078248,0.009105158,0.002486461,0.0005056038,0.9861266,0.00006281285,0.00002643378],"study_design_scores_gemma":[0.000947787,0.0001349265,0.02917628,0.0002902265,0.000002034378,0.00004736791,0.01474353,0.09093818,0.001631636,0.8610438,0.0006581206,0.0003861203],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9418572,0.000168671,0.006096594,0.0001309557,0.00004115732,0.0002346481,0.00001247661,0.00001163893,0.05144671],"genre_scores_gemma":[0.9922307,0.00004762511,0.00564478,0.000003266073,0.00002376108,0.00004100996,0.000005394962,0.00001148307,0.001991949],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1250828,"threshold_uncertainty_score":0.3453423,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008297046","doi":"10.1287/moor.1090.0409","title":"Fluid Limits for Shortest Remaining Processing Time Queues","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Queue; Mathematical optimization; Infimum and supremum; Logarithm; Uniqueness; Applied mathematics; Computer science; Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.09283470670110919,"gpt":0.3842832528348863,"spread":0.2914485461337771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002172807,0.0001178083,0.0002503546,0.0005048125,0.0005795195,0.0003666077,0.0003391255,0.00005218988,0.0001082947],"category_scores_gemma":[0.002338344,0.0001064531,0.00007440264,0.000868749,0.00009519199,0.0009490772,0.00006237541,0.000135692,0.000117227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003173993,"about_ca_system_score_gemma":0.00005007939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009240198,"about_ca_topic_score_gemma":0.00001921372,"domain_scores_codex":[0.998621,0.00001988125,0.0004029699,0.0002181494,0.0004269551,0.0003109845],"domain_scores_gemma":[0.9981626,0.0002371581,0.00006728301,0.0003307751,0.001187802,0.0000143403],"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.00007084951,0.001021497,0.00004431923,0.0009392136,0.00008201925,0.00000586029,0.001493254,0.07599061,0.1756191,0.7142149,0.003049269,0.02746918],"study_design_scores_gemma":[0.0002005863,0.00004146513,0.00001815061,0.0002436052,0.00004260693,0.000001312836,0.0006984659,0.9191762,0.003410325,0.07494315,0.001060247,0.0001639352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7344474,0.0004567395,0.1684169,0.007098844,0.00007409143,0.00290205,0.00001565448,0.0004877606,0.08610062],"genre_scores_gemma":[0.9536307,0.000004836434,0.04372371,0.0001231559,0.0003230569,0.00005944829,0.00003506005,0.00002890373,0.002071165],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8431855,"threshold_uncertainty_score":0.4457255,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167508847","doi":"10.1287/moor.26.4.796.10012","title":"When Does the Positive Semidefiniteness Constraint Help in Lifting Procedures?","year":2001,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":71,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"National Science Foundation","keywords":"Constraint (computer-aided design); Mathematics; Lift (data mining); Integer programming; Mathematical optimization; Integer (computer science); Mathematical economics; Computer science; Geometry; Data mining","retraction":null,"screen_n_in":null,"score":{"opus":0.08849708786235158,"gpt":0.3650675527512243,"spread":0.2765704648888727,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002118496,0.0000900999,0.0001543805,0.0002903421,0.0004061974,0.0003223072,0.001068167,0.00004280078,0.00004357453],"category_scores_gemma":[0.0009811684,0.00005543032,0.00004285206,0.0009547812,0.0003380658,0.0002812234,0.0004339143,0.0003291659,0.00001716597],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003603493,"about_ca_system_score_gemma":0.0002386024,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001736547,"about_ca_topic_score_gemma":0.0007086226,"domain_scores_codex":[0.9983402,0.0001939504,0.0003582724,0.0002190634,0.0005806836,0.0003078404],"domain_scores_gemma":[0.9979738,0.0009296383,0.00003095677,0.000532992,0.00048638,0.00004623285],"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.000002922846,0.0003569889,0.0004193033,0.000088237,0.00001753915,0.00001922019,0.01760557,0.00132198,0.001348403,0.9730621,0.0001128124,0.005644945],"study_design_scores_gemma":[0.0003999732,0.0001157682,0.001165964,0.0005520443,0.000003970756,0.0001152273,0.007175933,0.6273577,0.006007119,0.3566633,0.0002091795,0.000233904],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5485546,0.0002259236,0.4207138,0.01392463,0.0001320531,0.001451298,0.00002340873,0.00008287226,0.01489138],"genre_scores_gemma":[0.8881479,0.00005054568,0.111283,0.00005402903,0.00003273906,0.00008332812,0.000002476687,0.000007178231,0.0003388174],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6260357,"threshold_uncertainty_score":0.3124183,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4233783080","doi":"10.1287/moor.2015.0755","title":"Joint Mixability","year":2016,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":68,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Marginal distribution; Joint probability distribution; Random variable; Probabilistic logic; Monotone polygon; Applied mathematics; Generator (circuit theory); Combinatorics; Mathematical optimization; Statistics; Power (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.5300525204133071,"gpt":0.5403228146903195,"spread":0.01027029427701243,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.009664,0.00006272436,0.0001935974,0.0004302374,0.0002121485,0.0001486272,0.0005062844,0.00005281461,0.001623661],"category_scores_gemma":[0.01464698,0.00003187492,0.00006804122,0.0009047525,0.0002858102,0.0003129324,0.0001543185,0.00008126854,0.0008710479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003515179,"about_ca_system_score_gemma":0.0001595697,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003099816,"about_ca_topic_score_gemma":0.00005357505,"domain_scores_codex":[0.9966426,0.0003054902,0.000745017,0.0002377987,0.001865293,0.0002037996],"domain_scores_gemma":[0.9953964,0.001475218,0.00004994616,0.0009230279,0.002071093,0.00008436815],"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.00003428712,0.00175387,0.007922292,0.00004902082,0.00005119411,0.000005869341,0.008111841,0.0100036,0.1282784,0.6250137,0.05068293,0.168093],"study_design_scores_gemma":[0.001178049,0.000429315,0.01074562,0.0001764913,0.00001265332,0.00001878885,0.00363869,0.1316818,0.1338453,0.6962941,0.02154954,0.0004295491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7543073,0.00004224463,0.214079,0.004562229,0.00009327615,0.000504452,0.00003211731,0.00002313526,0.02635627],"genre_scores_gemma":[0.9484302,0.00009819037,0.04076837,0.000006890839,0.00003172663,0.00002912521,0.000001240261,0.000007539546,0.01062668],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.194123,"threshold_uncertainty_score":0.9999069,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2061220204","doi":"10.1287/moor.1060.0219","title":"Constraint Qualifications and KKT Conditions for Bilevel Programming Problems","year":2006,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Constraint (computer-aided design); Mathematics; Bilevel optimization; Mathematical optimization; Constraint programming; Constraint logic programming; Constraint satisfaction; Binary constraint; Set (abstract data type); Nonlinear programming; Sequence (biology); Optimization problem; Nonlinear system; Computer science; Stochastic programming","retraction":null,"screen_n_in":null,"score":{"opus":0.1242592753038148,"gpt":0.4028250776607806,"spread":0.2785658023569658,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000994016,0.0000671629,0.0001270676,0.0003234395,0.0004964239,0.0002995167,0.0002733683,0.00003889916,0.00003256092],"category_scores_gemma":[0.0002485532,0.00006012104,0.00004438188,0.0006714138,0.0001666327,0.0002613249,0.0000739058,0.00007029188,0.000008030986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002333473,"about_ca_system_score_gemma":0.0001514037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007980606,"about_ca_topic_score_gemma":0.00007961901,"domain_scores_codex":[0.998853,0.00006212859,0.0003865365,0.0001955003,0.0003327217,0.0001701696],"domain_scores_gemma":[0.998116,0.0004220253,0.000044446,0.0002932636,0.001076046,0.00004828612],"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":[2.483205e-7,0.0002599103,0.00002635687,0.00005650507,0.00001706128,7.814189e-8,0.0005001245,0.02139419,0.002539957,0.9745247,0.0002726225,0.0004081864],"study_design_scores_gemma":[0.0002101781,0.00004020341,0.0001364333,0.00002388006,0.000009507292,0.000004055077,0.0002623974,0.9375185,0.0005604354,0.06013396,0.001017247,0.00008326025],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002049018,0.00003135253,0.9920375,0.003865556,0.00001306671,0.0007109566,0.00005698434,0.00003748474,0.001198045],"genre_scores_gemma":[0.3960365,0.000008124637,0.6028906,0.00001031961,0.00001867318,0.0002414143,0.0001117245,0.00000582417,0.000676788],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9161243,"threshold_uncertainty_score":0.3818142,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3123924727","doi":"10.1287/moor.2019.1020","title":"Characterization, Robustness, and Aggregation of Signed Choquet Integrals","year":2020,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":66,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Choquet integral; Monotonic function; Choquet theory; Additive function; Robustness (evolution); Class (philosophy); Regular polygon; Invariant (physics); Characterization (materials science); Pure mathematics; Applied mathematics; Mathematical economics; Discrete mathematics; Subderivative; Convex optimization; Mathematical analysis; Artificial intelligence; Computer science; Fuzzy logic","retraction":null,"screen_n_in":null,"score":{"opus":0.2841848051385171,"gpt":0.4545010382229214,"spread":0.1703162330844042,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002580665,0.00007990722,0.0002752097,0.0003396233,0.0001552762,0.00017942,0.0003622483,0.00006628242,0.0002957803],"category_scores_gemma":[0.006492008,0.0000602187,0.00003808419,0.001440667,0.0002082368,0.0004560273,0.0001143129,0.0001146164,0.00002294153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009143,"about_ca_system_score_gemma":0.0001257768,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001966203,"about_ca_topic_score_gemma":0.00001504248,"domain_scores_codex":[0.9973953,0.0002325277,0.0008308287,0.0002207264,0.001191453,0.0001291128],"domain_scores_gemma":[0.99682,0.0005271642,0.00013995,0.0003270251,0.002093102,0.00009276599],"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.0001152191,0.0008241346,0.005044374,0.0003429001,0.0000925359,0.000004278855,0.04237544,0.1389998,0.5288175,0.2244103,0.004331851,0.05464166],"study_design_scores_gemma":[0.0003139163,0.0001775601,0.001133079,0.00006005672,0.000009322902,0.000002608766,0.002162376,0.9302471,0.06055493,0.004702085,0.0005262364,0.000110751],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7583615,0.00004816513,0.2380119,0.002180713,0.0000215254,0.0004143735,0.00003810156,0.00001152922,0.0009121971],"genre_scores_gemma":[0.9703661,0.0002659794,0.02868344,0.00002317697,0.00003588784,0.00002009269,0.00004568551,0.00001078412,0.0005488638],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7912472,"threshold_uncertainty_score":0.7772009,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3125265748","doi":"10.1287/moor.2020.1072","title":"A Theory for Measures of Tail Risk","year":2021,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":63,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Coherent risk measure; Dynamic risk measure; Spectral risk measure; Risk measure; Expected shortfall; Tail risk; Subadditivity; Value at risk; Mathematics; Time consistency; Risk management; Actuarial science; Econometrics; Measure (data warehouse); Convexity; Financial risk; Financial risk management; Economics; Computer science; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.4231346017905099,"gpt":0.5173141037081926,"spread":0.09417950191768276,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.01260845,0.00006031389,0.0002469688,0.0003466597,0.0002468828,0.0001346901,0.0004227908,0.00005811296,0.0003807619],"category_scores_gemma":[0.03259732,0.00004374927,0.0001079289,0.001100611,0.0001810762,0.0001573539,0.0001026341,0.000111671,0.00003345801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001214937,"about_ca_system_score_gemma":0.0003786857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002035701,"about_ca_topic_score_gemma":0.00009478712,"domain_scores_codex":[0.9968445,0.0005458285,0.0007199231,0.0001974692,0.00153121,0.000161026],"domain_scores_gemma":[0.990324,0.003608553,0.00009923183,0.000690126,0.005227133,0.00005099973],"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.00006341608,0.0009716725,0.001336216,0.00008473752,0.0001067188,0.000002414238,0.01126255,0.09174784,0.01628996,0.815023,0.01066561,0.05244583],"study_design_scores_gemma":[0.0005843434,0.0001803085,0.0004041952,0.00005869726,0.00003217779,0.000006330847,0.01138482,0.2264618,0.1145946,0.6399063,0.006250237,0.000136127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2319639,0.0005140185,0.7532088,0.0004351888,0.00007788599,0.0006068512,0.0001567403,0.000009951982,0.01302666],"genre_scores_gemma":[0.8130125,0.0005189499,0.1767317,0.000006444482,0.00003366832,0.00006841627,0.00001336577,0.00001292694,0.009601995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5810487,"threshold_uncertainty_score":0.9755515,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120257557","doi":"10.1287/moor.1100.0480","title":"Necessary Optimality Conditions for Multiobjective Bilevel Programs","year":2011,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Optimization and Variational Analysis","field":"Computer Science","cited_by":58,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Victoria","funders":"","keywords":"Karush–Kuhn–Tucker conditions; Bilevel optimization; Mathematical optimization; Mathematics; Constraint (computer-aided design); Complementarity (molecular biology); Optimization problem; Upper and lower bounds; Multi-objective optimization; Set (abstract data type); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.3096603620746675,"gpt":0.4282102137386596,"spread":0.1185498516639921,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001100652,0.00007683793,0.0001520429,0.0003009218,0.0003938577,0.0001300214,0.0005649809,0.0000489352,0.0001360177],"category_scores_gemma":[0.0004185879,0.00006652671,0.00008395935,0.0008562493,0.0001194991,0.0004871112,0.0001444349,0.00009610371,0.00003061391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003499954,"about_ca_system_score_gemma":0.0001856299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001062618,"about_ca_topic_score_gemma":0.00004607679,"domain_scores_codex":[0.9987373,0.00009747177,0.0003413934,0.0002227788,0.0004053655,0.0001957227],"domain_scores_gemma":[0.9973881,0.0002358759,0.00004339907,0.0004310451,0.001831948,0.00006968027],"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.000003301877,0.00107775,0.00009126253,0.00005473652,0.00007008826,3.815e-7,0.00484194,0.006439011,0.0004297252,0.9861546,0.0002187721,0.0006185017],"study_design_scores_gemma":[0.0002385049,0.0001075548,0.0005903392,0.00001771797,0.00001022414,0.000001720296,0.0004780287,0.9565175,0.002242629,0.03967077,0.00003803557,0.00008694041],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0034729,0.000009084994,0.990769,0.0004788826,0.00002881854,0.0007229717,0.00003840495,0.00004548416,0.004434409],"genre_scores_gemma":[0.4124573,0.000004136562,0.586675,0.00001199605,0.00001129829,0.0003057152,0.00003543985,0.000005418996,0.0004936795],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9500785,"threshold_uncertainty_score":0.3029275,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2288719682","doi":"10.1287/moor.2015.0745","title":"Zero-Sum Polymatrix Games: A Generalization of Minmax","year":2016,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":51,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Alfred P. Sloan Foundation; National Science Foundation","keywords":"Zero-sum game; Nash equilibrium; Mathematics; Generalization; Minimax; Zero (linguistics); Correlated equilibrium; Mathematical economics; Best response; Epsilon-equilibrium; Set (abstract data type); Mathematical optimization; Combinatorics; Game theory; Applied mathematics; Repeated game; Equilibrium selection; Computer science; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.3045281447897193,"gpt":0.5122618047219017,"spread":0.2077336599321825,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005411546,0.0000862538,0.0002581659,0.0005587401,0.0001931494,0.00008629289,0.0008736021,0.00006699049,0.001196399],"category_scores_gemma":[0.005488913,0.00005027822,0.00008467146,0.001324397,0.0004445883,0.0002540914,0.0001784442,0.00007510471,0.0004454801],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002591585,"about_ca_system_score_gemma":0.0001671824,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002278884,"about_ca_topic_score_gemma":0.00002527624,"domain_scores_codex":[0.9967502,0.0003324344,0.0009079147,0.0002489187,0.001541705,0.0002187674],"domain_scores_gemma":[0.9950619,0.001961553,0.0001153959,0.001038504,0.001740392,0.00008223159],"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.000008756831,0.0003178592,0.000160217,0.00002622446,0.00001497868,2.999162e-7,0.001837047,0.0005065529,0.3077907,0.6800846,0.003539375,0.005713343],"study_design_scores_gemma":[0.000641901,0.0001922636,0.0003809248,0.0001718887,0.00001531765,0.000009096206,0.002666866,0.01419223,0.3557581,0.6218275,0.003948012,0.0001959334],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7326681,0.00007917031,0.2582982,0.001830964,0.00003470575,0.0004730106,0.0000848978,0.00001642348,0.006514465],"genre_scores_gemma":[0.9639896,0.00003223692,0.02115686,0.000008507477,0.0000258153,0.00007033784,0.000003411266,0.00001173631,0.01470154],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2371414,"threshold_uncertainty_score":0.9997166,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129894886","doi":"10.1287/moor.1060.0202","title":"A Limit Theorem for Financial Markets with Inert Investors","year":2006,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Complex Systems and Time Series Analysis","field":"Economics, Econometrics and Finance","cited_by":49,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Fractional Brownian motion; Brownian motion; Limit (mathematics); Markov process; Scaling limit; Arbitrage; Financial market; Geometric Brownian motion; Scaling; Range (aeronautics); Central limit theorem; Econometrics; Applied mathematics; Mathematical economics; Economics; Diffusion process; Financial economics; Mathematical analysis; Finance; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.08526009564124368,"gpt":0.2917202838248761,"spread":0.2064601881836324,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001323985,0.00009223633,0.0003362153,0.0003839339,0.0002496556,0.0001094034,0.0002179676,0.00005263781,0.0003604722],"category_scores_gemma":[0.0003519169,0.00008140416,0.00009019784,0.0005323061,0.0001312459,0.0001200637,0.00005298738,0.00009266625,0.00005907182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004855172,"about_ca_system_score_gemma":0.00006196274,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000967278,"about_ca_topic_score_gemma":0.00119985,"domain_scores_codex":[0.9988719,0.00002004706,0.0005593342,0.0002106376,0.00009828677,0.0002397968],"domain_scores_gemma":[0.9990652,0.0001573419,0.00007878205,0.0003729837,0.0002866042,0.00003913526],"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.00001178045,0.0001716861,0.0008367356,0.0001084272,0.00003135296,5.202236e-7,0.0002824916,0.000952089,0.00007751326,0.9948146,0.002646073,0.00006674534],"study_design_scores_gemma":[0.002033207,0.0007077421,0.009286772,0.0001962093,0.00003570819,0.00001388479,0.00117771,0.3503235,0.001289006,0.5484113,0.08577799,0.0007470193],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8592291,0.0007128447,0.06296971,0.001221095,0.00006446637,0.001303538,0.0003124339,0.00003038164,0.07415643],"genre_scores_gemma":[0.962285,0.00001019744,0.02732773,0.00001031556,0.00009419749,0.0001866899,0.00002913532,0.00002333508,0.0100334],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4464033,"threshold_uncertainty_score":0.3946918,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3123884815","doi":"10.1287/moor.2015.0721","title":"Equilibrium Pricing in Incomplete Markets Under Translation Invariant Preferences","year":2015,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Economic theories and models","field":"Economics, Econometrics and Finance","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Uniqueness; Financial market; Mathematical economics; Incomplete markets; Regular polygon; Mathematics; Complete market; General equilibrium theory; Stochastic discount factor; Trading strategy; Invariant (physics); Dual (grammatical number); Economics; Econometrics; Capital asset pricing model; Finance; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.3901373859094927,"gpt":0.3632287041574597,"spread":0.02690868175203298,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003453758,0.00008092462,0.0002825281,0.0004178878,0.0000503218,0.00009957195,0.0002597755,0.00006716414,0.0001827479],"category_scores_gemma":[0.0002895731,0.00008559068,0.00003450516,0.0003083658,0.00009238849,0.000343154,0.00008693564,0.0001632959,0.0001099178],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001056682,"about_ca_system_score_gemma":0.00009959097,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004695981,"about_ca_topic_score_gemma":0.0003797904,"domain_scores_codex":[0.9987091,0.00005493014,0.0007069886,0.0002114078,0.00007892308,0.0002386964],"domain_scores_gemma":[0.9992583,0.0001882135,0.00006466365,0.0003042114,0.0001143233,0.00007029597],"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.00001314725,0.0001466559,0.0006058095,0.00006653895,0.00001632172,5.543226e-7,0.005157791,0.01840828,0.0002442956,0.9750581,0.00008872406,0.0001937197],"study_design_scores_gemma":[0.0006221404,0.00007745605,0.0008557083,0.00005500938,0.000001621718,0.000002115926,0.002039331,0.3618003,0.0003589367,0.6336872,0.0003548953,0.0001452704],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9131137,0.0004256578,0.02197165,0.0008480649,0.00007305177,0.0004365395,0.00004696282,0.00001161048,0.06307277],"genre_scores_gemma":[0.983017,0.00003721931,0.01629408,0.00001137142,0.0000262135,0.00004186143,0.00001276745,0.00001428536,0.0005451767],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.343392,"threshold_uncertainty_score":0.3490286,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1998039896","doi":"10.1287/moor.1080.0371","title":"Partially Observed Markov Decision Process Multiarmed Bandits—Structural Results","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Markov decision process; Mathematics; Monotone polygon; Mathematical optimization; Partially observable Markov decision process; Markov process; Exploit; Monotonic function; Markov chain; Scheduling (production processes); Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.083850938900528,"gpt":0.3832298800101856,"spread":0.2993789411096576,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001383113,0.0001327017,0.0002225027,0.0002262412,0.0004409614,0.0004474655,0.0009377992,0.0000939779,0.00003341326],"category_scores_gemma":[0.00118685,0.0001077161,0.00006819626,0.001154638,0.00008480126,0.0004715982,0.0001245445,0.000292483,0.00003767866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004381377,"about_ca_system_score_gemma":0.0001426037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001526928,"about_ca_topic_score_gemma":0.00004704089,"domain_scores_codex":[0.99747,0.0001251232,0.000627112,0.0003528023,0.001033331,0.0003916454],"domain_scores_gemma":[0.9974988,0.0003739301,0.0000595847,0.0007713216,0.001149397,0.0001470211],"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.0004252811,0.002236798,0.0000827004,0.0002497555,0.0001381366,0.0001048918,0.01266496,0.5055092,0.01374402,0.10164,0.01366183,0.3495424],"study_design_scores_gemma":[0.0006631888,0.000213821,0.0009707122,0.00006845814,0.000002828436,0.00001474714,0.0001338499,0.9821005,0.005838759,0.009717737,0.0001448405,0.0001304876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2631129,0.0000599069,0.7320087,0.001652372,0.0002262038,0.0007336044,0.00003985196,0.000148263,0.002018206],"genre_scores_gemma":[0.8213294,0.00001441954,0.1782153,0.00002292387,0.00005811736,0.00001697903,0.00001761954,0.000006615153,0.0003186439],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5582165,"threshold_uncertainty_score":0.4392536,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2162870855","doi":"10.1287/moor.26.1.31.10590","title":"A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths","year":2001,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":42,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Multiprocessor scheduling; Preemption; Time complexity; Multiprocessing; Algorithm; Scheduling (production processes); Job shop scheduling; Parallel computing; Schedule; Mathematics; Flow shop scheduling; Mathematical optimization; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.05539017173752653,"gpt":0.354648109459684,"spread":0.2992579377221575,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006663231,0.0001274556,0.0002034373,0.0002841425,0.0002484074,0.0001253964,0.0002253912,0.00006417224,0.00005859129],"category_scores_gemma":[0.0002448661,0.0001104422,0.00004217987,0.0005410277,0.00008896628,0.0001733396,0.00002802732,0.0002166478,0.00002414208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004870325,"about_ca_system_score_gemma":0.00009347979,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001934677,"about_ca_topic_score_gemma":0.00004948974,"domain_scores_codex":[0.9987779,0.00002261019,0.0003201599,0.0001616074,0.000390432,0.0003272934],"domain_scores_gemma":[0.9986746,0.000245603,0.00001537407,0.000268872,0.0007061792,0.0000893707],"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.000009988034,0.000131131,0.00002417419,0.0001450771,0.00006244472,0.000002307926,0.001315805,0.98314,0.001445011,0.0004008238,0.0001540814,0.01316913],"study_design_scores_gemma":[0.0009360772,0.0000753096,0.000004504039,0.00007795708,0.00001061902,0.00001415133,0.0009978919,0.9919132,0.005615949,0.00003982594,0.0001815651,0.000132975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1098947,0.0001372084,0.8877811,0.0001196254,0.00006144333,0.0005921587,0.00002568504,0.0001290987,0.001258997],"genre_scores_gemma":[0.1330945,0.00005306656,0.8657876,0.000005342944,0.0001312355,0.0002130916,0.00001823664,0.00005148444,0.0006454467],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.02319985,"threshold_uncertainty_score":0.4503704,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2913334655","doi":"10.1287/moor.1120.0557","title":"Lipschitz Games","year":2012,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":40,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Lipschitz continuity; Constant (computer programming); Mathematical proof; Mathematics; Stochastic game; Mathematical economics; Probabilistic logic; Function (biology); Pure mathematics; Computer science; Statistics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.5498980570001545,"gpt":0.581616604163756,"spread":0.03171854716360156,"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.01054427,0.0000654315,0.0001705387,0.0003629957,0.0003362781,0.0001657935,0.0007737367,0.00004580531,0.0019329],"category_scores_gemma":[0.005981375,0.00004574416,0.00006089826,0.001136449,0.0002846181,0.0003569577,0.0001997374,0.0001859261,0.002785641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001513676,"about_ca_system_score_gemma":0.00006873099,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009169413,"about_ca_topic_score_gemma":0.00001074196,"domain_scores_codex":[0.9972959,0.000291144,0.0005285766,0.0001499513,0.001428854,0.0003055556],"domain_scores_gemma":[0.9960778,0.002029032,0.00003803944,0.0008977334,0.0008226287,0.0001348051],"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.000002262713,0.0004795577,0.0004156235,0.000009873621,0.000008167084,1.099289e-7,0.004540593,0.0003530222,0.01083818,0.9750352,0.004739443,0.003577989],"study_design_scores_gemma":[0.0004752287,0.0001601809,0.005340044,0.00007027369,0.00002033202,0.00003218052,0.02723518,0.0292173,0.08963996,0.7857896,0.06162247,0.0003972232],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.906349,0.0001506384,0.01989253,0.00130534,0.00005922208,0.0003762759,0.0000183861,0.00002173494,0.07182685],"genre_scores_gemma":[0.9623752,0.000007765882,0.02640229,0.00001473618,0.00008062734,0.00007613254,0.00000226414,0.000008316061,0.01103267],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1892456,"threshold_uncertainty_score":0.9989794,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168573415","doi":"10.1287/moor.1040.0113","title":"Explicit Solution of a Stochastic, Irreversible Investment Problem and Its Moving Threshold","year":2005,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":38,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Optimal stopping; Mathematics; Mathematical optimization; Variational inequality; Profit (economics); Investment (military); Optimal control; Stochastic control; Obstacle problem; Shadow price; Monotone polygon; Boundary (topology); Bellman equation; Free boundary problem; Obstacle; Mathematical economics; Singular control; Economics; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.1138168519041187,"gpt":0.3210949476177818,"spread":0.2072780957136632,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007617876,0.0000780294,0.0002412222,0.000295609,0.0001868914,0.00003486817,0.000187398,0.00005778093,0.00005850244],"category_scores_gemma":[0.0002387444,0.00008483152,0.00003340077,0.0003970166,0.00007642953,0.0001939744,0.0001304995,0.0001210314,0.00006819994],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005465878,"about_ca_system_score_gemma":0.0000571051,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000844766,"about_ca_topic_score_gemma":0.00004696345,"domain_scores_codex":[0.9989431,0.000003801845,0.0005523153,0.0001989996,0.0001039742,0.0001978358],"domain_scores_gemma":[0.9992985,0.00007845122,0.00009581135,0.0002283933,0.000242273,0.000056635],"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.000002410166,0.0002160023,0.00001193657,0.0001431463,0.00001285129,5.072385e-8,0.001425248,0.001803281,0.001757885,0.9943951,0.00006735471,0.0001647111],"study_design_scores_gemma":[0.0004267128,0.000136128,0.0001283907,0.0001184036,0.000008084515,0.000003652673,0.0004886609,0.5346326,0.002499778,0.461125,0.0002662083,0.0001664118],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1226058,0.002555323,0.8588009,0.001368718,0.00002015636,0.001063606,0.0001302535,0.00001765898,0.01343757],"genre_scores_gemma":[0.9446028,0.00005430227,0.05470802,0.00001710802,0.00003312949,0.0001853292,0.000006111165,0.00001218875,0.0003810026],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.821997,"threshold_uncertainty_score":0.3459329,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119663881","doi":"10.1287/moor.1070.0270","title":"On the Spanning Property of Risk Bonds Priced by Equilibrium","year":2007,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":36,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Hedge; Bond; Bond valuation; Stochastic differential equation; Economics; Financial market; Futures contract; Econometrics; Financial economics; Mathematics; Finance; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.09462986760926169,"gpt":0.3287597655489408,"spread":0.2341298979396791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002924752,0.00007710014,0.000219059,0.0001989161,0.0002195256,0.00004190846,0.0003866965,0.00005896054,0.0001045028],"category_scores_gemma":[0.002383182,0.00005184923,0.00004520906,0.0006816188,0.0001823002,0.00007157626,0.00009254117,0.0002332397,0.0001113748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003478905,"about_ca_system_score_gemma":0.00004263505,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002574272,"about_ca_topic_score_gemma":0.00002205621,"domain_scores_codex":[0.9988008,0.000008571903,0.000634283,0.0001799691,0.0001391526,0.0002372598],"domain_scores_gemma":[0.998403,0.0006948937,0.000142136,0.0004490069,0.000269278,0.00004170362],"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.000006939813,0.0002616682,0.00006503103,0.00004515452,0.0000135627,1.06834e-7,0.00119176,0.0002174439,0.001972643,0.9951367,0.0008550279,0.0002339628],"study_design_scores_gemma":[0.0005065214,0.0004095549,0.001242175,0.0001254793,0.00001070537,0.000002264041,0.001628331,0.07147671,0.01830665,0.9030998,0.002897752,0.0002940332],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3185151,0.0003680726,0.6468809,0.0008845471,0.00002890079,0.0006600109,0.0002445919,0.00001333783,0.03240453],"genre_scores_gemma":[0.9894964,0.00002394221,0.009555585,0.00001691345,0.00002634028,0.000071068,0.000008313566,0.00001597555,0.0007854947],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6709812,"threshold_uncertainty_score":0.2853064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2963598490","doi":"10.1287/moor.2017.0905","title":"Sparse Recovery via Partial Regularization: Models, Theory, and Algorithms","year":2018,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mathematics; Restricted isometry property; Augmented Lagrangian method; Regularization (linguistics); Compressed sensing; Mathematical optimization; Sequence (biology); Applied mathematics; Optimization problem; Class (philosophy); Sparse approximation; Algorithm; Computer science; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.077372146898713,"gpt":0.3351070162834522,"spread":0.2577348693847392,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008794011,0.00008329176,0.0001391202,0.0001654196,0.0001674526,0.00008166904,0.0001376418,0.00006787726,0.00006341949],"category_scores_gemma":[0.000117128,0.00007744117,0.00002175246,0.0002276582,0.0002296274,0.000180826,0.00008038661,0.0001268123,0.00001741923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000019159,"about_ca_system_score_gemma":0.00002345884,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001299986,"about_ca_topic_score_gemma":0.00001246963,"domain_scores_codex":[0.9991276,0.00009117307,0.0002194574,0.0001214585,0.0002641126,0.0001762018],"domain_scores_gemma":[0.9990931,0.0001306069,0.00001028497,0.0003517744,0.0003675313,0.00004666763],"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.00004424631,0.0003201977,0.00000785832,0.0002315661,0.0002069899,0.00001013407,0.006223062,0.08357518,0.133819,0.742843,0.007738431,0.02498035],"study_design_scores_gemma":[0.00006398656,0.00006700645,0.000002809571,0.00005527499,0.000005725677,0.000008426606,0.00009651262,0.7720785,0.111027,0.1163716,0.0001527399,0.00007040929],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05925926,0.0001631296,0.9295546,0.00006267312,0.00006328341,0.0002721975,0.000007150218,0.0001521803,0.01046546],"genre_scores_gemma":[0.8942356,0.0001340837,0.1050138,0.000008773914,0.0001224778,0.00002797395,0.000007466372,0.00002914022,0.0004207313],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8349763,"threshold_uncertainty_score":0.315796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014294736","doi":"10.1287/moor.1080.0337","title":"Finding the Exact Integrality Gap for Small Traveling Salesman Problems","year":2008,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":34,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"","keywords":"Travelling salesman problem; Mathematics; Conjecture; Combinatorics; Hamiltonian path; Hamiltonian (control theory); Graph; Relaxation (psychology); Combinatorial optimization; Metric (unit); Discrete mathematics; Mathematical optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.3837812636093662,"gpt":0.4339300606441794,"spread":0.05014879703481323,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005256696,0.0001280013,0.0002199003,0.0002718428,0.001289486,0.0001849075,0.001964526,0.00006198601,0.00001759021],"category_scores_gemma":[0.001725132,0.00008709268,0.0001093182,0.001025997,0.000504724,0.0003303302,0.0004091619,0.0004703793,0.00002500359],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000068742,"about_ca_system_score_gemma":0.0002647111,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003850809,"about_ca_topic_score_gemma":0.00009982789,"domain_scores_codex":[0.9975859,0.0003135419,0.0004683633,0.0003284899,0.0007683639,0.0005353414],"domain_scores_gemma":[0.9959219,0.001850704,0.00004507873,0.001080897,0.001008737,0.00009273491],"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.000007572479,0.0002913506,0.00007713489,0.0002222477,0.00003492698,0.000003322756,0.01215036,0.007173084,0.01460779,0.963406,0.0001750631,0.001851158],"study_design_scores_gemma":[0.000504314,0.0002890604,0.0001772287,0.0001621991,0.000004956104,0.00005775482,0.001327435,0.7069476,0.02188017,0.2678207,0.0005955802,0.0002330616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1366117,0.00007588714,0.8590629,0.001180714,0.00003561838,0.001330902,0.000009561661,0.00004443807,0.001648241],"genre_scores_gemma":[0.7081387,0.00005355176,0.2897903,0.00001324726,0.00003538082,0.0003805906,0.000007428164,0.00001948378,0.001561322],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6997744,"threshold_uncertainty_score":0.9917811,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4210368301","doi":"10.1287/moor.2021.1217","title":"Inf-Convolution, Optimal Allocations, and Model Uncertainty for Tail Risk Measures","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":33,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Risk measure; Coherent risk measure; Expected shortfall; Tail risk; Dynamic risk measure; Mathematics; Convexity; Measure (data warehouse); Quantile; Convolution (computer science); Econometrics; Value at risk; Risk management; Spectral risk measure; Pareto principle; Downside risk; Mathematical optimization; Computer science; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.2571166057204682,"gpt":0.4669938152252159,"spread":0.2098772095047476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.01100262,0.00009602644,0.0002246803,0.0006038889,0.001761873,0.0002559104,0.0005706121,0.00004557279,0.0001620604],"category_scores_gemma":[0.006897496,0.00008053883,0.00006732335,0.0009984114,0.0002224354,0.0002867221,0.0002924269,0.0002429605,0.00001166897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007222254,"about_ca_system_score_gemma":0.0004606675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000146199,"about_ca_topic_score_gemma":0.0001314897,"domain_scores_codex":[0.996405,0.0004065568,0.0007405705,0.0003194621,0.001882951,0.0002454806],"domain_scores_gemma":[0.9956284,0.001286029,0.0001148612,0.0005893351,0.002292784,0.00008865156],"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.00001832635,0.0001483993,0.00028064,0.000006633602,0.00001501294,1.23709e-7,0.003069288,0.9389039,0.0002602075,0.0474514,0.006576808,0.003269308],"study_design_scores_gemma":[0.0002766676,0.0001099962,0.00006976983,0.000003858073,0.00001145695,0.000003422734,0.004585482,0.9484888,0.0001823533,0.04244409,0.003741859,0.00008226169],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.29831,0.0003259973,0.6975836,0.001200998,0.0000542272,0.001117483,0.0003459121,0.00002157282,0.001040265],"genre_scores_gemma":[0.8488093,0.0004312975,0.1460033,0.00001794831,0.00002490464,0.0005673596,0.00004831249,0.00001544288,0.004082125],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5515803,"threshold_uncertainty_score":0.9995377,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166100185","doi":"10.1287/moor.2014.0662","title":"Strategy-Proofness Makes the Difference: Deferred-Acceptance with Responsive Priorities","year":2014,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"","keywords":"Set (abstract data type); Normative; Object (grammar); Mechanism (biology); School choice; Computer science; Stability (learning theory); Mechanism design; Simple (philosophy); Linear programming; Strategic dominance; Mathematical economics; Mathematical optimization; Operations research; Economics; Mathematics; Artificial intelligence; Programming language; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.1372409211604631,"gpt":0.332315853002385,"spread":0.1950749318419219,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003460011,0.0001122237,0.0003095873,0.0001984762,0.0004247162,0.0002486937,0.0004952057,0.00005991173,0.0001468606],"category_scores_gemma":[0.0009844188,0.00007800345,0.00004318513,0.0003975515,0.000380739,0.0001230608,0.00007068175,0.0002590475,0.0001427735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003283248,"about_ca_system_score_gemma":0.00005709203,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001042444,"about_ca_topic_score_gemma":0.0001735391,"domain_scores_codex":[0.9986728,0.0001766525,0.0005031562,0.0002229063,0.0001507796,0.0002736532],"domain_scores_gemma":[0.9982784,0.0006509153,0.00009783985,0.0006355232,0.0002940272,0.00004322993],"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.00001791573,0.00007588796,0.001226493,0.0001411356,0.00002609797,4.623272e-7,0.003564196,0.0006699083,0.0002964406,0.9935663,0.00005080559,0.0003643505],"study_design_scores_gemma":[0.001809604,0.001680921,0.04350112,0.0008764553,0.00002546951,0.00005680036,0.02787828,0.1225036,0.0097196,0.7872577,0.003653738,0.001036646],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9541076,0.0002754536,0.01708727,0.0004134177,0.00005422486,0.0005151147,0.00004229947,0.00002162319,0.02748304],"genre_scores_gemma":[0.9894196,0.00001840071,0.002273379,0.00001095589,0.0000582022,0.0001158214,0.000003322787,0.00001956801,0.008080685],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2063086,"threshold_uncertainty_score":0.3266616,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2906115048","doi":"10.1287/moor.2021.1220","title":"A Primal–Dual Learning Algorithm for Personalized Dynamic Pricing with an Inventory Constraint","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":32,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematical optimization; Curse of dimensionality; Regret; Dual (grammatical number); Dynamic pricing; Computer science; Revenue management; Constraint (computer-aided design); Revenue; Mathematics; Artificial intelligence; Machine learning; Economics; Microeconomics","retraction":null,"screen_n_in":null,"score":{"opus":0.2164557114028993,"gpt":0.4992844795065401,"spread":0.2828287681036408,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01387377,0.000165041,0.0004236847,0.001103265,0.002012466,0.000376371,0.001027691,0.00004917306,0.001439929],"category_scores_gemma":[0.004262734,0.0001294245,0.0001009618,0.001782133,0.0008329485,0.0004740315,0.0005664025,0.0008841141,0.00002309237],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003515122,"about_ca_system_score_gemma":0.001009578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003536182,"about_ca_topic_score_gemma":0.00007144506,"domain_scores_codex":[0.9921001,0.001000477,0.0007754818,0.0005996236,0.004896751,0.0006275417],"domain_scores_gemma":[0.9941263,0.002513879,0.0001237408,0.0006968058,0.00234516,0.0001940692],"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.00053881,0.004674561,0.0002341702,0.0003392065,0.0003721557,0.0001348193,0.06882332,0.5196187,0.0180104,0.08145364,0.00113429,0.3046659],"study_design_scores_gemma":[0.0009691857,0.001478019,0.00001643414,0.00002098897,0.000006836292,0.00006339336,0.04561574,0.942481,0.0004890437,0.007100325,0.001603146,0.0001558594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1028447,0.0001040678,0.893934,0.0004086913,0.00004692797,0.001880057,0.0001602871,0.00004454074,0.0005767064],"genre_scores_gemma":[0.3847758,0.00001163821,0.5950463,0.00001747237,0.00005921135,0.001384847,0.00009939696,0.0000735974,0.01853174],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4228623,"threshold_uncertainty_score":0.9994729,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154558981","doi":"10.1287/moor.1040.0124","title":"A Conic Programming Approach to Generalized Tchebycheff Inequalities","year":2005,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of New Brunswick","funders":"","keywords":"Conic section; Mathematics; Semidefinite programming; Piecewise; Mathematical optimization; Class (philosophy); Applied mathematics; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.2856956413919422,"gpt":0.4884137580789195,"spread":0.2027181166869773,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003649335,0.0002221508,0.0004856216,0.0007701702,0.00041207,0.0002237168,0.0007169063,0.000127502,0.0002970784],"category_scores_gemma":[0.004779746,0.000199887,0.0001011898,0.001482921,0.0002661708,0.0003294407,0.0003909524,0.0004868019,0.0001238675],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002395369,"about_ca_system_score_gemma":0.000297106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003811508,"about_ca_topic_score_gemma":0.00006369074,"domain_scores_codex":[0.995905,0.0003691616,0.0009381082,0.0004042465,0.001647694,0.0007357244],"domain_scores_gemma":[0.9960974,0.000846084,0.00006181585,0.0009333544,0.001797027,0.000264349],"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.00003088237,0.002622208,0.000009562689,0.0009189011,0.0001155076,0.000001935027,0.02128919,0.0912891,0.003561144,0.8680344,0.00308861,0.009038512],"study_design_scores_gemma":[0.001720503,0.00030414,0.000006053,0.0002335169,0.00002819409,0.00003100541,0.01053246,0.9175045,0.02262274,0.03634788,0.01003303,0.0006359227],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.09098101,0.0001491087,0.8855104,0.00160127,0.00003239403,0.003389288,0.00003601367,0.0001907166,0.0181098],"genre_scores_gemma":[0.07811609,0.00003338404,0.91088,0.00003162894,0.0001221884,0.0008871465,0.00002379898,0.00007524947,0.009830497],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8316866,"threshold_uncertainty_score":0.8151156,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2166630570","doi":"10.1287/moor.2017.0895","title":"On the Complexity of Robust PCA and <i>ℓ</i><sub>1</sub>-Norm Low-Rank Matrix Approximation","year":2018,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"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; U.S. Air Force; Fonds De La Recherche Scientifique - FNRS","keywords":"Robust principal component analysis; Sparse PCA; Principal component analysis; Matrix (chemical analysis); Computation; Bipartite graph; Binary number; Logical matrix; Basis (linear algebra)","retraction":null,"screen_n_in":null,"score":{"opus":0.1257952233817065,"gpt":0.336740079970483,"spread":0.2109448565887765,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006490203,0.0000909759,0.000162065,0.0001628135,0.0001886443,0.00005740609,0.0001943436,0.0000544315,0.00002775914],"category_scores_gemma":[0.0002079161,0.0000675351,0.0000291442,0.0002791628,0.0006044031,0.00007789281,0.00007626084,0.0001824445,0.00001843837],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002355932,"about_ca_system_score_gemma":0.00002175664,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001763106,"about_ca_topic_score_gemma":0.0000415617,"domain_scores_codex":[0.999042,0.00006278027,0.0002727954,0.0001010874,0.0003623614,0.0001589699],"domain_scores_gemma":[0.9988542,0.0002453473,0.00002300069,0.0004113352,0.0004358208,0.00003035527],"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.00001458873,0.0002014424,0.000005401908,0.0003373304,0.00005638747,8.173434e-7,0.002190032,0.01298401,0.6326255,0.3463373,0.004418067,0.0008291434],"study_design_scores_gemma":[0.00006408548,0.00006599985,0.00003899943,0.0001381215,0.000004264622,0.000002402734,0.0001584214,0.4302378,0.5523984,0.01683097,0.00001002428,0.00005050721],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9548731,0.00004665854,0.03988338,0.0002092992,0.0000247226,0.0004469992,0.00001351627,0.0000749667,0.00442739],"genre_scores_gemma":[0.981091,0.00005265512,0.01874869,0.000006618702,0.00003205848,0.00002599048,0.00000484665,0.00001902237,0.00001907896],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4172538,"threshold_uncertainty_score":0.2754002,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157555448","doi":"10.1287/moor.1090.0419","title":"A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Semidefinite programming; Mathematics; Relaxation (psychology); Quadratic assignment problem; Mathematical optimization; Quadratically constrained quadratic program; Quadratic programming; Dimension (graph theory); Quadratic equation; Positive-definite matrix; Majorization; Upper and lower bounds; Optimization problem; Combinatorics; Eigenvalues and eigenvectors; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.1558959852504453,"gpt":0.4509045053540539,"spread":0.2950085201036086,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004033467,0.000184898,0.0003145534,0.0003453297,0.0008463481,0.0001632348,0.0005273325,0.0001109619,0.000204374],"category_scores_gemma":[0.00534918,0.0001287217,0.0001159949,0.0008595352,0.0002282783,0.000266749,0.0001116992,0.0004197195,0.000043194],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001754942,"about_ca_system_score_gemma":0.0003256193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007478956,"about_ca_topic_score_gemma":0.00002404629,"domain_scores_codex":[0.9965124,0.0002289183,0.0008488622,0.0003096245,0.001598714,0.0005014542],"domain_scores_gemma":[0.9924354,0.004616369,0.0001193535,0.0007898384,0.001931142,0.000107904],"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.00005832423,0.001858238,0.000003371976,0.0004841113,0.0001056203,0.000002274388,0.003517309,0.1861832,0.01156818,0.7827322,0.007615332,0.005871815],"study_design_scores_gemma":[0.0007044009,0.0003715957,0.00001491036,0.0001981666,0.00002505929,0.000008640113,0.0008641835,0.7040795,0.009099464,0.2842148,0.0002532855,0.0001659716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008561924,0.0001396134,0.9781038,0.005872921,0.00004997915,0.004725069,0.00004854678,0.00008087252,0.002417269],"genre_scores_gemma":[0.1324302,0.00005969416,0.8610349,0.00006192194,0.00008345745,0.0008580054,0.00003829605,0.00005116527,0.005382388],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5178964,"threshold_uncertainty_score":0.6509511,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1964265873","doi":"10.1287/moor.1110.0509","title":"An <i>O</i>(<i>n</i><sup>4</sup>) Algorithm for the QAP Linearization Problem","year":2011,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Manufacturing and Logistics Optimization","field":"Engineering","cited_by":30,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Quadratic assignment problem; Linearization; Mathematical optimization; Matrix (chemical analysis); Assignment problem; Function (biology); Combinatorics; Algorithm; Optimization problem; Nonlinear system","retraction":null,"screen_n_in":null,"score":{"opus":0.08683230206189134,"gpt":0.3337473374116076,"spread":0.2469150353497163,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007022205,0.0001027319,0.000125359,0.0001289049,0.0003053894,0.0000709652,0.0002947879,0.0000691566,0.00004977973],"category_scores_gemma":[0.0001398027,0.00007797666,0.00003345339,0.0002369122,0.0001063819,0.0002073267,0.00003037066,0.0001758517,0.00001170881],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002847437,"about_ca_system_score_gemma":0.00003383005,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002586042,"about_ca_topic_score_gemma":0.00001130871,"domain_scores_codex":[0.9990503,0.00003340187,0.0002960756,0.000129841,0.000257496,0.0002328447],"domain_scores_gemma":[0.9988378,0.0002230484,0.00001643803,0.0004132971,0.0004579561,0.0000514345],"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.000002013513,0.0001109595,0.0000012757,0.00009623061,0.00002217114,1.970531e-7,0.003061803,0.9748415,0.0002829506,0.01293894,0.0001590792,0.008482888],"study_design_scores_gemma":[0.0001522756,0.00008755302,0.000004205455,0.00001953449,0.00001263975,0.000001579885,0.0006749273,0.9788527,0.01400267,0.005835394,0.0002691109,0.00008739348],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0009738619,0.00006398839,0.9962001,0.00002641832,0.00003209888,0.0007994449,0.00003943918,0.0001058649,0.001758732],"genre_scores_gemma":[0.2024574,0.0001096127,0.7967032,0.000005327449,0.00006918378,0.0002782053,0.0000574131,0.00004213802,0.0002774974],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2014835,"threshold_uncertainty_score":0.3179796,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2113539939","doi":"10.1287/moor.1090.0411","title":"Bid-Price Controls for Network Revenue Management: Martingale Characterization of Optimal Bid Prices","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Martingale (probability theory); Bid price; Mathematics; Revenue; Revenue management; Econometrics; Mathematical economics; Mathematical optimization; Economics; Finance; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0436355011372705,"gpt":0.3403300945480038,"spread":0.2966945934107333,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002063066,0.0001041078,0.0002720864,0.0003885622,0.0002985398,0.0001413803,0.0003323657,0.00003734708,0.00007962088],"category_scores_gemma":[0.0005929522,0.00009899751,0.00008147953,0.001026113,0.00007277338,0.0006267132,0.0000998407,0.00009455153,0.00002586794],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002028849,"about_ca_system_score_gemma":0.0000146892,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007625923,"about_ca_topic_score_gemma":0.000006653109,"domain_scores_codex":[0.9986277,0.00002796378,0.0005119482,0.0001835285,0.0003693553,0.0002794707],"domain_scores_gemma":[0.9985461,0.0001831493,0.0002034288,0.0003518452,0.0007040995,0.00001138593],"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.00010218,0.0005532798,0.00008757782,0.00125412,0.000142735,0.000002127525,0.000358075,0.07530908,0.1065009,0.8119151,0.000597639,0.003177158],"study_design_scores_gemma":[0.001585606,0.0001736235,0.001363537,0.000817423,0.0002840481,0.000001376233,0.0009515547,0.8624375,0.008108069,0.1124383,0.01136607,0.0004728644],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7794095,0.00007589578,0.2115944,0.0009191085,0.00006358238,0.001775424,0.00003396781,0.00005263813,0.006075462],"genre_scores_gemma":[0.9310985,0.00003445625,0.065966,0.00008963067,0.0004132348,0.0001245355,0.0001035252,0.00002707435,0.002143073],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7871285,"threshold_uncertainty_score":0.4037001,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970058257","doi":"10.1287/moor.1040.0096","title":"Arbitrage in a Discrete Version of the Wick-Fractional Black-Scholes Market","year":2004,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Calgary","funders":"","keywords":"Mathematics; Arbitrage; Fractional Brownian motion; Black–Scholes model; Hurst exponent; Mathematical economics; Class (philosophy); Applied mathematics; Brownian motion; Econometrics; Finance; Economics; Volatility (finance); Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05043644441289889,"gpt":0.3133080381157297,"spread":0.2628715937028308,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008021244,0.00006015524,0.0001786541,0.0002187571,0.0001396544,0.00002704919,0.0003194656,0.00005409001,0.0001434897],"category_scores_gemma":[0.0006014386,0.00005248288,0.000059567,0.000683039,0.0002302532,0.0001247941,0.0001048932,0.0002346836,0.00006520098],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007537664,"about_ca_system_score_gemma":0.0001165211,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004195569,"about_ca_topic_score_gemma":0.000151437,"domain_scores_codex":[0.9990898,0.000007225526,0.000480566,0.0001508349,0.0001233125,0.0001482714],"domain_scores_gemma":[0.9993203,0.0001040402,0.00008171096,0.0003264738,0.0001414038,0.0000260599],"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.000005689601,0.0002438948,0.0002919319,0.00007389479,0.000007158641,2.18426e-7,0.0007070885,0.00313385,0.0003573883,0.99509,0.00007171853,0.00001714228],"study_design_scores_gemma":[0.0006776552,0.00005898245,0.0135503,0.0001652544,0.000003476512,0.000003119617,0.000774763,0.0240874,0.001678401,0.9582482,0.000631823,0.0001206166],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6212916,0.0002796604,0.3356279,0.003500084,0.00006877624,0.0008684269,0.0003458491,0.000009096567,0.03800868],"genre_scores_gemma":[0.9900053,0.00003349976,0.009423889,0.000009757019,0.0000188283,0.00006104833,0.00000527857,0.000008898496,0.0004335353],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3687137,"threshold_uncertainty_score":0.214019,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2160146903","doi":"10.1287/moor.1070.0254","title":"The Demand-Matching Problem","year":2007,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Graph Theory Research","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"","keywords":"Bipartite graph; Mathematics; Knapsack problem; Cardinality (data modeling); Matching (statistics); Combinatorics; Tree (set theory); Clos network; Discrete mathematics; Approximation algorithm; Time complexity; Node (physics); 3-dimensional matching; Mathematical optimization; Graph; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.07242089226921299,"gpt":0.4165825610196921,"spread":0.3441616687504791,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01318965,0.00008538624,0.0001250888,0.0003050964,0.001219528,0.0003586299,0.001892312,0.00004305293,0.00001125189],"category_scores_gemma":[0.0007439551,0.00005617104,0.00005017456,0.001243512,0.0003512672,0.0004223322,0.0006535216,0.0004135467,0.00007787811],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000489691,"about_ca_system_score_gemma":0.0001415651,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001889436,"about_ca_topic_score_gemma":0.0001428264,"domain_scores_codex":[0.9973522,0.0002113459,0.0004373905,0.0002187303,0.001192334,0.000587941],"domain_scores_gemma":[0.9958153,0.00218031,0.0000306072,0.001001041,0.000867633,0.0001050774],"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.000003520671,0.00009046055,0.00001136319,0.00003489566,0.00001221949,0.000003657617,0.002553624,0.001476005,0.00833115,0.9815906,0.0001083848,0.005784075],"study_design_scores_gemma":[0.0002407234,0.0001465069,0.0001084288,0.00007734314,0.000001858812,0.00002279547,0.001969761,0.08510424,0.03580449,0.874994,0.001377327,0.0001525328],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03455,0.0001894711,0.9509739,0.001086158,0.00003441048,0.0005497652,0.000001110423,0.00004646869,0.01256866],"genre_scores_gemma":[0.6031462,0.00005057067,0.3946923,0.00001012456,0.00002799861,0.0000525564,7.653765e-7,0.00001315538,0.002006274],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5685962,"threshold_uncertainty_score":0.9379747,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2752127906","doi":"10.1287/moor.2017.0861","title":"Negative Dependence, Scrambled Nets, and Variance Bounds","year":2017,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Mathematical Approximation and Integration","field":"Mathematics","cited_by":27,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Monte Carlo method; Estimator; Importance sampling; Quasi-Monte Carlo method; Applied mathematics; Sampling (signal processing); Monte Carlo integration; Joint probability distribution; Generalization; Hybrid Monte Carlo; Statistics; Markov chain Monte Carlo; Computer science; Filter (signal processing); Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.2484975107877077,"gpt":0.4824369159611381,"spread":0.2339394051734304,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.00289006,0.0001751652,0.0003921104,0.0002145792,0.001330942,0.0008845301,0.0006281138,0.0001446243,0.0005004304],"category_scores_gemma":[0.01241185,0.0001397811,0.000062046,0.0001798419,0.0006455952,0.0006454031,0.0002864237,0.0004112543,0.00006704831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004558081,"about_ca_system_score_gemma":0.0001362899,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000100267,"about_ca_topic_score_gemma":0.0001962602,"domain_scores_codex":[0.9977043,0.0001710379,0.0006452283,0.0002885046,0.0008660175,0.0003249167],"domain_scores_gemma":[0.9964706,0.001110993,0.0001600661,0.001106112,0.001019201,0.0001330172],"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.000007840403,0.0003116185,0.00002697953,0.0003270705,0.00003186595,0.000001560248,0.002331443,0.000004624193,0.001894285,0.9933051,0.00105794,0.0006996947],"study_design_scores_gemma":[0.0004642778,0.0001056418,0.000170176,0.0002706577,0.00001940501,0.00001346025,0.001324099,0.1100492,0.009320087,0.8778764,0.0002194066,0.0001672329],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6594409,0.00007514345,0.1582105,0.004592649,0.0001314876,0.00250909,0.0000490602,0.0001192625,0.1748719],"genre_scores_gemma":[0.6257904,0.00003874119,0.3680446,0.00001821424,0.0000416211,0.0001440392,0.000004050415,0.00002764609,0.005890805],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2098341,"threshold_uncertainty_score":0.9999692,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3136541527","doi":"10.1287/moor.2022.1331","title":"Convergence of Finite Memory Q Learning for POMDPs and Near Optimality of Learned Policies Under Filter Stability","year":2022,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":true},"ca_institutions":"Queen's University","funders":"","keywords":"Markov decision process; Partially observable Markov decision process; Convergence (economics); Bellman equation; Mathematical optimization; Mathematics; Limit (mathematics); Stability (learning theory); Filter (signal processing); Q-learning; Reinforcement learning; Optimal control; Ergodicity; Markov chain; Applied mathematics; Computer science; Markov process; Artificial intelligence; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.1956737594459966,"gpt":0.3990674966197256,"spread":0.2033937371737291,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003384602,0.00008664653,0.0002596189,0.0001774095,0.0004818053,0.00007525148,0.0006777839,0.00003345328,0.0001443845],"category_scores_gemma":[0.001336007,0.00008558475,0.00006018182,0.0005070648,0.000352271,0.0002130654,0.000948736,0.000302883,0.000001564468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004904203,"about_ca_system_score_gemma":0.0002759074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001069962,"about_ca_topic_score_gemma":0.000004428844,"domain_scores_codex":[0.9978647,0.0003533252,0.0005516199,0.0002130937,0.0007787482,0.0002385618],"domain_scores_gemma":[0.9971887,0.001353874,0.0001229222,0.0005806176,0.0007059111,0.00004800957],"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.000008553389,0.0001414921,0.0003556761,0.0003954954,0.0000281111,1.547482e-7,0.009657264,0.9354561,0.005158649,0.0486853,0.0000337799,0.00007942629],"study_design_scores_gemma":[0.0002377139,0.0004406867,0.0003147298,0.00001886588,0.000005949748,0.000001504789,0.00271471,0.9825591,0.01224116,0.001310095,0.00008233423,0.00007314459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3972104,0.00003314794,0.6012613,0.0003970148,0.00002512377,0.0005194405,0.000011562,0.00001979626,0.0005222084],"genre_scores_gemma":[0.8484666,0.00001547618,0.1509396,0.000007739051,0.000004391635,0.00005756113,0.000005423431,0.00000872486,0.0004944034],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.4512562,"threshold_uncertainty_score":0.3705705,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2888696679","doi":"10.1287/moor.2021.1168","title":"Multiplayer Bandits Without Observing Collision Information","year":2021,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":26,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Institut de Valorisation des Données; Université de Montréal; Banco Bilbao Vizcaya Argentaria; Ministerio de Economía y Competitividad; Canada First Research Excellence Fund; Centre de Recherches Mathématiques; Fundación BBVA","keywords":"Regret; Logarithm; Collision; Square root; Computer science; Nash equilibrium; Square (algebra); Mathematical optimization; Root (linguistics); Mathematical economics; Mathematics; Computer security; Mathematical analysis; Machine learning; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.4572293218497314,"gpt":0.5586788726154809,"spread":0.1014495507657495,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01472623,0.0003491875,0.0009620045,0.00210181,0.0007713684,0.003033222,0.002925479,0.0005060273,0.001118124],"category_scores_gemma":[0.04280111,0.0002783709,0.0002624699,0.002389373,0.0004221565,0.001882105,0.005239883,0.002037273,0.0005742277],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003204503,"about_ca_system_score_gemma":0.001728819,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000232365,"about_ca_topic_score_gemma":0.0004100826,"domain_scores_codex":[0.9857937,0.001021805,0.002393873,0.0007629242,0.009307857,0.0007198015],"domain_scores_gemma":[0.9797072,0.003774773,0.0003258872,0.002847374,0.01307755,0.0002672583],"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.00005270423,0.0008468533,0.0005138811,0.0009842527,0.0001530179,0.00002419666,0.02009699,0.9541693,0.003143039,0.001950874,0.005389745,0.01267519],"study_design_scores_gemma":[0.0005667354,0.00008879149,0.0006798301,0.0006905843,0.00001346035,0.0000127374,0.01091922,0.9608988,0.01312146,0.01117322,0.001468973,0.0003662319],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5031856,0.0003857644,0.4878985,0.0009733553,0.0006271983,0.00287858,0.0003300622,0.00007096797,0.00365001],"genre_scores_gemma":[0.7704714,0.0002333813,0.2247549,0.00002036273,0.0001653992,0.0004227397,0.000312438,0.00005166616,0.003567749],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2672858,"threshold_uncertainty_score":0.9999669,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2136937392","doi":"10.1287/moor.1050.0148","title":"On the Empirical State-Action Frequencies in Markov Decision Processes Under General Policies","year":2005,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Reinforcement Learning in Robotics","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"National Science Foundation","keywords":"Polytope; Mathematics; Markov decision process; Markov chain; State (computer science); Element (criminal law); Action (physics); Limit (mathematics); Empirical research; Finite state; Markov process; Mathematical optimization; Mathematical economics; Combinatorics; Statistics; Algorithm; Mathematical analysis; Law","retraction":null,"screen_n_in":null,"score":{"opus":0.3170072528469867,"gpt":0.4601731656936224,"spread":0.1431659128466358,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001521223,0.0000974379,0.0001316309,0.0003734744,0.0002873355,0.0003575342,0.0008273652,0.0000463698,0.00005916406],"category_scores_gemma":[0.001459504,0.00006430689,0.00002667916,0.001057814,0.0001493979,0.0004203297,0.0002328607,0.0003249078,0.00008402902],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001577518,"about_ca_system_score_gemma":0.0002975253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006723114,"about_ca_topic_score_gemma":0.0003100106,"domain_scores_codex":[0.9979848,0.0001593822,0.0003918225,0.0001834978,0.0009886674,0.0002918511],"domain_scores_gemma":[0.9974459,0.001434012,0.00003567263,0.0005692786,0.0004732678,0.00004191482],"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.000003386227,0.0001135656,0.0000551319,0.00002564622,0.00000646389,4.841345e-7,0.004543518,0.8931477,0.0006337709,0.09974442,0.0006279575,0.001097978],"study_design_scores_gemma":[0.000129693,0.0001498061,0.0005286004,0.0000895233,0.000001199233,0.000003996066,0.0006847304,0.9797043,0.004961411,0.01346323,0.000194967,0.000088579],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4734502,0.00001710667,0.5207565,0.003880357,0.00002315515,0.0002612793,9.588447e-7,0.00002190877,0.001588562],"genre_scores_gemma":[0.8651178,0.00005998405,0.1330193,0.0001355698,0.00002846791,0.00005369675,0.000001711919,0.00001040591,0.001573091],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3916676,"threshold_uncertainty_score":0.3447711,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117639993","doi":"10.1287/moor.25.1.141.15207","title":"Optimal Preventive Replacement Under Minimal Repair and Random Repair Cost","year":2000,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Reliability and Maintenance Optimization","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Optimal stopping; Mathematical optimization; Mathematics; Maximization; Limit (mathematics); Semimartingale; Unit (ring theory); Utility maximization problem; Applied mathematics; Mathematical economics; Utility maximization","retraction":null,"screen_n_in":null,"score":{"opus":0.03119307777705049,"gpt":0.3199220425933819,"spread":0.2887289648163314,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001282848,0.00009855969,0.0001881596,0.0001097974,0.0001548968,0.00005108973,0.00009316282,0.00006645668,0.0006920364],"category_scores_gemma":[0.0002177585,0.00008943219,0.0000670443,0.0002304482,0.0001602851,0.0001821322,0.00003840998,0.0001705769,0.00003206305],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006960631,"about_ca_system_score_gemma":0.00004203793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001820677,"about_ca_topic_score_gemma":0.00002377989,"domain_scores_codex":[0.9988071,0.00008648276,0.0003793172,0.0001793112,0.0003187907,0.0002290106],"domain_scores_gemma":[0.9991516,0.0001830932,0.00001020591,0.0003569888,0.0002346308,0.00006341876],"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.00006988562,0.0001906879,0.00002169515,0.0002909054,0.00007718689,0.000001301838,0.001890157,0.9900588,0.0006469444,0.003557485,0.002732367,0.0004625965],"study_design_scores_gemma":[0.0007422344,0.0001266021,0.0001294258,0.0001014779,0.00001431961,0.000006461846,0.0009270578,0.9952545,0.001226864,0.0003310203,0.001038664,0.000101435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.939289,0.0002858933,0.04190041,0.000213931,0.00003925965,0.001709043,0.00002399368,0.0002641238,0.01627435],"genre_scores_gemma":[0.7801763,0.001056206,0.2090505,0.00001052149,0.00003076885,0.0003472345,0.00002932776,0.00004093449,0.009258158],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1671501,"threshold_uncertainty_score":0.7577313,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2744036899","doi":"10.1287/moor.2018.0966","title":"A Mean Field Competition","year":2019,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Consumer Market Behavior and Pricing","field":"Business, Management and Accounting","cited_by":24,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Mathematics; Fraction (chemistry); Rank (graph theory); Scheme (mathematics); Mathematical optimization; Competition (biology); Principal (computer security); Population; Field (mathematics); Computer science; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.07781145011900378,"gpt":0.3526694802626509,"spread":0.2748580301436472,"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.0009120652,0.00005695514,0.0001152894,0.0003034017,0.0001339287,0.0001873683,0.0001901512,0.00003307,0.003151001],"category_scores_gemma":[0.0001868327,0.00005128808,0.00003689027,0.0004103314,0.00003003897,0.000363717,0.0001424255,0.0001445695,0.0008715146],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009439309,"about_ca_system_score_gemma":0.00002190245,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004266188,"about_ca_topic_score_gemma":0.0002624877,"domain_scores_codex":[0.9991595,0.00001282315,0.0001996276,0.0001092801,0.0003669847,0.0001517852],"domain_scores_gemma":[0.9991485,0.0001499165,0.00002175089,0.0002772182,0.000395935,0.000006603869],"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.00002160081,0.0004698625,0.01368738,0.001098606,0.00002756136,0.000003235446,0.0009449169,0.0003218718,0.04074856,0.9335617,0.002092537,0.007022205],"study_design_scores_gemma":[0.004586734,0.0003516686,0.02690364,0.002305406,0.0002457642,0.00002338687,0.01816637,0.7333843,0.02996597,0.06101143,0.1211435,0.001911902],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8973303,0.00001882382,0.0006389196,0.0005392423,0.0000704948,0.0003301865,0.000001102353,0.00002442992,0.1010464],"genre_scores_gemma":[0.9966918,0.000004135855,0.001598612,0.00006714844,0.00007492162,0.00001864777,0.00001039895,0.00001046806,0.001523915],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8725502,"threshold_uncertainty_score":0.9999064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2006228567","doi":"10.1287/moor.25.1.76.15208","title":"Relaxed Most Negative Cycle and Most Positive Cut Canceling Algorithms for Minimum Cost Flow","year":2000,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Complexity and Algorithms in Graphs","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Minimum-cost flow problem; Flow (mathematics); Algorithm; Mathematical optimization; Flow network; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.08106170843672988,"gpt":0.3754496383923113,"spread":0.2943879299555814,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001016963,0.0001401166,0.0002472477,0.0002212224,0.0008007614,0.0003353326,0.0006399124,0.00006858793,0.00007824442],"category_scores_gemma":[0.000382446,0.0001326448,0.00004894305,0.0009106231,0.0003157021,0.0004436187,0.0002118683,0.0002519645,0.0000172995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005615319,"about_ca_system_score_gemma":0.0002041139,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002397656,"about_ca_topic_score_gemma":0.0002318345,"domain_scores_codex":[0.9982399,0.0001051097,0.0003827409,0.0003660302,0.0005162712,0.0003898878],"domain_scores_gemma":[0.9976473,0.0009108308,0.00003106938,0.0005011095,0.0007879509,0.0001217295],"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.00006884077,0.001594036,0.00001965989,0.0004296516,0.0002525122,0.0000232321,0.05064179,0.03522607,0.003815277,0.3554194,0.003317039,0.5491925],"study_design_scores_gemma":[0.0004858135,0.0001760757,0.00002844319,0.0001112528,0.000005678319,0.00001263736,0.0006069739,0.9631655,0.00571535,0.02922961,0.0003182524,0.0001443994],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0789988,0.0002319233,0.9102162,0.002249811,0.0001188688,0.002429957,0.0003635733,0.00007982978,0.005311078],"genre_scores_gemma":[0.07049601,0.000159813,0.9272608,0.00006380025,0.00007669348,0.0003136988,0.0000259687,0.00002142185,0.001581818],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9279394,"threshold_uncertainty_score":0.615889,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096547979","doi":"10.1287/moor.1060.0212","title":"Computation of the Lasserre Ranks of Some Polytopes","year":2007,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"","keywords":"Polytope; Mathematics; Combinatorics; Computation; Lift (data mining); Mathematical optimization; Discrete mathematics; Applied mathematics; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1715857947836488,"gpt":0.4919333757813225,"spread":0.3203475809976737,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00380826,0.000117331,0.0003564146,0.0004599472,0.0002063505,0.00002379019,0.0006011907,0.0001019548,0.00009423529],"category_scores_gemma":[0.004019516,0.00008572132,0.000108953,0.001220986,0.000562951,0.0002168745,0.0002817008,0.0003459977,0.000006552795],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006374221,"about_ca_system_score_gemma":0.0002273887,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003511158,"about_ca_topic_score_gemma":0.0000717081,"domain_scores_codex":[0.9967458,0.0002124135,0.0009963225,0.0001672736,0.001555215,0.0003229691],"domain_scores_gemma":[0.9953128,0.001696917,0.0001750898,0.0006318158,0.002117634,0.00006580562],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00006033386,0.002068913,0.0002813344,0.002137964,0.0001498671,0.000002393057,0.007698478,0.05172866,0.06334552,0.868136,0.0007450994,0.003645387],"study_design_scores_gemma":[0.001393059,0.0002658226,0.0007099123,0.0006650225,0.0000374807,0.00001237938,0.0061409,0.2977578,0.4709974,0.2216922,0.00007493384,0.0002529768],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4629253,0.0002009285,0.5290035,0.0005350445,0.00009280776,0.001788456,0.00005019302,0.00003288049,0.005370923],"genre_scores_gemma":[0.6998972,0.00003319809,0.2988696,0.000004184979,0.00002795868,0.00001847944,0.000004319488,0.00002977747,0.001115308],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6464438,"threshold_uncertainty_score":0.4812026,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2158898601","doi":"10.1287/moor.1100.0473","title":"On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming","year":2011,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Sparse and Compressive Sensing Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"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; National Natural Science Foundation of China","keywords":"Semidefinite programming; Quadratically constrained quadratic program; Mathematics; Semidefinite embedding; Quadratic growth; Quadratic programming; Relaxation (psychology); Equivalence (formal languages); Positive-definite matrix; Mathematical optimization; Second-order cone programming; Matrix (chemical analysis); Quadratic equation; Representation (politics); Applied mathematics; Discrete mathematics; Algorithm; Convex optimization","retraction":null,"screen_n_in":null,"score":{"opus":0.2219451499796543,"gpt":0.4008517452339596,"spread":0.1789065952543053,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004542421,0.00007780576,0.0001611001,0.0002604545,0.00009597516,0.00002155558,0.0002022129,0.00005260148,0.00003619876],"category_scores_gemma":[0.0004894833,0.0000716327,0.00005104381,0.0002856608,0.00009669329,0.00007768512,0.000034704,0.0001279996,0.00001020644],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002168563,"about_ca_system_score_gemma":0.00003246883,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002347353,"about_ca_topic_score_gemma":0.00001484846,"domain_scores_codex":[0.9991018,0.00002883567,0.0003392018,0.0000922186,0.0002590791,0.0001788493],"domain_scores_gemma":[0.9987792,0.0003634225,0.00002668648,0.000365875,0.0004333149,0.00003147139],"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.00002049468,0.0006560161,0.00003843007,0.001126824,0.0001103732,0.000002130881,0.009996678,0.0311029,0.09184277,0.8608315,0.001901373,0.002370511],"study_design_scores_gemma":[0.0002294757,0.0004867443,0.00003670512,0.0007548045,0.00002567715,0.000004215363,0.00094433,0.4853562,0.4550013,0.05685236,0.0001246851,0.0001834805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5513864,0.0001624606,0.4338057,0.00003882213,0.00006170909,0.001519095,0.00003571079,0.0002477431,0.01274243],"genre_scores_gemma":[0.7331203,0.0000229527,0.266572,0.000001044507,0.000007527212,0.0001197149,0.000004204177,0.00001882143,0.000133532],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8039792,"threshold_uncertainty_score":0.2921097,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2169696642","doi":"10.1287/moor.1090.0416","title":"Sensitivity Analysis in Linear Semi-Infinite Programming via Partitions","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Optimization Algorithms Research","field":"Mathematics","cited_by":22,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs; Ministerio de Economía y Competitividad","keywords":"Mathematics; Linear programming; Bellman equation; Mathematical optimization; Function (biology); Partition (number theory); Sensitivity (control systems); Applied mathematics; Convex function; Extension (predicate logic); Linear-fractional programming; Domain (mathematical analysis); Regular polygon; Combinatorics; Mathematical analysis; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1224145560247939,"gpt":0.4600760896474391,"spread":0.3376615336226452,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004106821,0.00018288,0.0005322971,0.001773773,0.0003304166,0.0001064611,0.0002758255,0.0001318701,0.0002305501],"category_scores_gemma":[0.004024879,0.0001763828,0.0001567465,0.005423361,0.0002250104,0.0003401351,0.0001231136,0.00062062,0.00004827186],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001553701,"about_ca_system_score_gemma":0.0001654857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007385692,"about_ca_topic_score_gemma":0.0008880094,"domain_scores_codex":[0.9964198,0.000495158,0.0008728449,0.0003640035,0.001233493,0.0006146308],"domain_scores_gemma":[0.9960883,0.001454566,0.00007312615,0.0008272082,0.001398779,0.0001580186],"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.00003978773,0.006066272,0.0008631377,0.0004009198,0.000462232,0.00009699267,0.007817193,0.8496003,0.008953818,0.1145574,0.0003604397,0.01078151],"study_design_scores_gemma":[0.0003883342,0.00012852,0.0003626174,0.00007889288,0.00006042323,0.000008812363,0.0008014633,0.9582901,0.002991955,0.03660431,0.00008212532,0.0002024447],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1035799,0.00003328535,0.89183,0.0009914327,0.00002004272,0.001302301,0.00003559185,0.00009561684,0.002111808],"genre_scores_gemma":[0.5093207,0.00002916261,0.4896587,0.0000104089,0.00002888451,0.00008215037,0.0000373441,0.0000211209,0.0008114934],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.4057408,"threshold_uncertainty_score":0.7192681,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2111067176","doi":"10.1287/moor.25.4.679.12115","title":"Diffusion Approximations for Some Multiclass Queueing Networks with FIFO Service Disciplines","year":2000,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":21,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Semimartingale; Queueing theory; FIFO (computing and electronics); Layered queueing network; Mathematics; Heavy traffic approximation; Limit (mathematics); Diffusion; Computer science; Applied mathematics; Mathematical optimization; Discrete mathematics; Mathematical analysis; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.05305774655468025,"gpt":0.3397158762682272,"spread":0.286658129713547,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000981014,0.0001356929,0.0002337612,0.0003099232,0.0008008602,0.0002872153,0.0003404659,0.00004677854,0.0003356157],"category_scores_gemma":[0.0002875634,0.0001044422,0.00005813154,0.001112268,0.0001120504,0.001126558,0.0001228516,0.000162344,0.00006936338],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002882893,"about_ca_system_score_gemma":0.00002586894,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000163582,"about_ca_topic_score_gemma":0.0006903259,"domain_scores_codex":[0.998673,0.000026024,0.0003682814,0.000231742,0.0003930225,0.0003079824],"domain_scores_gemma":[0.9983497,0.0003479738,0.00006018128,0.0004346412,0.0007900995,0.00001741075],"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.00005054085,0.0003668843,0.00007225032,0.0005880116,0.0000512613,0.000001022131,0.0003763286,0.827418,0.001083559,0.1679504,0.0001063516,0.001935413],"study_design_scores_gemma":[0.0003778782,0.00001404882,0.00003588305,0.0001458005,0.00004089837,8.325419e-7,0.0007759182,0.9790431,0.0001604471,0.01869139,0.0005825332,0.000131317],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8530313,0.00003902186,0.1402679,0.002730194,0.00002457306,0.001168301,0.00001042017,0.00009461332,0.002633628],"genre_scores_gemma":[0.9418397,0.00001635686,0.0536186,0.0001393941,0.0004180055,0.0003898187,0.00008728461,0.00005628832,0.003434577],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1516251,"threshold_uncertainty_score":0.615965,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}