{"meta":{"page":1,"per_page":50,"max_per_page":100,"total":777,"total_is_capped":false,"direct_labels_cover":1,"predictions_cover":777,"direct_label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline (scores rank; they never assert a category)","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"query_hash":"8d2dff47989e","filters":{"topic":"Advanced Queuing Theory Analysis"}},"results":[{"id":"W1514890731","doi":"10.1007/978-1-4614-7101-1","title":"An Introduction to Heavy-Tailed and Subexponential Distributions","year":2013,"lang":"en","type":"book","venue":"Springer series in operations research/Springer series in operations research and financial engineering","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":558,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Actua","funders":"","keywords":"Heavy-tailed distribution; Statistical physics; Mathematics; Statistics; Physics; Probability distribution","retraction":null,"screen_n_in":null,"score":{"opus":0.01926845125411028,"gpt":0.289284281295768,"spread":0.2700158300416577,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.00361107,0.0006374911,0.0007822085,0.004494339,0.001859519,0.002721355,0.0007352135,0.0005028505,0.0003214586],"category_scores_gemma":[0.003713,0.0007235248,0.00008482691,0.002828252,0.0008854954,0.006177871,0.001459579,0.002752395,0.000132425],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008838638,"about_ca_system_score_gemma":0.000535813,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002502099,"about_ca_topic_score_gemma":0.02788487,"domain_scores_codex":[0.9946666,0.0001920167,0.001037818,0.001507555,0.001070184,0.001525873],"domain_scores_gemma":[0.9968534,0.0001437906,0.0000407019,0.001188065,0.001573496,0.0002006049],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003650985,0.000272689,0.0003936206,0.0005279959,0.00005514212,0.00007438662,0.0008564154,0.2542461,0.004242577,0.734946,0.001795321,0.002224675],"study_design_scores_gemma":[0.001859233,0.0008956418,0.008388612,0.001438527,0.00007798579,0.00005387209,0.001435538,0.1604998,0.001293726,0.01485088,0.8055947,0.003611406],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9295081,0.002397658,0.02381205,0.02076127,0.002875253,0.01063153,0.0003693404,0.0009268611,0.008717855],"genre_scores_gemma":[0.7997001,0.004061366,0.02249442,0.000216658,0.01692989,0.007740682,0.002184519,0.0007049909,0.1459673],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8037995,"threshold_uncertainty_score":0.9995483,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2168550848","doi":"10.1145/363647.363659","title":"Adversarial queuing theory","year":2001,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":274,"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":"Queueing theory; Probabilistic logic; Computer science; Adversarial system; Fair queuing; Network packet; Routing (electronic design automation); Mathematical optimization; Distributed computing; Computer network; Artificial intelligence; Quality of service; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.0146418859724814,"gpt":0.2381502043533885,"spread":0.2235083183809072,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001309818,0.00009391169,0.0001726178,0.000149094,0.0001726703,0.0000899178,0.001512733,0.00003420404,0.0003289755],"category_scores_gemma":[0.003965608,0.00005736752,0.0002608275,0.0004139896,0.00005098402,0.0009463358,0.0005365693,0.0002298047,0.00007608703],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003789384,"about_ca_system_score_gemma":0.00001525766,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001041283,"about_ca_topic_score_gemma":0.000007036781,"domain_scores_codex":[0.999176,0.00004135603,0.0002963274,0.00007668137,0.0002563393,0.0001533181],"domain_scores_gemma":[0.9983898,0.0001504944,0.0006569306,0.0006326406,0.0001612216,0.000008925922],"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.005000002,0.0006414268,0.07323597,0.0001631088,0.002550493,0.000646126,0.0008750372,0.08804347,0.02160425,0.6265472,0.07729512,0.1033978],"study_design_scores_gemma":[0.0006818887,0.000008431133,0.001695844,0.00009168023,0.0003582473,0.0000707505,0.0003912318,0.0005969699,0.0001692154,0.8531592,0.1426285,0.0001480135],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9622473,0.0002841682,0.004608558,0.01146436,0.002601086,0.00009544369,3.30569e-7,0.00004642184,0.01865229],"genre_scores_gemma":[0.9927213,0.00001265965,0.0005650842,0.002196123,0.003661222,4.11713e-7,2.103773e-7,0.00001623685,0.0008267566],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2266121,"threshold_uncertainty_score":0.4747489,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116690616","doi":"10.1109/iwqos.2006.250477","title":"An End-to-End Probabilistic Network Calculus with Moment Generating Functions","year":2006,"lang":"en","type":"article","venue":"International Workshop on Quality of Service","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":234,"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":"Network calculus; Computer science; Server; Probabilistic logic; Statistical time division multiplexing; Multiplexing; Queueing theory; Theoretical computer science; Moment (physics); Scalability; Algorithm; Calculus (dental); Computer network; Quality of service; Artificial intelligence; Telecommunications","retraction":null,"screen_n_in":null,"score":{"opus":0.02675253059035481,"gpt":0.2914396552845807,"spread":0.2646871246942259,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007670798,0.0001976527,0.000241934,0.0001880645,0.0002038853,0.0001644234,0.0003972595,0.00005111695,0.0005598256],"category_scores_gemma":[0.00008765861,0.0001803855,0.00007061031,0.0008179366,0.00004197869,0.000586354,0.00009899907,0.000143209,0.0001208311],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001022412,"about_ca_system_score_gemma":0.00001766153,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001999467,"about_ca_topic_score_gemma":0.006400371,"domain_scores_codex":[0.9981905,0.00004852132,0.0005173208,0.0004051465,0.0005968485,0.0002416611],"domain_scores_gemma":[0.9984134,0.0001995658,0.0003932921,0.0003689335,0.0006015808,0.00002320617],"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.0002162856,0.0002288102,0.001603054,0.00003893627,0.00007401377,0.000002384954,0.00003738633,0.8266921,0.0005902798,0.1678738,0.0003520166,0.002290984],"study_design_scores_gemma":[0.002749817,0.000138085,0.04728042,0.001121558,0.0004681011,0.00000609607,0.002443732,0.7851605,0.0002435314,0.08353631,0.07481186,0.002039982],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8464521,0.00002129123,0.1302745,0.009417747,0.0004894465,0.0003418589,0.00002204606,0.0001904409,0.01279058],"genre_scores_gemma":[0.9875106,4.058567e-7,0.003394407,0.005936532,0.002014917,0.00004699451,0.0002737437,0.00002865718,0.0007937917],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1410585,"threshold_uncertainty_score":0.7355906,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2108246181","doi":"10.1287/mnsc.1040.0236","title":"Modeling Daily Arrivals to a Telephone Call Center","year":2004,"lang":"en","type":"article","venue":"Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":214,"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; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Call management; Computer science; Center (category theory); Focus (optics); Goodness of fit; Variance (accounting); Stochastic modelling; Statistics; Econometrics; Telecommunications; Mathematics; Call control; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.01444649350268966,"gpt":0.2439805742878351,"spread":0.2295340807851454,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001019968,0.0002014615,0.0001811557,0.0008502307,0.0005070368,0.0004895409,0.001070629,0.00002054166,0.0000750024],"category_scores_gemma":[0.0001048452,0.0001904252,0.00007488284,0.002729669,0.0001426366,0.001876328,0.0009316271,0.00008657056,0.001588204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001553077,"about_ca_system_score_gemma":0.00001118251,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001770629,"about_ca_topic_score_gemma":0.00005812489,"domain_scores_codex":[0.9977095,0.000004667104,0.0002787527,0.000702201,0.0006880857,0.0006167614],"domain_scores_gemma":[0.9991491,0.000006219541,0.00008130247,0.0006056551,0.0001135288,0.00004423696],"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.0000254131,0.0001007157,0.0003133765,0.00005246417,0.00002135181,0.00003815069,0.00008972819,0.8665854,0.001322277,0.1261566,0.0002278581,0.005066647],"study_design_scores_gemma":[0.004646714,0.00005944129,0.003042073,0.000707199,0.0003987281,0.000008701022,0.002554979,0.6047916,0.001481155,0.2795073,0.09981824,0.002983788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.4829958,0.00001494966,0.4380943,0.002614295,0.000471568,0.0005332402,0.000001201907,0.0003929417,0.07488173],"genre_scores_gemma":[0.9847416,0.000003346764,0.008132793,0.006113554,0.000239088,0.00003130044,0.00000313416,0.00002148079,0.000713722],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5017458,"threshold_uncertainty_score":0.9991892,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2016945629","doi":"10.1287/msom.2013.0449","title":"Incentive-Compatible Revenue Management in Queueing Systems: Optimal Strategic Delay","year":2013,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":193,"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":"Revenue; Incentive; Revenue management; Queueing theory; Incentive compatibility; Computer science; Queue; Scope (computer science); Mechanism design; Microeconomics; Scheduling (production processes); Operations research; Business; Economics; Operations management; Finance; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01557171129881954,"gpt":0.2259616641810344,"spread":0.2103899528822148,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005195644,0.0004557784,0.0004012814,0.0009552639,0.0005136692,0.00142102,0.0007442593,0.00007552957,0.0005711956],"category_scores_gemma":[0.000005044268,0.0004687305,0.00009854983,0.001002036,0.00003399382,0.002644543,0.0006881161,0.0002647277,0.002324265],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000266167,"about_ca_system_score_gemma":0.000008126738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006039484,"about_ca_topic_score_gemma":0.001889023,"domain_scores_codex":[0.9972938,0.00006496695,0.0007482932,0.000772997,0.0004412843,0.0006786038],"domain_scores_gemma":[0.9987943,0.00002706593,0.0002079721,0.0007922222,0.0001415313,0.00003691572],"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.00001906593,0.0001953291,0.0002663812,0.0008916198,0.0002368452,0.0001067843,0.0001318889,0.9198311,0.00005188281,0.0754029,0.0003472024,0.002519024],"study_design_scores_gemma":[0.0031468,0.00002941667,0.01510971,0.001280918,0.0007540545,0.000008084796,0.01901658,0.9090466,0.0003398656,0.01625482,0.03268205,0.002331139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9454707,0.00009911272,0.005672548,0.001100617,0.000435451,0.002184209,0.000004904178,0.0003104363,0.04472201],"genre_scores_gemma":[0.9899808,0.0000379713,0.004106301,0.001615279,0.0002750321,0.0007910474,0.0001089126,0.000071761,0.003012897],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.05914808,"threshold_uncertainty_score":0.9997764,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2145197897","doi":"10.1287/mnsc.1070.0824","title":"Staffing Multiskill Call Centers via Linear Programming and Simulation","year":2008,"lang":"en","type":"article","venue":"Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":183,"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; Group for Research in Decision Analysis","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Staffing; Heuristics; Cutting-plane method; Computer science; Sample (material); Integer programming; Mathematical optimization; Linear programming; Sequence (biology); Service (business); Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.01534793979028453,"gpt":0.2547545107693148,"spread":0.2394065709790302,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006134557,0.0001486196,0.0001272573,0.0004689554,0.000813444,0.0001678315,0.0003251875,0.00001895038,0.00001926229],"category_scores_gemma":[0.00008390416,0.0001436454,0.00003820986,0.001257629,0.000388328,0.001991942,0.0004530073,0.00007187692,0.00007084882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005231526,"about_ca_system_score_gemma":0.000003762172,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007530978,"about_ca_topic_score_gemma":0.00001193482,"domain_scores_codex":[0.9984853,0.000007148612,0.0002058479,0.0004880273,0.0004292945,0.0003843257],"domain_scores_gemma":[0.9994401,0.00002945971,0.0001523623,0.0002658627,0.00008943919,0.00002281499],"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.00006897151,0.0002470459,0.07616176,0.000303901,0.00006976808,0.0001797782,0.0004927033,0.7079867,0.001105226,0.02167684,0.00009581402,0.1916115],"study_design_scores_gemma":[0.0004134728,0.000008220073,0.0141885,0.0000422569,0.00005523958,0.000001967391,0.0002068758,0.9662834,0.0000443568,0.0008912851,0.01756448,0.0002998869],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7924507,0.00002653186,0.2007964,0.0002185417,0.0002188277,0.0004810182,3.61584e-7,0.0003287901,0.005478818],"genre_scores_gemma":[0.988844,0.00000925911,0.01011696,0.0004957082,0.0001242596,0.00001091215,0.000003778079,0.00001425767,0.0003808902],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2582968,"threshold_uncertainty_score":0.6256436,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144979199","doi":"10.1287/opre.1110.0976","title":"“We Will Be Right with You”: Managing Customer Expectations with Vague Promises and Cheap Talk","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":179,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Vagueness; Computer science; Service (business); Queueing theory; Robustness (evolution); Business; Service provider; Marketing","retraction":null,"screen_n_in":null,"score":{"opus":0.05113570447700014,"gpt":0.3067104258066192,"spread":0.255574721329619,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004102876,0.0001524831,0.0001537164,0.0006215298,0.001125047,0.0004087973,0.0002123685,0.00003652468,0.0008752739],"category_scores_gemma":[0.00008588751,0.0001085317,0.00002240244,0.001313212,0.0003300164,0.002352337,0.000130044,0.0002488753,0.0001162502],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003515074,"about_ca_system_score_gemma":0.00004328086,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000660506,"about_ca_topic_score_gemma":0.0022481,"domain_scores_codex":[0.9986441,0.00004949959,0.0001595956,0.0003868624,0.000406265,0.0003537497],"domain_scores_gemma":[0.9990216,0.00005260773,0.00003258904,0.0003593015,0.0005029035,0.00003092967],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0009664192,0.001157068,0.01011029,0.0005418679,0.0008211732,0.0004206595,0.01586275,0.01763331,0.004225737,0.9365307,0.002357305,0.009372691],"study_design_scores_gemma":[0.01388098,0.001165539,0.009926322,0.002283777,0.002049001,0.0002682133,0.2136162,0.3424097,0.01665618,0.07063027,0.3200121,0.007101691],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7990845,0.0003141899,0.01085566,0.007292489,0.00004996492,0.001596206,0.000009098065,0.000299713,0.1804982],"genre_scores_gemma":[0.9877855,0.00002551044,0.004694038,0.0001180981,0.000163021,0.0002732496,0.00003180597,0.00003962632,0.006869202],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8659005,"threshold_uncertainty_score":0.9583635,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2118679801","doi":"10.1287/moor.1080.0366","title":"Queue-and-Idleness-Ratio Controls in Many-Server Service Systems","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":158,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Queue; Computer science; Limiting; State space; Routing (electronic design automation); Mathematical optimization; Multilevel queue; Service (business); Class (philosophy); State (computer science); Distributed computing; Computer network; Operations research; Queue management system; Mathematics; Engineering; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.0640631890681417,"gpt":0.3492090248340123,"spread":0.2851458357658707,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002248207,0.0001209992,0.0003118584,0.0006058608,0.0002185012,0.0003853853,0.0003066238,0.00006419582,0.00008101034],"category_scores_gemma":[0.0006347444,0.0001081795,0.00003556906,0.001146591,0.00006071967,0.0009732717,0.0001121534,0.0002018493,0.0001174197],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004012626,"about_ca_system_score_gemma":0.00003165106,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005885445,"about_ca_topic_score_gemma":0.0005974564,"domain_scores_codex":[0.9985066,0.0000613357,0.0004846459,0.0002135347,0.0004677223,0.0002661841],"domain_scores_gemma":[0.9985586,0.0001961313,0.0000666628,0.0004113524,0.0007525206,0.00001478044],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001715679,0.0002462796,0.0001925144,0.0004368857,0.00002256194,0.000005533228,0.0003457273,0.08541654,0.006093321,0.9069145,0.00006694457,0.0002420133],"study_design_scores_gemma":[0.0005268104,0.00001766163,0.0005065583,0.0002504735,0.00002623431,0.000002099825,0.001707967,0.9536304,0.0002814078,0.04253471,0.0003509756,0.0001647415],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.982115,0.0002354774,0.00672758,0.002840088,0.0000389486,0.0007962104,0.000003385876,0.00005229424,0.007191054],"genre_scores_gemma":[0.9978937,0.00001540121,0.001063538,0.0001965083,0.0001171195,0.00005672788,0.00001298462,0.00001535727,0.0006286822],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8682138,"threshold_uncertainty_score":0.4411434,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128483867","doi":"10.1287/opre.1060.0285","title":"Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":154,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kellogg's (Canada)","funders":"National Science Foundation","keywords":"Linear programming; Computer science; Mathematical optimization; Staffing; Routing (electronic design automation); Upper and lower bounds; Center (category theory); Asymptotically optimal algorithm; Mathematics; Computer network; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.03535919632853935,"gpt":0.3685946693310458,"spread":0.3332354730025065,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00328553,0.00008863497,0.0003077,0.001345212,0.0002464052,0.0001138509,0.0001879677,0.00004345389,0.000199019],"category_scores_gemma":[0.0003164011,0.0000801261,0.00008341706,0.002340981,0.0001038709,0.0004819258,0.00005403382,0.0001124573,0.000006796485],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002303792,"about_ca_system_score_gemma":0.00003717434,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001338607,"about_ca_topic_score_gemma":0.001364215,"domain_scores_codex":[0.9984801,0.0003512123,0.0003148163,0.0002443238,0.0003696616,0.0002398331],"domain_scores_gemma":[0.9984944,0.0003585937,0.00006079056,0.0003337908,0.0007383412,0.00001409889],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001040836,0.0004272144,0.004462385,0.00004704871,0.0003081423,0.000003540174,0.00002833957,0.9403235,0.02045615,0.03313954,0.00003944635,0.0006606229],"study_design_scores_gemma":[0.0007121481,0.00002282761,0.001847873,0.00001084763,0.000406809,1.262655e-7,0.00006452946,0.9944152,0.001500936,0.0006921748,0.0002505907,0.00007589439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1764724,0.00004071889,0.8224129,0.000237457,0.000007123352,0.0002644485,0.00001967352,0.00001753695,0.0005277506],"genre_scores_gemma":[0.9788671,0.000001515679,0.02067243,0.00008258178,0.00005106923,0.00002931248,0.0001020881,0.00001229583,0.0001816286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8023947,"threshold_uncertainty_score":0.3267448,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2159279836","doi":"10.1214/aoap/1015345342","title":"Join the shortest queue: stability and exact asymptotics","year":2001,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":149,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Queue; Pooling; Fork–join queue; Queueing theory; Mathematics; Join (topology); Computer science; Computer network; Queue management system; Combinatorics","retraction":null,"screen_n_in":null,"score":{"opus":0.0690515575263588,"gpt":0.2778830845658288,"spread":0.20883152703947,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003863634,0.000218832,0.0003290424,0.00004908133,0.0003488925,0.0001067872,0.0005288968,0.00006193794,0.0002285526],"category_scores_gemma":[0.000436512,0.0001257191,0.0001205261,0.0006078009,0.0007243672,0.0003317362,0.0003531143,0.0002377132,0.00002945026],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001416289,"about_ca_system_score_gemma":0.00001820248,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000111969,"about_ca_topic_score_gemma":0.0001375887,"domain_scores_codex":[0.9984798,0.00005835349,0.0004566325,0.0003837729,0.0002932131,0.0003281888],"domain_scores_gemma":[0.997875,0.0004517708,0.0003274802,0.001088664,0.0002396407,0.00001748729],"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.001651301,0.0008684995,0.05218685,0.0004986533,0.0003400616,0.000002984809,0.0008660849,0.008002958,0.002744243,0.8782615,0.001264932,0.05331193],"study_design_scores_gemma":[0.0002222781,0.00001589616,0.02201035,0.00001633161,0.0001469197,0.000001168596,0.0005419759,0.003371194,0.001175939,0.9558654,0.01635819,0.0002743705],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9680991,0.00008657677,0.0005503445,0.005534367,0.00003701316,0.0006473456,0.000003819154,0.00009349309,0.02494789],"genre_scores_gemma":[0.9977866,0.0000362655,0.0001498557,0.001727431,0.0002151183,0.00003591723,0.00000601481,0.00001766607,0.0000251614],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.07760388,"threshold_uncertainty_score":0.5126677,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144892099","doi":"10.1287/msom.1120.0417","title":"Bounded Rationality in Service Systems","year":2013,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Advanced Queuing Theory Analysis","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":"Kellogg's (Canada)","funders":"","keywords":"Bounded rationality; Bounded function; Rationality; Economics; Social planner; Revenue; Social Welfare; Queue; Microeconomics; Queueing theory; Mathematical economics; Computer science; Mathematics; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.01429431641129753,"gpt":0.2217028616186853,"spread":0.2074085452073878,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004896722,0.000316652,0.0002881394,0.0005297979,0.0004562532,0.001408392,0.0005528121,0.00006744001,0.001032401],"category_scores_gemma":[0.00001632373,0.0003168782,0.00006295335,0.0009633912,0.00001935982,0.002992284,0.0004323008,0.0002013834,0.003824047],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001795193,"about_ca_system_score_gemma":0.00001238302,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01283209,"about_ca_topic_score_gemma":0.007849495,"domain_scores_codex":[0.9979787,0.00004571924,0.0005874287,0.000561937,0.0003913937,0.0004347826],"domain_scores_gemma":[0.9988444,0.00003589829,0.0001379722,0.000695076,0.0002614634,0.00002517062],"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.00001604493,0.0002263813,0.000575895,0.0009054536,0.0001424723,0.00001676222,0.0001787268,0.8639781,0.0001732177,0.1316656,0.0007120162,0.001409315],"study_design_scores_gemma":[0.002434727,0.00001047888,0.06515718,0.0003944597,0.000361351,0.000005077628,0.006193264,0.7952151,0.0005811652,0.04125212,0.08658696,0.001808085],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9480339,0.00003429754,0.004302323,0.01110583,0.0005085006,0.001757762,0.000003259036,0.000395506,0.03385862],"genre_scores_gemma":[0.9851863,0.000006054773,0.001191643,0.0105315,0.0003980068,0.0006447508,0.0001791025,0.00004486809,0.001817718],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.09041352,"threshold_uncertainty_score":0.9999284,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3123594288","doi":"10.1287/mnsc.2017.2747","title":"Efficient Ignorance: Information Heterogeneity in a Queue","year":2017,"lang":"en","type":"article","venue":"Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":123,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Social Welfare; Population; Queueing theory; Queue; Ignorance; Throughput; Welfare; Microeconomics; Poisson distribution; Computer science; Economics; Computer network; Statistics; Telecommunications; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01265754191159323,"gpt":0.259395675313262,"spread":0.2467381334016688,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001571595,0.0001277439,0.000128623,0.0006527897,0.0009935453,0.001181506,0.001258605,0.00001963241,0.00003642892],"category_scores_gemma":[0.0002228057,0.0001216123,0.00004479027,0.0007632109,0.0003773572,0.003508512,0.0008542166,0.00007502513,0.0005420062],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009151873,"about_ca_system_score_gemma":0.000007656249,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001976998,"about_ca_topic_score_gemma":0.0001097868,"domain_scores_codex":[0.9985831,0.000005382692,0.0002430381,0.0003094898,0.0004894625,0.0003695091],"domain_scores_gemma":[0.9987524,0.000007588826,0.0003213312,0.0008262847,0.00007861688,0.00001379645],"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.0000653332,0.0001599295,0.05989737,0.0002733325,0.00002113405,0.00003887216,0.0001290098,0.1917373,0.0003988123,0.6682324,0.0001940622,0.07885247],"study_design_scores_gemma":[0.001312509,0.000008336711,0.4065867,0.000166086,0.00005907209,9.616987e-7,0.0005968412,0.5335254,0.0003216631,0.01719619,0.03954282,0.0006834498],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8406993,0.000006836392,0.00637731,0.000529075,0.0003355184,0.000213421,6.027333e-7,0.00008928383,0.1517486],"genre_scores_gemma":[0.9984138,0.00000243257,0.0005247731,0.000821306,0.00007256193,0.00002778915,0.000002048543,0.000005140642,0.000130143],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6510362,"threshold_uncertainty_score":0.9998553,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2014774334","doi":"10.1287/mnsc.47.10.1421.10262","title":"Server Assignment Policies for Maximizing the Steady-State Throughput of Finite Queueing Systems","year":2001,"lang":"en","type":"article","venue":"Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":116,"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; Computer science; Throughput; Queueing theory; Queue; Computer network; Service (business); Markov process; Server farm; Distributed computing; Mathematical optimization; Client–server model; Operating system; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02848912473206587,"gpt":0.2617988668528339,"spread":0.233309742120768,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002391791,0.0001961339,0.000234226,0.000412585,0.000743629,0.0004992145,0.001057098,0.00001887291,0.00002510452],"category_scores_gemma":[0.0001282067,0.0001430153,0.0001072602,0.001881841,0.0004005102,0.001634641,0.0006141918,0.00006983848,0.00004393962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008894718,"about_ca_system_score_gemma":0.00001033161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003331568,"about_ca_topic_score_gemma":0.0000348063,"domain_scores_codex":[0.9979416,0.00001936991,0.0004081878,0.000441669,0.0006522844,0.0005369333],"domain_scores_gemma":[0.998628,0.0001350526,0.0004346899,0.0006258995,0.0001615152,0.00001488948],"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.00005086213,0.00007101469,0.002971152,0.0004120768,0.00009422696,0.000009696761,0.0002979234,0.3457812,0.0005586967,0.6436346,0.0003999109,0.005718614],"study_design_scores_gemma":[0.001598872,0.00005521481,0.00722499,0.0006605285,0.0006031828,0.000003978071,0.01404768,0.5869718,0.0006101033,0.08169889,0.3053596,0.00116524],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3627695,0.0003598454,0.4970951,0.004716535,0.001679401,0.003115688,0.000007668186,0.0004437966,0.1298125],"genre_scores_gemma":[0.9954153,0.00003246395,0.0006542521,0.0009185077,0.0001807593,0.00008727817,0.000002819479,0.0000208169,0.002687815],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6326458,"threshold_uncertainty_score":0.5831995,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2013001756","doi":"10.1287/ijoc.1050.0157","title":"A Survey and Experimental Comparison of Service-Level-Approximation Methods for Nonstationary<i>M(t)/M/s(t)</i>Queueing Systems with Exhaustive Discipline","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":115,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Approximation algorithm; Computation; Approximation error; Computer science; Ordinary differential equation; Mathematical optimization; Solver; Set (abstract data type); Closure (psychology); Applied mathematics; Mathematics; Differential equation; Algorithm; Statistics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.05855104518789757,"gpt":0.3763409439001331,"spread":0.3177898987122356,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004014133,0.0001999309,0.0004118198,0.0004062087,0.0004469664,0.0002266433,0.0001615867,0.00005036488,0.000003850105],"category_scores_gemma":[0.0001982265,0.0001498353,0.00005788638,0.0005700402,0.0000510904,0.001128446,0.00010178,0.0002076458,0.000001719686],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007482003,"about_ca_system_score_gemma":0.00001822284,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00007174438,"about_ca_topic_score_gemma":0.00004779696,"domain_scores_codex":[0.9984639,0.00002800283,0.0008040277,0.0001726084,0.0002612513,0.0002702682],"domain_scores_gemma":[0.9971085,0.0007633237,0.001346294,0.0001127168,0.0006398239,0.00002932509],"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.003203476,0.000395712,0.0754667,0.0008946997,0.0005091723,0.000009743857,0.004011576,0.7835652,0.002381523,0.02075147,0.00008754689,0.1087232],"study_design_scores_gemma":[0.001565189,0.0001385769,0.01284132,0.0005234529,0.00007173205,0.00002691297,0.007163289,0.9747036,0.001529061,0.0008297129,0.0002803093,0.0003268858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4147168,0.00008612512,0.5845451,0.00004782023,0.0001327946,0.0002116587,0.00000211721,0.0000243317,0.0002332992],"genre_scores_gemma":[0.9357587,5.528081e-7,0.06357275,0.0002718768,0.0003268674,0.000003127784,0.00003558267,0.00002269079,0.00000787016],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5210419,"threshold_uncertainty_score":0.6110108,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2116936991","doi":"10.1287/mnsc.1100.1203","title":"Capacity Sizing Under Parameter Uncertainty: Safety Staffing Principles Revisited","year":2010,"lang":"en","type":"article","venue":"Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":113,"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":"Staffing; Computer science; Queue; Rule of thumb; Service (business); Operations research; Newsvendor model; Variance (accounting); Sizing; Mathematical optimization; Queueing theory; Econometrics; Mathematics; Economics; Algorithm; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.02694334533273859,"gpt":0.2511434062134888,"spread":0.2242000608807502,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002674328,0.0002568952,0.0002451686,0.0006786945,0.001017421,0.0007791191,0.001109547,0.00004577622,0.000357819],"category_scores_gemma":[0.0005543971,0.0002324888,0.0001043943,0.002587216,0.0006248566,0.002433798,0.0009462166,0.0003017344,0.0003050453],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009968827,"about_ca_system_score_gemma":0.0000130781,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008887943,"about_ca_topic_score_gemma":0.0001207391,"domain_scores_codex":[0.9974019,0.00001630586,0.0003918385,0.0008023061,0.0007244864,0.0006631545],"domain_scores_gemma":[0.9985108,0.0001081612,0.0003068381,0.0008719476,0.0001655665,0.00003666902],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00002523907,0.00005741162,0.003131323,0.0001054139,0.00003895806,0.00001175128,0.00003719538,0.02643151,0.005177835,0.9521096,0.0000679766,0.01280578],"study_design_scores_gemma":[0.001325955,0.00001948164,0.0494931,0.0003032697,0.0005115356,0.000005511685,0.001527226,0.3540159,0.001076467,0.2062593,0.3833941,0.002068165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8475681,0.00001376316,0.03484615,0.001402092,0.0006820413,0.0005202913,0.000002260312,0.0005128249,0.1144525],"genre_scores_gemma":[0.9885964,0.000006120706,0.008038262,0.002256364,0.0002824621,0.00001695771,0.000007624782,0.00002350784,0.0007722797],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7458503,"threshold_uncertainty_score":0.9480617,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2596292818","doi":"10.1287/opre.2016.1578","title":"The Impact of Inspection Cost on Equilibrium, Revenue, and Social Welfare in a Single-Server Queue","year":2017,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":109,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Tel Aviv University; Government of Ontario","keywords":"Unobservable; Computer science; Queue; Revenue; Join (topology); Valuation (finance); Operations research; Mathematical optimization; Microeconomics; Econometrics; Economics; Mathematics; Computer network; Finance","retraction":null,"screen_n_in":null,"score":{"opus":0.09270631862722876,"gpt":0.4028587003774279,"spread":0.3101523817501992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001162732,0.00006325643,0.00009802692,0.0002109575,0.001908227,0.0006729977,0.0002477043,0.00003822505,0.00004279557],"category_scores_gemma":[0.0009198161,0.00004601176,0.00004394376,0.0002697938,0.0002473769,0.0008214483,0.0001890611,0.0002089802,0.0000224234],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009561448,"about_ca_system_score_gemma":0.00002298388,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004266962,"about_ca_topic_score_gemma":0.01036607,"domain_scores_codex":[0.9992449,0.0000671366,0.0001376911,0.0001499011,0.0002139799,0.0001863873],"domain_scores_gemma":[0.9992982,0.00006546165,0.00004996743,0.000321391,0.0002589109,0.000006055412],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","study_design_scores_codex":[0.001138667,0.0008901121,0.05558473,0.0001744438,0.0002155775,0.00003075276,0.001196477,0.05265559,0.03327509,0.8012255,0.006337123,0.04727597],"study_design_scores_gemma":[0.003235828,0.0002814156,0.7191736,0.0002828556,0.00005802566,0.000003499342,0.00337055,0.2123876,0.001459464,0.02806126,0.03096038,0.000725596],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9893482,0.00001495634,0.00001345419,0.005216881,0.00002736151,0.0002163039,0.000006751505,0.00001000945,0.005146137],"genre_scores_gemma":[0.9988613,0.000005339891,0.00001080369,0.00001467311,0.0002117971,0.00002945252,0.000009247189,0.00001047288,0.0008468826],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.7731642,"threshold_uncertainty_score":0.9993911,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3101156441","doi":"","title":"1 Optimal Control Strategies in Delayed Sharing Information Structures","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":109,"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":"Information structure; Computer science; Optimal control; Information sharing; Control (management); Decomposition; Mathematical optimization; Decentralised system; Control theory (sociology); Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.006424677251106922,"gpt":0.2144785643102562,"spread":0.2080538870591492,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0001382245,0.0001039184,0.0001248595,0.0002604534,0.00006374265,0.0006013606,0.0001709429,0.00003788926,0.001469387],"category_scores_gemma":[0.00005580622,0.00008684529,0.00003609188,0.0002690436,0.00002129012,0.008900823,0.00006367038,0.0000847589,0.0004671708],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001820795,"about_ca_system_score_gemma":0.000005539921,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0013713,"about_ca_topic_score_gemma":0.0001417523,"domain_scores_codex":[0.999368,0.000003744309,0.0002396343,0.0001037124,0.0001039115,0.0001809812],"domain_scores_gemma":[0.9996319,0.00002180887,0.0001137003,0.0001369576,0.00009002806,0.000005600801],"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.0000408981,0.00001025134,0.004349048,0.00003478767,0.00003556992,0.000001325927,0.00007467636,0.4150433,0.000312239,0.5758422,0.0003599258,0.003895782],"study_design_scores_gemma":[0.001034757,0.000005947563,0.01691766,0.00001306279,0.0000394791,7.500385e-7,0.003376481,0.7296126,0.0000433512,0.2466467,0.001994954,0.0003142155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9071103,0.000008776808,0.05506646,0.0002692739,0.00006005003,0.0002123614,5.099438e-7,0.0001638997,0.03710833],"genre_scores_gemma":[0.9976028,5.392606e-7,0.001092475,0.00107291,0.0001132777,0.0000225323,0.00001769801,0.000006514097,0.0000712297],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3291955,"threshold_uncertainty_score":0.9994434,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092472841","doi":"10.1287/opre.48.1.26.12456","title":"Stability of Multiclass Queueing Networks Under Priority Service Disciplines","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Queueing theory; Stability (learning theory); Layered queueing network; Computer science; Mathematical optimization; Set (abstract data type); Lyapunov function; Service (business); Lyapunov optimization; Queueing system; Mathematics; Computer network; Nonlinear system; Artificial intelligence; Lyapunov equation","retraction":null,"screen_n_in":null,"score":{"opus":0.0708570981113848,"gpt":0.3653104677572205,"spread":0.2944533696458357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001721248,0.0001036226,0.0001720447,0.0001707522,0.0006547493,0.0002349993,0.000320912,0.00006007574,0.002524551],"category_scores_gemma":[0.0002595595,0.00009232306,0.00005360382,0.001796893,0.0001555773,0.001146757,0.0001975169,0.000292449,0.0002093127],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005642993,"about_ca_system_score_gemma":0.00004265688,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002388021,"about_ca_topic_score_gemma":0.00840863,"domain_scores_codex":[0.998582,0.0001148243,0.0002968417,0.0002953038,0.0003907946,0.0003202248],"domain_scores_gemma":[0.998395,0.0001863434,0.00002573902,0.0004877733,0.0008877862,0.00001741304],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007596519,0.0002394455,0.003955642,0.00009525142,0.00003825765,0.000001763082,0.0001640741,0.9508962,0.002737243,0.03538143,0.00007789542,0.00633684],"study_design_scores_gemma":[0.0002367956,0.000005433078,0.00407707,0.00003260425,0.00002093652,2.42768e-7,0.0005800292,0.9894338,0.0003430066,0.003159887,0.001975763,0.000134444],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9848294,0.00004697542,0.005257444,0.002121558,0.00003806205,0.0002890046,0.000002631914,0.00005782201,0.007357163],"genre_scores_gemma":[0.9978157,0.0000151171,0.0006662105,0.0001764039,0.0003671249,0.00003137557,0.00002924381,0.00001728104,0.0008815373],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0385376,"threshold_uncertainty_score":0.9983873,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2120167960","doi":"10.1287/mnsc.1100.1173","title":"Staffing Call Centers with Uncertain Demand Forecasts: A Chance-Constrained Optimization Approach","year":2010,"lang":"en","type":"article","venue":"Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":105,"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":"Staffing; Mathematical optimization; Computer science; Constraint (computer-aided design); Quality of service; Operations research; Mathematics; Economics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.00994156283407165,"gpt":0.2150581391549208,"spread":0.2051165763208491,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001173362,0.0002236439,0.0001799671,0.0006313852,0.0006092257,0.000546506,0.000730905,0.00003125369,0.00009096182],"category_scores_gemma":[0.00007625511,0.0001852954,0.00004697628,0.002247788,0.0006015346,0.002241858,0.0003241979,0.0001610094,0.00002117002],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005531897,"about_ca_system_score_gemma":0.00001586976,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004751643,"about_ca_topic_score_gemma":0.00005298432,"domain_scores_codex":[0.9979817,0.000008364084,0.000225164,0.0006770144,0.0005678685,0.0005398497],"domain_scores_gemma":[0.9991042,0.00001820106,0.0002400227,0.000471476,0.0001342641,0.00003183955],"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.0000747521,0.000133027,0.002044844,0.0001610789,0.00004977437,0.00002481604,0.00009773304,0.8251424,0.0007533539,0.1623726,0.00009736905,0.00904832],"study_design_scores_gemma":[0.00062765,0.00001221556,0.0003423753,0.00004861924,0.000096407,0.000003479137,0.0006762384,0.9945953,0.00006825557,0.001293318,0.001874626,0.0003614702],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08461338,0.000005575462,0.8078511,0.0004010819,0.0002520737,0.0005866969,0.000001159439,0.0002630436,0.1060259],"genre_scores_gemma":[0.9111152,0.00000310769,0.08743303,0.0006889165,0.0001684583,0.00005173477,0.00001678082,0.00002271948,0.0005000437],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8265018,"threshold_uncertainty_score":0.7556126,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128586119","doi":"10.1287/opre.51.6.952.24913","title":"Dynamic Server Allocation for Queueing Networks with Flexible Servers","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":104,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Server; Layered queueing network; Computer science; Queueing theory; Upper and lower bounds; Independent and identically distributed random variables; Mathematical optimization; Computer network; Routing (electronic design automation); Probabilistic logic; Flexibility (engineering); Distributed computing; Linear programming; Random variable; Mathematics; Algorithm","retraction":null,"screen_n_in":null,"score":{"opus":0.04070181517824167,"gpt":0.3374842795450705,"spread":0.2967824643668289,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001597394,0.0001072321,0.0001149819,0.0003356029,0.0009714824,0.0004871654,0.0001923324,0.00005230471,0.0002356119],"category_scores_gemma":[0.0003524223,0.00009450073,0.00004339028,0.001363184,0.0000755943,0.001371238,0.00004674907,0.0001905271,0.0001073729],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009810239,"about_ca_system_score_gemma":0.00006230953,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002459791,"about_ca_topic_score_gemma":0.002419926,"domain_scores_codex":[0.998822,0.000061328,0.0001625214,0.0002972484,0.0002877963,0.0003691169],"domain_scores_gemma":[0.9987282,0.0000997496,0.00002594613,0.0003355072,0.0007950186,0.00001559602],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003275996,0.00003702491,0.0004731162,0.00003206067,0.00003042082,0.000001023365,0.00002194507,0.7668434,0.000236711,0.2316156,0.0002323168,0.0004436213],"study_design_scores_gemma":[0.0004734872,0.00002125733,0.000216051,0.00004246843,0.00003349862,0.000001054054,0.0005805054,0.9758278,0.0001641292,0.003881167,0.01856848,0.0001900988],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.373702,0.0001525714,0.6042124,0.00222133,0.0001498353,0.001525089,0.000002481032,0.0002404456,0.01779383],"genre_scores_gemma":[0.9863369,0.000009475296,0.006048905,0.0002468211,0.0001199122,0.0002423756,0.00009454584,0.00003661144,0.006864467],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6126349,"threshold_uncertainty_score":0.7471955,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2277393385","doi":"10.1287/mnsc.2015.2236","title":"Optimal Price/Lead-Time Menus for Queues with Customer Choice: Segmentation, Pooling, and Strategic Delay","year":2016,"lang":"en","type":"article","venue":"Management Science","topic":"Advanced Queuing Theory Analysis","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":"Wilfrid Laurier University; University of Toronto","funders":"","keywords":"Pooling; Market segmentation; Computer science; Queue; Lead time; Valuation (finance); Queueing theory; Revenue; Price discrimination; Operations research; Business; Microeconomics; Marketing; Economics; Computer network","retraction":null,"screen_n_in":null,"score":{"opus":0.01260260773305742,"gpt":0.2531806199058625,"spread":0.2405780121728051,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009451104,0.0002054234,0.0001684144,0.0004542364,0.0005391422,0.0004108097,0.0004393939,0.00002289198,0.0001369993],"category_scores_gemma":[0.00004953162,0.0001352704,0.00003658744,0.000959368,0.0004513989,0.002267376,0.0002364395,0.00003866017,0.0001958104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007269729,"about_ca_system_score_gemma":0.00001409473,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002189514,"about_ca_topic_score_gemma":0.00001120346,"domain_scores_codex":[0.9982656,0.000008636793,0.0002162996,0.0006177955,0.000427318,0.0004643757],"domain_scores_gemma":[0.9992037,0.00006601847,0.0002332486,0.0003019148,0.0001671256,0.00002801209],"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.000567566,0.0004056134,0.01199148,0.0008027993,0.0005483034,0.00006975647,0.0002973226,0.02278245,0.033321,0.8775816,0.002396825,0.04923528],"study_design_scores_gemma":[0.02349757,0.0007907755,0.02166501,0.001978642,0.004821771,0.00004381211,0.01091434,0.4942063,0.01151661,0.2035019,0.2179637,0.009099497],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8446593,0.00006831648,0.09113125,0.001693047,0.0001829668,0.001376466,0.000005785839,0.0004014038,0.06048147],"genre_scores_gemma":[0.9841557,0.00001412472,0.01029552,0.0006101673,0.0001931367,0.0001005589,0.000005491283,0.00002632429,0.004598964],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6740797,"threshold_uncertainty_score":0.5516168,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2117667427","doi":"10.1016/j.cor.2005.06.019","title":"Markov chain models of a telephone call center with call blending","year":2005,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":98,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Markov chain; Benchmark (surveying); Call management; Center (category theory); Markov model; Telecommunications; Call control; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.03933045939321227,"gpt":0.3084871387843281,"spread":0.2691566793911158,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009719157,0.0001456269,0.0002226527,0.0007237641,0.0004191268,0.000253834,0.0004324358,0.00004526438,0.0001047342],"category_scores_gemma":[0.0000614744,0.0001249743,0.00006213007,0.001132036,0.0001736521,0.001327046,0.0003331672,0.0002851701,0.0001009993],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009816125,"about_ca_system_score_gemma":0.00004559182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003506863,"about_ca_topic_score_gemma":0.0007756348,"domain_scores_codex":[0.9983569,0.00007274946,0.0002892111,0.0003486223,0.0005106269,0.0004219362],"domain_scores_gemma":[0.998812,0.0001052393,0.00004370649,0.0004186247,0.0005929248,0.00002750959],"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.00009935557,0.0002370594,0.0003292693,0.00006760364,0.00008924615,0.00001399819,0.0002966222,0.9475353,0.001166004,0.03028008,0.00325409,0.01663136],"study_design_scores_gemma":[0.0005858623,0.00002056099,0.00008003996,0.00009971634,0.00001699946,0.000002948387,0.0001157329,0.9916325,0.0002768061,0.000480252,0.006521364,0.0001671975],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.368978,0.0001237196,0.6149744,0.0044062,0.00009611167,0.0006998021,0.000008732874,0.0001522602,0.01056079],"genre_scores_gemma":[0.9764307,0.00001344571,0.0211973,0.0003642683,0.0005341961,0.00003656298,0.00004216838,0.00003105899,0.001350262],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6074528,"threshold_uncertainty_score":0.5096304,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2040530174","doi":"10.1016/j.ejor.2009.04.026","title":"Combining integer programming and the randomization method to schedule employees","year":2009,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":96,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; Universiteit van Amsterdam","keywords":"Schedule; Computer science; Staffing; Mathematical optimization; Integer programming; Integer (computer science); Generator (circuit theory); Iterated function; Tardiness; Interval (graph theory); Operations research; Algorithm; Job shop scheduling; Mathematics; Power (physics)","retraction":null,"screen_n_in":null,"score":{"opus":0.05009622218239913,"gpt":0.3665433050220586,"spread":0.3164470828396595,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01815166,0.00008186573,0.0001825936,0.0004018788,0.0004671899,0.0006978964,0.0002940939,0.000009952258,0.00006074362],"category_scores_gemma":[0.003144697,0.00005078293,0.00006659513,0.0006098079,0.00009630789,0.0008241732,0.0001168176,0.0003526938,0.00005243016],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002264495,"about_ca_system_score_gemma":0.00002884074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003565346,"about_ca_topic_score_gemma":0.000001201496,"domain_scores_codex":[0.9979337,0.0007924036,0.0003843566,0.0001274268,0.0005849649,0.00017709],"domain_scores_gemma":[0.9980742,0.0005025691,0.0001449728,0.0001052064,0.001147178,0.00002587782],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.005316927,0.0001964621,0.0005306857,0.00002601614,0.0001697556,0.0001076191,0.001237038,0.06192971,0.004016997,0.758881,0.002762065,0.1648257],"study_design_scores_gemma":[0.07489537,0.001800309,0.01600564,0.001814886,0.0006469761,0.0003860312,0.0100841,0.2067206,0.002368911,0.172673,0.510781,0.001823136],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1833431,0.0003886748,0.7562532,0.03983881,0.0001433534,0.0006482201,4.49407e-7,0.00003697565,0.01934719],"genre_scores_gemma":[0.9721367,0.000007116917,0.02547194,0.001289832,0.0008011344,0.000002229332,0.000002260894,0.00001482013,0.0002739701],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7887936,"threshold_uncertainty_score":0.6729831,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1587039046","doi":"10.1023/a:1010947911863","title":"Discrete Time Geo/G/1 Queue with Multiple Adaptive Vacations","year":2001,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":91,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Mathematics; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.01074630155693247,"gpt":0.2103868682623396,"spread":0.1996405667054071,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004226395,0.0002629131,0.0003441094,0.0002841669,0.0003939335,0.0002983753,0.0002986928,0.00007327776,0.0001296481],"category_scores_gemma":[0.0001375831,0.0002174192,0.0000912558,0.0008575774,0.0000751382,0.001398545,0.00008677187,0.0001603248,0.001403746],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008217603,"about_ca_system_score_gemma":0.00002021037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002505404,"about_ca_topic_score_gemma":0.0003106893,"domain_scores_codex":[0.9985017,0.00004466887,0.0003425791,0.0004269317,0.0002924945,0.0003916687],"domain_scores_gemma":[0.9987606,0.0001432818,0.0003563658,0.0004916342,0.0002232793,0.00002483754],"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.0008873951,0.0003599239,0.101788,0.0005201423,0.001205844,0.0003832717,0.0007622679,0.440336,0.004894066,0.4395098,0.005873119,0.003480161],"study_design_scores_gemma":[0.001469044,0.00005415412,0.003258229,0.0008080522,0.0004626533,0.000054025,0.002113206,0.8297257,0.00005940844,0.004351153,0.1563095,0.001334861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6024695,0.0007765549,0.2245319,0.001499013,0.0009694276,0.002073683,0.00002306994,0.002573604,0.1650832],"genre_scores_gemma":[0.990435,0.000003387434,0.0003586198,0.0002167772,0.001067209,0.00009064576,0.00004726926,0.00006492447,0.007716142],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4351586,"threshold_uncertainty_score":0.9993738,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2081597576","doi":"","title":"Dynamic Scheduling with Convex Delay Costs: The Generalized CU Rule","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":91,"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":"Holding cost; Scheduling (production processes); Regular polygon; Mathematical optimization; Mathematics; Convex function; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01113970782890719,"gpt":0.2180717737712053,"spread":0.2069320659422981,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002723394,0.0001791969,0.0001926852,0.0001159679,0.0003449051,0.0002268559,0.000309018,0.00003920772,0.00290539],"category_scores_gemma":[0.00006913124,0.0001057043,0.00007664243,0.0005849156,0.0001057379,0.0007266544,0.00009630798,0.0001424375,0.0009906568],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004786583,"about_ca_system_score_gemma":0.000003309416,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001902873,"about_ca_topic_score_gemma":0.000297972,"domain_scores_codex":[0.9990421,0.0000177406,0.0001941343,0.0002620819,0.000206167,0.0002777939],"domain_scores_gemma":[0.99927,0.00006556147,0.0001520095,0.0003866634,0.0001152097,0.00001060888],"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.0002803228,0.0003516559,0.01186286,0.0001415696,0.0009128218,0.0001372453,0.0001984383,0.1239524,0.00284039,0.8227996,0.005265391,0.03125727],"study_design_scores_gemma":[0.0008378887,0.000006366457,0.0001170892,0.0000333299,0.000213689,0.000004977844,0.0005803381,0.9653099,0.00005387418,0.008371195,0.02411196,0.0003593758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8431953,0.0004215617,0.06349666,0.004705531,0.0001653986,0.0003231339,0.000001218427,0.0005486759,0.0871425],"genre_scores_gemma":[0.984999,0.00002096273,0.004794487,0.005083024,0.0002045855,0.00002133285,0.00001148131,0.00003715066,0.004827977],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8413575,"threshold_uncertainty_score":0.9997872,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2155819330","doi":"10.1287/opre.1110.0974","title":"Wait-Time Predictors for Customer Service Systems with Time-Varying Demand and Capacity","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":89,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University","funders":"Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Exploit; Abandonment (legal); Computer science; Server; Queueing theory; Service (business); Computer network; Real-time computing; Queueing system; Computer security; Business","retraction":null,"screen_n_in":null,"score":{"opus":0.06578392342394168,"gpt":0.2905506331851307,"spread":0.2247667097611891,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001279932,0.0001175103,0.0001673747,0.0003469882,0.0008748186,0.0003673445,0.0001934309,0.00005398724,0.00033586],"category_scores_gemma":[0.0001766729,0.00009323594,0.0000230468,0.0007999335,0.0001157424,0.00109822,0.000119097,0.0001571065,0.0006072901],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003349081,"about_ca_system_score_gemma":0.00003556717,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001158386,"about_ca_topic_score_gemma":0.0002865059,"domain_scores_codex":[0.998872,0.00005890633,0.0001693915,0.0002951547,0.0002881736,0.0003163241],"domain_scores_gemma":[0.9987928,0.000109352,0.00002997497,0.0002673326,0.0007741717,0.00002637314],"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.002907143,0.001773342,0.03640205,0.005357612,0.002741613,0.00007900319,0.01032913,0.3756483,0.1017615,0.4373647,0.02194015,0.003695562],"study_design_scores_gemma":[0.0008142245,0.00004309199,0.0005775418,0.0001471298,0.0001433426,0.000006270027,0.0005392513,0.9852962,0.0005768698,0.0007949829,0.01070769,0.0003533261],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9617306,0.00006983757,0.005499231,0.0003919054,0.00004835544,0.001183501,0.00001698598,0.0001359372,0.03092366],"genre_scores_gemma":[0.9933043,0.000003567539,0.001663908,0.0001089248,0.0002857986,0.0001859708,0.0000436954,0.00003362614,0.004370219],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.609648,"threshold_uncertainty_score":0.7805688,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2165180682","doi":"10.1287/msom.1120.0405","title":"Forecasting Call Center Arrivals: Fixed-Effects, Mixed-Effects, and Bivariate Models","year":2012,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":86,"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; Canada Research Chairs","keywords":"Bivariate analysis; Exploit; Computer science; Benchmark (surveying); Joint probability distribution; Econometrics; Statistics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01926511805754496,"gpt":0.2221371349376519,"spread":0.202872016880107,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006671011,0.0004826188,0.0003874044,0.0004848307,0.0008131453,0.0006582804,0.0004125885,0.00008701599,0.00007071563],"category_scores_gemma":[0.00004051399,0.0004601196,0.0001129111,0.0004241065,0.00003666148,0.003568229,0.000924074,0.0002282948,0.0002471762],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001023519,"about_ca_system_score_gemma":0.000003815262,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004153796,"about_ca_topic_score_gemma":0.0002445652,"domain_scores_codex":[0.9977406,0.00006669698,0.0004575349,0.0005920239,0.000344743,0.0007983739],"domain_scores_gemma":[0.9989141,0.0001174192,0.0001699149,0.0006398624,0.000089876,0.00006881285],"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.0001196087,0.001100471,0.003656889,0.00981108,0.001559335,0.0001169295,0.001368464,0.6605696,0.0004408083,0.2506706,0.00182713,0.06875907],"study_design_scores_gemma":[0.003160559,0.00003256301,0.01169563,0.0009221198,0.001867909,0.00002157502,0.001083697,0.9045922,0.003346371,0.02048517,0.05049125,0.002301022],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8277125,0.0004837471,0.1405668,0.001805922,0.001518857,0.002238655,0.0000091354,0.0007984391,0.02486596],"genre_scores_gemma":[0.9854091,0.00003684442,0.008093687,0.004562901,0.0007385255,0.0002441101,0.0001030439,0.00009021487,0.0007215131],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2440225,"threshold_uncertainty_score":0.9997851,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2127943707","doi":"10.1287/opre.1080.0608","title":"Near-Optimal Dynamic Lead-Time Quotation and Scheduling Under Convex-Concave Customer Delay Costs","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":85,"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":"Mathematical optimization; Regular polygon; Computer science; Dynamic pricing; Order (exchange); Scheduling (production processes); Asymptotically optimal algorithm; Lead time; Convex function; Concave function; Nonlinear pricing; Dynamic programming; Nonlinear system; Mathematics; Economics; Microeconomics; Operations management","retraction":null,"screen_n_in":null,"score":{"opus":0.02763905645098608,"gpt":0.3411861512873318,"spread":0.3135470948363457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001222428,0.000140805,0.0001768141,0.0004396521,0.001145909,0.0009944375,0.0001823614,0.00008085543,0.0003766373],"category_scores_gemma":[0.0003696244,0.0001377146,0.00004364421,0.001034311,0.0002174182,0.00159514,0.00009782566,0.0003569457,0.001780918],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001399217,"about_ca_system_score_gemma":0.00006095531,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001656396,"about_ca_topic_score_gemma":0.0001791198,"domain_scores_codex":[0.9985141,0.00008979602,0.0002372695,0.0003642786,0.000411418,0.0003831232],"domain_scores_gemma":[0.9989161,0.0001311621,0.00003403327,0.0002662497,0.0006254721,0.00002694901],"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.0001155359,0.0001698724,0.0002638908,0.00003168209,0.00009474254,0.00002691338,0.0003031484,0.8049535,0.04390096,0.1257588,0.0004096438,0.0239713],"study_design_scores_gemma":[0.0003747563,0.0000197001,0.0007054131,0.00002815106,0.00003298232,0.000003716847,0.0005778585,0.994971,0.0001212841,0.001836675,0.001138667,0.0001897826],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.970373,0.0001332824,0.01623322,0.003666741,0.00003879911,0.0003532778,0.000002486467,0.0001041815,0.009095004],"genre_scores_gemma":[0.9915346,0.00001857235,0.004455584,0.0006495859,0.0001578364,0.00002319777,0.00008699163,0.00002267451,0.003050947],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1900175,"threshold_uncertainty_score":0.9989963,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2009333025","doi":"10.1016/s0377-2217(01)00169-2","title":"Accounting for time-varying queueing effects in workforce scheduling","year":2002,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":83,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Staffing; Computer science; Queueing theory; Schedule; Scheduling (production processes); Mathematical optimization; Operations research; Set (abstract data type); Queue; Real-time computing; Computer network; Mathematics; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.06397752846340668,"gpt":0.3307420775878542,"spread":0.2667645491244476,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008817426,0.0001282802,0.0002258969,0.0009324707,0.0004492781,0.00056631,0.000447255,0.00002311155,0.0002708212],"category_scores_gemma":[0.004971311,0.0001176695,0.000119751,0.0009135841,0.00006252254,0.002027222,0.0001535557,0.0005487288,0.0003910724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009160792,"about_ca_system_score_gemma":0.00002509623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004059859,"about_ca_topic_score_gemma":0.000001534957,"domain_scores_codex":[0.9978817,0.0002577199,0.0005720345,0.0002055387,0.0006836278,0.0003994127],"domain_scores_gemma":[0.9977331,0.0009202962,0.0002491517,0.0001376433,0.0009346655,0.00002513914],"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.0006659098,0.0004580964,0.008572157,0.0005296091,0.0002090593,0.001012233,0.0007551558,0.7418708,0.04812443,0.08640703,0.00461184,0.1067837],"study_design_scores_gemma":[0.002993534,0.0001077557,0.001886892,0.001535709,0.00005018192,0.00003691282,0.000268154,0.9550598,0.0005019489,0.007106965,0.02998264,0.000469476],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8933915,0.001218106,0.04429184,0.003290643,0.0003405182,0.0005828008,9.607231e-7,0.00004947131,0.05683416],"genre_scores_gemma":[0.9875131,0.00001423691,0.008762611,0.0004467208,0.002331303,0.000004801501,0.00000373716,0.00005051177,0.0008730286],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.213189,"threshold_uncertainty_score":0.5951483,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992210270","doi":"10.1080/15326340008807592","title":"Inventory management at service facilities for systems with arbitrarily distributed service times","year":2000,"lang":"en","type":"article","venue":"Communications in Statistics Stochastic Models","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":82,"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":"Service (business); Queue; Poisson distribution; Computer science; Markov chain; Mathematical optimization; Operations research; Service level; Inventory control; Inventory management; Service system; Value (mathematics); Operations management; Mathematics; Business; Statistics; Computer network; Engineering","retraction":null,"screen_n_in":null,"score":{"opus":0.04768231776310498,"gpt":0.2696012881258129,"spread":0.2219189703627079,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003373296,0.0002616037,0.0003293878,0.0002263824,0.0004832018,0.0001588853,0.001009199,0.00005951221,0.0001523861],"category_scores_gemma":[0.00003892728,0.0002655243,0.00003507408,0.0007692601,0.0001326053,0.0005771696,0.0003779198,0.0001627465,0.0001326981],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000190361,"about_ca_system_score_gemma":0.00002500089,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008584073,"about_ca_topic_score_gemma":0.002140274,"domain_scores_codex":[0.998529,0.0000420882,0.0004943823,0.0003393315,0.0002442833,0.0003508692],"domain_scores_gemma":[0.9974391,0.0003825381,0.0002194826,0.001524573,0.0004098645,0.0000244445],"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.0001070836,0.00007537026,0.00000979649,0.0003499325,0.00006847979,0.000001389297,0.0001774106,0.601077,8.499734e-7,0.3970717,0.0004897817,0.0005712581],"study_design_scores_gemma":[0.0006533199,0.000007165999,0.00001490558,0.0001631702,0.0001816589,0.000001590073,0.000749138,0.8431942,1.410069e-7,0.146721,0.008043199,0.0002704526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002012639,0.0002679787,0.9842216,0.000546096,0.00004742771,0.000975506,0.000958296,0.0001496707,0.01082081],"genre_scores_gemma":[0.9175008,0.00006796836,0.06936991,0.001450423,0.0001012302,0.001646405,0.005038447,0.0001013899,0.004723456],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9154881,"threshold_uncertainty_score":0.9999797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2027355210","doi":"10.1239/aap/1103662965","title":"The stationary tail asymptotics in the GI/G/1-type queue with countably many background states","year":2004,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":79,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Markov chain; Type (biology); Countable set; State space; Discrete time and continuous time; Queue; Infinity; Markov process; State (computer science); Applied mathematics; Discrete mathematics; Mathematical analysis; Statistics; Algorithm; Computer science","retraction":null,"screen_n_in":null,"score":{"opus":0.01185528532339365,"gpt":0.2444023026174896,"spread":0.232547017294096,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001773797,0.0002595718,0.0002529697,0.00009398044,0.0003600817,0.0002089124,0.0006063315,0.0000541412,0.00002504179],"category_scores_gemma":[0.000126779,0.0001545981,0.00003782469,0.001396362,0.0004895291,0.001122032,0.0001115014,0.0003575053,0.00005567668],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002350735,"about_ca_system_score_gemma":0.00006096872,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001814592,"about_ca_topic_score_gemma":0.006011673,"domain_scores_codex":[0.9981377,0.00005199353,0.0004687058,0.0004782031,0.000424624,0.0004387849],"domain_scores_gemma":[0.9983914,0.0005690319,0.000269318,0.0006266269,0.0001332369,0.0000103626],"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.0004684665,0.0001932488,0.008546988,0.0001125458,0.00001562531,0.000007882688,0.0002357712,0.3373742,0.00001567454,0.6480647,0.00001614946,0.004948705],"study_design_scores_gemma":[0.0008056418,0.00002290936,0.004809477,0.00003954678,0.00003077419,0.000001539789,0.002966371,0.001482119,0.00002047376,0.9533777,0.03616677,0.0002767146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9544421,0.001291517,0.01220201,0.002723427,0.0002407518,0.002143738,0.000008051971,0.0001846919,0.02676375],"genre_scores_gemma":[0.995015,0.0002015522,0.003190011,0.001185293,0.0001251836,0.0001809712,0.00004638562,0.00002621163,0.00002940891],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3358921,"threshold_uncertainty_score":0.6304328,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W4237799823","doi":"10.21236/ada512354","title":"People Capability Maturity Model (P-CMM) Version 2.0, Second Edition","year":2009,"lang":"en","type":"report","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":78,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Pfizer (Canada)","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Australian Government; Society for Sedimentary Geology; Carnegie Mellon University; U.S. Department of Defense","keywords":"Maturity (psychological); Capability Maturity Model; Computer science; Programming language; Psychology; Developmental psychology","retraction":null,"screen_n_in":null,"score":{"opus":0.01663157399608042,"gpt":0.2497218202334658,"spread":0.2330902462373854,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001456758,0.0004814478,0.0007385752,0.0004491455,0.0002639781,0.0002270633,0.0003952858,0.0004833285,0.006791929],"category_scores_gemma":[0.0006044034,0.000458081,0.0004424635,0.0005506458,0.00005785122,0.001641597,0.0002569906,0.0006062458,0.0006874288],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004348115,"about_ca_system_score_gemma":0.0001749611,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007272162,"about_ca_topic_score_gemma":0.002080091,"domain_scores_codex":[0.9971938,0.00002131538,0.0005865102,0.0008225527,0.0009618643,0.0004139975],"domain_scores_gemma":[0.9974257,0.00007179568,0.0007008477,0.0008668316,0.0009107583,0.00002402814],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001400383,0.0003967029,0.0006011652,0.002300339,0.0001927184,0.00002003931,0.00003858927,0.0149361,0.000179608,0.007674682,0.9689416,0.004578428],"study_design_scores_gemma":[0.0005459903,0.00001450338,0.001800152,0.0002515801,0.001105532,0.000009392706,0.0001633174,0.1586196,0.00009889257,0.255766,0.5799592,0.001665854],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.03669558,0.0001694795,0.01110652,0.000647983,0.001714729,0.0005915985,0.00008602188,0.000907563,0.9480805],"genre_scores_gemma":[0.8991604,0.0001753354,0.00197538,0.00246899,0.01022919,0.00004701337,0.003972713,0.0001645015,0.08180644],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.8662741,"threshold_uncertainty_score":0.9997871,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2047498382","doi":"10.1016/j.apm.2008.08.006","title":"An M/G/1 queue with two phases of service subject to the server breakdown and delayed repair","year":2008,"lang":"en","type":"article","venue":"Applied Mathematical Modelling","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":76,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Queue; Generalization; Joint probability distribution; Mathematics; Reliability (semiconductor); Computer science; State (computer science); Burke's theorem; Laplace transform; Applied mathematics; Algorithm; Statistics; Fork–join queue; Queue management system; Mathematical analysis; Computer network; Physics","retraction":null,"screen_n_in":null,"score":{"opus":0.02260487370844676,"gpt":0.2387461632211172,"spread":0.2161412895126704,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004365898,0.0002079594,0.0003346862,0.0001024059,0.0002464366,0.00004714024,0.0002529126,0.00003956876,0.00005792493],"category_scores_gemma":[0.00002565298,0.0001359031,0.00005428854,0.0005799612,0.00008671028,0.0003805921,0.00009765565,0.0001160619,0.00005086527],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001086253,"about_ca_system_score_gemma":0.00001116187,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002090943,"about_ca_topic_score_gemma":0.0001000797,"domain_scores_codex":[0.9988059,0.00001181031,0.000328296,0.0003390118,0.0002682726,0.0002466646],"domain_scores_gemma":[0.9989315,0.000207756,0.0001601487,0.0005244993,0.0001456068,0.00003048145],"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.0002954864,0.0002587471,0.0000616687,0.0002509677,0.0001231,0.000009824017,0.0009691989,0.6224108,0.0007225737,0.374376,0.00003860181,0.0004829818],"study_design_scores_gemma":[0.0005109475,0.000027395,0.000008570332,0.00007747349,0.0002548253,0.00001101131,0.00056485,0.8577104,0.0005895794,0.1397222,0.0002245319,0.0002982805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6327282,0.00001735585,0.364814,0.0002710095,0.00000638623,0.0002957103,0.000001093033,0.0001464116,0.001719885],"genre_scores_gemma":[0.9698663,0.000003864138,0.0284822,0.001380792,0.0001512694,0.00004720196,0.00000675887,0.00003903965,0.0000225733],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3371381,"threshold_uncertainty_score":0.5541966,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3121407226","doi":"10.1080/07408170108936878","title":"State dependent pricing with a queue","year":2001,"lang":"en","type":"article","venue":"IIE Transactions","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":75,"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":"Queue; Microeconomics; Economics; Homogeneous; Social Welfare; State dependent; Business; Industrial organization; Computer science; Mathematical economics; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01065935973479434,"gpt":0.2185662990347844,"spread":0.2079069392999901,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001285589,0.0001287027,0.0001306003,0.0002090524,0.0002892531,0.0001054649,0.0001136325,0.00002362539,0.000679351],"category_scores_gemma":[0.000007781131,0.0001105979,0.00006095237,0.0006392553,0.00003850373,0.0009728693,0.000005064674,0.000137597,0.0002371638],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003667209,"about_ca_system_score_gemma":0.00001157408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004618077,"about_ca_topic_score_gemma":0.002150079,"domain_scores_codex":[0.9992487,0.000007483387,0.0001482142,0.0002126132,0.0001532918,0.0002297347],"domain_scores_gemma":[0.9995947,0.00002990839,0.0000798041,0.0002046272,0.0000780104,0.00001291145],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000831183,0.0005438582,0.004486883,0.0001381954,0.0005609202,0.000331531,0.0005110439,0.8896592,0.003240637,0.009367854,0.0001286551,0.09020007],"study_design_scores_gemma":[0.01301307,0.0002542989,0.01795902,0.0008913447,0.00575446,0.0005148809,0.008083084,0.2916611,0.00727364,0.1611298,0.4868712,0.006594081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1721087,0.00002106382,0.8165793,0.0005848419,0.00008127093,0.0001209148,0.000001548446,0.0002801951,0.01022217],"genre_scores_gemma":[0.9960348,0.00001401264,0.0006179348,0.0004835711,0.0001293095,0.00002369751,0.000004246813,0.00002750645,0.002664922],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8239261,"threshold_uncertainty_score":0.7438417,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2008297046","doi":"10.1287/moor.1090.0409","title":"Fluid Limits for Shortest Remaining Processing Time Queues","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Mathematics; Queue; Mathematical optimization; Infimum and supremum; Logarithm; Uniqueness; Applied mathematics; Computer science; Discrete mathematics; Mathematical analysis","retraction":null,"screen_n_in":null,"score":{"opus":0.09283470670110919,"gpt":0.3842832528348863,"spread":0.2914485461337771,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002172807,0.0001178083,0.0002503546,0.0005048125,0.0005795195,0.0003666077,0.0003391255,0.00005218988,0.0001082947],"category_scores_gemma":[0.002338344,0.0001064531,0.00007440264,0.000868749,0.00009519199,0.0009490772,0.00006237541,0.000135692,0.000117227],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003173993,"about_ca_system_score_gemma":0.00005007939,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009240198,"about_ca_topic_score_gemma":0.00001921372,"domain_scores_codex":[0.998621,0.00001988125,0.0004029699,0.0002181494,0.0004269551,0.0003109845],"domain_scores_gemma":[0.9981626,0.0002371581,0.00006728301,0.0003307751,0.001187802,0.0000143403],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007084951,0.001021497,0.00004431923,0.0009392136,0.00008201925,0.00000586029,0.001493254,0.07599061,0.1756191,0.7142149,0.003049269,0.02746918],"study_design_scores_gemma":[0.0002005863,0.00004146513,0.00001815061,0.0002436052,0.00004260693,0.000001312836,0.0006984659,0.9191762,0.003410325,0.07494315,0.001060247,0.0001639352],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7344474,0.0004567395,0.1684169,0.007098844,0.00007409143,0.00290205,0.00001565448,0.0004877606,0.08610062],"genre_scores_gemma":[0.9536307,0.000004836434,0.04372371,0.0001231559,0.0003230569,0.00005944829,0.00003506005,0.00002890373,0.002071165],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8431855,"threshold_uncertainty_score":0.4457255,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2039386689","doi":"10.1287/mnsc.1070.0777","title":"Service-Level Agreements in Call Centers: Perils and Prescriptions","year":2008,"lang":"en","type":"article","venue":"Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":72,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Center (category theory); Variance (accounting); Business; Percentile; Perspective (graphical); Service (business); Contract management; Customer satisfaction; Computer science; Call centre; Marketing; Microeconomics; Economics; Mathematics; Telecommunications; Statistics; Accounting","retraction":null,"screen_n_in":null,"score":{"opus":0.03881759737912906,"gpt":0.244889662548898,"spread":0.2060720651697689,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005262281,0.0001488703,0.0001375904,0.0007023917,0.0004891484,0.0001851818,0.0005389976,0.00001820611,0.00008821067],"category_scores_gemma":[0.00004429862,0.0001464235,0.00002809187,0.002011846,0.0002956572,0.002283594,0.0007132102,0.00007594338,0.0001736923],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006928448,"about_ca_system_score_gemma":0.000007093063,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004013437,"about_ca_topic_score_gemma":0.0003918083,"domain_scores_codex":[0.9984311,0.000008422952,0.0002231884,0.0005026005,0.0004289828,0.0004056424],"domain_scores_gemma":[0.999449,0.00001004281,0.000100845,0.0003461458,0.00007169871,0.00002227551],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.0001940628,0.001211921,0.5916724,0.001156223,0.0001813112,0.0006670132,0.003059575,0.01748476,0.006347388,0.3357794,0.006890609,0.03535539],"study_design_scores_gemma":[0.002090074,0.0000178217,0.8397549,0.0002515828,0.0001320626,0.00001031071,0.003496054,0.07721861,0.00009075015,0.01454555,0.06139622,0.0009961085],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9484932,0.00003721979,0.00288577,0.0010572,0.0002147831,0.000373045,0.000001896758,0.0001068294,0.04682999],"genre_scores_gemma":[0.9944475,0.00003396698,0.001415078,0.002540817,0.00007080312,0.00002749565,0.000004638215,0.00001031691,0.00144933],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3212338,"threshold_uncertainty_score":0.5970978,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2156761946","doi":"10.1016/j.ejor.2012.11.030","title":"A Markovian queueing model for ambulance offload delays","year":2012,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":71,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo","funders":"","keywords":"Overcrowding; Queueing theory; Computer science; Queue; Emergency department; Markov process; Markov chain; Computer network; Medicine; Statistics; Nursing","retraction":null,"screen_n_in":null,"score":{"opus":0.1082921508500954,"gpt":0.3577038544373128,"spread":0.2494117035872174,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009638863,0.0001082496,0.0001676968,0.0004513182,0.0004314675,0.0002779177,0.0004246942,0.00001693601,0.0001587623],"category_scores_gemma":[0.001659103,0.00009164666,0.0001277294,0.0003761421,0.00007803891,0.00225729,0.0001462434,0.0003490886,0.0001970987],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006772849,"about_ca_system_score_gemma":0.00006718628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000004051807,"about_ca_topic_score_gemma":0.000003349186,"domain_scores_codex":[0.9981577,0.000175895,0.0004356616,0.0001304101,0.0006869986,0.000413277],"domain_scores_gemma":[0.9979547,0.0002227976,0.0002057558,0.0001588588,0.001410102,0.00004777609],"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.001611414,0.0005717108,0.006895848,0.0002369404,0.000343551,0.0001173055,0.0008836634,0.362748,0.02055476,0.5293102,0.05170006,0.02502653],"study_design_scores_gemma":[0.001540126,0.0000765123,0.003362681,0.0001916129,0.00007517083,0.00004423704,0.0003871433,0.8713542,0.0002255772,0.01078436,0.11157,0.0003883587],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3696878,0.0008712218,0.5666899,0.005280449,0.0004565708,0.0004594334,0.00000965491,0.00004380926,0.05650115],"genre_scores_gemma":[0.983741,0.00001279638,0.01049207,0.0007181745,0.003402412,0.000004239701,0.000008473628,0.00004019135,0.001580571],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6140532,"threshold_uncertainty_score":0.3737242,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1593591280","doi":"10.1023/a:1019139405059","title":"An analytical solution for a tandem queue with blocking","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":70,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Waterloo; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenvalues and eigenvectors; Mathematics; Simple (philosophy); Line (geometry); Poisson distribution; Applied mathematics; Combinatorics; Statistics; Physics; Geometry","retraction":null,"screen_n_in":null,"score":{"opus":0.01689125562703021,"gpt":0.2540141036912759,"spread":0.2371228480642457,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007188214,0.0002123374,0.0003312384,0.0002051899,0.0003806175,0.0004086899,0.0002298669,0.00008652206,0.0001132981],"category_scores_gemma":[0.00005519748,0.0001801376,0.00009309279,0.0005118741,0.00005539839,0.001200491,0.00001653981,0.0001085128,0.00009463153],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007445413,"about_ca_system_score_gemma":0.00001859631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0006972777,"about_ca_topic_score_gemma":0.0001536828,"domain_scores_codex":[0.9985689,0.00003218962,0.0003330899,0.000422141,0.0002440313,0.0003996633],"domain_scores_gemma":[0.9991872,0.00007129186,0.0001861603,0.0003743483,0.0001562688,0.00002478276],"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.0009415651,0.0004561921,0.02407753,0.001069073,0.00066336,0.00009179632,0.000403624,0.4188848,0.002506127,0.5006118,0.001980124,0.04831405],"study_design_scores_gemma":[0.0005838054,0.00004142599,0.0002031304,0.0002397781,0.0002272296,0.00001028226,0.0002321971,0.9573215,0.00001820948,0.001926226,0.03882209,0.0003741481],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7792865,0.0002003784,0.1990412,0.0004294695,0.0003393227,0.001014543,0.000004514309,0.0009936753,0.01869044],"genre_scores_gemma":[0.9961312,0.000001404644,0.0005315371,0.00026686,0.001653463,0.00007439367,0.00003072428,0.00005323429,0.001257167],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5384367,"threshold_uncertainty_score":0.7345797,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2416587397","doi":"10.1287/mnsc.2016.2455","title":"Mixed-Integer Rounding Enhanced Benders Decomposition for Multiclass Service-System Staffing and Scheduling with Arrival Rate Uncertainty","year":2016,"lang":"en","type":"article","venue":"Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":69,"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":"Rounding; Staffing; Benders' decomposition; Mathematical optimization; Integer programming; Computer science; Scheduling (production processes); Linear programming relaxation; Job shop scheduling; Operations research; Mathematics; Schedule","retraction":null,"screen_n_in":null,"score":{"opus":0.01707638815943983,"gpt":0.2486643412055315,"spread":0.2315879530460917,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001670183,0.0002360349,0.0002194711,0.0004889535,0.0008673237,0.000530315,0.0004346163,0.00002765484,0.000007015953],"category_scores_gemma":[0.00009341727,0.0001655546,0.00004690392,0.001130366,0.0002173265,0.00263431,0.0003066803,0.0000553735,0.00002410125],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002505702,"about_ca_system_score_gemma":0.00001259534,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004076702,"about_ca_topic_score_gemma":0.0001317248,"domain_scores_codex":[0.9980528,0.00001882238,0.0002706131,0.0007377537,0.0003672263,0.0005527221],"domain_scores_gemma":[0.998954,0.0001330926,0.0002873246,0.0003316759,0.0002593254,0.00003456299],"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.0006300356,0.00008993479,0.001472689,0.001457321,0.0002217648,0.00002252359,0.0002420677,0.2046895,0.0953039,0.6614279,0.00003112622,0.03441126],"study_design_scores_gemma":[0.003696201,0.00005276141,0.001232786,0.00172306,0.0004659618,0.000003300258,0.01118535,0.9603947,0.008758316,0.009831316,0.001561815,0.001094457],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4749174,0.000005192132,0.5224762,0.0005950698,0.0001733854,0.0003751375,0.000001169366,0.0001651011,0.001291309],"genre_scores_gemma":[0.9881507,0.000003096,0.01105122,0.0004298273,0.0001488831,0.00007629445,0.0000041799,0.00002546533,0.0001102946],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7557052,"threshold_uncertainty_score":0.6751121,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W3018789859","doi":"10.1287/opre.2019.1906","title":"Real-Time Dynamic Pricing for Revenue Management with Reusable Resources, Advance Reservation, and Deterministic Service Time Requirements","year":2020,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":69,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Queen's University","funders":"","keywords":"Reservation; Revenue management; Dynamic pricing; Computer science; Operations research; Service (business); Heuristic; Revenue; Yield management; Mathematical optimization; Duration (music); Demand management; Total revenue; Microeconomics; Business; Economics; Marketing; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.04003862520928552,"gpt":0.3258170514260944,"spread":0.2857784262168089,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001177007,0.0001617283,0.0002137856,0.0002697041,0.001045596,0.0004666504,0.0003797318,0.00004266563,0.0001264815],"category_scores_gemma":[0.0005085539,0.0001532851,0.00002567819,0.001635477,0.00008812064,0.001218507,0.0003500792,0.0001627084,0.0003375356],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008783697,"about_ca_system_score_gemma":0.00002962615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001909145,"about_ca_topic_score_gemma":0.00033235,"domain_scores_codex":[0.9981952,0.00007116624,0.0003063163,0.0005471307,0.000472744,0.0004073966],"domain_scores_gemma":[0.9985664,0.0001438081,0.00007154669,0.0004410483,0.0007376471,0.00003948124],"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.006526375,0.001009531,0.00389737,0.01212437,0.001602852,0.0003868829,0.005340041,0.5088787,0.2740524,0.1109814,0.04030377,0.0348963],"study_design_scores_gemma":[0.0009949385,0.00009547685,0.0004212768,0.0002900639,0.0001126186,0.000001771881,0.0004690834,0.9381931,0.00009269478,0.002951331,0.05604297,0.0003346516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.926477,0.0001206159,0.0183557,0.02697516,0.00004887261,0.004342895,0.00007605798,0.0003535705,0.02325016],"genre_scores_gemma":[0.8264689,0.0002113515,0.09849971,0.004461142,0.0009870268,0.001482018,0.0008938378,0.0003065512,0.06668947],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4293144,"threshold_uncertainty_score":0.8041987,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2019377880","doi":"10.1287/opre.1110.0972","title":"The Impact of Delaying the Delay Announcements","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":68,"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":"Postponement; Credibility; Profit (economics); Service provider; Business; Service (business); Retard; Focus (optics); Computer science; Microeconomics; Marketing; Economics","retraction":null,"screen_n_in":null,"score":{"opus":0.1299158951247875,"gpt":0.39241821771528,"spread":0.2625023225904924,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002502751,0.00007269156,0.00007653593,0.0001569795,0.001742848,0.0002579294,0.0005508839,0.00002298954,0.0004524323],"category_scores_gemma":[0.0005870506,0.00003551023,0.00008318821,0.001039941,0.0002607232,0.0006536445,0.0002333684,0.0002096236,0.0002450604],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004536246,"about_ca_system_score_gemma":0.00005198322,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003390546,"about_ca_topic_score_gemma":0.0006059743,"domain_scores_codex":[0.9989434,0.00008906565,0.0001948983,0.0001336469,0.0003572291,0.0002817882],"domain_scores_gemma":[0.998608,0.0001593322,0.00003530189,0.0004682113,0.0007210437,0.000008131497],"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.0003830763,0.0005100784,0.02500278,0.00003747895,0.0008225868,0.00001653919,0.002558236,0.1255586,0.01222474,0.7885013,0.01232158,0.03206307],"study_design_scores_gemma":[0.001228954,0.0002049274,0.02419708,0.0001113414,0.0001828211,0.000008649528,0.01120216,0.8187186,0.001307697,0.09555113,0.0465606,0.0007260217],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9176428,0.0001846753,0.003214969,0.0006185149,0.00007785659,0.0004908666,0.000005424834,0.00003454463,0.07773036],"genre_scores_gemma":[0.9982521,0.00002361747,0.0001536156,0.00004251519,0.0001482135,0.00005313014,0.000009391553,0.00001130153,0.001306106],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6931601,"threshold_uncertainty_score":0.9995567,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1994476060","doi":"10.1111/j.1937-5956.2009.01034.x","title":"Social Optimal Location of Facilities with Fixed Servers, Stochastic Demand, and Congestion","year":2009,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":64,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Alberta; Wilfrid Laurier University","funders":"Natural Sciences and Engineering Research Council of Canada; Canadian Imperial Bank of Commerce","keywords":"Server; Computer science; Queueing theory; Service (business); Mathematical optimization; Operations research; Lagrangian relaxation; Computer network; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.01160619579663487,"gpt":0.2262483819525813,"spread":0.2146421861559465,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001748952,0.00009350038,0.0001061365,0.0001738417,0.0003084069,0.0001002951,0.00003542378,0.00001875057,0.00001877967],"category_scores_gemma":[0.00005750592,0.00008437623,0.00001112839,0.0003339431,0.00007656647,0.0007954135,0.00002769044,0.0000392881,0.000003825181],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001437807,"about_ca_system_score_gemma":0.000004480612,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002296987,"about_ca_topic_score_gemma":0.00008606652,"domain_scores_codex":[0.9994333,0.00001151693,0.0001454619,0.000216001,0.0001108098,0.00008286798],"domain_scores_gemma":[0.9996378,0.000004184666,0.00006386883,0.00009264611,0.0001940527,0.000007391803],"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.0002217232,0.0001530116,0.0004180926,0.0004475949,0.0001290714,0.000001189343,0.0006493488,0.6627859,0.0003468783,0.317895,0.0004503111,0.01650181],"study_design_scores_gemma":[0.009672693,0.0009090359,0.2073245,0.00143974,0.005469225,0.00005545844,0.06107458,0.637355,0.001590324,0.04683855,0.02400925,0.004261674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8550266,0.0002101284,0.1344808,0.008130275,0.0001062353,0.0007761702,0.000001679604,0.0001416387,0.001126457],"genre_scores_gemma":[0.9973634,0.00001729665,0.001115639,0.0001505269,0.0001463903,0.00001952235,0.0000230202,0.000004913807,0.001159332],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2710564,"threshold_uncertainty_score":0.3440763,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2054587269","doi":"10.1287/opre.1080.0602","title":"On a Data-Driven Method for Staffing Large Call Centers","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":63,"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":"Staffing; Computer science; Mathematical optimization; Simple (philosophy); Class (philosophy); Abandonment (legal); Operations research; Mathematics; Artificial intelligence","retraction":null,"screen_n_in":null,"score":{"opus":0.1125623435775617,"gpt":0.4416485484034078,"spread":0.3290862048258462,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002400353,0.00009771277,0.0001368378,0.0004498246,0.0008868589,0.0004869221,0.0005985459,0.00003895909,0.0001952755],"category_scores_gemma":[0.001516359,0.00008864385,0.00004793183,0.0007227752,0.00002563683,0.001113881,0.0002257508,0.0002220823,0.0002355337],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005760345,"about_ca_system_score_gemma":0.00003185462,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001309733,"about_ca_topic_score_gemma":0.0006141474,"domain_scores_codex":[0.9985666,0.00007700177,0.0001792986,0.000409254,0.000348631,0.000419174],"domain_scores_gemma":[0.9986146,0.0002579887,0.0000221863,0.0006971327,0.0003911485,0.00001693976],"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.0001465555,0.0003776713,0.00004094793,0.00003379303,0.00005653521,0.000008511446,0.00008889321,0.1616115,0.003043829,0.7888273,0.02933865,0.01642584],"study_design_scores_gemma":[0.0004311985,0.00002997692,0.00004351938,0.00002609923,0.00002096551,2.602939e-7,0.0001695094,0.9158866,0.00006205048,0.007239031,0.07597204,0.0001187205],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02762401,0.00003671946,0.9429539,0.01243224,0.0001280255,0.001231917,0.0001213062,0.0001823448,0.01528953],"genre_scores_gemma":[0.9326383,0.00000911283,0.05774831,0.003033086,0.0009165255,0.00009652344,0.001081102,0.00003931624,0.004437672],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9050143,"threshold_uncertainty_score":0.6821091,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2131297116","doi":"10.1007/s11134-010-9201-2","title":"Dynamic control of a single-server system with abandonments","year":2010,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":61,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Markov decision process; Computer science; Scheduling (production processes); Abandonment (legal); Mathematical optimization; Markov chain; Operations research; Uniformization (probability theory); Counterexample; Markov process; Mathematics; Markov model; Statistics; Variable-order Markov model","retraction":null,"screen_n_in":null,"score":{"opus":0.005396278547896633,"gpt":0.1908203917151976,"spread":0.185424113167301,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006032332,0.0002184192,0.0004640971,0.0002375983,0.0001244198,0.0001548421,0.0002857067,0.00008592958,0.00002333066],"category_scores_gemma":[0.00006674533,0.0001736693,0.00009784539,0.0003877991,0.00007750621,0.0006971805,0.00004687826,0.0001651188,0.00009361938],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005444488,"about_ca_system_score_gemma":0.00001178014,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008034549,"about_ca_topic_score_gemma":0.0002675802,"domain_scores_codex":[0.9985918,0.00002801535,0.0004395483,0.0003071075,0.0003507965,0.0002826648],"domain_scores_gemma":[0.9985947,0.00007608509,0.0006283962,0.0005012217,0.0001826991,0.00001690753],"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.0008866144,0.0005249946,0.102314,0.006993052,0.001409131,0.000205103,0.0002870003,0.0679234,0.2738885,0.5439487,0.0001511942,0.001468418],"study_design_scores_gemma":[0.01031502,0.0001651376,0.00565334,0.004416114,0.001693369,0.0001347192,0.003704309,0.9506347,0.001174125,0.001078798,0.01872268,0.002307646],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9627003,0.00008577137,0.02848393,0.00004174368,0.000778755,0.000442607,0.000004384232,0.0002885618,0.007173955],"genre_scores_gemma":[0.9990039,2.35103e-7,0.0001198459,0.00005566273,0.0002886179,0.00003727708,0.000008406717,0.00005077887,0.0004352078],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.8827114,"threshold_uncertainty_score":0.7082028,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1987222495","doi":"10.1287/opre.1080.0532","title":"Dynamic Control of a Make-to-Order, Parallel-Server System with Cancellations","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":59,"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":"Outsourcing; Computer science; Queueing theory; Context (archaeology); Holding cost; Mathematical optimization; Scheduling (production processes); Operations research; Order (exchange); Resource allocation; Control (management); Distributed computing; Computer network; Business; Mathematics","retraction":null,"screen_n_in":null,"score":{"opus":0.03221987589783293,"gpt":0.308153119100217,"spread":0.2759332432023841,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006101496,0.0001054494,0.0002039431,0.0005238577,0.0007909675,0.00009628104,0.0002542849,0.00003724946,0.0001817721],"category_scores_gemma":[0.0001931762,0.00008828673,0.00004065985,0.001980018,0.000148946,0.0004011121,0.00007622576,0.0001685688,0.0003181263],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001001705,"about_ca_system_score_gemma":0.0001143019,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001973746,"about_ca_topic_score_gemma":0.007350281,"domain_scores_codex":[0.9986362,0.00006405284,0.0002474014,0.0002578101,0.0005008447,0.0002936917],"domain_scores_gemma":[0.9981444,0.00008802086,0.00003719094,0.0004300952,0.001277466,0.00002277138],"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.0001018112,0.00006509652,0.002181856,0.00007150238,0.00006288873,0.00001703539,0.00009821065,0.9110029,0.0008168368,0.08524947,0.0001371982,0.0001951992],"study_design_scores_gemma":[0.001217449,0.00004575834,0.003214802,0.000120101,0.00004932825,0.000009278833,0.001045148,0.9892496,0.00003710356,0.0002234997,0.004541456,0.0002464693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.72687,0.0001200747,0.2512139,0.00209339,0.00006085045,0.001209485,0.00001804647,0.0001347217,0.01827952],"genre_scores_gemma":[0.992316,0.000007129144,0.00387805,0.0001078259,0.00008809991,0.0001628953,0.00002720803,0.00002380853,0.003388993],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.265446,"threshold_uncertainty_score":0.6083563,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2053028813","doi":"10.1023/b:ques.0000018028.16682.ef","title":"Vacation models in discrete time","year":2003,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Manitoba","funders":"","keywords":"Discrete time and continuous time; Computer science; Mathematics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.01263388078204098,"gpt":0.2199847940193971,"spread":0.2073509132373561,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007916001,0.0001351124,0.0002178947,0.0002846032,0.00009126907,0.0001688497,0.0001435798,0.00005650164,0.00005576794],"category_scores_gemma":[0.0001377222,0.0001306377,0.00005404009,0.0005743548,0.00001747249,0.001404652,0.00002825487,0.00009292954,0.0005542071],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006567127,"about_ca_system_score_gemma":0.000009390238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005492769,"about_ca_topic_score_gemma":0.00002636826,"domain_scores_codex":[0.9989877,0.00005126618,0.0003082361,0.0002538917,0.0001661994,0.000232699],"domain_scores_gemma":[0.9994267,0.00004569942,0.0001874254,0.0002727919,0.00005926876,0.000008163518],"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.000008397586,0.00002067667,0.001548246,0.0001072276,0.00001836894,0.000008258176,0.00005771363,0.2586673,0.0007263141,0.7384265,0.0002232155,0.000187765],"study_design_scores_gemma":[0.0004243734,0.000003712521,0.0001440397,0.0002727248,0.00004933827,0.000003384445,0.0003608809,0.8826293,0.00005886431,0.09497189,0.02065874,0.000422783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5649545,0.0008340568,0.08762646,0.0003297986,0.001009034,0.0009098543,0.000002229182,0.0007175365,0.3436165],"genre_scores_gemma":[0.9963384,0.000001828974,0.0001185355,0.0001247678,0.0002452715,0.00003131869,0.00001130453,0.00002866325,0.003099856],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6434546,"threshold_uncertainty_score":0.7123396,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1992428101","doi":"10.1016/j.geb.2010.06.002","title":"Equilibrium joining probabilities for an M/G/1 queue","year":2010,"lang":"en","type":"article","venue":"Games and Economic Behavior","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":59,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Queue; Join (topology); Poisson distribution; Computer science; Service (business); Mathematical optimization; Mathematical economics; Phenomenon; Distribution (mathematics); Mathematics; Economics; Combinatorics; Computer network; Physics; Statistics","retraction":null,"screen_n_in":null,"score":{"opus":0.02382778392177146,"gpt":0.2538317663166927,"spread":0.2300039823949212,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002990221,0.000134219,0.0001939651,0.00009477479,0.0001008185,0.0002518366,0.0001331543,0.00006227897,0.0002685749],"category_scores_gemma":[0.0000355404,0.0001331421,0.00007296331,0.00002962279,0.00008932195,0.001295662,0.00007996357,0.00009450858,0.00004324126],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001334059,"about_ca_system_score_gemma":0.00001112658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00019488,"about_ca_topic_score_gemma":0.0006665694,"domain_scores_codex":[0.9992353,0.000003283948,0.0002083809,0.0003030532,0.00002441963,0.0002256108],"domain_scores_gemma":[0.9995529,0.00003403998,0.0001230947,0.0002426339,0.00002903816,0.00001831154],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002698686,0.0003625076,0.2018194,0.000442902,0.0001060514,0.000005526997,0.0006620909,0.001327641,0.04080661,0.5533827,0.002340108,0.1984746],"study_design_scores_gemma":[0.004982031,0.0002786612,0.07638751,0.0001069441,0.002031235,0.00004910411,0.006518475,0.1415639,0.003166471,0.2705508,0.4903357,0.004029186],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9975969,0.00001553455,0.0001060937,0.0001815374,0.0004131028,0.0002516381,0.000009002064,0.0001043777,0.001321856],"genre_scores_gemma":[0.9966732,0.000001289576,0.001235286,0.0002944451,0.0009730907,0.0001539581,0.0000287784,0.00002961941,0.0006102925],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4879956,"threshold_uncertainty_score":0.5429379,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2072709938","doi":"10.1023/a:1026097723093","title":"Analysis of Queueing Systems with Synchronous Single Vacation for Some Servers","year":2003,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China; Western Washington University","keywords":"Server; Idle; Computer science; Computer network; Queueing theory; Queue; Real-time computing; Operating system","retraction":null,"screen_n_in":null,"score":{"opus":0.01369276134957893,"gpt":0.2204369974851817,"spread":0.2067442361356028,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001304617,0.0003197615,0.0008762332,0.001104024,0.000277606,0.0003319876,0.0002854766,0.000103022,0.00001594561],"category_scores_gemma":[0.0002631142,0.0002900088,0.0002768148,0.002209158,0.00006329858,0.001512725,0.00003360945,0.0001008375,0.00001881369],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002126345,"about_ca_system_score_gemma":0.00004020904,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002197997,"about_ca_topic_score_gemma":0.0001738057,"domain_scores_codex":[0.9977649,0.00009393733,0.0007672028,0.0005381553,0.00039419,0.0004415892],"domain_scores_gemma":[0.9975426,0.0002446063,0.001135652,0.0006121122,0.0004386239,0.00002637566],"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.00006980544,0.0001186052,0.01270494,0.001599103,0.002225026,0.000008028247,0.0001336915,0.7086679,0.001919597,0.2722912,0.00007151395,0.0001905473],"study_design_scores_gemma":[0.00211502,0.0001565105,0.0008011677,0.001661315,0.01161758,0.00001488312,0.007473809,0.9486029,0.0009674068,0.001892357,0.02296972,0.001727393],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8369384,0.001630047,0.1529504,0.00006653436,0.001085042,0.001522208,0.00001806246,0.0004649935,0.005324315],"genre_scores_gemma":[0.9984664,0.00000350422,0.0002571426,0.00006493098,0.0003923736,0.0001379875,0.0000724828,0.00007078686,0.0005343548],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2703989,"threshold_uncertainty_score":0.9999552,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W1486673646","doi":"10.1023/a:1019199013546","title":"MMPP models for multimedia traffic","year":2000,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":58,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McGill University; Concordia University","funders":"","keywords":"Computer science; Queueing theory; Poisson distribution; Algorithm; Superposition principle; Markov process; Matching (statistics); Markov chain; Probability density function; Statistics; Computer network; Mathematics; Machine learning","retraction":null,"screen_n_in":null,"score":{"opus":0.03196300225267427,"gpt":0.2595972951370367,"spread":0.2276342928843624,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006335225,0.000138157,0.0002297292,0.0001498929,0.0002704769,0.0001635624,0.0005915627,0.0000654629,0.0002387156],"category_scores_gemma":[0.00005542183,0.0001364935,0.0001029401,0.0003573386,0.00004099896,0.001011756,0.00004337882,0.00009277593,0.0006387958],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003849369,"about_ca_system_score_gemma":0.000008071578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001158962,"about_ca_topic_score_gemma":0.00003364931,"domain_scores_codex":[0.9990479,0.00003563484,0.0003706297,0.0002031679,0.000130702,0.0002119755],"domain_scores_gemma":[0.998596,0.0001695292,0.0002036856,0.0008683485,0.0001512734,0.00001113129],"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.000072884,0.0001135497,0.00002986376,0.0001307002,0.00007134312,3.427035e-7,0.0001878725,0.8512573,0.0001226129,0.03653676,0.002820957,0.1086559],"study_design_scores_gemma":[0.0003439154,0.000003147613,0.00001642479,0.00002978785,0.00004396957,8.761729e-7,0.0001723414,0.8257892,0.000005023514,0.002928142,0.1705076,0.0001595506],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6673067,0.004914426,0.104277,0.003518711,0.001024032,0.005229959,0.00003704942,0.003670668,0.2100215],"genre_scores_gemma":[0.9942873,0.00004593858,0.001945328,0.0003205741,0.0004367687,0.0002475793,0.000136091,0.0000378246,0.002542618],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.3269806,"threshold_uncertainty_score":0.821064,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2041738053","doi":"10.1007/s10479-006-5301-0","title":"A BMAP/G/1 Retrial Queue with a Server Subject to Breakdowns and Repairs","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":56,"is_retracted":false,"has_abstract":false,"routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Retrial queue; Markov chain; Computer science; Queue; Laplace transform; Censoring (clinical trials); Stationary distribution; Exponential distribution; Theory of computation; Mathematical optimization; Real-time computing; Mathematics; Algorithm; Statistics; Computer network; Queueing system","retraction":null,"screen_n_in":null,"score":{"opus":0.08682550280944053,"gpt":0.3739423713252735,"spread":0.287116868515833,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001928595,0.000107861,0.000192633,0.0007055624,0.000391106,0.0002812382,0.0001933651,0.00004481615,0.0001620785],"category_scores_gemma":[0.0006604915,0.0000886549,0.00004862776,0.001822418,0.0001461718,0.0008855273,0.0001704756,0.0001625831,0.00008354132],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001295852,"about_ca_system_score_gemma":0.00005252406,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00647476,"about_ca_topic_score_gemma":0.007856083,"domain_scores_codex":[0.9985638,0.00007401848,0.0002537881,0.0003100971,0.0004803298,0.0003180086],"domain_scores_gemma":[0.9982649,0.0001129232,0.00003431373,0.0003707863,0.001195442,0.00002163587],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.002765985,0.0008782126,0.02464608,0.0004085288,0.0003718849,0.0001174164,0.0005647324,0.161233,0.01482568,0.7217853,0.06707771,0.005325432],"study_design_scores_gemma":[0.01119613,0.00234131,0.1478905,0.001997926,0.000553638,0.0000763414,0.00748504,0.1843329,0.04460692,0.1339616,0.4605653,0.00499235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9837812,0.00007291664,0.0005059076,0.007186641,0.00001936595,0.0003873531,0.000005851097,0.00005147015,0.007989363],"genre_scores_gemma":[0.9959894,0.0000108532,0.0007244501,0.000440466,0.0004915203,0.00004626172,0.0000260486,0.00002031311,0.002250711],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.5878237,"threshold_uncertainty_score":0.9787943,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}