{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Erick Delage","is_ca":true},{"name":"Yinyu Ye","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009064875,0.001592153,0.002706703,0.001680991,0.0006919747,0.002409838,0.002073307,0.00262993,0.00118579],"category_scores_gemma":[0.03149984,0.001219901,0.001794425,0.001806028,0.002599361,0.003180353,0.003403779,0.003487764,0.0001711165],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002464308,"about_ca_system_score_gemma":0.00200705,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003745735,"about_ca_topic_score_gemma":0.002051448,"domain_scores_codex":[0.9956103,0.002578902,0.0002017854,0.0004744993,0.0008988795,0.0002356785],"domain_scores_gemma":[0.9773889,0.01889718,0.001608972,0.0007892285,0.0009463897,0.0003693303],"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.00001830613,0.00001728541,0.000178489,0.00003962977,0.000033843,0.00004794955,0.00003169181,0.9336247,0.0002214791,0.06122556,0.0002122585,0.004348765],"study_design_scores_gemma":[0.00000390734,0.000006947614,0.00002610784,0.0000050524,0.000002568008,0.000006732298,0.000003281755,0.9645905,0.00008571769,0.03511286,0.0001508126,0.000005440736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005623343,0.0004130898,0.9923947,0.0006059392,0.00001818054,0.00001682441,0.00003308255,0.00008666218,0.0008080569],"genre_scores_gemma":[0.6720018,0.001591383,0.3229364,0.0003350677,0.0002965415,0.0003302046,0.0002200769,0.0002216769,0.002066844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009064875,"threshold_uncertainty_score":0.04794019,"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","authors":[{"name":"Marco E. Lübbecke","is_ca":false},{"name":"Jacques Desrosiers","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001509967,0.00142912,0.00112661,0.002352679,0.00107036,0.002794864,0.001091675,0.001561758,0.02689739],"category_scores_gemma":[0.004806675,0.0005540552,0.001220259,0.005919798,0.001541774,0.004201859,0.001515895,0.003616584,0.01107154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001622948,"about_ca_system_score_gemma":0.0009535975,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009160536,"about_ca_topic_score_gemma":0.0008245014,"domain_scores_codex":[0.9988445,0.0003161812,0.00006350773,0.0003020097,0.0003891288,0.00008467086],"domain_scores_gemma":[0.997733,0.001222894,0.00009929913,0.0002093969,0.0005535962,0.0001818077],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006440924,0.0001158323,0.000409872,0.001202988,0.00005674676,0.000123062,0.0001436935,0.004471062,0.0009091105,0.2836874,0.347655,0.3611608],"study_design_scores_gemma":[0.00002317726,0.0001076783,0.0005784791,0.0006156043,0.00003614925,0.0004742063,0.00009220582,0.007838759,0.001006903,0.2506611,0.7385133,0.00005244889],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"review","genre_gemma":"methods","genre_scores_codex":[0.003893927,0.4954194,0.2618449,0.02854413,0.04001889,0.0002139863,0.0007592695,0.0006445776,0.1686609],"genre_scores_gemma":[0.07265001,0.4451588,0.1435326,0.01641186,0.1283721,0.0006394152,0.002497162,0.001243962,0.1894941],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.02689739,"threshold_uncertainty_score":0.08998078,"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","authors":[{"name":"Thibaut Vidal","is_ca":true},{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Michel Gendreau","is_ca":true},{"name":"Nadia Lahrichi","is_ca":true},{"name":"Walter Rei","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005106041,0.0006730292,0.0006855596,0.000745024,0.0003546001,0.0006270249,0.001390364,0.001169326,0.001597867],"category_scores_gemma":[0.0008821351,0.0002939891,0.0005936496,0.0009120122,0.000440652,0.0006613195,0.0007195642,0.0007064245,0.0003044246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005399536,"about_ca_system_score_gemma":0.0009768668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003076952,"about_ca_topic_score_gemma":0.003550785,"domain_scores_codex":[0.999712,0.0000816204,0.000009580685,0.00004593587,0.0001156619,0.0000351042],"domain_scores_gemma":[0.9998093,0.00009963055,0.00002204162,0.00002137515,0.00003439999,0.00001321143],"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.00002661946,0.00004873962,0.000356686,0.00003892423,0.00004446596,0.00006068718,0.00003701315,0.8929232,0.001727992,0.01646623,0.001079952,0.08718941],"study_design_scores_gemma":[0.00001749394,0.00002990865,0.00006682549,0.000004898899,0.000008230686,0.00002546192,0.000006561575,0.9949076,0.000289667,0.003201513,0.001437877,0.000003859448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01754556,0.0002958875,0.9775106,0.0001174308,0.00004588867,0.00005955933,0.00003590776,0.0003245699,0.004064623],"genre_scores_gemma":[0.2815878,0.0003446622,0.7133792,0.0001436761,0.0000538012,0.0003223346,0.0001807759,0.0000877467,0.003900068],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003076952,"threshold_uncertainty_score":0.006118059,"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","authors":[{"name":"Jean‐François Cordeau","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001750509,0.001962798,0.002078095,0.001601548,0.001473163,0.002134279,0.002151936,0.002156107,0.009167028],"category_scores_gemma":[0.004261853,0.001070178,0.001147807,0.002727111,0.000716779,0.002395436,0.001715556,0.003264948,0.001729709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001554235,"about_ca_system_score_gemma":0.00317965,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006243069,"about_ca_topic_score_gemma":0.005555004,"domain_scores_codex":[0.9987479,0.0004076315,0.00006786813,0.0002659484,0.0003327074,0.0001779225],"domain_scores_gemma":[0.9983186,0.001147755,0.000118353,0.0000858784,0.0002325553,0.00009701683],"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.0002518666,0.0005234029,0.0006586224,0.0003535248,0.0001073546,0.0002298158,0.0001643839,0.5081094,0.002203861,0.0439832,0.01790589,0.4255087],"study_design_scores_gemma":[0.0001086192,0.00009192489,0.0001154471,0.00002976062,0.00003001435,0.00008673776,0.00004944785,0.9654167,0.0008860001,0.0276449,0.005524298,0.0000161453],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004923471,0.0003663048,0.9894642,0.0003037144,0.00007065165,0.0002735541,0.0001850186,0.0005354437,0.003877584],"genre_scores_gemma":[0.03571329,0.0003505124,0.9599584,0.0001291871,0.00004856103,0.0004847005,0.0006215429,0.0002064232,0.002487418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009167028,"threshold_uncertainty_score":0.03066671,"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","authors":[{"name":"Jonathan Patrick","is_ca":true},{"name":"Martin L. Puterman","is_ca":true},{"name":"Maurice Queyranne","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001487324,0.0005372945,0.0005820753,0.0005533158,0.0006842454,0.0008726706,0.001545267,0.0008262474,0.004071787],"category_scores_gemma":[0.003187375,0.0004991012,0.0005802567,0.0006554064,0.0004936596,0.0008321092,0.001020158,0.001167577,0.000375208],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00154683,"about_ca_system_score_gemma":0.002593829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004775798,"about_ca_topic_score_gemma":0.005721145,"domain_scores_codex":[0.9988971,0.0004849022,0.0000298109,0.000175293,0.0002836467,0.0001292556],"domain_scores_gemma":[0.9986885,0.0007555838,0.0001733142,0.0001126371,0.00008627033,0.0001835888],"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.0002455815,0.0003324401,0.001539299,0.00008351237,0.0000417697,0.0001624293,0.0001499663,0.8703846,0.003274493,0.03856794,0.003374655,0.0818432],"study_design_scores_gemma":[0.0000551907,0.00006752851,0.0002102222,0.000005868582,0.00001115,0.00007715066,0.00001447896,0.9904113,0.0006514083,0.006557615,0.001924734,0.00001325417],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02986654,0.0001573924,0.9649913,0.0007112963,0.00006502488,0.0001684315,0.00008549332,0.0002624286,0.003692033],"genre_scores_gemma":[0.730115,0.0001827038,0.2659004,0.0001597428,0.00009608186,0.0002468695,0.00009915074,0.0000542715,0.003145822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004775798,"threshold_uncertainty_score":0.01362151,"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","authors":[{"name":"Liang Liang","is_ca":false},{"name":"Jie Wu","is_ca":false},{"name":"Wade D. Cook","is_ca":true},{"name":"Joe Zhu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026706,0.001356986,0.001348006,0.001020557,0.001092335,0.00268824,0.0021351,0.0018109,0.008747381],"category_scores_gemma":[0.004995127,0.0005203114,0.001131036,0.001122965,0.002280592,0.002891865,0.00250774,0.002545497,0.001262839],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003266822,"about_ca_system_score_gemma":0.002647437,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007609171,"about_ca_topic_score_gemma":0.004277296,"domain_scores_codex":[0.9982333,0.000935236,0.00005194376,0.0002624216,0.0002798603,0.0002370981],"domain_scores_gemma":[0.9985263,0.0009022089,0.0001478752,0.00008563112,0.0002262863,0.0001116502],"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.00004328059,0.00006228566,0.0003771592,0.00006372297,0.00003412754,0.00009480543,0.00009551383,0.4047673,0.0004552649,0.5828997,0.001465516,0.00964129],"study_design_scores_gemma":[0.00002062482,0.00003543709,0.0001149271,0.00002041459,0.000008926091,0.00003692356,0.00004546161,0.8039071,0.0001904257,0.1933443,0.002258041,0.00001740691],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0163534,0.0002508676,0.9448096,0.0006242853,0.00004291376,0.0001321794,0.0001167544,0.0000827496,0.03758728],"genre_scores_gemma":[0.7319739,0.0008498004,0.2390557,0.0003175799,0.00005371905,0.0007742137,0.0002087545,0.000108618,0.02665761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008747381,"threshold_uncertainty_score":0.02926284,"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","authors":[{"name":"Ralph L. Keeney","is_ca":false},{"name":"Robin Gregory","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0233939,0.001004716,0.001062497,0.006713253,0.000885116,0.004863861,0.001157809,0.001259688,0.001731458],"category_scores_gemma":[0.05349406,0.0003592402,0.0007961676,0.004665665,0.00196356,0.005560348,0.002011346,0.001593924,0.0005179711],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001571593,"about_ca_system_score_gemma":0.00220158,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001022037,"about_ca_topic_score_gemma":0.001172214,"domain_scores_codex":[0.983042,0.00955472,0.001749043,0.0009354964,0.004140756,0.0005780369],"domain_scores_gemma":[0.9525213,0.03194663,0.004782101,0.002513905,0.006999846,0.001236231],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006495922,0.0008217185,0.06967647,0.001220802,0.0003336667,0.0003120788,0.001929946,0.08180372,0.00804502,0.4645421,0.007830446,0.3628345],"study_design_scores_gemma":[0.0003253248,0.00155054,0.02707172,0.001155617,0.0003757942,0.0004774004,0.004815294,0.2555742,0.02279208,0.6426617,0.04272552,0.000474811],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1038775,0.0007301976,0.8771433,0.001424653,0.00009014859,0.0009609625,0.0006189269,0.0002487051,0.01490561],"genre_scores_gemma":[0.4425553,0.0006003943,0.5544065,0.0001599274,0.00005742669,0.0007934741,0.0005706557,0.00003859797,0.0008178204],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0233939,"threshold_uncertainty_score":0.1237202,"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)","authors":[{"name":"Pierre L’Ecuyer","is_ca":true},{"name":"Richard Simard","is_ca":true},{"name":"E. Jack Chen","is_ca":false},{"name":"W. David Kelton","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004502065,0.001864601,0.001800455,0.002115965,0.0007020931,0.002187812,0.003640621,0.001614786,0.08680658],"category_scores_gemma":[0.01483436,0.001629837,0.001532034,0.0020741,0.0006272362,0.002554134,0.002167364,0.002640482,0.04573571],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006206817,"about_ca_system_score_gemma":0.001453367,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009585771,"about_ca_topic_score_gemma":0.001343077,"domain_scores_codex":[0.9982162,0.0004178273,0.000236557,0.0002192205,0.0007573993,0.0001527793],"domain_scores_gemma":[0.9940683,0.002897826,0.0004288789,0.001235253,0.00115299,0.0002168107],"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.0007789698,0.0004278698,0.003265784,0.001534104,0.0003040559,0.0007871981,0.0003304045,0.04739293,0.0106317,0.09541203,0.4232705,0.4158645],"study_design_scores_gemma":[0.00101573,0.0002463672,0.001628641,0.0002822707,0.0001642553,0.001079924,0.0000320801,0.2963406,0.01814852,0.0903409,0.5904532,0.0002675675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006121069,0.00009749547,0.8818346,0.0001151764,0.0001622895,0.0003137705,0.003357328,0.1095064,0.004000775],"genre_scores_gemma":[0.01765116,0.0005104912,0.88263,0.000483993,0.0002793502,0.003505213,0.01232571,0.0621554,0.02045873],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.08680658,"threshold_uncertainty_score":0.2903969,"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","authors":[{"name":"Minghui Xu","is_ca":false},{"name":"Zhe George Zhang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002039065,0.0009213998,0.001842045,0.0006660053,0.0007131715,0.002716449,0.001339078,0.002383083,0.006101505],"category_scores_gemma":[0.00504737,0.0006174989,0.001436068,0.0008140361,0.001934281,0.003299258,0.001375347,0.002202425,0.0006843924],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001019791,"about_ca_system_score_gemma":0.0008835352,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001517688,"about_ca_topic_score_gemma":0.0007253257,"domain_scores_codex":[0.9990362,0.0003768827,0.00005417108,0.0001888167,0.0002279635,0.0001160134],"domain_scores_gemma":[0.997676,0.001381175,0.0004091965,0.0001292296,0.0002540635,0.0001503745],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005775642,0.00004645526,0.0004211311,0.0001093164,0.00004529067,0.0004510504,0.0001237895,0.1488596,0.001820024,0.8385723,0.003279508,0.006213764],"study_design_scores_gemma":[0.00003576262,0.00007400187,0.0002192948,0.00002960632,0.00003804341,0.0002002493,0.00005490013,0.6522607,0.0003875169,0.3437262,0.002934665,0.00003891818],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05877373,0.00199941,0.8875924,0.005099958,0.0002909087,0.00008428354,0.0003847354,0.0001714107,0.04560328],"genre_scores_gemma":[0.925362,0.002782832,0.04628375,0.000508339,0.0006647864,0.0001444483,0.0002086489,0.00007533498,0.02396981],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006101505,"threshold_uncertainty_score":0.02041161,"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","authors":[{"name":"Gilbert Laporte","is_ca":true},{"name":"François Louveaux","is_ca":false},{"name":"Luc van Hamme","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001228053,0.00127272,0.0008162195,0.0009563901,0.0006975752,0.001123042,0.001931292,0.001531297,0.00559072],"category_scores_gemma":[0.003229768,0.0005734054,0.0009541697,0.001226386,0.0007919793,0.001228211,0.001405983,0.00150131,0.001303108],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001510852,"about_ca_system_score_gemma":0.002272944,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003487478,"about_ca_topic_score_gemma":0.004505265,"domain_scores_codex":[0.999275,0.0002462699,0.00003656128,0.0001603087,0.0001547776,0.0001270412],"domain_scores_gemma":[0.9992048,0.0003979319,0.0001200484,0.00008828114,0.0001288507,0.00006007771],"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.0004009783,0.0002714519,0.0007731057,0.0001690162,0.00005372412,0.0001340523,0.0002208667,0.5975805,0.004325187,0.04451222,0.01035451,0.3412044],"study_design_scores_gemma":[0.0000774475,0.0001016333,0.00007252665,0.00001991979,0.00001038325,0.00005507012,0.00003603288,0.983947,0.001220344,0.01090913,0.003536226,0.00001436535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006151945,0.0001050222,0.9889351,0.000215243,0.00004295121,0.00009754793,0.000066285,0.0005810854,0.003804858],"genre_scores_gemma":[0.07859681,0.0001144881,0.9174724,0.0002364251,0.00002566073,0.0003424039,0.0002982079,0.0001812416,0.002732388],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00559072,"threshold_uncertainty_score":0.01870281,"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","authors":[{"name":"Alain Hertz","is_ca":false},{"name":"Gilbert Laporte","is_ca":true},{"name":"Michel Mittaz","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000987519,0.001179339,0.001333235,0.00212998,0.001307837,0.001541015,0.001822309,0.001907767,0.009327731],"category_scores_gemma":[0.00384791,0.0006399369,0.0009967126,0.004459372,0.0008457687,0.00137482,0.0009246195,0.00128552,0.00240915],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001433795,"about_ca_system_score_gemma":0.00195216,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008599272,"about_ca_topic_score_gemma":0.007976663,"domain_scores_codex":[0.9991865,0.0004154255,0.00002425761,0.0000958309,0.0001527272,0.0001252671],"domain_scores_gemma":[0.9988387,0.000716011,0.0001029486,0.0001010083,0.0001872747,0.00005403809],"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.0001697272,0.0002354119,0.0005416672,0.0002259959,0.00008014071,0.0001186286,0.0001047297,0.718159,0.001304543,0.01371425,0.01970162,0.2456442],"study_design_scores_gemma":[0.00007605346,0.0001314863,0.0002704266,0.00005326555,0.00003629008,0.00008471513,0.00005642496,0.9834442,0.0009438155,0.00830187,0.006573922,0.00002747534],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06774749,0.005774642,0.8828891,0.0009682736,0.0005433288,0.0008681667,0.001814306,0.005207073,0.03418778],"genre_scores_gemma":[0.253492,0.001971334,0.7283376,0.0005527455,0.0001533758,0.00124485,0.002753682,0.0007637619,0.01073062],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009327731,"threshold_uncertainty_score":0.0312044,"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","authors":[{"name":"Jack Brimberg","is_ca":true},{"name":"Pierre Hansen","is_ca":true},{"name":"Nenad Mladenović","is_ca":true},{"name":"Éric D. Taillard","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001673823,0.001092511,0.0009839714,0.001416884,0.000590171,0.0009545074,0.002239348,0.001187628,0.002549106],"category_scores_gemma":[0.005804023,0.0004894809,0.0007681425,0.002351877,0.0006517466,0.001584995,0.0007440984,0.0007572778,0.0004721813],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001440939,"about_ca_system_score_gemma":0.001625193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006489031,"about_ca_topic_score_gemma":0.007745874,"domain_scores_codex":[0.9988195,0.0004566546,0.00006813435,0.0001422482,0.0003321428,0.0001812262],"domain_scores_gemma":[0.9970289,0.002027869,0.0002103476,0.0002876084,0.0003427792,0.000102489],"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.0004044744,0.0002870506,0.001374613,0.0002956844,0.00008746184,0.0001053454,0.000128445,0.8108758,0.001313973,0.01090373,0.002363935,0.1718594],"study_design_scores_gemma":[0.000144398,0.0002600598,0.0008288608,0.00004874938,0.00005149973,0.00011756,0.0001367311,0.9868048,0.001848674,0.006749557,0.002982572,0.00002639981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2486156,0.008689317,0.7065521,0.0005164364,0.0003551115,0.0004427304,0.0003791143,0.002624277,0.03182526],"genre_scores_gemma":[0.5191023,0.00268885,0.4743089,0.0001571515,0.0000767856,0.0001800504,0.0004372644,0.0001811646,0.002867632],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006489031,"threshold_uncertainty_score":0.01290256,"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","authors":[{"name":"Dmitry Krass","is_ca":true},{"name":"Mozart B.C. Menezes","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003394941,0.0009298052,0.001629306,0.0008008154,0.00118042,0.001593041,0.001751252,0.001995307,0.003219337],"category_scores_gemma":[0.00836969,0.0009134794,0.00118595,0.001485489,0.002262582,0.002754122,0.001710895,0.001455495,0.0002217885],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002046205,"about_ca_system_score_gemma":0.0009834995,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004109711,"about_ca_topic_score_gemma":0.003121907,"domain_scores_codex":[0.9986721,0.0006897477,0.0000354797,0.0001824924,0.0001401009,0.0002800185],"domain_scores_gemma":[0.9940451,0.004078498,0.001027496,0.0002349356,0.0003679919,0.0002459574],"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.00008436816,0.00002934806,0.0006815431,0.00006763403,0.00002890263,0.0001104126,0.00005776615,0.9508403,0.0006618701,0.04035675,0.0007366628,0.006344441],"study_design_scores_gemma":[0.0000282684,0.00009960122,0.0004676947,0.00002129046,0.00003101027,0.0001542386,0.0001608575,0.9278253,0.0007054615,0.06968556,0.0007994281,0.00002117241],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1396973,0.0009988575,0.851451,0.001193814,0.00006384301,0.00005862912,0.0001207539,0.0001552241,0.006260514],"genre_scores_gemma":[0.9666356,0.0006217406,0.02977402,0.00009490426,0.00008252757,0.0000734217,0.00005089887,0.0000610649,0.002605913],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004109711,"threshold_uncertainty_score":0.01795441,"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","authors":[{"name":"Daniel Adelman","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003362168,0.0008696007,0.0008538418,0.0005717613,0.0005359082,0.003238553,0.001645446,0.001251863,0.006309687],"category_scores_gemma":[0.008483102,0.0006445328,0.0007417865,0.0009726422,0.001879533,0.004956384,0.001244086,0.002544488,0.0008561682],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002589281,"about_ca_system_score_gemma":0.002221495,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003728788,"about_ca_topic_score_gemma":0.002141072,"domain_scores_codex":[0.9981049,0.0009067715,0.00007996779,0.0002617661,0.0004206869,0.0002257882],"domain_scores_gemma":[0.997987,0.001246468,0.0001960519,0.0001717877,0.000316429,0.00008214776],"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.00003503894,0.00004977834,0.0002003605,0.00007474225,0.00001282118,0.00005710572,0.00008859616,0.4812556,0.0006087569,0.4948187,0.001368364,0.02143006],"study_design_scores_gemma":[0.00001648158,0.00003530734,0.00009224813,0.00002020506,0.000006934556,0.00002383687,0.00002625684,0.8134352,0.0005493177,0.1829381,0.002843283,0.00001287471],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01512304,0.0007234088,0.9687738,0.0006766889,0.0001038055,0.00006681195,0.0001033609,0.0001173316,0.01431172],"genre_scores_gemma":[0.8313523,0.001094883,0.1588492,0.0002055847,0.000224997,0.0001973303,0.000153535,0.0001595036,0.007762723],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006309687,"threshold_uncertainty_score":0.02110803,"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","authors":[{"name":"Ivan Contreras","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Gilbert Laporte","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009744178,0.001303367,0.0009531085,0.0007526155,0.0005448179,0.0008629271,0.001030734,0.0008528079,0.00545474],"category_scores_gemma":[0.002173779,0.0007350396,0.0008554542,0.0009974655,0.0006363771,0.001053094,0.0009800782,0.001675806,0.001091],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009059009,"about_ca_system_score_gemma":0.001363834,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00260539,"about_ca_topic_score_gemma":0.00356355,"domain_scores_codex":[0.9994701,0.0001982258,0.00001889613,0.00008277058,0.0001719627,0.00005808302],"domain_scores_gemma":[0.9994697,0.000326948,0.00005376171,0.00006431102,0.00006097306,0.00002436766],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005094583,0.00004043258,0.0001352936,0.0001091508,0.00002345834,0.00005907571,0.0000364033,0.9081748,0.001414805,0.03064162,0.002230324,0.05708377],"study_design_scores_gemma":[0.00001556563,0.00001619173,0.00004637254,0.000009517466,0.000004685288,0.000017772,0.0000119236,0.9762891,0.0005731061,0.02120681,0.001803807,0.000005201997],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00460643,0.0001371319,0.991832,0.00009065852,0.00002488,0.00005595513,0.00007258963,0.0002863232,0.002894117],"genre_scores_gemma":[0.1175781,0.0003407945,0.8764148,0.00006270266,0.00005131238,0.0003186561,0.0004602954,0.0002520203,0.00452132],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00545474,"threshold_uncertainty_score":0.01824796,"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","authors":[{"name":"Erick Delage","is_ca":true},{"name":"Shie Mannor","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006993933,0.001576946,0.002485355,0.001345886,0.0008765465,0.002592529,0.001166665,0.001691012,0.003782567],"category_scores_gemma":[0.02178892,0.0008654148,0.001123594,0.001547827,0.00209013,0.003051362,0.002225716,0.002370783,0.0003751264],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002589782,"about_ca_system_score_gemma":0.002039732,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003353383,"about_ca_topic_score_gemma":0.002255916,"domain_scores_codex":[0.9964985,0.002053294,0.0001532632,0.0003292563,0.0005205522,0.0004452219],"domain_scores_gemma":[0.9868022,0.01115825,0.0008317214,0.0003323768,0.0004738014,0.0004016727],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00007485536,0.00002417625,0.0004199674,0.00006666077,0.00003085938,0.00005775846,0.00005546414,0.8864178,0.000189374,0.1027275,0.000651727,0.00928375],"study_design_scores_gemma":[0.00000878478,0.00002115303,0.00009795922,0.00001482461,0.000005395881,0.00001025886,0.0000141948,0.9088791,0.0001075662,0.09044347,0.0003872211,0.000009940942],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02780702,0.001071051,0.9662752,0.0005303238,0.00004356119,0.00006296823,0.0001440092,0.0001898014,0.003875999],"genre_scores_gemma":[0.8519108,0.00208267,0.13873,0.0001873511,0.0001363558,0.0004074643,0.0004393819,0.0001432354,0.005962742],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006993933,"threshold_uncertainty_score":0.0369879,"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","authors":[{"name":"Anton Braverman","is_ca":false},{"name":"J. G. Dai","is_ca":false},{"name":"Xin Liu","is_ca":false},{"name":"Lei Ying","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007100719,0.0006410797,0.001049941,0.0008279529,0.001205273,0.003847548,0.001636694,0.001597969,0.008082273],"category_scores_gemma":[0.00277029,0.000613307,0.0008335627,0.001295795,0.001825392,0.006369015,0.001515103,0.002166757,0.0007519019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002216656,"about_ca_system_score_gemma":0.001391399,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008975354,"about_ca_topic_score_gemma":0.004989177,"domain_scores_codex":[0.9992927,0.0001876986,0.00004348052,0.0001905891,0.0001536537,0.0001318092],"domain_scores_gemma":[0.9987111,0.0006889985,0.0001545047,0.0001183549,0.0002636138,0.00006342819],"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.00001643471,0.00003958719,0.0004566069,0.0001234866,0.00001330692,0.0001347897,0.0002241655,0.2294007,0.000763315,0.7529287,0.002029988,0.01386897],"study_design_scores_gemma":[0.000006024577,0.00002880779,0.000421083,0.00005693626,0.00001363216,0.0001245823,0.0002772064,0.5031648,0.0004227109,0.4862669,0.009186941,0.00003031306],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04167682,0.004576559,0.8970648,0.002219804,0.0002996513,0.00008620949,0.0002394841,0.0001239767,0.05371286],"genre_scores_gemma":[0.9008183,0.007092213,0.06711799,0.0003811386,0.0004677777,0.00007188718,0.0002687933,0.00006570626,0.02371623],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008975354,"threshold_uncertainty_score":0.02703792,"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","authors":[{"name":"Yossiri Adulyasak","is_ca":true},{"name":"Jean‐François Cordeau","is_ca":true},{"name":"Raf Jans","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002265793,0.001930931,0.001356718,0.001175093,0.0006082637,0.001376141,0.0008932294,0.001395614,0.006392753],"category_scores_gemma":[0.003009845,0.001169304,0.001861637,0.001479238,0.0008138248,0.001696589,0.001027001,0.002549846,0.000892357],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002025997,"about_ca_system_score_gemma":0.001975378,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006031306,"about_ca_topic_score_gemma":0.004931083,"domain_scores_codex":[0.9989624,0.0004294187,0.00004976242,0.0001640017,0.000263203,0.0001312322],"domain_scores_gemma":[0.9990906,0.0005818841,0.0001016009,0.00006427872,0.000116789,0.00004481429],"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.00002796105,0.00001942847,0.0001008931,0.00004176153,0.00001923682,0.00003070523,0.00002355446,0.9556358,0.0006164527,0.03305636,0.0006575129,0.009770336],"study_design_scores_gemma":[0.000008468112,0.00001103428,0.00003710032,0.00000743698,0.000005711219,0.000006939462,0.0000071821,0.9670969,0.0001825945,0.03168423,0.0009482674,0.000004232855],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004332566,0.0001924493,0.9919094,0.000136939,0.00002464439,0.00005166758,0.0001333462,0.0001151867,0.003103741],"genre_scores_gemma":[0.2134541,0.001417666,0.7696562,0.0002086123,0.0001499452,0.0006692701,0.001208276,0.0003319242,0.01290402],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006392753,"threshold_uncertainty_score":0.02138585,"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","authors":[{"name":"Xiaomei Ding","is_ca":false},{"name":"Martin L. Puterman","is_ca":true},{"name":"Arnab Bisi","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009832664,0.0008202036,0.001919081,0.0009595475,0.0009801291,0.00339188,0.001461527,0.002710931,0.004681787],"category_scores_gemma":[0.0521185,0.001192537,0.0008208902,0.0008739321,0.003778193,0.006610989,0.001704028,0.003159797,0.000588307],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002528378,"about_ca_system_score_gemma":0.001883242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00236353,"about_ca_topic_score_gemma":0.001392433,"domain_scores_codex":[0.995162,0.002708584,0.0002009109,0.0005213969,0.0005370741,0.0008700364],"domain_scores_gemma":[0.9431377,0.04588166,0.005107364,0.002801419,0.001732144,0.001339716],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0009137556,0.0002323224,0.003286989,0.0002593538,0.0001727814,0.0006629682,0.0005664171,0.4445439,0.002302432,0.5151597,0.002730354,0.02916902],"study_design_scores_gemma":[0.0001480029,0.0001848457,0.001770511,0.00007840819,0.0000553807,0.0001750121,0.0002301302,0.5468787,0.001688643,0.4469585,0.001741548,0.00009028223],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3250474,0.002506444,0.6451411,0.006184851,0.0001661227,0.0001096235,0.0003150279,0.0004149688,0.02011448],"genre_scores_gemma":[0.9801393,0.00107195,0.01543046,0.0002126485,0.00009763103,0.00005204765,0.00007106028,0.00005789575,0.002867048],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009832664,"threshold_uncertainty_score":0.0520007,"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","authors":[{"name":"Guy Desaulniers","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00162993,0.001310351,0.001600471,0.0008571257,0.0007167944,0.001501207,0.00105309,0.001094322,0.005384565],"category_scores_gemma":[0.00277793,0.000838783,0.0008588469,0.001559937,0.0009063286,0.001882659,0.0009345631,0.001663079,0.0005877124],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00132199,"about_ca_system_score_gemma":0.001829508,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005377891,"about_ca_topic_score_gemma":0.004624336,"domain_scores_codex":[0.9992014,0.0003602908,0.00002949248,0.0001175827,0.0001645376,0.0001268038],"domain_scores_gemma":[0.9988845,0.0008645213,0.00009080957,0.00003823581,0.00006337256,0.00005859612],"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.0001895443,0.0001064538,0.0003847844,0.000205244,0.00004946286,0.0001167241,0.00008110852,0.9014239,0.001312767,0.03302133,0.002249912,0.0608588],"study_design_scores_gemma":[0.00003859464,0.0000557914,0.00008130959,0.00001188743,0.00001360305,0.00002684289,0.00002138429,0.9783447,0.0004667371,0.01959973,0.001332946,0.000006571962],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02241353,0.0008657391,0.9718894,0.0002862863,0.00004864126,0.0001780004,0.0001497694,0.0001838797,0.003984689],"genre_scores_gemma":[0.2778203,0.001738989,0.7134788,0.0001064711,0.0001083133,0.0006314373,0.0005768141,0.0001991554,0.005339771],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005384565,"threshold_uncertainty_score":0.01801318,"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","authors":[{"name":"Woonghee Tim Huh","is_ca":true},{"name":"Retsef Levi","is_ca":false},{"name":"Paat Rusmevichientong","is_ca":false},{"name":"James B. Orlin","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006527887,0.0008774624,0.001898521,0.0009646918,0.0003643,0.001289174,0.001973389,0.001104159,0.001538541],"category_scores_gemma":[0.02019422,0.0006518162,0.0008668855,0.0008988827,0.001582627,0.001979026,0.001335817,0.002064714,0.0002760566],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001195526,"about_ca_system_score_gemma":0.001479493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003062447,"about_ca_topic_score_gemma":0.001602146,"domain_scores_codex":[0.9978051,0.001062489,0.0001167409,0.0004031967,0.0004569532,0.00015563],"domain_scores_gemma":[0.9870047,0.009781703,0.001134251,0.0007672503,0.001096476,0.0002156182],"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.00009142322,0.00004752265,0.001205136,0.00007996555,0.00008212274,0.00005055755,0.00009132615,0.9247921,0.001141705,0.04690508,0.0004882345,0.02502485],"study_design_scores_gemma":[0.00001424466,0.0000258201,0.0001230037,0.00000596305,0.000007815001,0.00001045419,0.000004220471,0.9895991,0.0002696651,0.009727813,0.0002006911,0.00001115427],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009042104,0.0001599933,0.9901805,0.00008154482,0.00001489485,0.00002484407,0.00002550065,0.0001287898,0.0003418113],"genre_scores_gemma":[0.8015152,0.0006108119,0.1951288,0.0001354561,0.0000858526,0.0002859399,0.0001970241,0.0000796634,0.001961147],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006527887,"threshold_uncertainty_score":0.03452319,"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","authors":[{"name":"Daniel Granot","is_ca":true},{"name":"Greys Sošić","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001978683,0.001237689,0.001880845,0.0006848093,0.001276705,0.002684896,0.0038862,0.003380863,0.01764906],"category_scores_gemma":[0.003123571,0.001005386,0.001467388,0.001194573,0.001758369,0.002975262,0.001811991,0.002171021,0.001775521],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002872426,"about_ca_system_score_gemma":0.002076782,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0107223,"about_ca_topic_score_gemma":0.008625504,"domain_scores_codex":[0.9983439,0.0005757358,0.0000678401,0.0004198849,0.0002126605,0.0003799492],"domain_scores_gemma":[0.9975404,0.001117775,0.0004185028,0.0001538171,0.0004002646,0.0003693834],"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.0003780393,0.0001756149,0.001092836,0.0001393916,0.00007640025,0.0006062264,0.0002020782,0.8451118,0.002054339,0.1435208,0.00184164,0.004800828],"study_design_scores_gemma":[0.0002364486,0.0001342524,0.0003104178,0.00001339782,0.00004056614,0.00008989302,0.00006506593,0.9628842,0.0002438781,0.03401769,0.001925341,0.00003866244],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1431539,0.0006499856,0.817173,0.001989723,0.0001695807,0.0005556714,0.001614493,0.0003358561,0.03435779],"genre_scores_gemma":[0.9063926,0.0005418289,0.05173492,0.0001989934,0.0001075957,0.0006797382,0.0004279756,0.00005454703,0.0398619],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01764906,"threshold_uncertainty_score":0.05904198,"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","authors":[{"name":"Ilfat Ghamlouche","is_ca":true},{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Michel Gendreau","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008012945,0.0005254483,0.0006896888,0.0009561581,0.0004807899,0.0006420001,0.001230116,0.0008965625,0.002194017],"category_scores_gemma":[0.002531362,0.0003732809,0.0006339367,0.0008619164,0.0006953981,0.00111636,0.000871207,0.0006646386,0.0004191397],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007765261,"about_ca_system_score_gemma":0.0006553324,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002043109,"about_ca_topic_score_gemma":0.002423525,"domain_scores_codex":[0.9996815,0.0001285185,0.0000136791,0.00003723883,0.0001124589,0.00002661446],"domain_scores_gemma":[0.9994397,0.0002923191,0.00005968289,0.00006785201,0.0001063661,0.00003403951],"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.00003899842,0.00002790626,0.000259016,0.00003931122,0.00001563463,0.00002181702,0.00005173782,0.9095024,0.000924183,0.03412491,0.0006414199,0.0543526],"study_design_scores_gemma":[0.00001287376,0.00004479486,0.00005491574,0.00000780238,0.000005114336,0.00001382597,0.00000861226,0.9833734,0.0004245159,0.01440905,0.001637371,0.000007680105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01564002,0.0002148849,0.9805088,0.00007266363,0.00002677679,0.00005926917,0.00003449164,0.0001623139,0.003280762],"genre_scores_gemma":[0.4222546,0.0003431719,0.5727841,0.00007701434,0.00003726408,0.0004624716,0.0001647421,0.0001326978,0.003744102],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002194017,"threshold_uncertainty_score":0.007339716,"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","authors":[{"name":"Yunzeng Wang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005539009,0.001002463,0.001912475,0.001307848,0.001107147,0.003577861,0.00168871,0.002598622,0.004195471],"category_scores_gemma":[0.01741019,0.001819571,0.001117296,0.001603241,0.003375761,0.004922501,0.001935757,0.001317268,0.0004504081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003178751,"about_ca_system_score_gemma":0.001690733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005759875,"about_ca_topic_score_gemma":0.004559818,"domain_scores_codex":[0.996051,0.001755634,0.0001947374,0.0005641096,0.0004570574,0.000977463],"domain_scores_gemma":[0.9835932,0.0128266,0.001684716,0.000389404,0.0006251513,0.0008809335],"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.000713955,0.0001775492,0.004333521,0.0001020806,0.0001013573,0.0007216265,0.0004015258,0.8996738,0.002413788,0.07995875,0.0005090445,0.01089302],"study_design_scores_gemma":[0.00009077562,0.0001212138,0.001256007,0.00001684544,0.00004386099,0.00009719225,0.000211651,0.9455715,0.0008015112,0.05142943,0.0003149245,0.00004514216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7757846,0.0002282028,0.2141725,0.0007577285,0.00002598587,0.0002075556,0.0001860985,0.00008909455,0.008548263],"genre_scores_gemma":[0.988979,0.0001473793,0.008576671,0.00002595735,0.0000145075,0.00006226096,0.00004879784,0.00001051466,0.002134895],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005759875,"threshold_uncertainty_score":0.02929348,"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","authors":[{"name":"Tamer Boyacı","is_ca":true},{"name":"Özalp Özer","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002736264,0.0006325946,0.0009229928,0.0004869038,0.000685973,0.002799884,0.00150474,0.001709878,0.003973887],"category_scores_gemma":[0.01162065,0.0005736573,0.0005099188,0.0006429196,0.002188269,0.006111055,0.0009805061,0.00258071,0.0002992387],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001209495,"about_ca_system_score_gemma":0.001902366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002439533,"about_ca_topic_score_gemma":0.002454067,"domain_scores_codex":[0.998403,0.0005977913,0.00005630694,0.0002154973,0.0003923676,0.0003350259],"domain_scores_gemma":[0.9903979,0.006496965,0.001447498,0.0005939191,0.0005742813,0.0004894147],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008916354,0.0006720031,0.009395994,0.0003431094,0.000166225,0.0009487636,0.0006749109,0.519363,0.007805809,0.3153448,0.003892981,0.1405007],"study_design_scores_gemma":[0.0001049886,0.0003386387,0.003356416,0.00008726459,0.00007446049,0.0003080986,0.0006356134,0.858999,0.004801213,0.1278586,0.00335214,0.00008357578],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4660771,0.001516397,0.4790029,0.008131601,0.0002049518,0.0002131925,0.0001290512,0.0003272722,0.04439764],"genre_scores_gemma":[0.9839272,0.0002305666,0.01458754,0.0001069836,0.00005620615,0.00002197132,0.00002317637,0.00001936833,0.001027023],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003973887,"threshold_uncertainty_score":0.01447093,"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","authors":[{"name":"Gad Allon","is_ca":true},{"name":"Achal Bassamboo","is_ca":true},{"name":"Itai Gurvich","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01085835,0.0007265682,0.001159147,0.0006752274,0.001931336,0.006032607,0.002253089,0.004316608,0.003471474],"category_scores_gemma":[0.04595386,0.0009256349,0.0009602897,0.000863503,0.004300405,0.009599783,0.003343214,0.004911549,0.000434128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003994251,"about_ca_system_score_gemma":0.002870791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006456328,"about_ca_topic_score_gemma":0.003642533,"domain_scores_codex":[0.9929318,0.004455929,0.0001844481,0.0005559271,0.0009943345,0.0008775876],"domain_scores_gemma":[0.9644136,0.02762635,0.004185326,0.00123996,0.001470435,0.001064173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001266818,0.0003273746,0.005525589,0.0002556347,0.0001782759,0.001201304,0.005813169,0.2993583,0.003040102,0.6461906,0.003963543,0.0328794],"study_design_scores_gemma":[0.00009361335,0.0001805894,0.001367163,0.00005416241,0.00008251231,0.0001412986,0.001553468,0.658462,0.001088143,0.3348894,0.001955924,0.0001316225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5282243,0.001101276,0.4248189,0.01884788,0.0002392247,0.0001426057,0.000164826,0.0003063218,0.02615458],"genre_scores_gemma":[0.9901932,0.0001984726,0.007754882,0.0003847664,0.00006947716,0.00003846151,0.00002135174,0.0000216159,0.001317659],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01085835,"threshold_uncertainty_score":0.05742508,"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","authors":[{"name":"David Simchi‐Levi","is_ca":false},{"name":"Yehua Wei","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002966104,0.0006570613,0.0005331445,0.0007483595,0.0002368522,0.0008253279,0.0004806068,0.0008588969,0.003612656],"category_scores_gemma":[0.01172907,0.0003703281,0.0004857898,0.0006094783,0.001193203,0.002219424,0.0008806889,0.0007629046,0.0003337004],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008398276,"about_ca_system_score_gemma":0.0006110593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007243431,"about_ca_topic_score_gemma":0.0005284827,"domain_scores_codex":[0.9988508,0.000495192,0.0000442019,0.0001808326,0.0002721877,0.0001567301],"domain_scores_gemma":[0.9909445,0.006845476,0.0009686711,0.0006494859,0.0004197417,0.0001721735],"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.0001526007,0.00006210192,0.001125523,0.00009343386,0.00002223057,0.00004177477,0.0000978343,0.8875117,0.006681478,0.07008379,0.0002193798,0.03390809],"study_design_scores_gemma":[0.0000199932,0.0003752288,0.0007706856,0.00002229597,0.00001533293,0.00005219103,0.0000318165,0.9392076,0.002893225,0.05593681,0.0006570637,0.00001764345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2238025,0.0006135558,0.7659483,0.0002073821,0.00002048553,0.00005861414,0.00007056554,0.00009456853,0.009184128],"genre_scores_gemma":[0.9291202,0.0004875772,0.06804447,0.00006541891,0.00005033802,0.0000823849,0.00006878017,0.00003460246,0.002046247],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003612656,"threshold_uncertainty_score":0.01568645,"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","authors":[{"name":"Michael O. Ball","is_ca":false},{"name":"Maurice Queyranne","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006426672,0.002140471,0.002312985,0.001852467,0.001039006,0.004029868,0.003718773,0.001987465,0.007360813],"category_scores_gemma":[0.02453666,0.00089304,0.001281743,0.001650636,0.003125545,0.007096691,0.002547388,0.003671911,0.0008741057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004364075,"about_ca_system_score_gemma":0.0020469,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003330676,"about_ca_topic_score_gemma":0.001396809,"domain_scores_codex":[0.9955101,0.002035865,0.0001068737,0.0005303594,0.001204264,0.0006124239],"domain_scores_gemma":[0.9876289,0.008281093,0.001537578,0.0007400078,0.001256016,0.0005563291],"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.00009857709,0.0001434076,0.000407767,0.0001602297,0.00005304109,0.00008543862,0.00009129864,0.578777,0.001006349,0.3951029,0.002527792,0.02154616],"study_design_scores_gemma":[0.000008191227,0.00003382368,0.00008613538,0.00001445594,0.000007232904,0.00001714571,0.00001816937,0.9229424,0.000242476,0.0759251,0.0006935623,0.00001130616],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02197821,0.001373644,0.9534076,0.0008225578,0.0000926872,0.0001294164,0.000112418,0.0001993666,0.02188414],"genre_scores_gemma":[0.8911858,0.001674763,0.09664911,0.0003472466,0.0004962802,0.0002920402,0.0001818867,0.0003261205,0.008846688],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007360813,"threshold_uncertainty_score":0.03398794,"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","authors":[{"name":"Paul Embrechts","is_ca":false},{"name":"Haiyan Liu","is_ca":false},{"name":"Ruodu Wang","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005412488,0.001085821,0.001760553,0.0007819314,0.0006799583,0.003237996,0.002686195,0.001937426,0.006866753],"category_scores_gemma":[0.01155915,0.0004676166,0.001145782,0.001170093,0.00147108,0.003831666,0.002874266,0.002047022,0.0006890554],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001747471,"about_ca_system_score_gemma":0.001075561,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00103593,"about_ca_topic_score_gemma":0.0005528068,"domain_scores_codex":[0.9961271,0.001727585,0.0001740475,0.0007575839,0.000731999,0.0004817003],"domain_scores_gemma":[0.9953164,0.002320993,0.0008278169,0.000819311,0.0004490092,0.0002665312],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006774437,0.00008065169,0.0009868302,0.0001021097,0.00009458823,0.0001270324,0.0001586773,0.3130798,0.001281261,0.6428863,0.002025224,0.03910976],"study_design_scores_gemma":[0.00001838972,0.00006279026,0.000359062,0.00003074701,0.00002753165,0.000101103,0.00005472795,0.5524195,0.000557781,0.4429377,0.003404929,0.00002569381],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01856074,0.0006638006,0.9687675,0.000860046,0.00007721138,0.00005371677,0.0001179878,0.00009273984,0.01080623],"genre_scores_gemma":[0.9132997,0.001050797,0.07716795,0.0002754816,0.0002069714,0.0001466047,0.0001294493,0.00007221543,0.007650833],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006866753,"threshold_uncertainty_score":0.0286243,"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","authors":[{"name":"Mingming Leng","is_ca":false},{"name":"Mahmut Parlar","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003034667,0.0008291779,0.001073884,0.001070757,0.0007173554,0.001911628,0.001827217,0.001389564,0.003015183],"category_scores_gemma":[0.006473842,0.0005182924,0.000725419,0.001143558,0.001515812,0.002429756,0.001798781,0.0007647408,0.0001697482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003852833,"about_ca_system_score_gemma":0.00212164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008908638,"about_ca_topic_score_gemma":0.004998631,"domain_scores_codex":[0.9984525,0.0006802646,0.00004552028,0.0001560129,0.000229562,0.0004361335],"domain_scores_gemma":[0.9970813,0.001921189,0.000305441,0.0001616693,0.0002915356,0.0002388008],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00009616111,0.0000546999,0.0005024032,0.00002726826,0.00002825716,0.00007856079,0.00009749544,0.9767265,0.0008340369,0.01658855,0.0001270056,0.004839049],"study_design_scores_gemma":[0.00002074806,0.00005432988,0.0001784307,0.000004731969,0.00001549183,0.00001707548,0.0000682973,0.9909455,0.0003374254,0.008192111,0.0001580875,0.000007840326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4174531,0.0001436475,0.5738594,0.0005479181,0.00001785292,0.0002365346,0.00008594658,0.00009176956,0.007563855],"genre_scores_gemma":[0.9759745,0.00007112258,0.02258181,0.00003085566,0.000006232142,0.000101947,0.00001813948,0.00001185621,0.001203503],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008908638,"threshold_uncertainty_score":0.02795434,"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","authors":[{"name":"Steven M. Shechter","is_ca":true},{"name":"Matthew D. Bailey","is_ca":false},{"name":"Andrew J. Schaefer","is_ca":false},{"name":"Mark S. Roberts","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003497888,0.0006886218,0.001208093,0.0008819611,0.0007410675,0.002146024,0.000932497,0.001485134,0.007343695],"category_scores_gemma":[0.01763039,0.000692956,0.0005714772,0.0005760309,0.001282144,0.00320564,0.001120118,0.002066521,0.0004501536],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002664806,"about_ca_system_score_gemma":0.003565606,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006301527,"about_ca_topic_score_gemma":0.004402031,"domain_scores_codex":[0.9985671,0.0006346179,0.00006776879,0.0001637004,0.0001544459,0.0004124141],"domain_scores_gemma":[0.9884333,0.009003258,0.001041557,0.0002204865,0.0005214213,0.0007800842],"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.001038221,0.0003012037,0.005607803,0.0002680782,0.0001154169,0.0003303448,0.0002912527,0.5289598,0.002259024,0.4311957,0.004290272,0.02534284],"study_design_scores_gemma":[0.0002039982,0.0004094298,0.002582934,0.0001249239,0.00005628262,0.0001376536,0.0004047131,0.6844068,0.001605192,0.3072032,0.002799593,0.00006531551],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5031931,0.001544879,0.4553882,0.009522717,0.0002546205,0.0004928788,0.002308585,0.0003857939,0.02690911],"genre_scores_gemma":[0.9604989,0.001059814,0.03264236,0.0002423192,0.00009441594,0.0001800612,0.0004620218,0.0000462379,0.004773831],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.007343695,"threshold_uncertainty_score":0.02456713,"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","authors":[{"name":"Achal Bassamboo","is_ca":true},{"name":"J. Michael Harrison","is_ca":false},{"name":"Assaf Zeevi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003380228,0.001042355,0.001187532,0.0006312284,0.0005401694,0.001330213,0.001471955,0.001405621,0.003740966],"category_scores_gemma":[0.005971422,0.0006004096,0.0006548492,0.0004815388,0.001365979,0.001084856,0.001557023,0.001881226,0.0005044499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001724669,"about_ca_system_score_gemma":0.001858393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005475482,"about_ca_topic_score_gemma":0.002654765,"domain_scores_codex":[0.9989674,0.0005001562,0.00002507865,0.0001594367,0.0002398028,0.000108068],"domain_scores_gemma":[0.9976978,0.001549254,0.0001897878,0.00006670342,0.0003891051,0.0001072466],"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.00003721972,0.00003360979,0.0001577469,0.0000756025,0.00001887632,0.00004011368,0.00004367141,0.9607221,0.001311894,0.02500382,0.0007930342,0.01176226],"study_design_scores_gemma":[0.000004099691,0.000009832163,0.00001275557,0.00000301587,0.000002913216,0.000002973835,0.000003516578,0.9976171,0.00008695545,0.002081509,0.0001730159,0.000002331934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002751469,0.0001114065,0.9946668,0.000145266,0.00001367448,0.00002012591,0.00001033836,0.0001138983,0.002167014],"genre_scores_gemma":[0.7456462,0.0006368164,0.2441924,0.0002981475,0.0002271033,0.0005096638,0.0000870431,0.0002095768,0.008193042],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005475482,"threshold_uncertainty_score":0.01787657,"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","authors":[{"name":"Endong Zhu","is_ca":false},{"name":"Teodor Gabriel Crainic","is_ca":true},{"name":"Michel Gendreau","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004236343,0.0007207117,0.0003771251,0.0004990727,0.0003609697,0.0007112558,0.0007899537,0.0005722814,0.003348859],"category_scores_gemma":[0.0009609414,0.0002635291,0.0006040279,0.0006069625,0.0004283548,0.0007510891,0.0006136973,0.0006577279,0.0002938272],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001268939,"about_ca_system_score_gemma":0.00131074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007254812,"about_ca_topic_score_gemma":0.009026633,"domain_scores_codex":[0.9997557,0.00008525857,0.000008408319,0.00004295861,0.00007124864,0.00003633504],"domain_scores_gemma":[0.99984,0.00007130223,0.00002351839,0.00001006173,0.00003865379,0.00001654873],"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.00002103739,0.00001317217,0.0001442041,0.00003829376,0.000008773553,0.00003600716,0.00002503508,0.9620664,0.001349565,0.01806738,0.0005416985,0.01768843],"study_design_scores_gemma":[0.000003533893,0.0000144579,0.00002519217,0.000003758324,0.00000275001,0.000008791283,0.000009538454,0.993638,0.0002932501,0.00498866,0.001010275,0.000001829095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01472328,0.0001428628,0.9809441,0.00009682626,0.00003055456,0.00004452961,0.00004963602,0.00009969703,0.00386858],"genre_scores_gemma":[0.6009046,0.0005432296,0.3906066,0.00007806896,0.00004009952,0.0002317419,0.0002836763,0.0001019174,0.007210053],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007254812,"threshold_uncertainty_score":0.01442516,"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","authors":[{"name":"Jean‐François Cordeau","is_ca":true},{"name":"François Soumis","is_ca":true},{"name":"Jacques Desrosiers","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007961206,0.000788554,0.0007066423,0.0007058669,0.0007469318,0.001465374,0.001050462,0.001070849,0.006208387],"category_scores_gemma":[0.00288095,0.0007028125,0.0007554726,0.002103674,0.0005509481,0.002008981,0.001011353,0.0007923681,0.0007629509],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008747131,"about_ca_system_score_gemma":0.001576307,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01329769,"about_ca_topic_score_gemma":0.02256987,"domain_scores_codex":[0.9991428,0.0002307001,0.0000300895,0.0002793115,0.0001566909,0.0001603183],"domain_scores_gemma":[0.9994376,0.0001985572,0.00009461735,0.0001033356,0.00008993526,0.00007590256],"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.0003066316,0.0001516814,0.005380036,0.0001344753,0.00006236156,0.000266121,0.0001667452,0.8651518,0.007395794,0.01738289,0.002144969,0.1014565],"study_design_scores_gemma":[0.00005393423,0.0001322288,0.003079619,0.00001504538,0.00005429264,0.0001548525,0.0001703774,0.9662166,0.003628379,0.01745768,0.009011613,0.00002539679],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2566065,0.0002827076,0.7340383,0.0002702764,0.00008422052,0.0001580497,0.0004692236,0.0004995998,0.007591168],"genre_scores_gemma":[0.8492605,0.0002957977,0.1377673,0.00005998285,0.00003554734,0.0001084444,0.000845788,0.0001152937,0.01151138],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01329769,"threshold_uncertainty_score":0.02644056,"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","authors":[{"name":"Mahesh Nagarajan","is_ca":true},{"name":"Greys Sošić","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00194639,0.0009477997,0.001188963,0.001890006,0.002151225,0.002281111,0.001787207,0.001818703,0.008548642],"category_scores_gemma":[0.01197586,0.0006581493,0.001398139,0.001109015,0.00255811,0.003397343,0.002763568,0.001433455,0.001193395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002008711,"about_ca_system_score_gemma":0.001077675,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007310308,"about_ca_topic_score_gemma":0.003708415,"domain_scores_codex":[0.9987385,0.0004859737,0.00005306045,0.0002234086,0.0002499208,0.0002491699],"domain_scores_gemma":[0.9944552,0.002901424,0.001139733,0.0004051929,0.0005990712,0.000499456],"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.00006028403,0.00005175274,0.002319566,0.00006552787,0.0000911013,0.0003031864,0.0004573574,0.3405621,0.0007080839,0.6468126,0.002687301,0.00588107],"study_design_scores_gemma":[0.00002863881,0.00003552216,0.0004206079,0.00002056384,0.00001756334,0.00007743672,0.0001488808,0.7045493,0.000171048,0.2902918,0.004221993,0.00001652785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2455584,0.001784168,0.6743755,0.002364142,0.0002082981,0.0001720212,0.0005916057,0.0004603218,0.07448544],"genre_scores_gemma":[0.9483452,0.0008760292,0.02979012,0.0002705049,0.0002037995,0.0002542142,0.0006139635,0.0001730904,0.01947301],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008548642,"threshold_uncertainty_score":0.02859807,"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","authors":[{"name":"Timothy C. Y. Chan","is_ca":true},{"name":"Tim Craig","is_ca":true},{"name":"Taewoo Lee","is_ca":true},{"name":"Michael B. Sharpe","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001566624,0.001161314,0.001112168,0.0009282097,0.000447805,0.0007012757,0.0007771434,0.0009783012,0.00157258],"category_scores_gemma":[0.003025372,0.0004792835,0.001441655,0.0009878903,0.00120035,0.000691619,0.001547595,0.001692897,0.0002512807],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008705661,"about_ca_system_score_gemma":0.00106028,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003584808,"about_ca_topic_score_gemma":0.003272724,"domain_scores_codex":[0.9992518,0.0003587947,0.00002377853,0.00007439984,0.0002552895,0.00003589171],"domain_scores_gemma":[0.9989826,0.0006442541,0.00009064871,0.0001085266,0.0001417819,0.00003208697],"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.00001045829,0.00001783437,0.0001698213,0.00006787448,0.00003007807,0.00003035126,0.00003039596,0.9493763,0.001280879,0.02712183,0.0004425583,0.02142164],"study_design_scores_gemma":[0.000004422382,0.00001281839,0.00004980891,0.00000697936,0.000004404586,0.00001454583,0.000004798025,0.9827523,0.000310121,0.01560356,0.001230606,0.000005637389],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003063601,0.0003062804,0.9945338,0.0001875489,0.00002974109,0.00002206489,0.00001450624,0.00005549817,0.001786959],"genre_scores_gemma":[0.254461,0.0008755446,0.7386757,0.0002883351,0.00009133054,0.0003265371,0.00008241323,0.0001885583,0.005010519],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003584808,"threshold_uncertainty_score":0.008285165,"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","authors":[{"name":"Hyun‐Soo Ahn","is_ca":false},{"name":"Mehmet Gümüş","is_ca":true},{"name":"Philip Kaminsky","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003548254,0.0008410548,0.001468299,0.0006559276,0.0009299501,0.002726686,0.001666746,0.002601492,0.005208778],"category_scores_gemma":[0.009509348,0.001765908,0.001429365,0.001838433,0.001385575,0.003753726,0.0008888121,0.002096328,0.0003898366],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002384667,"about_ca_system_score_gemma":0.001586581,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007359448,"about_ca_topic_score_gemma":0.007353518,"domain_scores_codex":[0.9971039,0.001166863,0.0001148796,0.0006461336,0.0003418229,0.0006264391],"domain_scores_gemma":[0.9953145,0.003515818,0.0005918618,0.0002319748,0.0001279587,0.0002179866],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002739932,0.0001385052,0.003190567,0.00009638166,0.00009259718,0.0006162335,0.0001845708,0.8961658,0.001315677,0.08213414,0.001261649,0.01452986],"study_design_scores_gemma":[0.00004248061,0.00004349153,0.001386846,0.000007174026,0.00003738059,0.00009739983,0.00009917586,0.9620068,0.0004228278,0.03489846,0.0009276539,0.00003037626],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4060324,0.0008362895,0.5682554,0.002884738,0.0002101309,0.0002454665,0.0008489502,0.0002836666,0.02040302],"genre_scores_gemma":[0.9800765,0.0002447284,0.01606954,0.00008434873,0.00007363808,0.00007802113,0.000168095,0.00002344488,0.003181709],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007359448,"threshold_uncertainty_score":0.01876515,"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","authors":[{"name":"Ahmed Hadjar","is_ca":true},{"name":"Odile Marcotte","is_ca":true},{"name":"François Soumis","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008237817,0.001111225,0.001057956,0.0009686604,0.0007776579,0.001121096,0.001152696,0.001271358,0.005371913],"category_scores_gemma":[0.002482865,0.0006296166,0.0006695662,0.001537884,0.0005002963,0.001270244,0.00117251,0.001735937,0.0007645871],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001050896,"about_ca_system_score_gemma":0.002082867,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005811716,"about_ca_topic_score_gemma":0.005082166,"domain_scores_codex":[0.9995145,0.0001470313,0.00002022133,0.00008558002,0.0001371951,0.0000955389],"domain_scores_gemma":[0.9993029,0.0004921682,0.00004735982,0.00003808068,0.00007268848,0.00004680592],"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.0001638911,0.0002138803,0.0005429043,0.0001685659,0.00005721852,0.0001246161,0.0001152838,0.6900648,0.002121319,0.04096286,0.007370028,0.2580946],"study_design_scores_gemma":[0.00006513153,0.00005186933,0.0001022447,0.00001403596,0.00001595858,0.00003443022,0.0000248882,0.976922,0.0006469454,0.01959423,0.002521561,0.000006655636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0106251,0.0002699139,0.9842944,0.0002837365,0.00003068097,0.000131988,0.0001601545,0.000389215,0.003814789],"genre_scores_gemma":[0.08070508,0.0003517744,0.9162166,0.0000970578,0.00003305499,0.0002992235,0.0005147416,0.0001148174,0.001667625],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005811716,"threshold_uncertainty_score":0.0179708,"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","authors":[{"name":"Jean‐François Côté","is_ca":true},{"name":"Mauro Dell’Amico","is_ca":false},{"name":"Manuel Iori","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001406435,0.002259715,0.001404019,0.001223035,0.0006925275,0.001978147,0.001594329,0.001520167,0.008370208],"category_scores_gemma":[0.004393619,0.0009517323,0.001501635,0.002223644,0.001155505,0.002421763,0.001123836,0.003655143,0.001361046],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001288356,"about_ca_system_score_gemma":0.001021842,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002161483,"about_ca_topic_score_gemma":0.001786316,"domain_scores_codex":[0.9987583,0.0003869453,0.00006636889,0.000267777,0.0003565855,0.0001640076],"domain_scores_gemma":[0.9984369,0.001048824,0.000162918,0.0001308937,0.0001350225,0.00008552845],"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.0003278379,0.0002543431,0.0007323216,0.0006316635,0.0001364959,0.0002578811,0.0002343792,0.7014387,0.004070241,0.1520947,0.01922137,0.1206],"study_design_scores_gemma":[0.0001064902,0.0002086984,0.0005270154,0.00007610504,0.0000611221,0.0001982542,0.00009436967,0.806945,0.002100391,0.1694495,0.02020171,0.00003137077],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0211184,0.001338939,0.9578114,0.0007300955,0.0002610441,0.0002905009,0.0007497905,0.0005278437,0.01717192],"genre_scores_gemma":[0.2016861,0.002654329,0.7758955,0.0005386038,0.0006755218,0.0007555528,0.003624683,0.000506233,0.01366354],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008370208,"threshold_uncertainty_score":0.02800119,"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","authors":[{"name":"Alois Geyer","is_ca":false},{"name":"William T. Ziemba","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008373513,0.0007367683,0.0005377495,0.0006138172,0.0004180281,0.001708744,0.001071313,0.0009671845,0.008472912],"category_scores_gemma":[0.00191872,0.0004643164,0.0007298114,0.0006391488,0.0003708814,0.001145682,0.001111189,0.001051191,0.001235977],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001991166,"about_ca_system_score_gemma":0.002589772,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01609817,"about_ca_topic_score_gemma":0.009083431,"domain_scores_codex":[0.9995733,0.0001421383,0.00002236232,0.00008626068,0.0001139438,0.00006204798],"domain_scores_gemma":[0.9996831,0.0001182649,0.00005736712,0.00003078833,0.00007374336,0.0000367317],"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.0000230787,0.00001247308,0.0003088503,0.00002413317,0.000008486715,0.00006619191,0.00002152526,0.9590687,0.0001333404,0.03073291,0.002212538,0.007387859],"study_design_scores_gemma":[0.00002176966,0.0000151893,0.0001464725,0.00001574307,0.000007266869,0.00003922192,0.00001189828,0.9748573,0.0001755427,0.01437896,0.01032035,0.00001024685],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08625535,0.001439585,0.7386123,0.003268036,0.0002434599,0.0003869434,0.009242308,0.001816694,0.1587353],"genre_scores_gemma":[0.6819526,0.00133142,0.2573416,0.0003814188,0.00009853653,0.001079446,0.005405732,0.0003154059,0.05209385],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01609817,"threshold_uncertainty_score":0.03200895,"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","authors":[{"name":"Dimitris Bertsimas","is_ca":false},{"name":"Romy Shioda","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005159746,0.001915054,0.00200739,0.001915286,0.0006910675,0.003427498,0.001310788,0.001205739,0.004927121],"category_scores_gemma":[0.01604348,0.0006905707,0.001565696,0.002837959,0.00157866,0.002751569,0.002011555,0.003000261,0.001673136],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001170108,"about_ca_system_score_gemma":0.001647299,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001847592,"about_ca_topic_score_gemma":0.001509577,"domain_scores_codex":[0.9960611,0.002192551,0.0002184756,0.0006251088,0.0006956701,0.000206974],"domain_scores_gemma":[0.992749,0.005630966,0.0006063614,0.0004330316,0.0004552894,0.0001253407],"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.0001283675,0.00009543295,0.00123009,0.0002674632,0.0001046786,0.00009494447,0.00008256853,0.6717206,0.001009657,0.1524097,0.006091412,0.1667651],"study_design_scores_gemma":[0.00001006267,0.00001532792,0.00008249745,0.00001681213,0.000007311737,0.00001686515,0.00000971638,0.9378298,0.0002719972,0.05974868,0.001984278,0.000006704651],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001644767,0.0003079804,0.9958902,0.0003283115,0.00005222837,0.00003400432,0.00008408866,0.0001895504,0.001468859],"genre_scores_gemma":[0.09499459,0.0009385675,0.8988137,0.0003768214,0.0003265574,0.0005953587,0.0006566748,0.0002908589,0.003006838],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005159746,"threshold_uncertainty_score":0.02728772,"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","authors":[{"name":"Hatem Ben Amor","is_ca":true},{"name":"Jacques Desrosiers","is_ca":true},{"name":"José Valério de Carvalho","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002204485,0.001555489,0.000925459,0.001407283,0.000659481,0.001720406,0.001236717,0.001282079,0.007448542],"category_scores_gemma":[0.007457399,0.0005962896,0.001051683,0.00179752,0.001291939,0.00152388,0.001639073,0.003590906,0.001361681],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00118905,"about_ca_system_score_gemma":0.001125312,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001262211,"about_ca_topic_score_gemma":0.001196725,"domain_scores_codex":[0.9985232,0.0005572502,0.00007022834,0.0001832796,0.0005076129,0.0001585769],"domain_scores_gemma":[0.9973573,0.001668117,0.0002988787,0.0002324915,0.0003642458,0.00007890804],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002560093,0.0001634272,0.0003651936,0.000363039,0.00004450276,0.0001948855,0.0001332719,0.6420811,0.009603149,0.2358144,0.008233805,0.1027472],"study_design_scores_gemma":[0.00003421386,0.00003705745,0.00006009354,0.00003472223,0.00001019361,0.00003740584,0.000009991033,0.9551482,0.003161451,0.03848134,0.002974199,0.00001119852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00388297,0.0004193534,0.9908136,0.0001653818,0.00007854126,0.0000750523,0.00009669174,0.0001940325,0.004274369],"genre_scores_gemma":[0.2754464,0.001303311,0.7146572,0.0005024251,0.0002527364,0.0006732384,0.0007439352,0.0002735611,0.006147207],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007448542,"threshold_uncertainty_score":0.0249179,"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","authors":[{"name":"Wade D. Cook","is_ca":true},{"name":"Julie Harrison","is_ca":false},{"name":"Raha Imanirad","is_ca":true},{"name":"Paul Rouse","is_ca":false},{"name":"Joe Zhu","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008763173,0.001666797,0.00267069,0.0027149,0.0008606424,0.003387307,0.001726909,0.001720929,0.001947874],"category_scores_gemma":[0.01958991,0.0009018793,0.002986987,0.007806262,0.001438862,0.002892498,0.002787379,0.002763782,0.0004952491],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003295774,"about_ca_system_score_gemma":0.002896983,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01039286,"about_ca_topic_score_gemma":0.004810643,"domain_scores_codex":[0.992409,0.004354734,0.0006276064,0.0009391799,0.00133867,0.0003308903],"domain_scores_gemma":[0.9920134,0.005562138,0.0007890836,0.000885956,0.0006740403,0.00007533492],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00005235272,0.00004174559,0.0007636277,0.000202954,0.0001452489,0.0001557419,0.0001357786,0.8934029,0.000572655,0.08268926,0.0004423464,0.02139533],"study_design_scores_gemma":[0.00001091811,0.00002357174,0.0002657297,0.00003427068,0.00001756527,0.00001524816,0.00004941176,0.9526421,0.0006258664,0.04412322,0.002175166,0.00001698801],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01053873,0.0004461776,0.9863222,0.0002433347,0.00002906412,0.0001172632,0.0002589478,0.00007550855,0.001968762],"genre_scores_gemma":[0.4244497,0.00291699,0.5668077,0.0002020474,0.00009855752,0.0009879905,0.0007479275,0.0000794385,0.003709624],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01039286,"threshold_uncertainty_score":0.0463447,"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","authors":[{"name":"Refael Hassin","is_ca":false},{"name":"Ricky Roet-Green","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002953142,0.0006261488,0.001107738,0.0007580428,0.0007958891,0.002685606,0.001573627,0.001620589,0.004109092],"category_scores_gemma":[0.01384366,0.000426447,0.0008910656,0.0006978199,0.001726604,0.003390913,0.001382113,0.001551502,0.0002024405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004296592,"about_ca_system_score_gemma":0.002826914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01004935,"about_ca_topic_score_gemma":0.005749612,"domain_scores_codex":[0.998197,0.0006567999,0.00004499491,0.0001626578,0.0001607548,0.0007777576],"domain_scores_gemma":[0.9883828,0.008887999,0.001052645,0.0004286081,0.0005722259,0.0006756885],"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.0008325886,0.0005248368,0.006711247,0.00008085707,0.00005282062,0.0002895494,0.0001528377,0.84852,0.003371192,0.1320975,0.001182456,0.006184035],"study_design_scores_gemma":[0.00007290435,0.0001427176,0.001627767,0.00001322889,0.00002980177,0.00004064609,0.0001411767,0.9644215,0.0007057078,0.03263955,0.000134776,0.00003030484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9339358,0.0002135416,0.05678312,0.001129035,0.00002924774,0.00006299059,0.0002581218,0.0001130088,0.007475162],"genre_scores_gemma":[0.9963406,0.00007951287,0.002708812,0.00003424261,0.00000772503,0.00001801175,0.00003439965,0.00001150533,0.0007652995],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01004935,"threshold_uncertainty_score":0.03117406,"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","authors":[{"name":"Carlo Mannino","is_ca":false},{"name":"Alessandro Mascis","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000617328,0.0006584941,0.0008272436,0.0004578415,0.0005149051,0.001133171,0.0006889376,0.0006860296,0.001396606],"category_scores_gemma":[0.001628094,0.0003793822,0.0003120566,0.0005713655,0.0007407544,0.0005886139,0.0005207098,0.0004755362,0.000164524],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001298007,"about_ca_system_score_gemma":0.001235956,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01811061,"about_ca_topic_score_gemma":0.01159833,"domain_scores_codex":[0.9995613,0.0001291769,0.00001591741,0.00009528895,0.00006711247,0.0001312103],"domain_scores_gemma":[0.9993987,0.00029112,0.0001400426,0.00003624452,0.0000697716,0.00006406321],"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.00009176569,0.00002992922,0.0002457858,0.00002160302,0.000009495584,0.00002162371,0.00002690109,0.9898064,0.001875871,0.001870448,0.0001658257,0.005834351],"study_design_scores_gemma":[0.00001756083,0.00004336784,0.0001893595,0.000001611184,0.000003534831,0.000003745644,0.00001339135,0.997988,0.0005203488,0.001016276,0.0001988961,0.000003964559],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5129147,0.000395066,0.47634,0.0002760827,0.00003837796,0.000102162,0.0001292339,0.0005551028,0.00924927],"genre_scores_gemma":[0.9846081,0.00006939239,0.01379314,0.00001561495,0.00001084453,0.00002916125,0.00005185976,0.00002787424,0.001394044],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01811061,"threshold_uncertainty_score":0.03601038,"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","authors":[{"name":"Hong Chen","is_ca":true},{"name":"Hanqin Zhang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002137142,0.000539013,0.0006093081,0.0007152836,0.0009471641,0.001282274,0.000811323,0.0007054019,0.001767825],"category_scores_gemma":[0.01230355,0.0001969563,0.0003366312,0.0003912684,0.001253596,0.002096006,0.001269486,0.001023402,0.0002047192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001290478,"about_ca_system_score_gemma":0.002158152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005059847,"about_ca_topic_score_gemma":0.002011246,"domain_scores_codex":[0.998461,0.0002868431,0.0000854917,0.0003029161,0.0005137345,0.0003500813],"domain_scores_gemma":[0.9939104,0.003199708,0.001068313,0.000270613,0.001283408,0.0002674616],"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.0006100515,0.0001344723,0.00436798,0.0003184455,0.00006725273,0.0006633471,0.0008124136,0.6449673,0.07355049,0.2245995,0.00132455,0.04858424],"study_design_scores_gemma":[0.00003157801,0.00008553403,0.0004074281,0.00001507269,0.00001063824,0.00008077597,0.00009395176,0.9527454,0.007360219,0.03842182,0.0007323129,0.00001525692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3080093,0.0004629506,0.682161,0.0005104836,0.00008886056,0.00007355315,0.0001044625,0.0004055098,0.008183846],"genre_scores_gemma":[0.9821983,0.0001171514,0.01661321,0.00004881729,0.00002491014,0.00004711272,0.00004428676,0.00002066492,0.0008855304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005059847,"threshold_uncertainty_score":0.01130241,"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)","authors":[{"name":"Amir Ardestani-Jaafari","is_ca":true},{"name":"Erick Delage","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002931068,0.001620338,0.001614474,0.0007547116,0.0003685859,0.001331296,0.000977464,0.001208197,0.001944924],"category_scores_gemma":[0.006463888,0.0007523169,0.001327695,0.001329626,0.001479114,0.001765655,0.00169111,0.002464259,0.0002266216],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001496485,"about_ca_system_score_gemma":0.0007521377,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002594689,"about_ca_topic_score_gemma":0.001123388,"domain_scores_codex":[0.9986649,0.000689448,0.00006169334,0.0001950115,0.0002930735,0.00009591323],"domain_scores_gemma":[0.9969894,0.002270863,0.0003167736,0.000153516,0.0001849002,0.00008449484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001967431,0.00001158848,0.00008651041,0.00005591752,0.00001851448,0.00002513844,0.00002472733,0.969235,0.0005935335,0.02338483,0.000231426,0.006313082],"study_design_scores_gemma":[0.000002581185,0.00001709046,0.00002314762,0.000006643413,0.000004126814,0.000008313782,0.000006612264,0.9901175,0.0002563999,0.009237357,0.0003160354,0.000004177647],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009143284,0.0008867271,0.9873425,0.0002408225,0.00002812235,0.00001882264,0.00004341757,0.0001322192,0.002164092],"genre_scores_gemma":[0.6769139,0.002865206,0.3141374,0.0001691983,0.0001475099,0.0001978246,0.0001921812,0.0002616287,0.005115293],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002931068,"threshold_uncertainty_score":0.0155012,"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","authors":[{"name":"Sigrún Andradóttir","is_ca":false},{"name":"Hayriye Ayhan","is_ca":false},{"name":"Douglas G. Down","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00270985,0.0009319813,0.001142231,0.0007989016,0.000970612,0.001741531,0.001404351,0.001086279,0.001435039],"category_scores_gemma":[0.008402633,0.0007103392,0.0005185137,0.001274156,0.001919843,0.00248046,0.001510465,0.001008205,0.0002748008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002772491,"about_ca_system_score_gemma":0.001794863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003626622,"about_ca_topic_score_gemma":0.002711432,"domain_scores_codex":[0.9976878,0.001141033,0.00007539737,0.0002735144,0.0004244995,0.00039773],"domain_scores_gemma":[0.9974211,0.001734357,0.0002917075,0.0002155372,0.0001863383,0.0001509674],"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.00005113342,0.00002284739,0.0001131449,0.00003208933,0.00001415589,0.00003170804,0.00005503721,0.9520967,0.001326259,0.03767204,0.0002905294,0.008294322],"study_design_scores_gemma":[0.000009074705,0.00001536124,0.00002917076,0.000004183138,0.000004535827,0.000009414951,0.00001085769,0.9791809,0.000309096,0.02007434,0.0003468102,0.000006231472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06067975,0.0009206661,0.9340866,0.0002740256,0.00004705875,0.00007210217,0.00003711243,0.0002915813,0.003591156],"genre_scores_gemma":[0.9297047,0.0005409468,0.06782632,0.0000927671,0.00005101769,0.0001589419,0.00004353433,0.00006648761,0.001515387],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003626622,"threshold_uncertainty_score":0.02011597,"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","authors":[{"name":"Matt Thompson","is_ca":true},{"name":"Matt Davison","is_ca":true},{"name":"H. Rasmussen","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00131573,0.0006153009,0.000956647,0.0005296678,0.0005198155,0.001438253,0.001163983,0.001493272,0.003662835],"category_scores_gemma":[0.004269728,0.0006680472,0.0005362028,0.0005257725,0.0009425136,0.001656856,0.001016193,0.0009382626,0.0003166753],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001438281,"about_ca_system_score_gemma":0.001440802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00531555,"about_ca_topic_score_gemma":0.004288385,"domain_scores_codex":[0.9997032,0.0001245272,0.0000136412,0.00004460957,0.0000596377,0.00005439917],"domain_scores_gemma":[0.9990145,0.0007093601,0.00009202842,0.00003887152,0.00008751232,0.00005766267],"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.00003870976,0.00002005079,0.0004089383,0.0000180556,0.000009498439,0.00006092899,0.00005018721,0.9703001,0.0002676068,0.01894357,0.0003007611,0.009581692],"study_design_scores_gemma":[0.00001200836,0.00000867514,0.00003275363,0.000002715411,0.00000149017,0.000006714083,0.00001013911,0.992541,0.000117199,0.007104729,0.0001603634,0.00000226289],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1253329,0.000143008,0.8658581,0.0004595886,0.00002328363,0.000121924,0.0001252667,0.0002018888,0.007734032],"genre_scores_gemma":[0.7714437,0.0001241983,0.2248956,0.00005770373,0.00001871418,0.0001947351,0.0001706231,0.00006240362,0.003032274],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00531555,"threshold_uncertainty_score":0.01225334,"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","authors":[{"name":"Daniel Granot","is_ca":true},{"name":"Shuya Yin","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002977125,0.001520672,0.002547373,0.0008070763,0.0008794575,0.002622724,0.002242981,0.002876626,0.005286808],"category_scores_gemma":[0.008686273,0.001274626,0.001493037,0.0007876592,0.002679929,0.004302676,0.001338478,0.002354573,0.0006155701],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002593031,"about_ca_system_score_gemma":0.001299672,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006415646,"about_ca_topic_score_gemma":0.003556583,"domain_scores_codex":[0.998233,0.0005841033,0.00008176356,0.0003487156,0.0002624273,0.0004900081],"domain_scores_gemma":[0.9894069,0.006134868,0.002613277,0.0005019947,0.0007364939,0.0006065491],"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.0004879324,0.0001444137,0.001264424,0.0001083549,0.00009113424,0.0007084325,0.000195003,0.9075161,0.003834719,0.08049746,0.0009765187,0.004175477],"study_design_scores_gemma":[0.0001140726,0.0001237575,0.0005161404,0.000009800855,0.00005027693,0.00007943998,0.0000844464,0.968328,0.0004779764,0.02982882,0.0003366228,0.00005063058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6630585,0.000621192,0.3161958,0.002186636,0.0001392009,0.0001180567,0.000577034,0.0004041841,0.0166994],"genre_scores_gemma":[0.9886258,0.0002560808,0.005067977,0.00007727833,0.00004573846,0.0000462635,0.00007750307,0.00003595011,0.005767351],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.006415646,"threshold_uncertainty_score":0.01881379,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}