{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":330,"total_is_capped":false,"direct_labels_cover":0,"predictions_cover":330,"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":"6fd521a8eea0","filters":{"venue":"Operations Research"}},"results":[{"id":"W1968355947","doi":"10.1287/opre.1090.0741","title":"Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems","year":2010,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":1895,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Computer science; Probabilistic logic; Ambiguity; Portfolio optimization; Stochastic programming; Portfolio; Robust optimization; Covariance; Moment (physics); Covariance matrix; Range (aeronautics); Probability distribution; Gaussian; Optimization problem; Mathematics; Algorithm; Finance; Artificial intelligence; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.1984033885725615,"gpt":0.4534539503301592,"spread":0.2550505617575978,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.004219231,0.000136899,0.0001611735,0.0004756555,0.001011182,0.00108708,0.00137106,0.0001059537,0.0008217488],"category_scores_gemma":[0.0008971945,0.0000969395,0.00002332944,0.002784976,0.0001774016,0.00088621,0.0003834665,0.0004139746,0.0005197996],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000107822,"about_ca_system_score_gemma":0.0005831501,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004679119,"about_ca_topic_score_gemma":0.00544656,"domain_scores_codex":[0.9955615,0.0002748469,0.0005088357,0.0008515954,0.002423804,0.0003794213],"domain_scores_gemma":[0.994782,0.00030283,0.00005251367,0.001655539,0.002939107,0.0002679559],"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.00002384104,0.000111171,0.0005987646,8.935868e-7,0.000008678965,5.245146e-7,0.0001194258,0.9730078,0.0007822291,0.01382061,0.006969972,0.004556082],"study_design_scores_gemma":[0.0002246846,0.00008614289,0.001415008,0.000005384978,0.000004912027,0.000005353417,0.0002112283,0.9614902,0.00007377277,0.0004233588,0.03592366,0.00013632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01733203,0.00000783722,0.9696411,0.008673959,0.00009810441,0.00130086,0.0002537717,0.00004241923,0.002649906],"genre_scores_gemma":[0.8636986,0.00006555849,0.1279765,0.0001316909,0.0002189572,0.0005363431,0.00346794,0.00002518312,0.003879202],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8463665,"threshold_uncertainty_score":0.9999499,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1970355999","doi":"10.1287/opre.1050.0234","title":"Selected Topics in Column Generation","year":2005,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":1084,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Column generation; Column (typography); Perspective (graphical); Integer programming; Computer science; Dual (grammatical number); Linear programming; Decomposition; Point (geometry); Mathematical optimization; Operations research; Mathematics; Artificial intelligence; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.08886315424571074,"gpt":0.393188984849525,"spread":0.3043258306038143,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007835589,0.00005455227,0.00006665767,0.000246072,0.0001519469,0.0001260219,0.000101832,0.00006981999,0.0002623021],"category_scores_gemma":[0.0002814986,0.00006312932,0.000009377187,0.001123759,0.00002099784,0.0001931561,0.00002032444,0.0002886563,0.0001183875],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002127083,"about_ca_system_score_gemma":0.00007154743,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004849921,"about_ca_topic_score_gemma":0.002064953,"domain_scores_codex":[0.9990349,0.0002089316,0.000179281,0.0001220008,0.0002177014,0.0002371774],"domain_scores_gemma":[0.9994796,0.00004006122,0.000002208469,0.0001693464,0.0002638216,0.00004496438],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[5.654483e-7,0.00001710715,0.0004029769,0.000003592906,0.000002626748,6.679471e-7,0.0002772106,0.9683754,0.01675965,0.0006213547,0.002049029,0.01148978],"study_design_scores_gemma":[0.0001516816,0.000009975788,0.001544549,0.00000409481,5.749879e-7,0.000001464266,0.00002119201,0.9789404,0.01023522,0.000004089602,0.009021394,0.00006537659],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8878965,0.000194939,0.09517416,0.001994589,0.0001362279,0.0005137227,0.000005060995,0.0002610029,0.01382385],"genre_scores_gemma":[0.8462967,0.00007394569,0.1492654,0.00002663841,0.0004123849,0.0000882588,0.0000391667,0.00002269407,0.003774885],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05409123,"threshold_uncertainty_score":0.2872024,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2119601963","doi":"10.1287/opre.1120.1048","title":"A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":685,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Vehicle routing problem; Benchmark (surveying); Metaheuristic; Mathematical optimization; Computer science; Population; Genetic algorithm; Routing (electronic design automation); Algorithm; Mathematics; Medicine","retraction":null,"screen_n_in":null,"score":{"opus":0.06420246300526486,"gpt":0.3580434042946693,"spread":0.2938409412894044,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001445568,0.0001025818,0.0001145636,0.0001537299,0.0005590562,0.000213889,0.0001064852,0.00005070542,0.00004130988],"category_scores_gemma":[0.000286841,0.0001062317,0.00002522896,0.0002401513,0.0000681301,0.0002522123,0.00006170103,0.000232042,0.00002827939],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007823614,"about_ca_system_score_gemma":0.00003756439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000484222,"about_ca_topic_score_gemma":0.000008423943,"domain_scores_codex":[0.9986751,0.0001625999,0.0002173605,0.0001702949,0.0002271585,0.0005474593],"domain_scores_gemma":[0.9992352,0.0001925059,0.000006368768,0.000198518,0.0002080002,0.0001594322],"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.000002239299,0.00006905315,0.003985792,0.0001050225,0.00003898013,0.000001311914,0.002484212,0.703074,0.02358387,0.000342437,0.00034305,0.2659701],"study_design_scores_gemma":[0.000300904,0.00002761648,0.003623697,0.00001777149,0.000004901511,0.000014461,0.0001279318,0.9907183,0.003872706,0.00001214586,0.001156287,0.0001232455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3355439,0.0007417302,0.6623821,0.00008227894,0.0000975229,0.0006761429,0.0000194949,0.0001385734,0.0003182714],"genre_scores_gemma":[0.5581167,0.0000606455,0.4410846,0.000008284718,0.0001579684,0.0002542058,0.00001210783,0.00003729462,0.0002682672],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.2876444,"threshold_uncertainty_score":0.4332005,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2051358678","doi":"10.1287/opre.1060.0283","title":"A Branch-and-Cut Algorithm for the Dial-a-Ride Problem","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":672,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Branch and cut; Travelling salesman problem; Vehicle routing problem; Computer science; Integer programming; Mathematical optimization; Set (abstract data type); Routing (electronic design automation); Branch and price; 2-opt; Traveling purchaser problem; Algorithm; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.04499379721732293,"gpt":0.3588639218862965,"spread":0.3138701246689736,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00131969,0.00007237522,0.00007705641,0.0001001703,0.0005786,0.0002474624,0.0001390992,0.00005021537,0.00004148289],"category_scores_gemma":[0.0001269086,0.00005594532,0.00002514383,0.0003682992,0.00007633612,0.000115517,0.00003906368,0.0002053596,0.00002153515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004661217,"about_ca_system_score_gemma":0.00004283148,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002052139,"about_ca_topic_score_gemma":0.0002083557,"domain_scores_codex":[0.9990987,0.0001099655,0.0001606114,0.0001387428,0.0002130572,0.0002789523],"domain_scores_gemma":[0.9990296,0.0005066628,0.000003732073,0.0002031978,0.0002192307,0.00003757239],"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.000001512193,0.00001529487,0.00004325329,0.00001984279,0.00001561773,5.008947e-7,0.0001732721,0.8714188,0.002853279,0.003893735,0.003926619,0.1176382],"study_design_scores_gemma":[0.0002114469,0.00001539019,0.0002627453,0.000007405521,0.000004345769,0.000004332659,0.0000339765,0.9854132,0.002867009,0.0003565242,0.01075242,0.00007120999],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004125947,0.0004089767,0.9898782,0.001148059,0.00007325748,0.0008260225,0.00002457889,0.0001299088,0.003385094],"genre_scores_gemma":[0.214568,0.0001895901,0.7757881,0.00003309386,0.0005866443,0.001116139,0.0000431839,0.00007318611,0.007602034],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.21409,"threshold_uncertainty_score":0.4450182,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144743612","doi":"10.1287/opre.1080.0590","title":"Dynamic Multipriority Patient Scheduling for a Diagnostic Resource","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Healthcare Operations and Scheduling Optimization","field":"Health Professions","cited_by":380,"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; University of Ottawa","funders":"","keywords":"Computer science; Markov decision process; Mathematical optimization; Scheduling (production processes); Dynamic programming; Schedule; Revenue; Bellman equation; Linear programming; Markov process; Operations research; Dynamic priority scheduling; Job shop scheduling; Algorithm; Mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.2231130643184455,"gpt":0.5254930924542827,"spread":0.3023800281358371,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts"],"consensus_categories":[],"category_scores_codex":[0.002137567,0.0001418945,0.0002179847,0.000327663,0.009369535,0.00004829224,0.0002061547,0.0002512608,0.0002768415],"category_scores_gemma":[0.009856831,0.0001316977,0.0000630106,0.000724634,0.0001491021,0.0002362403,0.0001205756,0.001058942,0.0003977725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00046138,"about_ca_system_score_gemma":0.001670443,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000818014,"about_ca_topic_score_gemma":0.00166955,"domain_scores_codex":[0.996226,0.00130121,0.0006692894,0.0004495936,0.0005362896,0.0008176838],"domain_scores_gemma":[0.9940341,0.003107421,0.00003586767,0.0005169703,0.002041405,0.0002642049],"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.0003406133,0.001296089,0.0240041,0.0007190722,0.0001001085,0.00005493343,0.06570914,0.8361784,0.004665329,0.02342864,0.0195115,0.02399212],"study_design_scores_gemma":[0.001228928,0.0003456004,0.003582101,0.0002130974,0.000007442532,0.000008242182,0.006061784,0.9341978,0.00008240515,0.00008242048,0.05392305,0.0002671718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9085031,0.0003459398,0.07638831,0.007257526,0.0003337962,0.004707858,0.000107309,0.0001363531,0.002219766],"genre_scores_gemma":[0.8826721,0.0003174824,0.1093173,0.0004293574,0.0001901675,0.002697775,0.0003152787,0.00004601039,0.004014542],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09801941,"threshold_uncertainty_score":0.9984835,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2141532588","doi":"10.1287/opre.1070.0487","title":"The DEA Game Cross-Efficiency Model and Its Nash Equilibrium","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":371,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"National Natural Science Foundation of China","keywords":"Data envelopment analysis; Set (abstract data type); Mathematical optimization; Nash equilibrium; Computer science; Efficiency; Mathematical economics; Economics; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.3438138207026574,"gpt":0.5199786983413353,"spread":0.1761648776386779,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaresearch","sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.01054006,0.0001263968,0.0001856805,0.0004887311,0.003953744,0.001964086,0.001518702,0.00008629134,0.0001544942],"category_scores_gemma":[0.01236374,0.0000759274,0.00008529382,0.003025282,0.001221321,0.000649488,0.0005813047,0.0004597552,0.001058771],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006431022,"about_ca_system_score_gemma":0.0006881556,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006969833,"about_ca_topic_score_gemma":0.0002624217,"domain_scores_codex":[0.9942802,0.0006974977,0.0006199134,0.0006906601,0.003048907,0.0006628726],"domain_scores_gemma":[0.9939241,0.002247389,0.00003446464,0.001047038,0.002552787,0.0001941975],"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.00002417275,0.0001788066,0.001981329,0.000002190703,0.00001364585,0.00001580158,0.002471111,0.9418228,0.01631947,0.02890791,0.006045625,0.002217192],"study_design_scores_gemma":[0.0001366005,0.00004576693,0.002005714,0.00000339549,0.000002145566,0.00002384597,0.0001803795,0.9914542,0.0008590453,0.001613347,0.003574764,0.0001007379],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9812036,0.001106857,0.004641618,0.003301986,0.00007907453,0.0002867417,0.00001161274,0.0000299659,0.009338499],"genre_scores_gemma":[0.9449558,0.0001512308,0.0003491688,0.00006808033,0.00006160147,0.00003804107,0.000002108249,0.00001206893,0.0543619],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04963151,"threshold_uncertainty_score":0.999719,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2021662179","doi":"10.1287/opre.1040.0158","title":"Selecting Attributes to Measure the Achievement of Objectives","year":2005,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Safety Analysis","field":"Decision Sciences","cited_by":369,"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":"U.S. Department of Energy","keywords":"Measure (data warehouse); Computer science; Statement (logic); Proxy (statistics); Foundation (evidence); Meaning (existential); Management science; Problem statement; Operations research; Risk analysis (engineering); Data mining; Machine learning; Mathematics; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.3172619526135115,"gpt":0.5063036430112521,"spread":0.1890416903977406,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01243945,0.00005818098,0.0001416795,0.000393939,0.001142065,0.0003104981,0.0007817164,0.00003091803,0.0004680541],"category_scores_gemma":[0.008331117,0.00003182697,0.00007959948,0.003411319,0.0001080718,0.0002240712,0.000193887,0.0002408439,0.0005790627],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000064179,"about_ca_system_score_gemma":0.0001916221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003487209,"about_ca_topic_score_gemma":0.005737465,"domain_scores_codex":[0.9958543,0.0009451442,0.0003983238,0.0002766265,0.002267152,0.0002584927],"domain_scores_gemma":[0.9957412,0.001515667,0.00002045158,0.0005594956,0.002082727,0.00008045061],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007527022,0.0003528695,0.01616314,0.000002300752,0.000130795,0.00000109839,0.01529922,0.4017927,0.03832845,0.01557969,0.02827576,0.4839987],"study_design_scores_gemma":[0.001062594,0.0009335992,0.175414,0.00007088664,0.00005601742,0.000009340367,0.06371969,0.2314105,0.1730366,0.009589164,0.344065,0.0006326654],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7945226,0.0004986821,0.0281776,0.1615462,0.00005413452,0.000725851,0.00002683036,0.00001832164,0.01442977],"genre_scores_gemma":[0.9891732,0.00004139696,0.002929229,0.00008680305,0.0001088687,0.00004198234,0.000001656409,0.000004052614,0.007612798],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.483366,"threshold_uncertainty_score":0.9973727,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2142857718","doi":"10.1287/opre.50.6.1073.358","title":"An Object-Oriented Random-Number Package with Many Long Streams and Substreams","year":2002,"lang":"en","type":"article","venue":"Operations Research","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":343,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Disjoint sets; Generator (circuit theory); Random number generation; Reduction (mathematics); Implementation; Variance reduction; Sequence (biology); Set (abstract data type); Java; Variance (accounting); Algorithm; Parallel computing; Mathematics; Discrete mathematics; Programming language; Statistics; Power (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.03584947236627194,"gpt":0.3315742707934994,"spread":0.2957247984272275,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004726377,0.0001202965,0.0001284726,0.0001275745,0.0008159103,0.0008115542,0.0005164207,0.00005459868,0.0003949217],"category_scores_gemma":[0.00003747647,0.00008583366,0.00001651913,0.0006712871,0.0001477293,0.001405755,0.0002479553,0.0002857234,0.0001832335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003110489,"about_ca_system_score_gemma":0.00004482328,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004465804,"about_ca_topic_score_gemma":0.0004219021,"domain_scores_codex":[0.9980927,0.0002602666,0.0001521229,0.0004932821,0.0006170481,0.0003845638],"domain_scores_gemma":[0.9984814,0.00009666265,0.00001174411,0.0008896836,0.000297725,0.0002228091],"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.0002451788,0.003153918,0.04994977,0.00007730133,0.0001617148,0.0009673906,0.0126487,0.003254668,0.008355089,0.09514139,0.02073332,0.8053116],"study_design_scores_gemma":[0.002009255,0.0003410314,0.007737054,0.00004609321,0.000004065006,0.00009574076,0.0002442499,0.9845737,0.00221627,0.00007524116,0.002414615,0.0002426771],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5107361,0.0002087228,0.483281,0.0005631644,0.00006446425,0.0004811745,0.00002186672,0.0001111624,0.004532382],"genre_scores_gemma":[0.9699847,0.0001584362,0.02726181,0.0000300403,0.00007494852,0.00006666726,0.00004519847,0.00001277245,0.002365466],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.981319,"threshold_uncertainty_score":0.7825836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078286604","doi":"10.1287/opre.1080.0603","title":"Technical Note—A Risk-Averse Newsvendor Model Under the CVaR Criterion","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":332,"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":"Ministry of Education of the People's Republic of China","keywords":"Newsvendor model; CVAR; Economics; Comparative statics; Expected shortfall; Multiplicative function; Mathematical economics; Econometrics; Risk measure; Mathematical optimization; Mathematics; Risk management; Microeconomics; Supply chain; Financial economics","retraction":null,"screen_n_in":null,"score":{"opus":0.09269831753737455,"gpt":0.3649576188607971,"spread":0.2722593013234226,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001460603,0.0001231377,0.0001022926,0.0003253722,0.001272534,0.000887261,0.0005018633,0.00006589555,0.000776972],"category_scores_gemma":[0.0002731625,0.00008758731,0.00007251726,0.0007372664,0.000129213,0.000830808,0.000246565,0.000455591,0.001176385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000988393,"about_ca_system_score_gemma":0.00004945238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007598304,"about_ca_topic_score_gemma":0.0006178938,"domain_scores_codex":[0.998371,0.00006826154,0.0002169538,0.0003003497,0.0006377493,0.0004056994],"domain_scores_gemma":[0.9990839,0.00005804798,0.00002244282,0.0005414461,0.000273239,0.00002089577],"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.00006622164,0.0004783836,0.0001375077,0.00002791845,0.00001478927,0.00001275861,0.0001881555,0.1803033,0.007209294,0.5477339,0.2438964,0.01993144],"study_design_scores_gemma":[0.0003417612,0.00002503515,0.001311694,0.00001447352,0.00001665676,8.89042e-7,0.0005543783,0.8422463,0.00005603974,0.006873813,0.1484165,0.0001424906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1378048,0.0002765495,0.2003278,0.1626773,0.000826576,0.004417687,0.00002389995,0.0007360373,0.4929094],"genre_scores_gemma":[0.9858356,0.00004941236,0.00138687,0.004287748,0.0007780537,0.00008668052,0.0000359246,0.00001864089,0.007521032],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8480309,"threshold_uncertainty_score":0.9996013,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2023482164","doi":"10.1287/opre.50.3.415.7751","title":"An Integer <i>L</i>-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands","year":2002,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":282,"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; HEC Montréal","funders":"","keywords":"Vehicle routing problem; Integer (computer science); Mathematical optimization; Computer science; Integer programming; Routing (electronic design automation); Operations research; TRIPS architecture; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.07063186204221393,"gpt":0.3441733096093075,"spread":0.2735414475670935,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001546688,0.0001389514,0.0001300001,0.0001548801,0.000957034,0.0003677683,0.0003046616,0.0000752634,0.0001716873],"category_scores_gemma":[0.0001873732,0.00009912931,0.0000285006,0.0008448548,0.0001212069,0.0003174107,0.00002749583,0.0004505597,0.00003910012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009766914,"about_ca_system_score_gemma":0.00003532798,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005307667,"about_ca_topic_score_gemma":0.00009989234,"domain_scores_codex":[0.998422,0.0002272442,0.0002400555,0.0002456471,0.0003741906,0.0004908951],"domain_scores_gemma":[0.9983677,0.0005438496,0.00001036675,0.0003856616,0.0005829768,0.0001094556],"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.000003632693,0.00003656496,0.00001265725,0.00001020364,0.00003461438,8.971105e-7,0.001455946,0.9706272,0.002986887,0.0003296262,0.0002603169,0.0242414],"study_design_scores_gemma":[0.0004566754,0.0001347881,0.00002782895,0.00002678158,0.00001220868,0.000007830081,0.0006293818,0.9978009,0.0005598681,0.00001806629,0.0001839187,0.0001417126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007858652,0.0001108771,0.9896825,0.0004177349,0.00004854471,0.000972114,0.00002081251,0.0002448043,0.0006439884],"genre_scores_gemma":[0.7281141,0.00001447529,0.2703485,0.00002897449,0.000120127,0.0005377062,0.00002240674,0.00006782935,0.0007459347],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7202554,"threshold_uncertainty_score":0.7360829,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041183433","doi":"10.1287/opre.48.1.129.12455","title":"A Tabu Search Heuristic for the Capacitated arc Routing Problem","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":278,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Arc routing; Tabu search; Heuristics; Benchmark (surveying); Mathematical optimization; Routing (electronic design automation); Computer science; Heuristic; Arc (geometry); Vehicle routing problem; Guided Local Search; Operations research; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.09081247834877422,"gpt":0.380172694943396,"spread":0.2893602165946217,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003029615,0.0001115167,0.0001141921,0.0001462669,0.001126055,0.0003552973,0.0003313551,0.00007057533,0.0008759877],"category_scores_gemma":[0.0004544606,0.00008892971,0.00004319878,0.0009566742,0.0001234157,0.0001457033,0.00003152834,0.0005158729,0.000206395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001212725,"about_ca_system_score_gemma":0.00011258,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001707429,"about_ca_topic_score_gemma":0.00009223954,"domain_scores_codex":[0.9981822,0.0003375899,0.0002649246,0.0002180195,0.0004210994,0.0005761629],"domain_scores_gemma":[0.9981133,0.0009680744,0.000003950563,0.0003787194,0.0004454508,0.00009046114],"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.000007227137,0.00001643984,0.00003171516,0.00002797679,0.0000248789,9.068692e-7,0.001387736,0.971073,0.001880674,0.001498958,0.001192892,0.02285756],"study_design_scores_gemma":[0.0002525307,0.00003331952,0.0001528361,0.00002237306,0.000005732682,0.000005623011,0.0003644028,0.9934278,0.001193445,0.0000698679,0.004365942,0.0001062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1746136,0.0005036002,0.7836055,0.00336959,0.0001828404,0.004075391,0.0001005107,0.0007646176,0.03278438],"genre_scores_gemma":[0.8628458,0.000152025,0.1267423,0.00002987289,0.0001871141,0.0006285801,0.00003909149,0.00007428656,0.009300929],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6882322,"threshold_uncertainty_score":0.9591451,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2028552829","doi":"10.1287/opre.48.3.444.12431","title":"Improvements and Comparison of Heuristics for Solving the Uncapacitated Multisource Weber Problem","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":273,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Group for Research in Decision Analysis; HEC Montréal; University of Prince Edward Island","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Ministère de la Défense Nationale","keywords":"Heuristics; Tabu search; Mathematical optimization; Computer science; Euclidean geometry; Local search (optimization); Mathematics; Variable (mathematics); Variable neighborhood search; Metaheuristic","retraction":null,"screen_n_in":null,"score":{"opus":0.1092467799622483,"gpt":0.3709914049800954,"spread":0.2617446250178471,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009401646,0.00007468503,0.00009849107,0.0001264615,0.0007224072,0.0002432905,0.0001846384,0.0000281789,0.0006521823],"category_scores_gemma":[0.0001753847,0.00005622639,0.00002473261,0.0004094862,0.0001273947,0.0002908153,0.00008420901,0.0001168907,0.0001027986],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001697946,"about_ca_system_score_gemma":0.00001704959,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002642255,"about_ca_topic_score_gemma":0.002758443,"domain_scores_codex":[0.9989934,0.00002097614,0.0002805207,0.0001803723,0.0003021889,0.000222541],"domain_scores_gemma":[0.9992306,0.0000469152,0.0000119553,0.0002115225,0.0004886579,0.00001036552],"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.0003337782,0.002042377,0.01661674,0.002359628,0.000325121,0.000001012806,0.00615373,0.2888615,0.01626589,0.1597891,0.1432073,0.3640438],"study_design_scores_gemma":[0.0004589939,0.00002864109,0.002419827,0.00002263351,0.0000163353,8.225527e-8,0.001485207,0.8803145,0.0001790447,0.000336602,0.1146417,0.00009643277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9748369,0.0001365444,0.002971522,0.00549943,0.00009557557,0.002223975,0.00001805853,0.00004558187,0.01417245],"genre_scores_gemma":[0.9907537,0.00002730523,0.001007863,0.0001541121,0.00009013516,0.0001869903,0.00005423233,0.00001036956,0.007715289],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.591453,"threshold_uncertainty_score":0.7140939,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2129895618","doi":"10.1287/opre.1060.0348","title":"Facility Reliability Issues in Network <i>p</i>-Median Problems: Strategic Centralization and Co-Location Effects","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Facility Location and Emergency Management","field":"Business, Management and Accounting","cited_by":261,"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":"Facility location problem; Reliability (semiconductor); Heuristic; Computer science; Service (business); Mathematical optimization; Operations research; Reliability engineering; Business; Mathematics; Artificial intelligence; Engineering; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.06620743073759103,"gpt":0.3516931619654158,"spread":0.2854857312278248,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00501525,0.0001324072,0.0001411035,0.0003519204,0.0004860992,0.0003969227,0.0001673766,0.00008565871,0.0002015514],"category_scores_gemma":[0.0004952409,0.0001298312,0.00002037633,0.001702847,0.0001430665,0.0009523639,0.00009486696,0.0002465772,0.000308948],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001183363,"about_ca_system_score_gemma":0.00005135289,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_topic_score_codex":0.01106338,"about_ca_topic_score_gemma":0.04694013,"domain_scores_codex":[0.9980048,0.000113477,0.000420342,0.000423994,0.0005161915,0.0005211791],"domain_scores_gemma":[0.9989938,0.0000632769,0.00001453764,0.0003314753,0.0005620653,0.00003489856],"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.0001329899,0.001042173,0.2287122,0.003152492,0.00003268913,0.00001168142,0.001449641,0.575047,0.001129092,0.163957,0.01003756,0.0152955],"study_design_scores_gemma":[0.001497557,0.00007880822,0.4227829,0.0002258112,0.00002012252,8.695156e-7,0.00258337,0.5058392,0.0002422323,0.0101053,0.05596819,0.0006556866],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9785371,0.0003174328,0.004905595,0.004407845,0.0002693205,0.002130416,0.000003996279,0.0001074621,0.009320867],"genre_scores_gemma":[0.9981643,0.0001402698,0.0002393312,0.0002002398,0.0002627847,0.0001097929,0.0002875982,0.000008409384,0.0005872977],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1940707,"threshold_uncertainty_score":0.995522,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2154706439","doi":"10.1287/opre.1060.0368","title":"Dynamic Bid Prices in Revenue Management","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":253,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of British Columbia; University of Chicago","keywords":"Monotone polygon; Affine transformation; Dynamic programming; Bellman equation; Monotonic function; Function (biology); Mathematical optimization; Linear programming; Value (mathematics); Mathematics; Computer science; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.05816959240240425,"gpt":0.3646447303312125,"spread":0.3064751379288082,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003120446,0.0001017402,0.00009760154,0.001359519,0.0003370168,0.0004111432,0.0003691627,0.00004250437,0.0006518145],"category_scores_gemma":[0.00007182498,0.00009967934,0.00003280451,0.00167538,0.00007211239,0.0007103962,0.0003364749,0.0002304691,0.00153154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001577374,"about_ca_system_score_gemma":0.0000139052,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001006204,"about_ca_topic_score_gemma":0.008720717,"domain_scores_codex":[0.9983511,0.00001737738,0.0002687675,0.0003030641,0.0005530576,0.0005066121],"domain_scores_gemma":[0.999458,0.00003153236,0.00001721504,0.0003335691,0.0001432595,0.00001637958],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001129562,0.001046979,0.01248796,0.0007081951,0.00008522159,0.0004796843,0.0005569384,0.005437004,0.001967703,0.8187433,0.06843337,0.0899407],"study_design_scores_gemma":[0.0008458555,0.00001979007,0.05639076,0.0001136968,0.00001030389,0.00000102616,0.003059028,0.03657576,0.0000651668,0.002668051,0.8999507,0.0002998806],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5239456,0.0002164496,0.002612373,0.00407809,0.0004920865,0.001524442,0.000003316783,0.00009333323,0.4670343],"genre_scores_gemma":[0.979909,0.00006730737,0.001490003,0.0006517611,0.0002759125,0.0001177468,0.00004630792,0.00002410058,0.01741784],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8315173,"threshold_uncertainty_score":0.9992459,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2157158960","doi":"10.1287/opre.1110.0965","title":"Benders Decomposition for Large-Scale Uncapacitated Hub Location","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":237,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Concordia University","funders":"","keywords":"Benders' decomposition; Mathematical optimization; Benchmark (surveying); Robustness (evolution); Heuristic; Computer science; Decomposition; Set (abstract data type); Algorithm; Reduction (mathematics); Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1269248190035982,"gpt":0.4001214067080162,"spread":0.273196587704418,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001264072,0.00008225231,0.00008427608,0.0002514188,0.0004303397,0.0000826777,0.0001390075,0.00008632309,0.0002095027],"category_scores_gemma":[0.0001711009,0.00009031874,0.00002786715,0.0006775821,0.00003563026,0.0002616386,0.00002048956,0.0001892027,0.00008582722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001231662,"about_ca_system_score_gemma":0.00005260226,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000323302,"about_ca_topic_score_gemma":0.0001569243,"domain_scores_codex":[0.9989226,0.0001640412,0.0001986044,0.0001725276,0.0002091514,0.0003330418],"domain_scores_gemma":[0.9989133,0.00009714744,0.000005903191,0.0002350707,0.0006700245,0.0000785533],"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.00002014331,0.0001140771,0.0002291639,0.00007290855,0.00003734541,6.331503e-7,0.005441788,0.9647171,0.01543632,0.008785401,0.002478873,0.002666247],"study_design_scores_gemma":[0.0003229033,0.0000500809,0.0007088865,0.0000152595,0.000005354138,0.00000168759,0.0007833117,0.9786235,0.0184791,0.0002540915,0.0006475152,0.0001083122],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04329809,0.00004106715,0.9486955,0.0001048911,0.00012809,0.0005624461,0.00002328553,0.0002256828,0.006920987],"genre_scores_gemma":[0.6991071,0.00001845706,0.3000026,0.00001504859,0.00004949008,0.0002272527,0.0001280469,0.00003331044,0.0004187139],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.655809,"threshold_uncertainty_score":0.3683091,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165622730","doi":"10.1287/opre.1080.0685","title":"Percentile Optimization for Markov Decision Processes with Parameter Uncertainty","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Multi-Objective Optimization Algorithms","field":"Computer Science","cited_by":228,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; HEC Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies","keywords":"Ambiguity; Computer science; Markov decision process; Mathematical optimization; Parametric statistics; Set (abstract data type); Percentile; Markov chain; Markov process; Process (computing); Decision process; Operations research; Machine learning; Mathematics; Management science; Statistics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.04191846451408229,"gpt":0.3783378437581784,"spread":0.3364193792440962,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005080008,0.0001343345,0.0001315017,0.0003115366,0.0008150827,0.000637746,0.0005792025,0.00006263731,0.00006974029],"category_scores_gemma":[0.001525164,0.0001068329,0.00002809073,0.00156458,0.00008147983,0.001289377,0.00008182591,0.0001700532,0.00001844263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001513055,"about_ca_system_score_gemma":0.0005057167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001381114,"about_ca_topic_score_gemma":0.00009712534,"domain_scores_codex":[0.9981301,0.000108311,0.0002112481,0.0005581715,0.0005900671,0.000402083],"domain_scores_gemma":[0.9961469,0.0005941756,0.00002205341,0.0005183817,0.002601885,0.000116617],"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.00004344757,0.0001342298,0.000009844848,0.000008037128,0.00000492838,0.000001886047,0.0002760475,0.9474351,0.00006982444,0.001682862,0.0002465305,0.05008722],"study_design_scores_gemma":[0.0006610031,0.0003938919,0.0001123646,0.00003798865,0.000002250795,0.000008856593,0.00008518197,0.996733,0.000571718,0.0005172674,0.0007244789,0.0001519624],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001168085,0.00004772209,0.9958649,0.001069407,0.0000502003,0.001123519,0.00000992358,0.0001024805,0.0005637656],"genre_scores_gemma":[0.08008291,0.00008525523,0.9183091,0.0001434409,0.00004671732,0.0002713251,0.00004659555,0.00001401732,0.001000647],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.07891482,"threshold_uncertainty_score":0.626904,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2964571806","doi":"10.1287/opre.2018.1822","title":"Empty-Car Routing in Ridesharing Systems","year":2019,"lang":"en","type":"article","venue":"Operations Research","topic":"Transportation and Mobility Innovations","field":"Engineering","cited_by":226,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Chinese University of Hong Kong; University of Hong Kong; University of Toronto","keywords":"Computer science; Vehicle routing problem; Routing (electronic design automation); Operations research; Transport engineering; Mathematical optimization; Computer network; Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.05969899393229509,"gpt":0.3478440487347684,"spread":0.2881450548024733,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006687058,0.00005848422,0.00008439173,0.0003190799,0.0001028137,0.0001301264,0.0001172348,0.00005018742,0.0002152967],"category_scores_gemma":[0.00004229795,0.00006301596,0.00001555403,0.0008249905,0.00001789778,0.0002219498,0.00001153433,0.0003358363,0.0005232015],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001153729,"about_ca_system_score_gemma":0.00005153827,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000450789,"about_ca_topic_score_gemma":0.0008709821,"domain_scores_codex":[0.9991032,0.00003791568,0.0002429182,0.0001365184,0.0002332094,0.0002462596],"domain_scores_gemma":[0.9995154,0.00005336162,0.000002760131,0.0002298496,0.0001622584,0.00003636212],"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.000001370485,0.00002382903,0.021542,0.00005168826,0.0000097816,0.000002267363,0.000876525,0.9198768,0.02201767,0.03493887,0.0003232918,0.0003359277],"study_design_scores_gemma":[0.0003954953,0.00001824659,0.06822649,0.00008709693,0.000001546557,0.000002186814,0.001697963,0.9239589,0.001372649,0.00001858361,0.004060576,0.000160266],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9781448,0.00004683208,0.001173518,0.0001204503,0.0002042923,0.0004724183,0.00001139065,0.0001105115,0.01971583],"genre_scores_gemma":[0.9979188,0.00001435403,0.0002344034,0.000007415856,0.00003329271,0.0001203361,0.00004577484,0.00001589704,0.001609708],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04668449,"threshold_uncertainty_score":0.6724872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1931616235","doi":"10.1287/opre.2015.1401","title":"Benders Decomposition for Production Routing Under Demand Uncertainty","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":214,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"HEC Montréal; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Mathematical optimization; Production (economics); Routing (electronic design automation); Generalization; Branch and cut; Stochastic programming; Computer science; Pareto principle; Benders' decomposition; Upper and lower bounds; Exploit; Decomposition method (queueing theory); Decomposition; Time horizon; Mathematics; Linear programming; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.1613136766649102,"gpt":0.438498401075115,"spread":0.2771847244102048,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002523881,0.00008183222,0.00008827205,0.0001888164,0.0004013841,0.0001502938,0.0001035144,0.00007124522,0.00001713825],"category_scores_gemma":[0.0006600243,0.00008568056,0.0000255311,0.0004707755,0.00005828504,0.0002648403,0.00002600348,0.0001998315,0.00002613125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003290341,"about_ca_system_score_gemma":0.0001106096,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004203594,"about_ca_topic_score_gemma":0.000118057,"domain_scores_codex":[0.9987887,0.0002226903,0.0001902635,0.0002003662,0.0002983699,0.0002996728],"domain_scores_gemma":[0.9988875,0.0001212536,0.000006144708,0.000206045,0.0006695385,0.0001094907],"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.000007723458,0.00001516193,0.00005345544,0.00001353789,0.00001362035,1.557066e-7,0.0005959082,0.9890614,0.004706469,0.00220391,0.001947934,0.001380702],"study_design_scores_gemma":[0.0002925481,0.00003796629,0.00008591691,0.00001503056,0.000005127246,0.000004466906,0.001270547,0.9911736,0.005974706,0.0004792334,0.0005595519,0.0001013594],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1363008,0.00006988941,0.8594272,0.001142014,0.0003255541,0.0006708321,0.000006243359,0.0002195908,0.001837844],"genre_scores_gemma":[0.8794162,0.0000132646,0.1194682,0.0000159291,0.0002327215,0.0001669108,0.00007651555,0.00003226972,0.000577968],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7431154,"threshold_uncertainty_score":0.3493952,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1999377979","doi":"10.1287/opre.50.3.517.7752","title":"The Censored Newsvendor and the Optimal Acquisition of Information","year":2002,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":200,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; University of British Columbia; Mitacs","keywords":"Newsvendor model; Unobservable; Censoring (clinical trials); Bayesian probability; Economics; Parametric statistics; Econometrics; Computer science; Lost sales; Decision process; Markov chain; Markov decision process; Markov process; Mathematical optimization; Mathematics; Supply chain; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.0423997385936676,"gpt":0.2831538766877301,"spread":0.2407541380940625,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001279633,0.00004948452,0.0000574513,0.0001466642,0.0009640662,0.0007177514,0.0001945122,0.00001932542,0.0004601486],"category_scores_gemma":[0.0002192057,0.00002730759,0.00002548545,0.0003800561,0.0002956978,0.001077824,0.0001639354,0.0001047506,0.0002553119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001513719,"about_ca_system_score_gemma":0.000005261907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004078193,"about_ca_topic_score_gemma":0.00007717375,"domain_scores_codex":[0.9991822,0.00005308239,0.0001824763,0.00006849337,0.0003522273,0.0001615576],"domain_scores_gemma":[0.9993824,0.00009837782,0.00002533897,0.0002025563,0.0002849724,0.000006342892],"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.00007676237,0.00004159387,0.0001785126,0.00004580172,0.00002696434,4.693181e-7,0.0006908033,0.002824445,0.00008477899,0.9041284,0.06895797,0.02294349],"study_design_scores_gemma":[0.001179703,0.00001463331,0.001188717,0.0000132409,0.00001056856,6.989674e-7,0.003068406,0.5780094,0.00005520445,0.0007556073,0.4156383,0.0000655178],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4323045,0.00136181,0.003146534,0.1351089,0.0006965317,0.004227741,0.00001258685,0.0001192567,0.4230221],"genre_scores_gemma":[0.9963118,0.000192411,0.0001167729,0.0005045579,0.0002308838,0.0001016047,0.00001722485,0.000004621417,0.002520079],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9033728,"threshold_uncertainty_score":0.7414916,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2078227935","doi":"10.1287/opre.1090.0713","title":"Branch-and-Price-and-Cut for the Split-Delivery Vehicle Routing Problem with Time Windows","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":198,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Vehicle routing problem; Knapsack problem; Mathematical optimization; Computer science; Relaxation (psychology); Integer programming; Routing (electronic design automation); Branch and price; Shortest path problem; Set (abstract data type); Bounded function; Mathematics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.03652744760081844,"gpt":0.3253852390021137,"spread":0.2888577914012953,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001559526,0.000108902,0.0001207894,0.0001033816,0.0007565379,0.0003230728,0.000149342,0.00006100952,0.0000353152],"category_scores_gemma":[0.0001608131,0.0000788769,0.00001950158,0.0004065693,0.0000812252,0.0002279393,0.00004233787,0.0002974216,0.00001920171],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005201776,"about_ca_system_score_gemma":0.00005501498,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000293121,"about_ca_topic_score_gemma":0.00002235399,"domain_scores_codex":[0.9988745,0.0001276438,0.0001780105,0.0002097274,0.0002496236,0.0003605163],"domain_scores_gemma":[0.9989249,0.0005055119,0.000008233385,0.0002396402,0.0002412758,0.00008041688],"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.00003084413,0.00002568037,0.000290363,0.00003625779,0.00004638447,0.000001214543,0.001281029,0.9149184,0.02055383,0.004380065,0.0005323803,0.05790351],"study_design_scores_gemma":[0.0004271638,0.0001261366,0.001837648,0.00003098906,0.000009850473,0.000009273521,0.00009307171,0.9947408,0.00172491,0.00009390914,0.0007900855,0.0001160918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6583716,0.0009707982,0.3207959,0.007080074,0.00005179765,0.003215039,0.00002658048,0.0004652498,0.009022999],"genre_scores_gemma":[0.9147499,0.0001266147,0.08312275,0.00007455114,0.0001060676,0.0001266598,0.000008581334,0.00003417528,0.001650705],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2563783,"threshold_uncertainty_score":0.5818754,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2032091434","doi":"10.1287/opre.1100.0906","title":"Adaptive Data-Driven Inventory Control with Censored Demand Based on Kaplan-Meier Estimator","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":196,"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":"Division of Civil, Mechanical and Manufacturing Innovation; Office of Naval Research; National Science Foundation","keywords":"Estimator; Newsvendor model; Computer science; Nonparametric statistics; Consistency (knowledge bases); Mathematical optimization; Econometrics; Inventory control; Quantile; Product (mathematics); Mathematics; Statistics; Operations research","retraction":null,"screen_n_in":null,"score":{"opus":0.1650692678379945,"gpt":0.3201718275990081,"spread":0.1551025597610136,"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.001087061,0.0001858868,0.0001834938,0.0006093371,0.0006906387,0.00039222,0.0007318837,0.00005949271,0.002269486],"category_scores_gemma":[0.0001771022,0.0001460571,0.00003328881,0.0005862785,0.0002183078,0.001103281,0.0002405422,0.000292029,0.001307605],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007342487,"about_ca_system_score_gemma":0.0001034484,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00108327,"about_ca_topic_score_gemma":0.0009317291,"domain_scores_codex":[0.9979045,0.000105015,0.0002225758,0.0005324775,0.0007666753,0.0004687978],"domain_scores_gemma":[0.9984841,0.00006401014,0.00003592329,0.0009505984,0.0004195423,0.00004587378],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.003733765,0.003582703,0.0614417,0.0004130297,0.0006702288,0.0004873137,0.000811071,0.13352,0.0003509035,0.3730783,0.4184584,0.003452452],"study_design_scores_gemma":[0.001683668,0.000134938,0.00330073,0.00007019101,0.00003859698,5.532308e-7,0.0005120985,0.957267,0.00003244165,0.0001122098,0.03662454,0.0002229765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1293348,0.0001672372,0.05725761,0.007619669,0.0009530028,0.007856106,0.000267218,0.0006892184,0.7958551],"genre_scores_gemma":[0.9931464,0.000003250165,0.002655254,0.001469138,0.0004155724,0.0002264873,0.0002867783,0.00004194727,0.001755134],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8638116,"threshold_uncertainty_score":0.99947,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1983931196","doi":"10.1287/opre.51.5.771.16749","title":"A Three-Stage Model for a Decentralized Distribution System of Retailers","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":193,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"University of British Columbia","keywords":"Residual; Profit (economics); Stage (stratigraphy); Transshipment (information security); Supply chain; Third stage; Supply and demand; Operations research; Microeconomics; Computer science; Business; Economics; Mathematics; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.4011792634695643,"gpt":0.5137170311918997,"spread":0.1125377677223354,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00723141,0.00006770751,0.0001577318,0.0001627429,0.0008268787,0.0001931065,0.0004290113,0.00006587429,0.0002721608],"category_scores_gemma":[0.003862125,0.00005297119,0.00009157959,0.001195674,0.0002099672,0.0002232025,0.00003796631,0.0001246849,0.0001186621],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001019841,"about_ca_system_score_gemma":0.0003130833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002681339,"about_ca_topic_score_gemma":0.0001938244,"domain_scores_codex":[0.9975987,0.0003464838,0.000492503,0.0003243064,0.0009738795,0.0002641277],"domain_scores_gemma":[0.9969363,0.0007153723,0.0000459978,0.0006159052,0.00158161,0.0001048199],"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.0000299111,0.00005467832,0.00008642335,0.000007224477,0.000006505341,1.136227e-7,0.0001677493,0.05994533,0.002219306,0.933928,0.002911717,0.0006430083],"study_design_scores_gemma":[0.0003955413,0.00003379192,0.00005518467,0.0000097046,0.000004801115,0.000001943341,0.002119244,0.9493117,0.005292171,0.02455296,0.01815317,0.00006974819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06010756,0.0000396021,0.9359357,0.0004619622,0.00004093304,0.0008661432,0.0004039423,0.00002093779,0.002123164],"genre_scores_gemma":[0.9859737,0.000006633486,0.006996193,0.000006257703,0.00001320917,0.0004968533,0.00005200647,0.000007227314,0.006447917],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9289396,"threshold_uncertainty_score":0.6359766,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2064035628","doi":"10.1287/opre.51.4.655.16098","title":"Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":193,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Computer Research Institute of Montréal; Université du Québec à Montréal; Université de Montréal","funders":"","keywords":"Neighbourhood (mathematics); Tabu search; Mathematical optimization; Fixed charge; Network planning and design; Metaheuristic; Flow network; Computer science; Simple (philosophy); Flow (mathematics); Multi-commodity flow problem; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1244174663249808,"gpt":0.375052910876536,"spread":0.2506354445515552,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003752542,0.000152476,0.0001756179,0.0001851929,0.0007774603,0.0002209233,0.00020613,0.000136637,0.0004052677],"category_scores_gemma":[0.001737925,0.0001610179,0.00005745428,0.0008424799,0.00007368735,0.0001669572,0.00001529267,0.0004027746,0.0000939937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001672543,"about_ca_system_score_gemma":0.0001700221,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002325382,"about_ca_topic_score_gemma":0.00002854365,"domain_scores_codex":[0.9974614,0.001017614,0.0002924229,0.0002496893,0.0003156968,0.0006631611],"domain_scores_gemma":[0.997775,0.001134151,0.000009602235,0.0004139552,0.0005092947,0.0001579946],"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.000009134175,0.00004227414,0.00007439404,0.00002263532,0.00001918707,9.17448e-7,0.0001013594,0.9870769,0.002753171,0.004053839,0.005155132,0.000691018],"study_design_scores_gemma":[0.0006465916,0.00005123482,0.00005007425,0.00001503277,0.00000612595,0.000001310624,0.00002202709,0.9808561,0.01416039,0.0002024543,0.00381463,0.0001740149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005515533,0.00009806172,0.9904651,0.0002410304,0.0002190249,0.001035858,0.00002878676,0.0002623477,0.002134256],"genre_scores_gemma":[0.3813086,0.00001259649,0.6176606,0.00004566898,0.0000958299,0.0004038206,0.00004331163,0.00006079383,0.0003687405],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3757931,"threshold_uncertainty_score":0.6566118,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2096168409","doi":"10.1287/opre.1060.0326","title":"Joint Pricing-Production Decisions in Supply Chains of Complementary Products with Uncertain Demand","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":180,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"University of California, Irvine; Wilfrid Laurier University","keywords":"Consignment; Profit (economics); Microeconomics; Business; Production (economics); Supply chain; Multiplicative function; Revenue management; Product (mathematics); Revenue; Revenue sharing; Industrial organization; Channel (broadcasting); Economics; Computer science; Marketing; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.1013337163313257,"gpt":0.322372789839118,"spread":0.2210390735077924,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00176619,0.000131835,0.0001805566,0.001102442,0.0004041392,0.0001969743,0.0002285485,0.00002987355,0.0003232046],"category_scores_gemma":[0.0002463503,0.0001090849,0.00002668287,0.001970071,0.0001581709,0.0007226816,0.0002029656,0.0002018421,0.00007232749],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000126069,"about_ca_system_score_gemma":0.0000768442,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01164461,"about_ca_topic_score_gemma":0.01680007,"domain_scores_codex":[0.9979974,0.00006730136,0.0004055688,0.0004146788,0.0007209263,0.0003941157],"domain_scores_gemma":[0.9988731,0.00003714689,0.00004305901,0.0004204382,0.0006140815,0.00001213079],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.0003303342,0.003109494,0.1435901,0.0006042863,0.0001023751,0.00008065592,0.0008607706,0.2990193,0.04000856,0.3258583,0.1781046,0.008331211],"study_design_scores_gemma":[0.007249458,0.0005275644,0.4353489,0.00144265,0.0001101084,0.00001687187,0.01534636,0.2255362,0.02250694,0.007597834,0.2826768,0.001640326],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9736438,0.00009920636,0.0006810935,0.01078369,0.0001627582,0.001529615,0.000005626342,0.00003919601,0.01305502],"genre_scores_gemma":[0.9946305,0.00002645233,0.001298575,0.0001402828,0.0006004828,0.0001499112,0.0002110969,0.00002169926,0.002921015],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3182604,"threshold_uncertainty_score":0.9949369,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2167053528","doi":"10.1287/opre.1100.0798","title":"Information Acquisition for Capacity Planning via Pricing and Advance Selling: When to Stop and Act?","year":2010,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":179,"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":"Revenue management; Capacity management; Revenue; Profit (economics); Business; Capacity planning; Dynamic pricing; Profit maximization; Marginal revenue; Marketing; Maximization; Capacity utilization; Operations research; Computer science; Industrial organization; Microeconomics; Operations management; Economics; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.05707500104350986,"gpt":0.3257481535987947,"spread":0.2686731525552848,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009612568,0.00007533937,0.00007324556,0.0003749488,0.0007147133,0.0007914361,0.00009429379,0.00004026011,0.00008504506],"category_scores_gemma":[0.0001929694,0.00007307209,0.00001134138,0.0002185849,0.00004552695,0.002338794,0.0001272516,0.0001653324,0.00004545325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002141686,"about_ca_system_score_gemma":0.00001100283,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002517679,"about_ca_topic_score_gemma":0.0001472223,"domain_scores_codex":[0.9992637,0.0000108009,0.0001471692,0.0001387294,0.0002193308,0.0002202592],"domain_scores_gemma":[0.9994515,0.00004795287,0.00001878837,0.0001346065,0.0003220049,0.00002511247],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0004479538,0.0003263658,0.0313021,0.002326966,0.0001250579,0.000004601973,0.02554716,0.02672224,0.1166193,0.5017105,0.04705791,0.2478097],"study_design_scores_gemma":[0.0008331135,0.00006485716,0.008665322,0.00007746125,0.00001622187,0.00000209502,0.002744612,0.3990267,0.001056018,0.003650764,0.5835574,0.0003053765],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9282968,0.00002440603,0.06161736,0.002861789,0.0001959137,0.00112716,0.000003992889,0.00004843921,0.005824129],"genre_scores_gemma":[0.9916369,0.00000447811,0.006315051,0.001019632,0.0004077971,0.0001728592,0.00005521056,0.00000948174,0.0003786066],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5364995,"threshold_uncertainty_score":0.7631836,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144979199","doi":"10.1287/opre.1110.0976","title":"“We Will Be Right with You”: Managing Customer Expectations with Vague Promises and Cheap Talk","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":179,"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":"Vagueness; Computer science; Service (business); Queueing theory; Robustness (evolution); Business; Service provider; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.05113570447700014,"gpt":0.3067104258066192,"spread":0.255574721329619,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004102876,0.0001524831,0.0001537164,0.0006215298,0.001125047,0.0004087973,0.0002123685,0.00003652468,0.0008752739],"category_scores_gemma":[0.00008588751,0.0001085317,0.00002240244,0.001313212,0.0003300164,0.002352337,0.000130044,0.0002488753,0.0001162502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003515074,"about_ca_system_score_gemma":0.00004328086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000660506,"about_ca_topic_score_gemma":0.0022481,"domain_scores_codex":[0.9986441,0.00004949959,0.0001595956,0.0003868624,0.000406265,0.0003537497],"domain_scores_gemma":[0.9990216,0.00005260773,0.00003258904,0.0003593015,0.0005029035,0.00003092967],"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.0009664192,0.001157068,0.01011029,0.0005418679,0.0008211732,0.0004206595,0.01586275,0.01763331,0.004225737,0.9365307,0.002357305,0.009372691],"study_design_scores_gemma":[0.01388098,0.001165539,0.009926322,0.002283777,0.002049001,0.0002682133,0.2136162,0.3424097,0.01665618,0.07063027,0.3200121,0.007101691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7990845,0.0003141899,0.01085566,0.007292489,0.00004996492,0.001596206,0.000009098065,0.000299713,0.1804982],"genre_scores_gemma":[0.9877855,0.00002551044,0.004694038,0.0001180981,0.000163021,0.0002732496,0.00003180597,0.00003962632,0.006869202],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8659005,"threshold_uncertainty_score":0.9583635,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135263108","doi":"10.1287/opre.1120.1081","title":"Understanding the Performance of the Long Chain and Sparse Designs in Process Flexibility","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":167,"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; Masdar Institute of Science and Technology; National Science Foundation","keywords":"Flexibility (engineering); Chain (unit); Computer science; Mathematical optimization; Process (computing); Characterization (materials science); Block (permutation group theory); Property (philosophy); Independent and identically distributed random variables; Order (exchange); Mathematics; Random variable; Economics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.3538268792711619,"gpt":0.3727503884605931,"spread":0.01892350918943125,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003033398,0.00006097833,0.00006543149,0.0001578675,0.0005513715,0.000159548,0.0002471808,0.00002362224,0.0001301827],"category_scores_gemma":[0.000161636,0.00003548188,0.00001682916,0.0007827597,0.0002243748,0.00077634,0.0002261274,0.0001856508,0.00001677385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007676203,"about_ca_system_score_gemma":0.00002773237,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002494731,"about_ca_topic_score_gemma":0.0007322002,"domain_scores_codex":[0.9990357,0.00007467053,0.0001506032,0.0001184593,0.0003470527,0.0002734866],"domain_scores_gemma":[0.9995769,0.00005375102,0.00001879319,0.0002485426,0.00009297859,0.000009041959],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.00003424334,0.0002351254,0.8784844,0.0003882123,0.00001526768,4.849548e-7,0.002227871,0.01053333,0.0004501635,0.1058628,0.0009339452,0.0008342017],"study_design_scores_gemma":[0.000814857,0.00003223193,0.4953761,0.0002128331,0.00001997762,0.000001500186,0.01822819,0.4793808,0.001061279,0.001821572,0.002791847,0.0002588373],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9889244,0.00007569593,0.0002908357,0.001724424,0.00008402831,0.0005912358,4.313608e-7,0.00000769258,0.008301197],"genre_scores_gemma":[0.9990271,0.00001496178,0.0000131594,0.0001525556,0.0001576005,0.00006593859,0.000001903826,0.000006912706,0.0005599124],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4688475,"threshold_uncertainty_score":0.4240759,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3122384578","doi":"10.1287/opre.1080.0654","title":"Toward Robust Revenue Management: Competitive Analysis of Online Booking","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":160,"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":"National Science Foundation","keywords":"Competitive analysis; Revenue; Online algorithm; Revenue management; Computer science; Operations research; Upper and lower bounds; Perspective (graphical); Sequence (biology); Control (management); Mathematical optimization; Business; Microeconomics; Economics; Algorithm; Mathematics; Finance; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.126779056524012,"gpt":0.3956695854522347,"spread":0.2688905289282227,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008709455,0.00006200723,0.000147613,0.001001299,0.0002616291,0.0002220077,0.0006788066,0.00003107054,0.0001187702],"category_scores_gemma":[0.0000657514,0.00005955004,0.00006235592,0.003702385,0.00006472968,0.0003446449,0.0001857384,0.0001946916,0.0000238352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005078892,"about_ca_system_score_gemma":0.00007614063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005475908,"about_ca_topic_score_gemma":0.0002661988,"domain_scores_codex":[0.9983911,0.0002587383,0.0002243024,0.0002698756,0.000601711,0.0002542803],"domain_scores_gemma":[0.9988158,0.00006057218,0.0000162475,0.0004581886,0.0005712283,0.00007794423],"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.000003653012,0.0002081672,0.00005629125,0.000008453754,0.0001365765,0.00001118082,0.00121525,0.3575768,0.0002681065,0.6288533,0.0005089919,0.01115332],"study_design_scores_gemma":[0.0002133458,0.0001344146,0.005394295,0.00003109864,0.00002423769,9.095669e-7,0.0003514547,0.9899911,0.00016209,0.0004571158,0.003149252,0.00009072058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004288459,0.0001154333,0.9385695,0.008973265,0.00004440498,0.0005690242,0.00006067696,0.00006085455,0.0473184],"genre_scores_gemma":[0.8017977,0.0002815178,0.191967,0.000203487,0.00002416854,0.00001736022,0.00008816033,0.000004596295,0.005615989],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7975093,"threshold_uncertainty_score":0.242838,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3123093843","doi":"10.1287/opre.2017.1716","title":"Quantile-Based Risk Sharing","year":2018,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":159,"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":"Eidgenössische Technische Hochschule Zürich; Swiss Finance Institute; Michigan State University","keywords":"Subadditivity; Quantile; Expected shortfall; Coherent risk measure; Value at risk; Risk measure; Risk management; Pareto principle; Arrow; Econometrics; Dynamic risk measure; Computer science; Actuarial science; Economics; Mathematics; Mathematical optimization; Financial economics; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.3953455078281954,"gpt":0.5564986340027319,"spread":0.1611531261745365,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.008074106,0.00007039691,0.0001073961,0.0006895638,0.001556299,0.001162052,0.0007819976,0.00006608402,0.003294904],"category_scores_gemma":[0.005575654,0.00005185956,0.00004752245,0.002328919,0.000290672,0.0004096808,0.0001434959,0.0002555017,0.006327549],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003645208,"about_ca_system_score_gemma":0.000257185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007045001,"about_ca_topic_score_gemma":0.001213336,"domain_scores_codex":[0.9966244,0.000477544,0.0003758067,0.0004589392,0.001739595,0.0003237831],"domain_scores_gemma":[0.9961407,0.0005573223,0.00002725798,0.0008795515,0.002267313,0.0001278259],"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.0001727914,0.000417544,0.260355,0.000002745137,0.00003137319,0.00001660402,0.003145047,0.3260248,0.003607451,0.0625781,0.1425091,0.2011394],"study_design_scores_gemma":[0.0002217216,0.0001392259,0.009517417,0.000005536301,0.000002186368,0.000001180436,0.0002720475,0.9156995,0.002794891,0.002787306,0.06846689,0.00009210573],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7984267,0.00006672988,0.1350016,0.001778546,0.0003526655,0.0004103201,0.00002863974,0.00005970039,0.06387503],"genre_scores_gemma":[0.9772626,0.00007751673,0.008285423,0.00006206073,0.0002978415,0.00003300638,0.00001273869,0.00001065436,0.01395816],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5896747,"threshold_uncertainty_score":0.9998748,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2112881180","doi":"10.1287/opre.1080.0528","title":"Allocation of Cost Savings in a Three-Level Supply Chain with Demand Information Sharing: A Cooperative-Game Approach","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":157,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Supply chain; Cost allocation; Computer science; Economic shortage; Holding cost; Game theory; Information sharing; Scheme (mathematics); Function (biology); Cooperative game theory; Unit cost; Resource allocation; Operations research; Microeconomics; Mathematical optimization; Economics; Business; Mathematics; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.124434346434785,"gpt":0.3017911994874076,"spread":0.1773568530526226,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001302877,0.0001433658,0.0001854005,0.001008161,0.0003791696,0.0003191528,0.0003547544,0.00006090121,0.0002237011],"category_scores_gemma":[0.0001880362,0.0001224591,0.00002775745,0.001587117,0.0002074151,0.002846008,0.0002274228,0.000254543,0.0001328124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001152381,"about_ca_system_score_gemma":0.0001108909,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003202251,"about_ca_topic_score_gemma":0.002637965,"domain_scores_codex":[0.9983185,0.00003642369,0.0003918762,0.000228012,0.0006803452,0.0003448218],"domain_scores_gemma":[0.9988133,0.0000293844,0.00005250492,0.0003230209,0.0007604107,0.00002136496],"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.0005912606,0.001822971,0.2426862,0.001047321,0.0001494884,0.00002295795,0.01083015,0.2327095,0.002070253,0.490264,0.01094523,0.006860647],"study_design_scores_gemma":[0.002750981,0.0001034325,0.1115735,0.0001620105,0.00001371214,0.000007769445,0.004235484,0.863153,0.0003270318,0.0002127026,0.01707695,0.0003833647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9298368,0.00004174183,0.02567054,0.001481754,0.00004919198,0.002480507,0.000009689335,0.00005147174,0.04037828],"genre_scores_gemma":[0.9966493,0.00002585192,0.0007867335,0.0002670069,0.0001055403,0.0005252443,0.0002944789,0.00001636788,0.001329527],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6304436,"threshold_uncertainty_score":0.4993736,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156458610","doi":"10.1287/opre.1070.0480","title":"The Optimal Time to Initiate HIV Therapy Under Ordered Health States","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"HIV/AIDS Research and Interventions","field":"Medicine","cited_by":155,"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":"National Institute on Alcohol Abuse and Alcoholism; National Institutes of Health; National Science Foundation","keywords":"Human immunodeficiency virus (HIV); Intensive care medicine; Markov decision process; Risk analysis (engineering); Medicine; Computer science; Quality (philosophy); Antiretroviral therapy; Markov process; Immunology; Viral load; Mathematics; Epistemology","retraction":null,"screen_n_in":null,"score":{"opus":0.148691597856198,"gpt":0.4715894773964985,"spread":0.3228978795403005,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001485113,0.0001031977,0.0001714656,0.0003112743,0.002362762,0.0001810938,0.0002564359,0.00004171707,0.004328511],"category_scores_gemma":[0.0004768744,0.00006649888,0.00008633663,0.0008829763,0.0003271905,0.0001429197,0.0001111175,0.0005389136,0.00745625],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001756923,"about_ca_system_score_gemma":0.001237782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007540027,"about_ca_topic_score_gemma":0.0003605832,"domain_scores_codex":[0.9972744,0.0005709651,0.0003032069,0.000261613,0.0008581844,0.0007316186],"domain_scores_gemma":[0.997844,0.0002515254,0.000009635555,0.0004966633,0.0009146369,0.0004835493],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003195835,0.0005283775,0.0001197919,0.00001286023,0.0001226734,0.00003140609,0.001809006,0.001401692,0.003895826,0.001332873,0.9708622,0.01956371],"study_design_scores_gemma":[0.003746281,0.01416881,0.004915071,0.0002124765,0.000005270088,0.0002110408,0.002769099,0.08077228,0.003541489,0.0002776104,0.8890519,0.0003286873],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"empirical","genre_gemma":"other","genre_scores_codex":[0.5491502,0.003829049,0.01779338,0.3619699,0.00005840509,0.005758668,0.0002750353,0.0002091337,0.06095619],"genre_scores_gemma":[0.2647642,0.005898944,0.002516001,0.001449987,0.0002476742,0.0006657456,0.0003686204,0.0000592226,0.7240295],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6630734,"threshold_uncertainty_score":0.998936,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128483867","doi":"10.1287/opre.1060.0285","title":"Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":154,"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":"National Science Foundation","keywords":"Linear programming; Computer science; Mathematical optimization; Staffing; Routing (electronic design automation); Upper and lower bounds; Center (category theory); Asymptotically optimal algorithm; Mathematics; Computer network; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.03535919632853935,"gpt":0.3685946693310458,"spread":0.3332354730025065,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00328553,0.00008863497,0.0003077,0.001345212,0.0002464052,0.0001138509,0.0001879677,0.00004345389,0.000199019],"category_scores_gemma":[0.0003164011,0.0000801261,0.00008341706,0.002340981,0.0001038709,0.0004819258,0.00005403382,0.0001124573,0.000006796485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002303792,"about_ca_system_score_gemma":0.00003717434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001338607,"about_ca_topic_score_gemma":0.001364215,"domain_scores_codex":[0.9984801,0.0003512123,0.0003148163,0.0002443238,0.0003696616,0.0002398331],"domain_scores_gemma":[0.9984944,0.0003585937,0.00006079056,0.0003337908,0.0007383412,0.00001409889],"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.0001040836,0.0004272144,0.004462385,0.00004704871,0.0003081423,0.000003540174,0.00002833957,0.9403235,0.02045615,0.03313954,0.00003944635,0.0006606229],"study_design_scores_gemma":[0.0007121481,0.00002282761,0.001847873,0.00001084763,0.000406809,1.262655e-7,0.00006452946,0.9944152,0.001500936,0.0006921748,0.0002505907,0.00007589439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1764724,0.00004071889,0.8224129,0.000237457,0.000007123352,0.0002644485,0.00001967352,0.00001753695,0.0005277506],"genre_scores_gemma":[0.9788671,0.000001515679,0.02067243,0.00008258178,0.00005106923,0.00002931248,0.0001020881,0.00001229583,0.0001816286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8023947,"threshold_uncertainty_score":0.3267448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2038494487","doi":"10.1287/opre.2013.1254","title":"Scheduled Service Network Design for Freight Rail Transportation","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Maritime Ports and Logistics","field":"Engineering","cited_by":146,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Université du Québec à Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Operations research; Service quality; Service (business); Transport engineering; Mathematical optimization; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.09823931024490097,"gpt":0.3258481696035426,"spread":0.2276088593586416,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000940713,0.00007080274,0.00008899775,0.00006172398,0.0003082146,0.0001068542,0.0001172885,0.00006878252,0.0003816689],"category_scores_gemma":[0.00009091991,0.00006806698,0.00002129587,0.0002873979,0.00002288775,0.00008947161,0.000004464447,0.0001599556,0.00006346999],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002508807,"about_ca_system_score_gemma":0.00004050458,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008021037,"about_ca_topic_score_gemma":0.0008932771,"domain_scores_codex":[0.999176,0.00007035631,0.0001591324,0.0001239862,0.0001780633,0.0002925242],"domain_scores_gemma":[0.9991968,0.0002103741,0.000003353334,0.0001834786,0.0003352414,0.00007076512],"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.000006390773,0.00001198018,0.00003122584,0.00004513353,0.00001113251,4.869493e-7,0.0001027157,0.9629896,0.000477583,0.02288648,0.01096895,0.002468317],"study_design_scores_gemma":[0.0002234732,0.00003914319,0.0004076103,0.00001264846,0.000006240663,3.740143e-7,0.00001976736,0.9488259,0.0007298762,0.001025832,0.04861778,0.00009137591],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003959734,0.0000771137,0.9897795,0.0004495848,0.0001295816,0.0005313082,0.00001946698,0.00009788055,0.004955839],"genre_scores_gemma":[0.8718206,0.0000409285,0.125396,0.00008631618,0.0005087801,0.0004031654,0.000270425,0.00003885497,0.001435026],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8678608,"threshold_uncertainty_score":0.4179007,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2135524714","doi":"10.1287/opre.49.4.531.11226","title":"Simultaneous Assignment of Locomotives and Cars to Passenger Trains","year":2001,"lang":"en","type":"article","venue":"Operations Research","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":136,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; HEC Montréal","funders":"","keywords":"Mathematical optimization; Integer programming; Train; Computer science; Context (archaeology); Flow network; Branch and cut; Simplex algorithm; Node (physics); Integer (computer science); Decomposition; Multi-commodity flow problem; Linear programming relaxation; Linear programming; Branch and bound; Tree (set theory); Mathematics; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.03675200780820406,"gpt":0.3223997203708126,"spread":0.2856477125626086,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002883214,0.00005837996,0.00008988585,0.00014937,0.0001153467,0.00004638129,0.00008139152,0.00003452854,0.00007092604],"category_scores_gemma":[0.000081259,0.00005161966,0.00001339809,0.0003275573,0.00004334175,0.00005013489,0.00002340402,0.00009514306,0.00002312016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004448972,"about_ca_system_score_gemma":0.00002139292,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002079377,"about_ca_topic_score_gemma":0.0004363342,"domain_scores_codex":[0.9992551,0.00004987561,0.0001340799,0.0001133107,0.0002395414,0.0002081107],"domain_scores_gemma":[0.9995537,0.00009446298,0.000002038698,0.0001490857,0.0001064895,0.00009416939],"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.000001596727,0.00002817423,0.00009936199,0.00001097224,0.00000999334,0.000009965876,0.001444109,0.9338789,0.05408423,0.0006938491,0.0002718553,0.009467011],"study_design_scores_gemma":[0.0003053401,0.00029465,0.002110106,0.0000645204,0.000003749666,0.00002370002,0.002641841,0.9260732,0.01308377,0.00001607415,0.05517194,0.0002110868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9816789,0.0002013851,0.005602073,0.0002171262,0.00005031387,0.0002128412,0.000006960222,0.00003046395,0.01199991],"genre_scores_gemma":[0.9970965,0.0001045255,0.0005627855,0.000004503016,0.00004089798,0.00004205294,0.000002155331,0.00001231798,0.002134232],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05490009,"threshold_uncertainty_score":0.2104989,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3125830023","doi":"10.1287/opre.1080.0536","title":"Coalition Stability in Assembly Models","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":126,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Stackelberg competition; Alliance; Competition (biology); Supply chain; Downstream (manufacturing); Industrial organization; Product (mathematics); Market power; Function (biology); Stability (learning theory); Microeconomics; Economics; Business; Computer science; Marketing; Operations management; Monopoly; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.2907694309875252,"gpt":0.3555219937125502,"spread":0.06475256272502494,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001493193,0.00007809936,0.00009502759,0.0004937706,0.0004966307,0.0002262831,0.0002150534,0.00004148307,0.0009651918],"category_scores_gemma":[0.0001512843,0.00007614743,0.00003056763,0.0008999194,0.0001057989,0.00171689,0.0001842135,0.0002094408,0.0006201257],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001217181,"about_ca_system_score_gemma":0.00005498917,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003770394,"about_ca_topic_score_gemma":0.002554515,"domain_scores_codex":[0.9986088,0.00006629675,0.0002126343,0.0002646937,0.0005245219,0.0003231052],"domain_scores_gemma":[0.9993262,0.0000334015,0.000009914635,0.0002968073,0.0003205431,0.00001312497],"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.00008695526,0.001485019,0.03069559,0.0002356946,0.00002565378,0.00009734213,0.001165113,0.06231399,0.003307552,0.818779,0.07943013,0.002377946],"study_design_scores_gemma":[0.0008355677,0.00002167804,0.01432038,0.000031688,0.000003585664,0.000001681275,0.001861974,0.9162309,0.0003154006,0.006048217,0.06007188,0.0002571011],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8273748,0.00003455338,0.001232607,0.002395642,0.0001038407,0.0005596027,0.000001986288,0.00005456526,0.1682425],"genre_scores_gemma":[0.9969854,0.00002936206,0.0001711841,0.0004002465,0.0002821535,0.0001670965,0.00005722722,0.00001209252,0.001895191],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8539169,"threshold_uncertainty_score":0.9999481,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2020562184","doi":"10.1287/opre.2014.1267","title":"Generalized Inverse Multiobjective Optimization with Application to Cancer Therapy","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Radiotherapy Techniques","field":"Physics and Astronomy","cited_by":124,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":true},"ca_institutions":"Princess Margaret Cancer Centre; University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematical optimization; Inverse; Inverse problem; Multi-objective optimization; Mathematics; Optimization problem; Computer science; Pareto principle; Applied mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0292310296067893,"gpt":0.3963475927107509,"spread":0.3671165631039616,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000253847,0.00008938058,0.00009286547,0.0001457596,0.0003615323,0.00008313686,0.0001381556,0.00002535876,0.000466037],"category_scores_gemma":[0.00000823912,0.00007182,0.00001785851,0.0005071858,0.00005772277,0.0001878126,0.0000205655,0.0001414585,0.00001413039],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008922426,"about_ca_system_score_gemma":0.00008686154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002193139,"about_ca_topic_score_gemma":0.0002505818,"domain_scores_codex":[0.9990553,0.0001568042,0.0001013766,0.0002581412,0.0002270578,0.0002013683],"domain_scores_gemma":[0.9991201,0.0000360426,0.0000126592,0.0002853312,0.0004707191,0.00007521211],"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.00005155047,0.00007787623,0.002093029,0.000001063793,0.00002746552,4.386671e-8,0.0005327735,0.9174536,0.02402114,0.01279516,0.000555742,0.04239051],"study_design_scores_gemma":[0.001021801,0.00023684,0.0003700162,0.00001431852,0.000003080756,2.218207e-7,0.0001433041,0.9142759,0.05271176,0.0002834017,0.03071455,0.000224788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03893145,0.00001581685,0.9574552,0.0005833932,0.00001264132,0.0009766837,0.00001246332,0.0000530202,0.001959292],"genre_scores_gemma":[0.5506713,0.0000665139,0.4424201,0.0002251609,0.0003625272,0.004023327,0.00008488283,0.00004626329,0.002099938],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5150352,"threshold_uncertainty_score":0.5102778,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2030656388","doi":"10.1287/opre.1070.0411","title":"Pricing and Manufacturing Decisions When Demand Is a Function of Prices in Multiple Periods","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":124,"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":"Heuristics; Computer science; Operations research; Economics; Microeconomics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0915634208709816,"gpt":0.3287446549125433,"spread":0.2371812340415617,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002056222,0.00008058053,0.000106773,0.0009004623,0.0003843721,0.000269233,0.0001340022,0.00004308166,0.0004323058],"category_scores_gemma":[0.0002936651,0.00007284436,0.00002348833,0.0003861186,0.00007446321,0.0007643265,0.000232814,0.0001583839,0.00004343858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004470001,"about_ca_system_score_gemma":0.00001537572,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00164133,"about_ca_topic_score_gemma":0.003955587,"domain_scores_codex":[0.9988303,0.00001492841,0.0002655014,0.0002280851,0.0003846991,0.0002764948],"domain_scores_gemma":[0.9994885,0.0001744751,0.00002448295,0.0001840664,0.0001122859,0.00001623122],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"observational","study_design_scores_codex":[0.0007705758,0.001516124,0.4133145,0.001221422,0.0002118045,0.00007439965,0.01179823,0.009187553,0.02857054,0.07141787,0.01614642,0.4457706],"study_design_scores_gemma":[0.002384351,0.0000970767,0.5561412,0.0003294686,0.0000326502,0.000001809795,0.0139907,0.1310216,0.007208123,0.00321361,0.285116,0.0004633806],"study_design_candidate":"observational","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9799383,0.0001207368,0.006555446,0.00045911,0.00007578186,0.0004143337,6.922226e-7,0.00001688377,0.01241871],"genre_scores_gemma":[0.9978305,0.00005507345,0.001084094,0.0002184182,0.0001611341,0.00002642455,0.000008972012,0.00001119451,0.0006041825],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4453072,"threshold_uncertainty_score":0.4733445,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2098400882","doi":"10.1287/opre.1050.0240","title":"A Branch-and-Cut Algorithm for the Multiple Depot Vehicle Scheduling Problem","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":122,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal","funders":"","keywords":"Column generation; Linear programming relaxation; Branch and cut; Polytope; Scheduling (production processes); Branch and bound; Mathematical optimization; Mathematics; Variable (mathematics); Computer science; Cutting-plane method; Lagrangian relaxation; Integer programming; Algorithm; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.05003228751600552,"gpt":0.3498177781946475,"spread":0.299785490678642,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001293204,0.00008740347,0.00008944868,0.0001072736,0.000802107,0.0002845744,0.0001567262,0.00006479581,0.00002114938],"category_scores_gemma":[0.0002279211,0.00007120371,0.00002994828,0.0004193943,0.00007711845,0.0001517122,0.00005022482,0.0002687083,0.00001819352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005490217,"about_ca_system_score_gemma":0.00004509345,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002582993,"about_ca_topic_score_gemma":0.000353205,"domain_scores_codex":[0.9989372,0.0001164372,0.0001974751,0.0001750596,0.0002361555,0.0003376467],"domain_scores_gemma":[0.9987558,0.0007071099,0.000005535353,0.0002177663,0.0002669256,0.00004684213],"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.000001653108,0.00001534493,0.0002078818,0.00001861815,0.0000127059,3.388702e-7,0.0001228458,0.9339142,0.00908124,0.0008451438,0.0002452003,0.05553477],"study_design_scores_gemma":[0.0003638648,0.00001603425,0.0004608628,0.00001222771,0.000004737919,0.000003390074,0.00007708152,0.9892592,0.007669643,0.000144864,0.001901497,0.00008664245],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03503942,0.0005422738,0.9619544,0.0006527312,0.00006014466,0.0008220011,0.00001756636,0.0001569319,0.0007545283],"genre_scores_gemma":[0.4590064,0.00004879423,0.539563,0.00001292157,0.0001865606,0.00038931,0.00001600713,0.00003592582,0.0007410684],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.423967,"threshold_uncertainty_score":0.6169239,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1969327924","doi":"10.1287/opre.2013.1248","title":"Combinatorial Benders' Cuts for the Strip Packing Problem","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":120,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Université Laval","funders":"","keywords":"Bounding overwatch; Packing problems; Benchmark (surveying); Scheduling (production processes); Heuristic; Mathematical optimization; Benders' decomposition; Computer science; Heuristics; Bin packing problem; Set (abstract data type); Preprocessor; Algorithm; Container (type theory); Set packing; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.0674461263503884,"gpt":0.3422510084130599,"spread":0.2748048820626715,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001087293,0.00007283626,0.00007254749,0.0000952672,0.000679765,0.0003234018,0.0002066492,0.00006103144,0.00009137813],"category_scores_gemma":[0.000186507,0.00005561304,0.0000307793,0.0003216637,0.00005118866,0.0001194015,0.00003034272,0.0002472229,0.00005574595],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004514353,"about_ca_system_score_gemma":0.00004451154,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003281256,"about_ca_topic_score_gemma":0.0001005533,"domain_scores_codex":[0.9991048,0.00008797245,0.0001415085,0.0001233129,0.0002583961,0.0002840313],"domain_scores_gemma":[0.9990617,0.000367808,0.000004228082,0.0002413742,0.0002717093,0.00005319538],"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.000003826489,0.00001948015,0.00003736382,0.00003249975,0.00002178887,8.036543e-8,0.000495293,0.8276622,0.0004597496,0.1537729,0.01261651,0.004878336],"study_design_scores_gemma":[0.0004147123,0.00004656653,0.00003102597,0.0000141341,0.000003788488,6.838497e-7,0.0001134618,0.8681754,0.0005424723,0.001675229,0.1289016,0.00008090717],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002969112,0.0003165211,0.8787284,0.004615261,0.00201513,0.002957553,0.00003919589,0.0004951482,0.1078636],"genre_scores_gemma":[0.993718,0.00006717433,0.004013883,0.0000313561,0.0003362412,0.0003033297,0.00004013046,0.00003276874,0.001457099],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9907489,"threshold_uncertainty_score":0.5228271,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1981854401","doi":"10.1287/opre.1080.0564","title":"The Innovest Austrian Pension Fund Financial Planning Model InnoALM","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Stochastic processes and financial applications","field":"Economics, Econometrics and Finance","cited_by":120,"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":"Pension; Stochastic programming; Computer science; Benchmark (surveying); Time horizon; Stochastic modelling; Economics; Financial market; Cash; Mutual fund; Mathematical optimization; Finance; Econometrics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.3235202847495317,"gpt":0.3745713540443725,"spread":0.05105106929484082,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0008852924,0.00009891792,0.0001589549,0.0002216497,0.003286512,0.0001741141,0.0003919685,0.0001011434,0.0000333172],"category_scores_gemma":[0.0008381317,0.00009032072,0.00004059245,0.001049965,0.0002656819,0.0002087954,0.0001436841,0.0004381298,0.0006959492],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009873311,"about_ca_system_score_gemma":0.0003082487,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004010249,"about_ca_topic_score_gemma":0.0001686489,"domain_scores_codex":[0.9986755,0.00001092669,0.0004383457,0.000343009,0.0001104991,0.0004216732],"domain_scores_gemma":[0.9990499,0.0001219639,0.00004220282,0.0004209238,0.0002832995,0.00008169822],"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.00001197556,0.00005092513,0.0005098552,0.000002903271,0.000004074347,0.000002631323,0.0003806349,0.008170998,0.00007761735,0.98658,0.003607661,0.0006007344],"study_design_scores_gemma":[0.0009625999,0.0001997728,0.02374354,0.00002971437,0.000003224288,0.00003965288,0.0002503835,0.528346,0.0001569724,0.241249,0.2044716,0.0005475453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1919967,0.002103297,0.7613665,0.006423441,0.0002550091,0.0008813569,0.0001894367,0.00005964786,0.03672467],"genre_scores_gemma":[0.9912356,0.0001477389,0.002504284,0.0001087512,0.0002343407,0.000295516,0.00003014427,0.00001795017,0.00542564],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.799239,"threshold_uncertainty_score":0.9980111,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2164092299","doi":"10.1287/opre.1060.0360","title":"Classification and Regression via Integer Optimization","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Machine Learning and Data Classification","field":"Computer Science","cited_by":116,"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":"Integer (computer science); Regression; Integer programming; Regression analysis; Computer science; Optimization problem; Mathematics; Mathematical optimization; Data mining; Artificial intelligence; Statistics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.08721332552102332,"gpt":0.419794869743731,"spread":0.3325815442227077,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002752336,0.00007202708,0.00006378913,0.000365417,0.0006539227,0.0004083216,0.0003645027,0.00007510655,0.0000380313],"category_scores_gemma":[0.0004073575,0.00005942348,0.00001216683,0.0007983382,0.0000853634,0.0007308076,0.0001715657,0.000325952,0.00008409562],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000630334,"about_ca_system_score_gemma":0.00006246378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000101738,"about_ca_topic_score_gemma":0.00010935,"domain_scores_codex":[0.9985433,0.0002376077,0.0002012133,0.0003614417,0.0004198058,0.0002366733],"domain_scores_gemma":[0.9987633,0.0001643792,0.00002021133,0.0005445896,0.0004001378,0.000107389],"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.00002234328,0.0002052472,0.005286505,0.00002347493,0.00001074094,0.000004976075,0.001500619,0.01830131,0.03272191,0.4546293,0.001999539,0.4852941],"study_design_scores_gemma":[0.0001170764,0.0000570824,0.02265082,0.00001343157,8.97644e-7,0.000007967102,0.0001081066,0.9710649,0.0003807138,0.0001876358,0.005335159,0.00007622088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007286594,0.00007085413,0.9819533,0.004181333,0.00007294472,0.0001837597,8.617823e-7,0.00008907128,0.006161234],"genre_scores_gemma":[0.8714819,0.00008611541,0.1268201,0.00004483362,0.00006854746,0.00002262791,0.00006801185,0.000007263478,0.001400646],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9527636,"threshold_uncertainty_score":0.5029511,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072078883","doi":"10.1287/opre.1060.0278","title":"Dual-Optimal Inequalities for Stabilized Column Generation","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Optimization and Packing Problems","field":"Engineering","cited_by":113,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal; Polytechnique Montréal; Group for Research in Decision Analysis","funders":"Fundação para a Ciência e a Tecnologia","keywords":"Dual (grammatical number); Mathematical optimization; Column generation; Mathematics; Linear programming; Column (typography); Binary number; Convergence (economics); Reduction (mathematics); Degeneracy (biology); Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.1200784767221323,"gpt":0.3595593729949236,"spread":0.2394808962727914,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006190424,0.00007598206,0.00008781269,0.0001685911,0.0004022446,0.000322883,0.00006472718,0.00006590577,0.000361585],"category_scores_gemma":[0.00008245633,0.00008058489,0.00002963932,0.0003032169,0.00004787052,0.000202597,0.00001488418,0.0001214149,0.00005723547],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008227115,"about_ca_system_score_gemma":0.00006467147,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001680788,"about_ca_topic_score_gemma":0.001042195,"domain_scores_codex":[0.9990798,0.00006974964,0.0002206996,0.0001370395,0.000233211,0.0002594879],"domain_scores_gemma":[0.9992871,0.00008918942,0.000004337307,0.0001661158,0.0004144592,0.00003876365],"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.000003471732,0.00002389052,0.00002385639,0.00002519279,0.00000650776,2.517184e-7,0.0002303618,0.9329107,0.02829648,0.01649264,0.02175947,0.0002271623],"study_design_scores_gemma":[0.0004066777,0.00004343287,0.00004054844,0.000005830163,0.000002468648,0.000001124727,0.0001217358,0.9517906,0.01124328,0.0001068622,0.03612456,0.000112843],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6121179,0.0004301022,0.3580205,0.001198207,0.0005944651,0.002258164,0.0002501403,0.0006126313,0.02451785],"genre_scores_gemma":[0.9516672,0.00004658597,0.03344489,0.00001775169,0.0004756499,0.0006323897,0.0006912465,0.00004015059,0.01298412],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3395493,"threshold_uncertainty_score":0.3959102,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053714494","doi":"10.1287/opre.2013.1173","title":"Data Envelopment Analysis with Nonhomogeneous DMUs","year":2013,"lang":"en","type":"article","venue":"Operations Research","topic":"Efficiency Analysis Using DEA","field":"Decision Sciences","cited_by":109,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"York University","funders":"","keywords":"Data envelopment analysis; Homogeneity (statistics); Missing data; Value (mathematics); Homogeneous; Computer science; Set (abstract data type); Econometrics; Mathematical optimization; Operations research; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.3976795714158436,"gpt":0.5188015055533886,"spread":0.121121934137545,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.008491386,0.0001240867,0.0002912094,0.001970783,0.001168814,0.002369226,0.003100268,0.0000581073,0.007337046],"category_scores_gemma":[0.003196489,0.00007684116,0.00006940274,0.01191766,0.0003438262,0.000790302,0.0008576143,0.0002974767,0.007745199],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008726639,"about_ca_system_score_gemma":0.0005221952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002327556,"about_ca_topic_score_gemma":0.01110872,"domain_scores_codex":[0.9927745,0.0008023183,0.0005741771,0.001036804,0.004304254,0.0005078809],"domain_scores_gemma":[0.9923404,0.001089702,0.00003638107,0.003705365,0.002607402,0.0002206878],"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.00003589925,0.001109265,0.03826142,0.000004674714,0.001859356,0.0001046232,0.002517591,0.6846936,0.007413255,0.003438468,0.1053388,0.155223],"study_design_scores_gemma":[0.0001727822,0.00009016787,0.02182102,0.000004878747,0.0001075392,0.000009350715,0.00132509,0.9384067,0.0005130795,0.0002788483,0.03704172,0.0002287921],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8891234,0.0002086064,0.0780111,0.009180322,0.00006977308,0.0008082369,0.0001088609,0.00005512458,0.02243456],"genre_scores_gemma":[0.9627788,0.00002034806,0.01537047,0.00008306751,0.00004810726,0.0000771921,0.0001344231,0.00001029712,0.02147727],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2537131,"threshold_uncertainty_score":0.9986664,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2596292818","doi":"10.1287/opre.2016.1578","title":"The Impact of Inspection Cost on Equilibrium, Revenue, and Social Welfare in a Single-Server Queue","year":2017,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":109,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Tel Aviv University; Government of Ontario","keywords":"Unobservable; Computer science; Queue; Revenue; Join (topology); Valuation (finance); Operations research; Mathematical optimization; Microeconomics; Econometrics; Economics; Mathematics; Computer network; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.09270631862722876,"gpt":0.4028587003774279,"spread":0.3101523817501992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001162732,0.00006325643,0.00009802692,0.0002109575,0.001908227,0.0006729977,0.0002477043,0.00003822505,0.00004279557],"category_scores_gemma":[0.0009198161,0.00004601176,0.00004394376,0.0002697938,0.0002473769,0.0008214483,0.0001890611,0.0002089802,0.0000224234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009561448,"about_ca_system_score_gemma":0.00002298388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004266962,"about_ca_topic_score_gemma":0.01036607,"domain_scores_codex":[0.9992449,0.0000671366,0.0001376911,0.0001499011,0.0002139799,0.0001863873],"domain_scores_gemma":[0.9992982,0.00006546165,0.00004996743,0.000321391,0.0002589109,0.000006055412],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.001138667,0.0008901121,0.05558473,0.0001744438,0.0002155775,0.00003075276,0.001196477,0.05265559,0.03327509,0.8012255,0.006337123,0.04727597],"study_design_scores_gemma":[0.003235828,0.0002814156,0.7191736,0.0002828556,0.00005802566,0.000003499342,0.00337055,0.2123876,0.001459464,0.02806126,0.03096038,0.000725596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9893482,0.00001495634,0.00001345419,0.005216881,0.00002736151,0.0002163039,0.000006751505,0.00001000945,0.005146137],"genre_scores_gemma":[0.9988613,0.000005339891,0.00001080369,0.00001467311,0.0002117971,0.00002945252,0.000009247189,0.00001047288,0.0008468826],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7731642,"threshold_uncertainty_score":0.9993911,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2036221507","doi":"10.1287/opre.1080.0642","title":"Optimal Real-Time Traffic Control in Metro Stations","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Railway Systems and Energy Efficiency","field":"Engineering","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Bombardier (Canada)","funders":"","keywords":"Train; Computer science; Scheduling (production processes); Schedule; Routing (electronic design automation); Real-time computing; Branch and bound; Control (management); Process (computing); Real-time Control System; Column generation; Operations research; Mathematical optimization; Computer network; Engineering; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.02200890085576439,"gpt":0.3124288843492416,"spread":0.2904199834934772,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006707108,0.00008209718,0.0001284674,0.0004135602,0.0001886638,0.0001316129,0.0001511757,0.00005836428,0.0002010149],"category_scores_gemma":[0.00006198264,0.00007891757,0.00002775626,0.0008039528,0.00003019703,0.0001796557,0.000005808408,0.0002191014,0.000276114],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001304195,"about_ca_system_score_gemma":0.00006916471,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001989637,"about_ca_topic_score_gemma":0.0006283695,"domain_scores_codex":[0.9988336,0.0001104598,0.0002296183,0.0001517957,0.0002977937,0.0003767253],"domain_scores_gemma":[0.9995019,0.00007725324,0.000002965422,0.0002142276,0.0001204256,0.00008317463],"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.000002793674,0.00004589824,0.00001398461,0.000002768461,0.00000479673,0.000005888758,0.0002959011,0.9790224,0.01599392,0.001247369,0.00135613,0.002008182],"study_design_scores_gemma":[0.0003535631,0.00008269414,0.001676438,0.00001100594,0.000001335233,0.00000121411,0.0002339142,0.996112,0.0002139055,0.000006011913,0.001216657,0.00009122984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9751032,0.0001290756,0.002785887,0.0004128842,0.00005162316,0.0002705742,0.00001471716,0.0001315616,0.02110048],"genre_scores_gemma":[0.9964749,0.00005556877,0.001579955,0.000009203823,0.00006558932,0.00006885255,0.00001952227,0.00001386928,0.001712522],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02137172,"threshold_uncertainty_score":0.3548979,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092472841","doi":"10.1287/opre.48.1.26.12456","title":"Stability of Multiclass Queueing Networks Under Priority Service Disciplines","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":107,"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":"Queueing theory; Stability (learning theory); Layered queueing network; Computer science; Mathematical optimization; Set (abstract data type); Lyapunov function; Service (business); Lyapunov optimization; Queueing system; Mathematics; Computer network; Nonlinear system; Artificial intelligence; Lyapunov equation","retraction":null,"screen_n_in":null,"score":{"opus":0.0708570981113848,"gpt":0.3653104677572205,"spread":0.2944533696458357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001721248,0.0001036226,0.0001720447,0.0001707522,0.0006547493,0.0002349993,0.000320912,0.00006007574,0.002524551],"category_scores_gemma":[0.0002595595,0.00009232306,0.00005360382,0.001796893,0.0001555773,0.001146757,0.0001975169,0.000292449,0.0002093127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005642993,"about_ca_system_score_gemma":0.00004265688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002388021,"about_ca_topic_score_gemma":0.00840863,"domain_scores_codex":[0.998582,0.0001148243,0.0002968417,0.0002953038,0.0003907946,0.0003202248],"domain_scores_gemma":[0.998395,0.0001863434,0.00002573902,0.0004877733,0.0008877862,0.00001741304],"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.00007596519,0.0002394455,0.003955642,0.00009525142,0.00003825765,0.000001763082,0.0001640741,0.9508962,0.002737243,0.03538143,0.00007789542,0.00633684],"study_design_scores_gemma":[0.0002367956,0.000005433078,0.00407707,0.00003260425,0.00002093652,2.42768e-7,0.0005800292,0.9894338,0.0003430066,0.003159887,0.001975763,0.000134444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9848294,0.00004697542,0.005257444,0.002121558,0.00003806205,0.0002890046,0.000002631914,0.00005782201,0.007357163],"genre_scores_gemma":[0.9978157,0.0000151171,0.0006662105,0.0001764039,0.0003671249,0.00003137557,0.00002924381,0.00001728104,0.0008815373],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0385376,"threshold_uncertainty_score":0.9983873,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2311001255","doi":"10.1287/opre.2016.1483","title":"Robust Optimization of Sums of Piecewise Linear Functions with Application to Inventory Problems","year":2016,"lang":"en","type":"article","venue":"Operations Research","topic":"Risk and Portfolio Optimization","field":"Decision Sciences","cited_by":104,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"HEC Montréal","funders":"","keywords":"Mathematical optimization; Robust optimization; Newsvendor model; Linear programming; Piecewise linear function; Mathematics; Computer science; Semidefinite programming; Optimization problem; Column generation; Set (abstract data type); Norm (philosophy)","retraction":null,"screen_n_in":null,"score":{"opus":0.1986547988242699,"gpt":0.4180923603225724,"spread":0.2194375614983025,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002940876,0.00009189702,0.0001910186,0.0009151853,0.0002662096,0.00007103087,0.0004282488,0.00007537991,0.0004111958],"category_scores_gemma":[0.001353449,0.00005402842,0.0000411752,0.002996899,0.0002248863,0.0005179883,0.00009277921,0.00009481349,0.0001798343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005763188,"about_ca_system_score_gemma":0.0003372192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000267289,"about_ca_topic_score_gemma":0.000636243,"domain_scores_codex":[0.9968705,0.0003105112,0.0006482939,0.0003952692,0.001555093,0.0002203538],"domain_scores_gemma":[0.9949067,0.0003275165,0.00009449829,0.0007588731,0.003770738,0.0001416232],"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.00004799672,0.00009509067,0.005268121,0.000003584286,0.000009131181,1.431274e-7,0.0003230512,0.9733946,0.005661892,0.001536012,0.001768479,0.01189195],"study_design_scores_gemma":[0.001060164,0.0008980067,0.002991813,0.0001209435,0.0000189463,0.000004419418,0.0009251399,0.9627519,0.01230193,0.0004112416,0.01825856,0.0002569185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05787945,0.00003317922,0.9367047,0.001468256,0.0000463727,0.0008794746,0.00004393619,0.00001775498,0.002926876],"genre_scores_gemma":[0.9496109,0.0001931932,0.0391025,0.00001622906,0.00006884945,0.0002779917,0.00004227732,0.0000200593,0.01066795],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8976022,"threshold_uncertainty_score":0.4502306,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128586119","doi":"10.1287/opre.51.6.952.24913","title":"Dynamic Server Allocation for Queueing Networks with Flexible Servers","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":104,"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":"Server; Layered queueing network; Computer science; Queueing theory; Upper and lower bounds; Independent and identically distributed random variables; Mathematical optimization; Computer network; Routing (electronic design automation); Probabilistic logic; Flexibility (engineering); Distributed computing; Linear programming; Random variable; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04070181517824167,"gpt":0.3374842795450705,"spread":0.2967824643668289,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001597394,0.0001072321,0.0001149819,0.0003356029,0.0009714824,0.0004871654,0.0001923324,0.00005230471,0.0002356119],"category_scores_gemma":[0.0003524223,0.00009450073,0.00004339028,0.001363184,0.0000755943,0.001371238,0.00004674907,0.0001905271,0.0001073729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009810239,"about_ca_system_score_gemma":0.00006230953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002459791,"about_ca_topic_score_gemma":0.002419926,"domain_scores_codex":[0.998822,0.000061328,0.0001625214,0.0002972484,0.0002877963,0.0003691169],"domain_scores_gemma":[0.9987282,0.0000997496,0.00002594613,0.0003355072,0.0007950186,0.00001559602],"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.00003275996,0.00003702491,0.0004731162,0.00003206067,0.00003042082,0.000001023365,0.00002194507,0.7668434,0.000236711,0.2316156,0.0002323168,0.0004436213],"study_design_scores_gemma":[0.0004734872,0.00002125733,0.000216051,0.00004246843,0.00003349862,0.000001054054,0.0005805054,0.9758278,0.0001641292,0.003881167,0.01856848,0.0001900988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.373702,0.0001525714,0.6042124,0.00222133,0.0001498353,0.001525089,0.000002481032,0.0002404456,0.01779383],"genre_scores_gemma":[0.9863369,0.000009475296,0.006048905,0.0002468211,0.0001199122,0.0002423756,0.00009454584,0.00003661144,0.006864467],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6126349,"threshold_uncertainty_score":0.7471955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2139030509","doi":"10.1287/opre.1040.0117","title":"Valuation and Optimal Operation of Electric Power Plants in Competitive Markets","year":2004,"lang":"en","type":"article","venue":"Operations Research","topic":"Electric Power System Optimization","field":"Engineering","cited_by":102,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Western University; Queen's University","funders":"","keywords":"Hydroelectricity; Valuation (finance); Electricity; Spot contract; Computer science; Nonlinear system; Thermal power station; Mathematical optimization; Electricity market; Mean reversion; Economics; Econometrics; Mathematics; Futures contract; Engineering; Electrical engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.02460379229547448,"gpt":0.3068818606813805,"spread":0.282278068385906,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007661891,0.00007992302,0.000118583,0.0005377858,0.0000899251,0.00007726041,0.00008149529,0.00007262673,0.00006400755],"category_scores_gemma":[0.0001147545,0.00008479414,0.00001093104,0.0006036855,0.00002772145,0.0003512283,0.00001956753,0.0002029525,0.00003126149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002407667,"about_ca_system_score_gemma":0.0001218985,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000156399,"about_ca_topic_score_gemma":0.0001596544,"domain_scores_codex":[0.9988659,0.0001571016,0.0002558335,0.0001535792,0.0003385863,0.0002290006],"domain_scores_gemma":[0.9995172,0.00007372104,0.00000765576,0.0001275991,0.0002304853,0.00004331585],"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.00001085455,0.00004783509,0.0002192847,0.0000194374,0.00001170544,0.000002141256,0.0009566639,0.9515928,0.0421559,0.004268126,0.00004713747,0.0006681312],"study_design_scores_gemma":[0.001020008,0.0001652878,0.01884213,0.00008649326,0.000002652557,0.00001573621,0.0003647411,0.9447401,0.0344013,0.0001757,0.00003225252,0.0001536499],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9511321,0.00043426,0.04154669,0.0001338624,0.00005185496,0.0008055666,0.00000664373,0.00004049281,0.005848561],"genre_scores_gemma":[0.9968567,0.000201733,0.002702856,0.000004190722,0.00001251463,0.0001067292,0.0000341067,0.00001634586,0.0000648415],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04572462,"threshold_uncertainty_score":0.3457805,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2037937636","doi":"10.1287/opre.1070.0430","title":"Price and Order Postponement in a Decentralized Newsvendor Model with Multiplicative and Price-Dependent Demand","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Supply Chain and Inventory Management","field":"Business, Management and Accounting","cited_by":101,"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":"Postponement; Newsvendor model; Economic order quantity; Microeconomics; Economics; Profit (economics); Order (exchange); Reservation price; Competition (biology); Business; Supply chain; Operations management; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.05070238379216252,"gpt":0.327808316254729,"spread":0.2771059324625665,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001705682,0.0001402174,0.0001410512,0.0005415502,0.0003819239,0.0004332308,0.0001479314,0.00004362192,0.0001325752],"category_scores_gemma":[0.0001309998,0.0001141118,0.00001129821,0.0007457784,0.0001350121,0.0006628555,0.000298021,0.0002077626,0.00002948389],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009495872,"about_ca_system_score_gemma":0.00004602969,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001098389,"about_ca_topic_score_gemma":0.005713547,"domain_scores_codex":[0.998363,0.00003381751,0.0002410994,0.0003984425,0.0004788116,0.0004848715],"domain_scores_gemma":[0.9993159,0.00006532404,0.00002689719,0.0002178494,0.0003304785,0.00004351052],"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.004113811,0.005005849,0.3209242,0.001698143,0.0005707578,0.0004107935,0.01458282,0.1074983,0.0247999,0.467486,0.01032506,0.04258435],"study_design_scores_gemma":[0.006682037,0.0001145507,0.05856029,0.0001438253,0.00003243868,0.00000690352,0.006336059,0.8969445,0.0004412727,0.0008237461,0.02934559,0.0005687872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9568892,0.0003027064,0.01955646,0.003635638,0.00002872844,0.001996778,0.000002652175,0.00004294651,0.01754487],"genre_scores_gemma":[0.9937101,0.0001776939,0.003339993,0.0005695078,0.00007260798,0.0001744497,0.00001931825,0.00002269988,0.001913621],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7894462,"threshold_uncertainty_score":0.4653345,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}