{"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","author_layer_release":"2026-06-26"},"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","authors":[{"name":"Sergey Foss","is_ca":true},{"name":"Dmitry Korshunov","is_ca":false},{"name":"Stan Zachary","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001588777,0.001775436,0.001515812,0.002395267,0.000694463,0.002986139,0.001822316,0.0016665,0.0209122],"category_scores_gemma":[0.006589541,0.001103461,0.001366979,0.004938735,0.001956215,0.007851742,0.001595631,0.006218457,0.007933831],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002094327,"about_ca_system_score_gemma":0.001365174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001145856,"about_ca_topic_score_gemma":0.001074963,"domain_scores_codex":[0.9991027,0.0001348988,0.00008500632,0.0001692927,0.0004372023,0.00007087454],"domain_scores_gemma":[0.9964265,0.002445928,0.0001353521,0.0003015934,0.0005763643,0.0001143552],"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.00002728832,0.00007730973,0.0002062494,0.0003960333,0.00002724417,0.00016627,0.0001777087,0.005573806,0.0007037738,0.8012964,0.08392961,0.1074184],"study_design_scores_gemma":[0.000007751691,0.00002060359,0.0002546477,0.0001082181,0.000012169,0.0004049918,0.00002562528,0.007338121,0.0001914164,0.8101379,0.1814715,0.00002697807],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.003559604,0.1822621,0.587788,0.008897049,0.009375047,0.0001368615,0.001539886,0.001401667,0.2050398],"genre_scores_gemma":[0.1142544,0.2957314,0.2419189,0.009069691,0.0318917,0.000653139,0.002154128,0.001992705,0.302334],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.0209122,"threshold_uncertainty_score":0.06995827,"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","authors":[{"name":"Allan Borodin","is_ca":true},{"name":"Jon Kleinberg","is_ca":false},{"name":"Prabhakar Raghavan","is_ca":false},{"name":"Madhu Sudan","is_ca":false},{"name":"David P. Williamson","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002067583,0.001133239,0.0009769757,0.0009800751,0.001026356,0.002164227,0.002223433,0.002068064,0.004368764],"category_scores_gemma":[0.008233792,0.0004429543,0.0009128402,0.001046623,0.00313169,0.003792701,0.00222125,0.002838732,0.0007820104],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001907866,"about_ca_system_score_gemma":0.001181984,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002797868,"about_ca_topic_score_gemma":0.001147456,"domain_scores_codex":[0.9980838,0.0006629736,0.00006923823,0.0003258961,0.0005748646,0.0002831402],"domain_scores_gemma":[0.9954118,0.002929593,0.0005896238,0.0004010744,0.0004185431,0.0002493954],"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.00001700411,0.0000185301,0.0003115771,0.00004104634,0.00003259057,0.00008619502,0.00007914696,0.2039317,0.0005058268,0.7880323,0.00183201,0.005112081],"study_design_scores_gemma":[0.000007059356,0.00003321754,0.0001082981,0.00001203198,0.00001212174,0.00004825796,0.00002317295,0.5855978,0.0001919365,0.4098574,0.004092102,0.00001662182],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008077824,0.0006804004,0.9752727,0.001358457,0.0002922082,0.00004800205,0.0001366707,0.0001039138,0.01402982],"genre_scores_gemma":[0.8774977,0.003921445,0.09194903,0.001228355,0.00150818,0.0003243261,0.000255154,0.0000873979,0.02322835],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004368764,"threshold_uncertainty_score":0.01461494,"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","authors":[{"name":"Markus Fidler","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005028647,0.001026388,0.0009802207,0.000930211,0.001356647,0.003619874,0.00260172,0.001501698,0.003301782],"category_scores_gemma":[0.006403842,0.0006676233,0.001509928,0.001274812,0.002470077,0.004963274,0.002708295,0.003848122,0.001017343],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002134645,"about_ca_system_score_gemma":0.002563594,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002056885,"about_ca_topic_score_gemma":0.00168022,"domain_scores_codex":[0.9970543,0.0007832833,0.000179005,0.000411149,0.00130749,0.0002648223],"domain_scores_gemma":[0.9978241,0.001090328,0.0001999728,0.0003290388,0.0004147173,0.0001419712],"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.00001662234,0.00002038524,0.00006766065,0.0000189669,0.000009331904,0.00007328472,0.00006542978,0.04352319,0.0007874722,0.9484708,0.0007550342,0.006191867],"study_design_scores_gemma":[0.00001255064,0.00003963,0.00006587363,0.00001558527,0.0000232867,0.0001011118,0.0000163465,0.4989048,0.001168439,0.4913539,0.008271929,0.00002656256],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00143862,0.00006265477,0.995375,0.0001384928,0.00004796272,0.00002402054,0.00004664997,0.0001344477,0.00273223],"genre_scores_gemma":[0.303899,0.0008116656,0.6809066,0.000473295,0.0005779597,0.0004295787,0.0002353545,0.000261992,0.01240452],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005028647,"threshold_uncertainty_score":0.02659434,"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","authors":[{"name":"Athanassios N. Avramidis","is_ca":true},{"name":"Alexandre Deslauriers","is_ca":true},{"name":"Pierre L’Ecuyer","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002157733,0.0008158556,0.0007488764,0.0009316301,0.0006145405,0.001873213,0.002277542,0.002306976,0.002181358],"category_scores_gemma":[0.01101778,0.0007450319,0.0006765424,0.001576202,0.0007118728,0.00200299,0.0009017285,0.001989832,0.0004942149],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001959431,"about_ca_system_score_gemma":0.001391159,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0212085,"about_ca_topic_score_gemma":0.01493515,"domain_scores_codex":[0.998744,0.000493692,0.00006101584,0.0002362738,0.000242113,0.0002228204],"domain_scores_gemma":[0.9946985,0.003074185,0.001024878,0.0003217933,0.0006145872,0.0002660722],"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.00004740696,0.00007144461,0.004466515,0.00001956278,0.00002802211,0.00006893949,0.0001665467,0.9766216,0.000587152,0.0139392,0.0005202662,0.003463396],"study_design_scores_gemma":[0.000006246666,0.0000146882,0.000517972,0.000001934044,0.000004391509,0.00001117698,0.00002268346,0.9970202,0.00006945925,0.002133633,0.0001900618,0.000007575664],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5873548,0.0002899527,0.4055454,0.000977117,0.00009051539,0.0001400262,0.0008363301,0.000513231,0.004252641],"genre_scores_gemma":[0.9730592,0.0002882155,0.02293857,0.00008792934,0.00008252828,0.0001357438,0.0005241768,0.00005282268,0.002830899],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.0212085,"threshold_uncertainty_score":0.04217011,"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","authors":[{"name":"Philipp Afèche","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008062602,0.001100121,0.00165756,0.000973965,0.0007911421,0.003109954,0.00213352,0.001816001,0.003237154],"category_scores_gemma":[0.0227826,0.0009455907,0.0009172746,0.0008620622,0.002379492,0.005308528,0.002247918,0.002433922,0.0003324451],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004233344,"about_ca_system_score_gemma":0.003631446,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001732175,"about_ca_topic_score_gemma":0.001022276,"domain_scores_codex":[0.9951966,0.002649395,0.0002220106,0.0006237547,0.0005571423,0.000751121],"domain_scores_gemma":[0.9859686,0.01006631,0.001450138,0.0006648008,0.0008499636,0.001000158],"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.0002999381,0.0002181451,0.0009539616,0.0001819454,0.00006386203,0.0001933027,0.0003198557,0.4980977,0.004335926,0.4777598,0.001102098,0.01647363],"study_design_scores_gemma":[0.0001303675,0.0001717267,0.0002615527,0.00002988186,0.00002848339,0.0000632672,0.0001243724,0.7467123,0.001727842,0.2497205,0.0009860841,0.0000436429],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08417566,0.0005784284,0.9069301,0.001731573,0.00008590514,0.0001970349,0.0001023041,0.0001679388,0.006030997],"genre_scores_gemma":[0.9382489,0.0004640371,0.05851581,0.0001542162,0.00008061919,0.0001571424,0.00003579888,0.00005121931,0.002292112],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008062602,"threshold_uncertainty_score":0.04263961,"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","authors":[{"name":"Mehmet Tolga Cezik","is_ca":true},{"name":"Pierre L’Ecuyer","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004082572,0.001273953,0.00171588,0.001051683,0.0007728968,0.001724587,0.001957168,0.001989367,0.00290865],"category_scores_gemma":[0.0103686,0.001231413,0.001027873,0.001342203,0.001653194,0.001495175,0.001265054,0.001964134,0.0002637385],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003159262,"about_ca_system_score_gemma":0.002757519,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01613055,"about_ca_topic_score_gemma":0.010625,"domain_scores_codex":[0.9982086,0.001142662,0.00003835338,0.0001500841,0.0002215298,0.0002387308],"domain_scores_gemma":[0.9883121,0.01002425,0.0006653229,0.0002246379,0.0004724413,0.0003012559],"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.00001902167,0.0000167538,0.0001221405,0.000007715384,0.000005381009,0.000005690687,0.000009443544,0.9970477,0.0000487657,0.001668154,0.00005261934,0.000996626],"study_design_scores_gemma":[0.000005505663,0.000006980616,0.00001578218,0.000001510499,0.000001228136,8.689833e-7,0.000003734773,0.9991843,0.00003234485,0.000714596,0.00003194257,0.000001181785],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1225547,0.0002746233,0.8690001,0.0006306756,0.00003339913,0.0001439051,0.0001128119,0.0004897945,0.006760031],"genre_scores_gemma":[0.7558177,0.0002361217,0.2405877,0.0001434232,0.00003593173,0.0004789376,0.0001812929,0.0001525568,0.002366383],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01613055,"threshold_uncertainty_score":0.03207332,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2144979199","doi":"10.1287/opre.1110.0976","title":"“We Will Be Right with You”: Managing Customer Expectations with Vague Promises and Cheap Talk","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":179,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Vagueness; Computer science; Service (business); Queueing theory; Robustness (evolution); Business; Service provider; Marketing","authors":[{"name":"Gad Allon","is_ca":true},{"name":"Achal Bassamboo","is_ca":true},{"name":"Itai Gurvich","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.05113570447700014,"gpt":0.3067104258066192,"spread":0.255574721329619,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01085835,0.0007265682,0.001159147,0.0006752274,0.001931336,0.006032607,0.002253089,0.004316608,0.003471474],"category_scores_gemma":[0.04595386,0.0009256349,0.0009602897,0.000863503,0.004300405,0.009599783,0.003343214,0.004911549,0.000434128],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003994251,"about_ca_system_score_gemma":0.002870791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006456328,"about_ca_topic_score_gemma":0.003642533,"domain_scores_codex":[0.9929318,0.004455929,0.0001844481,0.0005559271,0.0009943345,0.0008775876],"domain_scores_gemma":[0.9644136,0.02762635,0.004185326,0.00123996,0.001470435,0.001064173],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001266818,0.0003273746,0.005525589,0.0002556347,0.0001782759,0.001201304,0.005813169,0.2993583,0.003040102,0.6461906,0.003963543,0.0328794],"study_design_scores_gemma":[0.00009361335,0.0001805894,0.001367163,0.00005416241,0.00008251231,0.0001412986,0.001553468,0.658462,0.001088143,0.3348894,0.001955924,0.0001316225],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5282243,0.001101276,0.4248189,0.01884788,0.0002392247,0.0001426057,0.000164826,0.0003063218,0.02615458],"genre_scores_gemma":[0.9901932,0.0001984726,0.007754882,0.0003847664,0.00006947716,0.00003846151,0.00002135174,0.0000216159,0.001317659],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01085835,"threshold_uncertainty_score":0.05742508,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Itai Gurvich","is_ca":true},{"name":"Ward Whitt","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002523962,0.0007392992,0.0009315698,0.0005718022,0.0006459102,0.001455378,0.00153213,0.0008270734,0.001609873],"category_scores_gemma":[0.00890612,0.0003560221,0.0005540688,0.0004322747,0.00283484,0.001712,0.001371862,0.001193706,0.0001500119],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001876847,"about_ca_system_score_gemma":0.0008832752,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004004082,"about_ca_topic_score_gemma":0.001453878,"domain_scores_codex":[0.9989618,0.0004280344,0.00004726922,0.0001809919,0.0002099417,0.0001718931],"domain_scores_gemma":[0.9957215,0.002446542,0.0007335483,0.0002485663,0.0004694901,0.0003803755],"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.0001627371,0.0001271585,0.001254796,0.00007697662,0.00004491681,0.0001772211,0.0001988657,0.7494355,0.005798272,0.2358593,0.0009065717,0.005957745],"study_design_scores_gemma":[0.00002171231,0.00003316531,0.0002114941,0.000002923195,0.000006342731,0.00001247028,0.00002052769,0.9735555,0.0003113612,0.02571008,0.0001059785,0.000008430977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3584833,0.0006311519,0.6328514,0.0009487235,0.00008904595,0.0000725335,0.00009662684,0.0003792407,0.006447967],"genre_scores_gemma":[0.9916332,0.0001414029,0.006973251,0.00004644934,0.00002691429,0.00003240037,0.00002140801,0.00002129285,0.001103637],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004004082,"threshold_uncertainty_score":0.01361752,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128483867","doi":"10.1287/opre.1060.0285","title":"Design and Control of a Large Call Center: Asymptotic Analysis of an LP-Based Method","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":154,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"Kellogg's (Canada)","funders":"National Science Foundation","keywords":"Linear programming; Computer science; Mathematical optimization; Staffing; Routing (electronic design automation); Upper and lower bounds; Center (category theory); Asymptotically optimal algorithm; Mathematics; Computer network; Economics","authors":[{"name":"Achal Bassamboo","is_ca":true},{"name":"J. Michael Harrison","is_ca":false},{"name":"Assaf Zeevi","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.03535919632853935,"gpt":0.3685946693310458,"spread":0.3332354730025065,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003380228,0.001042355,0.001187532,0.0006312284,0.0005401694,0.001330213,0.001471955,0.001405621,0.003740966],"category_scores_gemma":[0.005971422,0.0006004096,0.0006548492,0.0004815388,0.001365979,0.001084856,0.001557023,0.001881226,0.0005044499],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001724669,"about_ca_system_score_gemma":0.001858393,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005475482,"about_ca_topic_score_gemma":0.002654765,"domain_scores_codex":[0.9989674,0.0005001562,0.00002507865,0.0001594367,0.0002398028,0.000108068],"domain_scores_gemma":[0.9976978,0.001549254,0.0001897878,0.00006670342,0.0003891051,0.0001072466],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003721972,0.00003360979,0.0001577469,0.0000756025,0.00001887632,0.00004011368,0.00004367141,0.9607221,0.001311894,0.02500382,0.0007930342,0.01176226],"study_design_scores_gemma":[0.000004099691,0.000009832163,0.00001275557,0.00000301587,0.000002913216,0.000002973835,0.000003516578,0.9976171,0.00008695545,0.002081509,0.0001730159,0.000002331934],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002751469,0.0001114065,0.9946668,0.000145266,0.00001367448,0.00002012591,0.00001033836,0.0001138983,0.002167014],"genre_scores_gemma":[0.7456462,0.0006368164,0.2441924,0.0002981475,0.0002271033,0.0005096638,0.0000870431,0.0002095768,0.008193042],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005475482,"threshold_uncertainty_score":0.01787657,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Robert D. Foley","is_ca":true},{"name":"David McDonald","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002956455,0.0007786846,0.001118226,0.001852524,0.001042983,0.00184328,0.001631126,0.00131601,0.003430791],"category_scores_gemma":[0.02363531,0.0004323619,0.001209097,0.0009692112,0.00273404,0.003523032,0.002102635,0.002309092,0.0005315368],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002017859,"about_ca_system_score_gemma":0.001188455,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007028116,"about_ca_topic_score_gemma":0.002782929,"domain_scores_codex":[0.9991609,0.0002474187,0.00003626964,0.0001472007,0.0002271271,0.0001810619],"domain_scores_gemma":[0.9927174,0.004392864,0.0008881233,0.0004683548,0.001061674,0.0004716164],"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.0001916293,0.00009777724,0.004634418,0.0002363216,0.0001195766,0.0004867112,0.0006713333,0.2433291,0.006224529,0.7250726,0.003636157,0.01529995],"study_design_scores_gemma":[0.00001726269,0.00002582132,0.000493446,0.00002367056,0.00001685282,0.00005405146,0.00007980727,0.8432505,0.00044613,0.1549236,0.0006468463,0.00002197487],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2553439,0.003673912,0.7120124,0.003084881,0.0002997691,0.00008456032,0.0002562389,0.0007751057,0.0244692],"genre_scores_gemma":[0.9726964,0.00106546,0.01951913,0.000294188,0.0002554558,0.0001180365,0.0001837311,0.0001684474,0.005699181],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007028116,"threshold_uncertainty_score":0.01563537,"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","authors":[{"name":"Tingliang Huang","is_ca":false},{"name":"Gad Allon","is_ca":true},{"name":"Achal Bassamboo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005902515,0.001057065,0.001190174,0.001024304,0.001451855,0.004929174,0.001598131,0.002435881,0.003169277],"category_scores_gemma":[0.02310626,0.0006169304,0.001032759,0.001067371,0.005431823,0.005331148,0.002376026,0.003315875,0.0004872775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005102868,"about_ca_system_score_gemma":0.004330198,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01340485,"about_ca_topic_score_gemma":0.004626513,"domain_scores_codex":[0.9924797,0.003043379,0.0003026928,0.0008892732,0.001955915,0.001329061],"domain_scores_gemma":[0.9842808,0.01155795,0.001313343,0.0008652832,0.001407022,0.0005756351],"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.00002133548,0.0000247888,0.000530961,0.0000455278,0.00002419506,0.0001673752,0.0002983086,0.0671034,0.0002605278,0.9271203,0.0009733126,0.003430057],"study_design_scores_gemma":[0.00001808376,0.0000210786,0.0002112028,0.00002607252,0.00001073399,0.00003613936,0.0001058697,0.1857585,0.0001032492,0.8115873,0.002103942,0.00001779593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1142053,0.003879466,0.7923473,0.01029746,0.0003393328,0.0001633884,0.000332846,0.0002580612,0.07817694],"genre_scores_gemma":[0.9685325,0.001710059,0.02150799,0.0005152568,0.0002698207,0.0001618179,0.0001009632,0.00004793193,0.007153817],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01340485,"threshold_uncertainty_score":0.03702408,"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","authors":[{"name":"Ming Hu","is_ca":true},{"name":"Yang Li","is_ca":false},{"name":"Jianfu Wang","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004396622,0.0005589576,0.001551528,0.0008465315,0.001361003,0.003411255,0.002094524,0.002520988,0.003847406],"category_scores_gemma":[0.02808063,0.0007229804,0.001300948,0.0008658576,0.001855282,0.006138287,0.002080439,0.002638602,0.0002675428],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002731071,"about_ca_system_score_gemma":0.001853635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005759578,"about_ca_topic_score_gemma":0.002441871,"domain_scores_codex":[0.9973677,0.0008160349,0.0001357091,0.0004542157,0.0005062111,0.0007201387],"domain_scores_gemma":[0.9809641,0.01265054,0.002801416,0.00145018,0.001247481,0.0008863335],"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.0008556884,0.0004430175,0.01475829,0.0003510176,0.0002891379,0.002273923,0.001893561,0.4626732,0.01431089,0.4736981,0.005720705,0.02273237],"study_design_scores_gemma":[0.0001227377,0.0001652046,0.003087114,0.00003028508,0.00009991824,0.0002239013,0.0002806364,0.8335492,0.00141611,0.1599445,0.0009952814,0.0000852784],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7099261,0.0007254391,0.2710473,0.007576996,0.0001634204,0.0001254486,0.0004902999,0.0002860531,0.009659091],"genre_scores_gemma":[0.9932807,0.0001787566,0.004617633,0.0002629524,0.00009951768,0.00003196111,0.00005634693,0.00001914764,0.001453068],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005759578,"threshold_uncertainty_score":0.02325183,"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","authors":[{"name":"Sigrún Andradóttir","is_ca":false},{"name":"Hayriye Ayhan","is_ca":false},{"name":"Douglas G. Down","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.02848912473206587,"gpt":0.2617988668528339,"spread":0.233309742120768,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004531399,0.001176856,0.001527606,0.001379085,0.001289446,0.002424223,0.001879466,0.001290606,0.002572911],"category_scores_gemma":[0.01772986,0.0008582056,0.0004633627,0.00159302,0.001703986,0.003002784,0.001197108,0.001299688,0.0005590849],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003097804,"about_ca_system_score_gemma":0.002238835,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002136284,"about_ca_topic_score_gemma":0.001640428,"domain_scores_codex":[0.9978623,0.001118259,0.0000975232,0.0002214711,0.00032185,0.0003785341],"domain_scores_gemma":[0.9936791,0.004332145,0.0006542142,0.0003621357,0.0005508716,0.0004215854],"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.0001798023,0.0001375894,0.000644497,0.00008093242,0.00003814749,0.00005996592,0.0002430663,0.9149871,0.003114194,0.06186584,0.001011471,0.01763746],"study_design_scores_gemma":[0.00002627718,0.00004358199,0.0001141531,0.00000872039,0.00001095846,0.00001416443,0.00003050978,0.9670123,0.0007600309,0.03166575,0.0003027814,0.00001073144],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1185929,0.0004257532,0.8758893,0.0004072826,0.00006730845,0.0001621448,0.00006296375,0.0005941698,0.003798162],"genre_scores_gemma":[0.9160318,0.0004058647,0.08152492,0.00009741245,0.00007868706,0.0001691497,0.00005824673,0.0001071457,0.001526751],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004531399,"threshold_uncertainty_score":0.02396458,"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","authors":[{"name":"Ármann Ingólfsson","is_ca":true},{"name":"Elvira Akhmetshina","is_ca":true},{"name":"Susan Budge","is_ca":true},{"name":"Yongyue Li","is_ca":true},{"name":"Xudong Wu","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004238201,0.0008144796,0.001142694,0.001101873,0.000596443,0.0009720956,0.001982074,0.001203742,0.001335693],"category_scores_gemma":[0.02069939,0.0005925614,0.0006868931,0.001932987,0.0005262363,0.001630147,0.0006031814,0.0008784513,0.0004340254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001109498,"about_ca_system_score_gemma":0.001358903,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006993602,"about_ca_topic_score_gemma":0.003962441,"domain_scores_codex":[0.9965457,0.001222248,0.00038552,0.0004224936,0.001289667,0.0001343941],"domain_scores_gemma":[0.9816083,0.01321812,0.0009436419,0.001723779,0.002282578,0.0002235465],"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.001169474,0.0008919627,0.006336696,0.000866139,0.0003042156,0.00006940358,0.0004655239,0.522907,0.01041141,0.007806477,0.001969483,0.4468023],"study_design_scores_gemma":[0.00009282283,0.0003236024,0.001362151,0.00005804135,0.00003821799,0.0000619127,0.00007538925,0.9855925,0.00909074,0.00150608,0.001768236,0.00003015424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.2285362,0.004563128,0.758782,0.0003130172,0.0001436335,0.0001921747,0.0001705886,0.003107715,0.004191577],"genre_scores_gemma":[0.6342534,0.00276154,0.3609247,0.0001083209,0.00006173537,0.0002130558,0.0004179115,0.0002995962,0.0009597121],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006993602,"threshold_uncertainty_score":0.02241403,"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","authors":[{"name":"Achal Bassamboo","is_ca":true},{"name":"Ramandeep S. Randhawa","is_ca":false},{"name":"Assaf Zeevi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007034788,0.0009537439,0.001548446,0.0007848241,0.0007218692,0.002731306,0.002373097,0.002520442,0.001697459],"category_scores_gemma":[0.02726282,0.0008459513,0.0008779935,0.001196747,0.00343044,0.004981246,0.001737863,0.003603817,0.000147027],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002107532,"about_ca_system_score_gemma":0.001565895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00221116,"about_ca_topic_score_gemma":0.001161752,"domain_scores_codex":[0.99704,0.00129689,0.0001171678,0.0003605617,0.0008058777,0.0003794963],"domain_scores_gemma":[0.9817522,0.01457688,0.001725611,0.0008643728,0.0007551999,0.0003256225],"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.00003746943,0.00002221149,0.0004230397,0.00007604435,0.00003844039,0.0001109837,0.0001294612,0.8070153,0.0006266125,0.1830508,0.0005007164,0.007969031],"study_design_scores_gemma":[0.0000123309,0.00003620881,0.000201643,0.00002370057,0.00001125001,0.00004982237,0.00006330697,0.7716618,0.0004557265,0.2269121,0.0005494229,0.00002271838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.08577862,0.001188491,0.8998114,0.002983156,0.0001021107,0.0000574785,0.000127708,0.0001679473,0.009783034],"genre_scores_gemma":[0.9599491,0.0007689723,0.03736898,0.0003079613,0.0001494598,0.00005948715,0.00003735676,0.00007817596,0.001280578],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007034788,"threshold_uncertainty_score":0.03720397,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2596292818","doi":"10.1287/opre.2016.1578","title":"The Impact of Inspection Cost on Equilibrium, Revenue, and Social Welfare in a Single-Server Queue","year":2017,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":109,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false},"ca_institutions":"","funders":"Tel Aviv University; Government of Ontario","keywords":"Unobservable; Computer science; Queue; Revenue; Join (topology); Valuation (finance); Operations research; Mathematical optimization; Microeconomics; Econometrics; Economics; Mathematics; Computer network; Finance","authors":[{"name":"Refael Hassin","is_ca":false},{"name":"Ricky Roet-Green","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.09270631862722876,"gpt":0.4028587003774279,"spread":0.3101523817501992,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002953142,0.0006261488,0.001107738,0.0007580428,0.0007958891,0.002685606,0.001573627,0.001620589,0.004109092],"category_scores_gemma":[0.01384366,0.000426447,0.0008910656,0.0006978199,0.001726604,0.003390913,0.001382113,0.001551502,0.0002024405],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004296592,"about_ca_system_score_gemma":0.002826914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01004935,"about_ca_topic_score_gemma":0.005749612,"domain_scores_codex":[0.998197,0.0006567999,0.00004499491,0.0001626578,0.0001607548,0.0007777576],"domain_scores_gemma":[0.9883828,0.008887999,0.001052645,0.0004286081,0.0005722259,0.0006756885],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008325886,0.0005248368,0.006711247,0.00008085707,0.00005282062,0.0002895494,0.0001528377,0.84852,0.003371192,0.1320975,0.001182456,0.006184035],"study_design_scores_gemma":[0.00007290435,0.0001427176,0.001627767,0.00001322889,0.00002980177,0.00004064609,0.0001411767,0.9644215,0.0007057078,0.03263955,0.000134776,0.00003030484],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9339358,0.0002135416,0.05678312,0.001129035,0.00002924774,0.00006299059,0.0002581218,0.0001130088,0.007475162],"genre_scores_gemma":[0.9963406,0.00007951287,0.002708812,0.00003424261,0.00000772503,0.00001801175,0.00003439965,0.00001150533,0.0007652995],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01004935,"threshold_uncertainty_score":0.03117406,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Ashutosh Nayyar","is_ca":false},{"name":"Aditya Mahajan","is_ca":true},{"name":"Demosthenis Teneketzis","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001158404,0.0006235027,0.0005922435,0.0003788325,0.0004191595,0.001256154,0.0009041607,0.0008631418,0.003608095],"category_scores_gemma":[0.003112778,0.0003738751,0.0003143211,0.000399342,0.001180945,0.001322048,0.001027334,0.0007169351,0.0002410449],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001565421,"about_ca_system_score_gemma":0.001200511,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003843507,"about_ca_topic_score_gemma":0.002018788,"domain_scores_codex":[0.9992793,0.000218813,0.000031479,0.0001516547,0.0001787766,0.000139972],"domain_scores_gemma":[0.9986138,0.0007428338,0.0002227315,0.00009261368,0.0002523245,0.00007558663],"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.0001756063,0.0000628561,0.0004121333,0.00008790756,0.0000303655,0.0001091025,0.00009868041,0.8420196,0.002683142,0.1364197,0.0009945984,0.01690637],"study_design_scores_gemma":[0.00002384191,0.00006219239,0.0001380953,0.000009186711,0.000007326653,0.00001545233,0.00002007663,0.9615349,0.0006131239,0.0371245,0.0004430052,0.000008303991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1371478,0.0002790645,0.8396651,0.0007164106,0.00007249825,0.0001230447,0.0001475601,0.0001092796,0.02173932],"genre_scores_gemma":[0.97869,0.0001006106,0.01746291,0.00004634065,0.00001949019,0.00005469154,0.0000450012,0.00001100058,0.003569908],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003843507,"threshold_uncertainty_score":0.0120703,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2092472841","doi":"10.1287/opre.48.1.26.12456","title":"Stability of Multiclass Queueing Networks Under Priority Service Disciplines","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":107,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"University of British Columbia","funders":"","keywords":"Queueing theory; Stability (learning theory); Layered queueing network; Computer science; Mathematical optimization; Set (abstract data type); Lyapunov function; Service (business); Lyapunov optimization; Queueing system; Mathematics; Computer network; Nonlinear system; Artificial intelligence; Lyapunov equation","authors":[{"name":"Hong Chen","is_ca":true},{"name":"Hanqin Zhang","is_ca":false}],"retraction":null,"screen_n_in":null,"score":{"opus":0.0708570981113848,"gpt":0.3653104677572205,"spread":0.2944533696458357,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002137142,0.000539013,0.0006093081,0.0007152836,0.0009471641,0.001282274,0.000811323,0.0007054019,0.001767825],"category_scores_gemma":[0.01230355,0.0001969563,0.0003366312,0.0003912684,0.001253596,0.002096006,0.001269486,0.001023402,0.0002047192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001290478,"about_ca_system_score_gemma":0.002158152,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005059847,"about_ca_topic_score_gemma":0.002011246,"domain_scores_codex":[0.998461,0.0002868431,0.0000854917,0.0003029161,0.0005137345,0.0003500813],"domain_scores_gemma":[0.9939104,0.003199708,0.001068313,0.000270613,0.001283408,0.0002674616],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0006100515,0.0001344723,0.00436798,0.0003184455,0.00006725273,0.0006633471,0.0008124136,0.6449673,0.07355049,0.2245995,0.00132455,0.04858424],"study_design_scores_gemma":[0.00003157801,0.00008553403,0.0004074281,0.00001507269,0.00001063824,0.00008077597,0.00009395176,0.9527454,0.007360219,0.03842182,0.0007323129,0.00001525692],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3080093,0.0004629506,0.682161,0.0005104836,0.00008886056,0.00007355315,0.0001044625,0.0004055098,0.008183846],"genre_scores_gemma":[0.9821983,0.0001171514,0.01661321,0.00004881729,0.00002491014,0.00004711272,0.00004428676,0.00002066492,0.0008855304],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005059847,"threshold_uncertainty_score":0.01130241,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Itai Gurvich","is_ca":true},{"name":"James Luedtke","is_ca":false},{"name":"Tolga Tezcan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002352254,0.001118423,0.001543953,0.001002286,0.0007358873,0.00174419,0.001863742,0.001742254,0.002432555],"category_scores_gemma":[0.006199859,0.001199159,0.001115927,0.001418056,0.001276712,0.001950295,0.001031672,0.00156012,0.0001749819],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00256876,"about_ca_system_score_gemma":0.002762218,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01389309,"about_ca_topic_score_gemma":0.007138691,"domain_scores_codex":[0.9984754,0.0006453071,0.00005140906,0.0002669613,0.0003090624,0.0002517903],"domain_scores_gemma":[0.9961588,0.002871158,0.0004271164,0.00008544014,0.0002646228,0.0001929843],"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.00001773666,0.000007788572,0.0001272397,0.00001943836,0.00001589948,0.00002476828,0.00001490618,0.9840766,0.0001162692,0.01294549,0.000270063,0.002363841],"study_design_scores_gemma":[0.000007761038,0.000009793791,0.00007724202,0.000005181995,0.000006806629,0.000007756228,0.000008877231,0.9884327,0.00008553713,0.01110979,0.0002401835,0.000008310694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02313707,0.0005079771,0.9712775,0.001229552,0.00006024486,0.00005692158,0.000162241,0.0001164978,0.003452033],"genre_scores_gemma":[0.8062916,0.001154029,0.1863155,0.00031225,0.000305941,0.0003264397,0.0002614284,0.000119335,0.004913424],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01389309,"threshold_uncertainty_score":0.02762449,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"W2128586119","doi":"10.1287/opre.51.6.952.24913","title":"Dynamic Server Allocation for Queueing Networks with Flexible Servers","year":2003,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":104,"is_retracted":false,"has_abstract":true,"routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false},"ca_institutions":"McMaster University","funders":"","keywords":"Server; Layered queueing network; Computer science; Queueing theory; Upper and lower bounds; Independent and identically distributed random variables; Mathematical optimization; Computer network; Routing (electronic design automation); Probabilistic logic; Flexibility (engineering); Distributed computing; Linear programming; Random variable; Mathematics; Algorithm","authors":[{"name":"Sigrún Andradóttir","is_ca":false},{"name":"Hayriye Ayhan","is_ca":false},{"name":"Douglas G. Down","is_ca":true}],"retraction":null,"screen_n_in":null,"score":{"opus":0.04070181517824167,"gpt":0.3374842795450705,"spread":0.2967824643668289,"validation_status":"score_only:v0-immature-baseline"},"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00270985,0.0009319813,0.001142231,0.0007989016,0.000970612,0.001741531,0.001404351,0.001086279,0.001435039],"category_scores_gemma":[0.008402633,0.0007103392,0.0005185137,0.001274156,0.001919843,0.00248046,0.001510465,0.001008205,0.0002748008],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002772491,"about_ca_system_score_gemma":0.001794863,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003626622,"about_ca_topic_score_gemma":0.002711432,"domain_scores_codex":[0.9976878,0.001141033,0.00007539737,0.0002735144,0.0004244995,0.00039773],"domain_scores_gemma":[0.9974211,0.001734357,0.0002917075,0.0002155372,0.0001863383,0.0001509674],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005113342,0.00002284739,0.0001131449,0.00003208933,0.00001415589,0.00003170804,0.00005503721,0.9520967,0.001326259,0.03767204,0.0002905294,0.008294322],"study_design_scores_gemma":[0.000009074705,0.00001536124,0.00002917076,0.000004183138,0.000004535827,0.000009414951,0.00001085769,0.9791809,0.000309096,0.02007434,0.0003468102,0.000006231472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06067975,0.0009206661,0.9340866,0.0002740256,0.00004705875,0.00007210217,0.00003711243,0.0002915813,0.003591156],"genre_scores_gemma":[0.9297047,0.0005409468,0.06782632,0.0000927671,0.00005101769,0.0001589419,0.00004353433,0.00006648761,0.001515387],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003626622,"threshold_uncertainty_score":0.02011597,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null},{"id":"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","authors":[{"name":"Philipp Afèche","is_ca":true},{"name":"J. Michael Pavlin","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005851727,0.0008810275,0.002086067,0.001120377,0.001278763,0.003660916,0.002011674,0.002362879,0.004617517],"category_scores_gemma":[0.01772286,0.001434421,0.001189986,0.001055858,0.002160127,0.004797168,0.002226704,0.002478322,0.0004272505],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005094518,"about_ca_system_score_gemma":0.00299282,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005565838,"about_ca_topic_score_gemma":0.003949717,"domain_scores_codex":[0.9971215,0.001296734,0.0001491664,0.0003266399,0.0002718427,0.0008340558],"domain_scores_gemma":[0.9885642,0.0071898,0.001357504,0.000407447,0.0005949479,0.001886042],"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.001481163,0.0006173674,0.004171559,0.0001595373,0.0001221037,0.0003372332,0.0005281548,0.7408704,0.005743151,0.2246136,0.002737847,0.01861788],"study_design_scores_gemma":[0.000170106,0.0001588861,0.0008208033,0.00002011787,0.00003289963,0.00004214823,0.0001544905,0.9143487,0.0005530363,0.08324049,0.0003940489,0.00006420956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5471109,0.0007332942,0.4400364,0.002465712,0.000121228,0.0004096709,0.0003948448,0.0003777945,0.008350167],"genre_scores_gemma":[0.9713995,0.0002049045,0.02621649,0.0001280655,0.00004060722,0.0001060691,0.00007000785,0.00004066764,0.00179366],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.005851727,"threshold_uncertainty_score":0.03696346,"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","authors":[{"name":"Alexandre Deslauriers","is_ca":true},{"name":"Pierre L’Ecuyer","is_ca":true},{"name":"Juta Pichitlamken","is_ca":false},{"name":"Ármann Ingólfsson","is_ca":true},{"name":"Athanassios N. Avramidis","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002488077,0.001116732,0.002100849,0.0014532,0.001618277,0.004658843,0.003929257,0.004110167,0.02198544],"category_scores_gemma":[0.007849937,0.001850544,0.001346262,0.002343459,0.002617881,0.004294027,0.001731864,0.00330192,0.002248695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00400668,"about_ca_system_score_gemma":0.003028474,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.04392703,"about_ca_topic_score_gemma":0.02371483,"domain_scores_codex":[0.9985865,0.0004212491,0.00004539862,0.0002960664,0.0001720124,0.0004787573],"domain_scores_gemma":[0.9934977,0.004053222,0.0006953742,0.0003223002,0.0006196984,0.0008117825],"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.0002638554,0.0001367672,0.001253201,0.00003498629,0.00004263635,0.0002412302,0.0001744631,0.8432047,0.0006138809,0.1485328,0.002860482,0.002640988],"study_design_scores_gemma":[0.00004235818,0.00002180346,0.0002430301,0.000007454058,0.00001980152,0.00001948717,0.00003191636,0.9797668,0.00007862802,0.01938246,0.0003599678,0.00002627861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4001136,0.001283372,0.5409993,0.0049779,0.0003948084,0.0003401728,0.003125413,0.001173727,0.04759173],"genre_scores_gemma":[0.9479225,0.0006019454,0.009580449,0.000193413,0.0001695297,0.0001998238,0.000716239,0.0001267644,0.04048936],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04392703,"threshold_uncertainty_score":0.08734274,"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)","authors":[{"name":"Ármann Ingólfsson","is_ca":true},{"name":"Fernanda Campello","is_ca":true},{"name":"Xudong Wu","is_ca":false},{"name":"Edgar Alberto Cabral","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005214594,0.0009379198,0.001641401,0.001131541,0.0005959549,0.0009263314,0.00165954,0.0009937031,0.005948457],"category_scores_gemma":[0.0137589,0.0008623584,0.001129381,0.001627596,0.0008128502,0.001868925,0.001104026,0.001838163,0.000768323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001112995,"about_ca_system_score_gemma":0.003039512,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002851692,"about_ca_topic_score_gemma":0.003836966,"domain_scores_codex":[0.9961816,0.002597166,0.00009897506,0.0003651413,0.0004544329,0.0003027118],"domain_scores_gemma":[0.9909639,0.007270351,0.0005338624,0.0005600355,0.0004267123,0.0002451087],"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.0006299364,0.000442945,0.0007136305,0.0001320431,0.00009625938,0.000046959,0.00005144047,0.7936559,0.002489479,0.05068416,0.004337457,0.1467198],"study_design_scores_gemma":[0.00007852093,0.00009035997,0.00007247111,0.000004498998,0.00001364401,0.00001014285,0.00000473414,0.9829742,0.000336852,0.01581044,0.000591186,0.00001303634],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005474411,0.00005481417,0.9927705,0.0001562431,0.0000909322,0.00007606811,0.00003467785,0.0004041146,0.0009381682],"genre_scores_gemma":[0.2232976,0.0001299461,0.7722524,0.0003270472,0.0002045095,0.0004857004,0.0001667911,0.0002621013,0.002873923],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005948457,"threshold_uncertainty_score":0.0275777,"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","authors":[{"name":"Zhe George Zhang","is_ca":true},{"name":"Naishuo Tian","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030889,0.0007921786,0.00182848,0.001073824,0.001857655,0.003322319,0.003513147,0.002313814,0.003944777],"category_scores_gemma":[0.007529172,0.0007136212,0.0006301164,0.001813606,0.001934338,0.00206268,0.002036344,0.002017581,0.0006475143],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003446158,"about_ca_system_score_gemma":0.002354634,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01349948,"about_ca_topic_score_gemma":0.01495018,"domain_scores_codex":[0.9977685,0.0004420417,0.00007873427,0.0004862542,0.000343136,0.0008812613],"domain_scores_gemma":[0.9957581,0.001720173,0.0005484572,0.0005735768,0.0007287243,0.000671002],"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.002169334,0.000382941,0.009401761,0.0002078845,0.0001652723,0.001445126,0.0004341776,0.7711257,0.01149193,0.152464,0.01109757,0.03961437],"study_design_scores_gemma":[0.00007944716,0.00007825529,0.0007110604,0.000003870555,0.00003116954,0.00009441558,0.00004012394,0.9868934,0.0006972012,0.01085727,0.0004885166,0.00002514597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4557852,0.0009788113,0.5280692,0.00341219,0.0009642945,0.000250094,0.0009560519,0.001502017,0.008082197],"genre_scores_gemma":[0.9840748,0.00009950898,0.01205292,0.0002158498,0.0002066624,0.00003600747,0.0001157443,0.00002976934,0.003168635],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01349948,"threshold_uncertainty_score":0.02684176,"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","authors":[{"name":"Van Mieghem","is_ca":true},{"name":"Ali Jan","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002188762,0.001017954,0.001614299,0.000830513,0.0007686371,0.002228652,0.002421101,0.001006755,0.001130509],"category_scores_gemma":[0.009152106,0.0005536824,0.0004686208,0.001427163,0.001423273,0.002386375,0.001169575,0.001675221,0.0002468228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002243617,"about_ca_system_score_gemma":0.002268391,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007990701,"about_ca_topic_score_gemma":0.004645189,"domain_scores_codex":[0.9973056,0.0007198845,0.0001377219,0.0004813558,0.0008566819,0.0004987335],"domain_scores_gemma":[0.9953935,0.002311476,0.0006069223,0.0006106482,0.0007303928,0.0003470501],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008914514,0.00005168396,0.0007468695,0.00005688658,0.00003706389,0.000120669,0.00005709349,0.8870485,0.00162177,0.07022189,0.001045883,0.03890258],"study_design_scores_gemma":[0.00001442409,0.00002750062,0.0001222579,0.000006086184,0.000006777758,0.00004192284,0.000008556416,0.9631811,0.0005245071,0.03529504,0.0007585338,0.00001326404],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07384982,0.000792116,0.9190856,0.0003553601,0.0001343865,0.00009282862,0.00009860958,0.000360372,0.005230886],"genre_scores_gemma":[0.8769103,0.0005921348,0.1189644,0.0001903393,0.000149999,0.0001521295,0.0001433955,0.0001285489,0.002768761],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007990701,"threshold_uncertainty_score":0.01627868,"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","authors":[{"name":"R.N. Ibrahim","is_ca":true},{"name":"Ward Whitt","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002912296,0.001016059,0.001008803,0.001001521,0.0004653811,0.001098184,0.001188304,0.0006825406,0.001074887],"category_scores_gemma":[0.01302522,0.0005632975,0.0005356429,0.001013758,0.000684022,0.001537177,0.0008278736,0.002796636,0.0002902201],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001022747,"about_ca_system_score_gemma":0.002631623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009763695,"about_ca_topic_score_gemma":0.008201618,"domain_scores_codex":[0.999181,0.0002019542,0.00005017024,0.0001258841,0.0002920564,0.0001489796],"domain_scores_gemma":[0.9899353,0.006903945,0.0009982785,0.0003678157,0.00142348,0.0003712781],"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.0001098593,0.000070536,0.003650032,0.00004352722,0.00002350638,0.00003429467,0.00004132594,0.9673632,0.0007548336,0.004149687,0.0005609263,0.02319824],"study_design_scores_gemma":[0.000003616796,0.00001972484,0.0001836061,0.000002286781,0.000003826548,0.00000294738,0.000002421978,0.9986254,0.0003269224,0.0007280554,0.00009616947,0.000005041899],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1051646,0.00106892,0.891405,0.000573962,0.0001649437,0.00004899551,0.0001885956,0.0007195657,0.0006653752],"genre_scores_gemma":[0.9031256,0.0007781089,0.09320115,0.0001116009,0.0001833125,0.0001096458,0.0003451471,0.00006476957,0.002080704],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009763695,"threshold_uncertainty_score":0.01941371,"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","authors":[{"name":"R.N. Ibrahim","is_ca":false},{"name":"Pierre L’Ecuyer","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01191073,0.00191452,0.001854544,0.002066779,0.0007181547,0.002960532,0.003357545,0.002415866,0.002435585],"category_scores_gemma":[0.02526042,0.000976474,0.003352691,0.002584718,0.001064328,0.00280968,0.001217959,0.002732661,0.0005462044],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001956286,"about_ca_system_score_gemma":0.001972234,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.04793677,"about_ca_topic_score_gemma":0.03370712,"domain_scores_codex":[0.9958936,0.002471109,0.0001537301,0.0006544855,0.0003480534,0.0004789163],"domain_scores_gemma":[0.9761006,0.01830999,0.001933115,0.001577046,0.001410943,0.0006683623],"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.0005156993,0.0002749009,0.02703223,0.00004954999,0.0003327436,0.0001226339,0.0001140421,0.9551832,0.000357366,0.006684093,0.0005685007,0.008765061],"study_design_scores_gemma":[0.0000434585,0.0001129174,0.002761145,0.000007529582,0.00009128185,0.0000122723,0.00003545089,0.9942867,0.0001522351,0.002292692,0.0001686331,0.00003576637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7522397,0.0007825986,0.240697,0.001137374,0.0001793331,0.0002159195,0.00220721,0.0006408226,0.001899945],"genre_scores_gemma":[0.962742,0.0004589749,0.0325749,0.0001012633,0.0001057606,0.0001922835,0.001216412,0.00006624044,0.002542064],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.04793677,"threshold_uncertainty_score":0.09531552,"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","authors":[{"name":"Barış Ata","is_ca":true},{"name":"Tava Lennon Olsen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002275143,0.0009606832,0.001414082,0.0005083663,0.0008564742,0.002088393,0.001313509,0.001065874,0.002412724],"category_scores_gemma":[0.009932638,0.0007643372,0.0003775143,0.0008457711,0.001395128,0.001855696,0.00109258,0.001234194,0.00041386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002922809,"about_ca_system_score_gemma":0.002954555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007558436,"about_ca_topic_score_gemma":0.004904056,"domain_scores_codex":[0.9986765,0.0004740727,0.0000501627,0.0001780839,0.0002144982,0.0004067011],"domain_scores_gemma":[0.995205,0.002972485,0.0005889371,0.0003002414,0.0004746041,0.000458764],"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.0001805648,0.00004671845,0.0002976797,0.00002860039,0.000009310352,0.00005020429,0.00004899573,0.9776117,0.000928881,0.01576458,0.000543353,0.004489409],"study_design_scores_gemma":[0.00002432342,0.00002901758,0.00008589503,0.000002887019,0.000004754958,0.00001019635,0.00002453342,0.9899234,0.0004573724,0.009278385,0.0001506436,0.000008537021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.353332,0.0008040617,0.6318455,0.00119462,0.0001694803,0.000126214,0.0002155906,0.0005652151,0.0117473],"genre_scores_gemma":[0.9784759,0.0001418466,0.01943813,0.00005649379,0.0000239459,0.00002914337,0.00003721668,0.00004726575,0.001750079],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007558436,"threshold_uncertainty_score":0.0212065,"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","authors":[{"name":"Ármann Ingólfsson","is_ca":true},{"name":"Md. Amanul Haque","is_ca":true},{"name":"A. Yu. Umnikov","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007619418,0.0010785,0.001226316,0.001223035,0.0009312508,0.002202258,0.003062443,0.001725334,0.002124925],"category_scores_gemma":[0.0312775,0.0008319998,0.0009443508,0.002346181,0.0007708358,0.004194051,0.001299785,0.002693011,0.0003335229],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003059048,"about_ca_system_score_gemma":0.005033689,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01864047,"about_ca_topic_score_gemma":0.01508962,"domain_scores_codex":[0.9973792,0.0009862017,0.0001221543,0.0004055015,0.0006199441,0.000487103],"domain_scores_gemma":[0.9763725,0.01595566,0.002313244,0.002811226,0.001573077,0.0009743292],"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.000112875,0.0001175054,0.005059528,0.00004000374,0.00007679791,0.00006894804,0.00004108188,0.9541301,0.001496151,0.01322214,0.0006733767,0.02496142],"study_design_scores_gemma":[0.000004788192,0.00001542817,0.0005893996,0.000003103577,0.000024374,0.000008646276,0.000005275447,0.9960954,0.0002840885,0.002832373,0.0001301916,0.000007014366],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2504286,0.001860864,0.7406671,0.0009251104,0.000816631,0.00007471548,0.0003029889,0.001095519,0.003828451],"genre_scores_gemma":[0.9704155,0.0005126334,0.02651678,0.000115832,0.0002316551,0.00002589042,0.0001076008,0.0001026242,0.001971466],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01864047,"threshold_uncertainty_score":0.04029578,"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","authors":[{"name":"O. Berman","is_ca":true},{"name":"K.P. Sapna","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002272525,0.0008017409,0.0009929035,0.001013772,0.001506321,0.002959668,0.001424755,0.00133367,0.002046466],"category_scores_gemma":[0.005354878,0.0006141988,0.0009108901,0.00142329,0.001724308,0.003032433,0.001122163,0.001231049,0.0002100294],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003892162,"about_ca_system_score_gemma":0.002394703,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01095673,"about_ca_topic_score_gemma":0.008301395,"domain_scores_codex":[0.9987451,0.0004024969,0.00003825469,0.0001119912,0.0002752668,0.0004268622],"domain_scores_gemma":[0.9984285,0.0008475014,0.0003454874,0.00006555388,0.0001795984,0.0001332413],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001603842,0.00006153248,0.001719862,0.00009073736,0.00005614584,0.0003690055,0.0002016238,0.8956949,0.00512629,0.08636784,0.0007722972,0.009379409],"study_design_scores_gemma":[0.00001978547,0.00007829404,0.0006249102,0.00001771236,0.00003578393,0.00009069085,0.0001601617,0.9644735,0.001062853,0.03279905,0.0006104048,0.00002677766],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3662838,0.001672627,0.620777,0.001297012,0.00007541943,0.000104972,0.0001453878,0.0004114947,0.009232228],"genre_scores_gemma":[0.9809005,0.0004996915,0.01695062,0.00005838105,0.00004987305,0.00003553755,0.00004094776,0.00004071016,0.001423677],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01095673,"threshold_uncertainty_score":0.02823979,"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","authors":[{"name":"Masakiyo Miyazawa","is_ca":false},{"name":"Yiqiang Q. Zhao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002135705,0.0007029055,0.0007815697,0.001461619,0.0007110098,0.001817087,0.001957186,0.001081726,0.002324029],"category_scores_gemma":[0.01426245,0.000406428,0.0005611826,0.0009164731,0.002187005,0.002841213,0.001171529,0.002015635,0.000354651],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00209951,"about_ca_system_score_gemma":0.001090414,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004928222,"about_ca_topic_score_gemma":0.002006954,"domain_scores_codex":[0.9993979,0.0001444057,0.00002000054,0.00009364311,0.0001705715,0.0001734204],"domain_scores_gemma":[0.9952574,0.002473996,0.0006832271,0.0003107788,0.0007457641,0.0005287554],"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.0002983505,0.0001433212,0.0044868,0.0001759289,0.00006028693,0.0008758073,0.0005904163,0.155967,0.01305047,0.8112727,0.00212534,0.01095353],"study_design_scores_gemma":[0.00002664899,0.0000755218,0.001593337,0.00002752946,0.00002943994,0.0001801108,0.00009542963,0.8819077,0.001825029,0.1137183,0.0004828767,0.00003822064],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6378146,0.001034165,0.3478214,0.0009928637,0.00008820132,0.00005863105,0.0001457002,0.0006358943,0.01140848],"genre_scores_gemma":[0.9862704,0.0003870167,0.01059727,0.0001207292,0.00009069359,0.00005425239,0.0001216328,0.00005768157,0.00230048],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.004928222,"threshold_uncertainty_score":0.0152331,"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","authors":[{"name":"Bill Curtis","is_ca":true},{"name":"Sally A. Miller","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006228327,0.001174935,0.0005997342,0.004776645,0.000653207,0.003586074,0.001223797,0.001515763,0.01342519],"category_scores_gemma":[0.02352195,0.00082319,0.000957741,0.006318078,0.0003756325,0.006604563,0.00147671,0.002659072,0.01094182],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002702323,"about_ca_system_score_gemma":0.009138362,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01282852,"about_ca_topic_score_gemma":0.01110783,"domain_scores_codex":[0.9964294,0.0008717449,0.0004744911,0.0001629521,0.001893456,0.0001680212],"domain_scores_gemma":[0.9904791,0.00236513,0.0009669021,0.0004324433,0.005487416,0.0002689981],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00007294811,0.0001581167,0.009564124,0.001437993,0.00007912795,0.00009932823,0.001231699,0.0105372,0.001012411,0.08797724,0.367678,0.5201518],"study_design_scores_gemma":[0.00006440571,0.0001737374,0.0169557,0.002892729,0.0001224754,0.000289979,0.000710283,0.01223655,0.002022646,0.0897051,0.8746957,0.0001306334],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"other","genre_scores_codex":[0.02120426,0.0183628,0.4814669,0.01423467,0.001293233,0.004180428,0.08858034,0.01669708,0.3539803],"genre_scores_gemma":[0.141151,0.0263657,0.5851226,0.001658721,0.0003942006,0.008157508,0.1278759,0.003840783,0.1054335],"genre_candidate":"other","genre_consensus":null,"teacher_disagreement_score":0.01342519,"threshold_uncertainty_score":0.04491168,"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","authors":[{"name":"Gautam Choudhury","is_ca":false},{"name":"Lotfi Tadj","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003070863,0.001411098,0.002446281,0.00152484,0.002342099,0.003838421,0.003386412,0.004455595,0.004316296],"category_scores_gemma":[0.006516572,0.00100951,0.0008198801,0.00231749,0.001879469,0.002308461,0.001658187,0.002141127,0.0005367116],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004132262,"about_ca_system_score_gemma":0.002988853,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01369372,"about_ca_topic_score_gemma":0.009491347,"domain_scores_codex":[0.9984539,0.0003700642,0.00007022741,0.0003291858,0.0002845334,0.0004920508],"domain_scores_gemma":[0.9964328,0.00171786,0.0005309841,0.0001456617,0.0006276213,0.0005450035],"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.002291354,0.0005281921,0.004734839,0.0006303033,0.0001711013,0.004296863,0.0006697014,0.7602827,0.01493399,0.1904695,0.00852606,0.0124654],"study_design_scores_gemma":[0.000169495,0.000178265,0.000695153,0.00001669019,0.00007369655,0.0002181748,0.00008779226,0.9814357,0.0009112603,0.01554972,0.0006143416,0.00004979853],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5545959,0.001889632,0.4194632,0.006592797,0.001152463,0.0004819158,0.001737501,0.0009502409,0.01313645],"genre_scores_gemma":[0.9716466,0.0004341365,0.01808826,0.0004161635,0.0004009768,0.00009206314,0.000208353,0.00005602859,0.008657324],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01369372,"threshold_uncertainty_score":0.02998173,"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","authors":[{"name":"Hong Chen","is_ca":true},{"name":"Murray Z. Frank","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004615328,0.00130628,0.001839746,0.0008106893,0.001416285,0.005434446,0.003672298,0.002838776,0.01045938],"category_scores_gemma":[0.01640237,0.001062141,0.001763904,0.001565515,0.0031726,0.006907337,0.002501289,0.00473594,0.0009432395],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003252347,"about_ca_system_score_gemma":0.002321555,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005064372,"about_ca_topic_score_gemma":0.003359564,"domain_scores_codex":[0.9965933,0.001273482,0.0001117952,0.0006081797,0.0006985954,0.0007146157],"domain_scores_gemma":[0.9873394,0.00802739,0.001374478,0.001379718,0.001141514,0.00073762],"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.000427999,0.0003679711,0.002384456,0.0001439144,0.0001451899,0.0004164016,0.0003642048,0.3287557,0.002256068,0.644291,0.003246044,0.01720104],"study_design_scores_gemma":[0.00007978087,0.0001125452,0.0004580665,0.00001215974,0.00008074832,0.0001137154,0.00004264693,0.8945241,0.0004028635,0.102753,0.00136836,0.00005204597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1518927,0.002641658,0.8116319,0.002618829,0.0008761294,0.0001940138,0.0002990225,0.0004254753,0.02942024],"genre_scores_gemma":[0.9644156,0.001284492,0.01758828,0.0003431801,0.0003916726,0.0000869225,0.00009339415,0.00005953297,0.015737],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01045938,"threshold_uncertainty_score":0.03499013,"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","authors":[{"name":"Douglas G. Down","is_ca":true},{"name":"H. Christian Gromoll","is_ca":false},{"name":"Amber L. Puha","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001511718,0.0007545786,0.000966061,0.001560804,0.000923335,0.002808727,0.001555831,0.00126041,0.001484037],"category_scores_gemma":[0.01215985,0.000489413,0.001110331,0.0007553829,0.002482953,0.002808691,0.002117263,0.001417174,0.0001546631],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002467397,"about_ca_system_score_gemma":0.001306387,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006376959,"about_ca_topic_score_gemma":0.001738585,"domain_scores_codex":[0.998938,0.000238233,0.00005046997,0.0001559281,0.0004003263,0.0002169279],"domain_scores_gemma":[0.9951612,0.002602747,0.0008563118,0.0001785002,0.000761945,0.0004392909],"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.00007220207,0.00005010754,0.0007994118,0.00008771908,0.00003265271,0.0002495545,0.0002993169,0.3100672,0.003878877,0.679388,0.0005315763,0.00454336],"study_design_scores_gemma":[0.00001153869,0.00002372801,0.0001260192,0.00001396829,0.000007811732,0.00003993053,0.00003178688,0.8902331,0.0005190747,0.1083487,0.0006275385,0.00001674923],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2021554,0.002339632,0.7794108,0.001479982,0.0001587579,0.00006650326,0.0001240178,0.0002396245,0.01402531],"genre_scores_gemma":[0.9704264,0.001034689,0.0228295,0.0002074879,0.0001218712,0.0001342345,0.0001056231,0.00006251266,0.005077721],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006376959,"threshold_uncertainty_score":0.01790226,"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","authors":[{"name":"Joseph Milner","is_ca":true},{"name":"Tava Lennon Olsen","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01119992,0.0002664939,0.0005457886,0.0007239346,0.002265036,0.006431009,0.001543768,0.003112223,0.003092875],"category_scores_gemma":[0.05008161,0.0004801528,0.0005355352,0.0009538811,0.006353556,0.004771879,0.002648434,0.003812831,0.0003598258],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006539117,"about_ca_system_score_gemma":0.004801543,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005006345,"about_ca_topic_score_gemma":0.004217674,"domain_scores_codex":[0.9914038,0.00411449,0.0003570822,0.0005565863,0.002554598,0.001013464],"domain_scores_gemma":[0.9833977,0.01126627,0.00152152,0.001321589,0.001507758,0.0009850716],"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.00005823922,0.00003425918,0.001340376,0.00001704954,0.000007086962,0.00008164986,0.0005098471,0.03323614,0.0004043999,0.9558081,0.0008008131,0.00770199],"study_design_scores_gemma":[0.00004637543,0.00004895093,0.0007731369,0.00003740901,0.00000891722,0.00007148326,0.0005816205,0.1932971,0.0004720532,0.7992488,0.005376162,0.00003788996],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5076609,0.001560465,0.3678233,0.01735537,0.0002469517,0.0001970828,0.000145807,0.0003179232,0.1046922],"genre_scores_gemma":[0.9854138,0.0001874134,0.01101701,0.0002714933,0.00005097682,0.00004802083,0.000009366227,0.00002782258,0.002974074],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01119992,"threshold_uncertainty_score":0.05923158,"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","authors":[{"name":"Eman Almehdawe","is_ca":true},{"name":"Beth Jewkes","is_ca":true},{"name":"Qi‐Ming He","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003325497,0.001494499,0.002414232,0.001700967,0.001840981,0.004401843,0.005126802,0.003571205,0.006220785],"category_scores_gemma":[0.009452407,0.001646611,0.001453704,0.002188522,0.00238514,0.0040146,0.001776197,0.003379669,0.001064081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006892944,"about_ca_system_score_gemma":0.005653715,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.05300212,"about_ca_topic_score_gemma":0.02581704,"domain_scores_codex":[0.9976699,0.0004805545,0.0001057771,0.0005321011,0.0004927421,0.0007189452],"domain_scores_gemma":[0.9950943,0.00297563,0.0005203032,0.0002015441,0.0008494644,0.0003588355],"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.0001185612,0.00009851617,0.0008081368,0.00007237504,0.00004953114,0.0003072704,0.0002170439,0.8480421,0.001580559,0.1423357,0.001990232,0.004379948],"study_design_scores_gemma":[0.00001413056,0.00001527981,0.00013351,0.000007537578,0.00001711477,0.00003041938,0.00002287219,0.9879661,0.00008851171,0.01133806,0.000347905,0.0000184902],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09613319,0.001869877,0.8842361,0.002770685,0.0005630865,0.0001952211,0.001015954,0.0005886201,0.0126274],"genre_scores_gemma":[0.9567621,0.001517753,0.02140155,0.0003128366,0.0003355123,0.0001760819,0.0003881168,0.0001282014,0.01897786],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.05300212,"threshold_uncertainty_score":0.1053872,"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","authors":[{"name":"Winfried K. Grassmann","is_ca":true},{"name":"Steve Drekic","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001666651,0.001193401,0.00149899,0.001263781,0.001448266,0.002480455,0.00270105,0.003406261,0.006893178],"category_scores_gemma":[0.005656925,0.001072677,0.001148664,0.001933369,0.001403903,0.002220494,0.00214192,0.002338925,0.001235765],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003354261,"about_ca_system_score_gemma":0.005025056,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01189773,"about_ca_topic_score_gemma":0.00792138,"domain_scores_codex":[0.9993356,0.00009347738,0.00002192838,0.0001073828,0.0002609416,0.0001807369],"domain_scores_gemma":[0.9988513,0.0005289725,0.00009557992,0.00004326459,0.0003229119,0.0001579584],"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.00007262158,0.0000927666,0.000456724,0.0001562094,0.00003555413,0.000299094,0.0002104008,0.7453011,0.003773557,0.2289028,0.005822245,0.01487694],"study_design_scores_gemma":[0.00001156488,0.00001160306,0.00004498349,0.00001151108,0.000009891028,0.00004724622,0.00002383134,0.9828599,0.0001733472,0.01596683,0.0008288598,0.00001046761],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02076924,0.001220116,0.959433,0.001232866,0.0004671055,0.00009816354,0.0001476764,0.0003466344,0.01628516],"genre_scores_gemma":[0.6756743,0.002856876,0.2570833,0.0009489204,0.0009035739,0.0003619219,0.0003183112,0.0004553586,0.0613976],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01189773,"threshold_uncertainty_score":0.02433699,"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","authors":[{"name":"Merve Bodur","is_ca":true},{"name":"James Luedtke","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002091069,0.001116555,0.001304644,0.0006529702,0.0005251717,0.001279601,0.0007202722,0.0009193907,0.001977222],"category_scores_gemma":[0.003370037,0.0007017663,0.001109515,0.001048702,0.0007559083,0.0009899357,0.0008344559,0.001777259,0.0001764399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001609861,"about_ca_system_score_gemma":0.001808305,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005302697,"about_ca_topic_score_gemma":0.003754476,"domain_scores_codex":[0.999025,0.0004892324,0.00002961598,0.0001061213,0.0001966486,0.0001533417],"domain_scores_gemma":[0.9986125,0.0009112004,0.0002058193,0.00005840423,0.0001360185,0.00007595985],"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.0000296724,0.00001690215,0.0001600586,0.00002838942,0.0000142128,0.00002711819,0.00001591813,0.9847704,0.0004526462,0.008739446,0.0002547794,0.005490434],"study_design_scores_gemma":[0.000003413068,0.000009228432,0.00003642047,0.000002962817,0.000002992495,0.000004042179,0.000004820092,0.9957873,0.0001182246,0.003903572,0.000124756,0.000002221129],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02412285,0.0003231619,0.9722022,0.0002387086,0.00005158523,0.00004113352,0.00007171385,0.00009266436,0.002855934],"genre_scores_gemma":[0.6183477,0.0006463467,0.3765671,0.0001473086,0.00009121362,0.0002270716,0.0001873132,0.000116874,0.00366905],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005302697,"threshold_uncertainty_score":0.01168042,"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","authors":[{"name":"Yanzhe Lei","is_ca":true},{"name":"Stefanus Jasin","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003203945,0.001718237,0.001512611,0.0007200883,0.0006126912,0.002230183,0.002050615,0.001821765,0.003061003],"category_scores_gemma":[0.006449813,0.0009418609,0.001198535,0.001085838,0.001760661,0.003517647,0.001197119,0.002823272,0.0002667374],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003036146,"about_ca_system_score_gemma":0.002072493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005450836,"about_ca_topic_score_gemma":0.004170676,"domain_scores_codex":[0.9981559,0.000762125,0.0000672168,0.0002491469,0.0004665099,0.0002990307],"domain_scores_gemma":[0.9973265,0.001838878,0.000246697,0.0001268596,0.0003397702,0.0001212927],"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.0001246957,0.0001381777,0.0002365011,0.0001194174,0.00006618933,0.0001082345,0.00008403404,0.8463792,0.001775949,0.1340842,0.002127675,0.01475572],"study_design_scores_gemma":[0.00001207499,0.00002754844,0.0000406926,0.000005310675,0.000006943422,0.00001006993,0.00000948373,0.9864178,0.0002128921,0.01279402,0.0004536666,0.000009501546],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01413509,0.0008225737,0.9794159,0.0008325414,0.0001959664,0.00007583481,0.0000322257,0.0000952438,0.004394647],"genre_scores_gemma":[0.9022818,0.001356379,0.0899405,0.000388848,0.0003320627,0.0001496265,0.0000591469,0.00009329984,0.00539837],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005450836,"threshold_uncertainty_score":0.02202886,"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","authors":[{"name":"Gad Allon","is_ca":true},{"name":"Achal Bassamboo","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.007570951,0.0007404601,0.0008326593,0.0008186034,0.001272008,0.003803094,0.001533063,0.003123954,0.01006434],"category_scores_gemma":[0.08496747,0.0006523525,0.0005402644,0.0006549722,0.001672442,0.004334572,0.001854283,0.004049808,0.0006671323],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00390682,"about_ca_system_score_gemma":0.002312138,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01209318,"about_ca_topic_score_gemma":0.004976604,"domain_scores_codex":[0.9944903,0.002320969,0.0002150189,0.0006195649,0.001011532,0.001342645],"domain_scores_gemma":[0.8466384,0.1268507,0.01238031,0.004199157,0.005886294,0.004045213],"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.006590107,0.00164635,0.03513714,0.0005210299,0.0002661301,0.003458013,0.001084372,0.6723939,0.02241527,0.1675482,0.009911243,0.07902831],"study_design_scores_gemma":[0.0008991055,0.003802297,0.03377133,0.0001784753,0.0006289507,0.001648393,0.003478997,0.8096583,0.01937824,0.1160981,0.01003462,0.0004232166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9227902,0.001648293,0.03089069,0.005882655,0.0003778861,0.00009218779,0.0004259073,0.0003572803,0.03753484],"genre_scores_gemma":[0.9983188,0.0001671525,0.0006209621,0.0000824738,0.0000399682,0.000005613093,0.00002442494,0.00001427006,0.0007262781],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01209318,"threshold_uncertainty_score":0.04003948,"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","authors":[{"name":"Ignacio Castillo","is_ca":true},{"name":"Ármann Ingólfsson","is_ca":true},{"name":"Thaddeus Sim","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002158174,0.001091674,0.001415509,0.001217249,0.001304251,0.002469167,0.00170545,0.002643776,0.008336511],"category_scores_gemma":[0.007898943,0.001085179,0.001125805,0.001014406,0.002109426,0.002657279,0.001926019,0.001297301,0.00045352],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.005406059,"about_ca_system_score_gemma":0.002811233,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01561809,"about_ca_topic_score_gemma":0.01222416,"domain_scores_codex":[0.9981716,0.0009153776,0.00003877193,0.0001945345,0.0001121125,0.0005676406],"domain_scores_gemma":[0.9961261,0.002312247,0.0005591627,0.0001694758,0.0002688363,0.0005641726],"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.0003456374,0.0001517228,0.00111995,0.00007858959,0.00006932651,0.0002811295,0.00008190524,0.9046937,0.0006518734,0.08695733,0.002038577,0.003530296],"study_design_scores_gemma":[0.000169883,0.0001103587,0.0007925209,0.00002632564,0.00004016195,0.00006173804,0.0003091731,0.9509096,0.0004425424,0.04600146,0.001098484,0.00003770434],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7583771,0.0004765411,0.200862,0.004126906,0.00009300596,0.0003138964,0.001169765,0.0001994202,0.03438133],"genre_scores_gemma":[0.9813622,0.0001860178,0.01533468,0.00008128735,0.00002176986,0.0001159256,0.0001271167,0.00002937072,0.00274171],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01561809,"threshold_uncertainty_score":0.03922385,"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","authors":[{"name":"Achal Bassamboo","is_ca":true},{"name":"Assaf Zeevi","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004530386,0.001047804,0.0013494,0.001031462,0.0006071719,0.001227478,0.002548245,0.001595881,0.00332542],"category_scores_gemma":[0.01023371,0.0008569864,0.0007729878,0.001224861,0.001135027,0.001433748,0.001605353,0.00216469,0.0004622399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002129424,"about_ca_system_score_gemma":0.002809869,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006028769,"about_ca_topic_score_gemma":0.004521883,"domain_scores_codex":[0.9987711,0.0005663567,0.00004298824,0.000146558,0.0003781528,0.00009477318],"domain_scores_gemma":[0.9946779,0.003876895,0.0003162689,0.0002309065,0.0006994712,0.0001986444],"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.00005509543,0.00005672651,0.0002104183,0.00005334357,0.00001523774,0.00003843238,0.00004044761,0.97009,0.0007155979,0.01109917,0.0004436194,0.0171818],"study_design_scores_gemma":[0.0000103517,0.000009140247,0.00001436241,0.000003662829,0.00000154218,0.00000373752,0.000002845007,0.9969674,0.0001161242,0.00266881,0.0001986478,0.000003477276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.003643401,0.00007545689,0.995376,0.0001250172,0.00002065985,0.00006612219,0.00003511244,0.0001303737,0.0005278939],"genre_scores_gemma":[0.2794229,0.0002378804,0.7167969,0.0002365643,0.0001238731,0.000697977,0.0002376601,0.0001858846,0.002060408],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006028769,"threshold_uncertainty_score":0.02395928,"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","authors":[{"name":"Douglas G. Down","is_ca":true},{"name":"Ger Koole","is_ca":false},{"name":"Mark Edward Lewis","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002344036,0.001196376,0.001971364,0.0009137883,0.001205126,0.003654538,0.002734104,0.001651843,0.002013836],"category_scores_gemma":[0.006681556,0.0007048458,0.000661011,0.0009851543,0.002371141,0.001361141,0.001669262,0.001785469,0.0002606614],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002587827,"about_ca_system_score_gemma":0.002026785,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02062512,"about_ca_topic_score_gemma":0.007533738,"domain_scores_codex":[0.998562,0.0003073549,0.00007274641,0.0003466096,0.0002829038,0.0004283257],"domain_scores_gemma":[0.9961281,0.002105416,0.000510255,0.0001907777,0.0006011497,0.0004643135],"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.0004877851,0.0001096092,0.0008479374,0.00006470345,0.00005043013,0.0003188547,0.0001499381,0.9665468,0.006686832,0.01802147,0.0005469299,0.006168813],"study_design_scores_gemma":[0.00001740598,0.00002821024,0.0001645629,0.000002202635,0.00001080079,0.00001282228,0.000008702513,0.9977592,0.0002476959,0.001670186,0.00006989983,0.000008234103],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5536567,0.0009929205,0.4330953,0.001758419,0.0004934972,0.0001058475,0.0002078686,0.000865688,0.008823764],"genre_scores_gemma":[0.9959856,0.00009376121,0.001883483,0.00003351318,0.00003600511,0.00001495692,0.00001885958,0.00001607885,0.001917883],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.02062512,"threshold_uncertainty_score":0.04101014,"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","authors":[{"name":"Melanie Rubino","is_ca":false},{"name":"Barış Ata","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001669237,0.0008925272,0.00108862,0.0003904756,0.001414766,0.002054406,0.001423585,0.001089188,0.00290591],"category_scores_gemma":[0.00342098,0.000395336,0.000421801,0.0005155735,0.001546419,0.000974976,0.001493842,0.001303971,0.0002410725],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001861041,"about_ca_system_score_gemma":0.002809973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02400151,"about_ca_topic_score_gemma":0.00880794,"domain_scores_codex":[0.9989607,0.000242936,0.00004282951,0.0002055266,0.0002589896,0.0002888626],"domain_scores_gemma":[0.997983,0.0009594628,0.0003306626,0.00009661265,0.000263225,0.0003670434],"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.0002362161,0.0001328492,0.0005066231,0.00003298861,0.00001559061,0.0001944904,0.00008568761,0.9793873,0.003172349,0.01185277,0.0005249986,0.003858083],"study_design_scores_gemma":[0.00002965906,0.00004196226,0.0001304324,0.000001248933,0.000004588472,0.00000921291,0.00001874625,0.9974239,0.0002444475,0.001936291,0.0001515226,0.000007975056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4771971,0.0002646303,0.5066473,0.001587543,0.0002290821,0.000253907,0.0002447052,0.0006472412,0.01292839],"genre_scores_gemma":[0.9922281,0.00006527912,0.004761273,0.000043035,0.00002250895,0.00004489778,0.00003507989,0.0000122233,0.002787572],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02400151,"threshold_uncertainty_score":0.04772359,"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","authors":[{"name":"Attahiru Sule Alfa","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00483828,0.001725854,0.003184984,0.001999076,0.001951766,0.006963143,0.006599531,0.0049858,0.01331719],"category_scores_gemma":[0.015904,0.002162796,0.00170021,0.003425461,0.003697818,0.008364978,0.002603426,0.004241299,0.001736075],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.006625258,"about_ca_system_score_gemma":0.003306865,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02812234,"about_ca_topic_score_gemma":0.01554893,"domain_scores_codex":[0.9970224,0.001253461,0.0001204728,0.0004303022,0.0004100783,0.000763223],"domain_scores_gemma":[0.9900284,0.006861929,0.0008707776,0.0003918779,0.000973067,0.0008738969],"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.00008768263,0.000095832,0.0007670967,0.00009798435,0.00004868786,0.0001502499,0.0002804058,0.3766287,0.0002849126,0.612918,0.00502029,0.003620199],"study_design_scores_gemma":[0.00002664631,0.00001723922,0.0001335206,0.00001537185,0.00002117488,0.00002692377,0.00007056294,0.8961123,0.00004269621,0.1021655,0.001348258,0.00001969504],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1071682,0.005665718,0.8357952,0.007949425,0.001119322,0.0001983477,0.00157163,0.000660527,0.03987169],"genre_scores_gemma":[0.9180622,0.00318412,0.02121705,0.0007116914,0.0007626649,0.0002952747,0.0007712289,0.0002534113,0.05474229],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.02812234,"threshold_uncertainty_score":0.05591726,"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","authors":[{"name":"Yoav Kerner","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00390766,0.000619303,0.001565737,0.002014459,0.002312594,0.004395706,0.00323844,0.002679022,0.01596884],"category_scores_gemma":[0.01452573,0.0009283667,0.001218861,0.001149192,0.001980182,0.003900062,0.002112528,0.002358994,0.001563009],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003172137,"about_ca_system_score_gemma":0.002643833,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005577312,"about_ca_topic_score_gemma":0.00574984,"domain_scores_codex":[0.9979061,0.0005487295,0.00008779478,0.0003098208,0.000321754,0.0008257438],"domain_scores_gemma":[0.9886104,0.007825579,0.0007866231,0.0004960735,0.0008892089,0.001392066],"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.001058889,0.0005943104,0.004913144,0.000172165,0.00006997167,0.0004742091,0.001156156,0.261192,0.008422538,0.6974829,0.009355131,0.01510842],"study_design_scores_gemma":[0.0001243295,0.0001469156,0.001350912,0.00002689918,0.00004651247,0.0001403031,0.0003441683,0.8739599,0.001638589,0.1212405,0.0009077444,0.00007307362],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.6697949,0.0002338025,0.2930239,0.002339007,0.0001638451,0.0003890122,0.0007563371,0.0007986109,0.0325006],"genre_scores_gemma":[0.9635685,0.0001602814,0.02316926,0.0002139705,0.00007646814,0.0002043106,0.0002392566,0.0001746921,0.01219322],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01596884,"threshold_uncertainty_score":0.05342108,"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","authors":[{"name":"Zhe G. Zhang","is_ca":false},{"name":"Naishuo Tian","is_ca":false}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004002023,0.001141881,0.001594199,0.001380382,0.001326635,0.002627461,0.002526788,0.001238775,0.003665237],"category_scores_gemma":[0.01255611,0.0008727147,0.001087759,0.001167739,0.002120637,0.00296673,0.001467545,0.001585437,0.0003023363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003841379,"about_ca_system_score_gemma":0.003098015,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009725398,"about_ca_topic_score_gemma":0.004551978,"domain_scores_codex":[0.9983272,0.0004932396,0.00007220083,0.0002353855,0.000399546,0.0004724581],"domain_scores_gemma":[0.9909297,0.006432215,0.000654871,0.0003278159,0.0009673559,0.0006880704],"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.0001989803,0.0001122296,0.001875456,0.0001126626,0.00009317583,0.0003176276,0.000289889,0.7148907,0.004215152,0.2693954,0.001969413,0.0065293],"study_design_scores_gemma":[0.000008326078,0.00001546906,0.000252059,0.000003430403,0.00001365389,0.00002376416,0.00002531413,0.9810376,0.0001745645,0.01827455,0.0001634729,0.000007768371],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.273968,0.001423956,0.7123613,0.001695429,0.0002038909,0.0001238487,0.0002849651,0.0003350449,0.009603477],"genre_scores_gemma":[0.9833223,0.000355523,0.01205044,0.00009312126,0.0001874822,0.00005481317,0.0001022891,0.00007015981,0.003764015],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009725398,"threshold_uncertainty_score":0.02787131,"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","authors":[{"name":"Shahram Shah‐Heydari","is_ca":true},{"name":"Tho Le‐Ngoc","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001837335,0.001150896,0.00131157,0.001259014,0.001076709,0.002303907,0.003082587,0.002465667,0.006242501],"category_scores_gemma":[0.00809767,0.0007957785,0.0009598575,0.001844174,0.001053817,0.003118534,0.001245909,0.002205896,0.001040606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003414327,"about_ca_system_score_gemma":0.001483128,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01358344,"about_ca_topic_score_gemma":0.008246835,"domain_scores_codex":[0.9991953,0.0002342972,0.00003133486,0.0001018331,0.0002423922,0.0001949351],"domain_scores_gemma":[0.9968004,0.002037283,0.0002540483,0.0001846546,0.0005817282,0.0001417769],"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.0000392253,0.00004183651,0.0003894617,0.00005373318,0.00001832737,0.0001193863,0.00009523285,0.7192271,0.0005631874,0.2669491,0.004093034,0.008410299],"study_design_scores_gemma":[0.000003202516,0.000003911737,0.00003987225,0.000003408401,0.000004870297,0.00001304323,0.0000073116,0.9716946,0.00005237251,0.02766803,0.0005053773,0.000003861558],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04529379,0.001931694,0.9267325,0.00261073,0.0003358898,0.00009162886,0.0007279651,0.0004696049,0.02180619],"genre_scores_gemma":[0.8904237,0.003184977,0.05580281,0.0004982822,0.0007635851,0.0003165837,0.0005916209,0.0002820949,0.04813631],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01358344,"threshold_uncertainty_score":0.02700871,"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","authors":[{"name":"Quan‐Lin Li","is_ca":true},{"name":"Yu Ying","is_ca":false},{"name":"Yiqiang Q. Zhao","is_ca":true}],"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004767721,0.001218443,0.002560897,0.001561027,0.002910775,0.004109855,0.004504072,0.004481736,0.008315275],"category_scores_gemma":[0.007779288,0.001228351,0.001038893,0.002553885,0.001895708,0.002701311,0.002110534,0.002669813,0.001150295],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003782975,"about_ca_system_score_gemma":0.003852361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01912039,"about_ca_topic_score_gemma":0.01037838,"domain_scores_codex":[0.9977565,0.000540238,0.0001525444,0.0004973813,0.0003649406,0.0006882963],"domain_scores_gemma":[0.9947792,0.002110198,0.000520076,0.0005215616,0.001009582,0.001059397],"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.003133969,0.0006260205,0.004471015,0.0002894713,0.0001606501,0.002483233,0.0003639147,0.8731517,0.01175519,0.06505109,0.01185105,0.02666272],"study_design_scores_gemma":[0.00007605936,0.0001418866,0.0003966795,0.000008124937,0.00003991891,0.0001119711,0.00005209288,0.991429,0.0007450964,0.006589832,0.0003796838,0.00002975316],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5503896,0.001683826,0.4228206,0.005835362,0.001263715,0.0005252855,0.001755158,0.002826631,0.01289974],"genre_scores_gemma":[0.9601988,0.0002849417,0.02813577,0.0003090854,0.000260905,0.00007370634,0.0002375128,0.00009032575,0.01040899],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.01912039,"threshold_uncertainty_score":0.03801823,"prediction_status":"machine_predicted_unvalidated"},"labels":[],"label_agreement":null}]}