{"meta":{"query_hash":"8d2dff47989e","filters":{"topic":"Advanced Queuing Theory Analysis"},"cohort_total":777,"direct_labels_cover":1,"predictions_cover":777,"exported":777,"export_cap":100000,"truncated":false,"label_status":"direct model label, unvalidated","prediction_status":"machine_predicted_unvalidated (Codex and Gemma teacher distillation)","score_status":"score_only:v0-immature-baseline","snapshot":{"source":"OpenAlex, pinned release, all 482 partitions","release":"2026-06-24","frame_built":"2026-07-12"},"permalink":"https://metacan.xera.ac/q/8d2dff47989e","api":"https://metacan.xera.ac/api/v1/cohort?topic=Advanced+Queuing+Theory+Analysis"},"results":[{"id":"W1002640774","doi":"10.1007/s12351-015-0190-0","title":"Some analysis results associated with the optimization problem for a discrete-time finite-buffer NT-policy queue","year":2015,"lang":"en","type":"article","venue":"Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China","keywords":"Computational intelligence; Queue; Buffer (optical fiber); Computer science; Mathematical optimization; Mathematics; Artificial intelligence; Computer network","score_opus":0.0585801835029579,"score_gpt":0.34571595907665564,"score_spread":0.28713577557369774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1002640774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09340426,0.000408478,0.49031886,0.3294554,0.00019918206,0.009683719,0.0008348804,0.00087751827,0.07481768],"genre_scores_gemma":[0.9680565,0.000006170565,0.0036375609,0.0014128737,0.0018722364,0.0005353266,0.0031939214,0.000059667647,0.02122575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976102,0.0001826384,0.00029769714,0.00042293887,0.0010550666,0.00043144464],"domain_scores_gemma":[0.99585867,0.001142841,0.00015196807,0.00036025327,0.002448886,0.000037404574],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004926324,0.00016120313,0.00024163052,0.0007981724,0.0007920089,0.00074517913,0.0004027553,0.00007567829,0.000096912125],"category_scores_gemma":[0.007817489,0.000103687285,0.000110406465,0.003907361,0.00018197532,0.0014192774,0.0001697512,0.00023046404,0.00012332703],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004709698,0.00006563832,0.0001411385,0.000007615856,0.00040180166,0.0000016057439,0.0000991382,0.9104776,0.00003641813,0.08229219,0.005924075,0.00008180612],"study_design_scores_gemma":[0.0010830266,0.000049247516,0.00017697294,0.000022280936,0.00024169142,1.6524423e-7,0.00019504898,0.97565484,0.000021735545,0.014667546,0.00769773,0.00018972096],"about_ca_topic_score_codex":0.0003498261,"about_ca_topic_score_gemma":0.00034328073,"teacher_disagreement_score":0.8746522,"about_ca_system_score_codex":0.00020941625,"about_ca_system_score_gemma":0.00028805528,"threshold_uncertainty_score":0.9358829},"labels":[],"label_agreement":null},{"id":"W1136862827","doi":"10.71781/10462","title":"Simulation de centres de contacts","year":2009,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Java; Set (abstract data type); Variance (accounting); Center (category theory); Estimator; Interface (matter); Operating system; Programming language","score_opus":0.021094730063621975,"score_gpt":0.31117769236472315,"score_spread":0.2900829623011012,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1136862827","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8890259,0.0009556277,0.004921408,0.00071759603,0.0005118227,0.0009369614,0.0000142263625,0.000017663577,0.10289875],"genre_scores_gemma":[0.964827,0.000023810113,0.0040476094,0.0004904527,0.00069863204,0.000009663758,0.0012658963,0.000048680362,0.028588234],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982707,0.00007271908,0.00043401163,0.0004982049,0.00020866549,0.000515687],"domain_scores_gemma":[0.99838954,0.00026357002,0.0006991167,0.00031713006,0.00029277924,0.000037876158],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0006963513,0.00035866868,0.00044015882,0.00023828016,0.00037757607,0.0012208181,0.0006630069,0.0002921384,0.0047987746],"category_scores_gemma":[0.0009956994,0.00041300897,0.00016067077,0.00044660928,0.00003123216,0.0020509197,0.00010754833,0.00027171252,0.002056995],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005124139,0.00025402193,0.005427387,0.00018694841,0.00022129947,0.00009788732,0.0011935001,0.6336994,0.0011531359,0.0029212723,0.0003163726,0.35401636],"study_design_scores_gemma":[0.0012515746,0.000028901894,0.011543827,0.0014473305,0.0019121288,0.0000016458156,0.003678218,0.57542056,0.0020622248,0.01221009,0.38929167,0.0011517828],"about_ca_topic_score_codex":0.0010605503,"about_ca_topic_score_gemma":0.0034799853,"teacher_disagreement_score":0.38897532,"about_ca_system_score_codex":0.00024037046,"about_ca_system_score_gemma":0.00012746439,"threshold_uncertainty_score":0.99983215},"labels":[],"label_agreement":null},{"id":"W1469087774","doi":"10.1007/s10288-015-0295-6","title":"A simple method to obtain the stochastic decomposition structure of the busy period in Geo/Geo/1/N vacation queue","year":2015,"lang":"en","type":"article","venue":"4OR","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"National Natural Science Foundation of China","keywords":"Correctness; Simple (philosophy); Computer science; Queue; Reliability (semiconductor); Period (music); Mathematics; Mathematical optimization; Applied mathematics; Algorithm; Computer network","score_opus":0.013834237448849592,"score_gpt":0.29374607956287,"score_spread":0.2799118421140204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1469087774","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8349398,0.00003160191,0.16213153,0.0021374293,0.00011469883,0.00038329687,0.0000058676624,0.000033502314,0.00022229739],"genre_scores_gemma":[0.9970939,1.0561775e-7,0.0016164923,0.00095837296,0.00022718064,0.000016214764,0.000016131542,0.000014494156,0.000057066052],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991873,0.0000792887,0.00021080486,0.00017619455,0.00019171838,0.00015468174],"domain_scores_gemma":[0.99924767,0.000081475075,0.00018271587,0.00032350025,0.00015404637,0.000010593192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005917315,0.00010971197,0.00015315581,0.00012870065,0.00011385738,0.00006235989,0.0003103527,0.00004186526,0.00005066348],"category_scores_gemma":[0.00042665753,0.00006877026,0.00005579747,0.00079828483,0.000028394927,0.00029400157,0.00015284083,0.000117117816,0.000018430856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000252269,0.00008874792,0.004419666,0.00009705276,0.00007181817,0.0000023009673,0.0023852957,0.8825068,0.026590476,0.06698136,0.00091954885,0.015684674],"study_design_scores_gemma":[0.0018684984,0.000049258622,0.05448481,0.00021543316,0.0005228656,0.000010024753,0.011427559,0.32853588,0.0037077777,0.58633554,0.012038958,0.0008034136],"about_ca_topic_score_codex":0.0005520174,"about_ca_topic_score_gemma":0.00073323946,"teacher_disagreement_score":0.55397093,"about_ca_system_score_codex":0.00006155248,"about_ca_system_score_gemma":0.000022659933,"threshold_uncertainty_score":0.280437},"labels":[],"label_agreement":null},{"id":"W1484666374","doi":"10.1023/a:1017975331468","title":"Perturbation Theory for the Asymptotic Decay Rates in the Queues with Markovian Arrival Process and/or Markovian Service Process – Correction","year":2001,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Mathematics","score_opus":0.01254046748760409,"score_gpt":0.25532031781259557,"score_spread":0.24277985032499147,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1484666374","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95609313,0.00086687173,0.025474334,0.0038809907,0.001081981,0.0037517522,0.000003417191,0.00041454803,0.008432957],"genre_scores_gemma":[0.9962369,0.0000139640415,0.000013492017,0.0008722194,0.0008034352,0.0005460913,0.000018715076,0.000050701565,0.0014444463],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984479,0.00014868847,0.0003592208,0.00039758818,0.00030199383,0.00034461913],"domain_scores_gemma":[0.9979327,0.0010176023,0.00038632096,0.00032084316,0.00032912256,0.00001342913],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021359152,0.00027595277,0.00028276423,0.0002147797,0.0006179611,0.000624361,0.00041379165,0.00008001389,0.000017896506],"category_scores_gemma":[0.0003468769,0.00014249535,0.00004707807,0.0012197266,0.00007582793,0.0012011988,0.000030465242,0.00018666132,0.000010235565],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.015093769,0.00081520854,0.12705521,0.013735696,0.0012076196,0.00015676169,0.026244365,0.5278677,0.00041535034,0.2417833,0.0012675093,0.044357534],"study_design_scores_gemma":[0.0015672245,0.000082958024,0.0029129365,0.0016429551,0.0005720127,0.00014359932,0.07093344,0.895857,0.00007689187,0.019731438,0.0056587346,0.0008208126],"about_ca_topic_score_codex":0.00045253598,"about_ca_topic_score_gemma":0.0017498417,"teacher_disagreement_score":0.36798933,"about_ca_system_score_codex":0.000051819945,"about_ca_system_score_gemma":0.000040180134,"threshold_uncertainty_score":0.6020727},"labels":[],"label_agreement":null},{"id":"W1485325230","doi":"10.1002/0471643505.ch6","title":"The M/G/1 Queue: Imbedded Markov Chains","year":2004,"lang":"en","type":"other","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Markov chain; Burke's theorem; Queue; Laplace transform; Computer science; Topology (electrical circuits); Mathematics; Applied mathematics; Discrete mathematics; Algorithm; Queue management system; Combinatorics; Computer network; Fork–join queue; Statistics; Mathematical analysis","score_opus":0.006708383586150913,"score_gpt":0.22154663354331633,"score_spread":0.2148382499571654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1485325230","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005624049,0.00045848478,0.003075962,0.0011115697,0.00050824333,0.00025826707,0.0000023855368,0.00082184235,0.9937576],"genre_scores_gemma":[0.0008096035,0.000099885925,0.00034860964,0.0020752288,0.0031712272,0.00003056728,0.000041268704,0.00051541586,0.9929082],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9987475,0.000012987667,0.00023083226,0.00037590982,0.00026085915,0.00037187446],"domain_scores_gemma":[0.9987864,0.000055497356,0.00038076827,0.00071776053,0.000049465038,0.000010144383],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00033909222,0.00034201168,0.00030532372,0.0003030466,0.00025044518,0.0002863227,0.0005985554,0.00018174577,0.008832166],"category_scores_gemma":[0.00014187279,0.0002209204,0.00020073271,0.00047706647,0.00013936567,0.00017651233,0.00021631636,0.00022248941,0.0032051797],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012243088,0.000020984768,0.000015522233,0.00006897203,0.00015081912,0.0000110960955,0.0000032308324,0.00006184258,0.000004211781,0.40419337,0.58946186,0.0059958594],"study_design_scores_gemma":[0.00019837116,0.0000013828943,0.0000060114894,0.000089792615,0.00012265918,5.665225e-7,0.00006878718,0.00032238069,0.0000023827183,0.019859493,0.9790061,0.0003220429],"about_ca_topic_score_codex":0.0009841756,"about_ca_topic_score_gemma":0.003363465,"teacher_disagreement_score":0.38954428,"about_ca_system_score_codex":0.000051192605,"about_ca_system_score_gemma":0.000023830326,"threshold_uncertainty_score":0.99757093},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.031963002252674275,"score_gpt":0.2595972951370367,"score_spread":0.22763429288436243,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1486673646","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6673067,0.004914426,0.10427697,0.0035187113,0.001024032,0.005229959,0.000037049416,0.0036706678,0.21002147],"genre_scores_gemma":[0.99428725,0.000045938577,0.0019453281,0.00032057412,0.0004367687,0.0002475793,0.00013609097,0.000037824604,0.0025426182],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990479,0.00003563484,0.00037062968,0.00020316786,0.000130702,0.0002119755],"domain_scores_gemma":[0.998596,0.00016952924,0.00020368556,0.00086834846,0.0001512734,0.000011131291],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00063352246,0.000138157,0.00022972918,0.00014989292,0.00027047694,0.0001635624,0.0005915627,0.0000654629,0.0002387156],"category_scores_gemma":[0.00005542183,0.0001364935,0.00010294015,0.0003573386,0.00004099896,0.0010117565,0.000043378815,0.00009277593,0.0006387958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000072884,0.000113549686,0.000029863757,0.00013070024,0.00007134312,3.4270352e-7,0.00018787246,0.85125726,0.00012261287,0.036536757,0.0028209565,0.10865586],"study_design_scores_gemma":[0.0003439154,0.000003147613,0.000016424789,0.000029787852,0.000043969565,8.761729e-7,0.00017234145,0.8257892,0.0000050235144,0.002928142,0.17050762,0.00015955063],"about_ca_topic_score_codex":0.00011589618,"about_ca_topic_score_gemma":0.00003364931,"teacher_disagreement_score":0.32698056,"about_ca_system_score_codex":0.000038493687,"about_ca_system_score_gemma":0.000008071578,"threshold_uncertainty_score":0.821064},"labels":[],"label_agreement":null},{"id":"W1487084994","doi":"10.1002/0471643505.ch3","title":"Application of Birth and Death Processes to Queueing Theory","year":2004,"lang":"en","type":"other","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Queueing theory; Poisson distribution; Exponential distribution; Computer science; Layered queueing network; Birth–death process; Probability theory; Process (computing); Applied mathematics; Mathematics; Statistics; Computer network","score_opus":0.006881425613026296,"score_gpt":0.22867570034248502,"score_spread":0.22179427472945873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1487084994","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00029200764,0.0004566104,0.2529552,0.000090956455,0.000026053483,0.00039197793,0.0000032512162,0.00035250204,0.7454314],"genre_scores_gemma":[0.28886595,0.00011259269,0.008890496,0.0023789585,0.0015952585,0.0001424359,0.000062247425,0.00081366504,0.6971384],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993218,0.000005092776,0.0001551572,0.00028432542,0.00011328967,0.00012031039],"domain_scores_gemma":[0.99939,0.000032938548,0.0002628276,0.00023661535,0.000069317066,0.000008316457],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017871852,0.00017489458,0.00025051532,0.000468414,0.00003502068,0.000040781113,0.00015951815,0.000080774094,0.00057704095],"category_scores_gemma":[0.0001308088,0.00014916243,0.000030870673,0.00048674652,0.000028287952,0.000162206,0.000104506704,0.000052736497,0.000119407145],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003363751,0.000047707854,0.0012904148,0.0026288594,0.00010604572,0.0000014863142,0.00003036077,0.00072217523,0.00010249298,0.9767774,0.0029383667,0.015321065],"study_design_scores_gemma":[0.00025538536,0.000007236893,0.00010003605,0.0005744248,0.00023394711,6.4304356e-7,0.00017196877,0.00022641917,0.00014215446,0.22682178,0.77095884,0.0005071336],"about_ca_topic_score_codex":0.0006303633,"about_ca_topic_score_gemma":0.0004729878,"teacher_disagreement_score":0.7680205,"about_ca_system_score_codex":0.000012981176,"about_ca_system_score_gemma":0.000016643833,"threshold_uncertainty_score":0.63181937},"labels":[],"label_agreement":null},{"id":"W1491667226","doi":"10.1007/978-3-642-31054-6_12","title":"Stochastic Processes and Markov Chains","year":2012,"lang":"en","type":"book-chapter","venue":"Springer texts in business and economics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of New Brunswick","funders":"","keywords":"Markov chain; Computer science; Examples of Markov chains; Markov renewal process; Markov process; Markov property; Markov model; Mathematics; Statistics; Machine learning","score_opus":0.013598499545758048,"score_gpt":0.19748660244203042,"score_spread":0.1838881028962724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1491667226","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22165348,0.032342877,0.0073508476,0.0028553035,0.0031134111,0.0024240129,0.00009124064,0.0007048861,0.72946393],"genre_scores_gemma":[0.91394436,0.0058509386,0.00059855275,0.0013322181,0.0048038852,0.00006111488,0.00010776444,0.00041035202,0.07289079],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986867,0.0000020366122,0.00039422393,0.0005218305,0.000058758982,0.00033650806],"domain_scores_gemma":[0.9991046,0.00006833819,0.00040140207,0.00028913733,0.000111174624,0.00002534341],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002802051,0.0004317393,0.0005762743,0.0005299802,0.00013421128,0.00024173202,0.00017513681,0.00022498803,0.00021812483],"category_scores_gemma":[0.000090235466,0.00045569357,0.000043883898,0.00009783619,0.00017386318,0.0009978141,0.0003965477,0.00022396761,0.00007001313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000113705464,0.000053325322,0.0017569221,0.0025639639,0.00015545575,0.000014453555,0.00008325814,0.0022075623,0.0000037489613,0.88361937,0.000060158047,0.109368056],"study_design_scores_gemma":[0.0021609028,0.000014561919,0.013470857,0.0024896846,0.0011611411,0.000038729,0.0001279612,0.009997353,0.000003212191,0.54167455,0.4242638,0.00459726],"about_ca_topic_score_codex":0.000054305074,"about_ca_topic_score_gemma":0.0005413491,"teacher_disagreement_score":0.6922909,"about_ca_system_score_codex":0.000056215144,"about_ca_system_score_gemma":0.000029341485,"threshold_uncertainty_score":0.9997895},"labels":[],"label_agreement":null},{"id":"W1493797193","doi":"10.1023/a:1022952324290","title":"Non-Clairvoyant Multiprocessor Scheduling of Jobs with Changing Execution Characteristics","year":2003,"lang":"en","type":"article","venue":"Journal of Scheduling","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; York University","funders":"","keywords":"Computer science; Multiprocessing; Parallel computing; Multiprocessor scheduling; Processor scheduling; Scheduling (production processes); Distributed computing; Fair-share scheduling; Rate-monotonic scheduling; Operating system; Mathematical optimization; Schedule; Mathematics","score_opus":0.011299386301709558,"score_gpt":0.22804776606957702,"score_spread":0.21674837976786746,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1493797193","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86430717,0.00014354003,0.13465972,0.00009759872,0.00023391235,0.00007890533,5.8223134e-7,0.000021165131,0.00045739635],"genre_scores_gemma":[0.9598637,0.00002347653,0.039134055,0.00017743657,0.0007265121,0.0000019656015,0.0000024731103,0.000039231858,0.000031100677],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982588,0.000017199825,0.00077360746,0.0001832123,0.00042691157,0.00034023175],"domain_scores_gemma":[0.9968709,0.00007146342,0.0019546594,0.00017930637,0.000893906,0.000029801491],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014722302,0.0002184965,0.0005221139,0.00077049923,0.00020526169,0.00011079055,0.00023677737,0.000076320604,0.00005069708],"category_scores_gemma":[0.0007158512,0.00017814568,0.00016639222,0.0009872571,0.00006962785,0.0014692534,0.000047086083,0.00035432156,0.000013224635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020523677,0.0011025781,0.187137,0.0031951456,0.0015215117,0.00050533295,0.002080154,0.5231587,0.20433721,0.060574546,0.000021536958,0.014313891],"study_design_scores_gemma":[0.016093263,0.0006665309,0.019139575,0.01570058,0.005629026,0.0007555934,0.036566887,0.73683417,0.13358162,0.023043381,0.0075750966,0.0044142567],"about_ca_topic_score_codex":0.0000054673337,"about_ca_topic_score_gemma":0.0000023025266,"teacher_disagreement_score":0.21367544,"about_ca_system_score_codex":0.000054037162,"about_ca_system_score_gemma":0.000061207815,"threshold_uncertainty_score":0.726457},"labels":[],"label_agreement":null},{"id":"W1495628518","doi":"10.1109/pdcat.2003.1236313","title":"Improving service for service systems with different arriving rate","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trent University","funders":"","keywords":"Throughput; Computer science; Service (business); Computer network; Service system; Real-time computing; Telecommunications; Wireless","score_opus":0.011214338416940016,"score_gpt":0.20604980417900454,"score_spread":0.1948354657620645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1495628518","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72258687,0.000031727333,0.2715236,0.0019285002,0.00023406118,0.0006180889,0.0000022419943,0.0004907438,0.0025841703],"genre_scores_gemma":[0.99328524,5.880257e-7,0.0009819975,0.0045816083,0.000659096,0.000098220204,0.00002525993,0.000057133846,0.0003108332],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884444,0.000008880728,0.0002529176,0.00037499308,0.00015508987,0.000363685],"domain_scores_gemma":[0.9989174,0.00007896639,0.00026484713,0.00034106558,0.0003800646,0.000017680983],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031483712,0.00024886447,0.0002838581,0.00015762296,0.00028498404,0.00037177544,0.00027875675,0.000048467246,0.000030419082],"category_scores_gemma":[0.000054872224,0.00018067371,0.00006037503,0.00063697714,0.00001254144,0.0011419703,0.00012613786,0.00008879208,0.00008126803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054107123,0.00026525723,0.002603581,0.0057412037,0.00046718167,0.00002264693,0.0002794644,0.6544796,0.024967903,0.30835757,0.00007859505,0.0021958845],"study_design_scores_gemma":[0.00972629,0.0000958441,0.0025919843,0.0016393717,0.0018498179,0.000017237026,0.0075327596,0.8906616,0.0047737462,0.06751329,0.010457518,0.0031405285],"about_ca_topic_score_codex":0.002104713,"about_ca_topic_score_gemma":0.0026612123,"teacher_disagreement_score":0.2706984,"about_ca_system_score_codex":0.000069840025,"about_ca_system_score_gemma":0.000015646432,"threshold_uncertainty_score":0.736766},"labels":[],"label_agreement":null},{"id":"W1510547128","doi":"10.1109/ccece.1993.332480","title":"In search of a fair scheduling policy for serving multi-queue systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Queue; Computer science; Scheduling (production processes); Network packet; Computer network; Queueing theory; Real-time computing; Mathematical optimization; Mathematics","score_opus":0.0459149885714085,"score_gpt":0.2951175915180647,"score_spread":0.24920260294665622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1510547128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7344286,0.00037347674,0.24551895,0.0028508583,0.0002570887,0.0011217085,0.0000050162166,0.0002845772,0.015159718],"genre_scores_gemma":[0.9918911,0.00000507465,0.00517425,0.00041890613,0.00048602527,0.000029913374,0.000003111117,0.000025689293,0.0019659202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990134,0.000014467013,0.00032822727,0.00022063557,0.00013453243,0.00028873942],"domain_scores_gemma":[0.99937123,0.00010431853,0.00012722866,0.00022937436,0.00015896981,0.000008900638],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000555083,0.000119012,0.0002516689,0.00064020033,0.000076344586,0.00007538546,0.00023187847,0.00005221723,0.00013579773],"category_scores_gemma":[0.0003646999,0.00011189343,0.000087210596,0.0009529463,0.000027922366,0.0009014279,0.00012366267,0.00008422837,0.00006916216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000057319307,0.00032900434,0.010525041,0.0022172264,0.00010745245,0.000010496981,0.0003510567,0.43375617,0.007274169,0.5422346,0.00025777114,0.0028796853],"study_design_scores_gemma":[0.00060964905,0.0000038774097,0.00009429032,0.00010552609,0.000019680669,5.4537696e-7,0.0011403452,0.9946133,0.0002383643,0.0017600507,0.0012654166,0.00014893479],"about_ca_topic_score_codex":0.0029380452,"about_ca_topic_score_gemma":0.00022055849,"teacher_disagreement_score":0.5608571,"about_ca_system_score_codex":0.000047426052,"about_ca_system_score_gemma":0.0000068559993,"threshold_uncertainty_score":0.45628816},"labels":[],"label_agreement":null},{"id":"W1512467621","doi":"10.1016/j.peva.2005.11.006","title":"On the steady-state distribution","year":2006,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Steady state (chemistry); Poisson distribution; State (computer science); Distribution (mathematics); Computer science; Service (business); Partial differential equation; Process (computing); Flow (mathematics); Applied mathematics; Mathematics; Physics; Mathematical analysis; Statistics; Algorithm; Mechanics; Operating system; Business","score_opus":0.01988584985260453,"score_gpt":0.2525275857868322,"score_spread":0.23264173593422768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1512467621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98197657,0.000016343918,0.002959357,0.0008409975,0.00014553317,0.00023465454,0.0000019279214,0.00007900546,0.0137455845],"genre_scores_gemma":[0.9984593,0.0000023849766,0.000010090299,0.0004330271,0.0004638984,0.000056929195,0.00023448127,0.000009986251,0.00032990763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990573,0.000025042387,0.00017134471,0.00015455933,0.00043473727,0.00015699424],"domain_scores_gemma":[0.9993361,0.000062904684,0.00017084979,0.00022011458,0.0002074189,0.0000026154546],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0015494383,0.000099096724,0.00007234037,0.00006656655,0.0003366178,0.00010663328,0.00012358777,0.000020652318,0.00038440496],"category_scores_gemma":[0.00018058006,0.000069080634,0.000041105817,0.00040767965,0.000036420384,0.0008005205,0.000028703684,0.00008540601,0.0009890873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015994634,0.00013266274,0.0074485354,0.0000481773,0.000030731022,6.717593e-7,0.000045071065,0.63102967,0.0007322362,0.26075882,0.012621323,0.08699217],"study_design_scores_gemma":[0.0002630954,0.00000823268,0.02867008,0.000026330308,0.00007665141,2.3455583e-7,0.000027629996,0.8780347,0.00048696692,0.08529074,0.006974542,0.00014081574],"about_ca_topic_score_codex":0.00004160214,"about_ca_topic_score_gemma":0.00002463469,"teacher_disagreement_score":0.24700503,"about_ca_system_score_codex":0.000085351276,"about_ca_system_score_gemma":0.00000989528,"threshold_uncertainty_score":0.99978876},"labels":[],"label_agreement":null},{"id":"W1514392931","doi":"10.1007/3-540-45551-5_56","title":"Fairness and Aggregation: A Primal Decomposition Study","year":2000,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Terminal (telecommunication); Mathematical optimization; Overhead (engineering); Optimal allocation; Resource allocation; Computer network; Population; Controller (irrigation); Distributed computing; Mathematics","score_opus":0.010318973294705961,"score_gpt":0.24348611660206224,"score_spread":0.23316714330735627,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514392931","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025441227,0.00019514802,0.9607616,0.00034157836,0.0004543731,0.00060192926,0.0000013174985,0.00016881098,0.012034013],"genre_scores_gemma":[0.9903035,0.0000079192705,0.0074437144,0.0010353475,0.0010443819,0.000007501159,0.000010072552,0.000029466744,0.00011806056],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982284,0.0000092734535,0.00028727425,0.0007930352,0.00042826307,0.0002537915],"domain_scores_gemma":[0.99911666,0.000114187584,0.00022276088,0.00040547052,0.0001249904,0.000015956666],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004941482,0.0003053163,0.00033056285,0.00072723307,0.00029477902,0.00049961807,0.0004952344,0.00010441977,0.00013565412],"category_scores_gemma":[0.000035069468,0.000286926,0.00005483636,0.00043877464,0.00033997532,0.0009611517,0.00036900057,0.00030295824,0.000049734463],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000051692667,0.00008093637,0.0009253255,0.00006228301,0.000028110106,0.00009906686,0.00027184136,0.06602659,0.000028595061,0.025042366,0.0000039370398,0.90737927],"study_design_scores_gemma":[0.0005611233,0.00006746317,0.0008908482,0.00039825932,0.000121035744,0.000020885436,0.000001838929,0.20580867,0.000055830533,0.7892735,0.0019919262,0.00080859725],"about_ca_topic_score_codex":0.00003261889,"about_ca_topic_score_gemma":0.00013242495,"teacher_disagreement_score":0.9648623,"about_ca_system_score_codex":0.00008244723,"about_ca_system_score_gemma":0.00003502932,"threshold_uncertainty_score":0.9999583},"labels":[],"label_agreement":null},{"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Actua","funders":"","keywords":"Heavy-tailed distribution; Statistical physics; Mathematics; Statistics; Physics; Probability distribution","score_opus":0.019268451254110277,"score_gpt":0.289284281295768,"score_spread":0.27001583004165775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1514890731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92950815,0.0023976576,0.023812054,0.020761272,0.0028752526,0.0106315315,0.00036934044,0.00092686113,0.008717855],"genre_scores_gemma":[0.79970014,0.0040613655,0.02249442,0.00021665798,0.016929895,0.0077406815,0.0021845193,0.0007049909,0.14596735],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9946666,0.00019201671,0.0010378185,0.0015075547,0.0010701836,0.0015258732],"domain_scores_gemma":[0.99685335,0.00014379057,0.000040701896,0.0011880646,0.0015734959,0.00020060493],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0036110696,0.00063749106,0.0007822085,0.0044943388,0.0018595188,0.0027213548,0.00073521346,0.00050285045,0.00032145856],"category_scores_gemma":[0.0037130003,0.0007235248,0.00008482691,0.002828252,0.0008854954,0.006177871,0.0014595786,0.0027523953,0.00013242502],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003650985,0.000272689,0.0003936206,0.0005279959,0.00005514212,0.00007438662,0.00085641537,0.25424615,0.0042425767,0.73494595,0.001795321,0.002224675],"study_design_scores_gemma":[0.0018592331,0.0008956418,0.008388612,0.0014385275,0.00007798579,0.000053872085,0.0014355383,0.16049981,0.0012937258,0.014850881,0.80559474,0.003611406],"about_ca_topic_score_codex":0.0025020987,"about_ca_topic_score_gemma":0.027884865,"teacher_disagreement_score":0.80379945,"about_ca_system_score_codex":0.00088386383,"about_ca_system_score_gemma":0.00053581304,"threshold_uncertainty_score":0.9995483},"labels":[],"label_agreement":null},{"id":"W1518079757","doi":"10.3968/j.pam.1925252820110201.012","title":"On the Finite Capacity Shortest Queue Problem","year":2011,"lang":"en","type":"article","venue":"Progress in applied mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Burke's theorem; Bulk queue; Queue; Fork–join queue; Poisson distribution; Mathematics; Computer science; Applied mathematics; Computer network; Queue management system; Statistics","score_opus":0.04528453826405322,"score_gpt":0.2362039006479622,"score_spread":0.190919362383909,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1518079757","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.19021855,0.00008046115,0.018643402,0.00066794595,0.00019387474,0.0023926978,0.0000055305445,0.0007469255,0.7870506],"genre_scores_gemma":[0.9711031,0.0000021129238,0.027756594,0.00054181746,0.000115590745,0.0003656589,0.0000049095875,0.000045055138,0.00006519138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99879575,0.000008591326,0.00036794317,0.0002632073,0.00025013427,0.00031435312],"domain_scores_gemma":[0.998899,0.00023314437,0.0002946924,0.0005145122,0.00004828994,0.000010394176],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008450674,0.00022601381,0.0002582134,0.00017294432,0.0001443339,0.000101861806,0.0004793682,0.00006987184,0.00029964512],"category_scores_gemma":[0.00014431846,0.00015446162,0.00006367558,0.0005709211,0.00019911275,0.00016910984,0.00016546303,0.00026598925,0.0004360417],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001961705,0.00033636816,0.0006241168,0.00016138863,0.000025455185,0.0000046962036,0.0005589564,0.00018680865,0.0000106908055,0.9939192,0.00011128392,0.0040414385],"study_design_scores_gemma":[0.00018310557,0.0000063205316,0.00006377411,0.00012055049,0.0000608479,5.500843e-7,0.00040890352,0.023177525,0.00021508968,0.9742586,0.0012462985,0.00025842397],"about_ca_topic_score_codex":0.000008290624,"about_ca_topic_score_gemma":0.000029610825,"teacher_disagreement_score":0.7869854,"about_ca_system_score_codex":0.00002857547,"about_ca_system_score_gemma":0.0000061086366,"threshold_uncertainty_score":0.6298762},"labels":[],"label_agreement":null},{"id":"W1522639526","doi":"10.1007/11682462_38","title":"Maximizing Throughput in Queueing Networks with Limited Flexibility","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Server; Computer science; Queueing theory; Throughput; Flexibility (engineering); Layered queueing network; Class (philosophy); Computer network; Distributed computing; Set (abstract data type); Mathematical optimization; Mathematics; Artificial intelligence; Operating system","score_opus":0.016320312584408362,"score_gpt":0.22841596704720743,"score_spread":0.21209565446279907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1522639526","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.002073252,0.00022816831,0.98363733,0.00026955252,0.00037114095,0.0003042487,6.402768e-7,0.00017544266,0.012940214],"genre_scores_gemma":[0.9420471,0.000009567983,0.052982323,0.002806623,0.0017868958,0.000009278912,0.00002695628,0.00008749477,0.0002437538],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9969179,0.000015915699,0.0005318149,0.0013217911,0.0005538898,0.0006586697],"domain_scores_gemma":[0.9981761,0.0003035704,0.00044812422,0.0008535264,0.00019985774,0.000018806548],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011250643,0.0005320224,0.00062149327,0.0010676057,0.00024395685,0.00049558154,0.000994279,0.00025371258,0.000036798992],"category_scores_gemma":[0.00010959707,0.00046021174,0.0001089346,0.0014206622,0.00064834167,0.0012226896,0.0006522429,0.0009149362,0.00001827893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031811618,0.000019802716,0.0013135499,0.000050484214,0.000008657445,0.00008716423,0.00002947246,0.92222095,0.000006546683,0.0073175463,0.000006909038,0.06890712],"study_design_scores_gemma":[0.00027784842,0.000014670085,0.00041356322,0.0007109282,0.000032710053,0.000005493097,4.5191345e-7,0.85644513,0.000018302984,0.14037034,0.0010970442,0.00061348325],"about_ca_topic_score_codex":0.00040552166,"about_ca_topic_score_gemma":0.0021161898,"teacher_disagreement_score":0.93997383,"about_ca_system_score_codex":0.00029899497,"about_ca_system_score_gemma":0.0000749081,"threshold_uncertainty_score":0.99978495},"labels":[],"label_agreement":null},{"id":"W1525924619","doi":"10.1002/0471722863.ch5","title":"ATM Traffic Control","year":2001,"lang":"en","type":"other","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"","keywords":"Control (management); Computer science; Artificial intelligence","score_opus":0.007507960041472795,"score_gpt":0.21224511692340225,"score_spread":0.20473715688192945,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1525924619","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000022454771,0.0002311306,0.009646937,0.0002314352,0.0002554701,0.0001756067,0.000002475525,0.0011285605,0.9883059],"genre_scores_gemma":[0.004895406,0.000020416688,0.00022148331,0.0029340268,0.0035844364,0.000014239181,0.000041063813,0.00048882986,0.9878001],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99909043,0.0000071518816,0.00016727757,0.0003219253,0.00016108378,0.00025213047],"domain_scores_gemma":[0.9993187,0.000024119825,0.00025368918,0.00036638486,0.000029335004,0.000007778432],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0001262954,0.00027098897,0.0003743527,0.00043465043,0.00004928772,0.00010059702,0.00026866957,0.00016812838,0.075296365],"category_scores_gemma":[0.000047230882,0.00023191227,0.00016396222,0.00037432837,0.000046118734,0.00017218842,0.000043087806,0.00012707348,0.007439999],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000096013255,0.000038629707,0.00006673984,0.000067695524,0.00017874464,0.000029507912,0.000001025143,0.001232017,0.000003201243,0.027451372,0.95937127,0.011550187],"study_design_scores_gemma":[0.00039714127,0.0000013026456,0.000002575861,0.000048212507,0.00023572783,7.062707e-7,0.000021063306,0.003045009,2.0424366e-7,0.0011748563,0.9947715,0.00030174895],"about_ca_topic_score_codex":0.00034899646,"about_ca_topic_score_gemma":0.0006360704,"teacher_disagreement_score":0.067856364,"about_ca_system_score_codex":0.000015877644,"about_ca_system_score_gemma":0.0000050458752,"threshold_uncertainty_score":0.9933328},"labels":[],"label_agreement":null},{"id":"W1527454052","doi":"10.1002/0471643505.ch8","title":"The Matrix Geometric Techniques","year":2004,"lang":"en","type":"other","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Markovian arrival process; Fluid queue; Markov chain; Laplace transform; Poisson distribution; Queueing theory; Computer science; Remainder; Applied mathematics; Markov process; Queue; Range (aeronautics); Continuous-time Markov chain; Algorithm; Mathematics; Markov property; Markov model; Mathematical analysis; Statistics","score_opus":0.0072524164470965016,"score_gpt":0.24463378354699183,"score_spread":0.23738136709989532,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1527454052","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000001189478,0.0009890271,0.010011535,0.00040990667,0.00018599788,0.00023587291,0.0000012224535,0.0015110866,0.98665416],"genre_scores_gemma":[0.00032073728,0.00018948103,0.0014965512,0.0006553342,0.0022369812,0.000031946627,0.000018086232,0.00041207945,0.9946388],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990564,0.0000056895997,0.00018173775,0.00028084754,0.00022128255,0.00025405918],"domain_scores_gemma":[0.99902755,0.000050615334,0.0003235007,0.00054895197,0.0000440087,0.0000053738427],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00032352892,0.0002417045,0.0002308784,0.0010237906,0.0001694285,0.00026169405,0.0005215144,0.00015679517,0.0047622593],"category_scores_gemma":[0.00015832558,0.00015067754,0.00014546321,0.0014459533,0.000082721446,0.00016536552,0.00019372077,0.00016857106,0.0025836995],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000044017465,0.000016667487,0.000021838863,0.00007735001,0.00008791974,0.000006906676,4.7688013e-7,0.000015513424,0.0000034536554,0.24426866,0.7314992,0.023997625],"study_design_scores_gemma":[0.000051733623,0.0000013518821,0.0000023311989,0.00005796473,0.000090265115,4.722861e-7,0.000013743612,0.000018430037,0.000015879745,0.030903513,0.9686285,0.0002157694],"about_ca_topic_score_codex":0.0007247041,"about_ca_topic_score_gemma":0.0003369005,"teacher_disagreement_score":0.23712936,"about_ca_system_score_codex":0.000042648728,"about_ca_system_score_gemma":0.000011754336,"threshold_uncertainty_score":0.9981929},"labels":[],"label_agreement":null},{"id":"W1529350996","doi":"10.1002/9780470400531.eorms0891","title":"The <i>M</i> / <i>M</i> /1 Queue","year":2011,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Operations Research and Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematical proof; Key (lock); Variety (cybernetics); Queueing theory; Transient (computer programming); Queue; Burke's theorem; Queueing system; Computer science; Presentation (obstetrics); State (computer science); Discrete mathematics; Mathematics; Theoretical computer science; Queue management system; Algorithm; Computer network; Programming language; Operating system; Fork–join queue; Geometry; Artificial intelligence","score_opus":0.02578637581866335,"score_gpt":0.2988668655080597,"score_spread":0.27308048968939636,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529350996","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007223362,0.0011737312,0.00057114835,0.000330281,0.00029151572,0.00077840174,0.0000060393904,0.000097142045,0.9966795],"genre_scores_gemma":[0.002104445,0.03729398,0.0021182934,0.00026416744,0.00072424946,0.00028222712,0.000020397563,0.00017712817,0.9570151],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9973906,0.000034362103,0.0003139649,0.00062459655,0.0010165351,0.0006199382],"domain_scores_gemma":[0.9985575,0.000070867,0.00011706984,0.0008876005,0.00032520594,0.00004172172],"candidate_categories":["sts"],"consensus_categories":["sts"],"category_scores_codex":[0.0026152898,0.00022492441,0.00022841932,0.0013485588,0.0013527054,0.00049881404,0.001429332,0.00006750138,0.00050568883],"category_scores_gemma":[0.00031393,0.00016017641,0.000049760267,0.002405157,0.002794646,0.00081409793,0.0012326076,0.0002703609,0.00035372452],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001315415,0.0000715862,0.00006736475,0.00017615978,0.000046487687,0.0000075153175,0.00002857232,0.000044415392,0.000022433087,0.65900844,0.327293,0.013220861],"study_design_scores_gemma":[0.0001276808,0.000015556152,0.00003706362,0.00017768695,0.00003730176,5.589048e-7,0.00023882797,0.000645037,0.000008665723,0.0070168027,0.9915041,0.0001907247],"about_ca_topic_score_codex":0.0012609684,"about_ca_topic_score_gemma":0.0024618518,"teacher_disagreement_score":0.6642111,"about_ca_system_score_codex":0.00003167825,"about_ca_system_score_gemma":0.00006644505,"threshold_uncertainty_score":0.99994737},"labels":[],"label_agreement":null},{"id":"W1529802785","doi":"10.1002/9781118785317.weom010096","title":"Product Cost Determination","year":2015,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Outsourcing; Service (business); Product (mathematics); Center (category theory); Set (abstract data type); Cost allocation; Computer science; Operations management; Business; Operations research; Economics; Engineering; Marketing; Mathematics","score_opus":0.011471474963462352,"score_gpt":0.23862687581445627,"score_spread":0.22715540085099392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1529802785","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000015901436,0.0006566246,0.0009312149,0.000089315545,0.00084044016,0.0009931509,0.000015864942,0.00036272925,0.99609476],"genre_scores_gemma":[0.00046339582,0.0012638819,0.0025195861,0.00031196888,0.00289455,0.0001640195,0.0004259578,0.0005357531,0.99142087],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99810684,0.00002110634,0.00042344068,0.0005669888,0.00057093234,0.00031068551],"domain_scores_gemma":[0.99818486,0.000015706855,0.00085273955,0.0007902189,0.00013699543,0.000019492214],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000516929,0.0003920986,0.0004931129,0.0010682816,0.00004328704,0.000050537565,0.0005540337,0.00010913643,0.002015993],"category_scores_gemma":[0.000115328374,0.00038830342,0.00011800856,0.00070601574,0.00009063232,0.0003407015,0.00041724302,0.00013744716,0.0011019136],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017354998,0.00009487946,0.00007944374,0.00090038416,0.0001395181,0.000027904132,0.000012241394,0.00009778989,8.895329e-7,0.005785099,0.8984949,0.09434961],"study_design_scores_gemma":[0.0003303532,0.0000053041085,0.000035761997,0.00042817043,0.0005008967,4.2112794e-7,0.000056580004,0.000242571,0.0000014505636,0.0035564736,0.99444175,0.00040029027],"about_ca_topic_score_codex":0.00013662572,"about_ca_topic_score_gemma":0.00017395346,"teacher_disagreement_score":0.09594684,"about_ca_system_score_codex":0.00006482826,"about_ca_system_score_gemma":0.000015959276,"threshold_uncertainty_score":0.9998569},"labels":[],"label_agreement":null},{"id":"W1537366078","doi":"10.1023/a:1020941305448","title":"Two M/M/1 Queues with Transfers of Customers","year":2002,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":25,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Science Foundation","keywords":"Queueing theory; Transfer (computing); Bulk queue; Burke's theorem; Queue; Stationary distribution; Mathematics; Markov chain; Computer science; Applied mathematics; Mathematical optimization; Fork–join queue; Queue management system; Statistics; Computer network; Parallel computing","score_opus":0.014183741449590143,"score_gpt":0.2123957937844073,"score_spread":0.19821205233481715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1537366078","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8336644,0.00082268944,0.0042485315,0.0003031011,0.000544193,0.0005194369,0.0000045344423,0.00058191834,0.15931116],"genre_scores_gemma":[0.99822456,0.000008153886,0.00007762715,0.00012448197,0.00040142008,0.000019024716,0.0000040756718,0.00004414091,0.001096549],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987718,0.000029184088,0.0003523645,0.00027151877,0.00029944582,0.0002756753],"domain_scores_gemma":[0.9992135,0.000058906036,0.00024745273,0.00033075438,0.00013483613,0.000014507422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003434542,0.000197213,0.00037570525,0.00032939512,0.0001175807,0.00009915223,0.00023822814,0.000044295535,0.00012092258],"category_scores_gemma":[0.000036427948,0.0001619999,0.00009789649,0.0007255475,0.00010309028,0.0008003089,0.000023390468,0.00010869279,0.00017081585],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023244804,0.0003045806,0.015296618,0.0025081953,0.00085280044,0.00013078928,0.00127569,0.3352849,0.008208753,0.6244211,0.0020760184,0.009408089],"study_design_scores_gemma":[0.00765389,0.0002735747,0.00044532726,0.0040713716,0.0020509039,0.00007430663,0.015311276,0.81641865,0.002749055,0.004208098,0.14301561,0.003727962],"about_ca_topic_score_codex":0.0015142923,"about_ca_topic_score_gemma":0.000097724565,"teacher_disagreement_score":0.62021303,"about_ca_system_score_codex":0.000033591983,"about_ca_system_score_gemma":0.0000047087706,"threshold_uncertainty_score":0.6606164},"labels":[],"label_agreement":null},{"id":"W1545351029","doi":"10.1109/ccece.1993.332331","title":"Performance models for optimizing a hierarchical-bus multiprocessor architecture","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Université du Québec à Chicoutimi","funders":"","keywords":"Multiprocessing; Computer science; Architecture; Queueing theory; Very-large-scale integration; Network architecture; Parallel computing; Distributed computing; Computer architecture; Embedded system; Computer network","score_opus":0.02517258656993787,"score_gpt":0.22319374097553724,"score_spread":0.19802115440559936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1545351029","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11257733,0.00012864302,0.7913079,0.0021239517,0.00014330703,0.00057425833,0.0000032253447,0.0006970435,0.09244434],"genre_scores_gemma":[0.9468816,0.000014231966,0.04707447,0.002000247,0.00061853067,0.000094744035,0.000011588104,0.000046559257,0.0032580188],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988141,0.000005316768,0.0002433769,0.00036759605,0.00017259223,0.00039702826],"domain_scores_gemma":[0.99935037,0.00009881796,0.0001292762,0.0002790563,0.0001255827,0.000016894899],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020982964,0.00020952742,0.00023432786,0.000259072,0.0003225582,0.00013906062,0.00030778485,0.00006341403,0.00039820926],"category_scores_gemma":[0.00012549278,0.00017449018,0.00014066437,0.0004525568,0.00005930749,0.0012471484,0.00010637333,0.00016210084,0.0001255236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010060556,0.000097306845,0.0001104724,0.00031554353,0.000056491735,0.000002556653,0.00014316838,0.90048486,0.00041751927,0.028298005,0.00059598277,0.06937751],"study_design_scores_gemma":[0.0005138252,0.0000085610645,0.0000071152745,0.000031931588,0.000059218823,0.0000015339467,0.000047855294,0.958751,0.0001257137,0.030242348,0.009948575,0.00026232528],"about_ca_topic_score_codex":0.000010717647,"about_ca_topic_score_gemma":0.000008803583,"teacher_disagreement_score":0.8343043,"about_ca_system_score_codex":0.000018410308,"about_ca_system_score_gemma":0.0000029103742,"threshold_uncertainty_score":0.71155035},"labels":[],"label_agreement":null},{"id":"W1553681817","doi":"10.1023/a:1024420505098","title":"Stability Conditions of the MMAP[K]/G[K]/1/LCFS Preemptive Repeat Queue","year":2003,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Ergodic theory; Computer science; Queueing theory; Stability (learning theory); Queue; Mathematical optimization; Applied mathematics; Mathematics; Computer network","score_opus":0.017521673416354393,"score_gpt":0.2273393239317797,"score_spread":0.2098176505154253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553681817","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8965073,0.00039130592,0.004972006,0.00020985873,0.0015334047,0.001005942,0.000023471914,0.00027251546,0.0950842],"genre_scores_gemma":[0.9983623,0.0000014397298,0.000046251014,0.00013849768,0.000263437,0.00005505179,0.000008835386,0.00003076958,0.00109344],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99825984,0.00020366478,0.00055037864,0.00036985503,0.00032969948,0.00028655017],"domain_scores_gemma":[0.9979844,0.00020552016,0.0006101681,0.00087142695,0.00031398772,0.000014514761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012313498,0.0002087724,0.000368214,0.00013192675,0.00034703332,0.00011427054,0.00036095327,0.00008506204,0.0001845091],"category_scores_gemma":[0.0010963758,0.00015707537,0.00021701754,0.0007939655,0.00019653881,0.0007231493,0.00009900736,0.00018334757,0.00008113227],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023140195,0.00012469475,0.04565937,0.0005456108,0.00016267734,0.000006297431,0.00032275074,0.009142824,0.0040062997,0.9391039,0.0008346734,0.00006776771],"study_design_scores_gemma":[0.006222646,0.00014705473,0.037917536,0.005979093,0.003256575,0.00013744537,0.040729526,0.061700918,0.050357245,0.36736292,0.42050868,0.0056803576],"about_ca_topic_score_codex":0.00095211604,"about_ca_topic_score_gemma":0.00012334321,"teacher_disagreement_score":0.571741,"about_ca_system_score_codex":0.00009413699,"about_ca_system_score_gemma":0.00004029735,"threshold_uncertainty_score":0.64053476},"labels":[],"label_agreement":null},{"id":"W1553744170","doi":"","title":"Petri Net Modeling of Outpatient Waiting Time for MRI Examination","year":2013,"lang":"en","type":"article","venue":"University Library - University of Saskatchewan (University of Saskatchewan)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Petri net; Computer science; Magnetic resonance imaging; Event (particle physics); Discrete event simulation; Queueing theory; Operations research; Simulation; Medicine; Algorithm; Radiology; Engineering","score_opus":0.007839369090034123,"score_gpt":0.1543888215491751,"score_spread":0.14654945245914097,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1553744170","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96363616,0.000027955717,0.030965291,0.0006099594,0.00008056667,0.0007073993,0.00014784101,0.00023319229,0.0035916101],"genre_scores_gemma":[0.97536194,0.000021264841,0.013199709,0.000053026484,0.000073819785,5.0152675e-8,0.00029498962,0.000039365408,0.010955828],"study_design_codex":"qualitative","study_design_gemma":"qualitative","domain_scores_codex":[0.9979912,0.00009637731,0.00033699357,0.00064577634,0.0004508589,0.0004787741],"domain_scores_gemma":[0.9973736,0.00024160862,0.0010925598,0.0005597003,0.0006422471,0.00009030933],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003528851,0.00037583857,0.0008259764,0.0011990173,0.0005660516,0.000033975026,0.0012681071,0.00029151858,0.0017838689],"category_scores_gemma":[0.000033153192,0.0005585329,0.0005727862,0.0012959952,0.0005502609,0.0065197665,0.0008534645,0.00026231678,0.00009471778],"study_design_candidate":"qualitative","study_design_consensus":"qualitative","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010007906,0.006187606,0.025198076,0.00992189,0.0060635568,0.0004558181,0.5050564,0.31275418,0.04651954,0.0113465395,0.010703055,0.055785447],"study_design_scores_gemma":[0.002569952,0.00013547592,0.000574262,0.00025051917,0.0006582436,0.0000010743969,0.7272199,0.26324022,0.00034964024,0.0022386145,0.002119972,0.0006421706],"about_ca_topic_score_codex":0.0152652515,"about_ca_topic_score_gemma":0.0010256435,"teacher_disagreement_score":0.22216347,"about_ca_system_score_codex":0.00013396732,"about_ca_system_score_gemma":0.00021381567,"threshold_uncertainty_score":0.9996866},"labels":[],"label_agreement":null},{"id":"W1555848820","doi":"10.1109/wsc.2003.1261637","title":"Routing heuristics for multi-skill call centers","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Heuristics; Computer science; Routing (electronic design automation); Call blocking; Blocking (statistics); Center (category theory); Computer network; Call management; Distributed computing; Call control; Quality of service","score_opus":0.026174668055196904,"score_gpt":0.268047754797284,"score_spread":0.24187308674208707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1555848820","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0366203,0.000012998524,0.95621216,0.0006656407,0.00027804394,0.0002451928,0.0000031786647,0.00032361568,0.005638853],"genre_scores_gemma":[0.9586411,0.0000014565798,0.036754772,0.0028291466,0.00051794056,0.000013423861,0.000030181598,0.000033950637,0.0011779983],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991648,0.0000028734532,0.00021269756,0.00023750537,0.00009775603,0.00028435173],"domain_scores_gemma":[0.9995152,0.00004200669,0.00012936583,0.00018495544,0.0001178002,0.000010711761],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022226361,0.00013731042,0.00015559407,0.000111479036,0.00019122366,0.00010540809,0.00017412078,0.000038202095,0.000048637565],"category_scores_gemma":[0.0004224511,0.0001248249,0.00011999205,0.0002169191,0.000033515684,0.00045830169,0.000088576024,0.00006487392,0.00015396261],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000100082165,0.00033173503,0.0063152467,0.00020079532,0.00014601786,0.000020213263,0.00013570687,0.06682528,0.00089902227,0.91907,0.0013625913,0.0045932983],"study_design_scores_gemma":[0.01237089,0.000049881157,0.0034362508,0.00034551276,0.0009983025,0.0000062070417,0.0022168718,0.63896334,0.0020783946,0.20756057,0.12944481,0.0025289438],"about_ca_topic_score_codex":0.00022079457,"about_ca_topic_score_gemma":0.00017208674,"teacher_disagreement_score":0.92202085,"about_ca_system_score_codex":0.000051030078,"about_ca_system_score_gemma":0.000006855602,"threshold_uncertainty_score":0.50902116},"labels":[],"label_agreement":null},{"id":"W1556292613","doi":"10.1016/s1388-3437(03)80193-2","title":"A performance analysis of a multiplexer with priority queues and correlated arrivals","year":2003,"lang":"en","type":"book-chapter","venue":"Teletraffic science and engineering","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multiplexer; Queue; Computer science; Queueing theory; Computer network; Telecommunications; Multiplexing","score_opus":0.007840809205634123,"score_gpt":0.18645088316557554,"score_spread":0.1786100739599414,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1556292613","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98559433,0.00034518327,0.0004187318,0.000022219401,0.0000769044,0.00016780253,0.000002887839,0.00014463108,0.013227287],"genre_scores_gemma":[0.9974832,0.0001298381,0.000602631,0.00006997066,0.000054123233,0.00000349671,0.000005958925,0.000029950965,0.0016208297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985841,0.0000013304298,0.00026890202,0.0004562975,0.00042049808,0.00026888598],"domain_scores_gemma":[0.99917036,0.000054102795,0.00023167596,0.0002663286,0.00024769275,0.00002984113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006628493,0.00028525136,0.0005417316,0.0014958378,0.00015549628,0.00010586416,0.00019262398,0.0000975466,0.000034696084],"category_scores_gemma":[0.00013350349,0.00024332678,0.000062472966,0.001236476,0.00041366133,0.00069013657,0.00008765868,0.00020996082,0.00000336386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016010826,0.000072894785,0.009170566,0.0018585059,0.0029525843,0.00006383741,0.0006363246,0.82149726,0.005612029,0.113888815,0.00007795446,0.04400911],"study_design_scores_gemma":[0.00033097022,0.000031738105,0.0044778124,0.00041426637,0.0024346043,0.000008747279,0.000057959776,0.9848762,0.00007375276,0.000119387565,0.006419394,0.000755155],"about_ca_topic_score_codex":0.000019478066,"about_ca_topic_score_gemma":0.000013815956,"teacher_disagreement_score":0.16337894,"about_ca_system_score_codex":0.000039729628,"about_ca_system_score_gemma":0.000026071704,"threshold_uncertainty_score":0.99225783},"labels":[],"label_agreement":null},{"id":"W1562443002","doi":"10.1002/9780470986424.ch3","title":"Cluster with Uplink Traffic","year":2008,"lang":"en","type":"other","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Superframe; Queue; Network packet; Computer network; Computer science; Distribution (mathematics); Cluster (spacecraft); Telecommunications link; Mathematics","score_opus":0.008418925410483035,"score_gpt":0.20283924549948448,"score_spread":0.19442032008900145,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1562443002","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00007616218,0.00010984608,0.0072002434,0.00022963899,0.00011512787,0.00018173333,7.3929846e-7,0.0009289343,0.9911576],"genre_scores_gemma":[0.0012826399,0.000027208036,0.0019060159,0.00253609,0.0020099282,0.000014243211,0.000057058696,0.0006119635,0.99155486],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99908775,0.0000045209567,0.00014126736,0.00035996054,0.00017563852,0.00023088855],"domain_scores_gemma":[0.9993025,0.000018086374,0.00023729326,0.0003995107,0.000034709763,0.000007876943],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00006834701,0.0002969369,0.00032843614,0.00047683547,0.00006844367,0.00006983794,0.00024306992,0.00015188333,0.012068549],"category_scores_gemma":[0.000015836978,0.00021292914,0.00009647422,0.00038930203,0.000083641644,0.0002094864,0.00007433801,0.00015364584,0.003555331],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027306834,0.000035082954,0.000035347843,0.000100172016,0.0001479578,0.00003296759,0.000004571103,0.0019027119,4.712403e-7,0.0054124394,0.988735,0.003565942],"study_design_scores_gemma":[0.00030535666,0.0000031876125,0.000002984093,0.000092283866,0.00014666404,0.0000035078306,0.000016399574,0.003044793,4.3742037e-7,0.00021803398,0.99579364,0.00037274073],"about_ca_topic_score_codex":0.00010285172,"about_ca_topic_score_gemma":0.00045202143,"teacher_disagreement_score":0.008513218,"about_ca_system_score_codex":0.0000139783215,"about_ca_system_score_gemma":0.000009568217,"threshold_uncertainty_score":0.9972205},"labels":[],"label_agreement":null},{"id":"W1563193306","doi":"10.1023/a:1015733902430","title":"Buffer Overflow Probabilities for a Markov-Modulated Fluid Model","year":2002,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Markov chain; Computer science; Markov process; Upper and lower bounds; Computation; Applied mathematics; Mathematical optimization; Algorithm; Mathematics; Statistics; Mathematical analysis","score_opus":0.02503933709661368,"score_gpt":0.21891681383820277,"score_spread":0.1938774767415891,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1563193306","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7873587,0.002106625,0.13700913,0.0012356341,0.002188095,0.0037967437,0.000057875,0.00258073,0.0636665],"genre_scores_gemma":[0.98390216,0.000003946934,0.0006984061,0.00033817964,0.0009929356,0.00020972775,0.000032992077,0.00007407556,0.0137476],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99837106,0.000025179706,0.0004631524,0.00044761083,0.0002501066,0.00044291382],"domain_scores_gemma":[0.99886984,0.00011086967,0.00023760101,0.0004847905,0.00027906784,0.000017820701],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055821537,0.000270929,0.00040436815,0.0002456703,0.00029030076,0.00036743336,0.00027543431,0.0001087836,0.0001049301],"category_scores_gemma":[0.00033785283,0.0002527783,0.0001707988,0.00042088213,0.00005390597,0.0012114928,0.000080846155,0.000098773926,0.00016717247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014038637,0.00019850196,0.00095854246,0.0026381572,0.0003126228,0.00001184147,0.00046711808,0.74266744,0.004665924,0.2165369,0.029798806,0.0016037835],"study_design_scores_gemma":[0.00038862796,0.000008194478,0.000009226223,0.00016549052,0.00009413403,0.0000020834832,0.00014812332,0.9659284,0.00003059197,0.011344015,0.021553071,0.00032806376],"about_ca_topic_score_codex":0.00019304262,"about_ca_topic_score_gemma":0.000022397864,"teacher_disagreement_score":0.22326095,"about_ca_system_score_codex":0.00008829222,"about_ca_system_score_gemma":0.000007910394,"threshold_uncertainty_score":0.99999243},"labels":[],"label_agreement":null},{"id":"W1574322650","doi":"10.1023/a:1016672623865","title":"Optimizing the Number of Robots for Web Search Engines","year":2001,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Independent and identically distributed random variables; Queueing theory; Queue; Robot; Exponential distribution; Distributed computing; Random variable; Computer network; Mathematics; Artificial intelligence; Statistics","score_opus":0.04113889129523763,"score_gpt":0.3025665715157439,"score_spread":0.2614276802205063,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574322650","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7695522,0.0027337845,0.1409624,0.005428164,0.0006878231,0.002503382,0.000008974931,0.00067864143,0.07744467],"genre_scores_gemma":[0.9968374,0.000057203197,0.0018855492,0.00011119901,0.00029756868,0.00009931411,0.000026795975,0.000023985916,0.0006610269],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99917877,0.000055464996,0.00033490127,0.000121331635,0.000142351,0.00016715412],"domain_scores_gemma":[0.99822396,0.00034575595,0.0002667691,0.0008371688,0.00032067354,0.0000056767117],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011771222,0.00009813261,0.00019480771,0.00010218276,0.00025258135,0.00010272472,0.0006730184,0.000040103037,0.000054488686],"category_scores_gemma":[0.00013417429,0.00007465574,0.000088878725,0.00054081355,0.000055079054,0.00043243685,0.00014825833,0.00009260209,0.0000884497],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016102957,0.00020906932,0.015337137,0.0006321905,0.00034286693,9.692297e-7,0.00065800827,0.53587294,0.008893417,0.42552477,0.00212412,0.010243488],"study_design_scores_gemma":[0.0009336463,0.000007553063,0.00089148077,0.00022729563,0.00019244896,0.000014157175,0.0037177578,0.74606055,0.00026168482,0.0034056816,0.24386273,0.00042503784],"about_ca_topic_score_codex":0.00020096454,"about_ca_topic_score_gemma":0.000023490853,"teacher_disagreement_score":0.42211908,"about_ca_system_score_codex":0.000023687822,"about_ca_system_score_gemma":0.000010537924,"threshold_uncertainty_score":0.30443728},"labels":[],"label_agreement":null},{"id":"W1574603807","doi":"10.1109/ccece.1995.526428","title":"A unified approach for evaluating call blocking and burst blocking in high speed networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Blocking (statistics); Computer science; Computer network; Dimensioning; Quality of service; Bandwidth (computing); Multiplexing; Call blocking; Distributed computing; Telecommunications; Engineering","score_opus":0.04153314498429444,"score_gpt":0.25924393174981814,"score_spread":0.2177107867655237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574603807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80081147,0.00032278287,0.17809212,0.0004886073,0.00014907296,0.00086480903,8.7311054e-7,0.00031933456,0.018950908],"genre_scores_gemma":[0.98663855,0.0000056015865,0.011129531,0.0006679721,0.0005862665,0.000025743502,0.000020597625,0.000041231484,0.0008845059],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853134,0.000024160703,0.00037098222,0.00045748267,0.00018188062,0.00043414006],"domain_scores_gemma":[0.9992326,0.00019887053,0.00021310963,0.00023379092,0.000106626096,0.000014984045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010456984,0.00022068429,0.00032474895,0.000315691,0.00024753177,0.00023084394,0.0001846428,0.000090562135,0.00011010627],"category_scores_gemma":[0.0003258375,0.00021010806,0.00007200906,0.00071515946,0.00004873811,0.00055994804,0.00015640691,0.00017519358,0.000006272222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092567905,0.00015442766,0.011610472,0.00020985866,0.00009814038,0.000009623328,0.00013641875,0.9117931,0.0004257456,0.05169392,0.00029617152,0.02347954],"study_design_scores_gemma":[0.0010075561,0.000008791878,0.00042114317,0.000048945967,0.00011608494,0.0000014711554,0.0002495377,0.9936317,0.000009574789,0.00385551,0.00036688737,0.00028278117],"about_ca_topic_score_codex":0.0002727882,"about_ca_topic_score_gemma":0.00008554798,"teacher_disagreement_score":0.18582706,"about_ca_system_score_codex":0.000039532635,"about_ca_system_score_gemma":0.0000026940666,"threshold_uncertainty_score":0.8567958},"labels":[],"label_agreement":null},{"id":"W1574606017","doi":"10.1023/a:1019113204634","title":"A sufficient condition and a necessary condition for the diffusion approximations of multiclass queueing networks under priority service disciplines","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Queueing theory; Computer science; Limit (mathematics); Heavy traffic approximation; Queue; Stability (learning theory); Mathematical optimization; Mathematics; Diffusion; Layered queueing network; Matrix (chemical analysis); Mean value analysis; Applied mathematics; Topology (electrical circuits); Discrete mathematics; Computer network; Combinatorics; Mathematical analysis","score_opus":0.01366989263858857,"score_gpt":0.25586891955800917,"score_spread":0.2421990269194206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1574606017","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85156345,0.0003882754,0.14553852,0.0007257587,0.00026732837,0.0009670195,0.000013396588,0.00013740428,0.00039884468],"genre_scores_gemma":[0.99857324,0.000019605111,0.00012056077,0.00023461178,0.00056307646,0.00014568226,0.00011549857,0.000028715502,0.00019901051],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987304,0.000053950807,0.00046926626,0.0003015047,0.00020592386,0.00023894686],"domain_scores_gemma":[0.9985803,0.00047087055,0.00041250352,0.0002862875,0.00023508935,0.000014971317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007092941,0.00018928933,0.00029296862,0.00012877048,0.00065423123,0.00023497765,0.00017467613,0.000087239874,0.00003352955],"category_scores_gemma":[0.0000707231,0.00014331812,0.00008361965,0.0005367735,0.00009267295,0.00080619147,0.00007245713,0.00011555887,0.000007842725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011293637,0.00014897287,0.001655475,0.0010747579,0.00012019168,0.0000012221889,0.00049388496,0.9052469,0.0014373088,0.087421715,0.00013698344,0.0021496387],"study_design_scores_gemma":[0.0005522147,0.000008936942,0.0027375144,0.00034451357,0.00021577613,0.0000026607652,0.0019517521,0.99015474,0.00001992221,0.002620382,0.001207196,0.00018437188],"about_ca_topic_score_codex":0.0010908714,"about_ca_topic_score_gemma":0.00031143567,"teacher_disagreement_score":0.14700979,"about_ca_system_score_codex":0.000042280542,"about_ca_system_score_gemma":0.000012923407,"threshold_uncertainty_score":0.5844343},"labels":[],"label_agreement":null},{"id":"W1585114454","doi":"10.1023/a:1019998829007","title":"Bounds on Queues with Delayed Generalized Exponential Arrivals","year":2002,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Mathematics","score_opus":0.020168842380834474,"score_gpt":0.21732453084951517,"score_spread":0.1971556884686807,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1585114454","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95321804,0.00056548906,0.004994264,0.00043006762,0.0010369029,0.0004883112,0.0000040876675,0.00088754337,0.038375262],"genre_scores_gemma":[0.9926139,0.0000094008055,0.00014157286,0.0006596043,0.0021665336,0.000071064176,0.000022224023,0.00008432187,0.004231391],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99802953,0.0000715727,0.0004503377,0.0005050799,0.00048100352,0.00046248751],"domain_scores_gemma":[0.99875575,0.00007521475,0.00042161203,0.0005746559,0.00014510649,0.000027628263],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00045862983,0.000339236,0.00046673988,0.00038043465,0.0003968485,0.00062894536,0.00033516332,0.00009665382,0.00035744786],"category_scores_gemma":[0.00008554663,0.00027599224,0.00013520116,0.00059817353,0.000077441204,0.0009383358,0.00006429882,0.00017260543,0.0009806281],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010992973,0.0006272239,0.004280699,0.0008528403,0.001563159,0.0005505593,0.000807569,0.23941582,0.013077474,0.70634174,0.027259434,0.004124176],"study_design_scores_gemma":[0.005027325,0.00023915475,0.00020250148,0.001427228,0.0009099255,0.000060266855,0.0013650174,0.6585289,0.001079911,0.0064407527,0.3218828,0.0028361562],"about_ca_topic_score_codex":0.0012479421,"about_ca_topic_score_gemma":0.00008992397,"teacher_disagreement_score":0.699901,"about_ca_system_score_codex":0.00007872602,"about_ca_system_score_gemma":0.0000063947555,"threshold_uncertainty_score":0.99996924},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.010746301556932469,"score_gpt":0.2103868682623396,"score_spread":0.19964056670540714,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1587039046","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6024695,0.0007765549,0.22453195,0.0014990128,0.0009694276,0.0020736826,0.000023069939,0.0025736038,0.16508317],"genre_scores_gemma":[0.990435,0.0000033874337,0.00035861984,0.00021677723,0.0010672087,0.000090645764,0.000047269263,0.00006492447,0.007716142],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850166,0.00004466887,0.0003425791,0.00042693169,0.00029249451,0.0003916687],"domain_scores_gemma":[0.9987606,0.00014328182,0.00035636584,0.0004916342,0.00022327935,0.000024837544],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004226395,0.00026291306,0.0003441094,0.00028416686,0.0003939335,0.0002983753,0.0002986928,0.00007327776,0.0001296481],"category_scores_gemma":[0.00013758309,0.00021741918,0.0000912558,0.00085757737,0.0000751382,0.0013985449,0.00008677187,0.00016032477,0.0014037456],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008873951,0.00035992393,0.10178798,0.0005201423,0.001205844,0.00038327166,0.00076226785,0.44033602,0.004894066,0.4395098,0.0058731185,0.0034801613],"study_design_scores_gemma":[0.0014690437,0.00005415412,0.0032582295,0.0008080522,0.0004626533,0.000054025,0.0021132056,0.82972574,0.000059408445,0.004351153,0.15630946,0.0013348613],"about_ca_topic_score_codex":0.002505404,"about_ca_topic_score_gemma":0.00031068933,"teacher_disagreement_score":0.43515864,"about_ca_system_score_codex":0.000082176026,"about_ca_system_score_gemma":0.000020210366,"threshold_uncertainty_score":0.9993738},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.016891255627030206,"score_gpt":0.2540141036912759,"score_spread":0.23712284806424572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1593591280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7792865,0.00020037843,0.19904117,0.00042946954,0.00033932272,0.001014543,0.000004514309,0.0009936753,0.018690445],"genre_scores_gemma":[0.99613124,0.0000014046437,0.0005315371,0.00026686,0.0016534632,0.00007439367,0.000030724277,0.000053234286,0.001257167],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985689,0.000032189622,0.00033308988,0.00042214096,0.00024403125,0.00039966326],"domain_scores_gemma":[0.9991872,0.00007129186,0.0001861603,0.0003743483,0.00015626878,0.000024782756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00071882136,0.00021233741,0.00033123844,0.00020518994,0.0003806175,0.0004086899,0.00022986693,0.000086522065,0.00011329811],"category_scores_gemma":[0.000055197484,0.00018013758,0.000093092785,0.0005118741,0.000055398392,0.0012004912,0.000016539814,0.00010851275,0.00009463153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00094156514,0.0004561921,0.024077533,0.0010690726,0.00066336,0.00009179632,0.00040362397,0.41888475,0.0025061266,0.5006118,0.001980124,0.048314046],"study_design_scores_gemma":[0.00058380543,0.000041425992,0.00020313036,0.00023977812,0.00022722963,0.000010282264,0.0002321971,0.95732147,0.000018209475,0.001926226,0.038822092,0.0003741481],"about_ca_topic_score_codex":0.0006972777,"about_ca_topic_score_gemma":0.00015368278,"teacher_disagreement_score":0.5384367,"about_ca_system_score_codex":0.00007445413,"about_ca_system_score_gemma":0.000018596313,"threshold_uncertainty_score":0.73457974},"labels":[],"label_agreement":null},{"id":"W1594223073","doi":"10.1007/978-3-540-72990-7_64","title":"A Performance Analysis of Tandem Networks with Markovian Sources","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multiplexer; Queueing theory; Queue; Computer science; Markov process; Tandem; Network packet; Generating function; Boundary (topology); Function (biology); Topology (electrical circuits); Mathematics; Computer network; Multiplexing; Discrete mathematics; Statistics; Telecommunications; Combinatorics; Mathematical analysis; Engineering","score_opus":0.011232009522713169,"score_gpt":0.2180560618710221,"score_spread":0.20682405234830895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1594223073","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009088483,0.0001487359,0.9770369,0.000046973928,0.0001642603,0.00014255945,8.9184886e-7,0.00006607531,0.013305135],"genre_scores_gemma":[0.98087513,0.00001890982,0.017058715,0.0010494589,0.0006895566,0.0000021831784,0.000017283965,0.000036509395,0.0002522482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99766964,0.000005889787,0.00044679543,0.00076564605,0.00066391815,0.00044810516],"domain_scores_gemma":[0.9981583,0.00022356966,0.0006380577,0.00066388305,0.0002940459,0.000022177457],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011016392,0.00038854414,0.0007260611,0.0026812374,0.00020294622,0.0001782237,0.000958531,0.00018127215,0.00011345238],"category_scores_gemma":[0.000042946223,0.00031064547,0.00018668146,0.003152557,0.0007840724,0.00060006103,0.00037723046,0.0004399688,0.00000723035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031728487,0.000010887074,0.012364574,0.00003872879,0.00018256513,0.000016278675,0.00004093201,0.8670983,0.0000033395797,0.0021626647,0.0000012115041,0.11804882],"study_design_scores_gemma":[0.00013326759,0.000025723957,0.0022614812,0.00027503484,0.0007144913,0.0000021290073,5.101959e-7,0.9905918,0.000019675314,0.0048249564,0.000712829,0.0004380524],"about_ca_topic_score_codex":0.000042506297,"about_ca_topic_score_gemma":0.00063245883,"teacher_disagreement_score":0.9717867,"about_ca_system_score_codex":0.00008825979,"about_ca_system_score_gemma":0.000046843055,"threshold_uncertainty_score":0.99993455},"labels":[],"label_agreement":null},{"id":"W1597165720","doi":"10.1002/9780470400531.eorms0631","title":"Matrix Analytic Method: Overview and History","year":2011,"lang":"en","type":"other","venue":"Wiley Encyclopedia of Operations Research and Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Matrix (chemical analysis); Computer science; Mathematics; Chemistry; Chromatography","score_opus":0.058143376382577716,"score_gpt":0.3580925053266646,"score_spread":0.2999491289440869,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597165720","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000077060526,0.009336735,0.003589601,0.00013146896,0.00018835247,0.0007193526,0.0000059083222,0.00008455467,0.98586696],"genre_scores_gemma":[0.00063568464,0.06666225,0.0279256,0.00022193692,0.0004113925,0.00014424772,0.000025357145,0.0001619116,0.90381163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99762386,0.000050548977,0.00030922683,0.00076397404,0.00079010316,0.00046231455],"domain_scores_gemma":[0.99890953,0.000049603026,0.00012597385,0.0006350617,0.00022329063,0.000056538134],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026147384,0.00023823896,0.00035850305,0.0029130445,0.00033295542,0.00016792412,0.00068760687,0.00007517199,0.002387845],"category_scores_gemma":[0.00023760315,0.00021549338,0.00004607348,0.00157265,0.0013643441,0.00095356506,0.0010448366,0.00022115406,0.00013414584],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000018505227,0.000120309414,0.00018168378,0.0014276303,0.000107891545,0.000021532323,0.00008642009,0.00009252398,0.00003915078,0.7412054,0.23891896,0.017780025],"study_design_scores_gemma":[0.0001683482,0.00002363805,0.00014065336,0.00034267938,0.00011922665,0.000001086635,0.00015135919,0.004414273,0.0000016661285,0.004484293,0.9898966,0.00025616845],"about_ca_topic_score_codex":0.0020782086,"about_ca_topic_score_gemma":0.0007440929,"teacher_disagreement_score":0.75097764,"about_ca_system_score_codex":0.00009310201,"about_ca_system_score_gemma":0.00007495842,"threshold_uncertainty_score":0.9985241},"labels":[],"label_agreement":null},{"id":"W1597828655","doi":"10.1023/a:1019106530558","title":"Threshold-based interventions to optimize performance in preemptive priority queues","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Preemption; Computer science; Service (business); Queueing theory; Queue; Laplace–Stieltjes transform; Computer network; Mathematics; Operating system","score_opus":0.020956963750579694,"score_gpt":0.26308035138373437,"score_spread":0.24212338763315466,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1597828655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9741035,0.0001995576,0.0023558957,0.00024748003,0.00029953342,0.0006417576,0.0000030121835,0.0003157113,0.02183354],"genre_scores_gemma":[0.9965197,0.000005445033,0.00040644323,0.000314445,0.00042288983,0.00014109345,0.000014737172,0.000037223657,0.0021380386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983513,0.000039329512,0.0005475363,0.00042724726,0.00025062237,0.00038397542],"domain_scores_gemma":[0.99919313,0.000060446553,0.00017864017,0.0004340476,0.000109475346,0.000024233554],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008793173,0.00023339197,0.00037675767,0.00048807572,0.00018859227,0.0002719197,0.00036594697,0.00007683691,0.0003538723],"category_scores_gemma":[0.000095622876,0.00023138468,0.00017659989,0.000947629,0.00004267864,0.0011254787,0.0000693782,0.00019535431,0.00075376267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017436827,0.00017426844,0.03407629,0.0010298477,0.000039433475,0.000021897558,0.00019065475,0.9497208,0.0000986083,0.010444313,0.00023143135,0.003798077],"study_design_scores_gemma":[0.0019908103,0.00009370391,0.019481106,0.0071693943,0.0002060247,0.0000048222414,0.0008537736,0.94009495,0.00020434443,0.0015076014,0.026951088,0.0014423579],"about_ca_topic_score_codex":0.001071555,"about_ca_topic_score_gemma":0.00036657802,"teacher_disagreement_score":0.026719656,"about_ca_system_score_codex":0.00013881142,"about_ca_system_score_gemma":0.000020249918,"threshold_uncertainty_score":0.9688345},"labels":[],"label_agreement":null},{"id":"W1600307499","doi":"10.1109/cdc.1988.194746","title":"Planning production and preventive maintenance in a flexible manufacturing system: a stochastic control approach","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Preventive maintenance; Control (management); Production (economics); Piecewise; Flexible manufacturing system; Computer science; Stochastic control; Failure rate; Production control; Control system; Production planning; Mathematical optimization; Optimal control; Artificial intelligence; Engineering; Mathematics; Reliability engineering; Economics","score_opus":0.011023576494530021,"score_gpt":0.21527519866124262,"score_spread":0.2042516221667126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1600307499","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3537322,0.00015375196,0.6136726,0.00008584855,0.00017367993,0.00076329405,5.0188424e-7,0.00029235944,0.031125747],"genre_scores_gemma":[0.99759984,3.9772073e-7,0.0010050556,0.0000940267,0.00012016603,0.00006486733,0.0000020659622,0.000017598271,0.0010959634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990233,0.000030550636,0.0002145383,0.0003645925,0.000111508954,0.00025551466],"domain_scores_gemma":[0.9996166,0.000033795222,0.00014652296,0.0001557256,0.000038618226,0.000008708184],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006555695,0.00014816658,0.00022604127,0.0002729307,0.00011791003,0.000089227775,0.00007070739,0.00003531648,0.000014575629],"category_scores_gemma":[0.00026876916,0.0001293061,0.00003463384,0.0002673494,0.00003697595,0.00077287824,0.000030366693,0.00011390352,0.000015433186],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002831447,0.00016343928,0.0057899035,0.0011873568,0.00014430736,0.000025503987,0.0002985235,0.6901081,0.0004847283,0.30030984,0.00015708197,0.0010480698],"study_design_scores_gemma":[0.009039824,0.00005950286,0.012943799,0.0039838376,0.0011192284,0.00019984246,0.037022516,0.8289243,0.0029822,0.097837776,0.0027610317,0.0031261747],"about_ca_topic_score_codex":0.00005193626,"about_ca_topic_score_gemma":0.000012141755,"teacher_disagreement_score":0.6438677,"about_ca_system_score_codex":0.00005882001,"about_ca_system_score_gemma":0.0000056517943,"threshold_uncertainty_score":0.527295},"labels":[],"label_agreement":null},{"id":"W1606855494","doi":"10.1023/a:1019110631467","title":"Ergodicity of the BMAP/PH/s/s+K retrial queue with PH-retrial times","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":48,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University; University of Winnipeg; Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Retrial queue; Ergodicity; Ergodic theory; Mathematics; Queueing theory; Queue; Burke's theorem; Queueing system; Applied mathematics; Computer science; Discrete mathematics; Computer network; Pure mathematics; Queue management system; Statistics; Fork–join queue","score_opus":0.00887618401332673,"score_gpt":0.20348233799078214,"score_spread":0.1946061539774554,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606855494","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9389156,0.0003094285,0.00082654034,0.00040292938,0.0016227446,0.00087068847,0.000010377365,0.00034819567,0.05669351],"genre_scores_gemma":[0.9911523,0.000005016667,0.00004532266,0.00018613045,0.0033016433,0.000021432761,0.000010020102,0.00005408189,0.0052240947],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99774414,0.00014791613,0.00065851834,0.00043386614,0.0006260227,0.00038951682],"domain_scores_gemma":[0.99818176,0.0001865095,0.0006562715,0.00076122535,0.000193761,0.000020482044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011938335,0.0003035482,0.00060523814,0.00021157032,0.00035362618,0.00023371873,0.00062713964,0.00014213801,0.00065181777],"category_scores_gemma":[0.00034786004,0.00020114334,0.00023629896,0.0013153696,0.00019268974,0.0008023147,0.000103702805,0.00027111178,0.00026821633],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010832778,0.0009497891,0.05946642,0.0036228683,0.0027729885,0.00017726872,0.001558653,0.3304301,0.013890041,0.52199095,0.032907356,0.021400804],"study_design_scores_gemma":[0.024253493,0.0003893981,0.0057265656,0.0089882435,0.0045197196,0.00011951953,0.0034382439,0.26555234,0.008001064,0.028918546,0.6440765,0.0060163303],"about_ca_topic_score_codex":0.0031596315,"about_ca_topic_score_gemma":0.00016931233,"teacher_disagreement_score":0.61116916,"about_ca_system_score_codex":0.000076351214,"about_ca_system_score_gemma":0.00005078405,"threshold_uncertainty_score":0.8202387},"labels":[],"label_agreement":null},{"id":"W1606932269","doi":"10.1109/icdt.2006.59","title":"Performance Analysis of Weighted Fair Queues with Variable Service Rates","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; Université du Québec","funders":"","keywords":"Queue; Fork–join queue; Computer science; Multilevel queue; Bulk queue; Queue management system; Queueing theory; Decoupling (probability); Computer network; Engineering","score_opus":0.005420723927932621,"score_gpt":0.19651227222018294,"score_spread":0.19109154829225034,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1606932269","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92690164,0.000021325379,0.00787725,0.00018751175,0.000020721884,0.00008012925,0.0000025906206,0.00018180322,0.064727],"genre_scores_gemma":[0.99446774,0.000002267109,0.0030735186,0.00058079074,0.00013164963,0.000008113686,0.00013309107,0.000018137382,0.0015846884],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999045,0.000009048071,0.00028336007,0.0002493315,0.00020275604,0.00021047618],"domain_scores_gemma":[0.99895954,0.000051983592,0.00026855673,0.000318777,0.0003951875,0.0000059256927],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00024591328,0.00016381369,0.00035805715,0.00060208305,0.000118418895,0.000070972244,0.00021600263,0.00003916247,0.0010676483],"category_scores_gemma":[0.000010894554,0.00012049953,0.00007628836,0.005376843,0.00004178648,0.0011170139,0.0000676387,0.000058680387,0.0000630262],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002430335,0.00024907952,0.2996634,0.0003548489,0.0020771192,0.000004486898,0.00003077534,0.5012191,0.002622971,0.19212869,0.0007403919,0.00066615123],"study_design_scores_gemma":[0.0003512232,0.000009972143,0.015341592,0.00003744866,0.003119437,3.1326636e-7,0.00016596101,0.96821856,0.0015442701,0.00488631,0.0059977984,0.00032711457],"about_ca_topic_score_codex":0.0033951513,"about_ca_topic_score_gemma":0.001634174,"teacher_disagreement_score":0.4669995,"about_ca_system_score_codex":0.000015629597,"about_ca_system_score_gemma":0.000010709146,"threshold_uncertainty_score":0.9998455},"labels":[],"label_agreement":null},{"id":"W1607625045","doi":"10.1023/a:1012290229844","title":"A Typology for Multi-Technology, Multi-Service Broadband Network Synthesis","year":2002,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Service (business); Prime (order theory); Synchronous optical networking; Notation; Computer network; Distributed computing","score_opus":0.07496590149218849,"score_gpt":0.2865175715434353,"score_spread":0.21155167005124684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1607625045","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2062524,0.03764735,0.66264546,0.034489788,0.0040058084,0.010922166,0.00007150508,0.009632765,0.034332763],"genre_scores_gemma":[0.9707209,0.00009568971,0.026220577,0.0008732066,0.0004419818,0.00076750753,0.00003217907,0.00006114757,0.00078684697],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986737,0.00006681022,0.0004876949,0.00030750423,0.00009197722,0.00037235545],"domain_scores_gemma":[0.9975774,0.00030774742,0.0005224976,0.0012391508,0.00033997622,0.000013201209],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007214157,0.00020479945,0.00039064442,0.00031993556,0.00049466523,0.00012361827,0.00095851166,0.00019735155,0.00012027236],"category_scores_gemma":[0.00048277344,0.00020659986,0.00009651155,0.0011445986,0.00008571963,0.00045243863,0.0002532032,0.00017736935,0.0006842801],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031929393,0.0024795393,0.025023615,0.002407095,0.0019085844,0.0000098782,0.0008672095,0.10614932,0.0055529703,0.73528343,0.033496205,0.086502835],"study_design_scores_gemma":[0.0007986401,0.00000562062,0.00023444106,0.000115208386,0.0001745127,0.0000059061845,0.0009232031,0.73678774,0.000036310477,0.0008026421,0.25974938,0.00036639263],"about_ca_topic_score_codex":0.0002719458,"about_ca_topic_score_gemma":0.00053965254,"teacher_disagreement_score":0.7644685,"about_ca_system_score_codex":0.000055068085,"about_ca_system_score_gemma":0.00000455334,"threshold_uncertainty_score":0.8795265},"labels":[],"label_agreement":null},{"id":"W1608751590","doi":"10.1023/a:1019140005852","title":"A discrete time-limited vacation model for the fair share scheduler","year":2000,"lang":"en","type":"article","venue":"Telecommunication Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Nortel (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Polling system; Markov chain; Queue; Polling; Phase-type distribution; Computer network; Real-time computing","score_opus":0.030308378674501712,"score_gpt":0.26330166792244863,"score_spread":0.23299328924794693,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608751590","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.14847304,0.005463124,0.730797,0.018957116,0.00047363364,0.008788198,0.00013087834,0.0031786286,0.08373842],"genre_scores_gemma":[0.9898811,0.00004210101,0.0008922013,0.0006284181,0.00030450994,0.0005061729,0.0003561898,0.000041766107,0.0073475474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989966,0.000044671666,0.0003752761,0.0002163632,0.0001640778,0.00020302436],"domain_scores_gemma":[0.99797684,0.00024349362,0.00028684092,0.0012485913,0.00023475943,0.000009482607],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00077525416,0.00015496538,0.00019328373,0.00011461156,0.00058171904,0.0002828471,0.0008512093,0.00006758508,0.0003759612],"category_scores_gemma":[0.00012220413,0.000118182055,0.00011337244,0.00047240945,0.00004556899,0.00092675444,0.00009414833,0.00012706715,0.000922095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014828893,0.00009032662,0.00018335818,0.00016715871,0.00020527653,1.3437925e-7,0.0003277331,0.9019267,0.00060864165,0.061097212,0.007275616,0.027969535],"study_design_scores_gemma":[0.0002325484,0.0000022671852,0.00010574049,0.00004224708,0.00009165102,5.829883e-7,0.00015496562,0.91887397,0.000006739859,0.0023851339,0.077953845,0.00015033103],"about_ca_topic_score_codex":0.000099545396,"about_ca_topic_score_gemma":0.000023540588,"teacher_disagreement_score":0.8414081,"about_ca_system_score_codex":0.000049881703,"about_ca_system_score_gemma":0.000012139066,"threshold_uncertainty_score":0.9998558},"labels":[],"label_agreement":null},{"id":"W1608769416","doi":"10.1023/a:1019165221472","title":"On approximating higher order MAPs with MAPs of order two","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Manitoba Beekeepers' Association","funders":"","keywords":"Computer science; Mathematics","score_opus":0.009491983175894652,"score_gpt":0.21984683829162951,"score_spread":0.21035485511573487,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1608769416","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59218395,0.00033866108,0.009645846,0.0005267537,0.000876109,0.0011218876,0.000015796964,0.0009492827,0.39434168],"genre_scores_gemma":[0.98758805,0.0000014852177,0.001312484,0.00039938415,0.0007989181,0.000044824807,0.00004642943,0.00008436656,0.009724061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982476,0.00005009699,0.0005256812,0.00040786597,0.00040707758,0.000361654],"domain_scores_gemma":[0.9986561,0.000113051035,0.000452226,0.0005097006,0.00025277998,0.000016148739],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058588886,0.00028244572,0.0004758479,0.00025100276,0.00019123254,0.00017755292,0.00027794435,0.00006794597,0.0006793988],"category_scores_gemma":[0.00007903421,0.00022366113,0.00006997352,0.0011949885,0.000077364515,0.00066824356,0.00004342577,0.00017728121,0.00044565214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003655392,0.00022698077,0.0033710469,0.0013737386,0.0003732255,0.000055464432,0.00021160417,0.396164,0.0006226316,0.5869414,0.0029108464,0.00738347],"study_design_scores_gemma":[0.011775843,0.000332068,0.0006381035,0.009979746,0.0016026311,0.000058577236,0.0033206884,0.29663223,0.00069273694,0.09891631,0.57070583,0.0053452277],"about_ca_topic_score_codex":0.0011232358,"about_ca_topic_score_gemma":0.000038072583,"teacher_disagreement_score":0.567795,"about_ca_system_score_codex":0.000042350413,"about_ca_system_score_gemma":0.000015788837,"threshold_uncertainty_score":0.9120636},"labels":[],"label_agreement":null},{"id":"W16475425","doi":"10.1023/a:1020933122382","title":"An Eigenvalue Approach to Analyzing a Finite Source Priority Queueing Model","year":2002,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.23955351761846697,"score_gpt":0.41077361102134624,"score_spread":0.17122009340287928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W16475425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6117095,0.0001943095,0.35712534,0.0024865554,0.000022600729,0.00053759996,0.0000090432995,0.00012768421,0.027787369],"genre_scores_gemma":[0.9885694,0.00003851523,0.007826497,0.000646764,0.00029055582,0.00005467236,0.000021357859,0.00003190436,0.0025203663],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99799037,0.000119854616,0.0003581315,0.00043510116,0.0006101628,0.00048639963],"domain_scores_gemma":[0.99791795,0.00009317424,0.000045831363,0.00066701544,0.0012237713,0.000052285162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026592754,0.0001438421,0.00024159889,0.001130851,0.00079090375,0.00044383414,0.0005698017,0.00006656977,0.00016293782],"category_scores_gemma":[0.001167768,0.00014320259,0.00010279704,0.0020949112,0.000109304034,0.0018716158,0.00023663245,0.00031887146,0.0002241255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015772272,0.00026902484,0.00028347914,0.000037939553,0.000034013567,0.0000010617468,0.00052737334,0.95891756,0.0026498784,0.031810306,0.0005156077,0.0049379626],"study_design_scores_gemma":[0.00008918422,0.000016882153,0.00005851714,0.000021343238,0.000014434544,2.7299018e-7,0.00041473104,0.99482834,0.0005140654,0.0018380329,0.0020424686,0.00016174169],"about_ca_topic_score_codex":0.00063026446,"about_ca_topic_score_gemma":0.00012379397,"teacher_disagreement_score":0.37685987,"about_ca_system_score_codex":0.000020809193,"about_ca_system_score_gemma":0.000025700705,"threshold_uncertainty_score":0.60830724},"labels":[],"label_agreement":null},{"id":"W1677257499","doi":"10.1109/cdc.1994.410982","title":"Optimal hedging surface policy for manufacturing flow and preventive maintenance","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Preventive maintenance; Production (economics); Failure rate; Constant (computer programming); Function (biology); Mathematical optimization; Time horizon; Commodity; Computer science; Production rate; Mathematics; Reliability engineering; Economics; Engineering; Statistics; Process engineering; Microeconomics","score_opus":0.012413510269722398,"score_gpt":0.2295117920851947,"score_spread":0.2170982818154723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1677257499","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7449252,0.00018023273,0.22895157,0.0036127581,0.00014221114,0.00056469784,0.0000055781697,0.0005857552,0.021031987],"genre_scores_gemma":[0.9685033,0.000016070919,0.020848438,0.00094986026,0.00054124376,0.000012491343,0.00000440762,0.000039922936,0.009084282],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991309,0.0000058603637,0.00016215318,0.00029177667,0.000085475316,0.00032382112],"domain_scores_gemma":[0.9995867,0.000074161224,0.00010766869,0.00016600908,0.000052818334,0.0000126567165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021496833,0.00015512841,0.00017834785,0.00013260558,0.00022138482,0.00014889648,0.00012929505,0.00003361806,0.00020071396],"category_scores_gemma":[0.00014105513,0.00013910721,0.00008171075,0.00017596078,0.000048877362,0.0009317777,0.00012973687,0.00006590683,0.0000772402],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027578988,0.00027623645,0.0021185419,0.0010245888,0.0005285008,0.000036926314,0.00062108185,0.54196304,0.0019997552,0.2977921,0.014040872,0.13932255],"study_design_scores_gemma":[0.00091720995,0.000010796678,0.00032836388,0.00008011378,0.00011388566,0.000004064782,0.00044363135,0.9271131,0.0022546882,0.02625149,0.04199135,0.0004912958],"about_ca_topic_score_codex":0.00005844348,"about_ca_topic_score_gemma":0.000015302396,"teacher_disagreement_score":0.38515007,"about_ca_system_score_codex":0.000031205327,"about_ca_system_score_gemma":0.0000022351978,"threshold_uncertainty_score":0.56726277},"labels":[],"label_agreement":null},{"id":"W1747814569","doi":"10.1109/cdc.1995.478826","title":"Stochastic manufacturing systems under unknown demand and robust control criteria","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematical optimization; Minimax; Markov chain; Bellman equation; Lipschitz continuity; Bounded function; Markov process; Production control; Markov decision process; State space; Stochastic control; Mathematics; Computer science; Control theory (sociology); Function (biology); Production (economics); Optimal control; Control (management); Economics; Statistics","score_opus":0.020152164074817593,"score_gpt":0.21343778282823989,"score_spread":0.1932856187534223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1747814569","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22098741,0.00084699993,0.75427043,0.0009940795,0.0004986117,0.00042545475,0.0000021247204,0.00046855412,0.021506319],"genre_scores_gemma":[0.9957862,0.0000044480503,0.00012133575,0.00090960733,0.00053950166,0.0000136847775,0.0000029140913,0.000026638229,0.0025956922],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990563,0.00001674294,0.00022880698,0.00029071624,0.00013826131,0.00026922012],"domain_scores_gemma":[0.99950236,0.00009876765,0.00011951611,0.0002109174,0.0000501747,0.000018289225],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023882992,0.0001864023,0.00025907843,0.00018383257,0.0002145802,0.00038941027,0.000121233774,0.00005252773,0.001001337],"category_scores_gemma":[0.000051268074,0.00015742633,0.000048627404,0.00012589809,0.00005724909,0.00085450883,0.00007342905,0.00008798217,0.00023179936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049732986,0.00007814738,0.00026184667,0.00030276403,0.00023193868,0.000024436484,0.000039617935,0.8583365,0.00047191745,0.13630387,0.0022714352,0.0016278017],"study_design_scores_gemma":[0.0010841604,0.000006396974,0.00037835538,0.00007080052,0.00027338602,0.0000102059175,0.0002774057,0.9866731,0.000023863144,0.007418103,0.0033860465,0.00039818345],"about_ca_topic_score_codex":0.00007876716,"about_ca_topic_score_gemma":0.000026545331,"teacher_disagreement_score":0.77479875,"about_ca_system_score_codex":0.0000209512,"about_ca_system_score_gemma":0.000001044618,"threshold_uncertainty_score":0.9999119},"labels":[],"label_agreement":null},{"id":"W1750312412","doi":"10.1109/cdc.1989.70304","title":"Optimal scheduling control in a multi-class fluid network","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Queueing theory; Computer science; Scheduling (production processes); Class (philosophy); Mathematical optimization; Set (abstract data type); Job shop scheduling; Flow network; Sequence (biology); Theoretical computer science; Distributed computing; Computer network; Mathematics; Artificial intelligence","score_opus":0.015423092279404872,"score_gpt":0.2379479361509539,"score_spread":0.22252484387154903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1750312412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3123813,0.00029258625,0.64312786,0.0005376772,0.00036268984,0.00037493528,4.609186e-7,0.00036667913,0.04255578],"genre_scores_gemma":[0.97658163,0.0000025052823,0.019461978,0.0029613103,0.00029971503,0.000018201441,0.0000032603011,0.000026026148,0.0006453917],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988825,0.000029796613,0.0002793307,0.0002811333,0.0001210276,0.00040621197],"domain_scores_gemma":[0.9995102,0.00008187313,0.00010593337,0.00022247486,0.000068089896,0.000011385384],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007598962,0.00016397488,0.0002498899,0.00017186839,0.00012120795,0.00011578884,0.00015575209,0.000060339553,0.0005652379],"category_scores_gemma":[0.0003623395,0.00015285201,0.00009063837,0.0007222601,0.000035708046,0.00070529827,0.000042653697,0.00014324774,0.00036819078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034684563,0.00005799826,0.0079415,0.000013056835,0.000029535495,0.000015724867,0.0000071684917,0.84835374,0.00034256565,0.14281088,0.00015049317,0.0002426703],"study_design_scores_gemma":[0.0018433358,0.0000032961777,0.00028121332,0.000032465505,0.00005894383,0.0000010601757,0.00018385302,0.96979976,0.000042250944,0.0051179063,0.022339137,0.00029676437],"about_ca_topic_score_codex":0.000057963753,"about_ca_topic_score_gemma":0.00013521888,"teacher_disagreement_score":0.6642003,"about_ca_system_score_codex":0.000031476276,"about_ca_system_score_gemma":0.000010207516,"threshold_uncertainty_score":0.6233124},"labels":[],"label_agreement":null},{"id":"W1752242982","doi":"10.1023/a:1010952012771","title":"Existence Condition for the Diffusion Approximations of Multiclass Priority Queueing Networks","year":2001,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Semimartingale; Heavy traffic approximation; Queueing theory; Mathematics; Brownian motion; Stability (learning theory); Diffusion; Reflected Brownian motion; Applied mathematics; Computer science; Mathematical optimization; Diffusion process; Discrete mathematics; Physics; Geometric Brownian motion","score_opus":0.02045667733063701,"score_gpt":0.25825566694790636,"score_spread":0.23779898961726936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1752242982","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37362096,0.00042697784,0.62233806,0.00022027503,0.00066191336,0.0011052735,0.000004146854,0.00020816454,0.0014142041],"genre_scores_gemma":[0.9978889,0.000018697481,0.00044567767,0.00009377755,0.0009863565,0.00013789658,0.00003597295,0.000029152758,0.00036355652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987117,0.000043185057,0.00048136865,0.0002686561,0.00022177925,0.00027329833],"domain_scores_gemma":[0.99822676,0.00048964296,0.0005952582,0.00040123914,0.00027561956,0.00001149324],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009725913,0.00017008485,0.00028519542,0.00014129671,0.00052769686,0.00018332204,0.0003001774,0.00008161585,0.000013455606],"category_scores_gemma":[0.00035199767,0.00013032906,0.00014352195,0.00054054044,0.00009442004,0.0007768897,0.00008443515,0.00012363747,0.000012936059],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013840305,0.00017064763,0.028876122,0.0007393374,0.00022201115,0.0000052394107,0.0002822589,0.40447614,0.0026717961,0.5551132,0.0003912227,0.0069136503],"study_design_scores_gemma":[0.0003971303,0.000007376834,0.0019140998,0.00024114194,0.00016051525,0.0000041334015,0.0007220895,0.9883818,0.000023185754,0.0029358317,0.0050299754,0.00018270325],"about_ca_topic_score_codex":0.0012313261,"about_ca_topic_score_gemma":0.00010734351,"teacher_disagreement_score":0.62426794,"about_ca_system_score_codex":0.000053988802,"about_ca_system_score_gemma":0.000011846972,"threshold_uncertainty_score":0.53146654},"labels":[],"label_agreement":null},{"id":"W1772766245","doi":"10.1109/mascot.1998.693681","title":"An empirical comparison of diffusion approximations and simulation in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov process; Markov chain; Computer science; Steady state (chemistry); Diffusion; Process (computing); Statistical physics; Applied mathematics; Mathematical optimization; Mathematics; Statistics; Physics; Thermodynamics; Chemistry; Machine learning","score_opus":0.038391542964335,"score_gpt":0.3151768125799729,"score_spread":0.2767852696156379,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1772766245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84292936,0.00003669797,0.15403546,0.00012730029,0.000016964164,0.00007806882,1.08410525e-7,0.000046232373,0.0027298292],"genre_scores_gemma":[0.99878263,0.000002178406,0.000910702,0.00015365596,0.00008226493,0.00000235126,0.000010820125,0.000006541522,0.00004885245],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994754,0.000013741677,0.00021525151,0.00012904507,0.0000788803,0.00008768688],"domain_scores_gemma":[0.99965537,0.00007289266,0.00010554805,0.0001228155,0.000037419893,0.0000059419276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012968543,0.00006493473,0.00014324045,0.00014837823,0.000061570245,0.000035833236,0.000056559595,0.000039688275,0.00022752183],"category_scores_gemma":[0.000052647625,0.000057805057,0.000020394895,0.00040138068,0.000030028219,0.00062957464,0.000037652215,0.00005896347,0.000007994736],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008392773,0.00016369425,0.19196878,0.0000128172105,0.0000031627872,2.3088184e-7,0.00008798954,0.7946125,0.000048028258,0.0038912364,0.00004043317,0.009162735],"study_design_scores_gemma":[0.0001819311,0.000004809254,0.016836504,0.000009264637,0.000017454217,4.0609066e-8,0.00017320242,0.9796493,0.0000034458774,0.0027739839,0.000282799,0.00006725062],"about_ca_topic_score_codex":0.000035485693,"about_ca_topic_score_gemma":0.000095377,"teacher_disagreement_score":0.18503682,"about_ca_system_score_codex":0.0000080213085,"about_ca_system_score_gemma":4.4405985e-7,"threshold_uncertainty_score":0.24912046},"labels":[],"label_agreement":null},{"id":"W1781067896","doi":"10.1109/ccece.2001.933767","title":"Modelling with queues: an empirical study","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Computer science; Fork–join queue; Mirroring; Queue; Queueing theory; Processor sharing; Queue management system; Parallel computing; Distributed computing; Computer network","score_opus":0.05122774552966593,"score_gpt":0.2758637575456106,"score_spread":0.22463601201594469,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1781067896","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8430296,0.000013231774,0.118811086,0.00023730531,0.00002710339,0.0001604707,1.0854858e-7,0.00035111103,0.03736995],"genre_scores_gemma":[0.99496454,8.5694876e-7,0.0019015718,0.0010779921,0.0003510773,0.000010667932,0.0000025673803,0.000026182677,0.0016645626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912137,0.000014364548,0.00015651053,0.00030382982,0.00020450688,0.00019940296],"domain_scores_gemma":[0.99947995,0.000023071985,0.00007116131,0.0003271795,0.00008611746,0.0000125196275],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002086777,0.00014004059,0.00016429089,0.00015847172,0.00016875922,0.00016576,0.00018399837,0.000024629919,0.0013506198],"category_scores_gemma":[0.000010729383,0.000100976795,0.000034778164,0.00050793664,0.000029694727,0.0014335645,0.00005337585,0.00009428241,0.00045177797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006455236,0.0012017993,0.04314198,0.000017778784,0.00009892572,0.00005501196,0.00048797904,0.93736124,0.000008019069,0.014740019,0.00066261296,0.0021600644],"study_design_scores_gemma":[0.00034618672,0.000038626644,0.000079399884,0.000005941845,0.00009967582,8.3791343e-7,0.0019558787,0.98714477,0.0000026188231,0.003687366,0.00642512,0.00021355135],"about_ca_topic_score_codex":0.00020327391,"about_ca_topic_score_gemma":0.00016366021,"teacher_disagreement_score":0.15193489,"about_ca_system_score_codex":0.000013328473,"about_ca_system_score_gemma":0.000001551795,"threshold_uncertainty_score":0.99956226},"labels":[],"label_agreement":null},{"id":"W1829880288","doi":"10.1109/wescan.1995.494063","title":"Approximate method for polling systems with time-limited-based polling tables","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg; University of Manitoba","funders":"","keywords":"Polling; Polling system; Computer science; Computer network; Set (abstract data type); Table (database); Communications system; Real-time computing; Computer multitasking; Operating system","score_opus":0.021536700870399803,"score_gpt":0.23624902231570993,"score_spread":0.21471232144531013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1829880288","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001918771,0.00024137057,0.98457766,0.00045011207,0.00008506111,0.00048503658,0.0000063063862,0.0005029508,0.011732752],"genre_scores_gemma":[0.59828645,0.0000064150568,0.38360512,0.0029932281,0.0017475224,0.0002670959,0.00012612205,0.00023449643,0.012733535],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852675,0.000024354384,0.00033047574,0.00043081434,0.00022930081,0.00045829362],"domain_scores_gemma":[0.99882394,0.00028783517,0.00030090602,0.00035452936,0.00021380978,0.000018964553],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007729836,0.00027091827,0.00039732596,0.00038446832,0.0003628218,0.00039695785,0.00024623465,0.00006975156,0.00047784834],"category_scores_gemma":[0.00012749096,0.00021045684,0.00012692541,0.00080347765,0.00003628681,0.0008428158,0.000041398354,0.00009207375,0.00017513598],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023006105,0.00018591971,0.0004861954,0.00093823706,0.00032211377,0.000012625924,0.000038134793,0.7924443,0.0038644338,0.19503258,0.0017272586,0.0047181714],"study_design_scores_gemma":[0.0006662057,0.00001241823,0.0000013088118,0.000110400164,0.00026039866,0.0000015377005,0.0001804382,0.97984034,0.0006523155,0.0016965803,0.016233094,0.0003449824],"about_ca_topic_score_codex":0.00018916289,"about_ca_topic_score_gemma":0.000015698557,"teacher_disagreement_score":0.60097253,"about_ca_system_score_codex":0.000036281934,"about_ca_system_score_gemma":0.000005975273,"threshold_uncertainty_score":0.85821813},"labels":[],"label_agreement":null},{"id":"W1852912980","doi":"10.1109/ccece.1995.528067","title":"A simple upper bound for blocking probabilities in large multi-rate loss networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; McGill University","funders":"","keywords":"Blocking (statistics); Upper and lower bounds; Computer science; Computation; Gaussian; Simple (philosophy); Routing (electronic design automation); Laplace transform; Mathematical optimization; Algorithm; Topology (electrical circuits); Mathematics; Computer network","score_opus":0.023026734838712034,"score_gpt":0.24719529561314005,"score_spread":0.224168560774428,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1852912980","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7840502,0.00030496778,0.206536,0.00089183456,0.0002488598,0.0010753538,0.000005805122,0.0004646229,0.0064223153],"genre_scores_gemma":[0.99343204,0.000006021599,0.0011314158,0.0016323267,0.00045435873,0.00009245434,0.000019753621,0.000035699315,0.0031959545],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987586,0.000016518288,0.00030531568,0.0003278342,0.00008461629,0.0005070755],"domain_scores_gemma":[0.99937344,0.00014988227,0.00012082652,0.00024754182,0.00009862122,0.000009663107],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006415113,0.0001808284,0.00024335597,0.00019796597,0.00022581029,0.00021722834,0.00018207594,0.000067762936,0.0009570064],"category_scores_gemma":[0.0002864753,0.00016398073,0.00012116179,0.00047123228,0.000050067905,0.0009273293,0.00012327275,0.00011098752,0.00007454905],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019467667,0.0011339794,0.26329404,0.00066871836,0.00021451253,0.00003877364,0.0006157498,0.27148086,0.00013769012,0.45039457,0.0051685027,0.006657943],"study_design_scores_gemma":[0.00095924485,0.000004664239,0.0009015779,0.000029021983,0.00004096571,3.6654797e-7,0.00037180996,0.92998743,0.000013144815,0.033670828,0.033742856,0.00027810028],"about_ca_topic_score_codex":0.000100958154,"about_ca_topic_score_gemma":0.0013085859,"teacher_disagreement_score":0.6585066,"about_ca_system_score_codex":0.000041219948,"about_ca_system_score_gemma":0.0000026385258,"threshold_uncertainty_score":0.99995625},"labels":[],"label_agreement":null},{"id":"W1871838179","doi":"10.1109/acc.1995.531285","title":"Age dependent hedging point policies in manufacturing systems","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Point (geometry); Stocking; Computer science; Mathematical optimization; Operations research; Industrial organization; Mathematical economics; Industrial engineering; Economics; Mathematics; Engineering","score_opus":0.012700157692413205,"score_gpt":0.23127219020540243,"score_spread":0.21857203251298923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1871838179","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9101227,0.000105846964,0.0052412916,0.0009607861,0.00015951612,0.00016921911,3.3187516e-7,0.0002980401,0.08294231],"genre_scores_gemma":[0.995188,0.0000041557364,0.00025583638,0.0011537246,0.00084684405,0.000012536817,0.0000045430866,0.000022878789,0.002511506],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989467,0.000011527137,0.0003018084,0.00023581486,0.00017578292,0.00032835125],"domain_scores_gemma":[0.99957174,0.000036608206,0.00011755971,0.00024309508,0.000021217427,0.000009789802],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004248505,0.00015587613,0.0002119735,0.000454744,0.00010147089,0.00027321503,0.0002112305,0.000038758135,0.00021889887],"category_scores_gemma":[0.000044572986,0.00013958261,0.00006325982,0.00022008619,0.000022890632,0.0012296683,0.00016989201,0.000118205026,0.0004599984],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004130411,0.00013486213,0.0071626822,0.0002612829,0.000074518546,0.00015525207,0.0002928509,0.73278546,0.0018735727,0.24304415,0.00061868294,0.013555359],"study_design_scores_gemma":[0.004487104,0.00002006536,0.025776846,0.00094645354,0.0003949717,0.000053323827,0.016899873,0.6055919,0.018823097,0.065121025,0.2578878,0.003997533],"about_ca_topic_score_codex":0.0015395652,"about_ca_topic_score_gemma":0.0013077868,"teacher_disagreement_score":0.2572691,"about_ca_system_score_codex":0.00010112725,"about_ca_system_score_gemma":0.000003140594,"threshold_uncertainty_score":0.59125024},"labels":[],"label_agreement":null},{"id":"W1874450078","doi":"10.1109/ipds.1996.540196","title":"Mean value analysis for computer systems with variabilities in workload","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Austrian Science Fund","keywords":"Histogram; Computer science; Percentile; Queueing theory; Algorithm; Interval (graph theory); Workload; Data mining; Artificial intelligence; Mathematics; Statistics","score_opus":0.016033808668361873,"score_gpt":0.2046581603015198,"score_spread":0.1886243516331579,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1874450078","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08241472,0.0002273704,0.8870914,0.00044426805,0.00022322101,0.0005439183,0.0000020676164,0.00029708951,0.028755967],"genre_scores_gemma":[0.99078834,0.0000033103124,0.0059526507,0.0004940828,0.00064813386,0.00005908352,0.000010249379,0.000020581998,0.0020235905],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894774,0.000017336266,0.00028335556,0.00032902148,0.00016075536,0.00026180028],"domain_scores_gemma":[0.9992287,0.0001973747,0.00013496762,0.00031614024,0.00011386433,0.0000089159485],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004830328,0.00016294568,0.00037775704,0.0006017954,0.00009312511,0.00015511941,0.00018324767,0.00004347701,0.00027474377],"category_scores_gemma":[0.00003502699,0.0001248767,0.0001354531,0.0017398973,0.000044095756,0.00065222284,0.000052027313,0.00006478244,0.000053508295],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003779602,0.00008873715,0.025794366,0.000119235476,0.0005671544,0.0000045520933,0.000107194384,0.7841671,0.0000044226445,0.18727627,0.0004993726,0.0013338057],"study_design_scores_gemma":[0.00046033494,0.000010588128,0.0008011789,0.000049050894,0.00068747345,4.1025677e-7,0.0004528091,0.9886822,0.0000033733743,0.0033769743,0.005212202,0.00026336443],"about_ca_topic_score_codex":0.0004559393,"about_ca_topic_score_gemma":0.0005163388,"teacher_disagreement_score":0.9083736,"about_ca_system_score_codex":0.000040401137,"about_ca_system_score_gemma":0.0000020854234,"threshold_uncertainty_score":0.50923234},"labels":[],"label_agreement":null},{"id":"W1884525496","doi":"10.3138/infor.50.2.072","title":"A Simple and Extended Computational Analysis of <i>M/G</i><sub><i>j</i></sub><sup>(<i>a,b</i>)</sup>/1 and <i>M/G</i><sub><i>j</i></sub><sup>(<i>a,b</i>)</sup>/1/(<i>B</i> + <i>b</i>) Queues Using Roots","year":2012,"lang":"yi","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Burke's theorem; Mathematics; Poisson distribution; Distribution (mathematics); Queue; Combinatorics; Queueing theory; Space (punctuation); Markov chain; State space; Discrete mathematics; Function (biology); Simple (philosophy); Fork–join queue; Mathematical analysis; Statistics; Computer science; Queue management system","score_opus":0.03292495070920296,"score_gpt":0.3068646245385907,"score_spread":0.2739396738293877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1884525496","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98056406,0.005218198,0.008093812,0.00042092853,0.00027888775,0.002358737,0.0009437265,0.0001773635,0.001944269],"genre_scores_gemma":[0.99286234,0.0014504106,0.0005299528,0.0015216325,0.001063679,0.00023768966,0.002141873,0.00012927281,0.000063138825],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9880735,0.000736185,0.0039217845,0.0011548745,0.003942602,0.0021710324],"domain_scores_gemma":[0.9894883,0.0022264805,0.0018041837,0.0010033536,0.0048695,0.00060819666],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":["metaepi_narrow","scholarly_communication"],"category_scores_codex":[0.009852535,0.0013390183,0.002234517,0.004967238,0.0026941379,0.0037486176,0.00072816893,0.0007951803,0.00007251209],"category_scores_gemma":[0.0017293976,0.0013623221,0.00052280485,0.005442251,0.0015329034,0.018425096,0.0014627087,0.0013723051,0.00017210709],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013149721,0.00064487796,0.03211469,0.0045592487,0.005032271,0.000017942037,0.0073236926,0.85303944,0.007157301,0.07337857,0.0041977474,0.011219234],"study_design_scores_gemma":[0.0031033482,0.00017702275,0.00757669,0.00074546726,0.0022015024,0.000110749905,0.00963795,0.9468821,0.0016333141,0.0014520453,0.024688171,0.0017916389],"about_ca_topic_score_codex":0.0011036404,"about_ca_topic_score_gemma":0.000111949914,"teacher_disagreement_score":0.09384265,"about_ca_system_score_codex":0.00036610104,"about_ca_system_score_gemma":0.00059718586,"threshold_uncertainty_score":0.9999361},"labels":[],"label_agreement":null},{"id":"W1890330007","doi":"10.1109/cdc.1996.573565","title":"A framework for dimensioning and connection acceptance control in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Dimensioning; Variable bitrate; Computer science; Constant bitrate; Quality of service; Asynchronous Transfer Mode; Computer network; Moment (physics); Connection (principal bundle); Constant (computer programming); Leaky bucket; Admission control; Real-time computing; Mathematics; Engineering","score_opus":0.015562799025817156,"score_gpt":0.23669445082928753,"score_spread":0.22113165180347039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1890330007","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.077340044,0.00034768874,0.91815037,0.0009470072,0.00016365926,0.00028670498,2.6576964e-7,0.00012957056,0.0026347155],"genre_scores_gemma":[0.9920732,0.000014859362,0.003986755,0.0032123814,0.00040177206,0.000036729038,0.000001929526,0.000015740932,0.0002566427],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99935395,0.000008066826,0.00016465038,0.00021956435,0.000054834643,0.0001989246],"domain_scores_gemma":[0.99942935,0.00029666847,0.00010234104,0.00011924987,0.00004567163,0.000006722422],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023823186,0.000102492566,0.0001715575,0.00010973399,0.00013656548,0.00009779884,0.00005949893,0.000066355424,0.00032729132],"category_scores_gemma":[0.00032993124,0.000094527,0.00004195551,0.00033318772,0.000027574595,0.00060766295,0.00003059932,0.00010286103,0.000021783528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001811331,0.000072878734,0.025274612,0.00005327473,0.00005873371,0.000005896206,0.00004990312,0.08730125,0.00012225522,0.85250413,0.0012307257,0.03314522],"study_design_scores_gemma":[0.0006320073,0.0000052068312,0.0006655383,0.000044391458,0.00003806072,4.903737e-7,0.00009130772,0.9119347,0.0000038299663,0.082975306,0.0034725848,0.00013661626],"about_ca_topic_score_codex":0.00002314902,"about_ca_topic_score_gemma":0.000074583746,"teacher_disagreement_score":0.9147332,"about_ca_system_score_codex":0.00001564962,"about_ca_system_score_gemma":5.7509766e-7,"threshold_uncertainty_score":0.3854699},"labels":[],"label_agreement":null},{"id":"W1906497528","doi":"10.3968/j.sms.1923845220130702.2866","title":"Stability of Nested Queue Model With Finite Waiting Capacity","year":2013,"lang":"en","type":"article","venue":"Studies in mathematical sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Server; Queue; Stability (learning theory); Exponential distribution; Computer science; Service (business); Computer network; Queueing theory; Exponential function; Simulation; Operations research; Real-time computing; Mathematics; Statistics","score_opus":0.11386054119833551,"score_gpt":0.30734350001643185,"score_spread":0.19348295881809635,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1906497528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9788859,0.000029319715,0.006600863,0.00042829112,0.00001919213,0.00019751619,4.555161e-7,0.000041845153,0.013796613],"genre_scores_gemma":[0.9901575,0.0000025902277,0.009624785,0.00011913868,0.00003301708,0.000035603858,2.0233671e-7,0.0000050217245,0.000022181783],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880356,0.00002176373,0.00034585138,0.0002533188,0.00031739025,0.0002581102],"domain_scores_gemma":[0.9987974,0.00062722416,0.00019826768,0.0001699131,0.00019858395,0.000008605259],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012975234,0.00012559125,0.00033875945,0.0001108917,0.0001903261,0.000053024683,0.00026746048,0.000022307202,0.00011995717],"category_scores_gemma":[0.0021916707,0.00007738771,0.00004068584,0.0009218758,0.0014999829,0.0009249105,0.00019437971,0.00008339067,0.00003409117],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000016623575,0.00025657544,0.018417655,0.0012672101,0.000068746886,0.0000023287664,0.002334271,0.06386972,0.0005424908,0.9122518,0.000045515033,0.000927074],"study_design_scores_gemma":[0.00006795372,0.000007389933,0.00014377877,0.00012573728,0.00001769239,2.1065578e-7,0.0046563167,0.49051672,0.00008666143,0.5042859,0.0000024381309,0.00008925479],"about_ca_topic_score_codex":0.00009198876,"about_ca_topic_score_gemma":0.00011086407,"teacher_disagreement_score":0.42664698,"about_ca_system_score_codex":0.000024632434,"about_ca_system_score_gemma":0.000010573756,"threshold_uncertainty_score":0.55267495},"labels":[],"label_agreement":null},{"id":"W1919022143","doi":"10.1109/icc.1992.268077","title":"Performance evaluation of a circuit-switched node with queuable overflow traffic","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Queue; Computer science; Node (physics); Computer network; Queueing theory; Buffer (optical fiber); Buffer overflow; Transmission (telecommunications); Service (business); Resource (disambiguation); Telecommunications; Engineering","score_opus":0.02415187085882591,"score_gpt":0.23634923474821856,"score_spread":0.21219736388939264,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919022143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90851814,0.000028411316,0.0032804015,0.00002709256,0.000042456624,0.00017120937,2.0225374e-7,0.00007721323,0.08785491],"genre_scores_gemma":[0.99866664,0.0000024340845,0.0005283715,0.00021601582,0.0000624291,0.000020217672,0.000006936749,0.000020143307,0.00047678678],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988784,0.000024531726,0.00021185631,0.00022036518,0.00047060498,0.00019423972],"domain_scores_gemma":[0.9990696,0.000029236036,0.0002018002,0.00029122463,0.00040073914,0.0000074468517],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012662451,0.0001340625,0.00019360935,0.00017911251,0.000095814,0.00004135204,0.00011597306,0.0000366148,0.0012062548],"category_scores_gemma":[0.000177781,0.000107058055,0.00005004663,0.00071579905,0.000041852956,0.0009861267,0.000015181178,0.00006666469,0.00009298149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011466527,0.00023693718,0.02359595,0.00021363137,0.0001644668,0.000001661074,0.00011259062,0.8765853,0.0025147654,0.07709667,0.0001979261,0.019165441],"study_design_scores_gemma":[0.0023466493,0.000029010123,0.004402821,0.00011294729,0.0008135785,0.0000033522028,0.0006248776,0.9797293,0.0029346365,0.0061279098,0.0023673691,0.00050752953],"about_ca_topic_score_codex":0.00003081485,"about_ca_topic_score_gemma":0.00006284229,"teacher_disagreement_score":0.10314403,"about_ca_system_score_codex":0.000042993714,"about_ca_system_score_gemma":0.00004440198,"threshold_uncertainty_score":0.9997068},"labels":[],"label_agreement":null},{"id":"W1919642343","doi":"10.1023/a:1019942711261","title":"The Finite Element Method for Computing the Stationary Distribution of an SRBM in a Hypercube with Applications to Finite Buffer Queueing Networks","year":2002,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Applied mathematics; Brownian motion; Fractional Brownian motion; Stationary distribution; Reflected Brownian motion; Piecewise; Subspace topology; Queueing theory; Algorithm; Mathematical optimization; Computer science; Markov chain; Diffusion process; Mathematical analysis; Geometric Brownian motion","score_opus":0.01804850739439129,"score_gpt":0.2668036029076193,"score_spread":0.248755095513228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1919642343","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027242158,0.00024052983,0.97022194,0.0005060765,0.0000831334,0.0014341366,0.0000134382935,0.00007526437,0.00018335601],"genre_scores_gemma":[0.9952402,0.0000055532546,0.0032253538,0.00028341595,0.0005248824,0.000469282,0.000121920544,0.000033044602,0.00009632846],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984144,0.00013826556,0.0005536969,0.00032129293,0.00023624208,0.000336124],"domain_scores_gemma":[0.9973913,0.0014807123,0.00042728288,0.0004360444,0.00024767718,0.000016994765],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019489775,0.00018218132,0.00025806454,0.000117294534,0.00064897456,0.0002335651,0.00035479237,0.000047831487,0.000004360794],"category_scores_gemma":[0.00020273942,0.000118669406,0.0000662849,0.00093992305,0.000046888545,0.0004037342,0.00008130421,0.00014415773,0.000007617747],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004140851,0.00004207907,0.0016414048,0.0000718941,0.00005182892,7.9659014e-7,0.00019811674,0.93021923,0.000031282572,0.05689097,0.00009450288,0.010716466],"study_design_scores_gemma":[0.0002720478,0.000022656694,0.00073451345,0.00015397267,0.00007272627,0.0000014843353,0.0011975082,0.9842708,0.0000071405457,0.0010097232,0.01208926,0.00016818264],"about_ca_topic_score_codex":0.0007478579,"about_ca_topic_score_gemma":0.00030157907,"teacher_disagreement_score":0.9679981,"about_ca_system_score_codex":0.00008238089,"about_ca_system_score_gemma":0.000008903936,"threshold_uncertainty_score":0.4991453},"labels":[],"label_agreement":null},{"id":"W1922754188","doi":"10.1109/glocom.2000.891896","title":"Performance evaluation of a wireless ATM switch using priority-based dynamic capacity allocation scheme","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Markov process; Computer network; Time division multiple access; Scheduling (production processes); Wireless; Markov chain; Asynchronous Transfer Mode; Real-time computing; Telecommunications; Engineering","score_opus":0.04897900364658581,"score_gpt":0.2688520985552522,"score_spread":0.2198730949086664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1922754188","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97571135,0.000019863584,0.021222768,0.000112608286,0.000067777764,0.0002220454,4.825288e-7,0.00008644368,0.0025566812],"genre_scores_gemma":[0.9958379,0.0000025897175,0.0038061128,0.00016192869,0.0000868259,0.00001093276,0.000013669129,0.000017955505,0.00006205448],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987221,0.000031335934,0.00030324497,0.0002410351,0.00052095426,0.0001813377],"domain_scores_gemma":[0.99868566,0.000029213803,0.00033293723,0.00030918818,0.0006350588,0.0000079175625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011523811,0.00014249161,0.00019040018,0.00023421537,0.00016086633,0.000045225763,0.0001562184,0.00005855334,0.0005726511],"category_scores_gemma":[0.00013611437,0.00014041222,0.00007233157,0.00074068474,0.000060643986,0.0011268497,0.000039012062,0.000090264104,0.00007002861],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012917283,0.0008388018,0.08893956,0.0011814547,0.00024159417,0.0000014589223,0.00025330498,0.5618299,0.18179646,0.019135581,0.000053060074,0.1455996],"study_design_scores_gemma":[0.0004745578,0.000004247843,0.0024525002,0.000058676473,0.0001961407,2.8806318e-7,0.00004757144,0.99438035,0.001450979,0.00071102387,0.000057329016,0.00016632969],"about_ca_topic_score_codex":0.00015191469,"about_ca_topic_score_gemma":0.00008961834,"teacher_disagreement_score":0.4325504,"about_ca_system_score_codex":0.0001443476,"about_ca_system_score_gemma":0.000018401997,"threshold_uncertainty_score":0.6270128},"labels":[],"label_agreement":null},{"id":"W1926121256","doi":"10.1109/icc.1989.49832","title":"Dynamic link bandwidth allocation in an integrated services network","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Reservation; Bandwidth (computing); Computer science; Computer network; Call blocking; Dynamic bandwidth allocation; Service (business); Revenue; Bandwidth allocation; Quality of service; Blocking (statistics)","score_opus":0.007074322023917639,"score_gpt":0.2292470916561222,"score_spread":0.22217276963220456,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1926121256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9108092,0.00013557237,0.051556908,0.00072348805,0.00033411136,0.00029412628,4.3415622e-7,0.00049044535,0.035655703],"genre_scores_gemma":[0.99456006,0.000005405343,0.0029610652,0.0016720099,0.00013029887,0.000009645846,0.00008551211,0.0000197567,0.00055626343],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992085,0.000031390467,0.00021193919,0.00023810459,0.00009177104,0.00021830022],"domain_scores_gemma":[0.999534,0.000024950772,0.00010423124,0.00023314431,0.00009541803,0.000008269294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00047876613,0.00012837835,0.00014528865,0.00017425638,0.000085227126,0.00013961828,0.00016576884,0.00005582238,0.00049104204],"category_scores_gemma":[0.000036976126,0.00011245824,0.000032733442,0.001034812,0.000017463626,0.0013432511,0.000026617796,0.000104651415,0.00016593526],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009464396,0.0001826403,0.07200839,0.00015696065,0.00005935994,0.000014775554,0.000116521784,0.47794244,0.00055601366,0.41598406,0.00014970357,0.032734465],"study_design_scores_gemma":[0.0005252963,0.000009457891,0.006176399,0.00008622446,0.00006635614,6.6562234e-7,0.00078398286,0.83817756,0.000031556785,0.11654787,0.037179183,0.0004154384],"about_ca_topic_score_codex":0.00026869305,"about_ca_topic_score_gemma":0.006854846,"teacher_disagreement_score":0.36023512,"about_ca_system_score_codex":0.000034442946,"about_ca_system_score_gemma":0.000007747348,"threshold_uncertainty_score":0.5376566},"labels":[],"label_agreement":null},{"id":"W1930738268","doi":"10.1109/etfa.1996.573320","title":"Minimum average-cost production plan in a multi-product stochastic manufacturing system","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Production (economics); Product (mathematics); Mathematical optimization; Function (biology); Production planning; Computer science; Production control; Plan (archaeology); Mathematics; Economics","score_opus":0.03435660631314144,"score_gpt":0.22574495289491334,"score_spread":0.1913883465817719,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1930738268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93874127,0.0001304181,0.04660817,0.0010577843,0.0013212127,0.0013319781,0.0000021556546,0.0010315004,0.009775526],"genre_scores_gemma":[0.9949954,0.0000012302261,0.00047725468,0.00014748039,0.000790059,0.00005076964,0.00001101679,0.000033515265,0.0034932366],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858636,0.000018556628,0.0003318022,0.00053366413,0.0001875185,0.00034208412],"domain_scores_gemma":[0.9993433,0.000029126993,0.00017135144,0.0003957942,0.000047930764,0.000012543194],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036602071,0.00021538165,0.0002505254,0.0004921819,0.00015557716,0.00012219654,0.00019667386,0.0000413376,0.000361468],"category_scores_gemma":[0.0002057242,0.00019753838,0.00006684535,0.00042777017,0.0000309451,0.0010433698,0.000091804606,0.00016409218,0.0010501314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002513081,0.00082278793,0.003019632,0.0018251566,0.00020042855,0.00020180861,0.0006986056,0.94449574,0.004229866,0.010020076,0.0029157614,0.031318843],"study_design_scores_gemma":[0.0018995045,0.000010294554,0.0025232767,0.00047489314,0.00019607152,0.00003512411,0.0020082933,0.9828805,0.0031758754,0.00075714366,0.0048375134,0.0012015254],"about_ca_topic_score_codex":0.0001481344,"about_ca_topic_score_gemma":0.00019584707,"teacher_disagreement_score":0.05625418,"about_ca_system_score_codex":0.000107683176,"about_ca_system_score_gemma":0.0000021762946,"threshold_uncertainty_score":0.99972767},"labels":[],"label_agreement":null},{"id":"W1938812469","doi":"10.1287/opre.2015.1375","title":"<i>M/M/c</i> Queue with Two Priority Classes","year":2015,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Priority queue; Computer science; Class (philosophy); Queue; Mathematical optimization; Mathematics; Discrete mathematics; Computer network","score_opus":0.09841692185489291,"score_gpt":0.38846801163469635,"score_spread":0.29005108977980343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1938812469","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.771101,0.0001214293,0.012115081,0.006739472,0.00014279508,0.00064025685,0.00000383325,0.0002820961,0.20885405],"genre_scores_gemma":[0.9909327,0.0000040121445,0.0023396083,0.00038061698,0.0007276544,0.00006469244,0.000030184012,0.000023367134,0.005497142],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99857014,0.00007760597,0.00014311961,0.0002730239,0.0006122737,0.00032380642],"domain_scores_gemma":[0.998132,0.00007293155,0.000018562614,0.00041013912,0.0013348005,0.000031556345],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017803863,0.00009947632,0.00012628484,0.00034591494,0.0005435055,0.0006398403,0.00029575307,0.000031783,0.00018970495],"category_scores_gemma":[0.0007448018,0.00007802914,0.000026307554,0.0015101088,0.00017900846,0.0016166304,0.00019198119,0.00030289675,0.0012416827],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020612516,0.00031443703,0.009042925,0.000049079754,0.00008118075,0.0000583743,0.00024899744,0.15295485,0.001942085,0.81695163,0.013985289,0.0041650287],"study_design_scores_gemma":[0.0032276658,0.00012819906,0.000749523,0.00011208862,0.000112381866,0.000016162347,0.0048637204,0.268516,0.001425204,0.045641717,0.6742884,0.0009189483],"about_ca_topic_score_codex":0.0017606628,"about_ca_topic_score_gemma":0.0055378797,"teacher_disagreement_score":0.7713099,"about_ca_system_score_codex":0.00008113495,"about_ca_system_score_gemma":0.00015917404,"threshold_uncertainty_score":0.999536},"labels":[],"label_agreement":null},{"id":"W1944007941","doi":"10.1109/cdc.1989.70076","title":"A novel viewpoint for the analysis of the production control of FMS","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Markov process; Markov chain; Probability density function; Computer science; Production (economics); Product (mathematics); Point process; Kernel (algebra); Markov renewal process; Process (computing); Renewal theory; Mathematical optimization; Mathematical economics; Markov model; Mathematics; Markov property; Discrete mathematics; Machine learning; Economics; Statistics","score_opus":0.015418062677998539,"score_gpt":0.23287803840881086,"score_spread":0.21745997573081233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1944007941","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07583702,0.0001759598,0.91302145,0.005248327,0.00035350444,0.0009955623,0.000007454473,0.000042762855,0.0043179775],"genre_scores_gemma":[0.9982228,0.0000023435616,0.00048164264,0.0005625998,0.00008032644,0.00002721528,0.0000014246652,0.0000071996747,0.00061440584],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99934983,0.000013796144,0.0002631431,0.00014017138,0.00013613558,0.00009692343],"domain_scores_gemma":[0.9987894,0.00018265123,0.00037537527,0.00039564536,0.00025473293,0.0000021670012],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008875476,0.00007658793,0.0002322886,0.00014766528,0.000111932495,0.00001530882,0.00018362784,0.00001933472,0.000130424],"category_scores_gemma":[0.0012755239,0.00003778001,0.00033757277,0.0015319136,0.00007844927,0.00018471394,0.000024504556,0.000037865742,0.0000019338586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008935894,0.00017844794,0.0035641668,0.00010359008,0.0028538888,3.1668666e-8,0.00005338875,0.17161664,0.027664563,0.79052097,0.00030503716,0.0030499361],"study_design_scores_gemma":[0.002992031,0.000030306715,0.029871864,0.00013111727,0.054596797,0.0000015812501,0.0032428657,0.677471,0.037466545,0.093474604,0.09991215,0.00080917263],"about_ca_topic_score_codex":0.00008203602,"about_ca_topic_score_gemma":0.00015565335,"teacher_disagreement_score":0.9223858,"about_ca_system_score_codex":0.000008666623,"about_ca_system_score_gemma":0.000006793511,"threshold_uncertainty_score":0.1540624},"labels":[],"label_agreement":null},{"id":"W1946123031","doi":"10.1007/s11134-015-9461-y","title":"State-dependent M/G/1 queueing systems","year":2015,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":49,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Markovian arrival process; Queueing theory; Markov chain; Queue; Computer science; State (computer science); Markov process; Queueing system; Burke's theorem; Bulk queue; Expression (computer science); Applied mathematics; Mathematics; Algorithm; Queue management system; Fork–join queue; Computer network; Statistics","score_opus":0.025806455490490023,"score_gpt":0.23984586639002742,"score_spread":0.2140394108995374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1946123031","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7945815,0.006216415,0.052296694,0.000534308,0.014670564,0.0022190572,0.000018576622,0.0039136806,0.1255492],"genre_scores_gemma":[0.9897219,0.000006073378,0.000061273044,0.000241454,0.0027559006,0.00009709143,0.000024910978,0.00012359829,0.0069677937],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967213,0.00013585214,0.0008767207,0.0006753908,0.0008672703,0.000723443],"domain_scores_gemma":[0.9977453,0.000118046286,0.0007390017,0.00079932343,0.0005157034,0.00008263084],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002503558,0.00044084789,0.000690084,0.0005564409,0.00030071408,0.0012627514,0.00061146583,0.00013897203,0.000024069399],"category_scores_gemma":[0.00042499785,0.00041385295,0.00015153168,0.0008278385,0.00007098423,0.0020984567,0.00026927952,0.00029733923,0.0018777839],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001762206,0.0001688604,0.016334135,0.0015474799,0.00045997562,0.00043653868,0.000742446,0.69631076,0.0013556316,0.27056724,0.010417885,0.001482832],"study_design_scores_gemma":[0.0029110794,0.00006460716,0.00021970345,0.0018454752,0.000499891,0.00011106078,0.013408642,0.5840249,0.00015988338,0.012994906,0.3810559,0.0027039296],"about_ca_topic_score_codex":0.010210663,"about_ca_topic_score_gemma":0.00016837548,"teacher_disagreement_score":0.370638,"about_ca_system_score_codex":0.00031733935,"about_ca_system_score_gemma":0.00006643521,"threshold_uncertainty_score":0.9998313},"labels":[],"label_agreement":null},{"id":"W1963526003","doi":"10.1239/jap/1067436102","title":"The classification of matrix GI/M/1-type Markov chains with a tree structure and its applications to queueing","year":2003,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Mathematics; Queueing theory; Jacobian matrix and determinant; Type (biology); Tree (set theory); Eigenvalues and eigenvectors; Matrix (chemical analysis); Markov process; Uniformization (probability theory); Combinatorics; Applied mathematics; Discrete mathematics; Markov model; Variable-order Markov model; Statistics","score_opus":0.013902111043890686,"score_gpt":0.2468646946742437,"score_spread":0.23296258363035302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1963526003","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98559636,0.0001315963,0.009592165,0.000734584,0.000040382107,0.0006679629,0.0000017259887,0.00001875665,0.0032164431],"genre_scores_gemma":[0.99510574,0.000008722029,0.004613209,0.000082832295,0.00012353659,0.00001551336,0.000001184502,0.000012708922,0.00003654764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899554,0.000024928368,0.00043176327,0.000173659,0.00023096357,0.00014312088],"domain_scores_gemma":[0.99839514,0.0001487906,0.00070371997,0.0002738818,0.00045548307,0.000022951544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010601167,0.00012304007,0.0002299996,0.00011410629,0.0002074672,0.00007131973,0.00020899162,0.000045651785,0.000017550674],"category_scores_gemma":[0.00025167575,0.00007800737,0.000045124732,0.0007078624,0.00007568998,0.0002502132,0.00003850366,0.00017471371,0.0000025925192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010679389,0.00012269655,0.0039754016,0.00030534723,0.00014807672,8.828426e-7,0.00017456678,0.0065075317,0.023834316,0.94135547,0.00007304238,0.022434736],"study_design_scores_gemma":[0.0020226124,0.00015961903,0.03335535,0.00014843741,0.00088376267,0.00003051813,0.0019204337,0.0053867437,0.00828004,0.89427954,0.052770514,0.00076245365],"about_ca_topic_score_codex":0.0000022092013,"about_ca_topic_score_gemma":0.000057155125,"teacher_disagreement_score":0.052697472,"about_ca_system_score_codex":0.000048647747,"about_ca_system_score_gemma":0.00004175104,"threshold_uncertainty_score":0.31810483},"labels":[],"label_agreement":null},{"id":"W1964139750","doi":"10.3138/infor.47.4.283","title":"A Simple and Complete Solution to the Stationary Queue-Length Probabilities of a Bulk-Arrival Bulk-Service Queue","year":2009,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Ministère de la Défense Nationale","keywords":"Epoch (astronomy); Queue; Mathematics; Fork–join queue; Bulk queue; Applied mathematics; Generating function; Computer science; Combinatorics; Queue management system; Computer network","score_opus":0.05220752316511104,"score_gpt":0.31636131082762625,"score_spread":0.2641537876625152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1964139750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93858886,0.0003501081,0.018998643,0.021105148,0.00023147569,0.00391133,0.00021751084,0.00014287232,0.016454045],"genre_scores_gemma":[0.9973301,0.0000129095115,0.00022685464,0.0017087838,0.00025236866,0.00009928391,0.00021513001,0.000005321784,0.00014920175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982422,0.0000540637,0.00058482104,0.00013052287,0.00075237174,0.00023604724],"domain_scores_gemma":[0.9975682,0.0002646771,0.00016563454,0.00019583073,0.0017755142,0.00003015744],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023226256,0.000120523226,0.000178866,0.00042568738,0.0006865502,0.000642117,0.00018848355,0.00005139613,0.000030803352],"category_scores_gemma":[0.00066539674,0.00008950983,0.000027551796,0.00068792544,0.00009364966,0.0036214176,0.00014022281,0.00015083785,0.00008332364],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025462903,0.000031268308,0.0004996282,0.0005576968,0.000046644884,4.4812737e-7,0.0035746614,0.081775516,0.00036844984,0.902295,0.0030480272,0.007548049],"study_design_scores_gemma":[0.0008182333,0.0001263575,0.010920968,0.00017517681,0.00002284214,0.0000112411835,0.0101323705,0.6088573,0.000031433712,0.01628312,0.35229802,0.00032300255],"about_ca_topic_score_codex":0.0015202076,"about_ca_topic_score_gemma":0.00016228197,"teacher_disagreement_score":0.88601184,"about_ca_system_score_codex":0.000054898253,"about_ca_system_score_gemma":0.00008616227,"threshold_uncertainty_score":0.6191949},"labels":[],"label_agreement":null},{"id":"W1965243060","doi":"10.1239/jap/1101840560","title":"M/GI/1 queues with services of both positive and negative customers","year":2004,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Government of Jiangsu Province; Western Washington University","keywords":"Joins; Queue; Mathematics; Laplace transform; Generalization; Sign (mathematics); Service (business); Discrete mathematics; Computer science; Computer network; Mathematical analysis; Business; Marketing","score_opus":0.005779977264398198,"score_gpt":0.2065923286343744,"score_spread":0.20081235136997622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1965243060","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919007,0.000038421746,0.00047654813,0.00025878588,0.000022242439,0.00018542689,0.0000017286536,0.000015677557,0.007100504],"genre_scores_gemma":[0.99545044,0.0000062242884,0.004138914,0.00025840144,0.00012603837,0.0000028371958,0.0000011586676,0.000011931897,0.000004051486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990379,0.000012333601,0.0003872372,0.00016973195,0.00025258487,0.00014017003],"domain_scores_gemma":[0.99850327,0.00008157428,0.00091147004,0.0001444211,0.00034028818,0.000019002902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065722637,0.00014624675,0.000371537,0.00015522259,0.00008260692,0.00004916753,0.0001591694,0.00004186789,0.000019867894],"category_scores_gemma":[0.00003515965,0.00010428464,0.00006877282,0.00038990573,0.00023078325,0.00074987795,0.000066046494,0.00017198731,0.000002782449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01333029,0.0016405924,0.032562494,0.0034598154,0.0018952144,0.00006586417,0.0073400033,0.25533664,0.011998671,0.651525,0.00003137712,0.020814033],"study_design_scores_gemma":[0.002942472,0.00017176433,0.01585921,0.0004041686,0.0006582528,0.000015514916,0.003606315,0.00040262475,0.007320125,0.9677601,0.00045424842,0.00040520428],"about_ca_topic_score_codex":0.00014798362,"about_ca_topic_score_gemma":0.00014432221,"teacher_disagreement_score":0.3162351,"about_ca_system_score_codex":0.00006289855,"about_ca_system_score_gemma":0.000036789956,"threshold_uncertainty_score":0.42526042},"labels":[],"label_agreement":null},{"id":"W1967061907","doi":"10.1002/nav.10083","title":"Discrete‐time analysis of <i>MAP</i>/<i>PH</i>/1 multiclass general preemptive priority queue","year":2003,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Priority queue; Triangular matrix; Matrix (chemical analysis); Queue; Block (permutation group theory); Mathematics; Type (biology); Combinatorics; Computation; Applied mathematics; Discrete mathematics; Computer science; Algorithm; Pure mathematics","score_opus":0.057708003680430456,"score_gpt":0.3608492425199466,"score_spread":0.30314123883951616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967061907","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7044099,0.000891273,0.12514932,0.0011906443,0.00080140773,0.0024368346,0.00035216706,0.00063688087,0.16413157],"genre_scores_gemma":[0.9918088,0.000031239182,0.0033889245,0.00016079248,0.00041374587,0.00003701695,0.00014639739,0.00005583998,0.0039572883],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953035,0.00045697176,0.00073694234,0.0008265524,0.0016180202,0.0010579933],"domain_scores_gemma":[0.99541396,0.0012399477,0.0004053928,0.001039156,0.0018142493,0.00008726796],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0050438135,0.00036284263,0.00086060626,0.0015383484,0.0004671122,0.0002571038,0.00084185554,0.00021165595,0.0007221443],"category_scores_gemma":[0.011153038,0.00033243527,0.0004516074,0.004902854,0.0009342988,0.0006591654,0.0005075752,0.0007965024,0.00047895894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007881592,0.0010926059,0.04757309,0.0005080082,0.0042636353,0.00019570213,0.00031048912,0.12124667,0.021642765,0.7957125,0.004002755,0.0026636247],"study_design_scores_gemma":[0.0023702807,0.00020346923,0.008912349,0.0001468296,0.00496201,0.00000252583,0.0007571188,0.74148166,0.00693102,0.16998598,0.062516816,0.0017299575],"about_ca_topic_score_codex":0.0012348103,"about_ca_topic_score_gemma":0.00049180514,"teacher_disagreement_score":0.6257265,"about_ca_system_score_codex":0.00023982736,"about_ca_system_score_gemma":0.00013837914,"threshold_uncertainty_score":0.9999128},"labels":[],"label_agreement":null},{"id":"W1967352043","doi":"10.1007/s12597-013-0128-3","title":"Computational analysis of bulk service queue with Markovian arrival process: MAP/R(a, b)/1 queue","year":2013,"lang":"en","type":"article","venue":"OPSEARCH","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Markovian arrival process; Computer science; Queueing theory; Applied mathematics; Queue; Fork–join queue; Laplace transform; Bulk queue; Markov process; Mathematical optimization; Mathematics; Statistical physics; Algorithm; Mathematical analysis; Queue management system; Physics; Statistics; Computer network","score_opus":0.0108566462305342,"score_gpt":0.2552764207603264,"score_spread":0.24441977452979222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967352043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97277236,0.00002067157,0.011185758,0.002683032,0.00003809725,0.00039398647,0.000008697372,0.000120449135,0.012776924],"genre_scores_gemma":[0.995829,8.509194e-7,0.0020649573,0.0009573355,0.00017017541,0.000053279633,0.00018942484,0.000032843644,0.0007021292],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982361,0.000035427653,0.0003360707,0.00040291244,0.0006377414,0.0003517319],"domain_scores_gemma":[0.9979916,0.00014643202,0.00024644006,0.00036499972,0.001219398,0.000031094893],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00047787375,0.00020061451,0.00040647312,0.0008918293,0.00017738223,0.00018502383,0.0004417589,0.000058253572,0.002911387],"category_scores_gemma":[0.00007714699,0.00017005586,0.00012124596,0.0039702207,0.00012067672,0.0010518612,0.00013564632,0.00018384549,0.0004582944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002995999,0.0003892692,0.10500418,0.0010267812,0.0031552871,0.000021425114,0.0006265412,0.8499867,0.00054093153,0.03340155,0.0008628391,0.0046849297],"study_design_scores_gemma":[0.0007324676,0.000027920996,0.041421212,0.00010605599,0.0014516505,0.0000016924115,0.001513263,0.8972476,0.00013021934,0.055728383,0.0010906818,0.00054883095],"about_ca_topic_score_codex":0.001785187,"about_ca_topic_score_gemma":0.00040415477,"teacher_disagreement_score":0.063582964,"about_ca_system_score_codex":0.000036031342,"about_ca_system_score_gemma":0.000055412864,"threshold_uncertainty_score":0.9980001},"labels":[],"label_agreement":null},{"id":"W1967863088","doi":"10.1007/s12351-011-0106-6","title":"Tail asymptotics for M/M/c retrial queues with non-persistent customers","year":2011,"lang":"en","type":"article","venue":"Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Retrial queue; Mathematics; Lemma (botany); Joint probability distribution; Applied mathematics; Scalar (mathematics); Queue; Product (mathematics); Computer science; Queueing theory; Queueing system; Statistics; Computer network","score_opus":0.10422448553669783,"score_gpt":0.33374560155319144,"score_spread":0.2295211160164936,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1967863088","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7029187,0.00010348381,0.011227459,0.003540611,0.0005933368,0.0026039893,0.000028173517,0.00020568936,0.27877852],"genre_scores_gemma":[0.9910093,0.000004577336,0.0027971426,0.0003420879,0.0010689858,0.00011585624,0.00007032596,0.00003241595,0.004559306],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984323,0.00002972242,0.00018577269,0.00031127824,0.0006730056,0.0003679394],"domain_scores_gemma":[0.99828947,0.00018381429,0.00005561442,0.00023196705,0.0012160104,0.000023119594],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016403331,0.0001190106,0.00015023214,0.00037178837,0.0005789018,0.0002251516,0.000293512,0.00005455405,0.0005621336],"category_scores_gemma":[0.0006874711,0.00009468153,0.00008853732,0.0006791734,0.00017739201,0.0008294376,0.0001092801,0.00019100399,0.00032216316],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004517902,0.0005306626,0.005561199,0.00023443255,0.0005979169,0.00003067643,0.00062162476,0.020333957,0.002921249,0.94279516,0.017636245,0.0042189667],"study_design_scores_gemma":[0.01209776,0.0013869181,0.0030565856,0.000448966,0.000752852,0.0000148785975,0.009201308,0.4953322,0.0080112945,0.06746645,0.39958027,0.00265051],"about_ca_topic_score_codex":0.00015789403,"about_ca_topic_score_gemma":0.000104170635,"teacher_disagreement_score":0.8753287,"about_ca_system_score_codex":0.00008369232,"about_ca_system_score_gemma":0.00010170615,"threshold_uncertainty_score":0.6154969},"labels":[],"label_agreement":null},{"id":"W1968712567","doi":"10.1239/jap/1014843095","title":"Cell loss probability for <i>M</i>/<i>G</i>/1 and time-slotted queues","year":2000,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Queue; Asymptotically optimal algorithm; Block (permutation group theory); Combinatorics; Buffer overflow; Queueing theory; Discrete mathematics; Applied mathematics; Statistics; Mathematical optimization; Computer science; Computer network","score_opus":0.009446595817605073,"score_gpt":0.20908509339426912,"score_spread":0.19963849757666405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1968712567","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98274857,0.00009358272,0.0014773011,0.00063359464,0.00006785903,0.0008543051,0.0000061761716,0.00008410473,0.014034516],"genre_scores_gemma":[0.9793562,0.000015282612,0.018620072,0.0008292594,0.0008131244,0.000042742602,0.00000884523,0.000041063297,0.00027340377],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981357,0.000028385108,0.0008198145,0.0003899134,0.00029240584,0.000333825],"domain_scores_gemma":[0.9982807,0.00023703968,0.00066341687,0.00037935528,0.00039743242,0.000042062635],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002360191,0.0002637479,0.0005711264,0.00012525034,0.00020850764,0.00015244672,0.00033061244,0.000108758984,0.0005215406],"category_scores_gemma":[0.0001792667,0.00021962426,0.0002292898,0.00039188657,0.00025021058,0.00081824727,0.000073810304,0.00025774658,0.000060777616],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.044850327,0.010550508,0.032189455,0.01339307,0.001597088,0.00007585217,0.0019474905,0.10747546,0.034364134,0.37802625,0.027715044,0.34781533],"study_design_scores_gemma":[0.0014603501,0.000057714242,0.00046602642,0.00003304082,0.00028406817,0.0000067730157,0.000035188314,0.0025235726,0.0010721727,0.95142925,0.042291965,0.00033990867],"about_ca_topic_score_codex":0.000008061034,"about_ca_topic_score_gemma":0.000004695126,"teacher_disagreement_score":0.573403,"about_ca_system_score_codex":0.000077530996,"about_ca_system_score_gemma":0.0000437968,"threshold_uncertainty_score":0.89560175},"labels":[],"label_agreement":null},{"id":"W1969556115","doi":"10.1287/ijoc.1100.0435","title":"Efficient and Reliable Computation of Birth-Death Process Performance Measures","year":2010,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Mathematics; Arithmetic underflow; Population; Algorithm; Bounded function; Queueing theory; Computation; Truncation (statistics); Mathematical optimization; Range (aeronautics); Computer science; Applied mathematics; Statistics","score_opus":0.012062212585417818,"score_gpt":0.24650808103810595,"score_spread":0.23444586845268814,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1969556115","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9840048,0.000018051816,0.013025041,0.00009006203,0.00031797015,0.00006988285,1.7400838e-7,0.00005109328,0.0024229158],"genre_scores_gemma":[0.99801975,0.000002842529,0.001136086,0.00035868533,0.00045563825,4.8294913e-7,0.0000010086688,0.000014145144,0.000011343203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988744,0.000003934656,0.0004363791,0.00012364479,0.0003475056,0.00021412151],"domain_scores_gemma":[0.9987723,0.000052687355,0.0006605039,0.00009830957,0.0003954628,0.000020685588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010568381,0.00013792366,0.00020678957,0.00035511956,0.0003897901,0.0001909265,0.00016656084,0.00004571235,0.000010451424],"category_scores_gemma":[0.00021048497,0.000105635096,0.000055984976,0.00036515892,0.00005342752,0.00050882413,0.00006927272,0.00043447333,0.000014396432],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000794843,0.00004397523,0.01962938,0.00017763564,0.00002858242,0.0000036234994,0.00016816611,0.9020013,0.0004823883,0.003687797,0.000017344413,0.073680274],"study_design_scores_gemma":[0.00054563564,0.00003796376,0.0076013543,0.00028326345,0.00003253849,0.000043473417,0.00017864749,0.98597455,0.0005136908,0.0031909405,0.0013968269,0.00020108644],"about_ca_topic_score_codex":0.000007190652,"about_ca_topic_score_gemma":0.0000016139335,"teacher_disagreement_score":0.08397324,"about_ca_system_score_codex":0.000015199493,"about_ca_system_score_gemma":0.000017321836,"threshold_uncertainty_score":0.43076742},"labels":[],"label_agreement":null},{"id":"W1970854404","doi":"10.1109/glocom.2004.1378223","title":"Calculation of loss probability in a partitioned buffer with self-similar input traffic","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Packet loss; Computer science; Heuristic; Buffer overflow; Class (philosophy); Buffer (optical fiber); Fractional Brownian motion; Range (aeronautics); Provisioning; Algorithm; Network packet; Mathematical optimization; Brownian motion; Computer network; Mathematics; Statistics; Artificial intelligence; Telecommunications; Engineering","score_opus":0.010109497888189337,"score_gpt":0.21665979399488497,"score_spread":0.20655029610669562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1970854404","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9929718,0.000010292955,0.0034812582,0.0009920666,0.000009768346,0.00021257285,3.4437423e-7,0.0001318036,0.0021901312],"genre_scores_gemma":[0.99623,0.0000012631236,0.0032705758,0.0002748705,0.00011065605,0.000018542325,0.000010005159,0.0000108170025,0.000073250696],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992119,0.000016975198,0.0002633962,0.00020464472,0.00015552618,0.00014754417],"domain_scores_gemma":[0.9995191,0.000029271161,0.00013118214,0.00019938286,0.000114728486,0.000006313503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003569013,0.00010528507,0.0001765835,0.00016008959,0.00004195962,0.00002486681,0.00008093756,0.00003881773,0.00023049662],"category_scores_gemma":[0.000049525803,0.00008362811,0.000044094013,0.00060832757,0.00004636888,0.0008759966,0.00002827342,0.00006290098,0.000037713977],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022602695,0.0006349318,0.048758548,0.00021104967,0.000058924987,0.0000050044937,0.00022974379,0.90431976,0.000157808,0.04075653,0.00009350419,0.004548191],"study_design_scores_gemma":[0.00312295,0.00004306517,0.049185414,0.0001684817,0.00031743787,0.0000026285318,0.00021155446,0.898014,0.0010357525,0.034941208,0.012184763,0.000772711],"about_ca_topic_score_codex":0.00004021942,"about_ca_topic_score_gemma":0.0010659589,"teacher_disagreement_score":0.012091259,"about_ca_system_score_codex":0.000047730355,"about_ca_system_score_gemma":0.000010206591,"threshold_uncertainty_score":0.34102553},"labels":[],"label_agreement":null},{"id":"W1971438357","doi":"10.1016/s0166-5316(02)00232-8","title":"A preemptive resume queue with an expiry time for retained service","year":2003,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Preemption; Computer science; Task (project management); Service (business); Flow (mathematics); Event (particle physics); Mathematics; Computer network; Physics; Engineering; Operating system","score_opus":0.03054012263118326,"score_gpt":0.2756305327288212,"score_spread":0.24509041009763793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1971438357","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98598665,0.000022415452,0.0049620825,0.00026024532,0.00006117809,0.00082175026,0.0000015642287,0.00012667206,0.00775742],"genre_scores_gemma":[0.99511355,0.0000018035471,0.0028517675,0.00078194053,0.0003270259,0.00025626997,0.00016829517,0.00003470063,0.00046462167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987964,0.000049624534,0.00021187487,0.00032540195,0.00037860824,0.00023807192],"domain_scores_gemma":[0.99847615,0.000048632428,0.00024935888,0.00033964476,0.000873796,0.000012445479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00214023,0.0001647697,0.0001665796,0.00017445585,0.00027802316,0.00009677922,0.00014670356,0.000050675393,0.0003614953],"category_scores_gemma":[0.00030061812,0.00014234957,0.00003535615,0.0006047417,0.000026169299,0.0028221766,0.000019450299,0.000073959396,0.0002398358],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009536048,0.0010754053,0.027288945,0.0017673924,0.0007834339,0.00000505215,0.0047110855,0.73079234,0.015174464,0.062392753,0.0022518428,0.14422123],"study_design_scores_gemma":[0.0013470193,0.000086992775,0.0022524337,0.000065620385,0.00031747512,0.0000012830598,0.00029615386,0.9838548,0.00086253777,0.0071339384,0.0034843357,0.00029742823],"about_ca_topic_score_codex":0.00001838087,"about_ca_topic_score_gemma":0.000078728175,"teacher_disagreement_score":0.25306243,"about_ca_system_score_codex":0.00008035107,"about_ca_system_score_gemma":0.000054433647,"threshold_uncertainty_score":0.5804847},"labels":[],"label_agreement":null},{"id":"W1972419530","doi":"10.1007/s10479-008-0309-2","title":"The erlangization method for Markovian fluid flows","year":2008,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Laplace transform; Computer science; Fluid dynamics; Probabilistic logic; Erlang (programming language); Theory of computation; Erlang distribution; Markov process; Mathematical optimization; Applied mathematics; Algorithm; Statistical physics; Mathematics; Theoretical computer science; Mechanics; Mathematical analysis; Statistics; Exponential distribution; Physics; Artificial intelligence","score_opus":0.1957516228569016,"score_gpt":0.4483064527574165,"score_spread":0.2525548299005149,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1972419530","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25889182,0.0011087264,0.647467,0.056944106,0.00033977462,0.0027527446,0.00003717838,0.00019408388,0.032264575],"genre_scores_gemma":[0.96960497,0.0003343168,0.018288776,0.0010068499,0.0010528151,0.00031927752,0.00013136528,0.000043991873,0.009217665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988942,0.00009146145,0.00023662178,0.00017091807,0.00033619424,0.00027056813],"domain_scores_gemma":[0.997472,0.00045912666,0.00003332124,0.000331171,0.0016935536,0.000010853431],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0030082157,0.000070127106,0.00011384006,0.00029718026,0.0016046276,0.00014152758,0.00031076896,0.00003552831,0.00009738073],"category_scores_gemma":[0.0021647112,0.000051571642,0.00008816349,0.0009327495,0.000113935654,0.00064831524,0.000095576994,0.00010110236,0.0000687249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029177053,0.00019135425,0.000400852,0.00010383056,0.00018755492,0.000005006768,0.00032096487,0.16753988,0.014661849,0.71208346,0.06769104,0.036522437],"study_design_scores_gemma":[0.00022779306,0.000027961187,0.00035203286,0.00001781374,0.000016084776,0.0000015703575,0.0003771864,0.77358574,0.0033992182,0.01719788,0.20466284,0.00013386579],"about_ca_topic_score_codex":0.00022454414,"about_ca_topic_score_gemma":0.00038898096,"teacher_disagreement_score":0.71071315,"about_ca_system_score_codex":0.000008533303,"about_ca_system_score_gemma":0.000043167405,"threshold_uncertainty_score":0.9996951},"labels":[],"label_agreement":null},{"id":"W1974493778","doi":"10.1239/aap/1231340168","title":"Stochastic and substochastic solutions for infinite-state Markov chains with applications to matrix-analytic methods","year":2008,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Mathematics; Censoring (clinical trials); Stochastic matrix; Continuous-time Markov chain; Sequence (biology); Applied mathematics; Markov process; Markov kernel; Finite set; Discrete phase-type distribution; Markov property; Markov model; Variable-order Markov model; Statistics; Mathematical analysis","score_opus":0.029637624437833594,"score_gpt":0.31199205995410556,"score_spread":0.282354435516272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974493778","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013762539,0.0002781294,0.98177016,0.0002387081,0.000032332584,0.0025656905,0.000013815036,0.00015587089,0.0011827747],"genre_scores_gemma":[0.7847901,0.000015790883,0.21150343,0.00030774606,0.00011745856,0.0031132572,0.000027498214,0.000040037907,0.00008466789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979819,0.000027764989,0.0004847651,0.0007576606,0.00018320055,0.00056468986],"domain_scores_gemma":[0.9982559,0.0007396807,0.0002469157,0.00055531814,0.00015599458,0.000046212186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011978955,0.00029718358,0.00047105656,0.00037663232,0.0005077062,0.00004937275,0.00027138318,0.000054093616,0.000018119455],"category_scores_gemma":[0.00039220904,0.0002729992,0.000068690424,0.001495214,0.0003640622,0.0005364519,0.00018757483,0.00018023547,0.000022021622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068948016,0.0002033933,0.0008052631,0.0004045852,0.000051995168,0.0000014261886,0.00016670606,0.6303481,0.00019691625,0.33261192,0.000009235669,0.03451101],"study_design_scores_gemma":[0.0015074257,0.00006586487,0.0011242635,0.00006008125,0.00029867672,0.000007544247,0.00025316808,0.11549829,0.000035104153,0.8697823,0.010437198,0.00093005976],"about_ca_topic_score_codex":0.000022972388,"about_ca_topic_score_gemma":0.00042848862,"teacher_disagreement_score":0.77102757,"about_ca_system_score_codex":0.00011336504,"about_ca_system_score_gemma":0.000036509267,"threshold_uncertainty_score":0.9999722},"labels":[],"label_agreement":null},{"id":"W1974589366","doi":"10.1016/j.cam.2006.01.010","title":"Analysis of an<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:mi>M</mml:mi><mml:mo>/</mml:mo><mml:mo stretchy=\"false\">{</mml:mo><mml:msub><mml:mrow><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msub><mml:mo stretchy=\"false\">}</mml:mo><mml:mo>/</mml:mo><mml:mn>1</mml:mn></mml:math>retrial queue","year":2006,"lang":"lv","type":"article","venue":"Journal of Computational and Applied Mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Retrial queue; Mathematics; Algorithm; Scroll; Queue; State (computer science); Distribution (mathematics); Discrete mathematics; Queueing theory; Computer science; Queueing system; Statistics; Computer network; Mathematical analysis; Theology","score_opus":0.014507568878182187,"score_gpt":0.23575411039539948,"score_spread":0.2212465415172173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1974589366","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8239374,0.002113918,0.009568451,0.0011198146,0.0030354755,0.00014687236,0.0008388463,0.00045953903,0.15877968],"genre_scores_gemma":[0.9742969,0.0012279679,0.011586285,0.0020535113,0.005889405,0.00087550865,0.0024110465,0.0014210758,0.00023826145],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98041177,0.0007348445,0.0056700762,0.0030705996,0.0062524946,0.0038601947],"domain_scores_gemma":[0.98157907,0.004341467,0.008936884,0.0026397328,0.00093231275,0.0015705315],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.005694688,0.002039319,0.001261563,0.0023903681,0.0033583597,0.0039198175,0.004153756,0.0037080422,0.15276884],"category_scores_gemma":[0.0029330838,0.0037500798,0.0046951473,0.004232124,0.0029571531,0.0037712152,0.0032107064,0.0034347612,0.0016408595],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037076657,0.0013458359,0.000034332574,0.0030341838,0.008069178,0.0014704973,0.0021847321,0.06385743,0.0025110736,0.7396246,0.1696136,0.0045468644],"study_design_scores_gemma":[0.0063811056,0.002301271,0.00012544189,0.0030268366,0.012760103,0.0021796694,0.005940275,0.14937395,0.7733036,0.036676973,0.003494588,0.00443615],"about_ca_topic_score_codex":0.0018416545,"about_ca_topic_score_gemma":0.00161944,"teacher_disagreement_score":0.77079254,"about_ca_system_score_codex":0.00006090632,"about_ca_system_score_gemma":0.0021750645,"threshold_uncertainty_score":0.9997562},"labels":[],"label_agreement":null},{"id":"W1975712057","doi":"10.1016/j.apm.2012.09.046","title":"A note on the distributional Little’s law for discrete-time queues with D-MAP arrivals and its application","year":2012,"lang":"en","type":"article","venue":"Applied Mathematical Modelling","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; University of North Carolina at Charlotte","keywords":"FIFO (computing and electronics); Markovian arrival process; Queue; Class (philosophy); Computer science; Relation (database); Queueing theory; Bulk queue; Sample (material); Distribution (mathematics); Real-time computing; Mathematics; Mathematical optimization; Applied mathematics; Computer network; Mathematical analysis; Physics; Data mining; Artificial intelligence","score_opus":0.019580135159162192,"score_gpt":0.24271850868526257,"score_spread":0.2231383735261004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1975712057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.017811455,0.000041731993,0.97538346,0.0010847215,0.000010038667,0.00077949866,0.000009939043,0.00010705921,0.0047720764],"genre_scores_gemma":[0.99244153,0.000001323196,0.005933106,0.0006002246,0.00046108337,0.0004294723,0.00005207783,0.000034144028,0.000047008936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899065,0.0000072895696,0.00022932855,0.00024152474,0.00022051104,0.00031066465],"domain_scores_gemma":[0.99889326,0.00062550855,0.00015514006,0.0002347064,0.00006593781,0.000025466821],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00064390193,0.00019049518,0.00023212683,0.000037801463,0.00034154195,0.000100476755,0.00014876261,0.000059267444,0.00004549865],"category_scores_gemma":[0.000051841387,0.00011895466,0.000055475968,0.00013118143,0.000092279,0.0003484712,0.00006534195,0.00011746828,0.00027474333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007323631,0.00005935715,0.0000013363855,0.00013323865,0.000028710387,6.207036e-8,0.000044983382,0.0148984995,0.0007468954,0.9837869,0.00001916141,0.00020761517],"study_design_scores_gemma":[0.00012536057,0.0000036090987,3.8070962e-7,0.00003841769,0.00010158611,3.384111e-7,0.00003358163,0.4662129,0.00074419565,0.53102964,0.0015768468,0.00013314573],"about_ca_topic_score_codex":0.0000026650368,"about_ca_topic_score_gemma":6.660706e-7,"teacher_disagreement_score":0.9746301,"about_ca_system_score_codex":0.000022817347,"about_ca_system_score_gemma":0.0000037022714,"threshold_uncertainty_score":0.48508304},"labels":[],"label_agreement":null},{"id":"W1977015962","doi":"10.3138/infor.47.4.289","title":"On Accommodating Customer Flexibility in Service Systems","year":2009,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Flexibility (engineering); Computer science; Queueing theory; Service (business); Distributed computing; Simple (philosophy); Computer network; Mathematical optimization; Operations research; Mathematics; Business; Statistics","score_opus":0.06432650438958139,"score_gpt":0.352736722981126,"score_spread":0.28841021859154464,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977015962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80962974,0.00008943326,0.0013115053,0.0020794498,0.00034091304,0.0015519424,0.000019413706,0.00014223304,0.18483539],"genre_scores_gemma":[0.9975714,0.0000034729358,0.00003019306,0.0017219464,0.00026526971,0.00007201284,0.00012432762,0.000005361777,0.00020603665],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99798477,0.00005727235,0.0006655213,0.00015522879,0.0008392134,0.00029796956],"domain_scores_gemma":[0.99829245,0.00025180474,0.00015375322,0.000241237,0.0010366254,0.000024162615],"candidate_categories":["scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.003668882,0.00013250444,0.00020119798,0.00089128414,0.0004216509,0.001415928,0.00021086694,0.00008657361,0.000038613078],"category_scores_gemma":[0.0007283147,0.000113004025,0.000026156958,0.0011665954,0.00003457489,0.006557598,0.00008473687,0.000308044,0.00080485636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000089857895,0.000025765783,0.00082428515,0.00019825912,0.000007984306,9.998779e-7,0.00023374104,0.20423433,0.000030982592,0.79057527,0.00088156643,0.0028969327],"study_design_scores_gemma":[0.000933743,0.000033742217,0.0062300805,0.00031851558,0.0000058233727,0.00000555702,0.0034546258,0.87662345,0.000012245789,0.0039339345,0.1081302,0.00031807937],"about_ca_topic_score_codex":0.0012247681,"about_ca_topic_score_gemma":0.000050438837,"teacher_disagreement_score":0.78664136,"about_ca_system_score_codex":0.00012651755,"about_ca_system_score_gemma":0.00005462633,"threshold_uncertainty_score":0.9999731},"labels":[],"label_agreement":null},{"id":"W1977484917","doi":"10.1108/13552510110695574","title":"Reliability analysis of triple modular computer systems with redundant voters and restricted maintenance","year":2001,"lang":"en","type":"article","venue":"Journal of Quality in Maintenance Engineering","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Redundancy (engineering); Triple modular redundancy; Modular design; Reliability engineering; Mean time between failures; Reliability (semiconductor); Computer science; Engineering; Failure rate; Operating system; Physics","score_opus":0.011545792396580433,"score_gpt":0.23296035213612992,"score_spread":0.2214145597395495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977484917","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7528933,0.0000967973,0.24639343,0.00023961163,0.00021964358,0.000100239726,0.000002339321,0.000022401024,0.000032222346],"genre_scores_gemma":[0.99497324,0.00006635808,0.0045819166,0.00008289814,0.00023143373,0.0000031412312,0.0000029896223,0.000019444038,0.000038555383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978221,0.00005889169,0.0011648573,0.000250084,0.0003822037,0.00032187428],"domain_scores_gemma":[0.9978347,0.00018617358,0.0010865805,0.00033735152,0.00052416755,0.000031036874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020569237,0.0002117326,0.0009274274,0.0010767459,0.000039319442,0.000075556454,0.00026361746,0.00006411535,0.0000051583656],"category_scores_gemma":[0.0007835369,0.00016382812,0.00019198013,0.0026192567,0.00008728723,0.0008317224,0.00006500458,0.00031732282,5.211894e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000331886,0.00006597047,0.019875776,0.00022115,0.00040347973,0.000097024626,0.00009559503,0.9731526,0.0008971986,0.004532688,0.00004157507,0.00028507036],"study_design_scores_gemma":[0.0011342864,0.000045917102,0.16205904,0.00064053637,0.0005409482,0.00003309626,0.00045217018,0.832869,0.00001518974,0.0004570501,0.0014558253,0.0002969519],"about_ca_topic_score_codex":0.000346226,"about_ca_topic_score_gemma":0.00003905941,"teacher_disagreement_score":0.24207994,"about_ca_system_score_codex":0.00014745776,"about_ca_system_score_gemma":0.000018174853,"threshold_uncertainty_score":0.6680717},"labels":[],"label_agreement":null},{"id":"W1977809545","doi":"10.1007/s11009-007-9036-4","title":"Multiple Eigenvalues in Spectral Analysis for Solving QBD Processes","year":2007,"lang":"en","type":"article","venue":"Methodology And Computing In Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Eigenvalues and eigenvectors; Context (archaeology); Queueing theory; Applied mathematics; Birth–death process; Mathematical optimization; Statistics; Population","score_opus":0.08094399951014415,"score_gpt":0.3214438958120218,"score_spread":0.24049989630187768,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1977809545","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5708114,0.00006604461,0.42825207,0.00005033832,0.00003830785,0.00031305375,4.7800245e-7,0.0000629059,0.00040544232],"genre_scores_gemma":[0.83248013,0.0000021098404,0.1670366,0.00024785651,0.00016768863,0.000034857505,0.000013960655,0.0000120528475,0.000004737407],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980395,0.000090431735,0.00059918314,0.0006656183,0.00009527615,0.00051002525],"domain_scores_gemma":[0.99543875,0.0039627296,0.00025854312,0.00024417002,0.00008157008,0.000014258603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0121348,0.00020906911,0.00061095797,0.00061830867,0.00018424768,0.00004902639,0.00020863705,0.00013882693,0.000015059053],"category_scores_gemma":[0.002490757,0.00020739669,0.00009629162,0.0019738886,0.00017390691,0.00014252812,0.00017045127,0.00024239466,0.0000020040745],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00055553816,0.00016425204,0.8293616,0.0005747785,0.00012521617,0.000003723637,0.0005627522,0.117605984,0.00040318482,0.035461962,0.0000022134361,0.015178769],"study_design_scores_gemma":[0.0009283588,0.000012192418,0.27259946,0.000026350597,0.00027108082,9.1523117e-7,0.0007292542,0.12198954,0.00080173806,0.60205513,0.00018834222,0.00039761938],"about_ca_topic_score_codex":0.00021308156,"about_ca_topic_score_gemma":0.003661883,"teacher_disagreement_score":0.56659317,"about_ca_system_score_codex":0.00005887861,"about_ca_system_score_gemma":0.000016671267,"threshold_uncertainty_score":0.8457392},"labels":[],"label_agreement":null},{"id":"W1980240525","doi":"10.1017/s0001867800007795","title":"Diffusion-Scale Tightness of Invariant Distributions of a Large-Scale Flexible Service System","year":2015,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Mathematics; Invariant (physics); Server; Scaling; Scale invariance; Limiting; Scaling limit; Statistical physics; Asymptotic distribution; Diffusion process; Discrete mathematics; Applied mathematics; Mathematical optimization; Innovation diffusion; Computer science; Statistics; Computer network; Physics; Geometry; Mathematical physics","score_opus":0.015337350338428021,"score_gpt":0.24949654184413939,"score_spread":0.23415919150571135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980240525","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86657804,0.00035529575,0.088165425,0.00021579549,0.00025931073,0.0011174993,0.00009024306,0.00025363365,0.04296476],"genre_scores_gemma":[0.993922,0.0000059342656,0.005676961,0.000069173555,0.000090687274,0.00012481972,0.000075623255,0.000017470722,0.000017358052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809784,0.000041617343,0.00074209593,0.0004542221,0.0003419298,0.00032231657],"domain_scores_gemma":[0.99823886,0.000116940224,0.0005543398,0.00069788384,0.00036215002,0.000029812652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00137327,0.0002122157,0.0005711774,0.0001533159,0.00009069845,0.000020319805,0.0004418946,0.00009100152,0.000036869813],"category_scores_gemma":[0.00013220593,0.0001916843,0.00008509191,0.0017115374,0.00016987347,0.000705293,0.00037786874,0.000154604,0.000028632392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006921034,0.001363873,0.0384092,0.004363548,0.00003666269,0.000002584022,0.0005457959,0.038887557,0.0029157368,0.9101927,0.00003255592,0.0025576535],"study_design_scores_gemma":[0.004355974,0.000039632363,0.006418178,0.00069609785,0.0003273592,0.0000031051375,0.0073163705,0.045602415,0.011941117,0.89778066,0.024455763,0.0010633174],"about_ca_topic_score_codex":0.00016588587,"about_ca_topic_score_gemma":0.0011528687,"teacher_disagreement_score":0.12734394,"about_ca_system_score_codex":0.0001412287,"about_ca_system_score_gemma":0.0000452797,"threshold_uncertainty_score":0.7816659},"labels":[],"label_agreement":null},{"id":"W1980785143","doi":"10.1017/s0269964809990222","title":"THE <i>N</i>-NETWORK MODEL WITH UPGRADES","year":2010,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Division of Civil, Mechanical and Manufacturing Innovation","keywords":"Queue; Server; Computer science; Service (business); Order (exchange); Class (philosophy); Control (management); Queueing theory; Operations research; Computer network; Work (physics); Holding cost; Stability (learning theory); Mathematical optimization; Real-time computing; Business; Mathematics; Engineering; Finance","score_opus":0.0089960027096487,"score_gpt":0.19692584448858022,"score_spread":0.18792984177893152,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1980785143","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906585,0.000031816315,0.0011513049,0.0026785492,0.00007326124,0.00015254547,4.4035806e-7,0.000049657043,0.005203885],"genre_scores_gemma":[0.99836266,0.0000027386634,0.0011843684,0.0002960575,0.000117610376,0.00002395631,0.000001182389,0.000001678511,0.000009739038],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994335,0.000003821106,0.00013295298,0.00007475128,0.00019979576,0.0001551579],"domain_scores_gemma":[0.99959975,0.00020670475,0.00005355549,0.00010280514,0.0000326939,0.0000045131746],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020174843,0.000064866035,0.000050362272,0.00002925148,0.0004574033,0.0003004214,0.0002859735,0.000015299935,0.000002617828],"category_scores_gemma":[0.00022884905,0.000030250676,0.000014639042,0.00044618416,0.00023677327,0.0010802525,0.000045264635,0.00014270905,0.0000033432311],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000002393952,0.0000025230872,0.000503444,0.00000815518,0.0000011614069,2.3934787e-8,0.000058067966,0.673172,0.0000043449313,0.3258755,0.000025639369,0.00034676865],"study_design_scores_gemma":[0.000034240133,0.0000025568472,0.0006680484,0.00000622723,0.0000031389245,0.0000015009147,0.000074915835,0.86785793,0.0000016918858,0.12815341,0.003144951,0.00005138956],"about_ca_topic_score_codex":0.000013457851,"about_ca_topic_score_gemma":0.000078277495,"teacher_disagreement_score":0.19772206,"about_ca_system_score_codex":0.000004552646,"about_ca_system_score_gemma":0.000012057385,"threshold_uncertainty_score":0.3518023},"labels":[],"label_agreement":null},{"id":"W1981162594","doi":"10.1016/j.ejor.2007.11.007","title":"Apportionment methods and the Liu–Layland problem","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Memorial University of Newfoundland","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Apportionment; Computer science; Operations research; Mathematics; Political science; Law","score_opus":0.07106822064995089,"score_gpt":0.40002046072908043,"score_spread":0.32895224007912954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981162594","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24039768,0.0015049177,0.48914126,0.02202026,0.00032295054,0.0006238663,0.0000010574518,0.0000309239,0.24595709],"genre_scores_gemma":[0.9778114,0.000045789,0.018815033,0.0007123552,0.0013369377,0.00000131737,0.0000022214176,0.000019205825,0.0012557372],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99796706,0.0005637453,0.00047574055,0.000118323944,0.0006734089,0.00020170494],"domain_scores_gemma":[0.9983007,0.00060003693,0.00021288185,0.000118955635,0.00074279634,0.00002465644],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.047650464,0.00007393668,0.00013338315,0.00030804836,0.00043347667,0.00033176885,0.00027290135,0.00001040265,0.00021135512],"category_scores_gemma":[0.0013441369,0.000043624867,0.00006312536,0.0003863053,0.0002653737,0.0006047107,0.00018280279,0.00038490043,0.00007112716],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021935394,0.00019506871,0.002582463,0.00007643626,0.00032093632,0.000416422,0.0007719512,0.0062553585,0.0071102516,0.7726636,0.008407787,0.19900617],"study_design_scores_gemma":[0.006829167,0.00018381387,0.038899124,0.00021756749,0.00017701898,0.0002766322,0.0026345272,0.009174436,0.0008287208,0.11006578,0.8302465,0.0004666739],"about_ca_topic_score_codex":0.000005498672,"about_ca_topic_score_gemma":0.0000027906701,"teacher_disagreement_score":0.82183874,"about_ca_system_score_codex":0.00002885001,"about_ca_system_score_gemma":0.000028921719,"threshold_uncertainty_score":0.9806443},"labels":[],"label_agreement":null},{"id":"W1981357722","doi":"10.1109/aict.2007.35","title":"Optimizing Bandwidth Allocation of Different Traffic Classes for Traffic between an ISP and a Future Home Area Network","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Bandwidth (computing); Computer network; Quality of service; Computer science; Dynamic bandwidth allocation; Bandwidth allocation; Network traffic control; Queue; Blocking (statistics); Traffic generation model; Queueing theory; Real-time computing; Network packet","score_opus":0.01681531837538244,"score_gpt":0.24427341772332534,"score_spread":0.2274580993479429,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981357722","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92773795,0.00014558433,0.07093817,0.00028308303,0.00011711749,0.00028046753,0.0000017954907,0.00014742062,0.00034843085],"genre_scores_gemma":[0.9924188,0.00002327311,0.004745325,0.0001894141,0.002400421,0.00001066855,0.00010990427,0.00003110057,0.00007104213],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99884987,0.000011836352,0.0003621519,0.0003075816,0.00014583985,0.0003227101],"domain_scores_gemma":[0.9992025,0.00019103162,0.0002505726,0.0002107979,0.00012027649,0.000024842393],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005822378,0.00020477391,0.000357784,0.00020718329,0.00018184497,0.00009534858,0.00015473462,0.00009430563,0.00004545188],"category_scores_gemma":[0.0000250619,0.0001686045,0.00009965965,0.00039159297,0.000051654904,0.0007199878,0.000041563875,0.000085681546,0.0000013984359],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007017346,0.0004897266,0.014271639,0.00090622745,0.00059756153,0.000004933608,0.0006783358,0.3797554,0.00071963476,0.07148895,0.0008973144,0.5294885],"study_design_scores_gemma":[0.0068083564,0.00045318404,0.1051958,0.0004505964,0.003430703,0.000004451458,0.009782921,0.8078393,0.00063085515,0.029404528,0.032968484,0.0030308634],"about_ca_topic_score_codex":0.000004950435,"about_ca_topic_score_gemma":0.00022357359,"teacher_disagreement_score":0.52645767,"about_ca_system_score_codex":0.000020943127,"about_ca_system_score_gemma":0.000005459803,"threshold_uncertainty_score":0.6875492},"labels":[],"label_agreement":null},{"id":"W1981846742","doi":"10.1145/1639562.1639593","title":"State-dependent response times via fluid limits in shortest remaining processing time queues","year":2009,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Queue; Computer science; Response time; State (computer science); Stochastic game; State dependent; Distributed computing; Mathematics; Computer network; Algorithm; Mathematical economics; Operating system","score_opus":0.039518947868368536,"score_gpt":0.31695048431339873,"score_spread":0.2774315364450302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1981846742","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88058513,0.10080534,0.0019493289,0.00451801,0.00023588038,0.0027987957,0.0000025782408,0.00056235143,0.008542554],"genre_scores_gemma":[0.9847369,0.008960218,0.0010078837,0.0044039004,0.00021721273,0.000082780825,0.00007095792,0.00004414513,0.00047598226],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964831,0.0002293972,0.0010243589,0.00057720207,0.001214088,0.00047185738],"domain_scores_gemma":[0.9972282,0.00039486086,0.00071825704,0.000782409,0.00084699714,0.000029266119],"candidate_categories":["metaresearch","metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.013938295,0.00034686766,0.0006187042,0.0014573226,0.00026860333,0.0002117461,0.000656645,0.00008065991,0.0007266429],"category_scores_gemma":[0.011490184,0.00032634867,0.00011706093,0.005811037,0.00003941568,0.0028774077,0.00013252217,0.00028580736,0.0009160841],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020777254,0.00013116449,0.0024878308,0.0007743909,0.000020672282,0.000009053656,0.00006122692,0.017281799,0.001114077,0.000076580465,0.00062724546,0.9772082],"study_design_scores_gemma":[0.001170192,0.00013799338,0.021380972,0.007117948,0.0006855489,0.000010811443,0.0000451716,0.952492,0.0005060294,0.004631137,0.010687374,0.0011348324],"about_ca_topic_score_codex":0.000007021386,"about_ca_topic_score_gemma":0.0000052828045,"teacher_disagreement_score":0.9760733,"about_ca_system_score_codex":0.00028255192,"about_ca_system_score_gemma":0.00012478023,"threshold_uncertainty_score":0.9999189},"labels":[],"label_agreement":null},{"id":"W1982007135","doi":"10.1002/nav.21537","title":"Analysis of the finite‐source multiclass priority queue with an unreliable server and setup time","year":2013,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Queue; Queueing theory; Service (business); Class (philosophy); Duration (music); Process (computing); Operations research; Population; Queueing system; Real-time computing; Mathematical optimization; Computer network; Mathematics; Operating system; Artificial intelligence","score_opus":0.04220800871140818,"score_gpt":0.31111681109413525,"score_spread":0.2689088023827271,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982007135","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98849696,0.0000554215,0.005741749,0.00061342464,0.00004101775,0.000525529,0.000022031903,0.00008250701,0.0044213478],"genre_scores_gemma":[0.99474144,0.000009673197,0.00069165777,0.00018366578,0.00013635097,0.00002191751,0.000033614037,0.000030155112,0.0041514994],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975099,0.0001996534,0.0003176982,0.00045948615,0.0009738168,0.0005394505],"domain_scores_gemma":[0.9964671,0.0011219032,0.0002163637,0.00086843164,0.0012723162,0.00005385729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023276568,0.00019792675,0.00040755028,0.00058066205,0.00044182406,0.0003407247,0.0006446154,0.00011403484,0.0004862165],"category_scores_gemma":[0.004151346,0.00013125947,0.0001098851,0.003028872,0.00076032913,0.0007528662,0.0005980004,0.00051362935,0.00017555115],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011425212,0.0014320761,0.4231699,0.00095798663,0.0042741275,0.000056811637,0.0007239039,0.4601023,0.0096630715,0.0805724,0.002773246,0.015131657],"study_design_scores_gemma":[0.00053991604,0.000076203265,0.03081124,0.000058733964,0.00096302206,6.533411e-7,0.0004281134,0.9490835,0.00023347259,0.012647075,0.0048452504,0.00031281525],"about_ca_topic_score_codex":0.005260849,"about_ca_topic_score_gemma":0.0009772892,"teacher_disagreement_score":0.48898122,"about_ca_system_score_codex":0.000070796996,"about_ca_system_score_gemma":0.000055445154,"threshold_uncertainty_score":0.7952865},"labels":[],"label_agreement":null},{"id":"W1982687749","doi":"10.1109/spcom.2010.5560466","title":"Some new results on the stability of Markovian stochastic network models","year":2010,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Markov process; Stability (learning theory); Computer science; Markov chain; Class (philosophy); Wireless network; Routing (electronic design automation); Mathematical optimization; Markov model; Wireless; Mathematics; Artificial intelligence; Computer network; Machine learning; Telecommunications","score_opus":0.0246662705126906,"score_gpt":0.22721343879850728,"score_spread":0.20254716828581668,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1982687749","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79515105,0.00004069832,0.07040421,0.016904773,0.001181423,0.0008651904,0.000009530927,0.00043961752,0.11500351],"genre_scores_gemma":[0.9958125,7.3842693e-7,0.00053976267,0.0013708095,0.0015439402,0.0000045161755,0.0000066863486,0.00001631857,0.0007047461],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998982,0.000017456816,0.00029985965,0.00025671313,0.00021018683,0.00023377172],"domain_scores_gemma":[0.9985914,0.00038926653,0.00022359582,0.00069170364,0.000090097754,0.000013939752],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010600289,0.00013735273,0.0001843178,0.00006479115,0.00014355652,0.00006041047,0.00034933933,0.000050837207,0.0004761006],"category_scores_gemma":[0.000592456,0.00008764102,0.00009994261,0.00038851603,0.00009360352,0.00064738275,0.00013902491,0.0002249679,0.00008248605],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00020829125,0.000036035468,0.00003797726,0.000010399331,0.000024152036,4.0572047e-7,0.00002149044,0.15098797,0.00026049372,0.8444884,0.002816361,0.0011080309],"study_design_scores_gemma":[0.0002949891,0.00000755381,0.00017897581,0.00001936362,0.000059003378,1.1781734e-7,0.00008123378,0.2038343,0.000090795475,0.79370874,0.001572213,0.00015273041],"about_ca_topic_score_codex":0.00029429456,"about_ca_topic_score_gemma":0.00041524292,"teacher_disagreement_score":0.20066144,"about_ca_system_score_codex":0.0000088712695,"about_ca_system_score_gemma":0.000016293192,"threshold_uncertainty_score":0.5212968},"labels":[],"label_agreement":null},{"id":"W1983781196","doi":"10.1081/stm-120014219","title":"AN INFINITE-PHASE QUASI-BIRTH-AND-DEATH MODEL FOR THE NON-PREEMPTIVE PRIORITY<i>M</i>/PH/1 QUEUE","year":2002,"lang":"en","type":"article","venue":"Stochastic Models","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Mathematics; Priority queue; Phase-type distribution; Queue; Bulk queue; Poisson distribution; Joint probability distribution; Markov chain; Computation; Distribution (mathematics); Mathematical optimization; Applied mathematics; Queueing theory; Computer science; Algorithm; Statistics; Mathematical analysis; Computer network","score_opus":0.043674918442260124,"score_gpt":0.2848191169382849,"score_spread":0.24114419849602475,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1983781196","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022984384,0.00018768286,0.9742674,0.00039580578,0.000113180875,0.0008078188,0.00003772551,0.00017306714,0.0010329295],"genre_scores_gemma":[0.99363166,0.000011811923,0.003539727,0.0011844696,0.0006123486,0.00023668818,0.000022908382,0.00007031961,0.0006900806],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822104,0.000018817595,0.00038564258,0.00058345275,0.0002940827,0.00049693824],"domain_scores_gemma":[0.9983734,0.00036537636,0.00026827888,0.00069198554,0.00025455566,0.00004642978],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060319825,0.0003588373,0.00039203902,0.00022922277,0.00061279733,0.0002548929,0.0004904278,0.00010497011,0.000081943814],"category_scores_gemma":[0.00023061721,0.00028306435,0.00019724196,0.000323255,0.000121886624,0.0017848166,0.00016254875,0.00023723983,0.000047024292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013830111,0.00020836135,0.000007307764,0.00004897728,0.00008474556,0.0000019813542,0.00068975915,0.77939904,0.00007462276,0.21418244,0.00010983667,0.0050546033],"study_design_scores_gemma":[0.0010454208,0.000045101417,0.000002381614,0.000028115513,0.00027691593,0.0000013082977,0.00020877305,0.7717074,0.0000029910113,0.2262815,0.000111479545,0.00028860453],"about_ca_topic_score_codex":0.000112817004,"about_ca_topic_score_gemma":0.00006763936,"teacher_disagreement_score":0.9707277,"about_ca_system_score_codex":0.000038596885,"about_ca_system_score_gemma":0.000016715541,"threshold_uncertainty_score":0.99996215},"labels":[],"label_agreement":null},{"id":"W1984724866","doi":"10.1080/00207160.2013.867021","title":"Analysis of queueing-time distributions for MAP/D<sub><i>N</i></sub>/1 queue","year":2014,"lang":"en","type":"article","venue":"International Journal of Computer Mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Computer science; Markovian arrival process; Queue; Transmission (telecommunications); Probability-generating function; Layered queueing network; Mean value analysis; Bulk queue; Markov process; Real-time computing; Variable (mathematics); Algorithm; Mathematics; Applied mathematics; Random variable; Computer network; Statistics; Telecommunications; Mathematical analysis","score_opus":0.008874086341083479,"score_gpt":0.24322231641666409,"score_spread":0.23434823007558062,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984724866","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16414899,0.000011975043,0.83450174,0.00063750596,0.0004063172,0.000066381974,0.000018707564,0.000021860531,0.00018651121],"genre_scores_gemma":[0.96419066,0.0000043993286,0.03369647,0.0003851933,0.0016010226,0.000003838456,0.000068439935,0.000023215112,0.000026783273],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836683,0.000019310097,0.0008762751,0.00012787011,0.00046642375,0.0001432968],"domain_scores_gemma":[0.99622965,0.00049418444,0.0015487348,0.00020082021,0.0015074228,0.000019218467],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00092486385,0.00015166734,0.00051838445,0.0008630953,0.000057431793,0.00014151233,0.0006481195,0.00004857402,0.000042870764],"category_scores_gemma":[0.00031987907,0.0001356471,0.00057962653,0.00047570677,0.00005831317,0.00056978274,0.0001345697,0.00010269432,0.000027158014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002380256,0.0013673994,0.0013613596,0.00044864474,0.014640644,0.000023374128,0.0004431243,0.19358057,0.018758843,0.7303058,0.007452988,0.03137922],"study_design_scores_gemma":[0.0005932295,0.0000328139,0.0003110108,0.00019652628,0.0021380032,0.0000103873435,0.00002760491,0.85632265,0.002854903,0.13104185,0.0062637534,0.00020728767],"about_ca_topic_score_codex":0.0000033002998,"about_ca_topic_score_gemma":0.000005682663,"teacher_disagreement_score":0.8008053,"about_ca_system_score_codex":0.00005209394,"about_ca_system_score_gemma":0.00001863817,"threshold_uncertainty_score":0.5531528},"labels":[],"label_agreement":null},{"id":"W1984895351","doi":"10.1007/s11134-012-9302-1","title":"Analysis of queueing systems with customer interjections","year":2012,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Waterloo","funders":"","keywords":"Joins; Queueing theory; Queue; Computer science; Join (topology); Variance (accounting); Service (business); Queueing system; Operations research; Mathematics; Computer network; Business; Marketing; Combinatorics","score_opus":0.013810463852252833,"score_gpt":0.2360998558738797,"score_spread":0.22228939202162684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1984895351","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.857517,0.0020041456,0.0757357,0.00007773337,0.0026352792,0.0008052314,0.000011270057,0.0008344832,0.060379144],"genre_scores_gemma":[0.9972958,0.000003760958,0.00005846559,0.000060342012,0.0011174795,0.00006785595,0.000030671068,0.0000597475,0.0013058569],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978941,0.00008453599,0.0006999782,0.0003519763,0.00043812982,0.0005312768],"domain_scores_gemma":[0.998002,0.00015283513,0.00085396314,0.0006239349,0.0003289612,0.000038303766],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011501132,0.00030332545,0.0008280609,0.001745536,0.0002497679,0.000257064,0.0003065305,0.000102831975,0.00006606239],"category_scores_gemma":[0.00010996635,0.000250574,0.00026774846,0.003831144,0.00009186805,0.001947394,0.00010404967,0.00018480746,0.00017906302],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008658935,0.00020374253,0.32127538,0.0009808599,0.005454947,0.00001124647,0.00063849945,0.47483775,0.0010498845,0.1947449,0.00043083922,0.00028533948],"study_design_scores_gemma":[0.0014263565,0.000059563827,0.015850002,0.0023419976,0.02220194,0.00004962692,0.020708803,0.8280708,0.00019744699,0.0001733406,0.106350176,0.0025699502],"about_ca_topic_score_codex":0.006500753,"about_ca_topic_score_gemma":0.0002137366,"teacher_disagreement_score":0.35323304,"about_ca_system_score_codex":0.00012105906,"about_ca_system_score_gemma":0.000016088976,"threshold_uncertainty_score":0.99999464},"labels":[],"label_agreement":null},{"id":"W1985418137","doi":"10.5539/jmr.v4n4p114","title":"Balking and Re-service in a Vacation Queue with Batch Arrival and Two Types of Heterogeneous Service","year":2012,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Service (business); Queue; Type of service; Service system; Computer science; Operations research; Service level objective; Computer network; Mathematics; Service design; Business; Service delivery framework; Marketing","score_opus":0.06487594620288802,"score_gpt":0.35003518058147776,"score_spread":0.28515923437858975,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985418137","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9972841,0.0003056273,0.0011465788,0.000627313,0.000017033424,0.00008898816,2.9064583e-7,0.0000041557287,0.0005259209],"genre_scores_gemma":[0.9940796,0.00003481067,0.005575719,0.000093275914,0.00018304007,0.000001979312,4.9996197e-7,0.000016316919,0.0000147649125],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998869,0.000049773505,0.00034576346,0.00007933808,0.0004454482,0.0002106698],"domain_scores_gemma":[0.9985292,0.00031924163,0.0003519148,0.00013964891,0.0006352793,0.000024720495],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0030972927,0.00008306418,0.00024344886,0.00045241794,0.00006577596,0.00007239528,0.00016241438,0.00003352364,0.000031959727],"category_scores_gemma":[0.0002964252,0.0000624917,0.000020142204,0.0006844133,0.000040104696,0.0007234901,0.00013773219,0.00023856695,0.000005644551],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039426493,0.0058652726,0.4729446,0.041607305,0.002423488,0.0003822026,0.06025217,0.06974019,0.10928016,0.18758486,0.00044217182,0.045534924],"study_design_scores_gemma":[0.0097845,0.0004559991,0.030421497,0.009172197,0.0011780711,0.00095568894,0.04929462,0.4886761,0.01082065,0.39371315,0.0038879097,0.0016396232],"about_ca_topic_score_codex":0.00013067386,"about_ca_topic_score_gemma":0.0003691377,"teacher_disagreement_score":0.4425231,"about_ca_system_score_codex":0.000028767192,"about_ca_system_score_gemma":0.000019767149,"threshold_uncertainty_score":0.2548338},"labels":[],"label_agreement":null},{"id":"W1985863377","doi":"10.1007/s11009-007-9064-0","title":"On the Finite Buffer Queue with Renewal Input and Batch Markovian Service Process: GI/BMSP/1/N","year":2008,"lang":"en","type":"article","venue":"Methodology And Computing In Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Queue; Buffer (optical fiber); Markov process; Markovian arrival process; Process (computing); Queueing theory; Renewal theory; Markov chain; Mathematical optimization; Applied mathematics; Statistics; Computer network; Computer science","score_opus":0.05882307351263983,"score_gpt":0.26505853850487704,"score_spread":0.20623546499223722,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1985863377","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97116816,0.000030857074,0.02203871,0.0015836773,0.000039522645,0.00044539964,5.9317193e-7,0.00010415086,0.0045889257],"genre_scores_gemma":[0.97653425,0.0000035168928,0.019196834,0.0040567648,0.0001284722,0.000039703693,0.0000052049463,0.000019186287,0.00001604395],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99819934,0.00034915932,0.0003280672,0.0006493474,0.00014267904,0.0003314029],"domain_scores_gemma":[0.9962894,0.0030028522,0.00022165841,0.00037810975,0.00009024969,0.000017728655],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039045424,0.000261685,0.00042230214,0.00012365477,0.00048343145,0.000046756457,0.00023898103,0.00013316625,0.000028740546],"category_scores_gemma":[0.00073994364,0.00017855618,0.000027447139,0.0007201171,0.00039672354,0.00011301682,0.00023188064,0.00045436938,0.000007794183],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004486043,0.00053508295,0.23400098,0.0016248552,0.00023827153,0.00005151009,0.004831942,0.09430314,0.00042925507,0.6311344,0.00006807836,0.028296422],"study_design_scores_gemma":[0.0010551295,0.000045632958,0.034028806,0.00009685015,0.00008672213,0.000022822296,0.00051822694,0.045859434,0.000153982,0.9172832,0.00034623774,0.0005029992],"about_ca_topic_score_codex":0.00017597916,"about_ca_topic_score_gemma":0.00036183014,"teacher_disagreement_score":0.28614873,"about_ca_system_score_codex":0.000022285596,"about_ca_system_score_gemma":0.000024300223,"threshold_uncertainty_score":0.728131},"labels":[],"label_agreement":null},{"id":"W1986395670","doi":"10.1177/0037549713479405","title":"Call-type dependence in multiskill call centers","year":2013,"lang":"en","type":"article","venue":"SIMULATION","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hydro-Québec; Université de Montréal","funders":"","keywords":"Pooling; Copula (linguistics); Merge (version control); Computer science; Econometrics; Tail dependence; Multivariate statistics; Mathematics; Artificial intelligence; Machine learning","score_opus":0.014167631266299935,"score_gpt":0.2581653300274689,"score_spread":0.24399769876116895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986395670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98876536,0.000017653529,0.008087692,0.00019598246,0.00020337818,0.0002287113,2.8021307e-7,0.00010378046,0.002397159],"genre_scores_gemma":[0.9986052,0.0000013620357,0.00030041518,0.0005529474,0.00016289699,0.000006039371,0.000021306854,0.000014055186,0.00033575634],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99930805,0.000012500281,0.00018336906,0.00019103028,0.00013309023,0.00017194079],"domain_scores_gemma":[0.99953896,0.00007550296,0.0001020468,0.00015884366,0.00011694739,0.0000076993865],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000144046,0.00009420473,0.00010289074,0.00018253474,0.000057011486,0.00007694533,0.000109500696,0.000045495926,0.0002864957],"category_scores_gemma":[0.00026838743,0.00009280127,0.000032710235,0.00036814343,0.000018523675,0.0013561834,0.00005496113,0.000081912236,0.0009041255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019218925,0.000029227484,0.06591793,0.000017661709,0.000007014986,0.0000033610675,0.000035874204,0.92650443,0.0006890137,0.0012385235,0.00008670599,0.0054510483],"study_design_scores_gemma":[0.0002885491,0.0000024947403,0.048039813,0.00002350701,0.000013804767,9.719254e-8,0.00003188457,0.9431452,0.000021647027,0.0063174698,0.001981065,0.00013444373],"about_ca_topic_score_codex":0.0013645422,"about_ca_topic_score_gemma":0.00045828955,"teacher_disagreement_score":0.017878123,"about_ca_system_score_codex":0.000044168344,"about_ca_system_score_gemma":0.0000035458684,"threshold_uncertainty_score":0.99987376},"labels":[],"label_agreement":null},{"id":"W1986416621","doi":"10.5539/mas.v2n5p157","title":"Steady-state Analysis of the GI/M/1 Queue with Multiple Vacations and Set-up Time","year":2009,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Queue; Set (abstract data type); Computer science; Burke's theorem; Queueing theory; Decomposition; State (computer science); Steady state (chemistry); Mathematics; Algorithm; Queue management system; Computer network; Fork–join queue","score_opus":0.009684935043730504,"score_gpt":0.21975896850555432,"score_spread":0.21007403346182382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986416621","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9049408,0.000013853121,0.087074526,0.00039734735,0.000018270875,0.0002161662,0.000005063219,0.000070075264,0.0072639263],"genre_scores_gemma":[0.99854076,9.244077e-7,0.00047678596,0.0005055209,0.000019246125,0.0000068649856,0.000004152494,0.000006437204,0.00043929595],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988606,0.0000066780317,0.00017637492,0.00036472475,0.00036790015,0.00022373439],"domain_scores_gemma":[0.99910814,0.00004710646,0.00022630782,0.00047518735,0.00012742833,0.000015826856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052374305,0.00012119281,0.0002086734,0.0003962007,0.000438956,0.00013326382,0.00048611278,0.00001818667,0.00002145333],"category_scores_gemma":[0.000058246682,0.00008131152,0.000049772607,0.0036446785,0.00042785215,0.00053679914,0.00013154704,0.000078386685,0.000016023305],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016373052,0.00013813356,0.013086901,0.000036361565,0.00033343842,0.0000015942231,0.0026735081,0.42782736,0.45456514,0.077465706,0.0000725811,0.023635572],"study_design_scores_gemma":[0.00020745498,0.0000038495477,0.022898152,0.000008580233,0.0004469111,2.633954e-7,0.00015891739,0.9518593,0.0011456447,0.02296004,0.00014832865,0.00016255138],"about_ca_topic_score_codex":0.000051140505,"about_ca_topic_score_gemma":0.00011166809,"teacher_disagreement_score":0.52403194,"about_ca_system_score_codex":0.000024543308,"about_ca_system_score_gemma":0.000026436057,"threshold_uncertainty_score":0.33761388},"labels":[],"label_agreement":null},{"id":"W1986975386","doi":"10.1155/2014/819718","title":"Binomial Schedule for an M/G/1 Type Queueing System with an Unreliable Server under <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"M1\"><mml:mrow><mml:mi>N</mml:mi></mml:mrow></mml:math>-Policy","year":2014,"lang":"en","type":"article","venue":"Advances in Decision Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Becton Dickinson (Canada)","funders":"","keywords":"Algorithm; Schedule; Computer science; Type (biology); Discrete mathematics; Mathematics; Database; Operating system","score_opus":0.02343178417225758,"score_gpt":0.2832877936563757,"score_spread":0.25985600948411813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1986975386","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9540192,0.00021629488,0.014681608,0.000096788695,0.0006827121,0.000031561976,0.000003871901,0.000103990744,0.030164],"genre_scores_gemma":[0.9878771,0.000049211496,0.010461909,0.00060769514,0.0008079307,0.00007391656,0.000027699001,0.00006011463,0.00003445898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99754226,0.000047217804,0.00045995234,0.0006705059,0.00073055003,0.00054954085],"domain_scores_gemma":[0.9979805,0.00068560074,0.0005359266,0.0006137758,0.00011164157,0.000072580064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019774016,0.00020831572,0.0001604764,0.0003605702,0.0007409982,0.00069683715,0.0009050221,0.00017726162,0.00057879376],"category_scores_gemma":[0.0010795078,0.00023614835,0.00013227771,0.0012887625,0.00045531953,0.0043729455,0.00034630913,0.0001778288,0.00026294155],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026709746,0.00003890266,0.000052719584,0.00011636361,0.000021406307,0.000011634731,0.00008684508,0.06675589,0.00012757388,0.9285058,0.00020036606,0.0038154281],"study_design_scores_gemma":[0.00065687,0.00037535207,0.000084426625,0.0006197867,0.00010842014,0.000027768616,0.002790213,0.96820474,0.009171879,0.011661555,0.0058325008,0.00046650856],"about_ca_topic_score_codex":0.00044417268,"about_ca_topic_score_gemma":0.0015204422,"teacher_disagreement_score":0.9168442,"about_ca_system_score_codex":0.000012230604,"about_ca_system_score_gemma":0.00016864977,"threshold_uncertainty_score":0.962985},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.032219875897832935,"score_gpt":0.30815311910021703,"score_spread":0.2759332432023841,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987222495","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72687,0.00012007471,0.2512139,0.00209339,0.00006085045,0.0012094846,0.000018046474,0.00013472175,0.018279517],"genre_scores_gemma":[0.992316,0.0000071291443,0.0038780505,0.00010782589,0.00008809991,0.00016289527,0.000027208029,0.000023808529,0.0033889932],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986362,0.00006405284,0.0002474014,0.00025781014,0.0005008447,0.00029369173],"domain_scores_gemma":[0.99814445,0.00008802086,0.000037190937,0.00043009516,0.0012774662,0.00002277138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061014964,0.00010544939,0.00020394311,0.0005238577,0.00079096755,0.00009628104,0.00025428485,0.000037249458,0.00018177206],"category_scores_gemma":[0.00019317617,0.00008828673,0.00004065985,0.0019800176,0.000148946,0.00040111213,0.00007622576,0.00016856882,0.00031812632],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010181122,0.00006509652,0.0021818564,0.00007150238,0.00006288873,0.000017035394,0.00009821065,0.9110029,0.00081683684,0.08524947,0.00013719819,0.00019519917],"study_design_scores_gemma":[0.0012174485,0.000045758337,0.003214802,0.000120101045,0.00004932825,0.000009278833,0.0010451484,0.9892496,0.000037103557,0.00022349968,0.004541456,0.00024646934],"about_ca_topic_score_codex":0.0019737456,"about_ca_topic_score_gemma":0.007350281,"teacher_disagreement_score":0.26544598,"about_ca_system_score_codex":0.000100170524,"about_ca_system_score_gemma":0.0001143019,"threshold_uncertainty_score":0.6083563},"labels":[],"label_agreement":null},{"id":"W1987581179","doi":"10.1109/tac.2013.2286756","title":"Energy-Aware Scheduling on Heterogeneous Processors","year":2013,"lang":"en","type":"article","venue":"IEEE Transactions on Automatic Control","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Server; Scheduling (production processes); Distributed computing; Real-time computing; Mathematical optimization; Computer network; Mathematics","score_opus":0.008826034222911944,"score_gpt":0.21578174142373635,"score_spread":0.2069557072008244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1987581179","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12363056,0.000016242793,0.8729669,0.00092009926,0.00033214607,0.0003762356,0.0000040584955,0.0007893929,0.0009643608],"genre_scores_gemma":[0.99495345,0.0000021358549,0.0002510287,0.0037283942,0.00019491464,0.00033675806,0.000002790312,0.000055296867,0.00047523485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985507,0.000028715254,0.00038253682,0.00036533785,0.00031223067,0.00036045953],"domain_scores_gemma":[0.99902135,0.00018312552,0.0002131447,0.0004009382,0.00015089376,0.000030555686],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00015121522,0.0002922462,0.00034637866,0.0004207002,0.00035237888,0.0002423001,0.00025384026,0.000088053435,0.0018660985],"category_scores_gemma":[0.000017598495,0.00026207627,0.000224125,0.00046879516,0.00005036066,0.00070968515,0.000001553065,0.00014999862,0.001722335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081069884,0.00048183594,0.000013906632,0.00017569962,0.0003791696,0.000017433096,0.00005165179,0.71268517,0.0013637876,0.0012331423,0.00011549251,0.28340164],"study_design_scores_gemma":[0.0009812673,0.000029945555,0.0000136320305,0.00010734678,0.00021646614,0.0000032927237,0.00006915633,0.99215853,0.0012385772,0.0044585927,0.00041190223,0.0003112963],"about_ca_topic_score_codex":0.00012999676,"about_ca_topic_score_gemma":0.000053112104,"teacher_disagreement_score":0.8727159,"about_ca_system_score_codex":0.0000644432,"about_ca_system_score_gemma":0.000016015456,"threshold_uncertainty_score":0.99998313},"labels":[],"label_agreement":null},{"id":"W1988028024","doi":"10.1239/jap/1053003544","title":"Accurate bounds for the asymptotic constant in a statistical multiplexer with homogeneous generalized binary Markov sources","year":2003,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Mathematics; Markov chain; Constant (computer programming); Markov process; Bounding overwatch; Asymptotic analysis; Applied mathematics; Homogeneous; Binary number; Asymptotic distribution; Large deviations theory; Asymptotic formula; Combinatorics; Mathematical analysis; Statistics","score_opus":0.016188306496647674,"score_gpt":0.2381137980276167,"score_spread":0.22192549153096902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988028024","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93020344,0.00015518976,0.066961035,0.0004615796,0.000113543945,0.0009137048,0.000007867286,0.00002609484,0.0011575144],"genre_scores_gemma":[0.9762319,0.000005774988,0.023120308,0.00037681288,0.00015110611,0.00005563453,0.0000034809043,0.00002454968,0.00003043262],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984261,0.000054928947,0.0006592994,0.00025063366,0.0002873296,0.00032173665],"domain_scores_gemma":[0.998106,0.0006804896,0.00064636476,0.0002819401,0.0002607934,0.00002443233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023496137,0.00021182121,0.00044295378,0.00015078369,0.00022100651,0.00016831377,0.0002692187,0.00005769181,0.00012354096],"category_scores_gemma":[0.00056865596,0.00012609772,0.000118362295,0.00044706857,0.0002967341,0.00028477592,0.00004616074,0.00024797543,0.000004458414],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.015549728,0.0013123626,0.016660593,0.000731463,0.00081278203,0.00013688578,0.0005182412,0.37418315,0.0029539573,0.5753144,0.0007073876,0.011119063],"study_design_scores_gemma":[0.00968193,0.00024234704,0.0043206373,0.00013885801,0.0012537092,0.00009135693,0.0015294948,0.06245069,0.00063982344,0.88697314,0.031703755,0.00097427797],"about_ca_topic_score_codex":0.000014312584,"about_ca_topic_score_gemma":0.00009901612,"teacher_disagreement_score":0.31173247,"about_ca_system_score_codex":0.00009949274,"about_ca_system_score_gemma":0.000096999094,"threshold_uncertainty_score":0.5142116},"labels":[],"label_agreement":null},{"id":"W1988154361","doi":"10.1287/opre.1080.0585","title":"Staffing to Maximize Profit for Call Centers with Alternate Service-Level Agreements","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":52,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Staffing; Service level; Computer science; Service-level agreement; Profit (economics); Quality of service; Operations research; Abandonment (legal); Service level objective; Service (business); Service quality; Time horizon; Operations management; Business; Microeconomics; Economics; Computer network; Service provider; Finance; Mathematics; Marketing; Service design","score_opus":0.11190395337215261,"score_gpt":0.3681207014365225,"score_spread":0.2562167480643699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988154361","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8526729,0.000017348995,0.10534514,0.028721021,0.00010200096,0.0026740448,0.000035474946,0.00015063978,0.010281459],"genre_scores_gemma":[0.9719747,0.000003065845,0.016607365,0.0036390692,0.0003956777,0.00024870678,0.00011592373,0.00003362372,0.0069818925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984242,0.000028278288,0.00020181072,0.00037319295,0.0004821822,0.0004903757],"domain_scores_gemma":[0.9984896,0.000042647804,0.000027131822,0.00035903664,0.0010476377,0.000033907418],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008415332,0.00013422807,0.00014781262,0.00049021887,0.00071044336,0.0006007757,0.0004150664,0.00003032486,0.0001305583],"category_scores_gemma":[0.00020021816,0.00011325309,0.0000381172,0.0011754138,0.00002475788,0.00095837674,0.00013509598,0.00015645644,0.00034282042],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020919011,0.0006520564,0.004371508,0.00034907676,0.00038440368,0.000057613957,0.0011889318,0.7290006,0.035340432,0.16221869,0.011601765,0.05274301],"study_design_scores_gemma":[0.0077827033,0.0006103747,0.007093652,0.00078833173,0.00024589465,0.0000073535375,0.0035715252,0.8548681,0.0052123526,0.014541946,0.10333017,0.0019476009],"about_ca_topic_score_codex":0.00061436434,"about_ca_topic_score_gemma":0.0024818268,"teacher_disagreement_score":0.14767674,"about_ca_system_score_codex":0.00009363729,"about_ca_system_score_gemma":0.00003914793,"threshold_uncertainty_score":0.5793294},"labels":[],"label_agreement":null},{"id":"W1988204215","doi":"10.1145/2185395.2185404","title":"Factorization properties for a MAP-modulated fluid flow model under server vacation policies (abstract only)","year":2012,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Factorization; Computer science; Flow (mathematics); Extension (predicate logic); Server; Fluid dynamics; State (computer science); Type (biology); Fluid queue; Markov chain; Point (geometry); Property (philosophy); Idle; Mathematical optimization; Queueing theory; Algorithm; Mathematics; Computer network; Mechanics; Operating system; Physics; Geometry; Geology; Programming language","score_opus":0.12592283235028212,"score_gpt":0.32995301026599483,"score_spread":0.2040301779157127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1988204215","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8139945,0.06341454,0.11029621,0.0035383748,0.0012322598,0.0059151007,0.00001655205,0.00052344654,0.0010690145],"genre_scores_gemma":[0.9898301,0.0043133767,0.0015933259,0.0024891498,0.0006378567,0.0003086186,0.0005463584,0.000051630937,0.00022961045],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977675,0.000038821705,0.00067100895,0.00031021636,0.00079762563,0.0004148438],"domain_scores_gemma":[0.9971609,0.00013519409,0.00061575265,0.00067051,0.0013896225,0.000027982094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0035157264,0.00028750862,0.0003815607,0.00063052133,0.00034807523,0.00013575927,0.00039422233,0.00010372414,0.00025734032],"category_scores_gemma":[0.004255282,0.0002449097,0.00015963729,0.0022699817,0.000030916304,0.0045724283,0.00012703367,0.0001221837,0.0002487928],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000780515,0.00035531571,0.009782425,0.011060407,0.00020870045,5.42532e-8,0.00018416965,0.77621675,0.0017377599,0.008248261,0.0035071236,0.18862098],"study_design_scores_gemma":[0.00041762614,0.000012229343,0.009163149,0.0008618536,0.0007712525,5.5830156e-7,0.000029194496,0.9773948,0.00024708334,0.0026868698,0.008002149,0.00041319325],"about_ca_topic_score_codex":0.000017619663,"about_ca_topic_score_gemma":0.0000040899163,"teacher_disagreement_score":0.20117809,"about_ca_system_score_codex":0.00023953387,"about_ca_system_score_gemma":0.000085433116,"threshold_uncertainty_score":0.9987127},"labels":[],"label_agreement":null},{"id":"W1989120816","doi":"10.1214/aoap/1069786501","title":"Malyshev's theory and JS-queues. Asymptotics of stationary probabilities","year":2003,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Queue; Cover (algebra); Random walk; Mathematics; Plane (geometry); Join (topology); Statistical physics; Quarter (Canadian coin); Discrete mathematics; Combinatorics; Statistics; Computer science; Physics; Geometry; Geography; Engineering","score_opus":0.04030953914298908,"score_gpt":0.2684115126752967,"score_spread":0.22810197353230766,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989120816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95538723,0.00021698263,0.0017823221,0.00047223392,0.000037253285,0.0007115365,0.000009812054,0.00006678205,0.04131584],"genre_scores_gemma":[0.9980783,0.000019948244,0.001188618,0.00052439736,0.00004924423,0.000036939586,0.000007967427,0.000017956021,0.00007661274],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99855036,0.0001153669,0.000532561,0.0003024528,0.00026519416,0.00023405913],"domain_scores_gemma":[0.9979086,0.00066878495,0.00046689814,0.0006213999,0.00032102864,0.000013285163],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004556409,0.00019032932,0.00037641692,0.00010353035,0.0001364995,0.000031267336,0.00027118856,0.00006011406,0.00016741599],"category_scores_gemma":[0.00085628085,0.00013831971,0.00011079309,0.00042821266,0.0008022787,0.00032955344,0.00014005374,0.00012648529,0.000008231571],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003797112,0.00013980144,0.0010656049,0.0004050906,0.00008585811,1.7111037e-7,0.00028726057,0.0034962795,0.00036102315,0.99121034,0.000058664747,0.0025102207],"study_design_scores_gemma":[0.00018046229,0.00001342315,0.0011489702,0.000019063396,0.0000892537,3.7467558e-7,0.00066925096,0.00025513553,0.004995254,0.9911236,0.0013612249,0.00014396943],"about_ca_topic_score_codex":0.000019304125,"about_ca_topic_score_gemma":0.000011065458,"teacher_disagreement_score":0.042691078,"about_ca_system_score_codex":0.00000793372,"about_ca_system_score_gemma":0.000035279976,"threshold_uncertainty_score":0.5640514},"labels":[],"label_agreement":null},{"id":"W1989430741","doi":"10.1007/s11009-011-9266-3","title":"A Simple and Complete Computational Analysis of MAP/R/1 Queue Using Roots","year":2011,"lang":"en","type":"article","venue":"Methodology And Computing In Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":37,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Council of Scientific and Industrial Research, India","keywords":"Mathematics; Laplace–Stieltjes transform; Laplace transform; Applied mathematics; Simple (philosophy); Markovian arrival process; Matrix (chemical analysis); Generating function; Matrix exponential; Queueing theory; Mathematical analysis; Fourier transform; Differential equation; Statistics; Fourier analysis","score_opus":0.15010608278732454,"score_gpt":0.3198097779773849,"score_spread":0.16970369519006037,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1989430741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7001414,0.00003339226,0.29901683,0.000014667894,0.000024926796,0.0001513487,0.000002170859,0.000034426514,0.0005808555],"genre_scores_gemma":[0.78558445,3.769248e-7,0.2141891,0.0001710448,0.000029204248,0.0000035743249,0.000013622101,0.000007717274,9.022662e-7],"study_design_codex":"observational","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99839604,0.00024946666,0.00052527204,0.00049271004,0.0001003835,0.00023613071],"domain_scores_gemma":[0.9983429,0.0009678878,0.0003687925,0.00022249206,0.00008317302,0.000014795466],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036641972,0.00017587314,0.00067513465,0.00049417716,0.00015090071,0.000020306841,0.00014317999,0.00009744432,0.00005509392],"category_scores_gemma":[0.00024718553,0.0001769599,0.000077978286,0.0010426138,0.0003765313,0.00010698186,0.00031255893,0.00017171277,0.0000013283537],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032908615,0.00016425853,0.39370131,0.00033984854,0.0005372907,0.0000034021482,0.00073753926,0.23683624,0.0009127477,0.35856113,0.0000015613261,0.007875574],"study_design_scores_gemma":[0.0002298176,0.0000049733394,0.19108269,0.0000075330736,0.00037396274,8.4633723e-7,0.00012473481,0.38346145,0.000016758053,0.42455024,0.000018158495,0.0001288512],"about_ca_topic_score_codex":0.00068362046,"about_ca_topic_score_gemma":0.00023262725,"teacher_disagreement_score":0.20261863,"about_ca_system_score_codex":0.000022095972,"about_ca_system_score_gemma":0.0000113445685,"threshold_uncertainty_score":0.7216215},"labels":[],"label_agreement":null},{"id":"W1991473881","doi":"10.1287/opre.50.6.1032.349","title":"Brownian Approximations of Multiclass Open-Queueing Networks","year":2002,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada; Chinese University of Hong Kong; National Science Foundation","keywords":"Queueing theory; Computer science; Queue; Limit (mathematics); Moment (physics); Brownian motion; Heavy traffic approximation; Mathematical optimization; Layered queueing network; FIFO (computing and electronics); Applied mathematics; Mathematics; Computer network; Discrete mathematics; Mathematical analysis","score_opus":0.12657399318451437,"score_gpt":0.3612122193316534,"score_spread":0.234638226147139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1991473881","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27808332,0.00054461113,0.19322415,0.011249967,0.00034583587,0.0031837143,0.000014174553,0.00033247392,0.51302177],"genre_scores_gemma":[0.989752,0.000018797395,0.0039917575,0.0001628671,0.00029548272,0.00010142507,0.000024861998,0.000023262455,0.005629536],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870396,0.00008388891,0.0002964024,0.00025910584,0.00033894897,0.00031770268],"domain_scores_gemma":[0.9986788,0.00014168014,0.000041918687,0.00046864018,0.0006514998,0.000017476696],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012724076,0.00009465106,0.00016556159,0.00046402743,0.00086017285,0.00067143573,0.0006574701,0.00005354995,0.002033977],"category_scores_gemma":[0.00069743017,0.00009017085,0.00005004745,0.0018367044,0.00016542422,0.0018923655,0.000495773,0.00027731634,0.00046165008],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013742332,0.0003292586,0.00063415995,0.000047414902,0.000053560034,0.0000051165302,0.0002022297,0.56697106,0.002367716,0.41524863,0.00443128,0.0096958615],"study_design_scores_gemma":[0.00025453416,0.0000063556336,0.00011322294,0.00003259472,0.000014558585,6.531094e-7,0.0003317417,0.9879164,0.00011758425,0.0016487116,0.009456824,0.000106814725],"about_ca_topic_score_codex":0.0007761004,"about_ca_topic_score_gemma":0.00076513865,"teacher_disagreement_score":0.71166867,"about_ca_system_score_codex":0.000042100655,"about_ca_system_score_gemma":0.000013143273,"threshold_uncertainty_score":0.9988783},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.047682317763104984,"score_gpt":0.26960128812581285,"score_spread":0.22191897036270786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992210270","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020126386,0.0002679787,0.9842216,0.000546096,0.000047427708,0.00097550603,0.000958296,0.00014967071,0.010820814],"genre_scores_gemma":[0.9175008,0.00006796836,0.06936991,0.0014504232,0.000101230195,0.0016464049,0.005038447,0.000101389924,0.0047234558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998529,0.000042088202,0.0004943823,0.00033933145,0.00024428332,0.00035086923],"domain_scores_gemma":[0.9974391,0.0003825381,0.00021948256,0.0015245733,0.00040986447,0.000024444504],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00033732963,0.00026160368,0.0003293878,0.00022638244,0.00048320176,0.00015888529,0.0010091991,0.00005951221,0.0001523861],"category_scores_gemma":[0.00003892728,0.00026552426,0.000035074077,0.0007692601,0.00013260527,0.00057716965,0.0003779198,0.00016274648,0.0001326981],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010708361,0.00007537026,0.00000979649,0.0003499325,0.000068479785,0.0000013892968,0.00017741063,0.60107696,8.499734e-7,0.39707172,0.00048978167,0.00057125813],"study_design_scores_gemma":[0.00065331993,0.000007165999,0.000014905585,0.00016317017,0.00018165894,0.0000015900728,0.00074913795,0.84319425,1.4100691e-7,0.146721,0.008043199,0.0002704526],"about_ca_topic_score_codex":0.0008584073,"about_ca_topic_score_gemma":0.0021402736,"teacher_disagreement_score":0.9154881,"about_ca_system_score_codex":0.00019036098,"about_ca_system_score_gemma":0.000025000887,"threshold_uncertainty_score":0.9999797},"labels":[],"label_agreement":null},{"id":"W1992220428","doi":"10.1007/s11009-014-9429-0","title":"Analysis of B M A P/M S P/1 Queue","year":2014,"lang":"en","type":"article","venue":"Methodology And Computing In Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Fundação para a Ciência e a Tecnologia; Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Queueing system; Generating function; Burke's theorem; Combinatorics; Queue; Applied mathematics; Function (biology); Queueing theory; Discrete mathematics; Statistics; Queue management system","score_opus":0.053735276627065245,"score_gpt":0.29552960756967916,"score_spread":0.24179433094261393,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992220428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71998966,0.00001531308,0.27428058,0.0000728244,0.00003752797,0.00011134506,2.7337362e-7,0.00005194046,0.005440532],"genre_scores_gemma":[0.9375032,5.655762e-7,0.062005375,0.0003964723,0.000070048416,0.0000068670915,0.000006052207,0.0000068346417,0.000004581429],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985569,0.00028058852,0.00043700333,0.000429899,0.000085593354,0.00021000467],"domain_scores_gemma":[0.99774647,0.0015653843,0.00029025698,0.00033666173,0.000052742027,0.000008470272],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0075187758,0.00013648943,0.0006471648,0.000491342,0.00008041593,0.0000172934,0.00018142378,0.00009886866,0.000037388643],"category_scores_gemma":[0.0010971401,0.00012901922,0.00009808745,0.0015669994,0.00022385927,0.00006550147,0.00021538482,0.00017148007,0.0000037840048],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013398011,0.0000890555,0.19885466,0.00016250186,0.0002360875,4.2148787e-7,0.00015667402,0.06540059,0.00062975247,0.6693421,0.0000023691305,0.06499181],"study_design_scores_gemma":[0.00033848907,0.000007526229,0.13636594,0.000010298738,0.0006301224,3.280781e-7,0.000076073826,0.27940932,0.00013501602,0.5823325,0.000495882,0.0001985205],"about_ca_topic_score_codex":0.0001609282,"about_ca_topic_score_gemma":0.00019188589,"teacher_disagreement_score":0.21751353,"about_ca_system_score_codex":0.000014927156,"about_ca_system_score_gemma":0.000005290849,"threshold_uncertainty_score":0.52612513},"labels":[],"label_agreement":null},{"id":"W1992238700","doi":"10.1016/j.comcom.2008.05.002","title":"Performance implications of fluctuating server capacity","year":2008,"lang":"en","type":"article","venue":"Computer Communications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Blocking (statistics); Context (archaeology); Set (abstract data type); Capacity planning; Service (business); Distributed computing; Computer network; Operating system","score_opus":0.06359400232272992,"score_gpt":0.25381670557372843,"score_spread":0.1902227032509985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992238700","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95281976,0.000073221425,0.034083273,0.0013105449,0.000064892774,0.00014124915,0.0000026677553,0.00018213563,0.01132222],"genre_scores_gemma":[0.96557677,0.000038117898,0.033596862,0.0005142529,0.00015170827,0.00002029516,0.000038175356,0.00001328641,0.000050544037],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993165,0.000022022976,0.00029539235,0.0001398357,0.0000941998,0.00013204687],"domain_scores_gemma":[0.9976639,0.00011874259,0.00025481838,0.001669204,0.0002845301,0.00000878378],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018827419,0.000098792094,0.00015860838,0.00015492893,0.00060306385,0.000022824615,0.0010371567,0.000029879178,0.00004177712],"category_scores_gemma":[0.000043870554,0.00010347789,0.000080524536,0.0006311114,0.00023944344,0.000716444,0.00066604995,0.00013196246,0.00010584305],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015694259,0.00068206404,0.3566883,0.00025183253,0.0002301019,8.7525734e-7,0.0011690407,0.02896448,0.0021486653,0.5627265,0.0032324481,0.043889996],"study_design_scores_gemma":[0.00041246135,0.000012332294,0.39251593,0.00009249664,0.00011638613,0.000015255339,0.00005240828,0.5679456,0.0001742012,0.01665898,0.02156931,0.00043463707],"about_ca_topic_score_codex":0.00006605499,"about_ca_topic_score_gemma":0.000028758246,"teacher_disagreement_score":0.54606754,"about_ca_system_score_codex":0.000021608581,"about_ca_system_score_gemma":0.000013389451,"threshold_uncertainty_score":0.46383405},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02382778392177146,"score_gpt":0.2538317663166927,"score_spread":0.23000398239492123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992428101","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99759686,0.000015534551,0.0001060937,0.00018153741,0.00041310283,0.00025163806,0.000009002064,0.00010437765,0.0013218562],"genre_scores_gemma":[0.9966732,0.0000012895758,0.0012352857,0.00029444508,0.0009730907,0.00015395811,0.000028778395,0.000029619414,0.0006102925],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992353,0.000003283948,0.00020838092,0.00030305315,0.000024419629,0.00022561081],"domain_scores_gemma":[0.9995529,0.00003403998,0.00012309467,0.0002426339,0.000029038163,0.000018311543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029902207,0.00013421896,0.00019396511,0.00009477479,0.00010081846,0.00025183658,0.00013315435,0.00006227897,0.00026857495],"category_scores_gemma":[0.0000355404,0.00013314214,0.00007296331,0.000029622786,0.000089321955,0.0012956617,0.00007996357,0.000094508585,0.00004324126],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026986856,0.0003625076,0.2018194,0.00044290203,0.0001060514,0.000005526997,0.0006620909,0.0013276407,0.040806606,0.5533827,0.0023401077,0.1984746],"study_design_scores_gemma":[0.0049820314,0.00027866117,0.07638751,0.00010694411,0.0020312348,0.00004910411,0.0065184752,0.14156386,0.0031664707,0.2705508,0.49033573,0.0040291855],"about_ca_topic_score_codex":0.00019487999,"about_ca_topic_score_gemma":0.0006665694,"teacher_disagreement_score":0.48799562,"about_ca_system_score_codex":0.00001334059,"about_ca_system_score_gemma":0.000011126579,"threshold_uncertainty_score":0.5429379},"labels":[],"label_agreement":null},{"id":"W1992518474","doi":"10.1016/j.apm.2014.03.005","title":"Reliability-based measures for a retrial system with mixed standby components","year":2014,"lang":"en","type":"article","venue":"Applied Mathematical Modelling","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":51,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Mean time between failures; Exponential distribution; Idle; Reliability engineering; Reliability (semiconductor); Component (thermodynamics); Exponential function; Computer science; Real-time computing; Orbit (dynamics); Engineering; Failure rate; Mathematics; Statistics; Operating system; Physics; Aerospace engineering","score_opus":0.03350206175563018,"score_gpt":0.22183129841480415,"score_spread":0.18832923665917395,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992518474","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04427735,0.000005222568,0.95068884,0.00006806872,0.000050112718,0.00073936395,0.0000022353188,0.00034914238,0.0038196386],"genre_scores_gemma":[0.9013809,1.7931644e-7,0.09780317,0.00014954353,0.0003947095,0.00017588644,0.00002288147,0.00006095483,0.000011756371],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982387,0.000020748512,0.0004772107,0.00045409705,0.00044366432,0.00036557353],"domain_scores_gemma":[0.99837106,0.0006377294,0.00027542986,0.00049011846,0.00019670355,0.000028968449],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016149259,0.00026452346,0.0005486379,0.0001470414,0.0002624306,0.00015268047,0.00025733694,0.000092317205,0.000012996554],"category_scores_gemma":[0.0001562796,0.00020307448,0.00013264529,0.00029412215,0.00008512128,0.00020171172,0.000046999547,0.00013460768,0.00008408505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005183964,0.000066814406,0.000002355503,0.000877886,0.000029262717,3.9976175e-7,0.000012055005,0.41475356,0.0004328867,0.5828859,0.000015260133,0.0004052046],"study_design_scores_gemma":[0.0011616758,0.000011533126,2.7503583e-7,0.00016812063,0.00019018032,2.733593e-7,0.00007399559,0.7771936,0.0003044625,0.2198805,0.0007915253,0.00022386736],"about_ca_topic_score_codex":0.0000083374725,"about_ca_topic_score_gemma":0.0000020195628,"teacher_disagreement_score":0.8571036,"about_ca_system_score_codex":0.000063759275,"about_ca_system_score_gemma":0.000010839787,"threshold_uncertainty_score":0.8281137},"labels":[],"label_agreement":null},{"id":"W1992579433","doi":"10.1016/s0166-5316(02)00225-0","title":"An alternative approach for analyzing finite buffer queues in discrete time","year":2003,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Markov chain; Representation (politics); Queue; Discrete time and continuous time; Computer science; State space; Matrix (chemical analysis); Product (mathematics); Applied mathematics; State (computer science); Novelty; Markov process; Discrete space; Mathematics; Algorithm; Statistical physics; Mathematical optimization; Statistics; Mathematical analysis; Physics; Computer network","score_opus":0.030947854036667333,"score_gpt":0.3001367638533035,"score_spread":0.2691889098166362,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1992579433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9181819,0.000049218612,0.07622842,0.000042478154,0.00007806236,0.0005698833,0.0000020021691,0.00005327769,0.004794733],"genre_scores_gemma":[0.99533737,0.000007772771,0.003593484,0.0001476996,0.00029924684,0.00019578307,0.00025763657,0.00002374826,0.00013728086],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988336,0.000059885555,0.00026629318,0.0003175823,0.0002863362,0.00023629898],"domain_scores_gemma":[0.9992416,0.000059450573,0.00020880639,0.00023163078,0.0002493954,0.000009107497],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027549453,0.00015113039,0.00018392527,0.00035121266,0.00016591234,0.000112818045,0.000152031,0.000042553533,0.00017525342],"category_scores_gemma":[0.0004633679,0.00014197346,0.00005661183,0.0005420245,0.000029477074,0.002574608,0.000018598215,0.00008711459,0.000065016284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009651914,0.000081170896,0.015547826,0.00006778198,0.000032793185,1.8874027e-7,0.00020222724,0.96497947,0.00076224847,0.0046421015,0.000027294027,0.013560393],"study_design_scores_gemma":[0.000594731,0.0000161854,0.0022132227,0.00002466004,0.00010100571,1.5323504e-7,0.00009392054,0.98867077,0.00051659805,0.0071325395,0.00043835607,0.00019786337],"about_ca_topic_score_codex":0.000026359014,"about_ca_topic_score_gemma":0.000013377499,"teacher_disagreement_score":0.077155426,"about_ca_system_score_codex":0.00009225829,"about_ca_system_score_gemma":0.000018944533,"threshold_uncertainty_score":0.57895094},"labels":[],"label_agreement":null},{"id":"W1993490452","doi":"10.1007/s11134-015-9437-y","title":"Perfect and nearly perfect sampling of work-conserving queues","year":2015,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Queue; Idle; Poisson distribution; Mathematics; Limit (mathematics); Sampling (signal processing); Class (philosophy); Duration (music); Computer science; Service (business); Distribution (mathematics); Discrete mathematics; Mathematical optimization; Applied mathematics; Statistics; Mathematical analysis; Physics; Computer network; Telecommunications","score_opus":0.04313021580250813,"score_gpt":0.2520830480932877,"score_spread":0.20895283229077954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1993490452","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9867595,0.0020652954,0.003824856,0.00010871704,0.0005063582,0.00023819479,0.0000010856949,0.00025665236,0.0062393383],"genre_scores_gemma":[0.9982319,0.0000063192997,0.00042744618,0.00010616036,0.00078078255,0.000016617045,0.0000059085105,0.000049798316,0.00037510163],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848884,0.000075453776,0.00045685173,0.00036963707,0.0002910336,0.00031820507],"domain_scores_gemma":[0.99872214,0.00018573536,0.00041376927,0.0003810009,0.00026321685,0.000034164925],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016652768,0.00023785917,0.0004893322,0.0003252127,0.00017448342,0.00035794123,0.00024091262,0.00008937967,0.000014561804],"category_scores_gemma":[0.00063247135,0.00022175405,0.00009807206,0.0006377481,0.00009235177,0.001022896,0.00018733404,0.00015989592,0.00006016321],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006606487,0.00022121183,0.64345574,0.004980024,0.0008821271,0.00009519073,0.004425636,0.10379237,0.010047744,0.21450175,0.002496359,0.0144411735],"study_design_scores_gemma":[0.009747614,0.00045740986,0.027643142,0.017426252,0.0033369162,0.0002058263,0.045645464,0.6722018,0.0019015439,0.03825905,0.17508604,0.008088906],"about_ca_topic_score_codex":0.0029950363,"about_ca_topic_score_gemma":0.000058259408,"teacher_disagreement_score":0.6158126,"about_ca_system_score_codex":0.000054136897,"about_ca_system_score_gemma":0.000027367229,"threshold_uncertainty_score":0.90428674},"labels":[],"label_agreement":null},{"id":"W1994418842","doi":"10.1111/j.1937-5956.2012.01362.x","title":"A Markov Chain Model for an EMS System with Repositioning","year":2012,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Table (database); Markov chain; Computer science; Markov model; Compliance (psychology); Point (geometry); Markov process; Operations research; Mathematical optimization; Mathematics; Data mining; Statistics; Machine learning","score_opus":0.018114779118448714,"score_gpt":0.2381812913626622,"score_spread":0.22006651224421347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994418842","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07665427,0.000075162236,0.9127781,0.0011991113,0.00029402602,0.0011249231,0.0000016212172,0.00032035966,0.007552429],"genre_scores_gemma":[0.9734841,0.0000049769446,0.021883117,0.00029987376,0.00075933186,0.00036799946,0.000051334584,0.000021334099,0.0031279454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992531,0.000011366096,0.00016573696,0.00027834062,0.00010885923,0.00018259764],"domain_scores_gemma":[0.9995538,0.000003698619,0.00006640464,0.00024274059,0.00011699225,0.000016336691],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00056436326,0.00011512864,0.0001034148,0.0001994871,0.0006605799,0.00023844533,0.00005821049,0.000018240835,0.0000072091107],"category_scores_gemma":[0.000022593604,0.00009963945,0.000023570443,0.00025111015,0.000027154256,0.0020514373,0.000044017506,0.000038486727,0.000009751695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007630525,0.00013277175,0.00044769607,0.0003523349,0.00008968347,5.044165e-7,0.00028563951,0.37659672,0.00016905996,0.61690634,0.00042094794,0.004521982],"study_design_scores_gemma":[0.00022820124,0.000012142602,0.00015749833,0.000059982216,0.00022408966,0.0000062846916,0.0024697655,0.99386555,0.000040106217,0.000418373,0.0023142542,0.00020376395],"about_ca_topic_score_codex":0.000020212501,"about_ca_topic_score_gemma":0.000069875954,"teacher_disagreement_score":0.89682984,"about_ca_system_score_codex":0.000039598715,"about_ca_system_score_gemma":0.0000027758172,"threshold_uncertainty_score":0.5080713},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011606195796634872,"score_gpt":0.22624838195258135,"score_spread":0.21464218615594646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994476060","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8550266,0.00021012843,0.13448083,0.008130275,0.0001062353,0.0007761702,0.0000016796041,0.00014163871,0.0011264572],"genre_scores_gemma":[0.9973634,0.000017296647,0.0011156391,0.00015052695,0.00014639029,0.000019522351,0.000023020204,0.0000049138066,0.0011593315],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99943334,0.000011516931,0.00014546192,0.00021600102,0.00011080978,0.00008286798],"domain_scores_gemma":[0.99963784,0.0000041846656,0.00006386883,0.000092646114,0.00019405266,0.000007391803],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017489519,0.00009350038,0.00010613649,0.00017384175,0.00030840692,0.00010029512,0.000035423778,0.00001875057,0.000018779667],"category_scores_gemma":[0.000057505924,0.00008437623,0.0000111283925,0.0003339431,0.00007656647,0.0007954135,0.000027690441,0.0000392881,0.0000038251806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002217232,0.0001530116,0.00041809265,0.00044759485,0.00012907138,0.0000011893435,0.0006493488,0.66278595,0.0003468783,0.317895,0.00045031108,0.016501814],"study_design_scores_gemma":[0.009672693,0.0009090359,0.20732449,0.0014397401,0.005469225,0.000055458437,0.061074577,0.63735497,0.0015903238,0.046838548,0.024009248,0.004261674],"about_ca_topic_score_codex":0.000022969865,"about_ca_topic_score_gemma":0.00008606652,"teacher_disagreement_score":0.27105644,"about_ca_system_score_codex":0.000014378069,"about_ca_system_score_gemma":0.000004480612,"threshold_uncertainty_score":0.34407628},"labels":[],"label_agreement":null},{"id":"W1994720654","doi":"10.1287/opre.1120.1070","title":"Overflow Networks: Approximations and Implications to Call Center Outsourcing","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Computer science; Call management; Context (archaeology); Call Admission Control; Call control; Pooling; Heuristics; Computer network; Buffer overflow; Service (business); Operations research; Telecommunications; Mathematics; Artificial intelligence; Operating system; Wireless network","score_opus":0.05606187948473124,"score_gpt":0.35077038680602535,"score_spread":0.2947085073212941,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1994720654","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37862083,0.00033779256,0.551306,0.020762363,0.00026018257,0.0016065082,0.000026227168,0.00028688056,0.046793196],"genre_scores_gemma":[0.9930983,0.000009769965,0.0033858346,0.00078354625,0.0009431455,0.00020017776,0.00007391089,0.00002280557,0.0014824837],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988835,0.00004760695,0.00018210117,0.00021948355,0.00021004783,0.00045726166],"domain_scores_gemma":[0.9991151,0.00009989611,0.000016515389,0.0003632773,0.00035281148,0.000052401232],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011177579,0.00009481142,0.00010494373,0.0004405072,0.0010864489,0.0004738979,0.00018413797,0.00004126057,0.00019974366],"category_scores_gemma":[0.000490947,0.00008988708,0.000032120446,0.0011474692,0.000068452086,0.001431546,0.0002982034,0.00020886322,0.00045515576],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022798413,0.00038722108,0.054213434,0.00004980028,0.00007174641,8.231173e-7,0.00077425677,0.37479678,0.0019336505,0.5427362,0.014323685,0.0106896395],"study_design_scores_gemma":[0.00054458925,0.000015540036,0.034871962,0.00007364637,0.00006981291,0.000007177561,0.0012646955,0.74359846,0.00006816982,0.0035135085,0.2153891,0.00058335764],"about_ca_topic_score_codex":0.000187588,"about_ca_topic_score_gemma":0.000307922,"teacher_disagreement_score":0.6144775,"about_ca_system_score_codex":0.00005668087,"about_ca_system_score_gemma":0.000012317826,"threshold_uncertainty_score":0.8356196},"labels":[],"label_agreement":null},{"id":"W1996168241","doi":"10.1504/ejie.2007.014109","title":"An approximation method to analyse polling models of pull-type production systems","year":2007,"lang":"en","type":"article","venue":"European J of Industrial Engineering","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"National Science Council","keywords":"Polling system; Polling; Queue; Markov chain; Computer science; Mathematical optimization; Queueing theory; State space; Production (economics); Type (biology); Mathematics; Computer network; Economics; Statistics","score_opus":0.04661673635014041,"score_gpt":0.26138266698824925,"score_spread":0.21476593063810884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1996168241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34677318,0.000022078455,0.6515594,0.000015593912,0.00042228587,0.00018639815,7.530175e-7,0.000105883584,0.0009144435],"genre_scores_gemma":[0.9848365,5.231203e-7,0.013266369,0.0000103846005,0.0018038499,0.0000011002626,0.000014230006,0.00004460248,0.000022438373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874985,0.000044414825,0.00055685494,0.00023974666,0.0002176676,0.0001914775],"domain_scores_gemma":[0.99906385,0.000039578917,0.0003333278,0.0002970262,0.00024281874,0.000023399523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003511177,0.00014451754,0.0002726117,0.0006873859,0.00004069183,0.00004310973,0.00021010617,0.000045457935,0.0000057406273],"category_scores_gemma":[0.0005432633,0.00015027862,0.000060798284,0.0013556723,0.000010040721,0.00085847446,0.00005235633,0.00014457027,0.000008002991],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007491273,0.00002315603,0.000065334265,0.00005429373,0.000041151467,0.0000021938142,0.000064999454,0.9022524,0.08473958,0.005936685,0.000012271438,0.0067330254],"study_design_scores_gemma":[0.000396947,0.00004478468,0.00009092088,0.00030749477,0.00020658105,0.0000022431477,0.000724897,0.9676954,0.029287402,0.00017832765,0.0007230988,0.0003419113],"about_ca_topic_score_codex":0.00010822529,"about_ca_topic_score_gemma":0.0000017967719,"teacher_disagreement_score":0.638293,"about_ca_system_score_codex":0.000034134577,"about_ca_system_score_gemma":0.0000072299786,"threshold_uncertainty_score":0.6128184},"labels":[],"label_agreement":null},{"id":"W1997773527","doi":"10.1007/s11134-006-9001-x","title":"Equilibria of a class of transport equations arising in congestion control","year":2006,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Natural Sciences and Engineering Research Council of Canada","funders":"","keywords":"Mathematics; Class (philosophy); Applied mathematics; Flow (mathematics); Stochastic differential equation; Differential equation; Mathematical analysis; Computer science","score_opus":0.010797896014051036,"score_gpt":0.22096001357853837,"score_spread":0.21016211756448733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W1997773527","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92281115,0.00022315953,0.06971041,0.000098078,0.0002117371,0.00030423346,0.000005429466,0.00007368041,0.006562098],"genre_scores_gemma":[0.9994957,5.6739754e-7,0.00006160974,0.000019838297,0.0002449511,0.000014866031,0.000023256087,0.000018702176,0.00012054985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987124,0.00003892608,0.00070161425,0.00017601869,0.00020248645,0.00016851322],"domain_scores_gemma":[0.9988939,0.00016876186,0.0005793922,0.00020189866,0.00015127215,0.000004754325],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007775599,0.000116335315,0.00039299016,0.00039298652,0.000039052506,0.000026120828,0.00012307045,0.000068154615,0.000012387603],"category_scores_gemma":[0.00012368416,0.0001196348,0.00008968599,0.0005882075,0.000056815465,0.00057706155,0.000011545343,0.00007678709,0.0000073347446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000074111296,0.00009668136,0.0720748,0.00058915693,0.000046821795,0.000007951303,0.00005954298,0.4250384,0.036976207,0.46475974,0.000018692504,0.00025788095],"study_design_scores_gemma":[0.0026788798,0.000022498796,0.025214855,0.0016512601,0.00039173165,0.000002162401,0.00073137594,0.94390327,0.00061412103,0.022645485,0.0016467461,0.0004976284],"about_ca_topic_score_codex":0.0065988973,"about_ca_topic_score_gemma":0.00056676165,"teacher_disagreement_score":0.51886487,"about_ca_system_score_codex":0.00003831847,"about_ca_system_score_gemma":0.000017085296,"threshold_uncertainty_score":0.99756026},"labels":[],"label_agreement":null},{"id":"W2000436315","doi":"10.1007/s11134-010-9187-9","title":"Pathwise comparison results for stochastic fluid networks","year":2010,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Monotonic function; Class (philosophy); Mathematics; Moment (physics); Stability (learning theory); Applied mathematics; Fluid queue; Mathematical optimization; Computer science; Queueing theory; Statistics; Mathematical analysis","score_opus":0.01659387192183311,"score_gpt":0.2519396716626834,"score_spread":0.23534579974085026,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000436315","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33835846,0.00033707314,0.6482197,0.00028354896,0.005672627,0.001484419,0.000020344036,0.0009420826,0.0046816943],"genre_scores_gemma":[0.99446815,4.4454464e-7,0.0002944801,0.00015347669,0.0042494503,0.0001062819,0.00010204608,0.00005519528,0.0005704899],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983222,0.000020712238,0.0005998724,0.00043151993,0.00020267768,0.0004230411],"domain_scores_gemma":[0.9984481,0.00028124827,0.0004916176,0.0005321632,0.0002230003,0.000023905503],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011679893,0.00023700613,0.0004122906,0.0002064397,0.00033799311,0.00038251563,0.00034594498,0.00013992478,0.000010407389],"category_scores_gemma":[0.00067540735,0.00022315363,0.00014291577,0.00037873592,0.00005636146,0.00060044444,0.00008662683,0.00026528444,0.000116480645],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036345306,0.00010465354,0.0017425953,0.00023469717,0.00013924505,0.0000060083285,0.00009903536,0.83087045,0.003171488,0.15028667,0.010183249,0.0027984567],"study_design_scores_gemma":[0.00078088674,0.000011862891,0.00015159161,0.000118144715,0.00012870756,0.0000028978357,0.00017134452,0.9777456,0.000018071485,0.0015868847,0.01893468,0.00034935164],"about_ca_topic_score_codex":0.0004183138,"about_ca_topic_score_gemma":0.00015517144,"teacher_disagreement_score":0.65610963,"about_ca_system_score_codex":0.000026153793,"about_ca_system_score_gemma":0.000011498537,"threshold_uncertainty_score":0.9099941},"labels":[],"label_agreement":null},{"id":"W2000898864","doi":"10.1007/s11134-014-9431-9","title":"Perfect sampling of a single-server queue with periodic Poisson arrivals","year":2014,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Poisson distribution; Combinatorics; Mathematics; Discrete mathematics; Sampling (signal processing); Integer (computer science); Computer science; Statistics; Telecommunications; Computer network","score_opus":0.019959537512878787,"score_gpt":0.22434933218879327,"score_spread":0.20438979467591448,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2000898864","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96066153,0.00022123533,0.028928075,0.000110848676,0.0003347249,0.00029357238,0.0000014074478,0.00029600365,0.009152601],"genre_scores_gemma":[0.9979075,0.0000012032832,0.00040430744,0.0001605815,0.0009669143,0.00002442078,0.000012275683,0.00007271747,0.00045007802],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981786,0.000085291766,0.00051546027,0.0004388351,0.00039762235,0.00038421238],"domain_scores_gemma":[0.9982982,0.00018527315,0.0006547579,0.0005902291,0.00024850338,0.00002302025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012466811,0.0002923334,0.00060552487,0.00034947923,0.0002285441,0.0002972756,0.00033310382,0.00009211902,0.00005541807],"category_scores_gemma":[0.00037940196,0.00024175951,0.00014609139,0.0006391588,0.00009734361,0.00084223,0.000091306836,0.00014879073,0.00010111193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006494831,0.0004986894,0.116970316,0.007183878,0.0009230327,0.000046249283,0.0014475393,0.25680503,0.12632866,0.48138887,0.00043901932,0.007319211],"study_design_scores_gemma":[0.011290495,0.0012591614,0.015759826,0.022713704,0.004201175,0.00020730896,0.013559568,0.52150893,0.013274624,0.028489633,0.35831067,0.009424884],"about_ca_topic_score_codex":0.001574518,"about_ca_topic_score_gemma":0.00014274799,"teacher_disagreement_score":0.45289925,"about_ca_system_score_codex":0.00006598082,"about_ca_system_score_gemma":0.000016926017,"threshold_uncertainty_score":0.98586667},"labels":[],"label_agreement":null},{"id":"W2002312196","doi":"10.1007/s11134-013-9348-8","title":"Tail asymptotics of the waiting time and the busy period for the $${{\\varvec{M/G/1/K}}}$$ queues with subexponential service times","year":2013,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China; University of Northern Iowa","keywords":"Queue; Mathematics; Combinatorics; Period (music); Service (business); Laplace transform; Discrete mathematics; Distribution (mathematics); Applied mathematics; Computer science; Mathematical analysis; Physics; Computer network; Economics","score_opus":0.0058658451832179015,"score_gpt":0.17958473665888694,"score_spread":0.17371889147566905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2002312196","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9826469,0.0009432885,0.0026639118,0.008150577,0.00047443534,0.0024624222,0.0000077971445,0.00018222912,0.0024684798],"genre_scores_gemma":[0.9968516,0.000004317197,0.000075843,0.00054003316,0.00079912075,0.00016453328,0.0000062682197,0.000052214637,0.0015060278],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985205,0.00011063486,0.00043997407,0.00027988898,0.00032935644,0.0003196442],"domain_scores_gemma":[0.9975684,0.0007259976,0.00065891613,0.0005769226,0.00045827238,0.0000114790455],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012024522,0.00024990275,0.0003982215,0.0000701349,0.0008247832,0.00062143203,0.00060249446,0.00006644645,0.00004500802],"category_scores_gemma":[0.00026208122,0.000111858455,0.00012617266,0.00048431012,0.00030831865,0.00066811364,0.00023098392,0.000157452,0.000048582126],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010102955,0.00017921436,0.009766467,0.0037331146,0.0028352484,0.0000055721284,0.0059283455,0.19384442,0.009065246,0.76335883,0.004534468,0.0057387734],"study_design_scores_gemma":[0.0013358236,0.00001386899,0.000456914,0.0005119676,0.0006504304,0.00001327913,0.0060397643,0.9827073,0.00015083665,0.0027837392,0.0050046383,0.00033143826],"about_ca_topic_score_codex":0.0039837654,"about_ca_topic_score_gemma":0.00022067792,"teacher_disagreement_score":0.7888629,"about_ca_system_score_codex":0.000022203318,"about_ca_system_score_gemma":0.000023435612,"threshold_uncertainty_score":0.63436484},"labels":[],"label_agreement":null},{"id":"W2003584295","doi":"10.1002/nav.10047","title":"Analysis of a finite‐buffer bulk‐service queue with discrete‐Markovian arrival process: D‐MAP/<i>G</i><sup><i>a,b</i></sup>/1/<i>N</i>","year":2003,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markovian arrival process; Queue; Markov chain; Computer science; Markov process; Process (computing); Real-time computing; Random variable; Service (business); Queueing theory; Discrete time and continuous time; Algorithm; Applied mathematics; Mathematical optimization; Computer network; Mathematics; Statistics","score_opus":0.04644666103468515,"score_gpt":0.3287920339748899,"score_spread":0.28234537294020473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003584295","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5565393,0.001138083,0.207899,0.0053668963,0.000465681,0.0038989757,0.00044413013,0.0011530932,0.22309482],"genre_scores_gemma":[0.9959947,0.000032861593,0.0012581962,0.0009757214,0.00040499374,0.00010824581,0.0002444406,0.00011582437,0.0008650438],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9935884,0.0003658499,0.00091545563,0.0011796313,0.0024767646,0.0014739118],"domain_scores_gemma":[0.9927802,0.0017757048,0.00053495256,0.0014526446,0.0033096839,0.00014681142],"candidate_categories":["metaresearch","metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004622542,0.0005934056,0.0011394145,0.0022661237,0.00063699996,0.0004576075,0.0013327107,0.00026389715,0.0008306185],"category_scores_gemma":[0.008572642,0.0004932337,0.00036242398,0.011286398,0.00089146884,0.00097176555,0.00039222624,0.0011527543,0.00028434885],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020296108,0.0010212016,0.032435495,0.0018664466,0.0039172913,0.00032309082,0.00082095125,0.790019,0.00050580176,0.16443324,0.0014532525,0.001174643],"study_design_scores_gemma":[0.0043215184,0.00051209354,0.0014659927,0.00075606955,0.008303167,0.000010415251,0.007807294,0.7569242,0.0016219544,0.12829736,0.08699495,0.002984969],"about_ca_topic_score_codex":0.0011462021,"about_ca_topic_score_gemma":0.0011065224,"teacher_disagreement_score":0.43945536,"about_ca_system_score_codex":0.00016510165,"about_ca_system_score_gemma":0.0003063386,"threshold_uncertainty_score":0.99977857},"labels":[],"label_agreement":null},{"id":"W2003635579","doi":"10.1016/j.tcs.2008.04.021","title":"Analysis of set-up time models: A metric perspective","year":2008,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Academy of Finland","keywords":"Set (abstract data type); Perspective (graphical); Metric (unit); Mathematics; Algorithm; Computer science; Programming language; Operations management; Economics; Geometry","score_opus":0.019206459615165435,"score_gpt":0.2516292936870263,"score_spread":0.23242283407186087,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2003635579","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.32060304,0.00003240091,0.6579251,0.00017963699,0.00009616235,0.00008964437,0.0000021830447,0.00012856493,0.020943243],"genre_scores_gemma":[0.99571675,0.0000025513043,0.0036923387,0.00038909324,0.00013970087,0.0000022785853,0.0000026528755,0.0000096017,0.000045032106],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981561,0.000030233252,0.00027634914,0.00053574063,0.0006503301,0.00035129965],"domain_scores_gemma":[0.9984295,0.00020693048,0.00017176986,0.00051877514,0.0006400574,0.00003301195],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001134037,0.00016106653,0.00042272228,0.0019628457,0.0003586688,0.00008371063,0.00091085304,0.000034450033,0.0003798113],"category_scores_gemma":[0.00028660524,0.00013428112,0.00022674496,0.012590626,0.002994062,0.0012465477,0.00053029787,0.00011437685,0.00013515432],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002338287,0.00003352213,0.00013592423,0.0000041060953,0.00012211215,0.000006448371,0.00037037884,0.058148555,0.00009594121,0.94050974,0.000015831085,0.0005340836],"study_design_scores_gemma":[0.00009072639,0.000010955994,0.00026377902,0.0000048784373,0.00035674399,0.0000017754628,0.0000658847,0.75257623,0.00008757078,0.24639529,0.000013793532,0.0001323562],"about_ca_topic_score_codex":0.000042431227,"about_ca_topic_score_gemma":0.0000011306224,"teacher_disagreement_score":0.69442767,"about_ca_system_score_codex":0.00007017127,"about_ca_system_score_gemma":0.00003293186,"threshold_uncertainty_score":0.9997192},"labels":[],"label_agreement":null},{"id":"W2004242824","doi":"10.1145/1190095.1190156","title":"Reduced load approximations for large-scale optical WDM networks offering multiclass services","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Traverse; Wavelength-division multiplexing; Computer network; Node (physics); Hierarchy; Blocking (statistics); Distributed computing; Telecommunications network; Service (business); Intelligent Network; Call blocking; Class (philosophy); Quality of service; Engineering; Wavelength; Artificial intelligence","score_opus":0.008314506445259873,"score_gpt":0.2263544214280361,"score_spread":0.21803991498277622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004242824","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18609789,0.00004243953,0.7818535,0.00068772887,0.00019474364,0.00041917295,0.0000033709885,0.00048341998,0.030217713],"genre_scores_gemma":[0.97344756,6.97538e-7,0.02255905,0.0006286163,0.0012478832,0.00007645971,0.00008949599,0.000036593752,0.0019136457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882525,0.0000062905865,0.00030172142,0.0003195376,0.00016673148,0.00038045988],"domain_scores_gemma":[0.9992764,0.00009807447,0.00013243925,0.00027120145,0.00020925252,0.000012620768],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038401267,0.00017371826,0.00021660619,0.000109621324,0.00031487475,0.0002331734,0.00021793535,0.00007846323,0.00012794072],"category_scores_gemma":[0.000045187626,0.00015954794,0.00013446857,0.00040660074,0.000027176315,0.00091173116,0.0001300475,0.00009070183,0.000078546116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012852,0.0004062934,0.0018251854,0.0004691275,0.00009641393,0.000003553683,0.00004973137,0.34794974,0.0048016105,0.6402304,0.0012123974,0.0028269938],"study_design_scores_gemma":[0.00054626045,0.000002961502,0.00057342136,0.000026357706,0.00010985571,4.4764303e-7,0.00030209668,0.96969944,0.00033660786,0.016028317,0.012137674,0.00023654097],"about_ca_topic_score_codex":0.0001304104,"about_ca_topic_score_gemma":0.0006361493,"teacher_disagreement_score":0.7873497,"about_ca_system_score_codex":0.000043780776,"about_ca_system_score_gemma":0.000006648906,"threshold_uncertainty_score":0.6506176},"labels":[],"label_agreement":null},{"id":"W2004959361","doi":"10.1007/s11134-014-9417-7","title":"A model for deceased-donor transplant queue waiting times","year":2014,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; Western University; University of Waterloo","funders":"","keywords":"Queue; Queueing theory; Bulk queue; Computer science; Priority queue; Operations research; Operations management; Mathematics; Computer network; Economics","score_opus":0.018435175382557824,"score_gpt":0.2257407653887213,"score_spread":0.20730559000616347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2004959361","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13607605,0.00019352791,0.8491479,0.00037532768,0.00056684203,0.00073235965,0.000014707661,0.00074964575,0.012143646],"genre_scores_gemma":[0.9946321,0.0000018422232,0.0009522913,0.00054394855,0.001843574,0.00014988013,0.000051207135,0.00007876183,0.0017463977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998336,0.000036160247,0.0004885443,0.00045085134,0.00022029609,0.000468159],"domain_scores_gemma":[0.99884164,0.00024470902,0.00034850644,0.00037585676,0.00016378956,0.000025484936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001175385,0.00027471257,0.0004371015,0.0002552638,0.0003730675,0.00033242445,0.0003251523,0.00009653356,0.000018216953],"category_scores_gemma":[0.0002497278,0.00025708822,0.00020575857,0.00026817468,0.000038201117,0.0008179454,0.000041674983,0.00011431961,0.00012047939],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008648923,0.00004313119,0.0010989007,0.0010257412,0.00010849474,0.0000041870826,0.00016075687,0.37037733,0.002136335,0.6219305,0.0012099737,0.0018181998],"study_design_scores_gemma":[0.00045016492,0.0000067738283,0.000007684526,0.00031521518,0.00016181942,0.0000025873728,0.00013085398,0.9768594,0.00006790373,0.011468613,0.010183345,0.00034564149],"about_ca_topic_score_codex":0.0003616482,"about_ca_topic_score_gemma":0.00011774059,"teacher_disagreement_score":0.85855603,"about_ca_system_score_codex":0.000047841622,"about_ca_system_score_gemma":0.000018113218,"threshold_uncertainty_score":0.99998814},"labels":[],"label_agreement":null},{"id":"W2006165916","doi":"10.1016/j.peva.2011.12.001","title":"Computing system-time and system-length distributions for MAP/D/1 queue using distributional Little’s law","year":2012,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Council of Scientific and Industrial Research, India","keywords":"Laplace transform; Computation; Queue; Computer science; Applied mathematics; Queueing theory; Bulk queue; Mathematics; Algorithm; Mathematical optimization; Mathematical analysis; Computer network","score_opus":0.02793574997136396,"score_gpt":0.27867954990976207,"score_spread":0.2507437999383981,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2006165916","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89076865,0.00026306388,0.10632641,0.00009682981,0.000563415,0.000727061,0.00007508418,0.00023074319,0.0009487708],"genre_scores_gemma":[0.9955969,9.683799e-7,0.0013537115,0.00004599841,0.0018509078,0.000058004254,0.0010494362,0.000022908229,0.000021162235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998476,0.00006069775,0.0003969558,0.00025814582,0.0003939325,0.00041425528],"domain_scores_gemma":[0.9987524,0.00013923211,0.00036712314,0.00020728911,0.00050672475,0.000027243354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037515438,0.00019646854,0.00024598246,0.00011815576,0.0010357297,0.00016117658,0.00011436049,0.00007473196,0.000034052067],"category_scores_gemma":[0.00019836758,0.00019370139,0.00007881058,0.00030878623,0.000081093865,0.0021045045,0.00009741604,0.00009248976,0.0001244004],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024065867,0.000185735,0.018979937,0.0031429583,0.00024919419,4.3570506e-7,0.00016625837,0.055042062,0.0034337302,0.91011953,0.00034549978,0.00809397],"study_design_scores_gemma":[0.00048540183,0.0000066695234,0.002883002,0.00026138555,0.00046187386,0.000007229791,0.00020604997,0.9929267,0.00015361058,0.00025970076,0.0021074517,0.00024089191],"about_ca_topic_score_codex":0.00006192927,"about_ca_topic_score_gemma":0.000005148571,"teacher_disagreement_score":0.9378847,"about_ca_system_score_codex":0.00050481124,"about_ca_system_score_gemma":0.000028473742,"threshold_uncertainty_score":0.79661},"labels":[],"label_agreement":null},{"id":"W2007335061","doi":"10.5539/jmr.v2n1p98","title":"The M=M=1 Queue with Single Working Vacation Serving at a Slower Rate during the Start-up Period","year":2010,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Queue; Period length; Period (music); Real-time computing; Animal science; Computer network; Computer science; Discrete mathematics; Physics","score_opus":0.04752380833691549,"score_gpt":0.30658030329109265,"score_spread":0.25905649495417715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2007335061","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.993201,0.000077331526,0.0009446595,0.0032332458,0.00021154612,0.00018074566,1.8448002e-7,0.000018463457,0.002132785],"genre_scores_gemma":[0.99557,0.000018241746,0.0010187306,0.000056162982,0.00089554425,0.00000912911,4.6848524e-7,0.00003979842,0.0023919337],"study_design_codex":"bench_or_experimental","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979069,0.00010025103,0.00048081906,0.00013777518,0.0009598285,0.00041442475],"domain_scores_gemma":[0.9968443,0.00095977465,0.0006751202,0.00050882687,0.0009870745,0.000024905903],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.008083063,0.00013882443,0.0002091568,0.0002795228,0.0016669867,0.0008987973,0.00081714324,0.000052109106,0.00016024827],"category_scores_gemma":[0.0016677422,0.0000692329,0.000106553256,0.00076909293,0.0002129821,0.00067050447,0.00038078427,0.0010119833,0.000065040476],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0031745965,0.0016395727,0.016918423,0.0026932086,0.0019212684,0.0005209995,0.01822048,0.018954521,0.7366101,0.1779935,0.0045955265,0.016757768],"study_design_scores_gemma":[0.0073777484,0.00040018783,0.01282851,0.0048228013,0.0011461508,0.0013603142,0.08793486,0.17636068,0.029366199,0.4238837,0.25214732,0.0023715387],"about_ca_topic_score_codex":0.000011845759,"about_ca_topic_score_gemma":0.00048391992,"teacher_disagreement_score":0.7072439,"about_ca_system_score_codex":0.00011456978,"about_ca_system_score_gemma":0.000045732453,"threshold_uncertainty_score":0.9996327},"labels":[],"label_agreement":null},{"id":"W2008178632","doi":"10.1007/s11134-011-9221-6","title":"Geometric tail of queue length of low-priority customers in a nonpreemptive priority MAP/PH/1 queue","year":2011,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Queue; Priority queue; Mathematics; Bulk queue; Computer science; Applied mathematics; Mathematical optimization; Computer network","score_opus":0.018230931090563066,"score_gpt":0.22947057434902424,"score_spread":0.21123964325846117,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008178632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9808553,0.0006597575,0.0029005255,0.00002361362,0.0008132457,0.00071308744,0.000014194664,0.00016170468,0.013858559],"genre_scores_gemma":[0.99891585,0.00001653238,0.00026416767,0.00003874146,0.0003136867,0.000038920705,0.0000114704235,0.00005742703,0.00034320905],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9968658,0.00016163061,0.0012483828,0.00060627615,0.0005611978,0.0005567038],"domain_scores_gemma":[0.99704343,0.00023130717,0.0014085639,0.0007794948,0.00050081837,0.000036356803],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022603977,0.0003945227,0.0010800483,0.0019751585,0.00010365546,0.000056267574,0.00067600777,0.00022953835,0.00008757392],"category_scores_gemma":[0.0006945712,0.00039436782,0.00026780547,0.0032729015,0.00021306422,0.0013532181,0.00027995912,0.00038439498,0.00011323827],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011460377,0.0020170962,0.70822936,0.013981262,0.0011060908,0.00022715128,0.0058977893,0.01450174,0.009611359,0.23654254,0.00042131764,0.0063182497],"study_design_scores_gemma":[0.027255943,0.0011609058,0.46683243,0.028888496,0.004810196,0.00007788623,0.07900402,0.24074896,0.052204184,0.050337795,0.03295868,0.015720513],"about_ca_topic_score_codex":0.024832772,"about_ca_topic_score_gemma":0.0007078946,"teacher_disagreement_score":0.24139693,"about_ca_system_score_codex":0.00019559558,"about_ca_system_score_gemma":0.00007416707,"threshold_uncertainty_score":0.9998508},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.09283470670110919,"score_gpt":0.38428325283488635,"score_spread":0.29144854613377713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008297046","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73444736,0.00045673954,0.16841686,0.007098844,0.00007409143,0.0029020498,0.00001565448,0.00048776064,0.08610062],"genre_scores_gemma":[0.9536307,0.0000048364336,0.04372371,0.00012315593,0.00032305688,0.00005944829,0.000035060046,0.000028903727,0.0020711645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862105,0.000019881247,0.00040296992,0.0002181494,0.0004269551,0.00031098453],"domain_scores_gemma":[0.9981626,0.00023715814,0.00006728301,0.00033077513,0.0011878024,0.000014340296],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021728072,0.00011780835,0.00025035455,0.00050481246,0.00057951955,0.0003666077,0.00033912546,0.000052189884,0.000108294684],"category_scores_gemma":[0.0023383435,0.000106453146,0.00007440264,0.000868749,0.00009519199,0.00094907725,0.00006237541,0.00013569195,0.00011722698],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007084951,0.001021497,0.00004431923,0.0009392136,0.00008201925,0.0000058602895,0.0014932535,0.07599061,0.17561907,0.71421486,0.0030492689,0.027469177],"study_design_scores_gemma":[0.00020058634,0.00004146513,0.000018150615,0.00024360517,0.000042606927,0.0000013128358,0.0006984659,0.91917616,0.0034103247,0.07494315,0.0010602467,0.00016393515],"about_ca_topic_score_codex":0.000009240198,"about_ca_topic_score_gemma":0.000019213716,"teacher_disagreement_score":0.84318554,"about_ca_system_score_codex":0.000031739928,"about_ca_system_score_gemma":0.000050079387,"threshold_uncertainty_score":0.44572547},"labels":[],"label_agreement":null},{"id":"W2008705270","doi":"10.1016/j.ejor.2007.03.035","title":"Maximizing throughput in queueing networks with limited flexibility","year":2007,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Server; Queueing theory; Computer science; Flexibility (engineering); Throughput; Layered queueing network; Class (philosophy); Computer network; Capacity planning; Set (abstract data type); Mathematical optimization; Distributed computing; Mathematics; Artificial intelligence; Telecommunications; Operating system","score_opus":0.08447565047504504,"score_gpt":0.3474532981743744,"score_spread":0.2629776476993294,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2008705270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85197604,0.00021168956,0.101907276,0.0013530537,0.00011219621,0.00015336569,2.68824e-7,0.000022643224,0.044263497],"genre_scores_gemma":[0.99384016,0.000012420033,0.004043627,0.00044920907,0.0014383296,5.508642e-7,0.000004427422,0.00003208076,0.00017922248],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9976111,0.00031268457,0.000612259,0.00021194185,0.00085067935,0.00040130384],"domain_scores_gemma":[0.99789494,0.00041635655,0.00022150212,0.0001932998,0.0012421192,0.000031804506],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.020009957,0.00011873807,0.00019534268,0.0007605091,0.00028781497,0.00032367598,0.00040011774,0.000021516045,0.00016004397],"category_scores_gemma":[0.0012884942,0.00009179897,0.00006476193,0.0014000119,0.00014705914,0.0015329442,0.00016229351,0.0008271965,0.0000580413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0026686525,0.00035999346,0.03810436,0.000060231676,0.00012980147,0.002997416,0.00037106837,0.8646875,0.0018954632,0.060020115,0.0009195171,0.027785867],"study_design_scores_gemma":[0.010573666,0.0008585511,0.48522827,0.0024589193,0.00015807198,0.0004183125,0.0072805877,0.37983486,0.0008849064,0.01729612,0.093163334,0.0018444019],"about_ca_topic_score_codex":0.0000311279,"about_ca_topic_score_gemma":0.000083669984,"teacher_disagreement_score":0.48485264,"about_ca_system_score_codex":0.00012356426,"about_ca_system_score_gemma":0.00006117536,"threshold_uncertainty_score":0.69350916},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.06397752846340668,"score_gpt":0.33074207758785423,"score_spread":0.2667645491244476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009333025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8933915,0.0012181064,0.044291835,0.0032906434,0.0003405182,0.0005828008,9.607231e-7,0.000049471306,0.056834158],"genre_scores_gemma":[0.98751307,0.000014236908,0.008762611,0.00044672083,0.0023313025,0.0000048015013,0.0000037371601,0.000050511768,0.0008730286],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99788165,0.00025771995,0.0005720345,0.00020553869,0.0006836278,0.00039941273],"domain_scores_gemma":[0.9977331,0.00092029624,0.00024915172,0.00013764329,0.0009346655,0.000025139138],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008817426,0.00012828021,0.00022589695,0.0009324707,0.00044927807,0.00056630996,0.00044725498,0.00002311155,0.00027082124],"category_scores_gemma":[0.004971311,0.00011766947,0.000119750985,0.0009135841,0.00006252254,0.0020272222,0.00015355567,0.0005487288,0.00039107242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006659098,0.00045809645,0.008572157,0.0005296091,0.00020905929,0.001012233,0.00075515575,0.7418708,0.048124425,0.08640703,0.0046118395,0.10678365],"study_design_scores_gemma":[0.0029935336,0.00010775572,0.0018868917,0.0015357088,0.00005018192,0.000036912825,0.00026815396,0.9550598,0.00050194893,0.007106965,0.029982641,0.00046947596],"about_ca_topic_score_codex":0.0000040598593,"about_ca_topic_score_gemma":0.0000015349566,"teacher_disagreement_score":0.21318899,"about_ca_system_score_codex":0.00009160792,"about_ca_system_score_gemma":0.000025096235,"threshold_uncertainty_score":0.59514827},"labels":[],"label_agreement":null},{"id":"W2009389420","doi":"10.1016/j.orl.2004.08.004","title":"Response time in a tandem queue with blocking, Markovian arrivals and phase-type services","year":2004,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Queue; Blocking (statistics); Computer science; Tandem; Markov chain; Fork–join queue; Markov process; Discrete time and continuous time; Mathematical optimization; Control theory (sociology); Mathematics; Queue management system; Computer network; Statistics; Control (management); Engineering; Artificial intelligence","score_opus":0.020846876357894152,"score_gpt":0.3171079521990768,"score_spread":0.2962610758411826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2009389420","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9791608,0.000033229346,0.00035526793,0.019636502,0.0000139869135,0.0002930682,0.0000013166913,0.000050803275,0.0004550338],"genre_scores_gemma":[0.99575955,0.000006811851,0.0008908661,0.002752533,0.00013989891,0.000039349536,0.000025531714,0.000026930114,0.00035854644],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985781,0.00014729142,0.00018852332,0.00034204003,0.00037473717,0.0003693447],"domain_scores_gemma":[0.9993318,0.00011681052,0.00002932366,0.0002941368,0.0002033862,0.000024557825],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019704748,0.00013394722,0.00016405797,0.00079587824,0.0004710965,0.0005535071,0.00023036236,0.000040237253,0.00017982241],"category_scores_gemma":[0.00026074384,0.00011566262,0.000021133517,0.0015128476,0.00017597563,0.0011747075,0.00012207651,0.00026939134,0.00017980732],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030315537,0.00060698076,0.011137061,0.00015552496,0.0002018979,0.00066692446,0.0015970786,0.44534463,0.52225417,0.0120949475,0.0011726841,0.0017365533],"study_design_scores_gemma":[0.050032027,0.0015047854,0.03360996,0.004548048,0.00051292323,0.00015277624,0.012110434,0.623394,0.016864924,0.018918222,0.23233464,0.0060172128],"about_ca_topic_score_codex":0.00078361627,"about_ca_topic_score_gemma":0.002103931,"teacher_disagreement_score":0.5053893,"about_ca_system_score_codex":0.00010479051,"about_ca_system_score_gemma":0.000052368527,"threshold_uncertainty_score":0.5337482},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.05855104518789757,"score_gpt":0.3763409439001331,"score_spread":0.31778989871223556,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013001756","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41471675,0.000086125125,0.58454514,0.000047820227,0.0001327946,0.00021165868,0.0000021172104,0.0000243317,0.00023329922],"genre_scores_gemma":[0.9357587,5.528081e-7,0.06357275,0.00027187678,0.00032686745,0.0000031277837,0.000035582667,0.000022690785,0.00000787016],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99846387,0.000028002833,0.00080402766,0.00017260836,0.0002612513,0.00027026815],"domain_scores_gemma":[0.9971085,0.0007633237,0.0013462942,0.000112716836,0.0006398239,0.000029325092],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040141335,0.00019993086,0.00041181984,0.00040620865,0.00044696638,0.0002266433,0.00016158671,0.00005036488,0.000003850105],"category_scores_gemma":[0.00019822651,0.00014983534,0.000057886376,0.0005700402,0.000051090396,0.0011284457,0.00010177996,0.00020764585,0.0000017196862],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003203476,0.00039571204,0.0754667,0.0008946997,0.00050917227,0.000009743857,0.004011576,0.78356516,0.0023815231,0.02075147,0.00008754689,0.10872323],"study_design_scores_gemma":[0.0015651888,0.00013857687,0.012841319,0.0005234529,0.00007173205,0.000026912969,0.007163289,0.97470355,0.0015290609,0.0008297129,0.00028030932,0.00032688575],"about_ca_topic_score_codex":0.000071744376,"about_ca_topic_score_gemma":0.000047796955,"teacher_disagreement_score":0.5210419,"about_ca_system_score_codex":0.000074820025,"about_ca_system_score_gemma":0.000018222843,"threshold_uncertainty_score":0.6110108},"labels":[],"label_agreement":null},{"id":"W2013201818","doi":"10.1155/2013/508045","title":"Note on a Binomial Schedule for an M<sup>X</sup>/G/1 Queueing System with an Unreliable Server","year":2013,"lang":"en","type":"article","venue":"ISRN Probability and Statistics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Becton Dickinson (Canada)","funders":"","keywords":"Queueing system; Computer science; Queue; Schedule; Queueing theory; Idle; Bulk queue; Computer network; Real-time computing; Operating system","score_opus":0.01912098456161928,"score_gpt":0.24218589860728126,"score_spread":0.22306491404566198,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2013201818","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6915509,0.0000063851858,0.30643374,0.00012626022,0.00006994525,0.0010119488,0.00007213247,0.00020584396,0.00052285986],"genre_scores_gemma":[0.90716773,6.650225e-7,0.09173824,0.000368517,0.00031124154,0.00013136966,0.00012461396,0.000041537056,0.000116110525],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847746,0.000051000043,0.0003340404,0.00055387546,0.00020254927,0.0003810839],"domain_scores_gemma":[0.99866253,0.0002236526,0.00018947913,0.0004847979,0.00038955203,0.000049976104],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006732878,0.0002560536,0.000334358,0.00010808057,0.00041964222,0.00044591492,0.00019215798,0.000092334485,0.000051852974],"category_scores_gemma":[0.0002980068,0.00021263139,0.000037844224,0.00022565115,0.00014348036,0.0016465458,0.00006379105,0.00015550473,0.000055633787],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057479914,0.00030155998,0.0042333356,0.0015807083,0.000059718837,0.000004927691,0.00021038577,0.07577959,0.000048970796,0.90911835,0.00021293253,0.007874729],"study_design_scores_gemma":[0.0009038394,0.00028800024,0.0007797317,0.00012535515,0.00015173979,0.000002007704,0.00068656006,0.8332614,0.00002391901,0.16241434,0.0009604447,0.00040269515],"about_ca_topic_score_codex":0.0010239092,"about_ca_topic_score_gemma":0.0010543367,"teacher_disagreement_score":0.75748175,"about_ca_system_score_codex":0.000081474376,"about_ca_system_score_gemma":0.000035721998,"threshold_uncertainty_score":0.8670857},"labels":[],"label_agreement":null},{"id":"W2014361701","doi":"10.1080/15326340802640974","title":"Light-Tailed Behavior in QBD Processes with Countably Many Phases","year":2009,"lang":"en","type":"article","venue":"Stochastic Models","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Mount Saint Vincent University; Dalhousie University","funders":"","keywords":"Mathematics; Large deviations theory; Queueing theory; Polling; Statistical physics; Asymptotic analysis; Queue; Counting process; Stochastic process; Probability theory; Matrix (chemical analysis); Probabilistic logic; Applied probability; Applied mathematics; Mathematical analysis; Statistics; Computer science; Physics","score_opus":0.016566165820680167,"score_gpt":0.24161360017676245,"score_spread":0.2250474343560823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014361701","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33666313,0.00021830584,0.6518609,0.0006378874,0.00007322334,0.00068810536,0.000004045474,0.00033828156,0.009516144],"genre_scores_gemma":[0.9980013,0.0000040465943,0.0005137212,0.0007771906,0.00026235735,0.00009880127,0.00002229239,0.000030300442,0.0002900383],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859345,0.00000619222,0.00028820618,0.00041529685,0.00031166137,0.0003852205],"domain_scores_gemma":[0.9992254,0.000058236685,0.00018828797,0.00029846374,0.00021063785,0.000018998127],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016765278,0.00026514544,0.00032241683,0.00036594717,0.0001519212,0.00014512328,0.00026743955,0.000056411525,0.00012461809],"category_scores_gemma":[0.000095708165,0.00022056118,0.000046937763,0.00084005506,0.00004103019,0.0015577186,0.000039891907,0.0001403616,0.000062175204],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006465094,0.00075642375,0.00035507395,0.00017506538,0.000043075415,0.00013568667,0.00020920472,0.9074508,0.00057405996,0.086064495,0.0001865605,0.0034030294],"study_design_scores_gemma":[0.004180411,0.00024390375,0.0006503233,0.0008890905,0.001060119,0.000025899872,0.0008850555,0.63141274,0.000158851,0.35762748,0.0009910903,0.0018750106],"about_ca_topic_score_codex":0.00009062825,"about_ca_topic_score_gemma":0.00022731516,"teacher_disagreement_score":0.66133815,"about_ca_system_score_codex":0.000048496142,"about_ca_system_score_gemma":0.00004648635,"threshold_uncertainty_score":0.8994224},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.028489124732065867,"score_gpt":0.2617988668528339,"score_spread":0.23330974212076802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014774334","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3627695,0.00035984538,0.49709508,0.004716535,0.0016794014,0.0031156875,0.000007668186,0.00044379657,0.12981246],"genre_scores_gemma":[0.9954153,0.000032463955,0.0006542521,0.0009185077,0.00018075926,0.00008727817,0.000002819479,0.000020816897,0.0026878153],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99794155,0.000019369914,0.00040818783,0.00044166905,0.0006522844,0.0005369333],"domain_scores_gemma":[0.99862796,0.00013505256,0.0004346899,0.0006258995,0.00016151516,0.000014889481],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023917912,0.00019613394,0.00023422604,0.00041258504,0.000743629,0.0004992145,0.0010570982,0.00001887291,0.000025104522],"category_scores_gemma":[0.00012820674,0.0001430153,0.000107260195,0.0018818406,0.00040051018,0.0016346412,0.0006141918,0.00006983848,0.000043939617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050862134,0.00007101469,0.0029711516,0.00041207683,0.00009422696,0.000009696761,0.00029792343,0.3457812,0.00055869675,0.6436346,0.00039991093,0.005718614],"study_design_scores_gemma":[0.0015988725,0.00005521481,0.0072249896,0.00066052855,0.00060318277,0.0000039780707,0.014047676,0.58697176,0.0006101033,0.08169889,0.30535957,0.00116524],"about_ca_topic_score_codex":0.00033315684,"about_ca_topic_score_gemma":0.0000348063,"teacher_disagreement_score":0.6326458,"about_ca_system_score_codex":0.00008894718,"about_ca_system_score_gemma":0.000010331611,"threshold_uncertainty_score":0.5831995},"labels":[],"label_agreement":null},{"id":"W2014867777","doi":"10.1023/a:1021856632000","title":"A Two Priority Queue with Crossover Feedback","year":2003,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Waterloo","funders":"","keywords":"Queue; Computer science; Class (philosophy); Service (business); Poisson distribution; Poisson process; Mathematics; Computer network; Statistics; Business","score_opus":0.010261217941404326,"score_gpt":0.23106139085442892,"score_spread":0.2208001729130246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014867777","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7929136,0.00050702604,0.014767524,0.00013904685,0.001080762,0.000678826,0.0000027467588,0.0007658081,0.18914461],"genre_scores_gemma":[0.99495673,0.0000015958926,0.00039621437,0.00037234896,0.00074879546,0.000036506462,0.00000638536,0.00006286543,0.003418546],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99829346,0.00006254567,0.00036063045,0.00046804766,0.00035545597,0.00045986718],"domain_scores_gemma":[0.9987749,0.00007098204,0.00036373807,0.00054716936,0.00021883029,0.000024413583],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008263598,0.0002869886,0.0003963471,0.00020181504,0.0003421112,0.0006207436,0.00024808402,0.00007179817,0.00011563056],"category_scores_gemma":[0.00021209022,0.0002375892,0.00009845654,0.0007972484,0.00009060586,0.0013182133,0.000054880908,0.00020112813,0.00059020746],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010747022,0.00008651713,0.023953447,0.00038453203,0.00016512792,0.00008029243,0.000108931854,0.027247982,0.00070677523,0.94617915,0.0006977887,0.00028197514],"study_design_scores_gemma":[0.008381721,0.000077850076,0.0023625654,0.0017406692,0.0008776578,0.00016515056,0.0036267089,0.0422332,0.00089136825,0.0357262,0.90027374,0.0036431479],"about_ca_topic_score_codex":0.0016740429,"about_ca_topic_score_gemma":0.0002580914,"teacher_disagreement_score":0.91045296,"about_ca_system_score_codex":0.0000930988,"about_ca_system_score_gemma":0.00003647666,"threshold_uncertainty_score":0.9688606},"labels":[],"label_agreement":null},{"id":"W2014880775","doi":"10.1007/s11134-005-0615-1","title":"Analytical Distribution of Waiting Time in the M/{iD}/1 Queue","year":2005,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"National Science Foundation","keywords":"Queue; Burke's theorem; Constant (computer programming); Distribution (mathematics); Integer (computer science); Mathematics; Computer science; Mathematical optimization; Applied mathematics; Fork–join queue; Queue management system; Mathematical analysis; Computer network","score_opus":0.011372635809280662,"score_gpt":0.23223638968305188,"score_spread":0.22086375387377122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2014880775","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9790226,0.0001884771,0.0028421371,0.0011497771,0.000121412224,0.00029359045,0.0000058676274,0.00012286603,0.016253237],"genre_scores_gemma":[0.9983815,9.787371e-7,0.000017460943,0.00018686471,0.000988242,0.000014624574,0.000057951358,0.000015760148,0.0003365939],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986437,0.00007882019,0.00050734734,0.00021747894,0.00028803822,0.00026464486],"domain_scores_gemma":[0.9990978,0.00019327566,0.0003052322,0.0003069411,0.00008934491,0.0000074049717],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001645772,0.00014191921,0.00028884743,0.00015741367,0.00011146016,0.00013622163,0.00031348618,0.00006396949,0.000043129978],"category_scores_gemma":[0.0003340954,0.00010742414,0.000090279325,0.0007449427,0.00005835977,0.00065277313,0.00005943289,0.00015712468,0.00025053555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047121506,0.0001624298,0.008207616,0.00034606562,0.000077611876,0.000024271503,0.00025395918,0.1030581,0.0009279976,0.88023067,0.0021271596,0.0045369836],"study_design_scores_gemma":[0.000262196,0.000005670052,0.00088653644,0.00023069639,0.00008498981,0.0000056805675,0.0007352319,0.96024245,0.000042882202,0.0011495237,0.036150385,0.00020377872],"about_ca_topic_score_codex":0.00073103694,"about_ca_topic_score_gemma":0.000048888596,"teacher_disagreement_score":0.8790812,"about_ca_system_score_codex":0.000073873016,"about_ca_system_score_gemma":0.000010185125,"threshold_uncertainty_score":0.4380629},"labels":[],"label_agreement":null},{"id":"W2016530058","doi":"10.1109/tcomm.2003.816972","title":"Effective bandwidth of multiclass Markovian traffic sources and admission control with dynamic buffer partitioning","year":2003,"lang":"en","type":"article","venue":"IEEE Transactions on Communications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quality of service; Computer science; Bandwidth (computing); Markov process; Admission control; Buffer overflow; Statistical time division multiplexing; Partition (number theory); Multiplexing; Markov chain; Packet loss; Queueing theory; Computer network; Bandwidth allocation; Buffer (optical fiber); Call Admission Control; Network packet; Real-time computing; Mathematics; Telecommunications; Statistics","score_opus":0.0076939997439488565,"score_gpt":0.23032366538541754,"score_spread":0.2226296656414687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016530058","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.46834797,0.00020562421,0.52746594,0.0009205864,0.00006747353,0.00064810866,0.000015794001,0.00017918824,0.0021493428],"genre_scores_gemma":[0.99748015,0.00004559362,0.002054567,0.00014554491,0.000008411648,0.000117249285,0.0000063374937,0.000024192865,0.000117922886],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991967,0.00012051571,0.00021972616,0.00019031373,0.000121881174,0.00015086688],"domain_scores_gemma":[0.99854195,0.00048455785,0.00016876252,0.0006545541,0.00012787635,0.000022272206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002813156,0.00015193186,0.00021364985,0.00023926995,0.00059691194,0.000057909914,0.00020875156,0.000050345952,0.00008065024],"category_scores_gemma":[0.00003867534,0.00013329233,0.00007306052,0.00043783858,0.00023549491,0.00043214313,0.0000029806345,0.00021728124,0.000013270036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012208801,0.0029998831,0.0025191202,0.00043081533,0.0013603871,0.0000056624235,0.0014510043,0.8416738,0.010597548,0.023345223,0.000045413322,0.114350304],"study_design_scores_gemma":[0.008255199,0.00027839286,0.005658751,0.00086667883,0.002483477,0.000021402762,0.0031380735,0.9576077,0.005169477,0.005622709,0.009649886,0.0012482434],"about_ca_topic_score_codex":0.000039697206,"about_ca_topic_score_gemma":0.00045164407,"teacher_disagreement_score":0.52913225,"about_ca_system_score_codex":0.000033793032,"about_ca_system_score_gemma":0.000014662404,"threshold_uncertainty_score":0.5435504},"labels":[],"label_agreement":null},{"id":"W2016755071","doi":"10.1155/2007/14504","title":"Delay Analysis of an<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"E1\"><mml:mrow><mml:mi>M</mml:mi><mml:mo>/</mml:mo><mml:mi>G</mml:mi><mml:mo>/</mml:mo><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mi>K</mml:mi></mml:mrow></mml:math>Priority Queueing System with Push-out Scheme","year":2007,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"Iran Telecommunication Research Center; LG Yeonam Cultural Foundation","keywords":"Algorithm; Computer science","score_opus":0.012971276414057127,"score_gpt":0.22457110485479925,"score_spread":0.21159982844074213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016755071","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8221416,0.0010797464,0.065639764,0.0003289184,0.0015830108,0.0001745687,0.00017684593,0.0010709659,0.107804626],"genre_scores_gemma":[0.98255867,0.0002291369,0.011649182,0.0006315679,0.0018242312,0.001193451,0.0006892418,0.0010949036,0.00012960061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.98697877,0.00032805518,0.0034371426,0.0025152164,0.0033951069,0.003345731],"domain_scores_gemma":[0.9909997,0.0020995196,0.0029229808,0.0026888682,0.00040671276,0.0008822234],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","research_integrity","insufficient_payload"],"category_scores_codex":[0.005520332,0.0014595744,0.00093982357,0.001782537,0.001585207,0.0018745428,0.0029344372,0.0023639398,0.021697454],"category_scores_gemma":[0.0028932,0.0024571563,0.0022317802,0.003676467,0.0012987626,0.0031646658,0.0024168286,0.0024636092,0.0013087092],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008044813,0.0005583814,0.00004354924,0.005719822,0.0037939858,0.0011811069,0.0018051576,0.06747803,0.004047461,0.90438753,0.008678274,0.0015022408],"study_design_scores_gemma":[0.0025910663,0.00088091876,0.00006145575,0.0047792885,0.005509122,0.0009843847,0.0036040137,0.47999078,0.48965585,0.006821508,0.0016951804,0.0034264228],"about_ca_topic_score_codex":0.0016318422,"about_ca_topic_score_gemma":0.0014894204,"teacher_disagreement_score":0.897566,"about_ca_system_score_codex":0.00007087001,"about_ca_system_score_gemma":0.00058686174,"threshold_uncertainty_score":0.99983776},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.015571711298819544,"score_gpt":0.2259616641810344,"score_spread":0.21038995288221485,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2016945629","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9454707,0.00009911272,0.005672548,0.0011006175,0.00043545105,0.0021842092,0.000004904178,0.00031043627,0.044722013],"genre_scores_gemma":[0.9899808,0.0000379713,0.004106301,0.0016152785,0.00027503207,0.00079104735,0.000108912565,0.000071761,0.003012897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99729383,0.00006496695,0.0007482932,0.00077299704,0.00044128433,0.00067860377],"domain_scores_gemma":[0.9987943,0.000027065931,0.00020797212,0.00079222216,0.0001415313,0.00003691572],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00051956443,0.00045577838,0.00040128143,0.0009552639,0.0005136692,0.0014210205,0.00074425933,0.00007552957,0.00057119556],"category_scores_gemma":[0.000005044268,0.0004687305,0.00009854983,0.0010020358,0.00003399382,0.002644543,0.0006881161,0.00026472769,0.0023242652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001906593,0.00019532909,0.00026638125,0.00089161977,0.00023684521,0.00010678429,0.00013188887,0.9198311,0.00005188281,0.0754029,0.00034720244,0.0025190236],"study_design_scores_gemma":[0.0031467997,0.000029416673,0.015109708,0.0012809178,0.0007540545,0.000008084796,0.019016579,0.9090466,0.00033986557,0.01625482,0.032682046,0.0023311386],"about_ca_topic_score_codex":0.006039484,"about_ca_topic_score_gemma":0.0018890235,"teacher_disagreement_score":0.05914808,"about_ca_system_score_codex":0.00026616696,"about_ca_system_score_gemma":0.000008126738,"threshold_uncertainty_score":0.9997764},"labels":[],"label_agreement":null},{"id":"W2017524410","doi":"10.1111/1475-3995.t01-1-00329","title":"On Estimation in <i>M</i>/<i>G</i>/<i>c</i>/<i>c</i> Queues","year":2001,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor; Brock University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Estimator; Poisson distribution; Mathematics; Random variable; Queue; Variance (accounting); Minimum-variance unbiased estimator; Function (biology); Statistics; Efficient estimator; Applied mathematics; Distribution (mathematics); Combinatorics; Mathematical optimization; Computer science; Mathematical analysis","score_opus":0.05249944608765799,"score_gpt":0.379360133672561,"score_spread":0.326860687584903,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2017524410","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55919176,0.0000837787,0.10470536,0.030483378,0.0014788923,0.0011282715,0.000025037085,0.0002527275,0.30265078],"genre_scores_gemma":[0.99494386,0.000056499277,0.0006611086,0.0015237936,0.00028809844,0.00020517383,0.00007290406,0.00002663862,0.0022219387],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758005,0.0000786147,0.00045663016,0.00043738494,0.0010847633,0.00036253876],"domain_scores_gemma":[0.9986996,0.00055385253,0.000054798053,0.00022319994,0.00045102448,0.000017512397],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0017325087,0.00016158559,0.0001616477,0.0021509049,0.0002341684,0.00030817956,0.00045934814,0.000086681765,0.0027235926],"category_scores_gemma":[0.00060350803,0.00016940811,0.00007425359,0.0018633198,0.00012345739,0.0019451579,0.000029039076,0.00064041006,0.0008446088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032719047,0.000501103,0.0021855494,0.000009564768,0.000021388081,0.000060683025,0.000063187996,0.7250862,0.00034050303,0.26139864,0.00031953334,0.00968644],"study_design_scores_gemma":[0.001666216,0.000029798626,0.0035564327,0.0001911252,0.00000804606,0.000016678876,0.00033725976,0.75090516,0.00022817995,0.19051881,0.052153725,0.0003885853],"about_ca_topic_score_codex":0.00094670505,"about_ca_topic_score_gemma":0.0025488369,"teacher_disagreement_score":0.43575206,"about_ca_system_score_codex":0.00040000997,"about_ca_system_score_gemma":0.00007339449,"threshold_uncertainty_score":0.99993336},"labels":[],"label_agreement":null},{"id":"W2018093794","doi":"10.1007/s10626-013-0160-8","title":"A stochastic hybrid state model for optimizing hedging policies in manufacturing systems with randomly occurring defects","year":2013,"lang":"en","type":"article","venue":"Discrete Event Dynamic Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Piecewise; Mode (computer interface); Observable; State (computer science); Extension (predicate logic); Class (philosophy); Production (economics); Mathematical optimization; Computer science; Control theory (sociology); Mathematics; Control (management); Applied mathematics; Algorithm; Economics; Mathematical analysis; Physics","score_opus":0.008350037458738831,"score_gpt":0.22818035020779395,"score_spread":0.21983031274905512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2018093794","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.485908,0.00020688893,0.5117891,0.00003509295,0.00023001085,0.0015526717,0.000013532789,0.00015893318,0.00010575691],"genre_scores_gemma":[0.9978009,0.0000026582024,0.00026732133,0.00008797519,0.00019156765,0.001063124,0.000061822895,0.00011576263,0.00040890375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9973442,0.000049948005,0.0007722287,0.00061101874,0.00037549122,0.0008471204],"domain_scores_gemma":[0.9985295,0.00020495174,0.0006356854,0.0004508072,0.00013704841,0.000042001655],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007828749,0.00047885682,0.0007753898,0.0006853119,0.00029575542,0.0007428799,0.00037885914,0.00006889483,0.000003836578],"category_scores_gemma":[0.00009391305,0.0004028093,0.0001874785,0.0002998246,0.000057562258,0.0017123828,0.00015024729,0.00025303834,0.000035751847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001630036,0.000019135356,0.00031385667,0.00087799184,0.000103103564,0.000008560353,0.00020309527,0.9968411,0.00013990523,0.0011873469,0.000018712932,0.0001242438],"study_design_scores_gemma":[0.0019908536,0.000014640412,0.00007032582,0.0014564698,0.00012718454,0.000011838531,0.0015917703,0.9926787,0.000010273884,0.0014772444,0.000023797933,0.00054690556],"about_ca_topic_score_codex":0.002034656,"about_ca_topic_score_gemma":0.00020563726,"teacher_disagreement_score":0.51189286,"about_ca_system_score_codex":0.00028102507,"about_ca_system_score_gemma":0.000026109916,"threshold_uncertainty_score":0.9998424},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.12991589512478754,"score_gpt":0.39241821771528,"score_spread":0.26250232259049244,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2019377880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9176428,0.00018467534,0.0032149693,0.0006185149,0.00007785659,0.0004908666,0.0000054248344,0.000034544628,0.07773036],"genre_scores_gemma":[0.9982521,0.000023617467,0.00015361565,0.000042515192,0.00014821347,0.000053130145,0.000009391553,0.000011301532,0.0013061061],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989434,0.00008906565,0.00019489827,0.00013364688,0.00035722906,0.00028178818],"domain_scores_gemma":[0.998608,0.00015933222,0.000035301895,0.00046821134,0.0007210437,0.000008131497],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0025027506,0.00007269156,0.00007653593,0.00015697948,0.0017428481,0.00025792938,0.00055088394,0.000022989543,0.00045243226],"category_scores_gemma":[0.0005870506,0.000035510227,0.000083188206,0.0010399406,0.0002607232,0.0006536445,0.00023336844,0.00020962355,0.00024506036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038307626,0.0005100784,0.025002778,0.00003747895,0.0008225868,0.000016539188,0.0025582362,0.12555857,0.012224744,0.78850126,0.012321576,0.03206307],"study_design_scores_gemma":[0.0012289544,0.00020492736,0.024197085,0.00011134135,0.00018282114,0.000008649528,0.011202165,0.8187186,0.0013076967,0.095551126,0.046560604,0.0007260217],"about_ca_topic_score_codex":0.0033905457,"about_ca_topic_score_gemma":0.0006059743,"teacher_disagreement_score":0.69316006,"about_ca_system_score_codex":0.00004536246,"about_ca_system_score_gemma":0.00005198322,"threshold_uncertainty_score":0.9995567},"labels":[],"label_agreement":null},{"id":"W2020319110","doi":"10.1016/j.apm.2012.04.044","title":"Asymptotic behavior of the loss probability for an M/G/1/N queue with vacations","year":2012,"lang":"en","type":"article","venue":"Applied Mathematical Modelling","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Fundamental Research Funds for the Central Universities; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Burke's theorem; Queue; Mathematics; Combinatorics; Applied mathematics; Queueing theory; Discrete mathematics; Statistics; Fork–join queue; Computer science; Queue management system; Computer network","score_opus":0.04462857969662244,"score_gpt":0.2564096309677126,"score_spread":0.21178105127109015,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2020319110","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3507573,0.0000059140575,0.64687634,0.000047647478,0.00001589413,0.00069199584,0.0000013633195,0.000050887887,0.0015526707],"genre_scores_gemma":[0.9396962,2.9577762e-7,0.059630826,0.00008108425,0.00017128461,0.0003622013,0.000006302709,0.000030645275,0.000021152347],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99902,0.000008258064,0.00030904886,0.0001936614,0.00019551633,0.00027353034],"domain_scores_gemma":[0.998982,0.00016572826,0.0002177672,0.0004981517,0.000116473195,0.000019885387],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005902725,0.00014653929,0.00023596827,0.00005029541,0.00018598966,0.000037134054,0.00026143662,0.0000525331,0.000034405268],"category_scores_gemma":[0.00005383468,0.000094237344,0.000085202635,0.0002770045,0.00012846377,0.0004781329,0.0000683193,0.000095090254,0.000021209717],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025429865,0.00039113683,0.00041959345,0.00025882092,0.000019304047,2.784636e-8,0.00011051778,0.06925287,0.000296162,0.92884654,0.0000022609368,0.00037731303],"study_design_scores_gemma":[0.0001953288,0.0000057234784,0.000046032772,0.000039295828,0.00042808574,8.2577645e-7,0.00014556038,0.20213157,0.0007043237,0.7960738,0.000066259956,0.00016321772],"about_ca_topic_score_codex":0.000006092279,"about_ca_topic_score_gemma":0.0000040072405,"teacher_disagreement_score":0.5889389,"about_ca_system_score_codex":0.000022514243,"about_ca_system_score_gemma":0.0000104551655,"threshold_uncertainty_score":0.38428873},"labels":[],"label_agreement":null},{"id":"W2021233452","doi":"10.1145/1734222.1734223","title":"Setwise and filtered gibbs samplers for teletraffic analysis","year":2010,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Gibbs sampling; Estimator; Markov chain; Computer science; Occupancy; Markov process; Applied mathematics; Markov chain Monte Carlo; Mathematical optimization; Algorithm; Mathematics; Statistics; Artificial intelligence; Bayesian probability; Machine learning; Engineering","score_opus":0.02660623500649122,"score_gpt":0.2626521806922541,"score_spread":0.23604594568576287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2021233452","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38682896,0.0000049108125,0.6127774,0.00013542216,0.000077030636,0.0000855966,0.0000037083587,0.00008056569,0.0000064004394],"genre_scores_gemma":[0.9681012,0.0000033132362,0.03125562,0.00032451423,0.00023407735,0.000012793544,0.00003650993,0.00001625581,0.000015731297],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992297,0.000007977073,0.00019744952,0.0003275154,0.000093836454,0.00014348893],"domain_scores_gemma":[0.9993528,0.00020894753,0.000071689225,0.00024436638,0.00010486247,0.000017307108],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019351579,0.0001417795,0.00018550004,0.00045543883,0.0003584273,0.00017389323,0.000101799116,0.00006838718,0.000019884887],"category_scores_gemma":[0.000023250821,0.00014203024,0.00011496943,0.00038233856,0.000026321566,0.00048229803,0.000009299407,0.00013723824,0.0000028152745],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044420533,0.000025979814,0.00006626838,0.000018392302,0.00013245623,1.734634e-7,0.000043382446,0.9292415,0.000051690273,0.0004780032,0.0000016390384,0.06989614],"study_design_scores_gemma":[0.0003836651,0.000011531995,0.00015368199,0.0000072919242,0.000578705,3.295599e-7,0.000021750522,0.98772794,0.000005364517,0.010682538,0.0002648671,0.00016236326],"about_ca_topic_score_codex":0.000048524093,"about_ca_topic_score_gemma":0.00009788728,"teacher_disagreement_score":0.58152175,"about_ca_system_score_codex":0.000006657259,"about_ca_system_score_gemma":0.0000038004694,"threshold_uncertainty_score":0.5791825},"labels":[],"label_agreement":null},{"id":"W2022664864","doi":"10.1145/1122012.1122016","title":"Perfect sampling for queues and network models","year":2006,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University; Western University","funders":"","keywords":"Computer science; Queue; Reservation; Queueing theory; Protocol (science); Poisson distribution; Construct (python library); Sampling (signal processing); Service (business); Fork–join queue; Computer network; Mathematics; Queue management system; Statistics; Telecommunications","score_opus":0.03553395263247132,"score_gpt":0.26086271129599664,"score_spread":0.2253287586635253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2022664864","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13008222,0.00007460273,0.86933315,0.000110332716,0.00009509495,0.00013130247,0.0000011928615,0.0001321816,0.000039917588],"genre_scores_gemma":[0.9567247,0.000008116875,0.042233143,0.00026362555,0.0007002612,0.000013699643,0.00001805327,0.000020537982,0.000017874481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992964,0.00000889669,0.00018701896,0.00027354315,0.00007702548,0.00015711391],"domain_scores_gemma":[0.99949455,0.00018723922,0.000058495145,0.00016769965,0.000084059175,0.000007940572],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019296851,0.00013269822,0.00014739313,0.00012925566,0.00047017197,0.00017261086,0.00006580157,0.000052414594,0.0000025117547],"category_scores_gemma":[0.00000529408,0.0001343202,0.000060045793,0.00012789835,0.000015639844,0.0006680667,0.000008955904,0.00007594356,0.0000014092257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000046175912,0.000017973527,0.00001977249,0.000026113288,0.000016122756,9.750919e-8,0.000016405096,0.9615179,0.0000049566765,0.006293945,0.0000028141208,0.032037724],"study_design_scores_gemma":[0.00024027067,0.00000910833,0.000011472138,0.000029410172,0.00006729155,2.865189e-7,0.000007954611,0.73967236,0.0000012448725,0.2597489,0.00009767049,0.00011399661],"about_ca_topic_score_codex":0.00009881351,"about_ca_topic_score_gemma":0.000029249826,"teacher_disagreement_score":0.82710004,"about_ca_system_score_codex":0.0000114558625,"about_ca_system_score_gemma":0.0000027609863,"threshold_uncertainty_score":0.5477419},"labels":[],"label_agreement":null},{"id":"W2024733170","doi":"10.1007/s11134-011-9227-0","title":"Tail asymptotics for a generalized two-demand queueing model—a kernel method","year":2011,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Mount Saint Vincent University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Kernel (algebra); Mathematics; Queueing system; Applied mathematics; Computer science; Mathematical optimization; Combinatorics; Statistics","score_opus":0.04635275459403758,"score_gpt":0.282787678364388,"score_spread":0.2364349237703504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2024733170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05360745,0.00036173308,0.9288614,0.00007401353,0.00078468944,0.00081947533,0.000006955144,0.0006201706,0.014864124],"genre_scores_gemma":[0.93784785,0.0000061291835,0.05589198,0.00064594985,0.0017376035,0.00023595455,0.00003109007,0.00016480988,0.0034386541],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974356,0.00009924507,0.00078349595,0.00068289,0.0003322779,0.00066648447],"domain_scores_gemma":[0.99806476,0.0001784814,0.00069304166,0.0006596693,0.00036345053,0.000040615465],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0022128369,0.00043103748,0.0007219244,0.00043293627,0.00043652867,0.00035709774,0.0005263879,0.00015397879,0.000048273523],"category_scores_gemma":[0.00032507803,0.00041025522,0.00029628578,0.0005412172,0.00005608492,0.0013237175,0.00018218531,0.00018554233,0.00010923794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016127173,0.00008114017,0.0010292252,0.0007688865,0.00029976657,0.000017377477,0.00054611394,0.3307405,0.0030415969,0.66156286,0.00085001497,0.0009012583],"study_design_scores_gemma":[0.0010867935,0.000011753476,0.000012973107,0.00020314055,0.0004525441,0.000006223562,0.0003910212,0.9426727,0.00043136827,0.050619464,0.003547815,0.00056415313],"about_ca_topic_score_codex":0.0016446273,"about_ca_topic_score_gemma":0.00010196407,"teacher_disagreement_score":0.8842404,"about_ca_system_score_codex":0.00009959087,"about_ca_system_score_gemma":0.00003546257,"threshold_uncertainty_score":0.99983495},"labels":[],"label_agreement":null},{"id":"W2025527851","doi":"10.1239/aap/1025131221","title":"A fluid model with data message discarding","year":2002,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Buffer overflow; Goodput; Computer science; Mathematics; Message passing; Algorithm; Computer network; Distributed computing; Telecommunications; Wireless","score_opus":0.03395054577369346,"score_gpt":0.2490012089841477,"score_spread":0.21505066321045424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025527851","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1413659,0.0021151719,0.26626447,0.0010356157,0.00019427166,0.0022717197,0.0000403445,0.0010288416,0.58568364],"genre_scores_gemma":[0.9807396,0.00005668329,0.018432666,0.00033511885,0.0001535282,0.00011006715,0.000046471105,0.000033985463,0.000091874426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801874,0.000015570202,0.0003644083,0.0008945556,0.0003039722,0.0004027519],"domain_scores_gemma":[0.99812335,0.00009181589,0.00019550424,0.001526404,0.000047100573,0.000015835292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080419326,0.0002633238,0.00037342554,0.00013581548,0.00016048792,0.000108709086,0.0008511078,0.000053587402,0.0001439003],"category_scores_gemma":[0.00016034779,0.0002170447,0.000042558622,0.00088030664,0.00021154323,0.0029699455,0.0005787002,0.00022093786,0.00008407053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002352068,0.0003340882,0.0080070915,0.0004078203,0.000040408246,0.000009935269,0.00009584464,0.6530244,0.00024616273,0.28394014,0.00016518382,0.053493716],"study_design_scores_gemma":[0.0005094729,0.0000035747737,0.00005424308,0.000037222802,0.00006111722,7.091179e-7,0.00008256854,0.64987093,0.000032465618,0.33501342,0.013974473,0.00035978662],"about_ca_topic_score_codex":0.000011951236,"about_ca_topic_score_gemma":0.00018465822,"teacher_disagreement_score":0.8393737,"about_ca_system_score_codex":0.00007161141,"about_ca_system_score_gemma":0.00000660939,"threshold_uncertainty_score":0.88508254},"labels":[],"label_agreement":null},{"id":"W2025737929","doi":"10.1287/opre.1120.1062","title":"Strategies for a Centralized Single Product Multiclass <i>M/G/</i>1 Make-to-Stock Queue","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Computer science; Rationing; Priority queue; Operations research; Stock (firearms); Queueing theory; Mathematical optimization; Computer network; Mathematics; Economics","score_opus":0.122920014462063,"score_gpt":0.3896624787333305,"score_spread":0.26674246427126747,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025737929","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8371705,0.00040693284,0.10415497,0.014742156,0.00075320114,0.005521754,0.000039941424,0.00048455157,0.03672604],"genre_scores_gemma":[0.9843305,0.000002526522,0.008446104,0.00043764175,0.001507445,0.00056504353,0.00006829658,0.000043249343,0.00459924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99813896,0.00007815744,0.00024911578,0.0003363367,0.00040446315,0.0007929738],"domain_scores_gemma":[0.99847835,0.00014605466,0.00002612601,0.00045014458,0.00085142127,0.00004788959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001742436,0.00014758794,0.0001807735,0.0004587394,0.0008639024,0.0008651472,0.00031840967,0.000045196637,0.00027867727],"category_scores_gemma":[0.001221828,0.00013464777,0.00007676932,0.001228791,0.00009921063,0.0019324756,0.00017654976,0.00019412847,0.0006069073],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030713502,0.0010636363,0.001232638,0.0002523683,0.00011894416,0.0000028413187,0.0010279841,0.06233011,0.15346913,0.756336,0.013941492,0.009917768],"study_design_scores_gemma":[0.0016549369,0.000077163146,0.000642391,0.00009783693,0.000116426614,0.0000033447216,0.005939711,0.11953215,0.009026998,0.009328722,0.85273045,0.00084987987],"about_ca_topic_score_codex":0.00040209282,"about_ca_topic_score_gemma":0.0009959225,"teacher_disagreement_score":0.8387889,"about_ca_system_score_codex":0.000102792,"about_ca_system_score_gemma":0.000066772205,"threshold_uncertainty_score":0.83426344},"labels":[],"label_agreement":null},{"id":"W2025873721","doi":"10.1109/itc.2014.6932947","title":"On resource pooling in SITA-like parallel server systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Server; Computer science; Pooling; Workload; Idle; Computer network; Routing (electronic design automation); Interval (graph theory); Task (project management); Distributed computing; Real-time computing; Operating system; Mathematics; Artificial intelligence; Engineering","score_opus":0.011016694607263592,"score_gpt":0.2122039695495462,"score_spread":0.2011872749422826,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2025873721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.79084843,0.00004178913,0.016289994,0.0005604159,0.0002635823,0.00022085254,2.731267e-7,0.00037152748,0.19140315],"genre_scores_gemma":[0.99275804,5.654456e-7,0.0001403151,0.0029648708,0.00042565318,0.000010421811,0.000009887694,0.000025551266,0.0036646773],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989864,0.000032998327,0.00024939512,0.00028289366,0.0001921027,0.00025620236],"domain_scores_gemma":[0.999341,0.00014044878,0.00012445224,0.00034461633,0.000039966115,0.000009495238],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007700529,0.00014788742,0.0002210557,0.0002811657,0.0000931336,0.00015237568,0.00021894935,0.00005451634,0.00015142874],"category_scores_gemma":[0.00019020613,0.00012715385,0.00006636308,0.00043172037,0.000018784569,0.00048404568,0.00009531168,0.00012589463,0.0008435323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005718648,0.000049111164,0.0041811313,0.00008518767,0.000022161275,0.000010078745,0.00002070345,0.40108606,0.000034571538,0.5917637,0.00210641,0.00058368547],"study_design_scores_gemma":[0.0015200797,0.000020946065,0.003081277,0.00028473683,0.00010648675,0.0000018013683,0.0006893573,0.71322745,0.0000140187685,0.07273707,0.20752527,0.00079150905],"about_ca_topic_score_codex":0.0003242233,"about_ca_topic_score_gemma":0.000126127,"teacher_disagreement_score":0.51902664,"about_ca_system_score_codex":0.00003086202,"about_ca_system_score_gemma":0.000002188546,"threshold_uncertainty_score":0.99993443},"labels":[],"label_agreement":null},{"id":"W2026226766","doi":"10.1007/s11134-008-9064-y","title":"Approximations for the M/GI/N+GI type call center","year":2008,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Queue; Poisson distribution; Laplace transform; Exponential function; Mathematics; Computer science; Server; Workload; Applied mathematics; Mathematical optimization; Mathematical analysis; Statistics; Computer network","score_opus":0.032543603438621865,"score_gpt":0.24316940184389127,"score_spread":0.2106257984052694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2026226766","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.26901394,0.003304064,0.6153734,0.0062669027,0.010925952,0.005695692,0.00004585358,0.0023988935,0.086975366],"genre_scores_gemma":[0.9914179,0.000009429678,0.00024342997,0.000503517,0.0016582668,0.00010440423,0.000031477637,0.00003628031,0.0059953025],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99906486,0.00001937866,0.0002732236,0.00021535411,0.00018712918,0.00024003665],"domain_scores_gemma":[0.9990028,0.00017790648,0.00020715123,0.0003596785,0.00024322755,0.000009204725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045270083,0.00013812551,0.00018754757,0.00011936153,0.0006579189,0.00014083316,0.00026849052,0.000054979693,0.00002986398],"category_scores_gemma":[0.00023944928,0.000098203505,0.000108849265,0.000413541,0.00005786755,0.00051798834,0.000060698145,0.000098815595,0.00026102838],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016444885,0.00023268115,0.013897704,0.0011572046,0.0005568159,0.000027155342,0.00082656543,0.07993958,0.0010004007,0.82474303,0.07551667,0.0019377301],"study_design_scores_gemma":[0.0005235324,0.000008913588,0.00038476638,0.00012025841,0.0001267232,0.000017421255,0.00049498404,0.24721417,0.000021610362,0.0024376723,0.7483267,0.00032323055],"about_ca_topic_score_codex":0.0003711297,"about_ca_topic_score_gemma":0.00003558574,"teacher_disagreement_score":0.8223054,"about_ca_system_score_codex":0.00003676558,"about_ca_system_score_gemma":0.000014017783,"threshold_uncertainty_score":0.50602466},"labels":[],"label_agreement":null},{"id":"W2027036374","doi":"10.1239/jap/1101840557","title":"Pair formation in a Markovian arrival process with two event labels","year":2004,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Markovian arrival process; Point process; Mathematics; Markov process; Event (particle physics); Process (computing); Poisson distribution; Cox process; Stochastic process; Compound Poisson process; Markov renewal process; Markov chain; Security token; Poisson point process; Rare events; Renewal theory; Time reversibility; Poisson process; Statistical physics; Statistics; Computer science; Variable-order Markov model; Markov model; Computer network","score_opus":0.009928139260193062,"score_gpt":0.2365557139333344,"score_spread":0.22662757467314135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027036374","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892301,0.000009188637,0.007723963,0.00074116606,0.00004492808,0.00031789803,4.1173374e-7,0.000028921637,0.0019034449],"genre_scores_gemma":[0.996518,7.32155e-7,0.002905726,0.00031910583,0.000220116,0.00001666052,0.0000023386583,0.000013202645,0.000004129354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986819,0.000012960537,0.0005821185,0.00016442504,0.0003485335,0.0002100587],"domain_scores_gemma":[0.9987752,0.000028343336,0.0007502553,0.00018570156,0.0002418811,0.00001864396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013588704,0.00014934891,0.0002956784,0.00022807778,0.00007516155,0.000071851915,0.00022342743,0.000038155602,0.000033206867],"category_scores_gemma":[0.00009067001,0.00011131737,0.00007601533,0.00066242326,0.00006122182,0.0013503619,0.000040265983,0.00026298832,0.000012177611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003788281,0.0012747492,0.01657553,0.0011219308,0.00011811884,0.00007012935,0.0012879578,0.8822112,0.0011719139,0.07851092,0.000031944903,0.013837319],"study_design_scores_gemma":[0.0034545877,0.00005180411,0.003452314,0.00020345778,0.000111209476,0.00002224862,0.00064777123,0.0016929838,0.001743242,0.9878405,0.0005092685,0.00027064246],"about_ca_topic_score_codex":0.000014128318,"about_ca_topic_score_gemma":0.00017421295,"teacher_disagreement_score":0.90932953,"about_ca_system_score_codex":0.00021121251,"about_ca_system_score_gemma":0.000048232137,"threshold_uncertainty_score":0.45393905},"labels":[],"label_agreement":null},{"id":"W2027306393","doi":"10.1007/s11134-009-9142-9","title":"Exact tail asymptotics in a priority queue—characterizations of the preemptive model","year":2009,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Mount Saint Vincent University","funders":"","keywords":"Mathematics; Queue; Poisson distribution; Queueing theory; Applied mathematics; Generating function; Exponential distribution; Exponential function; Computer science; Discrete mathematics; Mathematical analysis; Statistics","score_opus":0.012821262226837455,"score_gpt":0.23087476065904908,"score_spread":0.2180534984322116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027306393","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.966301,0.00008770175,0.023159027,0.00047513354,0.00032200312,0.00060141523,0.0000071161126,0.00013996987,0.008906599],"genre_scores_gemma":[0.9987896,0.0000032638457,0.00011990883,0.00022737784,0.00023090251,0.000012395581,0.000007670795,0.00001829445,0.0005905617],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871606,0.00005731074,0.00048162023,0.00025046556,0.0002572013,0.00023736764],"domain_scores_gemma":[0.99881554,0.000056157583,0.00049882784,0.00045796495,0.00016205657,0.000009465499],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005461684,0.00017060833,0.0003194861,0.00022053548,0.0001364638,0.00010848011,0.00036066526,0.00008096303,0.0000069758394],"category_scores_gemma":[0.00028423654,0.00013582582,0.0001099772,0.00086502224,0.000049424245,0.00083837303,0.00008542403,0.00017493802,0.000015320597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045988032,0.00021651854,0.029917344,0.00028082522,0.00005525478,0.00000552093,0.0006791026,0.58798265,0.010552171,0.36933827,0.000093112605,0.00083320343],"study_design_scores_gemma":[0.00039667156,0.000010184149,0.018715197,0.0006117249,0.00009819959,0.0000017023411,0.00038784777,0.96231264,0.00020943918,0.016240243,0.0006986643,0.00031748696],"about_ca_topic_score_codex":0.00037012494,"about_ca_topic_score_gemma":0.00009175715,"teacher_disagreement_score":0.37432995,"about_ca_system_score_codex":0.000082350496,"about_ca_system_score_gemma":0.000037070713,"threshold_uncertainty_score":0.55388165},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.011855285323393652,"score_gpt":0.24440230261748963,"score_spread":0.232547017294096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027355210","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9544421,0.0012915172,0.01220201,0.0027234268,0.00024075177,0.002143738,0.000008051971,0.00018469193,0.026763747],"genre_scores_gemma":[0.99501497,0.00020155219,0.0031900108,0.0011852931,0.0001251836,0.00018097123,0.000046385616,0.000026211628,0.000029408915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981377,0.00005199353,0.00046870575,0.00047820312,0.00042462404,0.00043878492],"domain_scores_gemma":[0.99839145,0.00056903186,0.00026931803,0.0006266269,0.0001332369,0.000010362604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017737966,0.00025957183,0.0002529697,0.000093980445,0.00036008167,0.00020891243,0.0006063315,0.000054141205,0.00002504179],"category_scores_gemma":[0.00012677896,0.0001545981,0.00003782469,0.0013963622,0.0004895291,0.0011220322,0.00011150142,0.0003575053,0.000055676683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004684665,0.00019324881,0.008546988,0.000112545764,0.000015625308,0.000007882688,0.00023577122,0.33737424,0.00001567454,0.64806473,0.00001614946,0.0049487054],"study_design_scores_gemma":[0.0008056418,0.000022909364,0.0048094774,0.000039546776,0.000030774187,0.0000015397887,0.0029663714,0.0014821186,0.000020473759,0.95337766,0.03616677,0.0002767146],"about_ca_topic_score_codex":0.00018145918,"about_ca_topic_score_gemma":0.006011673,"teacher_disagreement_score":0.3358921,"about_ca_system_score_codex":0.00023507352,"about_ca_system_score_gemma":0.000060968723,"threshold_uncertainty_score":0.6304328},"labels":[],"label_agreement":null},{"id":"W2027801241","doi":"10.1145/502109.502112","title":"Fast simulation of broadband telecommunications networks carrying long-range dependent bursty traffic","year":2001,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Burstiness; Computer science; Broadband; Range (aeronautics); Sampling (signal processing); Noise (video); Broadband networks; Importance sampling; Algorithm; Telecommunications; Monte Carlo method; Mathematics; Computer network; Statistics; Engineering; Artificial intelligence","score_opus":0.027121675956178388,"score_gpt":0.26101102967122547,"score_spread":0.23388935371504707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2027801241","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33964467,0.00007267985,0.65986663,0.00006930758,0.000083850144,0.000121517915,0.0000010106044,0.00010408008,0.00003625905],"genre_scores_gemma":[0.99624,0.00005409228,0.0032381348,0.00014476688,0.00023023944,0.000009510182,0.000033449254,0.000027254868,0.000022513732],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99888694,0.00003674829,0.00039871872,0.00030223263,0.00018819206,0.00018718532],"domain_scores_gemma":[0.99883103,0.0002538218,0.00017597842,0.00052388,0.0001966721,0.000018603629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024597795,0.00018613599,0.00022207474,0.0003359039,0.00045951488,0.00011471916,0.00022241205,0.000096299285,0.00002390219],"category_scores_gemma":[0.000017152312,0.00019768908,0.00010655818,0.0004279771,0.000032743617,0.00077005423,0.00002077525,0.00020494571,0.0000055537075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000071113594,0.000087602355,0.0004401591,0.00001979665,0.00004231756,6.836321e-7,0.00009209349,0.8939211,0.000002320715,0.000056308087,2.7723863e-7,0.10526626],"study_design_scores_gemma":[0.00050732703,0.000016962034,0.00028146958,0.00006889062,0.00015361232,0.0000015962524,0.000047272897,0.9976282,0.000001172893,0.0010711597,0.000031981075,0.00019036618],"about_ca_topic_score_codex":0.00007037364,"about_ca_topic_score_gemma":0.00010014009,"teacher_disagreement_score":0.6566285,"about_ca_system_score_codex":0.000033732842,"about_ca_system_score_gemma":0.00000622863,"threshold_uncertainty_score":0.80615264},"labels":[],"label_agreement":null},{"id":"W2028006146","doi":"10.1504/ijams.2011.041320","title":"A note on a bulk arrivals quorum queuing system with an unreliable server","year":2011,"lang":"en","type":"article","venue":"International Journal of Applied Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Dalhousie University","funders":"","keywords":"Computer science; Service (business); Queueing theory; Function (biology); Work (physics); Operations research; Value (mathematics); Queueing system; Server; Epoch (astronomy); Mathematical optimization; Computer network; Distributed computing; Mathematics; Business","score_opus":0.015042307311941765,"score_gpt":0.24247808586876315,"score_spread":0.2274357785568214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028006146","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44559512,0.000009853595,0.07545682,0.00059660757,0.001846282,0.00045776297,0.0000017641825,0.00020254162,0.47583324],"genre_scores_gemma":[0.99014866,0.000003442055,0.00818307,0.0010772485,0.00041836762,0.000008817604,0.0000014121403,0.000020771482,0.00013820628],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99746764,0.000007127416,0.0004438508,0.00035792036,0.0014141946,0.00030927898],"domain_scores_gemma":[0.9982845,0.000025870191,0.000820581,0.0003234206,0.00050446886,0.000041138494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016888939,0.00019065797,0.00022260626,0.0011081088,0.00021287301,0.00038075773,0.0016960815,0.00002518095,0.000094404524],"category_scores_gemma":[0.000032212087,0.00014792221,0.00007187052,0.00083525805,0.00019236989,0.0023427368,0.00028337908,0.00015923035,0.00012323409],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00092229835,0.00017604593,0.00023890541,0.000047295795,0.00014623257,0.00021831036,0.00017615558,0.028385933,0.00066376495,0.964872,0.000076199954,0.004076844],"study_design_scores_gemma":[0.023363013,0.0018790103,0.02524197,0.009258868,0.0032094368,0.0005109299,0.04138251,0.27359205,0.033794142,0.47444236,0.10613805,0.0071876417],"about_ca_topic_score_codex":0.000050270923,"about_ca_topic_score_gemma":0.000014982534,"teacher_disagreement_score":0.5445535,"about_ca_system_score_codex":0.00022531055,"about_ca_system_score_gemma":0.00002864144,"threshold_uncertainty_score":0.60320926},"labels":[],"label_agreement":null},{"id":"W2028798402","doi":"10.1023/b:ques.0000032798.65858.19","title":"A MAP/G/1 Queue with Negative Customers","year":2004,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":50,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Mitacs","keywords":"Markov chain; Burke's theorem; Queue; Bulk queue; Mathematics; Laplace transform; Applied mathematics; Stationary distribution; Computer science; Boundary (topology); Mathematical optimization; Mathematical analysis; Queue management system; Fork–join queue; Statistics; Computer network","score_opus":0.008477706350612917,"score_gpt":0.21112605719643304,"score_spread":0.2026483508458201,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2028798402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7662004,0.00076185947,0.060199857,0.0028052304,0.002550484,0.0020037573,0.000008939257,0.0028045918,0.16266485],"genre_scores_gemma":[0.99681383,0.000001549714,0.00039177394,0.0004950807,0.0009538984,0.000057858484,0.000010248667,0.00006091918,0.0012148169],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855846,0.000023710707,0.0003025035,0.00040284696,0.00032499502,0.00038749352],"domain_scores_gemma":[0.9990204,0.0000563198,0.0003393587,0.0003788115,0.0001833942,0.000021714555],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003945309,0.00026294246,0.00034740084,0.00032948822,0.0002695903,0.0003154653,0.0002686417,0.00007059353,0.00004006372],"category_scores_gemma":[0.000079580896,0.00021347383,0.00008463802,0.0006988095,0.00010481634,0.001269285,0.00006945068,0.00017970106,0.0011613532],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001463585,0.00008546024,0.0019996983,0.0005247716,0.00027922128,0.00018440906,0.0004793323,0.33268812,0.0006242833,0.6619358,0.0004875752,0.0005649464],"study_design_scores_gemma":[0.019265391,0.00038379867,0.0021933124,0.010013751,0.0025872963,0.00025606187,0.044424575,0.072986014,0.0028057913,0.17758016,0.65800804,0.009495818],"about_ca_topic_score_codex":0.0037852526,"about_ca_topic_score_gemma":0.00029450757,"teacher_disagreement_score":0.6575205,"about_ca_system_score_codex":0.000159423,"about_ca_system_score_gemma":0.000036937214,"threshold_uncertainty_score":0.9996164},"labels":[],"label_agreement":null},{"id":"W2029358090","doi":"10.1007/s10288-008-0088-2","title":"Analysis of stationary discrete-time GI/D-MSP/1 queue with finite and infinite buffers","year":2008,"lang":"en","type":"article","venue":"4OR","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Markovian arrival process; Markov chain; Discrete time and continuous time; Queue; Computer science; Epoch (astronomy); Queueing theory; Renewal theory; Applied mathematics; Markov process; Bulk queue; Mathematics; Mathematical optimization; Statistics; Computer network","score_opus":0.00906742964980874,"score_gpt":0.2118071467518994,"score_spread":0.20273971710209066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2029358090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9856413,0.00008367349,0.008134868,0.00025480086,0.000017724518,0.00011145962,0.000022799864,0.00008560127,0.005647798],"genre_scores_gemma":[0.99736756,0.000019780744,0.0009323611,0.00043311485,0.00007457245,0.000008035579,0.00015424602,0.000019417448,0.0009909366],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991444,0.000015978234,0.00023237513,0.00024183362,0.00020523291,0.00016019944],"domain_scores_gemma":[0.9991939,0.00017379527,0.00024752857,0.00024139414,0.0001289912,0.000014361133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016310182,0.00014567345,0.0003352836,0.00062719604,0.00014770965,0.0000306987,0.00011459193,0.000034753255,0.00040597402],"category_scores_gemma":[0.00012694664,0.00011999941,0.00008976056,0.0016001363,0.00017690555,0.0006951517,0.000069510264,0.00006952158,0.00005052906],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010665273,0.00027156042,0.65986085,0.00032447348,0.006266734,0.00017589529,0.0011203235,0.2967065,0.0015752922,0.025072314,0.00085033267,0.0067092055],"study_design_scores_gemma":[0.0022137784,0.00011106943,0.34660986,0.00014663413,0.008773718,0.000007810425,0.0009735983,0.6120622,0.00021213814,0.00803138,0.01947117,0.0013866657],"about_ca_topic_score_codex":0.000171409,"about_ca_topic_score_gemma":0.00006208266,"teacher_disagreement_score":0.3153557,"about_ca_system_score_codex":0.000011232805,"about_ca_system_score_gemma":0.000012192899,"threshold_uncertainty_score":0.4893434},"labels":[],"label_agreement":null},{"id":"W2031153066","doi":"10.1287/mnsc.1110.1438","title":"Cutting in Line: Social Norms in Queues","year":2011,"lang":"en","type":"article","venue":"Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Excuse; Queue; Business; Norm (philosophy); Line (geometry); Tel aviv; Computer science; Operations research; Marketing; Microeconomics; Operations management; Law and economics; Economics; Law; Political science; Mathematics","score_opus":0.028015497217833075,"score_gpt":0.2539607059684857,"score_spread":0.2259452087506526,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031153066","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7064939,0.000012327898,0.0012847229,0.00029027584,0.00018701328,0.00022653448,1.6595969e-7,0.00012281982,0.29138225],"genre_scores_gemma":[0.9975474,0.0000037407845,0.001115617,0.00077227206,0.00013364502,0.000021913254,0.0000011906835,0.00001127678,0.00039297892],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9984359,0.0000096158565,0.00029027896,0.00045109278,0.0003454241,0.00046770248],"domain_scores_gemma":[0.99957216,0.000012072977,0.0001432798,0.00022381911,0.00003974171,0.000008907837],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017248332,0.00013613967,0.00015890613,0.0011748233,0.00023055857,0.0001440653,0.0007199428,0.000024735076,0.00013700634],"category_scores_gemma":[0.00009616412,0.00013064816,0.000040777486,0.0034455317,0.00024730503,0.0020975536,0.0005625633,0.000118115764,0.00021288892],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005331534,0.00027520428,0.12361186,0.00017581854,0.000013315139,0.00015994893,0.0011393265,0.0020942583,0.0003263139,0.8273477,0.00010905349,0.04469389],"study_design_scores_gemma":[0.0019728732,0.000022197692,0.5421361,0.00030194077,0.00009608793,0.0000011425412,0.009150565,0.09185831,0.0006687818,0.34102958,0.011283369,0.0014790617],"about_ca_topic_score_codex":0.00045929567,"about_ca_topic_score_gemma":0.00036892158,"teacher_disagreement_score":0.4863181,"about_ca_system_score_codex":0.0000910336,"about_ca_system_score_gemma":0.000006640625,"threshold_uncertainty_score":0.5327677},"labels":[],"label_agreement":null},{"id":"W2031604190","doi":"10.1239/jap/1034082123","title":"Discrete time analysis of a repairable machine","year":2002,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Computer science; Mean time between failures; Machine tool; Mathematics; Algorithm; Reliability engineering; Failure rate; Statistics; Engineering; Mechanical engineering","score_opus":0.012900068427511928,"score_gpt":0.21332435608959796,"score_spread":0.20042428766208603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2031604190","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9453519,0.00016650552,0.002622028,0.00053715723,0.0000676518,0.0002489185,0.000007958843,0.0000686208,0.050929286],"genre_scores_gemma":[0.9964171,0.000006088832,0.003005534,0.0001918461,0.00017233606,0.0000029653736,0.0000055210203,0.000013966016,0.00018463218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982977,0.000022747463,0.0008824984,0.0002186663,0.0003836053,0.00019481572],"domain_scores_gemma":[0.99776614,0.00011511279,0.0013550746,0.00045068443,0.00029158557,0.00002142322],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001710006,0.0001616364,0.0007292143,0.00058215746,0.000082348946,0.000047259506,0.0003383682,0.000057043297,0.0024285724],"category_scores_gemma":[0.0002661769,0.00012760887,0.00053185865,0.0020691226,0.000113594804,0.00053750805,0.0001032784,0.00020926529,0.00005967656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038896129,0.0034365845,0.056663055,0.0012988406,0.016619716,0.00006466467,0.00094695605,0.711619,0.017711485,0.14888355,0.004996128,0.033870373],"study_design_scores_gemma":[0.0016086543,0.00008014249,0.0053978255,0.000069143,0.012340524,0.0000054863244,0.00013156088,0.6202035,0.0008335059,0.34375045,0.014892409,0.0006867907],"about_ca_topic_score_codex":0.000018568227,"about_ca_topic_score_gemma":0.000015887072,"teacher_disagreement_score":0.1948669,"about_ca_system_score_codex":0.00005781042,"about_ca_system_score_gemma":0.0000074892646,"threshold_uncertainty_score":0.99848336},"labels":[],"label_agreement":null},{"id":"W2032400268","doi":"10.1007/s11134-005-3749-2","title":"Proof of Monotone Loss Rate of Fluid Priority-Queue with Finite Buffer","year":2005,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Queueing theory; Fluid queue; Computer science; Monotone polygon; Queue; Mathematics; Computer network","score_opus":0.008889409263705112,"score_gpt":0.21831244655032703,"score_spread":0.20942303728662193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2032400268","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93756926,0.0004661703,0.05552711,0.00027626954,0.00032225583,0.000713642,0.0000069648677,0.00017101206,0.004947295],"genre_scores_gemma":[0.99722344,0.0000036096692,0.0006958592,0.00010636819,0.00094787544,0.0000339695,0.000011714097,0.000048822774,0.000928363],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983802,0.00006240122,0.0006615484,0.00033373997,0.00027039196,0.00029174582],"domain_scores_gemma":[0.998148,0.00014038642,0.0007860075,0.0005307029,0.0003783241,0.000016574459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097351824,0.00024345073,0.0005998314,0.00032460582,0.000093201685,0.00007017336,0.00030357612,0.00008447193,0.000039248844],"category_scores_gemma":[0.00016912498,0.00020167089,0.00010963669,0.0006945098,0.00012490033,0.0009655462,0.000091862996,0.00013381027,0.000039866944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00071096304,0.0004251494,0.01777024,0.004197247,0.00065329706,0.000048964597,0.0005944593,0.77845675,0.019557122,0.17386311,0.00042830076,0.003294426],"study_design_scores_gemma":[0.0044708704,0.00021189118,0.0015080746,0.004615644,0.0011694115,0.000023427641,0.0012655356,0.84299105,0.049884487,0.007890339,0.08389825,0.0020709932],"about_ca_topic_score_codex":0.000780846,"about_ca_topic_score_gemma":0.00008215861,"teacher_disagreement_score":0.16597277,"about_ca_system_score_codex":0.00004535906,"about_ca_system_score_gemma":0.000028630702,"threshold_uncertainty_score":0.82239},"labels":[],"label_agreement":null},{"id":"W2033062008","doi":"10.1155/2009/716364","title":"Computational Procedures for a Class of GI/D/<i>k</i> Systems in Discrete Time","year":2009,"lang":"en","type":"article","venue":"Journal of Probability and Statistics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"FIFO (computing and electronics); Computation; Mathematics; Queue; Markov chain; Discrete time and continuous time; Class (philosophy); Simple (philosophy); Matrix (chemical analysis); Constant (computer programming); Server; Mathematical optimization; Discrete mathematics; Computer science; Algorithm; Computer network","score_opus":0.01265203508104475,"score_gpt":0.2537355308062978,"score_spread":0.24108349572525303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2033062008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17341961,0.00028035164,0.82444364,0.0009065438,0.00010114212,0.00048024382,0.000088546905,0.000012462198,0.00026749013],"genre_scores_gemma":[0.9170702,0.0000049111977,0.0825712,0.00015044068,0.00014536928,0.0000022724157,0.000012166524,0.0000056015538,0.000037824328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99906135,0.000021199172,0.00055574847,0.000092915056,0.00016645493,0.000102311256],"domain_scores_gemma":[0.9986727,0.00025767897,0.00057498214,0.000058814232,0.000424753,0.00001106379],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00083344063,0.00008105038,0.00029542504,0.00013111997,0.0000435357,0.000051211202,0.00008637476,0.000031387874,0.000006402533],"category_scores_gemma":[0.0009925773,0.00006706052,0.00004606304,0.00015666403,0.00006690389,0.00034442882,0.000014448671,0.000082664905,7.670176e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00044647377,0.0001876362,0.0024588294,0.0010366387,0.000042310654,0.000006192349,0.00008949179,0.15783386,0.00017575384,0.8341681,0.0009226453,0.002632073],"study_design_scores_gemma":[0.0005694672,0.000082281076,0.0036367325,0.00013314985,0.00007547847,0.0000058928035,0.000061909355,0.19940272,0.0000036671424,0.7953245,0.0006204782,0.000083736595],"about_ca_topic_score_codex":0.000007958413,"about_ca_topic_score_gemma":0.0000127103895,"teacher_disagreement_score":0.7436506,"about_ca_system_score_codex":0.00002520182,"about_ca_system_score_gemma":0.000041069965,"threshold_uncertainty_score":0.2734649},"labels":[],"label_agreement":null},{"id":"W2034791268","doi":"10.1145/2591971.2592015","title":"Randomized routing schemes for large processor sharing systems with multiple service rates","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Server; Computer science; Routing (electronic design automation); Distributed computing; Processor sharing; Scheme (mathematics); Exponential distribution; Randomized algorithm; Computer network; Mathematics; Algorithm; Queueing theory; Statistics","score_opus":0.014430806023707554,"score_gpt":0.24303106263267182,"score_spread":0.22860025660896427,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2034791268","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1529191,0.000075386284,0.83677644,0.0007973409,0.00015317177,0.0016419817,0.0000028947068,0.00074406737,0.0068895896],"genre_scores_gemma":[0.9942909,6.2097325e-7,0.0024091664,0.0011205734,0.0006310046,0.00030571554,0.000051923245,0.000051562525,0.0011385359],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867564,0.000020563508,0.0003548679,0.00039947787,0.00016447969,0.0003849647],"domain_scores_gemma":[0.9983635,0.0005217732,0.00037873356,0.00026868802,0.00045441661,0.0000128849515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002031068,0.00022382042,0.0005739038,0.00014384702,0.00035255382,0.00042203406,0.00028631816,0.000048991427,0.000034825927],"category_scores_gemma":[0.0012568223,0.00015507375,0.00010495141,0.00048035372,0.000021302227,0.0011448761,0.00013420361,0.00007742626,0.000062139356],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.022733353,0.00012144586,0.014738574,0.0026289348,0.00047079686,0.0000013630201,0.0001313427,0.017445717,0.0004088394,0.94072735,0.00015727279,0.00043501824],"study_design_scores_gemma":[0.05846724,0.000003439207,0.000007062051,0.0001633876,0.0002235284,5.114049e-7,0.00044073275,0.9243161,0.00019388339,0.0044298805,0.011474982,0.00027925553],"about_ca_topic_score_codex":0.00020986224,"about_ca_topic_score_gemma":0.00024407523,"teacher_disagreement_score":0.9362975,"about_ca_system_score_codex":0.00001497624,"about_ca_system_score_gemma":0.0000067618494,"threshold_uncertainty_score":0.63237244},"labels":[],"label_agreement":null},{"id":"W2035226066","doi":"10.1016/j.apm.2012.01.049","title":"Stationary analysis of a discrete-time GI/D-MSP/1 queue with multiple vacations","year":2012,"lang":"en","type":"article","venue":"Applied Mathematical Modelling","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Markovian arrival process; Computer science; Real-time computing; Epoch (astronomy); Discrete time and continuous time; Queue; Markov chain; Markov process; Service (business); Queueing theory; Process (computing); Mathematical optimization; Mathematics; Computer network; Statistics; Operating system","score_opus":0.017478291882013244,"score_gpt":0.23240872574117907,"score_spread":0.21493043385916583,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035226066","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12202896,0.000026928554,0.8684961,0.00006122425,0.000007074726,0.00021996893,0.000006236112,0.00010503248,0.009048436],"genre_scores_gemma":[0.932348,0.000002160311,0.06711188,0.000115009316,0.00011384111,0.00006857049,0.00010846486,0.00003586499,0.0000961769],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986604,0.000009970685,0.00044310302,0.00024228415,0.0003211444,0.00032308977],"domain_scores_gemma":[0.9987038,0.00044458674,0.00031641673,0.00038993798,0.00011399757,0.000031302556],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045182975,0.00019834458,0.00048155818,0.0004589578,0.00014511641,0.00004480258,0.00018976412,0.000057057223,0.00045975499],"category_scores_gemma":[0.0000647271,0.00016063092,0.00014173308,0.001450154,0.00009081227,0.00064524275,0.000078814635,0.0001090881,0.00025969985],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000037909627,0.00016324,0.00034977138,0.00009179381,0.00048823268,2.734262e-7,0.00018248206,0.5279515,0.0004358715,0.4700773,0.000009301202,0.00021236595],"study_design_scores_gemma":[0.00017268633,0.0000024263927,0.000061257786,0.000025036932,0.0020626895,2.5417714e-7,0.0002559989,0.8871056,0.00012087725,0.109878205,0.00011166072,0.00020331475],"about_ca_topic_score_codex":0.000021483542,"about_ca_topic_score_gemma":0.000004278304,"teacher_disagreement_score":0.81031907,"about_ca_system_score_codex":0.000024677129,"about_ca_system_score_gemma":0.000008495545,"threshold_uncertainty_score":0.6550339},"labels":[],"label_agreement":null},{"id":"W2035324714","doi":"10.1016/j.apm.2014.11.059","title":"Performance evaluation of a multi-product production line: An approximation method","year":2014,"lang":"en","type":"article","venue":"Applied Mathematical Modelling","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Production line; Measure (data warehouse); Product (mathematics); Queueing theory; Workstation; Blocking (statistics); Decomposition; Computer science; Production (economics); Mathematical optimization; Product type; Line (geometry); Algorithm; Applied mathematics; Mathematics; Engineering; Data mining","score_opus":0.07505049279613615,"score_gpt":0.3098091695851315,"score_spread":0.23475867678899534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035324714","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2619385,0.000008819077,0.7349705,0.000041428888,0.00003738539,0.00040919305,1.2293027e-7,0.00010312037,0.0024909177],"genre_scores_gemma":[0.73895025,0.0000019831705,0.26049024,0.00003521047,0.00038412295,0.00008005074,0.000016704398,0.00002654769,0.000014877092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983236,0.000046421566,0.00047801563,0.00042156977,0.00053497497,0.00019537918],"domain_scores_gemma":[0.99864376,0.00007006842,0.00037451854,0.00049370667,0.00040451027,0.000013456639],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005204829,0.00017606335,0.000304852,0.00020262902,0.00013702575,0.00004775223,0.00017548563,0.00005526367,0.0000517768],"category_scores_gemma":[0.0003925412,0.0001593433,0.000056856803,0.00042253075,0.000046335943,0.000821482,0.00005142252,0.00012141904,0.00008389138],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023676594,0.0001424349,0.0000039183055,0.00030855217,0.000014568895,1.34687665e-8,0.000102967395,0.7888187,0.005539006,0.12440459,0.0000010507973,0.08064051],"study_design_scores_gemma":[0.00022323096,0.0000048061806,0.0000035698688,0.000042173015,0.00024171594,4.3603984e-7,0.00006973602,0.774117,0.0062792096,0.21885827,0.000020080315,0.00013976493],"about_ca_topic_score_codex":0.000004690101,"about_ca_topic_score_gemma":0.000001017533,"teacher_disagreement_score":0.47701174,"about_ca_system_score_codex":0.000030802214,"about_ca_system_score_gemma":0.000009788591,"threshold_uncertainty_score":0.6497831},"labels":[],"label_agreement":null},{"id":"W2035381730","doi":"10.1017/s0269964807000319","title":"A BAYESIAN APPROACH TO FIND RANDOM-TIME PROBABILITIES FROM EMBEDDED MARKOV CHAIN PROBABILITIES","year":2007,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Markov renewal process; Variable-order Markov model; Markov property; Examples of Markov chains; Computer science; Uniformization (probability theory); Markov chain mixing time; Additive Markov chain; Chain rule (probability); Mathematics; Applied mathematics; Queueing theory; Algorithm; Markov model; Bayesian probability; Law of total probability; Posterior probability; Statistics","score_opus":0.010180313568437542,"score_gpt":0.20397603222117158,"score_spread":0.19379571865273404,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035381730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.974266,0.000049861992,0.00929899,0.0008705142,0.00007909169,0.00092380174,0.000007594696,0.0001345012,0.014369624],"genre_scores_gemma":[0.99123615,0.0000010691683,0.007802277,0.0005353708,0.00022237479,0.00011924248,0.000023475966,0.000006993766,0.00005302604],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983146,0.000027887607,0.0005158763,0.00028634528,0.00046880243,0.00038644002],"domain_scores_gemma":[0.9988915,0.000665966,0.0001122375,0.00022261421,0.000083101615,0.0000245898],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0060005127,0.00020056398,0.0002350358,0.00030917212,0.0002861404,0.00035207387,0.00047157292,0.000053848365,0.000039459763],"category_scores_gemma":[0.0014696354,0.0001399092,0.00006333386,0.0009965986,0.0002713506,0.0017355842,0.00013512328,0.00015594113,0.000021319633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001264265,0.000113851245,0.0011489673,0.0003133422,0.000019790916,3.9805187e-7,0.0064499397,0.86407864,0.0000999742,0.12460766,0.00008719279,0.0029538278],"study_design_scores_gemma":[0.0003978179,0.000019610672,0.0032304714,0.0000613592,0.000015904396,0.0000029507664,0.0025665488,0.85471,0.000025305055,0.13738236,0.0012671449,0.00032055852],"about_ca_topic_score_codex":0.00013516998,"about_ca_topic_score_gemma":0.000025736586,"teacher_disagreement_score":0.016970148,"about_ca_system_score_codex":0.000061168954,"about_ca_system_score_gemma":0.000026349837,"threshold_uncertainty_score":0.57053316},"labels":[],"label_agreement":null},{"id":"W2035906079","doi":"10.1080/07408170304360","title":"Approximating Performance Measures for a Network of Unreliable Machines","year":2003,"lang":"en","type":"article","venue":"IIE Transactions","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Downtime; Queue; Service (business); Computer science; Center (category theory); Operations research; Reliability engineering; Engineering; Computer network; Economics","score_opus":0.01775968097802655,"score_gpt":0.22839041686639497,"score_spread":0.21063073588836842,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2035906079","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0292409,0.00010817976,0.96141547,0.000084577136,0.00024104664,0.00021842115,0.0000028658214,0.00010901337,0.008579521],"genre_scores_gemma":[0.9832907,0.000008627379,0.01579538,0.00012686838,0.00017142671,0.00006634553,0.0000050254826,0.000023683575,0.00051199907],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925786,0.000009926119,0.00026008973,0.00015303801,0.00010326344,0.0002158344],"domain_scores_gemma":[0.9994289,0.000097273274,0.0001537552,0.00016708161,0.00014572401,0.000007255672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046801957,0.00011302494,0.00018841896,0.00008055657,0.00034603168,0.000034103105,0.000100753714,0.000035897352,0.00016526176],"category_scores_gemma":[0.000102541766,0.00010714813,0.00012587757,0.00051535974,0.00003994421,0.00056977395,0.0000027151516,0.000078910205,0.000012659254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000095690055,0.00010915423,0.0011594321,0.00043704145,0.00013654726,3.0137252e-7,0.000059396294,0.918763,0.0008991317,0.047881518,0.00021667121,0.030242123],"study_design_scores_gemma":[0.0017350181,0.000042239702,0.0003324862,0.00030658985,0.0010843746,0.000005372468,0.00040390823,0.72886455,0.0036143127,0.121536836,0.14126924,0.0008050976],"about_ca_topic_score_codex":0.00003371298,"about_ca_topic_score_gemma":0.00004544759,"teacher_disagreement_score":0.95404977,"about_ca_system_score_codex":0.00001374742,"about_ca_system_score_gemma":0.000012382548,"threshold_uncertainty_score":0.4369374},"labels":[],"label_agreement":null},{"id":"W2036223399","doi":"10.1016/s0167-6377(02)00178-5","title":"A mountain process with state dependent input and output and a correlated dam","year":2002,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Outflow; Generalization; Equivalence (formal languages); Production (economics); Process (computing); Work (physics); Production rate; State (computer science); State dependent; Work in process; Mathematics; Constant (computer programming); Computer science; Mathematical economics; Economics; Operations management; Thermodynamics; Engineering; Mathematical analysis; Algorithm; Discrete mathematics; Process engineering; Physics","score_opus":0.03403268896689165,"score_gpt":0.2893857000473459,"score_spread":0.2553530110804542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2036223399","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98720086,0.00006962484,0.005590017,0.0058150114,0.000012429022,0.0003178785,0.0000021207732,0.000053456155,0.00093863346],"genre_scores_gemma":[0.9967796,0.000021668002,0.0002902642,0.0016141948,0.00008111382,0.000050775016,0.000012430256,0.00002206808,0.0011278422],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987664,0.000044036395,0.00014976533,0.00031454646,0.0003955912,0.0003296649],"domain_scores_gemma":[0.99944365,0.000070391856,0.000025551077,0.00018489549,0.00024807535,0.00002744292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077659,0.000117471536,0.0001196794,0.0004949979,0.0006003838,0.0006438868,0.00012423062,0.00002775321,0.00007771057],"category_scores_gemma":[0.00018831299,0.00009604184,0.000011227186,0.0007564725,0.00024211165,0.0011764382,0.00011321615,0.0002981356,0.00007071331],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010007777,0.0008865999,0.0778223,0.0009855933,0.00095006154,0.0011986621,0.009173126,0.7730409,0.025128407,0.029918369,0.009976735,0.06991845],"study_design_scores_gemma":[0.0018254931,0.00006490705,0.0019276248,0.00013737306,0.00008148813,0.000029702178,0.001974425,0.98617595,0.0002762785,0.0011119948,0.0058210217,0.0005737207],"about_ca_topic_score_codex":0.0003333348,"about_ca_topic_score_gemma":0.00076232705,"teacher_disagreement_score":0.21313506,"about_ca_system_score_codex":0.00003806467,"about_ca_system_score_gemma":0.0000093523195,"threshold_uncertainty_score":0.6209015},"labels":[],"label_agreement":null},{"id":"W2037342652","doi":"10.1007/s11134-011-9258-6","title":"Dynamic server allocation for unstable queueing networks with flexible servers","year":2011,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Throughput; Computer science; Server; Queueing theory; Layered queueing network; Mathematical optimization; Computer network; Real-time computing; Distributed computing; Mathematics; Wireless; Telecommunications","score_opus":0.018973961361943285,"score_gpt":0.2165737138524776,"score_spread":0.1975997524905343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2037342652","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2603448,0.00060491334,0.7152056,0.00014449513,0.0013678786,0.0017107176,0.0000036126307,0.0013976982,0.019220255],"genre_scores_gemma":[0.9946168,0.000005048823,0.001615463,0.00026180936,0.00041261205,0.00016765954,0.0000638419,0.00010050933,0.0027562447],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982986,0.00003308835,0.00042377968,0.0004917035,0.0002301679,0.00052268617],"domain_scores_gemma":[0.9986101,0.00007018378,0.00048078143,0.00050541095,0.00030861926,0.00002494098],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008983808,0.00029885548,0.0003815477,0.0002763029,0.00038501265,0.00028737893,0.00034429878,0.00011760624,0.000049289654],"category_scores_gemma":[0.000052504627,0.000268159,0.00011500986,0.00075596076,0.0000521057,0.002004938,0.00007520164,0.00014216118,0.00006940111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004366771,0.00011514491,0.013351401,0.0013976782,0.00043675414,0.000018930266,0.0003596238,0.7071667,0.0003449885,0.27471438,0.00053905183,0.0011187048],"study_design_scores_gemma":[0.0009459064,0.000041456795,0.0007194254,0.00071976107,0.00034515146,0.0000067411684,0.001553566,0.9813622,0.00009142414,0.0035306953,0.009956657,0.000727005],"about_ca_topic_score_codex":0.003493912,"about_ca_topic_score_gemma":0.0006212979,"teacher_disagreement_score":0.734272,"about_ca_system_score_codex":0.00013105867,"about_ca_system_score_gemma":0.000027090957,"threshold_uncertainty_score":0.99997705},"labels":[],"label_agreement":null},{"id":"W2038261056","doi":"10.1016/j.cor.2004.11.015","title":"Capacity improvement of an unreliable production line—an analytical approach","year":2004,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Downtime; Computer science; Production line; Production (economics); Product (mathematics); Sequence (biology); Mathematical optimization; Process (computing); Unavailability; Heuristic; Line (geometry); Reliability engineering; Workstation; Algorithm; Mathematics; Engineering","score_opus":0.09104954014719006,"score_gpt":0.3508131759369289,"score_spread":0.2597636357897388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038261056","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8159813,0.000008634759,0.18159841,0.0008038769,0.00015179723,0.00042684565,0.0000016318193,0.000083903695,0.00094354525],"genre_scores_gemma":[0.97433764,0.0000026271307,0.024322886,0.00012567232,0.000862256,0.000043034684,0.00009461524,0.000020997368,0.00019025369],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982272,0.000060328668,0.0003233086,0.0004998386,0.00054488576,0.00034445236],"domain_scores_gemma":[0.99829143,0.00002569738,0.00004215697,0.00065517536,0.00094715384,0.000038374077],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017661304,0.00013187053,0.00020001215,0.0005968986,0.0005593079,0.00031865438,0.00043295426,0.00005781228,0.000037538754],"category_scores_gemma":[0.00027388518,0.00012321366,0.000059295406,0.0014532639,0.00024309049,0.002015642,0.00020546568,0.0003091145,0.000046852387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029096485,0.0006996889,0.00005468383,0.00005854538,0.0000336241,0.0000015496267,0.00012267538,0.90035003,0.0064830915,0.08677472,0.000069230715,0.0053230682],"study_design_scores_gemma":[0.0004202438,0.00013349949,0.0001903387,0.000033286746,0.0000360501,0.00000189753,0.0004478889,0.9840991,0.0042284257,0.009656096,0.0005627419,0.00019042342],"about_ca_topic_score_codex":0.0014620399,"about_ca_topic_score_gemma":0.00029128976,"teacher_disagreement_score":0.15835631,"about_ca_system_score_codex":0.00013395835,"about_ca_system_score_gemma":0.0000725476,"threshold_uncertainty_score":0.5024507},"labels":[],"label_agreement":null},{"id":"W2038867491","doi":"10.1080/07362990902844157","title":"Finite-Buffer Bulk Service Queue Under Markovian Service Process: <i>GI</i> / <i>MSP</i> <sup> ( <i>a</i> , <i>b</i> ) </sup> /1/ <i>N</i>","year":2009,"lang":"he","type":"article","venue":"Stochastic Analysis and Applications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Queue; Service (business); Computer science; Queueing theory; Markov process; Operations research; Markov chain; Computer network; Mathematics; Statistics; Business","score_opus":0.008963141219390833,"score_gpt":0.23802180769653739,"score_spread":0.22905866647714657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2038867491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0119513245,0.0028258883,0.9439613,0.028317727,0.000086869615,0.0023493858,0.00031530738,0.0007053145,0.009486865],"genre_scores_gemma":[0.925039,0.0001934261,0.0006120653,0.06942282,0.0017942983,0.000508649,0.001164666,0.00015201795,0.0011130397],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9932112,0.00012181154,0.0017505811,0.0023879502,0.0010696574,0.0014588176],"domain_scores_gemma":[0.99376965,0.00067015085,0.0013452308,0.002110319,0.001796471,0.00030817848],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.0010617997,0.0014183723,0.0018937304,0.0013819282,0.001936252,0.0012137706,0.0014375764,0.0005225748,0.00087862066],"category_scores_gemma":[0.00015162531,0.0014472808,0.0007792697,0.016630117,0.00028334322,0.0015577256,0.00042199172,0.00093191356,0.0013524806],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002108689,0.0010083824,0.00042616666,0.00070265925,0.0028814962,0.000009005161,0.0005883645,0.9552048,0.0002565815,0.03138014,0.0012452834,0.0060862945],"study_design_scores_gemma":[0.0020084514,0.00006414956,0.00048267757,0.00036396962,0.030922182,0.000012991484,0.0049939924,0.84464145,0.0000447798,0.07486594,0.038663786,0.0029356156],"about_ca_topic_score_codex":0.00093153684,"about_ca_topic_score_gemma":0.0009266627,"teacher_disagreement_score":0.94334924,"about_ca_system_score_codex":0.0001325272,"about_ca_system_score_gemma":0.00016670903,"threshold_uncertainty_score":0.99985665},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03881759737912906,"score_gpt":0.244889662548898,"score_spread":0.20607206516976895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2039386689","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94849324,0.000037219794,0.0028857698,0.0010571997,0.00021478314,0.00037304495,0.0000018967585,0.00010682939,0.04682999],"genre_scores_gemma":[0.9944475,0.000033966975,0.0014150777,0.0025408168,0.00007080312,0.000027495646,0.000004638215,0.000010316906,0.0014493305],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.99843115,0.000008422952,0.00022318836,0.00050260045,0.00042898284,0.00040564238],"domain_scores_gemma":[0.999449,0.000010042805,0.000100845005,0.0003461458,0.00007169871,0.000022275512],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005262281,0.00014887034,0.00013759038,0.0007023917,0.0004891484,0.00018518182,0.00053899764,0.000018206114,0.00008821067],"category_scores_gemma":[0.000044298617,0.00014642352,0.000028091874,0.002011846,0.0002956572,0.0022835939,0.0007132102,0.00007594338,0.00017369227],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019406284,0.0012119208,0.59167236,0.0011562235,0.00018131125,0.00066701317,0.0030595749,0.017484756,0.0063473876,0.33577937,0.0068906094,0.035355385],"study_design_scores_gemma":[0.0020900737,0.000017821696,0.8397549,0.00025158277,0.0001320626,0.0000103107095,0.0034960539,0.077218615,0.000090750145,0.014545546,0.061396223,0.0009961085],"about_ca_topic_score_codex":0.00040134368,"about_ca_topic_score_gemma":0.00039180828,"teacher_disagreement_score":0.32123384,"about_ca_system_score_codex":0.00006928448,"about_ca_system_score_gemma":0.000007093063,"threshold_uncertainty_score":0.59709775},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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)","score_opus":0.05009622218239913,"score_gpt":0.3665433050220586,"score_spread":0.3164470828396595,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040530174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18334307,0.0003886748,0.75625324,0.039838806,0.00014335338,0.0006482201,4.49407e-7,0.000036975653,0.019347195],"genre_scores_gemma":[0.9721367,0.000007116917,0.025471942,0.0012898318,0.00080113445,0.0000022293323,0.0000022608938,0.000014820125,0.00027397007],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99793375,0.00079240365,0.00038435662,0.00012742676,0.00058496493,0.00017708998],"domain_scores_gemma":[0.9980742,0.00050256914,0.00014497284,0.00010520637,0.0011471781,0.00002587782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.018151658,0.00008186573,0.00018259365,0.00040187882,0.00046718988,0.00069789635,0.00029409386,0.000009952258,0.00006074362],"category_scores_gemma":[0.0031446973,0.00005078293,0.00006659513,0.0006098079,0.000096307886,0.00082417316,0.00011681762,0.00035269375,0.000052430158],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0053169266,0.00019646212,0.0005306857,0.000026016138,0.00016975563,0.000107619126,0.0012370376,0.061929706,0.0040169973,0.75888103,0.0027620646,0.16482572],"study_design_scores_gemma":[0.07489537,0.0018003092,0.016005643,0.0018148856,0.00064697606,0.00038603117,0.010084099,0.20672064,0.0023689112,0.17267297,0.51078105,0.0018231358],"about_ca_topic_score_codex":0.0000035653463,"about_ca_topic_score_gemma":0.0000012014964,"teacher_disagreement_score":0.7887936,"about_ca_system_score_codex":0.000022644954,"about_ca_system_score_gemma":0.000028840741,"threshold_uncertainty_score":0.67298305},"labels":[],"label_agreement":null},{"id":"W2040707019","doi":"10.1007/s11134-005-6971-z","title":"Balancing Queues by Mean Field Interaction","year":2005,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Queueing theory; Queue; Limiting; Mathematics; Infinity; Field (mathematics); Mean field theory; Computer science; Discrete mathematics; Computer network; Physics; Statistics; Mathematical analysis; Pure mathematics; Engineering","score_opus":0.008403665087546397,"score_gpt":0.23629896009541687,"score_spread":0.22789529500787048,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2040707019","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84177476,0.0014456308,0.033929374,0.0032169935,0.0031444037,0.0005632272,0.0000035253047,0.0017097552,0.11421232],"genre_scores_gemma":[0.99359715,0.000005402646,0.00007870829,0.0012823499,0.0026858894,0.00002081455,0.000018233017,0.000035381738,0.0022760888],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9988159,0.000029612309,0.00036551137,0.00030113824,0.00021157484,0.000276289],"domain_scores_gemma":[0.99919134,0.00011853713,0.0002962544,0.00028836587,0.00009131865,0.0000141788605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049365096,0.00018304454,0.000249609,0.00019898283,0.00020120696,0.0003578839,0.00020979226,0.00007596654,0.0001453797],"category_scores_gemma":[0.00016112461,0.00017647976,0.00009107177,0.00030094187,0.00001594385,0.0017710727,0.00006806108,0.00017331497,0.00063493644],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003954691,0.00048771995,0.02342242,0.0021546076,0.00085463823,0.00007501247,0.001993611,0.16121092,0.063469455,0.33794406,0.30554983,0.10244224],"study_design_scores_gemma":[0.0005067924,0.000014732336,0.00003366929,0.0005017326,0.00011778757,0.00001001971,0.0018775279,0.22291377,0.002328789,0.0010972089,0.76998204,0.0006159376],"about_ca_topic_score_codex":0.0020301752,"about_ca_topic_score_gemma":0.00026697735,"teacher_disagreement_score":0.46443218,"about_ca_system_score_codex":0.000099382276,"about_ca_system_score_gemma":0.0000056674044,"threshold_uncertainty_score":0.81610346},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.08682550280944053,"score_gpt":0.37394237132527347,"score_spread":0.28711686851583296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041738053","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98378116,0.00007291664,0.0005059076,0.007186641,0.00001936595,0.0003873531,0.0000058510973,0.000051470146,0.007989363],"genre_scores_gemma":[0.9959894,0.000010853201,0.0007244501,0.00044046596,0.00049152033,0.000046261717,0.0000260486,0.000020313113,0.0022507107],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99856377,0.000074018484,0.00025378808,0.0003100971,0.00048032982,0.00031800856],"domain_scores_gemma":[0.9982649,0.000112923175,0.000034313725,0.00037078632,0.0011954417,0.000021635868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019285948,0.00010786101,0.00019263299,0.0007055624,0.00039110603,0.0002812382,0.00019336508,0.00004481615,0.0001620785],"category_scores_gemma":[0.0006604915,0.0000886549,0.000048627757,0.0018224176,0.00014617178,0.0008855273,0.00017047559,0.00016258306,0.00008354132],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027659854,0.0008782126,0.024646081,0.0004085288,0.00037188487,0.00011741638,0.0005647324,0.16123301,0.014825677,0.7217853,0.06707771,0.0053254324],"study_design_scores_gemma":[0.011196126,0.00234131,0.14789054,0.0019979258,0.000553638,0.0000763414,0.00748504,0.18433286,0.044606924,0.13396162,0.46056533,0.0049923505],"about_ca_topic_score_codex":0.00647476,"about_ca_topic_score_gemma":0.007856083,"teacher_disagreement_score":0.5878237,"about_ca_system_score_codex":0.000012958522,"about_ca_system_score_gemma":0.000052524065,"threshold_uncertainty_score":0.97879434},"labels":[],"label_agreement":null},{"id":"W2041846630","doi":"10.1239/jap/1091543419","title":"Space filling and depletion","year":2004,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Mathematics; Interval (graph theory); Discretization; Queue; Space (punctuation); State space; Focus (optics); Clearance; Combinatorics; Discrete mathematics; Applied mathematics; Mathematical analysis; Statistics; Computer science; Physics","score_opus":0.012407596195656404,"score_gpt":0.21737992603208042,"score_spread":0.20497232983642402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2041846630","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9806339,0.00004597592,0.01426846,0.000941981,0.00009843233,0.000112181915,2.1806603e-7,0.00002807683,0.0038707394],"genre_scores_gemma":[0.9888479,0.000006112142,0.010285035,0.0002877036,0.00055743457,0.0000011721951,7.260623e-7,0.000009100381,0.0000047788412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992548,0.0000050311237,0.0003079194,0.00013235718,0.0001776009,0.00012225282],"domain_scores_gemma":[0.9992424,0.00003816629,0.0004304504,0.00012976173,0.0001454745,0.000013745785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009953086,0.00009494044,0.00019916538,0.000112154354,0.00009892156,0.00007551058,0.000105682855,0.000041344338,0.000034142686],"category_scores_gemma":[0.00015999893,0.00007883053,0.000068315225,0.00024087564,0.00006773353,0.00050616736,0.00005486572,0.0001720787,0.000014192656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007760131,0.00028683778,0.0047775633,0.0004181326,0.000118609045,0.000012028456,0.00030021704,0.14693943,0.008034361,0.826886,0.00012607098,0.011324758],"study_design_scores_gemma":[0.000609226,0.000010916734,0.0014248547,0.00003285476,0.000091303096,0.0000069124003,0.00014353241,0.0003573991,0.000592017,0.99264294,0.003969717,0.00011834772],"about_ca_topic_score_codex":0.000009445465,"about_ca_topic_score_gemma":0.000011648243,"teacher_disagreement_score":0.16575694,"about_ca_system_score_codex":0.000061358114,"about_ca_system_score_gemma":0.000016253822,"threshold_uncertainty_score":0.3214616},"labels":[],"label_agreement":null},{"id":"W2042072281","doi":"10.5539/ibr.v2n4p31","title":"The Inventory Problem with A Non-Symmetric Loss Function","year":2009,"lang":"en","type":"article","venue":"International Business Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Quantile; Function (biology); Smoothing; Computer science; Mathematical optimization; Econometrics; Bayesian probability; Economics; Mathematics; Statistics; Artificial intelligence","score_opus":0.03179263196496493,"score_gpt":0.31221246483742005,"score_spread":0.2804198328724551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2042072281","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48661473,0.00045170137,0.030081702,0.07038103,0.001481894,0.0014382016,0.000004298192,0.0004856264,0.4090608],"genre_scores_gemma":[0.9945392,0.00003299663,0.00011284766,0.0005947205,0.0013630433,0.00005165022,0.000029003202,0.000020566611,0.0032559738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978427,0.00003101057,0.00022540562,0.00032019112,0.0011975633,0.00038309093],"domain_scores_gemma":[0.9965377,0.00017403653,0.0001346353,0.0003032465,0.0028346935,0.0000156791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014552608,0.00013784776,0.00011710217,0.0009494313,0.0006020128,0.0006724414,0.0007212548,0.00004652115,0.00013922955],"category_scores_gemma":[0.0006109136,0.00009026224,0.00004996944,0.0035504624,0.00019423345,0.0012922104,0.00016885181,0.00032305156,0.00048419708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004026054,0.00079609273,0.047887452,0.00014769619,0.00053134584,0.00020393505,0.000086720676,0.016044348,0.0015989293,0.7383643,0.02059596,0.16971721],"study_design_scores_gemma":[0.0016224287,0.00007300927,0.1906221,0.00021043477,0.00006461107,0.00001561215,0.00026908124,0.016892077,0.00007762333,0.3250327,0.46464056,0.00047973666],"about_ca_topic_score_codex":0.00019054528,"about_ca_topic_score_gemma":0.00010529318,"teacher_disagreement_score":0.5079245,"about_ca_system_score_codex":0.00013386608,"about_ca_system_score_gemma":0.000052942207,"threshold_uncertainty_score":0.6484367},"labels":[],"label_agreement":null},{"id":"W2045033756","doi":"10.1002/nav.21494","title":"Priority queue with customer upgrades","year":2012,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"National Natural Science Foundation of China","keywords":"Queueing theory; Computer science; Priority queue; Queue; Operations research; Sample (material); Lyapunov optimization; Queueing system; Computer network; Mathematical optimization; Mathematics; Lyapunov equation","score_opus":0.1041311928030988,"score_gpt":0.37260427082579267,"score_spread":0.2684730780226939,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045033756","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.40094107,0.0013721279,0.057883933,0.003077963,0.0011060607,0.0016797377,0.00003212713,0.0011094367,0.5327975],"genre_scores_gemma":[0.99317884,0.000026797983,0.0013358706,0.00026660482,0.0021803977,0.000032245924,0.0000253201,0.00005093113,0.0029030084],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9969036,0.00011159315,0.00025998353,0.0003748184,0.0011855924,0.0011644319],"domain_scores_gemma":[0.99784535,0.0005583861,0.0001320404,0.00058490067,0.0008003085,0.00007900555],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0036557843,0.00022818537,0.00028976458,0.00054284185,0.0005451164,0.00029806487,0.00054269953,0.000123531,0.00037576092],"category_scores_gemma":[0.00390783,0.00017818477,0.00008085947,0.0015733362,0.0006407816,0.0011204621,0.00043232576,0.0008136219,0.0023157483],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00038057612,0.0004342111,0.053214297,0.00026810064,0.00013479959,0.00007444613,0.000113065704,0.0009967574,0.000893569,0.9282955,0.008863355,0.0063313358],"study_design_scores_gemma":[0.0015628778,0.00011979769,0.018135047,0.00019317557,0.0003476237,0.000016576827,0.0014179524,0.008159986,0.0010497116,0.1452493,0.82234865,0.0013992669],"about_ca_topic_score_codex":0.0006646242,"about_ca_topic_score_gemma":0.00016258153,"teacher_disagreement_score":0.8134853,"about_ca_system_score_codex":0.00015742927,"about_ca_system_score_gemma":0.00006470351,"threshold_uncertainty_score":0.99846107},"labels":[],"label_agreement":null},{"id":"W2045553848","doi":"10.1007/s11134-007-9056-3","title":"Existence and characterization of product-form invariant distributions for state-dependent stochastic networks in the heavy-traffic diffusion limit","year":2007,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Orthant; Mathematics; Martingale (probability theory); Ergodic theory; Jump; Mathematical analysis; Stationary distribution; Jump diffusion; Jump process; Central limit theorem; Local martingale; Bounded function; Statistical physics; Applied mathematics; Markov chain; Physics; Quantum mechanics","score_opus":0.013931429311915215,"score_gpt":0.22820696400411292,"score_spread":0.2142755346921977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2045553848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6920143,0.00008001896,0.30684623,0.00011021005,0.00019636592,0.0006714452,0.0000073215256,0.00003817456,0.000035949586],"genre_scores_gemma":[0.9992568,0.0000069016805,0.000039116647,0.00005477306,0.000394714,0.00006106397,0.00011267215,0.000017397186,0.000056543708],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987613,0.000031099727,0.00048553513,0.00026053097,0.0001877208,0.00027379606],"domain_scores_gemma":[0.99900144,0.00019560217,0.00040800803,0.00025064702,0.00013353524,0.000010765124],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019350421,0.00014272238,0.00023756735,0.00017354995,0.00021361098,0.00014445465,0.00018136564,0.000043720906,0.0000014960403],"category_scores_gemma":[0.00020728343,0.0001091752,0.000042337462,0.00049081485,0.000054428005,0.0004995089,0.0000602257,0.00010956319,0.0000018884143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016145374,0.0010965163,0.01172081,0.0034787452,0.00024542262,0.000053366686,0.004461982,0.41641277,0.035330344,0.49216616,0.00007224526,0.03334709],"study_design_scores_gemma":[0.0010516298,0.000055756387,0.021116085,0.0010017855,0.00019177033,0.000017070533,0.0020631168,0.9698021,0.00015804358,0.0031493763,0.00085516606,0.0005381385],"about_ca_topic_score_codex":0.00020484038,"about_ca_topic_score_gemma":0.00022829123,"teacher_disagreement_score":0.5533893,"about_ca_system_score_codex":0.000050410883,"about_ca_system_score_gemma":0.000010040477,"threshold_uncertainty_score":0.44520354},"labels":[],"label_agreement":null},{"id":"W2046139352","doi":"10.1016/j.mcm.2011.03.010","title":"The optimal control of an<mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si32.gif\" display=\"inline\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mi>M</mml:mi></mml:mrow><mml:mrow><mml:mi>x</mml:mi></mml:mrow></mml:msup><mml:mo>/</mml:mo><mml:mi>G</mml:mi><mml:mo>/</mml:mo><mml:mn>1</mml:mn></mml:math>unreliable server queue with two phases of service and Bernoulli vacation schedule","year":2011,"lang":"lv","type":"article","venue":"Mathematical and Computer Modelling","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":30,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Computer science; Epoch (astronomy); Queue; Retrial queue; Service (business); Algorithm; Bernoulli's principle; Database; Real-time computing; Computer network; Queueing system; Physics","score_opus":0.018162463537535853,"score_gpt":0.22552963723955324,"score_spread":0.2073671737020174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046139352","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84679425,0.0017111835,0.0636041,0.0006995891,0.0011826736,0.00010414992,0.00023661391,0.0002998675,0.08536757],"genre_scores_gemma":[0.97736937,0.0008049011,0.015751278,0.001588408,0.0020294809,0.0008109528,0.00073365634,0.0007654523,0.00014649749],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9898584,0.00043032778,0.0025710354,0.0021530061,0.0025495843,0.0024376845],"domain_scores_gemma":[0.99131143,0.0021753968,0.0029639,0.0022782227,0.00048349044,0.00078753696],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00276538,0.001176481,0.0006345357,0.00060735137,0.0022207831,0.0020143993,0.0023673016,0.0017983529,0.0721696],"category_scores_gemma":[0.0007886455,0.0018959796,0.0015537649,0.0014495763,0.0018164193,0.003068588,0.0022954973,0.001646036,0.00071017834],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002936839,0.00085761095,0.000020605365,0.0035127895,0.0028638744,0.00056888507,0.002403264,0.055915162,0.00089793204,0.9098459,0.017731655,0.0024455118],"study_design_scores_gemma":[0.0025034477,0.0010256422,0.000014555073,0.001863041,0.002671488,0.00060487527,0.0015327941,0.6144083,0.36979952,0.0036152329,0.00056529377,0.0013957868],"about_ca_topic_score_codex":0.002177858,"about_ca_topic_score_gemma":0.00070464954,"teacher_disagreement_score":0.9062306,"about_ca_system_score_codex":0.00001568865,"about_ca_system_score_gemma":0.0007211485,"threshold_uncertainty_score":0.99949753},"labels":[],"label_agreement":null},{"id":"W2046887762","doi":"10.1155/2015/181653","title":"Pricing Analysis in Geo/Geo/1 Queueing System","year":2015,"lang":"en","type":"article","venue":"Mathematical Problems in Engineering","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"China Scholarship Council; Hunan Provincial Innovation Foundation for Postgraduate; Simon Fraser University; National Natural Science Foundation of China","keywords":"Toll; Server; Queueing theory; Payment; Queueing system; Profit (economics); Computer science; Queue; Scheme (mathematics); Operations research; Computer network; Mathematical optimization; Microeconomics; Economics; Mathematics","score_opus":0.015133759335949099,"score_gpt":0.2125324678819696,"score_spread":0.1973987085460205,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2046887762","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17701729,0.0001216866,0.80862397,0.00007975345,0.00011789297,0.00036797897,3.8020664e-7,0.0005155189,0.013155533],"genre_scores_gemma":[0.9961693,0.0000010418142,0.003504231,0.000036179008,0.00013979837,0.000055429813,0.000004924587,0.000043662643,0.000045408146],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981902,0.000016472311,0.00067921175,0.00033846006,0.00031046313,0.0004651755],"domain_scores_gemma":[0.9992548,0.00018073362,0.00014465577,0.00033882106,0.000049376154,0.000031581993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001800287,0.00024373643,0.00058684614,0.0013672712,0.00003227194,0.00013478227,0.00027734798,0.00008916375,0.000029733608],"category_scores_gemma":[0.00082722015,0.00023503484,0.00012144665,0.0031482775,0.000019599434,0.0007461172,0.0001764672,0.000276684,0.000119797754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000032595115,0.00004344117,0.00299334,0.0009741033,0.000068551984,0.00002723402,0.00019910483,0.92161655,0.00009676022,0.07380177,0.000004092947,0.0001717835],"study_design_scores_gemma":[0.0003083753,0.000002703527,0.00020993152,0.0005253989,0.00015978774,0.0000023091343,0.00040386082,0.9807442,0.000015300244,0.017131459,0.00021414102,0.0002825753],"about_ca_topic_score_codex":0.00017849263,"about_ca_topic_score_gemma":0.00008782973,"teacher_disagreement_score":0.81915206,"about_ca_system_score_codex":0.00026790507,"about_ca_system_score_gemma":0.000009119019,"threshold_uncertainty_score":0.95844424},"labels":[],"label_agreement":null},{"id":"W2047087752","doi":"10.1109/coase.2007.4341825","title":"Queue time and x-factor characteristics for semiconductor manufacturing with small lot sizes","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Advanced Micro Devices (Canada)","funders":"","keywords":"Queue; Queueing theory; Semiconductor device fabrication; Computer science; Process (computing); Real-time computing; Throughput; Engineering; Computer network; Telecommunications; Electrical engineering","score_opus":0.01593960728574083,"score_gpt":0.21601186802474912,"score_spread":0.2000722607390083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047087752","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97729874,0.000012610648,0.019989936,0.00014174562,0.00006402232,0.00023355633,0.0000074626364,0.0001912898,0.0020606597],"genre_scores_gemma":[0.98880714,0.0000023458535,0.005568698,0.001007193,0.0007444946,0.000007387108,0.000041101885,0.000049244674,0.0037723873],"study_design_codex":"bench_or_experimental","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990898,0.0000033693595,0.0002178937,0.00028832266,0.00009036922,0.00031029637],"domain_scores_gemma":[0.9993486,0.00018303952,0.0001760239,0.0001847168,0.00008735797,0.000020267289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002820854,0.00019764042,0.0002433472,0.000158354,0.00014669691,0.0001562217,0.00012212295,0.000054033688,0.00032131883],"category_scores_gemma":[0.000095548916,0.00015286835,0.000046809753,0.000102849765,0.00005603442,0.00055330695,0.00006946854,0.00008034473,0.00006865397],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0073841796,0.0009840952,0.06628598,0.0041094436,0.0025037373,0.00030093692,0.0010269356,0.0008211852,0.4624477,0.13187587,0.0024154095,0.3198445],"study_design_scores_gemma":[0.011166067,0.00040605944,0.119468264,0.0008551211,0.0027188328,0.00007503375,0.00247707,0.0339736,0.3290965,0.040246032,0.45156744,0.00794996],"about_ca_topic_score_codex":0.00005117812,"about_ca_topic_score_gemma":0.000132326,"teacher_disagreement_score":0.44915205,"about_ca_system_score_codex":0.000022274044,"about_ca_system_score_gemma":0.0000057517364,"threshold_uncertainty_score":0.62337905},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02260487370844676,"score_gpt":0.23874616322111716,"score_spread":0.2161412895126704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047498382","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63272816,0.00001735585,0.36481395,0.0002710095,0.00000638623,0.00029571028,0.0000010930329,0.00014641156,0.0017198853],"genre_scores_gemma":[0.9698663,0.000003864138,0.0284822,0.0013807919,0.00015126941,0.00004720196,0.0000067588703,0.00003903965,0.000022573304],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880594,0.000011810306,0.000328296,0.0003390118,0.0002682726,0.0002466646],"domain_scores_gemma":[0.9989315,0.000207756,0.00016014869,0.00052449934,0.00014560681,0.000030481453],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00043658985,0.00020795938,0.00033468616,0.00010240594,0.00024643663,0.00004714024,0.00025291258,0.00003956876,0.000057924928],"category_scores_gemma":[0.000025652977,0.00013590306,0.000054288543,0.00057996117,0.00008671028,0.00038059213,0.00009765565,0.000116061914,0.000050865274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00029548642,0.00025874708,0.0000616687,0.0002509677,0.00012309999,0.000009824017,0.00096919894,0.62241083,0.00072257366,0.374376,0.000038601815,0.0004829818],"study_design_scores_gemma":[0.00051094755,0.000027394997,0.000008570332,0.00007747349,0.00025482534,0.0000110113115,0.00056485,0.85771036,0.0005895794,0.13972217,0.00022453193,0.0002982805],"about_ca_topic_score_codex":0.00020909432,"about_ca_topic_score_gemma":0.00010007975,"teacher_disagreement_score":0.33713812,"about_ca_system_score_codex":0.000010862534,"about_ca_system_score_gemma":0.000011161871,"threshold_uncertainty_score":0.5541966},"labels":[],"label_agreement":null},{"id":"W2047556659","doi":"10.1109/itc.2014.6932934","title":"Rate-based randomized routing in large heterogeneous processor sharing systems","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Server; Computer science; Routing (electronic design automation); Stability (learning theory); Distributed computing; Scheme (mathematics); Load balancing (electrical power); Power (physics); Computer network; Mathematics","score_opus":0.010117190501052682,"score_gpt":0.2258292419714945,"score_spread":0.21571205147044184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047556659","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6377806,0.00009844474,0.32651955,0.0005101442,0.00042055926,0.0012018699,9.73326e-7,0.0008480396,0.032619826],"genre_scores_gemma":[0.9976667,6.4289804e-7,0.00014653533,0.0011579609,0.00037503763,0.000094955205,0.000016894788,0.00003815565,0.00050312333],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99839026,0.00008153132,0.00052913016,0.00041110883,0.00016757382,0.0004203745],"domain_scores_gemma":[0.9989475,0.00030586982,0.00032029802,0.00030421373,0.000109828296,0.000012262501],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0039596674,0.00021324102,0.00062176015,0.00034562673,0.00015213125,0.0003403568,0.00029752636,0.00006252378,0.00015729606],"category_scores_gemma":[0.0012804806,0.00017539834,0.00015242596,0.0005659138,0.000032894422,0.0005970365,0.0001274003,0.00012286258,0.00018438078],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0082754195,0.0001974891,0.012151784,0.0008173268,0.00012167046,0.00002957266,0.000055125314,0.46541268,0.00044194172,0.5116054,0.000036836056,0.00085474714],"study_design_scores_gemma":[0.031173034,0.0000019613728,0.000025092027,0.00009148565,0.00006867201,4.893629e-7,0.000051747244,0.9613111,0.00013697006,0.0061720815,0.0007176986,0.0002496902],"about_ca_topic_score_codex":0.000270534,"about_ca_topic_score_gemma":0.00017093071,"teacher_disagreement_score":0.5054333,"about_ca_system_score_codex":0.000037931393,"about_ca_system_score_gemma":0.000007515861,"threshold_uncertainty_score":0.71525365},"labels":[],"label_agreement":null},{"id":"W2047904670","doi":"10.1080/07408170701744819","title":"Heuristics for allocation of reconfigurable resources in a serial line with reliability considerations","year":2008,"lang":"en","type":"article","venue":"IIE Transactions","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council; Division of Civil, Mechanical and Manufacturing Innovation; Engineering Research Centers; National Science Foundation","keywords":"Heuristics; Server; Computer science; Reliability (semiconductor); Monotone polygon; Throughput; Line (geometry); Distributed computing; Resource allocation; Heuristic; Mathematical optimization; Computer network; Operating system; Mathematics; Artificial intelligence","score_opus":0.023720848011566275,"score_gpt":0.23452686709923432,"score_spread":0.21080601908766805,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2047904670","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6048791,0.000017582062,0.39086473,0.0014708837,0.000113572925,0.00046902962,0.000024619632,0.00009670875,0.0020638134],"genre_scores_gemma":[0.9948641,0.000007346259,0.004562001,0.00010441261,0.000114347255,0.000065842665,0.0000193107,0.000013559529,0.00024908796],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99933314,0.000013401854,0.0002840609,0.00017211503,0.000080343336,0.00011693613],"domain_scores_gemma":[0.99923617,0.00020518746,0.00012873851,0.00018221834,0.00024041804,0.0000072523835],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021474427,0.00008701835,0.00017317102,0.00016594215,0.00023254608,0.000019900068,0.00005100768,0.000041676234,0.00018453288],"category_scores_gemma":[0.00017671831,0.00008260538,0.000054967535,0.00036152496,0.00010852412,0.00044598067,0.0000014606698,0.00008093972,0.0000051836387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009844393,0.0005680472,0.0012232943,0.00025531187,0.00008850871,0.0000061111773,0.0006843724,0.9795724,0.0034298294,0.0121282255,0.00022493451,0.0008345052],"study_design_scores_gemma":[0.016626239,0.0005911559,0.017330524,0.0006871338,0.0024335354,0.00008540552,0.0041912715,0.48785448,0.030349078,0.37360498,0.06356303,0.0026831867],"about_ca_topic_score_codex":0.00036091649,"about_ca_topic_score_gemma":0.0016904512,"teacher_disagreement_score":0.49171796,"about_ca_system_score_codex":0.000023677432,"about_ca_system_score_gemma":0.00003202743,"threshold_uncertainty_score":0.33685496},"labels":[],"label_agreement":null},{"id":"W2048113057","doi":"10.1016/j.sorms.2014.09.001","title":"Queueing-theoretic approaches for dynamic scheduling: A survey","year":2014,"lang":"en","type":"article","venue":"Surveys in Operations Research and Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; University of Toronto; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Computer science; Dynamic priority scheduling; Scheduling (production processes); Distributed computing; Mathematical optimization; Two-level scheduling; Fair-share scheduling; Layered queueing network; Operations research; Mathematics; Computer network; Quality of service","score_opus":0.09398401633335034,"score_gpt":0.3579786254718068,"score_spread":0.26399460913845646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048113057","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4873317,0.000059312435,0.49623027,0.0008198091,0.00014665125,0.0013272396,0.0000054996603,0.00008934899,0.013990174],"genre_scores_gemma":[0.99385816,0.000048481008,0.004587559,0.00009966634,0.000056206896,0.00023267152,0.000044685148,0.000016818007,0.0010557676],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997463,0.00040247588,0.00026580767,0.00068642537,0.0005466459,0.00063567486],"domain_scores_gemma":[0.99869204,0.000419587,0.000033814493,0.00045540297,0.00036539743,0.00003375736],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.047096793,0.00013944619,0.00017321753,0.001446017,0.001138412,0.0009716118,0.00067271857,0.000032997523,0.00002078251],"category_scores_gemma":[0.0029769505,0.00012854049,0.00002691136,0.0032570728,0.0011238588,0.0013917689,0.0005482781,0.00016840686,0.00003925111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020294628,0.00010407013,0.0075712968,0.00015150585,0.000010936392,0.0000010807687,0.000040195104,0.04256631,0.00007881974,0.9313171,0.000023096069,0.018115317],"study_design_scores_gemma":[0.00038344334,0.000025769163,0.055407677,0.00003828876,0.0000069217126,2.1770737e-7,0.00033061253,0.88108516,0.000017250954,0.061813716,0.00069808814,0.0001928333],"about_ca_topic_score_codex":0.0006402458,"about_ca_topic_score_gemma":0.008348022,"teacher_disagreement_score":0.8695034,"about_ca_system_score_codex":0.0000796896,"about_ca_system_score_gemma":0.000031588053,"threshold_uncertainty_score":0.9812144},"labels":[],"label_agreement":null},{"id":"W2048144767","doi":"10.1080/07408170701275343","title":"Approximate mean waiting time in a <i>GI</i> / <i>D</i> /1 queue with autocorrelated times to failures","year":2007,"lang":"en","type":"article","venue":"IIE Transactions","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"The King's University; University of Toronto; University of King's College","funders":"University of Toronto; National Science Foundation","keywords":"Queue; Autocorrelation; Renewal theory; Process (computing); Computer science; Poisson distribution; Poisson process; Server; Mathematics; Real-time computing; Mathematical optimization; Statistics; Computer network","score_opus":0.006016776113520578,"score_gpt":0.20880401747776672,"score_spread":0.20278724136424614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048144767","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.25480205,0.000036975212,0.69692653,0.00312336,0.00017142305,0.001154324,0.000009712277,0.0013503967,0.042425215],"genre_scores_gemma":[0.99423033,9.1496935e-7,0.002659275,0.00100913,0.00014780033,0.000053339652,0.000016054311,0.000058628306,0.0018245035],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985371,0.00001562819,0.00036250072,0.00038407635,0.00021174553,0.00048893184],"domain_scores_gemma":[0.9993642,0.00010873733,0.00012368216,0.00027013558,0.00009842859,0.00003481852],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006034324,0.00024133053,0.00027277874,0.0005811242,0.0002721339,0.00012590895,0.00020537758,0.000078431156,0.0005808119],"category_scores_gemma":[0.00002789145,0.00022246475,0.00009208694,0.0017477985,0.00005815084,0.0009694949,0.000014004863,0.00027987643,0.00051912246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018889117,0.0009544927,0.0013264176,0.0003012998,0.0005360445,0.00035053008,0.0023571867,0.8946834,0.022017306,0.0313146,0.0009972681,0.043272547],"study_design_scores_gemma":[0.007049834,0.00017662131,0.001906412,0.0013795178,0.0017765322,0.000087892295,0.005691949,0.81020814,0.010715862,0.021804921,0.13474962,0.004452712],"about_ca_topic_score_codex":0.0005910268,"about_ca_topic_score_gemma":0.0028802,"teacher_disagreement_score":0.7394283,"about_ca_system_score_codex":0.00006831817,"about_ca_system_score_gemma":0.000017265384,"threshold_uncertainty_score":0.90718496},"labels":[],"label_agreement":null},{"id":"W2048532880","doi":"10.1016/j.tre.2011.07.008","title":"Scheduling commercial vehicle queues at a Canada–US border crossing","year":2011,"lang":"en","type":"article","venue":"Transportation Research Part E Logistics and Transportation Review","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Queue; Smoothing; Scheduling (production processes); Jurisdiction; Truck; Context (archaeology); Computer science; Supply chain; Business; Transport engineering; Operations research; Economics; Operations management; Engineering; Automotive engineering; Computer network; Geography; Marketing","score_opus":0.11141562521073015,"score_gpt":0.35770207169451,"score_spread":0.24628644648377987,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2048532880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96272814,0.018091548,0.009532585,0.0023428071,0.00036522394,0.0016531241,0.00025501428,0.00027454144,0.004757024],"genre_scores_gemma":[0.99061394,0.00529582,0.0006652984,0.002164593,0.00016495517,0.00008720488,0.00078362064,0.000041479663,0.00018309707],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9976591,0.000055065357,0.0007252374,0.0004469829,0.00064301095,0.0004705975],"domain_scores_gemma":[0.99860144,0.00012709266,0.00026746094,0.0002583561,0.0006797066,0.00006593868],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010399413,0.00023712718,0.0004087624,0.0001567238,0.0008903499,0.00010698838,0.0001991637,0.00007376712,0.0010712998],"category_scores_gemma":[0.00013127377,0.00022889205,0.00009575951,0.00078205846,0.00035925664,0.000494734,0.000006522621,0.00031259548,0.00003428111],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008494438,0.0006381708,0.43703845,0.025400586,0.00051204045,0.00093075377,0.0018204506,0.006851459,0.00033278007,0.48602885,0.0058969334,0.033700082],"study_design_scores_gemma":[0.0013097925,0.000048460846,0.54543805,0.0034736244,0.00085695455,0.0000012932729,0.00038780997,0.0034204826,0.00014856167,0.00921845,0.43463832,0.0010581677],"about_ca_topic_score_codex":0.14789528,"about_ca_topic_score_gemma":0.7235336,"teacher_disagreement_score":0.5756383,"about_ca_system_score_codex":0.000059744114,"about_ca_system_score_gemma":0.00016565752,"threshold_uncertainty_score":0.99984187},"labels":[],"label_agreement":null},{"id":"W2049300338","doi":"10.1016/j.ejor.2011.05.043","title":"Cost evaluation in M/G/1 queue with T-policy revisited, technical note","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University; Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; King Saud University","keywords":"Convexity; Queue; Function (biology); Computer science; Operations research; Operations management; Service (business); Mathematical economics; Economics; Mathematics; Business; Computer network; Marketing","score_opus":0.1643303888274868,"score_gpt":0.4035531105405183,"score_spread":0.2392227217130315,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2049300338","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33008865,0.0004414115,0.05100836,0.007769752,0.00016925872,0.0015084618,0.0000049264995,0.00006485883,0.60894436],"genre_scores_gemma":[0.9941666,0.000017998002,0.0040721316,0.00039554373,0.0011241966,0.000005493248,0.000008846046,0.000028000291,0.0001812016],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9972871,0.0005765977,0.00048453038,0.00017722714,0.0012309564,0.00024362314],"domain_scores_gemma":[0.99720645,0.0001289849,0.00020598338,0.00019464426,0.0022354147,0.000028499206],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014861757,0.00010161296,0.0001667363,0.0012067477,0.00017536063,0.00018093418,0.00042252813,0.000020166257,0.00064771314],"category_scores_gemma":[0.0033288638,0.00007640206,0.000053183605,0.0014392992,0.00013914857,0.0013224845,0.00013068428,0.00058025843,0.00029302592],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057616136,0.0015104022,0.021516366,0.00018564124,0.00020017596,0.002855403,0.0014594614,0.060743697,0.01852859,0.70096314,0.009582036,0.17669347],"study_design_scores_gemma":[0.019103907,0.0017062719,0.5119144,0.0037550218,0.00049165357,0.00094292813,0.0024798617,0.12689531,0.0016836532,0.089944124,0.23870319,0.0023796842],"about_ca_topic_score_codex":0.00004393246,"about_ca_topic_score_gemma":0.000046717312,"teacher_disagreement_score":0.66407794,"about_ca_system_score_codex":0.00018716177,"about_ca_system_score_gemma":0.00023885825,"threshold_uncertainty_score":0.7092005},"labels":[],"label_agreement":null},{"id":"W2050521835","doi":"10.1214/105051604000000675","title":"Bridges and networks: Exact asymptotics","year":2005,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":34,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada; Indian Institute of Science; École Normale Supérieure; National Science Foundation","keywords":"Node (physics); Boundary (topology); Mathematics; Markov process; Queueing theory; Exponential function; Large deviations theory; Polynomial; Exponential distribution; Limit (mathematics); Path (computing); Steady state (chemistry); State (computer science); Computer science; Mathematical analysis; Algorithm; Computer network; Physics; Statistics","score_opus":0.03996450727632896,"score_gpt":0.2684077794762901,"score_spread":0.2284432721999611,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2050521835","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97466856,0.00020479687,0.002680566,0.0053135785,0.00003289862,0.00037793256,0.0000016980754,0.00011464832,0.016605332],"genre_scores_gemma":[0.9966681,0.000034653094,0.00048814804,0.0022241618,0.00052076887,0.000013164358,0.0000045029897,0.000014034566,0.00003248734],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99905705,0.000015809968,0.00029108935,0.00024827605,0.0001533179,0.00023447166],"domain_scores_gemma":[0.9989825,0.00015703897,0.00024292014,0.00048588988,0.00011998838,0.000011659355],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014501791,0.0001469693,0.00024033566,0.000049544724,0.00015073821,0.00006377117,0.0002781842,0.000046516016,0.000066779015],"category_scores_gemma":[0.00011505396,0.00010488669,0.00007375412,0.00027903795,0.00027586124,0.00032217067,0.0002135956,0.00012502517,0.00002937653],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041987913,0.00021613156,0.0025534132,0.00019273642,0.000120620694,3.8642625e-7,0.00014111369,0.23844221,0.00020242596,0.6610577,0.0012421428,0.09541121],"study_design_scores_gemma":[0.00040646657,0.000015248011,0.014330344,0.000034147753,0.00018168487,8.407964e-7,0.00021606531,0.086664684,0.0015506131,0.86356336,0.03259823,0.00043831757],"about_ca_topic_score_codex":0.000025911155,"about_ca_topic_score_gemma":0.000031905718,"teacher_disagreement_score":0.20250563,"about_ca_system_score_codex":0.000007635473,"about_ca_system_score_gemma":0.0000058350242,"threshold_uncertainty_score":0.4277155},"labels":[],"label_agreement":null},{"id":"W2051269587","doi":"10.1145/512840.512842","title":"Solution properties and convergence of an approximate mean value analysis algorithm","year":2002,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Mean value analysis; Convergence (economics); Separable space; Algorithm; Queueing theory; Queue; Computer science; Value (mathematics); Layered queueing network; Mathematical optimization; Mathematics; Line (geometry)","score_opus":0.09167207131624103,"score_gpt":0.2901766928358102,"score_spread":0.19850462151956919,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051269587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80695826,0.15875657,0.028852584,0.0008222884,0.0003191666,0.0022082482,0.000007798366,0.00024149912,0.0018335845],"genre_scores_gemma":[0.95466125,0.038316824,0.0059415433,0.00071468705,0.00013037433,0.00008489853,0.00006772409,0.000020815356,0.000061855404],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978374,0.00010238391,0.00063748,0.0003878932,0.000812934,0.00022186385],"domain_scores_gemma":[0.9976961,0.000062686166,0.0006856276,0.00072415645,0.0008098834,0.000021554735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040514385,0.00020341187,0.00052847643,0.0009986582,0.00020998331,0.00006586594,0.00038362408,0.00005213656,0.00067105994],"category_scores_gemma":[0.001743769,0.0001733127,0.00013705889,0.0062800646,0.000096478776,0.0021970358,0.00016839827,0.00010657045,0.00006861254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009012079,0.00014017987,0.0038950394,0.0031391475,0.00033587182,5.486412e-7,0.00009707117,0.009153678,0.00016500376,0.0009396756,0.00011529786,0.9820095],"study_design_scores_gemma":[0.00020792782,0.000021444524,0.00151024,0.00036755673,0.003053336,9.909996e-7,0.00002787839,0.993128,0.00016715491,0.00048804775,0.0008029593,0.00022446043],"about_ca_topic_score_codex":0.000040106832,"about_ca_topic_score_gemma":0.0000053968756,"teacher_disagreement_score":0.98397434,"about_ca_system_score_codex":0.00005311927,"about_ca_system_score_gemma":0.000011881098,"threshold_uncertainty_score":0.73476356},"labels":[],"label_agreement":null},{"id":"W2051329164","doi":"10.3138/infor.47.4.297","title":"Time-Dependent Analysis of Some Infinite Server Queues with Bulk Poisson Arrivals","year":2009,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Poisson distribution; Queue; Computer science; Transient (computer programming); Applied mathematics; Generating function; Function (biology); Statistical physics; Mathematics; Discrete mathematics; Physics; Statistics; Computer network; Operating system","score_opus":0.028662848843607452,"score_gpt":0.30578567630420156,"score_spread":0.27712282746059413,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051329164","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97528654,0.00013546224,0.0015812139,0.0009840472,0.000059061316,0.0007483558,0.000046400553,0.00009190408,0.021066993],"genre_scores_gemma":[0.9980956,0.0000145761705,0.000066152934,0.0005788691,0.00016228296,0.000027382353,0.0002972028,0.000005792891,0.0007521512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99779874,0.000037752674,0.0006450274,0.0001339967,0.0011445205,0.00023995087],"domain_scores_gemma":[0.99776137,0.00014675634,0.00028299354,0.0002442049,0.0015361098,0.000028569633],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022984422,0.0001371406,0.00032737388,0.0017467225,0.00031159943,0.0007231184,0.00019453233,0.00007197035,0.0001425526],"category_scores_gemma":[0.00029092605,0.000104666935,0.00006741634,0.0016648234,0.00009412673,0.007306356,0.000073048956,0.00015528707,0.000207292],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026908203,0.000042732587,0.0021539945,0.00018227061,0.00057862146,0.0000019765503,0.0005724223,0.4974281,0.00027249032,0.49537617,0.00051851757,0.0026036429],"study_design_scores_gemma":[0.0017742473,0.00020127674,0.016904825,0.0002882511,0.0005216834,0.000007280804,0.0031812992,0.8854153,0.0003174832,0.0034550845,0.08722514,0.0007080876],"about_ca_topic_score_codex":0.0004821084,"about_ca_topic_score_gemma":0.00003274229,"teacher_disagreement_score":0.4919211,"about_ca_system_score_codex":0.000049574694,"about_ca_system_score_gemma":0.000060590657,"threshold_uncertainty_score":0.6973047},"labels":[],"label_agreement":null},{"id":"W2051948841","doi":"10.1016/j.peva.2007.02.001","title":"The use of the distributional Little’s law in the computational analysis of discrete-time GI/G/1 and GI/D/c queues","year":2007,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Discrete time and continuous time; Computer science; Relation (database); Distribution (mathematics); Simple (philosophy); Mathematics; Sample (material); Applied mathematics; Mathematical optimization; Real-time computing; Computer network; Mathematical analysis; Statistics; Physics","score_opus":0.031715213183962934,"score_gpt":0.28618725485928076,"score_spread":0.25447204167531784,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2051948841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959292,0.00006669913,0.0026590459,0.0006796039,0.000040381416,0.00021768604,0.000010613698,0.000007563238,0.00038921493],"genre_scores_gemma":[0.9994328,0.000007851417,0.000104864324,0.00020135214,0.00007476422,0.0000108323065,0.00014022073,0.0000044698304,0.000022821734],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862295,0.000082353734,0.00038407507,0.00013227682,0.0006455358,0.00013283396],"domain_scores_gemma":[0.99840945,0.0006233856,0.00038629156,0.00022890887,0.00034791027,0.0000040444143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038915486,0.000090227855,0.0001499072,0.00014519172,0.00034223282,0.00007562222,0.00021066927,0.000029043025,0.00004321996],"category_scores_gemma":[0.0003858122,0.000048422193,0.000093287344,0.0013778515,0.00028854705,0.00074250775,0.00007392802,0.000089128196,0.0000040567193],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013748284,0.00006554264,0.13564509,0.000033148965,0.00026980435,1.333567e-7,0.000319974,0.7496304,0.00017325784,0.103936255,0.00009344682,0.0096954545],"study_design_scores_gemma":[0.00012432515,0.0000034911002,0.37951624,0.000015093533,0.00040353736,1.6012112e-7,0.0000811261,0.6142856,0.00003983927,0.0049031624,0.000582557,0.000044862518],"about_ca_topic_score_codex":0.0001402182,"about_ca_topic_score_gemma":0.00045830422,"teacher_disagreement_score":0.24387117,"about_ca_system_score_codex":0.00004049926,"about_ca_system_score_gemma":0.000018264394,"threshold_uncertainty_score":0.26322126},"labels":[],"label_agreement":null},{"id":"W2052011771","doi":"10.1016/j.peva.2004.09.004","title":"Iterative algorithms for performance evaluation of closed network models","year":2004,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Queueing theory; Computer science; Layered queueing network; Mathematical optimization; Mean value analysis; Algorithm; Sensitivity (control systems); G-network; Nonlinear system; Mathematics; Computer network","score_opus":0.07225961829479466,"score_gpt":0.3175862268961517,"score_spread":0.24532660860135702,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052011771","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9543251,0.00017197189,0.039732914,0.00014615043,0.0003774334,0.0014370728,0.000003060218,0.000071970455,0.0037343684],"genre_scores_gemma":[0.99357,0.000028053202,0.004289807,0.00019422913,0.0011380138,0.00048154595,0.00023339268,0.000031811418,0.000033112894],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975687,0.00004753661,0.0005254596,0.00035855558,0.00116965,0.00033004518],"domain_scores_gemma":[0.99668956,0.000054735217,0.0005968832,0.00033035854,0.002316688,0.00001176484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006389933,0.00022063087,0.00028125293,0.00025265772,0.00035863937,0.000072187286,0.0002119733,0.00008150599,0.00012688909],"category_scores_gemma":[0.00025245885,0.00021361,0.000113142785,0.0007725895,0.000063902706,0.00355812,0.000053017695,0.00010578589,0.00005044113],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000114498835,0.000046431276,0.00046285498,0.0000746403,0.000042419488,2.9102065e-8,0.00018185914,0.8800267,0.00016592539,0.0042929193,0.00004163506,0.11455007],"study_design_scores_gemma":[0.0022846633,0.000049391216,0.003264955,0.00015052086,0.0005661222,3.9288287e-7,0.00007004775,0.9325348,0.0010213132,0.05964346,0.00017974977,0.00023456453],"about_ca_topic_score_codex":0.00001644213,"about_ca_topic_score_gemma":0.000016674254,"teacher_disagreement_score":0.1143155,"about_ca_system_score_codex":0.00027062325,"about_ca_system_score_gemma":0.00013769855,"threshold_uncertainty_score":0.8710763},"labels":[],"label_agreement":null},{"id":"W2052410794","doi":"10.5539/mas.v2n2p101","title":"Optimal Workload Allocation in a Network of Computers with Single Class Job","year":2008,"lang":"en","type":"article","venue":"Modern Applied Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Workload; Computer science; Queueing theory; Queue; Class (philosophy); Mathematical optimization; Exponential distribution; Exponential function; Service (business); Computer network; Mathematics; Artificial intelligence; Statistics","score_opus":0.016074908411723588,"score_gpt":0.20642065235047002,"score_spread":0.19034574393874643,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052410794","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6228089,0.00001595085,0.36909238,0.00008664406,0.000032295746,0.00011425566,7.961049e-8,0.000046650246,0.0078029116],"genre_scores_gemma":[0.9870159,0.0000014250991,0.0125089055,0.00031849087,0.000103929684,0.000010831562,0.0000013004344,0.000010194343,0.000029021925],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880046,0.0000044663343,0.00019496739,0.00034224417,0.00035371396,0.0003041592],"domain_scores_gemma":[0.99943084,0.00003227611,0.00017672901,0.00025321587,0.000094530646,0.000012400262],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004664497,0.00011231814,0.00017527948,0.00018309733,0.00021476102,0.000054361495,0.00039567697,0.000025099684,0.0000065255567],"category_scores_gemma":[0.000019481518,0.00010104934,0.000022273316,0.0019472037,0.0005422206,0.00062434754,0.00013741675,0.000086695494,0.000015734533],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000797884,0.000058161924,0.0032645916,0.000012466353,0.000004959009,0.000004782266,0.00018055015,0.95638645,0.020014508,0.015946409,0.000025220583,0.0040221284],"study_design_scores_gemma":[0.000380093,0.00000999808,0.0045333398,0.00006345674,0.000014239263,0.0000020953282,0.00008252885,0.98743623,0.00056601275,0.0065128133,0.00019361095,0.000205601],"about_ca_topic_score_codex":0.000033850916,"about_ca_topic_score_gemma":0.000054351167,"teacher_disagreement_score":0.36420706,"about_ca_system_score_codex":0.000061451545,"about_ca_system_score_gemma":0.00003784696,"threshold_uncertainty_score":0.41206726},"labels":[],"label_agreement":null},{"id":"W2052677528","doi":"10.1007/s11134-011-9256-8","title":"Heavy traffic approximation for the stationary distribution of stochastic fluid networks","year":2011,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Stationary distribution; Reflected Brownian motion; Queue; Limit (mathematics); Monotonic function; Mathematics; Brownian motion; Statistical physics; Heavy traffic approximation; Path (computing); Stationary state; Distribution (mathematics); Stationary process; Applied mathematics; Fluid queue; Mathematical optimization; Queueing theory; Computer science; Markov chain; Mathematical analysis; Geometric Brownian motion; Physics; Diffusion process; Statistics","score_opus":0.023501384448951026,"score_gpt":0.22341896406826395,"score_spread":0.19991757961931292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052677528","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08024826,0.00032593103,0.9181503,0.000035352772,0.00037515006,0.0006272042,0.000009429561,0.00010203077,0.0001263157],"genre_scores_gemma":[0.998898,0.0000014971953,0.00012038011,0.000032249696,0.0005346753,0.00013000166,0.00020071032,0.0000202121,0.000062274026],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913716,0.000024351288,0.00035235134,0.0001697051,0.00014447546,0.00017197347],"domain_scores_gemma":[0.9989864,0.00020272587,0.0003798556,0.0002232255,0.00020142361,0.0000063289494],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007181467,0.000115809235,0.00018024082,0.000071634015,0.00022458601,0.000056411172,0.00017330957,0.000048894744,0.000010255679],"category_scores_gemma":[0.0001561022,0.00008873553,0.00008840755,0.0003187012,0.000052970718,0.0005042345,0.000027740196,0.00005820762,0.0000098779865],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001108068,0.00004072602,0.00012707766,0.00017768564,0.00008124677,2.770601e-7,0.00011526312,0.84849226,0.000040868614,0.14804906,0.0003749032,0.002389831],"study_design_scores_gemma":[0.00019779337,0.000010762031,0.0005043257,0.00008859658,0.0001463908,0.0000011480706,0.00047570834,0.99633217,0.000010485677,0.0018575739,0.00026174082,0.000113316775],"about_ca_topic_score_codex":0.00020775433,"about_ca_topic_score_gemma":0.000009616007,"teacher_disagreement_score":0.91864973,"about_ca_system_score_codex":0.000034719807,"about_ca_system_score_gemma":0.000008943647,"threshold_uncertainty_score":0.36185297},"labels":[],"label_agreement":null},{"id":"W2052873617","doi":"10.1080/00207721.2013.775384","title":"Performance analysis for queueing systems with close down periods and server under maintenance","year":2013,"lang":"en","type":"article","venue":"International Journal of Systems Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Memorial University of Newfoundland","keywords":"Queue; Queueing theory; Key (lock); Computer science; Transient (computer programming); State (computer science); Queueing system; Function (biology); Probability density function; Transient state; Real-time computing; Reliability engineering; Mathematics; Computer network; Statistics; Operating system; Algorithm; Engineering; Electrical engineering","score_opus":0.011010617580056338,"score_gpt":0.23877887156362368,"score_spread":0.22776825398356734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2052873617","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9738595,0.00015109582,0.023653835,0.00044286082,0.0009263152,0.00019660973,0.0000016639574,0.000017523536,0.0007506319],"genre_scores_gemma":[0.99820167,0.000014559201,0.0004084578,0.00017932635,0.0007910559,0.000018859893,0.0000013319964,0.0000113024125,0.00037344528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981557,0.000013457442,0.00051041186,0.00025128256,0.0008218409,0.0002472834],"domain_scores_gemma":[0.9961693,0.00007804297,0.00093101873,0.00017015112,0.002616434,0.00003504527],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015439044,0.00014465099,0.00031149015,0.0009309858,0.00022781918,0.001219407,0.0007176888,0.000029251682,0.000017157061],"category_scores_gemma":[0.00013944683,0.00009986876,0.00009738187,0.0010050596,0.0002684392,0.0045630718,0.00010369156,0.0001025189,0.000013464765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024259488,0.00008947076,0.26737127,0.00030699087,0.0016697221,0.00003109875,0.000261817,0.6288143,0.0044255573,0.09480317,0.00028048828,0.0017035166],"study_design_scores_gemma":[0.0013366927,0.00008700301,0.083489046,0.00093960646,0.00064052356,0.00026278483,0.004272436,0.90297496,0.00008068839,0.001305268,0.0040887715,0.0005222145],"about_ca_topic_score_codex":0.00057141855,"about_ca_topic_score_gemma":0.000027832504,"teacher_disagreement_score":0.27416065,"about_ca_system_score_codex":0.0001452945,"about_ca_system_score_gemma":0.00006343451,"threshold_uncertainty_score":0.99981743},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Discrete time and continuous time; Computer science; Mathematics; Statistics","score_opus":0.012633880782040982,"score_gpt":0.21998479401939708,"score_spread":0.2073509132373561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2053028813","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5649545,0.0008340568,0.087626465,0.0003297986,0.0010090341,0.00090985425,0.0000022291822,0.0007175365,0.3436165],"genre_scores_gemma":[0.9963384,0.0000018289743,0.00011853554,0.0001247678,0.0002452715,0.00003131869,0.000011304532,0.000028663248,0.0030998557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898773,0.000051266175,0.0003082361,0.00025389172,0.00016619943,0.00023269902],"domain_scores_gemma":[0.99942666,0.000045699424,0.00018742541,0.0002727919,0.00005926876,0.000008163518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079160015,0.0001351124,0.00021789473,0.00028460324,0.000091269074,0.00016884968,0.00014357985,0.000056501638,0.000055767938],"category_scores_gemma":[0.00013772219,0.00013063768,0.000054040087,0.0005743548,0.000017472492,0.0014046521,0.000028254868,0.00009292954,0.0005542071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008397586,0.000020676665,0.0015482459,0.00010722758,0.000018368943,0.000008258176,0.00005771363,0.25866732,0.00072631415,0.7384265,0.0002232155,0.00018776502],"study_design_scores_gemma":[0.00042437343,0.0000037125212,0.00014403975,0.00027272484,0.000049338272,0.0000033844453,0.00036088092,0.8826293,0.000058864305,0.09497189,0.020658735,0.00042278296],"about_ca_topic_score_codex":0.0005492769,"about_ca_topic_score_gemma":0.000026368261,"teacher_disagreement_score":0.6434546,"about_ca_system_score_codex":0.00006567127,"about_ca_system_score_gemma":0.000009390238,"threshold_uncertainty_score":0.7123396},"labels":[],"label_agreement":null},{"id":"W2054274631","doi":"10.1239/aap/1240319586","title":"Approximate probabilities for runs and patterns in i.i.d. and Markov-dependent multistate trials","year":2009,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Markov chain; Poisson distribution; Independent and identically distributed random variables; Sequence (biology); Applied mathematics; Matrix (chemical analysis); Simple (philosophy); Approximations of π; Combinatorics; Discrete mathematics; Statistics; Random variable","score_opus":0.022798879358826796,"score_gpt":0.2823665508565741,"score_spread":0.2595676714977473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054274631","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9770933,0.0009000014,0.014107276,0.0005237406,0.000101435944,0.0041036406,0.00003339042,0.00016182837,0.0029753866],"genre_scores_gemma":[0.98998564,0.00019139943,0.008792742,0.0003095891,0.000114837334,0.00053784356,0.000024619803,0.000019348176,0.000023954386],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977245,0.0000650323,0.0008447541,0.0007718714,0.00016451174,0.00042933837],"domain_scores_gemma":[0.99866664,0.0005709263,0.00035303374,0.00033839056,0.000050851642,0.000020141326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036954815,0.00029823242,0.0007438409,0.0002240209,0.00010759358,0.00012601647,0.00017920125,0.000083868516,0.000017266331],"category_scores_gemma":[0.0008233611,0.00026856846,0.00006442009,0.00029513778,0.0001704684,0.0009648404,0.00011783787,0.0001732272,0.0000015582333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023353093,0.0006039895,0.07016145,0.002878721,0.000030851377,0.0000069120365,0.0006297654,0.006581418,0.00065358315,0.43277717,0.0000070579104,0.4833338],"study_design_scores_gemma":[0.0020777187,0.00002469007,0.0076112617,0.000079237136,0.000034744888,7.9841766e-7,0.00044934885,0.0071664886,0.00014989215,0.98046124,0.0015648053,0.00037976008],"about_ca_topic_score_codex":0.000051035142,"about_ca_topic_score_gemma":0.000996244,"teacher_disagreement_score":0.5476841,"about_ca_system_score_codex":0.00008424896,"about_ca_system_score_gemma":0.000010397195,"threshold_uncertainty_score":0.99997663},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.11256234357756166,"score_gpt":0.44164854840340784,"score_spread":0.32908620482584616,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054587269","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.027624015,0.000036719455,0.9429539,0.012432238,0.00012802551,0.0012319171,0.00012130621,0.00018234484,0.015289531],"genre_scores_gemma":[0.93263835,0.0000091128295,0.057748314,0.003033086,0.00091652555,0.000096523436,0.0010811024,0.000039316245,0.004437672],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985666,0.00007700177,0.00017929863,0.00040925405,0.00034863097,0.000419174],"domain_scores_gemma":[0.9986146,0.00025798872,0.000022186296,0.0006971327,0.00039114853,0.000016939763],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002400353,0.00009771277,0.00013683779,0.00044982464,0.0008868589,0.0004869221,0.0005985459,0.000038959093,0.00019527548],"category_scores_gemma":[0.001516359,0.00008864385,0.000047931826,0.00072277524,0.000025636835,0.0011138808,0.00022575082,0.0002220823,0.00023553375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014655553,0.00037767133,0.000040947925,0.00003379303,0.000056535206,0.000008511446,0.00008889321,0.16161147,0.0030438295,0.7888273,0.029338652,0.016425839],"study_design_scores_gemma":[0.00043119848,0.000029976918,0.00004351938,0.000026099227,0.00002096551,2.6029392e-7,0.0001695094,0.91588664,0.00006205048,0.007239031,0.07597204,0.0001187205],"about_ca_topic_score_codex":0.00013097332,"about_ca_topic_score_gemma":0.0006141474,"teacher_disagreement_score":0.90501434,"about_ca_system_score_codex":0.000057603447,"about_ca_system_score_gemma":0.000031854623,"threshold_uncertainty_score":0.6821091},"labels":[],"label_agreement":null},{"id":"W2054651473","doi":"10.1002/nav.10028","title":"Managing waiting times of backordered demands in single‐stage (<i>Q</i>, <i>r</i>) inventory systems","year":2002,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Mathematical optimization; Lead time; Quasiconvex function; Service (business); Operations research; Measure (data warehouse); Upper and lower bounds; Service level; Inventory control; Mathematics; Operations management; Economics; Data mining; Statistics","score_opus":0.1273790875965748,"score_gpt":0.32372615877037497,"score_spread":0.19634707117380018,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2054651473","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3257389,0.0054416135,0.01785208,0.0015897781,0.0009382487,0.0017635865,0.000033877746,0.0005681006,0.6460738],"genre_scores_gemma":[0.9948831,0.000094673436,0.00024972315,0.00010863242,0.0005106693,0.000027466698,0.000021746946,0.00006058135,0.0040433872],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9964052,0.00020611567,0.0007560995,0.0005404124,0.0011546643,0.0009375265],"domain_scores_gemma":[0.997639,0.000750241,0.00035082147,0.00059686665,0.0006179389,0.00004512934],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003787827,0.00026030932,0.0005095488,0.0012443844,0.0002812794,0.00030147328,0.00070365076,0.00014448077,0.0004683917],"category_scores_gemma":[0.0045413957,0.0002644218,0.00012312185,0.0019913192,0.00046075205,0.0006474614,0.0005608131,0.0006830182,0.00028560904],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032557713,0.0012126155,0.020949297,0.0042437576,0.00026509655,0.0007882124,0.0004547691,0.16549674,0.010269851,0.7753589,0.0066006426,0.014034528],"study_design_scores_gemma":[0.0010390022,0.000059655064,0.00015074201,0.00059686106,0.000064429136,0.0000028121867,0.0018447193,0.9279971,0.00029137084,0.048364274,0.019084442,0.00050456886],"about_ca_topic_score_codex":0.0009569375,"about_ca_topic_score_gemma":0.00018282741,"teacher_disagreement_score":0.7625004,"about_ca_system_score_codex":0.00021377823,"about_ca_system_score_gemma":0.000022918626,"threshold_uncertainty_score":0.9999808},"labels":[],"label_agreement":null},{"id":"W2055250090","doi":"10.1017/s0269964806060037","title":"MONOTONICITY AND CONVEXITY OF SOME FUNCTIONS ASSOCIATED WITH DENUMERABLE MARKOV CHAINS AND THEIR APPLICATIONS TO QUEUING SYSTEMS","year":2005,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Convexity; Monotonic function; Uniformization (probability theory); Markov chain; Monotone polygon; Countable set; Queueing theory; Mathematics; Stochastic dominance; Applied mathematics; Queue; Discrete time and continuous time; Mathematical optimization; Computer science; Discrete mathematics; Markov model; Markov property; Statistics; Mathematical analysis","score_opus":0.011284165596948028,"score_gpt":0.20164827932023482,"score_spread":0.1903641137232868,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055250090","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9947123,0.0001005565,0.0039035764,0.0006151476,0.000013452378,0.0002920224,0.0000049157884,0.00002666138,0.0003313858],"genre_scores_gemma":[0.9995747,0.000004638619,0.00019610273,0.00010971977,0.000033787637,0.00006817529,0.0000036448978,0.0000016071978,0.000007627273],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995087,0.000009141701,0.00017031317,0.00009682854,0.00011057813,0.00010444736],"domain_scores_gemma":[0.99961126,0.00017931353,0.00007873298,0.0000671093,0.00005375274,0.000009810082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012981412,0.00006921074,0.00009924188,0.00011010158,0.00020343788,0.00011331359,0.000091754686,0.00001819701,0.0000015551492],"category_scores_gemma":[0.00017776141,0.000044288015,0.000009357292,0.00041707512,0.0001237514,0.0010893063,0.000045207988,0.00006113213,6.9281765e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000063439365,0.000023821263,0.00447862,0.0001074399,0.00001209469,1.6600444e-8,0.0005703133,0.8856079,0.00004080086,0.10764966,0.0000046664204,0.0014983043],"study_design_scores_gemma":[0.000093227834,0.000009965638,0.0062728752,0.000044702076,0.000008795763,0.0000014120855,0.0007293158,0.98828024,0.00001056038,0.0037181887,0.0007465107,0.00008419686],"about_ca_topic_score_codex":0.00008027832,"about_ca_topic_score_gemma":0.00005360521,"teacher_disagreement_score":0.10393147,"about_ca_system_score_codex":0.000020479845,"about_ca_system_score_gemma":0.000009699035,"threshold_uncertainty_score":0.18060128},"labels":[],"label_agreement":null},{"id":"W2055985121","doi":"10.1016/s0377-2217(99)00313-6","title":"An exponential queue with competition for service","year":2000,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Service (business); Computer science; Competition (biology); Queue; Operations research; Epoch (astronomy); Queueing theory; Float (project management); Operations management; Computer network; Mathematics; Business; Economics; Marketing; Management","score_opus":0.05478906906631784,"score_gpt":0.33206831378748947,"score_spread":0.2772792447211716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2055985121","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95607877,0.000028655659,0.015525015,0.0035648698,0.00006164092,0.00019050823,0.000004343834,0.00002048215,0.02452573],"genre_scores_gemma":[0.99300116,0.000006027986,0.0030823066,0.00088143913,0.0024263142,0.0000031194343,0.000042735195,0.000030782354,0.000526123],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99854296,0.00022100132,0.00028732125,0.00014293371,0.0006152767,0.00019048396],"domain_scores_gemma":[0.9977951,0.0000976543,0.000105128885,0.00013970208,0.0018344821,0.000027934439],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0036727535,0.00008286735,0.000118467324,0.00028032565,0.00040358616,0.00040308427,0.00035247504,0.00001102251,0.0017384399],"category_scores_gemma":[0.00012237225,0.00006449022,0.000048647533,0.0004296864,0.000061373044,0.0017731023,0.000024845049,0.0002248149,0.00029646727],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009482756,0.0011963713,0.0008616904,0.00022361372,0.00035620006,0.0005343922,0.0006266606,0.41936374,0.047611825,0.45903164,0.0053373356,0.055373784],"study_design_scores_gemma":[0.010475249,0.0018952867,0.017149962,0.00074984616,0.00026348405,0.00028251956,0.0022492043,0.10668359,0.0016092055,0.031750582,0.82572025,0.001170795],"about_ca_topic_score_codex":0.000013521066,"about_ca_topic_score_gemma":0.00002178013,"teacher_disagreement_score":0.82038295,"about_ca_system_score_codex":0.000029200648,"about_ca_system_score_gemma":0.00005419796,"threshold_uncertainty_score":0.9991741},"labels":[],"label_agreement":null},{"id":"W2058354071","doi":"10.1007/s10479-007-0303-0","title":"Stationary tail asymptotics of a tandem queue with feedback","year":2007,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Queue; Fork–join queue; Bulk queue; Multilevel queue; Computer science; Mathematics; Queue management system; Computer network","score_opus":0.1236258459482162,"score_gpt":0.40466427930456744,"score_spread":0.28103843335635126,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058354071","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95101625,0.00012903332,0.01874636,0.002419101,0.000025074236,0.00031778438,0.000008359434,0.000031715597,0.027306348],"genre_scores_gemma":[0.9961713,0.000028449183,0.0021601636,0.00022583119,0.00014732266,0.0000082398865,0.000039523075,0.000016938915,0.0012022544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853563,0.00003967034,0.0003422785,0.00017630548,0.0006224099,0.00028369363],"domain_scores_gemma":[0.996711,0.00022695864,0.00007490746,0.00028778045,0.0026820728,0.000017242519],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026567995,0.00008589794,0.00017313095,0.00064872944,0.00024545964,0.00006807953,0.00023685375,0.00004274321,0.0002768552],"category_scores_gemma":[0.00063589343,0.00007279322,0.000048037793,0.0016094293,0.00026547414,0.00084969937,0.000098616416,0.00016808187,0.000057619218],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005185115,0.0007589639,0.017942706,0.00027697833,0.00031949632,0.00003103774,0.00048140963,0.20195429,0.010143054,0.7535338,0.004810927,0.009228861],"study_design_scores_gemma":[0.0070156683,0.0016702423,0.16694856,0.0018910487,0.00047343626,0.000025080444,0.031927507,0.32049313,0.1500228,0.21102938,0.10536592,0.003137236],"about_ca_topic_score_codex":0.00034855778,"about_ca_topic_score_gemma":0.00081367214,"teacher_disagreement_score":0.5425044,"about_ca_system_score_codex":0.000012677262,"about_ca_system_score_gemma":0.000079274956,"threshold_uncertainty_score":0.30313703},"labels":[],"label_agreement":null},{"id":"W2058768269","doi":"10.1023/b:ques.0000027996.28824.89","title":"Mean Waiting Time Approximations in the G/G/1 Queue","year":2004,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"National Science Foundation","keywords":"Queue; Renewal theory; Burke's theorem; Poisson distribution; Computer science; Dispersion (optics); Markovian arrival process; Markov chain; Mathematics; Applied mathematics; Algorithm; Statistics; Real-time computing; Queue management system; Fork–join queue; Physics; Computer network","score_opus":0.012977101201529636,"score_gpt":0.21979064358650896,"score_spread":0.20681354238497932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2058768269","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8594115,0.00042384717,0.018925302,0.0032096817,0.000572695,0.0011791241,0.0000030764784,0.00075809826,0.1155167],"genre_scores_gemma":[0.9979682,7.530515e-7,0.00013396617,0.0005726925,0.00088887877,0.000067307294,0.000018913883,0.000030132223,0.00031916396],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986647,0.000060126647,0.0004072041,0.00027104476,0.00028398808,0.00031297488],"domain_scores_gemma":[0.99914575,0.0001182058,0.0002591236,0.0003947211,0.00007443642,0.00000777414],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014763762,0.00017263497,0.00023700092,0.00029233992,0.00030165128,0.00041282704,0.0004176697,0.000058571484,0.000026236703],"category_scores_gemma":[0.00021858358,0.00013229267,0.00008699129,0.0009442322,0.000045785717,0.0009648224,0.000064440275,0.0001918606,0.0007543574],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000058839073,0.000054733344,0.0003865913,0.0001419429,0.000025469824,0.000027995029,0.00079511444,0.13519484,0.0007060855,0.8621596,0.00013749095,0.0003642207],"study_design_scores_gemma":[0.0025486962,0.000024903044,0.0007732902,0.0020993573,0.00032883053,0.000073273026,0.020172944,0.7420988,0.00017466838,0.18130411,0.048682015,0.0017190909],"about_ca_topic_score_codex":0.0021415986,"about_ca_topic_score_gemma":0.00017613414,"teacher_disagreement_score":0.6808555,"about_ca_system_score_codex":0.00009301431,"about_ca_system_score_gemma":0.000016839163,"threshold_uncertainty_score":0.9695989},"labels":[],"label_agreement":null},{"id":"W2059733923","doi":"10.3182/20060607-3-it-3902.00032","title":"STOCHASTIC HYBRID NETCAD SYSTEMS FOR MODELING CALL ADMISSION AND ROUTING CONTROL IN NETWORKS","year":2006,"lang":"en","type":"article","venue":"IFAC Proceedings Volumes","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; McGill University","funders":"","keywords":"State space; Stochastic process; Hybrid system; State (computer science); Routing (electronic design automation); Computer science; Mathematical optimization; Markov process; Continuous-time stochastic process; Piecewise; Event (particle physics); Call Admission Control; Stochastic optimization; Mathematics; Algorithm; Computer network; Wireless network; Wireless","score_opus":0.008539682152051352,"score_gpt":0.21188442867237026,"score_spread":0.2033447465203189,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2059733923","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5162822,0.001203629,0.48079687,0.00022103757,0.0001850548,0.00068418594,0.0000025768427,0.00022645634,0.0003979813],"genre_scores_gemma":[0.99754626,0.0000057909856,0.00028237028,0.00018360042,0.0016128531,0.00009405392,0.000013916084,0.000048094687,0.00021307658],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984759,0.0000037476223,0.00045070736,0.0004359007,0.00016234364,0.00047138208],"domain_scores_gemma":[0.99931556,0.00007448793,0.00028266828,0.00007611627,0.0002299383,0.000021252317],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006552104,0.0002403329,0.00038198798,0.0002546541,0.00025462412,0.00041045493,0.00015619365,0.000078911515,0.0000030043864],"category_scores_gemma":[0.0003149157,0.00023612508,0.00007160778,0.00028983044,0.000034177345,0.0010677534,0.00007869827,0.0001628985,0.0000047130807],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001867436,0.000033866047,0.007409413,0.00024399809,0.000024648813,0.000002642627,0.00002487311,0.9732532,0.0002701404,0.016381942,0.00047594865,0.0016925904],"study_design_scores_gemma":[0.00094234606,0.000010526819,0.000084480664,0.00025301124,0.00010152498,0.0000033237702,0.00019077999,0.9901158,0.0000027472704,0.0073599215,0.0006559835,0.00027952655],"about_ca_topic_score_codex":0.0004701003,"about_ca_topic_score_gemma":0.000025633775,"teacher_disagreement_score":0.48126405,"about_ca_system_score_codex":0.00005858941,"about_ca_system_score_gemma":0.000008868956,"threshold_uncertainty_score":0.96289015},"labels":[],"label_agreement":null},{"id":"W2060240953","doi":"10.1016/j.orl.2003.09.006","title":"Analysis of the discrete-time bulk-service queue Geo/GY/1/N+B","year":2004,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Bernoulli's principle; Queue; Queueing theory; Random variable; Service (business); Bulk queue; Computer science; Bernoulli trial; Applied mathematics; Burke's theorem; Discrete time and continuous time; Variable (mathematics); Mathematics; Mathematical optimization; Queue management system; Statistics; Physics; Computer network; Fork–join queue; Mathematical analysis","score_opus":0.025128764168466117,"score_gpt":0.30822822908588654,"score_spread":0.28309946491742044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060240953","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9418885,0.00001816159,0.0034034713,0.051865496,0.000050041148,0.00030434073,0.000011114345,0.000050073017,0.0024088195],"genre_scores_gemma":[0.9936585,0.0000031696056,0.00036278748,0.0050738207,0.00023296158,0.000047992693,0.0000812504,0.000022561542,0.00051695417],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981819,0.00010003523,0.00031224883,0.00033123943,0.00069793226,0.00037666308],"domain_scores_gemma":[0.99846745,0.000106088235,0.000063842024,0.0008093207,0.00053519645,0.000018126868],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012153311,0.00013631643,0.00025127034,0.0009554425,0.0007918926,0.00032161118,0.0007685824,0.000044409797,0.0006477407],"category_scores_gemma":[0.00053848576,0.00010011149,0.00022274496,0.0073539964,0.00023924024,0.00093222625,0.00037451374,0.00030976854,0.00046320577],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013771461,0.000056605488,0.0007313627,0.000019024259,0.0004138632,0.0000030949136,0.00013103156,0.9401326,0.041037727,0.01698232,0.00037492503,0.0001036492],"study_design_scores_gemma":[0.0018347838,0.000027741502,0.0241969,0.00023436126,0.003243978,0.0000022458407,0.001404992,0.92592,0.006437783,0.007642614,0.027892178,0.0011624206],"about_ca_topic_score_codex":0.0051034987,"about_ca_topic_score_gemma":0.003708448,"teacher_disagreement_score":0.05177002,"about_ca_system_score_codex":0.00012237606,"about_ca_system_score_gemma":0.000053444353,"threshold_uncertainty_score":0.77149975},"labels":[],"label_agreement":null},{"id":"W2060290814","doi":"10.1007/s10463-006-0038-8","title":"Waiting Time Distributions of Simple and Compound Patterns in a Sequence of r-th Order Markov Dependent Multi-state Trials","year":2006,"lang":"en","type":"article","venue":"Annals of the Institute of Statistical Mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Manitoba","funders":"","keywords":"Markov chain; Mathematics; Independent and identically distributed random variables; Stochastic matrix; Sequence (biology); Discrete phase-type distribution; Continuous-time Markov chain; Applied mathematics; Geometric distribution; Probability distribution; Markov property; Markov model; Simple (philosophy); Eigenvalues and eigenvectors; Matrix (chemical analysis); Markov process; Markov chain mixing time; Combinatorics; Statistics; Random variable","score_opus":0.08048170647761914,"score_gpt":0.3362575385045916,"score_spread":0.25577583202697246,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060290814","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82792944,0.000029309656,0.17042226,0.00016607008,0.00002899787,0.00026595054,0.0009014107,0.000009253625,0.00024734144],"genre_scores_gemma":[0.9829443,0.000010562809,0.016897727,0.000027277907,0.00001952684,0.0000044999724,0.000059518108,0.000010576724,0.000025988276],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981851,0.000050204762,0.0011894242,0.00013936995,0.00026870542,0.00016721757],"domain_scores_gemma":[0.9975028,0.0007396212,0.0011724896,0.00025287474,0.00032168496,0.000010496625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012564727,0.00014049873,0.000698268,0.0001193384,0.00005181674,0.000018558916,0.0002373789,0.000037003385,0.000041028674],"category_scores_gemma":[0.0027146528,0.00010552266,0.000089394955,0.0003397492,0.0003919854,0.00026071895,0.00019342717,0.000080453436,0.0000016528201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016918802,0.001586419,0.006403794,0.0051466255,0.00030993676,0.000022481863,0.0002170835,0.024450243,0.02238748,0.9350247,0.00018655654,0.0040954934],"study_design_scores_gemma":[0.0012157051,0.000029920093,0.0042463583,0.0012271163,0.00038887642,0.0000046337,0.00022191564,0.21143167,0.009034123,0.77174425,0.00013917113,0.0003162824],"about_ca_topic_score_codex":0.0009547199,"about_ca_topic_score_gemma":0.0002838626,"teacher_disagreement_score":0.18698142,"about_ca_system_score_codex":0.000009588758,"about_ca_system_score_gemma":0.00002571472,"threshold_uncertainty_score":0.4303089},"labels":[],"label_agreement":null},{"id":"W2060868702","doi":"10.1057/palgrave.rpm.5170129","title":"Additional Academic Paper: Pricing of shared computer services","year":2005,"lang":"en","type":"article","venue":"Journal of Revenue and Pricing Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Leaky bucket; Token bucket; Revenue management; Computer science; Security token; Metric (unit); Service (business); Mathematical optimization; Performance metric; Operations research; Computer network; Economics; Mathematics; Revenue; Quality of service; Operations management; Business; Marketing","score_opus":0.008092595495084903,"score_gpt":0.22472099691567546,"score_spread":0.21662840142059056,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2060868702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94044626,0.005870104,0.027102454,0.009952577,0.0013259081,0.001001383,0.00054562534,0.00013651475,0.013619148],"genre_scores_gemma":[0.9652896,0.000614169,0.0239945,0.004778589,0.004396302,0.0000068979894,0.00011899423,0.00003864469,0.00076230225],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989858,0.00001644839,0.0004680819,0.00012437865,0.00026217988,0.0001430715],"domain_scores_gemma":[0.99878603,0.00009569385,0.000875406,0.000113224654,0.00011557199,0.000014059644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050643424,0.000115090756,0.00025112345,0.00032338293,0.00009212187,0.00004813816,0.00021823216,0.00003762787,0.000666527],"category_scores_gemma":[0.000022765751,0.00010258262,0.00009487039,0.00028441462,0.000026729222,0.0010875568,0.00016089482,0.00018606085,0.000025922365],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031583864,0.00024399592,0.0052567404,0.0033265036,0.001272434,0.000149952,0.0009252784,0.037335794,0.0010425091,0.019399993,0.20935273,0.7213782],"study_design_scores_gemma":[0.00069121306,0.000029902276,0.011014224,0.0016979444,0.000406635,0.000022860759,0.00021235645,0.0064257663,0.000022503129,0.008737868,0.97052073,0.00021798907],"about_ca_topic_score_codex":0.0000067765773,"about_ca_topic_score_gemma":0.000006684424,"teacher_disagreement_score":0.761168,"about_ca_system_score_codex":0.000026690177,"about_ca_system_score_gemma":0.0000048969855,"threshold_uncertainty_score":0.72980034},"labels":[],"label_agreement":null},{"id":"W2061086504","doi":"10.1145/1060576.1060578","title":"Simulating markov-reward processes with rare events","year":2005,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Markov chain; Markov process; Computer science; Rare events; Mathematical optimization; Boundary (topology); Markov decision process; Mathematical economics; Markov renewal process; Markov model; Statistical physics; Applied mathematics; Mathematics; Variable-order Markov model; Statistics; Machine learning; Physics; Mathematical analysis","score_opus":0.019117381041608227,"score_gpt":0.24610024124230387,"score_spread":0.22698286020069564,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061086504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23937777,0.000020045845,0.7599651,0.0002501415,0.000040084455,0.000101308164,8.3187837e-7,0.00017827972,0.00006639326],"genre_scores_gemma":[0.9732088,0.000005540118,0.025683789,0.0005962518,0.00041083316,0.000009245806,0.000013524676,0.0000284243,0.000043596418],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990662,0.000012480605,0.00022283511,0.0003301802,0.00019179475,0.00017653387],"domain_scores_gemma":[0.9992721,0.0001654882,0.00009836289,0.00026384776,0.00018515442,0.000015022155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001290379,0.0001824923,0.00015859197,0.00022324597,0.00040153504,0.00012442897,0.00013603795,0.000051439973,0.000024266657],"category_scores_gemma":[0.000026847345,0.00016323765,0.00004464138,0.0003463199,0.000014805274,0.0012056828,0.000012415342,0.000130442,0.000020096784],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008719981,0.000049070524,0.00016156785,0.000064408756,0.000031514202,6.166713e-7,0.00006994237,0.9069774,0.0000020832624,0.000057257188,7.9317925e-7,0.09249812],"study_design_scores_gemma":[0.00050649524,0.000018715016,0.000033870372,0.00013556232,0.00009249632,0.0000010180617,0.000037356083,0.9949415,0.0000070828382,0.0038306536,0.00018602639,0.00020923762],"about_ca_topic_score_codex":0.000020892352,"about_ca_topic_score_gemma":0.00004838274,"teacher_disagreement_score":0.73428136,"about_ca_system_score_codex":0.000024251423,"about_ca_system_score_gemma":0.00001219893,"threshold_uncertainty_score":0.6656638},"labels":[],"label_agreement":null},{"id":"W2061402966","doi":"10.1239/aap/1067436338","title":"Algorithmic analysis of the BMAP/D/<i>k</i> system in discrete time","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Mathematics; Interval (graph theory); Property (philosophy); Joint probability distribution; Carry (investment); Discrete time and continuous time; Order (exchange); Server; Algorithm; Discrete mathematics; Computer science; Combinatorics; Computer network; Statistics","score_opus":0.005707898339153302,"score_gpt":0.21666608101600673,"score_spread":0.21095818267685343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2061402966","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8151078,0.00075780385,0.010535932,0.00012561234,0.00030023127,0.002198653,0.000019380652,0.00022539102,0.17072915],"genre_scores_gemma":[0.9978886,0.000006627581,0.0017864485,0.00009876945,0.00003308388,0.000113860515,0.000009026187,0.000015708334,0.000047859896],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809855,0.000089062545,0.0006856521,0.0005198275,0.0002863899,0.00032049662],"domain_scores_gemma":[0.99851626,0.00017964908,0.00043487732,0.0008032846,0.000056492285,0.000009424438],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016709063,0.00021750035,0.0006096764,0.00039605648,0.000079956815,0.000028636832,0.00045670065,0.00006934089,0.00007994231],"category_scores_gemma":[0.00025936536,0.0001650565,0.00020446192,0.0049891635,0.00021480626,0.0005189107,0.00014073701,0.00020393336,0.000029176326],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000912073,0.00016624124,0.08604378,0.0004481539,0.0001377217,0.0000020468185,0.00006829721,0.30020428,0.00048584156,0.6080198,0.0000038977273,0.004328738],"study_design_scores_gemma":[0.002390543,0.0000132962605,0.03153167,0.00031851963,0.0020529185,0.0000012846634,0.0012022902,0.17281435,0.0018750982,0.759483,0.026868084,0.0014489527],"about_ca_topic_score_codex":0.00007038746,"about_ca_topic_score_gemma":0.00062596705,"teacher_disagreement_score":0.18278077,"about_ca_system_score_codex":0.00017813954,"about_ca_system_score_gemma":0.000017989505,"threshold_uncertainty_score":0.67308086},"labels":[],"label_agreement":null},{"id":"W2063579543","doi":"","title":"Simulation of Adversarial Scenarios in OMNeT++ – Putting Adversarial Queueing Theory from Its Head to Feet","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Adversarial system; Computer science; Queueing theory; Probabilistic logic; Stability (learning theory); Operations research; Artificial intelligence; Distributed computing; Machine learning; Engineering; Computer network","score_opus":0.01705231494852793,"score_gpt":0.25863852647111024,"score_spread":0.2415862115225823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063579543","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.817922,0.000020350511,0.17415787,0.00080988515,0.00059327576,0.0004076508,0.000006539641,0.00018720671,0.005895215],"genre_scores_gemma":[0.9962445,8.513626e-7,0.001415477,0.00062130514,0.0012881266,0.0000076618,0.000012967926,0.00003313519,0.00037600767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832124,0.000070436516,0.00054021104,0.00044419535,0.00028741974,0.00033648408],"domain_scores_gemma":[0.9982389,0.00094690034,0.00031001912,0.00031662232,0.00016625522,0.000021265374],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00097154104,0.00021590017,0.00035710333,0.00047349115,0.00009710865,0.000057261434,0.00029217763,0.0001041639,0.0011166304],"category_scores_gemma":[0.0023494728,0.00016859737,0.000115401956,0.0006562215,0.000038187794,0.0016429677,0.00025774856,0.00009214119,0.00030000502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014588095,0.00011899353,0.010536198,0.000043996868,0.00011520672,0.000013893178,0.00035595748,0.8410953,0.02531999,0.079495445,0.000085516534,0.041360665],"study_design_scores_gemma":[0.010610783,0.000066284214,0.007815293,0.0014750288,0.00046798095,3.4049364e-7,0.0016178703,0.69662166,0.0061870427,0.2604525,0.013050885,0.0016343576],"about_ca_topic_score_codex":0.0010194746,"about_ca_topic_score_gemma":0.0009608559,"teacher_disagreement_score":0.18095705,"about_ca_system_score_codex":0.00009184388,"about_ca_system_score_gemma":0.000022106573,"threshold_uncertainty_score":0.9997965},"labels":[],"label_agreement":null},{"id":"W2063602291","doi":"10.1057/jors.2013.149","title":"Queueing Networks: A Fundamental Approach","year":2013,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina","funders":"","keywords":"Queueing theory; Computer science; Operations research; Scheduling (production processes); Project management; Distributed computing; Mathematical optimization; Computer network; Mathematics; Systems engineering; Engineering","score_opus":0.04623458807439799,"score_gpt":0.31629052565665644,"score_spread":0.27005593758225843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2063602291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89958453,0.00075302797,0.04523758,0.027356587,0.00082748994,0.0010165212,0.000001820794,0.00004637958,0.025176054],"genre_scores_gemma":[0.9905596,0.000023187253,0.0033829443,0.0019841937,0.002516002,0.000014514647,0.0000028096738,0.000016204021,0.0015005403],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981725,0.00009298894,0.0003218459,0.000121476085,0.0010100192,0.00028117435],"domain_scores_gemma":[0.9982789,0.00018771167,0.00021557466,0.00017571525,0.0011201125,0.000021964013],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0031211374,0.00009248509,0.0001469938,0.00008107653,0.0007914191,0.0006654282,0.000592339,0.000050471674,0.00048747938],"category_scores_gemma":[0.0004925786,0.000056326746,0.00034533493,0.0007222919,0.00019315415,0.0019348022,0.00033171914,0.00066761347,0.00007125276],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009397536,0.0005440905,0.013953425,0.00011422651,0.0007341617,0.000004880267,0.0006400882,0.46667594,0.008680863,0.17856348,0.32645974,0.0035351387],"study_design_scores_gemma":[0.0008640817,0.00002546984,0.007827545,0.000121957295,0.00006729559,0.000028501865,0.0045718644,0.89650863,0.000088471745,0.05082428,0.038811438,0.0002604494],"about_ca_topic_score_codex":0.000087937755,"about_ca_topic_score_gemma":0.000003344199,"teacher_disagreement_score":0.4298327,"about_ca_system_score_codex":0.00016202324,"about_ca_system_score_gemma":0.00008134451,"threshold_uncertainty_score":0.6416739},"labels":[],"label_agreement":null},{"id":"W2064815755","doi":"10.1016/j.cor.2006.12.024","title":"Performance evaluation of a single-stage two-product manufacturing system operating under pull-type control","year":2006,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":32,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Bilkent Üniversitesi; National Science Council","keywords":"Polling system; Polling; Markov chain; Queue; Computer science; Decomposition; Flexible manufacturing system; Set (abstract data type); Product type; Product (mathematics); Type (biology); Mathematical optimization; Mathematics","score_opus":0.07767430333063105,"score_gpt":0.33852048345445374,"score_spread":0.26084618012382266,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2064815755","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96587205,0.00011171413,0.02773042,0.00028777146,0.00027060285,0.0007403742,0.000002297437,0.000113766306,0.0048709777],"genre_scores_gemma":[0.99680597,0.0000013376042,0.0016291714,0.00007176741,0.0009967355,0.000052127038,0.00006894814,0.00003301719,0.00034090588],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99725634,0.00026386976,0.000507641,0.00046513454,0.0010824547,0.00042453883],"domain_scores_gemma":[0.99722075,0.00013874366,0.00009871767,0.00054311025,0.0019821578,0.000016521595],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004363133,0.00018324317,0.00027549657,0.0006794621,0.0009028923,0.0005345986,0.0004033325,0.000042447486,0.000106069856],"category_scores_gemma":[0.00019965872,0.00017532235,0.000068367466,0.0009835275,0.00013512438,0.0013707007,0.00019651676,0.0002564817,0.00012257519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022564453,0.00007494525,0.00045796277,0.00011142425,0.000039478164,0.0000020304685,0.000027924712,0.96460235,0.018559502,0.011988483,0.0001013367,0.0040119723],"study_design_scores_gemma":[0.00089645496,0.000021312046,0.001070202,0.00013541187,0.000071471346,0.0000022791253,0.0003303675,0.990483,0.006406896,0.00013022676,0.00026930872,0.00018306526],"about_ca_topic_score_codex":0.00082904083,"about_ca_topic_score_gemma":0.0002469905,"teacher_disagreement_score":0.030933915,"about_ca_system_score_codex":0.0003111392,"about_ca_system_score_gemma":0.00009474233,"threshold_uncertainty_score":0.71494377},"labels":[],"label_agreement":null},{"id":"W2066310491","doi":"10.1016/s0895-7177(01)00165-0","title":"Recursive solution to a quorum queueing system","year":2002,"lang":"en","type":"article","venue":"Mathematical and Computer Modelling","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"École de Technologie Supérieure","funders":"","keywords":"Queueing theory; Computer science; Layered queueing network; Queueing system; Distributed computing; Mathematical optimization; Mathematics; Computer network","score_opus":0.027361293637128074,"score_gpt":0.20084582668940912,"score_spread":0.17348453305228104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066310491","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03871806,0.00006945475,0.9577709,0.00054167764,0.0000658839,0.00012745401,2.6392073e-7,0.0001977486,0.0025085865],"genre_scores_gemma":[0.93190265,0.0000036360066,0.06653791,0.0007141711,0.00065476814,0.000014468873,0.0000013243174,0.000022029777,0.00014904299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907446,0.000010951265,0.00024419787,0.00027088448,0.0001495656,0.00024993392],"domain_scores_gemma":[0.99960613,0.00006031029,0.000077831275,0.00016887378,0.000060809405,0.000026016458],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022074107,0.00014546579,0.00023370144,0.00013977157,0.00020421855,0.00019175136,0.00012287953,0.00004123359,0.00004358982],"category_scores_gemma":[0.000011868911,0.00012785,0.00006283789,0.00023613924,0.000022737777,0.00038182142,0.0001617536,0.00008420322,0.00050532765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008253801,0.000046246954,0.000008601163,0.0003404176,0.000025399733,0.000010373721,0.00026549364,0.13680433,0.000020620273,0.84975994,0.00021919618,0.012491138],"study_design_scores_gemma":[0.00008808588,0.000006167826,6.825018e-7,0.0002480667,0.000041193907,0.000005582317,0.00006513399,0.90172374,0.000007178919,0.09683468,0.000827131,0.00015233594],"about_ca_topic_score_codex":0.000012917686,"about_ca_topic_score_gemma":9.857081e-7,"teacher_disagreement_score":0.8931846,"about_ca_system_score_codex":0.0000250887,"about_ca_system_score_gemma":8.623563e-7,"threshold_uncertainty_score":0.6495133},"labels":[],"label_agreement":null},{"id":"W2066381169","doi":"10.1080/15326340008807585","title":"Use of the supremum distribution of Gaussian Processes in queueing analysis with long-range Dependence and self-similarity","year":2000,"lang":"en","type":"article","venue":"Communications in Statistics Stochastic Models","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Infimum and supremum; Queueing theory; Mathematics; Gaussian; Range (aeronautics); Queue; Statistical physics; Self-similarity; Similarity (geometry); Mean value analysis; Variance (accounting); Distribution (mathematics); Applied mathematics; Bulk queue; Statistics; Discrete mathematics; Mathematical analysis; Computer science; Physics; Quantum mechanics","score_opus":0.04103683169713309,"score_gpt":0.27664741866616127,"score_spread":0.23561058696902817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2066381169","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16789144,0.00012540197,0.8313878,0.00010413502,0.0000041987532,0.00022001014,0.00012879292,0.000015917483,0.00012228142],"genre_scores_gemma":[0.9818214,0.00009191882,0.017902356,0.000024679783,0.00000444185,0.00002796522,0.000104783474,0.000009657102,0.000012764946],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990166,0.000066204615,0.0004083862,0.0001807803,0.00018770056,0.00014034711],"domain_scores_gemma":[0.9979885,0.00055234926,0.0002837496,0.000916983,0.00024970778,0.000008702028],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033152153,0.00012023677,0.00027992437,0.0002191508,0.00012843488,0.00004620938,0.00049980835,0.00004073877,0.000016602251],"category_scores_gemma":[0.00037855317,0.000099652585,0.000027253755,0.002016164,0.00028375268,0.0006464666,0.00021082698,0.00017207477,4.5993713e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004770267,0.00025148605,0.040317297,0.00018003667,0.000097075936,9.861336e-7,0.00043469013,0.86274093,0.0000026080436,0.09479304,0.0000025599054,0.0011315626],"study_design_scores_gemma":[0.00019188046,0.000005132458,0.02783228,0.00016186968,0.0005031852,6.0970535e-7,0.00008409558,0.93030274,0.000002029827,0.040792014,0.0000089300265,0.00011522257],"about_ca_topic_score_codex":0.0015441548,"about_ca_topic_score_gemma":0.01394604,"teacher_disagreement_score":0.81393,"about_ca_system_score_codex":0.000043217176,"about_ca_system_score_gemma":0.000042141197,"threshold_uncertainty_score":0.7782218},"labels":[],"label_agreement":null},{"id":"W2068769043","doi":"10.1214/aoap/1019487511","title":"Strong approximations for multiclass feedforward queueing networks","year":2000,"lang":"en","type":"article","venue":"The Annals of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":25,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Queue; Layered queueing network; FIFO (computing and electronics); Heavy traffic approximation; Approximation algorithm; Mathematics; Computer science; Mathematical optimization; Discrete mathematics; Computer network","score_opus":0.05819194216930973,"score_gpt":0.2881690900799763,"score_spread":0.2299771479106666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2068769043","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8425331,0.000094800846,0.08927714,0.0042739306,0.00008954987,0.0029421833,0.000017072227,0.00036573803,0.06040648],"genre_scores_gemma":[0.9960519,0.0000055362025,0.0024199188,0.0008018203,0.0003437641,0.00019596748,0.00002407971,0.000023225395,0.00013376119],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99874413,0.00001828643,0.00042556622,0.00030439586,0.0001653901,0.00034222993],"domain_scores_gemma":[0.9986881,0.00024811493,0.00026375422,0.00059222523,0.00019479284,0.000012983038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016414614,0.00017560353,0.00029095937,0.00006108768,0.0003287057,0.000079050915,0.0004167767,0.00006296884,0.00017600934],"category_scores_gemma":[0.00011794157,0.00013215683,0.0001912016,0.0004557477,0.00020891233,0.00039362063,0.00008326543,0.00013560831,0.000027555625],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005426278,0.00015695291,0.00013919626,0.00021918403,0.00010065128,8.3850885e-8,0.000113277936,0.5373537,0.00010514827,0.39978543,0.00043844848,0.06104531],"study_design_scores_gemma":[0.00038027746,0.000009309029,0.00050460687,0.000021919255,0.000113405615,1.1799041e-7,0.00016506176,0.34816033,0.00043369664,0.63561594,0.014360089,0.00023526234],"about_ca_topic_score_codex":0.00005528002,"about_ca_topic_score_gemma":0.00004209199,"teacher_disagreement_score":0.23583049,"about_ca_system_score_codex":0.000013025665,"about_ca_system_score_gemma":0.000010695208,"threshold_uncertainty_score":0.5389199},"labels":[],"label_agreement":null},{"id":"W2069220392","doi":"10.1080/0740817x.2013.783251","title":"Measurement and optimization of supply chain responsiveness","year":2013,"lang":"en","type":"article","venue":"IIE Transactions","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Erlang (programming language); Queue; Supply chain; Exponential distribution; Random variable; Erlang distribution; Interval (graph theory); Exponential function; Supply chain management; Queueing theory; Stage (stratigraphy); Computer science; Mathematical optimization; Mathematics; Operations research; Statistics; Computer network; Combinatorics","score_opus":0.016263684998470338,"score_gpt":0.21563752348976092,"score_spread":0.1993738384912906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2069220392","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.056694034,0.00008973055,0.94078296,0.0012044285,0.00008665929,0.00022704083,0.0000018870384,0.00007791671,0.00083531986],"genre_scores_gemma":[0.9977157,0.000014007267,0.0019057023,0.00014462898,0.00004905326,0.00003666511,0.000003044732,0.000012602082,0.000118570155],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994468,0.000015279047,0.00016049536,0.00012960892,0.00014599129,0.00010180443],"domain_scores_gemma":[0.99947906,0.000024369601,0.000084027975,0.0001315386,0.0002725357,0.000008444929],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023354964,0.00007961843,0.00011657956,0.00019811743,0.0001267239,0.000043666336,0.00006133549,0.00002952209,0.00071555737],"category_scores_gemma":[0.000042822405,0.000077915756,0.000044640434,0.0003200119,0.00005118743,0.0007499568,0.0000051726192,0.000050309198,0.00002668758],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010179824,0.00012160224,0.00040304614,0.00014526518,0.00010745832,0.0000011118791,0.00010320505,0.96824545,0.010468314,0.005151002,0.00007747419,0.015074295],"study_design_scores_gemma":[0.0026213992,0.00005711548,0.018103257,0.00041319695,0.0011444596,0.0000074404406,0.002291971,0.925385,0.007495788,0.033288013,0.008096719,0.0010956611],"about_ca_topic_score_codex":0.00025248865,"about_ca_topic_score_gemma":0.000059533624,"teacher_disagreement_score":0.9410217,"about_ca_system_score_codex":0.000018554563,"about_ca_system_score_gemma":0.000008704083,"threshold_uncertainty_score":0.7834851},"labels":[],"label_agreement":null},{"id":"W2071777054","doi":"10.1016/j.peva.2011.11.001","title":"Analysis of discrete-time MAP/G/1 queue under workload control","year":2011,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Ministry of Education, Science and Technology; National Research Foundation of Korea","keywords":"Workload; Queue; Computer science; Idle; Service (business); Real-time computing; Queueing theory; Computer network; Operating system","score_opus":0.028714622472199716,"score_gpt":0.2628722531438041,"score_spread":0.23415763067160436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071777054","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97200096,0.000112216796,0.015378669,0.00012259181,0.0001259381,0.0002889644,0.0000029147047,0.00008403874,0.011883739],"genre_scores_gemma":[0.99898815,0.000007947387,0.00022963305,0.00029138656,0.00017168894,0.000040706862,0.0000718926,0.000016339507,0.00018226863],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859434,0.000043043943,0.0003966899,0.0002589647,0.00049540447,0.00021152874],"domain_scores_gemma":[0.9986694,0.00004708135,0.0004603133,0.00037489986,0.0004379129,0.00001038259],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0017888764,0.00015730147,0.00034462617,0.0007089578,0.00012706647,0.000035274647,0.0002152504,0.00005800192,0.0037721272],"category_scores_gemma":[0.00012139821,0.00014222406,0.00018064896,0.0016154781,0.00007261202,0.0014120898,0.000047726026,0.000082139704,0.0005058139],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007845702,0.00029516878,0.24688853,0.00013968431,0.003955923,0.000001122036,0.0006087188,0.65522987,0.0026335425,0.009828167,0.00020928399,0.07942541],"study_design_scores_gemma":[0.00049616746,0.00001075917,0.10735996,0.00003695957,0.004553348,7.226701e-8,0.000084577165,0.8842512,0.00021854148,0.0027083224,0.000098880206,0.00018120585],"about_ca_topic_score_codex":0.00008542782,"about_ca_topic_score_gemma":0.00004549956,"teacher_disagreement_score":0.22902134,"about_ca_system_score_codex":0.000058158323,"about_ca_system_score_gemma":0.000020314974,"threshold_uncertainty_score":0.99713856},"labels":[],"label_agreement":null},{"id":"W2071864257","doi":"10.1080/15326349.2011.614187","title":"Goodput Analysis Using Terminating MAP for a Class of Discrete-Time Queueing Models","year":2011,"lang":"en","type":"article","venue":"Stochastic Models","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Goodput; Queueing theory; Platoon; Markovian arrival process; Network packet; Layered queueing network; Computer science; Queue; Throughput; Markov process; Bulk queue; Computer network; Synchronizing; Real-time computing; Distributed computing; Mathematics; Statistics; Control (management); Transmission (telecommunications); Telecommunications; Wireless; Artificial intelligence","score_opus":0.04769098431901815,"score_gpt":0.26130741344869607,"score_spread":0.21361642912967793,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2071864257","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.046588384,0.000063879095,0.94963306,0.00001723861,0.00008099191,0.0003638013,0.000019039579,0.000111634574,0.0031219476],"genre_scores_gemma":[0.96501374,2.51932e-7,0.034294154,0.000090885704,0.00028654467,0.000045988396,0.000035161713,0.00006552142,0.0001677293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801564,0.000022897586,0.0006438723,0.00047269592,0.0002990044,0.0005459078],"domain_scores_gemma":[0.99831915,0.000159314,0.0007086228,0.0004911627,0.0002894262,0.000032341763],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00073141133,0.00031977906,0.0007032195,0.0008240461,0.00023597214,0.00006148632,0.00038146158,0.00010300253,0.00012837324],"category_scores_gemma":[0.0001188487,0.0003148211,0.00048376285,0.0010336951,0.00010925986,0.0021969785,0.00023509769,0.000119835844,0.000013754502],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000079711,0.000058525944,0.000033110617,0.00013974876,0.00051116914,0.000001343366,0.0004764589,0.86230814,0.00066867785,0.13508612,0.0000052389983,0.0006317303],"study_design_scores_gemma":[0.00022948046,0.0000075652924,0.0000046491673,0.00007110405,0.0023892627,4.9104716e-7,0.00023109003,0.75951046,0.000048323975,0.2372333,0.0000032024745,0.00027105352],"about_ca_topic_score_codex":0.00036748525,"about_ca_topic_score_gemma":0.000025082447,"teacher_disagreement_score":0.9184254,"about_ca_system_score_codex":0.000058751557,"about_ca_system_score_gemma":0.000021690068,"threshold_uncertainty_score":0.9999304},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01369276134957893,"score_gpt":0.22043699748518172,"score_spread":0.2067442361356028,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072709938","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8369384,0.0016300465,0.15295044,0.00006653436,0.001085042,0.0015222076,0.000018062457,0.00046499347,0.0053243153],"genre_scores_gemma":[0.99846643,0.0000035042196,0.00025714256,0.00006493098,0.00039237362,0.0001379875,0.0000724828,0.00007078686,0.0005343548],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99776495,0.00009393733,0.0007672028,0.00053815526,0.00039419,0.0004415892],"domain_scores_gemma":[0.9975426,0.00024460634,0.0011356517,0.00061211217,0.00043862386,0.000026375665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013046174,0.00031976152,0.0008762332,0.0011040239,0.00027760604,0.00033198763,0.0002854766,0.00010302201,0.000015945614],"category_scores_gemma":[0.0002631142,0.00029000876,0.00027681477,0.0022091581,0.00006329858,0.0015127254,0.00003360945,0.000100837504,0.00001881369],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000069805435,0.00011860524,0.012704936,0.001599103,0.0022250256,0.000008028247,0.00013369153,0.70866793,0.0019195972,0.2722912,0.00007151395,0.00019054733],"study_design_scores_gemma":[0.0021150196,0.00015651048,0.0008011677,0.0016613147,0.011617582,0.000014883119,0.007473809,0.94860286,0.0009674068,0.0018923575,0.022969715,0.0017273928],"about_ca_topic_score_codex":0.0021979972,"about_ca_topic_score_gemma":0.00017380573,"teacher_disagreement_score":0.27039886,"about_ca_system_score_codex":0.00021263452,"about_ca_system_score_gemma":0.000040209045,"threshold_uncertainty_score":0.9999552},"labels":[],"label_agreement":null},{"id":"W2072759805","doi":"10.1016/j.ejor.2011.05.022","title":"The impact of transportation delays on repairshop capacity pooling and spare part inventories","year":2011,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Spare part; Pooling; Operations research; Computer science; Queueing theory; Operations management; Economics; Engineering; Computer network","score_opus":0.15090754866049386,"score_gpt":0.33738918854993494,"score_spread":0.18648163988944108,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2072759805","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907783,0.000088625304,0.0003630004,0.00019062698,0.000057349032,0.00006127966,0.000004017838,0.0000054149086,0.00845138],"genre_scores_gemma":[0.99911594,0.00004661158,0.00022753768,0.000033905228,0.00046315763,7.196068e-7,0.000005164972,0.000013551516,0.000093434566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99863327,0.0002271051,0.00038907616,0.00009845108,0.0005017633,0.00015033886],"domain_scores_gemma":[0.99836504,0.00019289071,0.00023647626,0.000120031444,0.001062633,0.000022938168],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005065246,0.00007651819,0.00011329835,0.00019944993,0.00038066856,0.0001148257,0.00020766418,0.000011222296,0.00012374883],"category_scores_gemma":[0.00092552754,0.000047727845,0.000096673466,0.00027329716,0.00019422428,0.0006778567,0.000024356144,0.00027340167,0.000015139311],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006723437,0.000778516,0.15604073,0.00020763141,0.001347144,0.00054311624,0.0077551836,0.07557841,0.00700973,0.71480644,0.013022148,0.016187515],"study_design_scores_gemma":[0.002821927,0.0015522421,0.88472307,0.00094885007,0.0002358177,0.000060187704,0.0055893487,0.014466979,0.0027743464,0.061959296,0.024145003,0.0007229301],"about_ca_topic_score_codex":0.0000636172,"about_ca_topic_score_gemma":0.000027982802,"teacher_disagreement_score":0.72868234,"about_ca_system_score_codex":0.000032171796,"about_ca_system_score_gemma":0.000041750536,"threshold_uncertainty_score":0.29278332},"labels":[],"label_agreement":null},{"id":"W2074276474","doi":"10.1049/iet-com.2007.0325","title":"Multi-scale analysis of generalised processor sharing queues with long-range-dependent traffic inputs and variable service rates","year":2009,"lang":"en","type":"article","venue":"IET Communications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Fork–join queue; Queue; Computer science; Multilevel queue; Bulk queue; Queueing theory; Processor sharing; Decoupling (probability); Queue management system; Set (abstract data type); Variable (mathematics); Real-time computing; Mathematics; Computer network; Engineering","score_opus":0.027378764422282934,"score_gpt":0.2780058607325195,"score_spread":0.25062709631023655,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074276474","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98392504,0.0006887827,0.010197294,0.003372967,0.000012980373,0.00029672188,0.000013837564,0.00021880149,0.001273565],"genre_scores_gemma":[0.98366934,0.000075445016,0.014811267,0.0010640655,0.000030531664,0.00003052406,0.00014727733,0.000017475806,0.00015409669],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906236,0.00003106304,0.0003115723,0.00026786554,0.00015215433,0.00017500776],"domain_scores_gemma":[0.9979983,0.00007828921,0.00031428837,0.0011893869,0.0004023322,0.000017423148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00035924691,0.00016200749,0.00034395908,0.0004274661,0.00031552045,0.000157068,0.0008014175,0.00004984191,0.000041006453],"category_scores_gemma":[0.00004715561,0.00014623268,0.00005978352,0.0024972265,0.000079832054,0.0007838856,0.00023739318,0.00013449963,0.000006710922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022501622,0.0017431197,0.10975832,0.00042042448,0.0028459555,0.0000040537093,0.0023801448,0.85636,0.011779336,0.011212423,0.0000639685,0.003207212],"study_design_scores_gemma":[0.00073986745,0.000013514643,0.027825434,0.00010434908,0.0030257148,0.0000010047181,0.00038797138,0.96594065,0.00016824238,0.0010137246,0.00043974258,0.0003397958],"about_ca_topic_score_codex":0.00038502738,"about_ca_topic_score_gemma":0.0063911537,"teacher_disagreement_score":0.10958061,"about_ca_system_score_codex":0.000020778993,"about_ca_system_score_gemma":0.000014554445,"threshold_uncertainty_score":0.59631956},"labels":[],"label_agreement":null},{"id":"W2074784329","doi":"10.1080/0740817x.2012.695102","title":"Spare parts provisioning for multiple<i>k</i>-out-of-<i>n</i>:G systems","year":2013,"lang":"en","type":"article","venue":"IIE Transactions","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Spare part; Component (thermodynamics); Provisioning; Computer science; Hybrid system; Reliability engineering; Operations research; Engineering; Operations management; Telecommunications","score_opus":0.024001462225105873,"score_gpt":0.23970576077062816,"score_spread":0.21570429854552228,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2074784329","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030328602,0.00009666589,0.9646639,0.00042941712,0.0009343529,0.0010944576,0.000018394569,0.00027338215,0.0021607871],"genre_scores_gemma":[0.9967303,0.0000034469576,0.0015101524,0.00013940762,0.00033020237,0.00039684778,0.00002255855,0.000035898065,0.0008311856],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990085,0.000010758935,0.00034085588,0.00024482323,0.00014040688,0.00025466597],"domain_scores_gemma":[0.9990515,0.00019686301,0.00020578346,0.00027138036,0.0002577136,0.000016740447],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017877921,0.00015573819,0.0002479465,0.00017699253,0.00030897354,0.00014142135,0.00016311284,0.000058237194,0.0002581149],"category_scores_gemma":[0.00007879814,0.0001448133,0.00017668237,0.00027862133,0.000055153498,0.0012093033,0.000008232526,0.000091996175,0.00018422153],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032160865,0.0008192105,0.0025128305,0.0026181373,0.0007925093,0.000006376143,0.0010509063,0.8788797,0.017872345,0.038629588,0.004991416,0.05150535],"study_design_scores_gemma":[0.0026481692,0.000055794368,0.00063361565,0.000509466,0.0011007682,0.0000034884501,0.004178173,0.72186905,0.0024942278,0.020575928,0.24472503,0.0012062796],"about_ca_topic_score_codex":0.00038290728,"about_ca_topic_score_gemma":0.00013976586,"teacher_disagreement_score":0.9664017,"about_ca_system_score_codex":0.00001926955,"about_ca_system_score_gemma":0.000011491846,"threshold_uncertainty_score":0.59053147},"labels":[],"label_agreement":null},{"id":"W2076348996","doi":"10.3141/2390-15","title":"On Observable Chaotic Maps for Queuing Analysis","year":2013,"lang":"en","type":"article","venue":"Transportation Research Record Journal of the Transportation Research Board","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Queueing theory; Queue; Computer science; Observable; Intermittency; Chaotic; Mathematical optimization; Algorithm; Mathematics; Physics; Computer network; Artificial intelligence","score_opus":0.08487430617469142,"score_gpt":0.35558360277597484,"score_spread":0.2707092966012834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076348996","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9827297,0.000076326396,0.009022077,0.005779872,0.00037452264,0.0014640505,0.000028663406,0.000050869374,0.00047397488],"genre_scores_gemma":[0.9956565,0.00007122827,0.0016283917,0.00034945516,0.00049396144,0.0002265272,0.000060872182,0.00007027373,0.0014428116],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.9939001,0.00034888237,0.0013534994,0.00049989,0.0028833838,0.0010142273],"domain_scores_gemma":[0.9908759,0.0018088628,0.0007535373,0.00062590017,0.00581814,0.00011765575],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005479894,0.000289219,0.000641071,0.0028934805,0.0009901165,0.00046377224,0.0013078273,0.00015732914,0.0011179802],"category_scores_gemma":[0.00070720015,0.00021561934,0.00095895433,0.006315127,0.00037703998,0.0020920453,0.000010830837,0.0014372312,0.00016445831],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.005213464,0.0013428947,0.33788514,0.0017722818,0.0044106087,0.00012010001,0.0017487273,0.23288973,0.00789335,0.33454737,0.054648127,0.0175282],"study_design_scores_gemma":[0.0026780574,0.00038662457,0.6704125,0.00047174116,0.0012148073,1.4703163e-7,0.0029229368,0.012556927,0.00063425367,0.27715203,0.030994102,0.00057589245],"about_ca_topic_score_codex":0.011980373,"about_ca_topic_score_gemma":0.023962174,"teacher_disagreement_score":0.3325273,"about_ca_system_score_codex":0.0002042578,"about_ca_system_score_gemma":0.00015489591,"threshold_uncertainty_score":0.99979514},"labels":[],"label_agreement":null},{"id":"W2076844267","doi":"10.1109/mascots.2014.27","title":"Provisioning of Computing Resources for Web Applications under Time-Varying Traffic","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Provisioning; Computer science; Workload; Erlang (programming language); Queueing theory; Distributed computing; Benchmark (surveying); Computer network; Poisson distribution; Web application; Queue; Markov process; Real-time computing; Operating system","score_opus":0.009974309062989664,"score_gpt":0.23853575331230917,"score_spread":0.2285614442493195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2076844267","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3434757,0.000024413863,0.6326847,0.00044049657,0.00003316571,0.00046907578,0.0000010893322,0.00034601553,0.022525353],"genre_scores_gemma":[0.98820513,2.138731e-7,0.010381348,0.0004466662,0.00043202128,0.000021042684,0.000014888493,0.000023677298,0.0004750353],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99921364,0.000010233941,0.00026566247,0.00022571752,0.00011219446,0.00017256566],"domain_scores_gemma":[0.9990924,0.0003092179,0.00025358528,0.00021206193,0.00012547639,0.0000072514094],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005520941,0.00010498484,0.00019119562,0.00018483827,0.00026705788,0.00007614695,0.00019702333,0.00003431732,0.00007902022],"category_scores_gemma":[0.00011768693,0.00009429313,0.00009468329,0.00038403244,0.00004543213,0.0002960582,0.00008835813,0.000050447677,0.000067174275],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005137099,0.00013548837,0.00034675925,0.00045719088,0.00010605277,1.3152281e-7,0.00011868033,0.62377524,0.013265851,0.2626916,0.00095791643,0.098093756],"study_design_scores_gemma":[0.00032503548,0.00000628996,0.00007047756,0.000046428464,0.000086209264,2.2096135e-7,0.00017962752,0.9567119,0.00012815789,0.012028431,0.030255655,0.00016157898],"about_ca_topic_score_codex":0.0000062857684,"about_ca_topic_score_gemma":0.000004009705,"teacher_disagreement_score":0.64472944,"about_ca_system_score_codex":0.000010074508,"about_ca_system_score_gemma":0.000005263853,"threshold_uncertainty_score":0.3845162},"labels":[],"label_agreement":null},{"id":"W2077606261","doi":"10.1017/s0269964809000217","title":"A STATE-DEPENDENT POLLING MODEL WITH <i>k</i>-LIMITED SERVICE","year":2009,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Polling; Computer science; Queue; Bounding overwatch; Polling system; Multilevel queue; Bulk queue; Service (business); Poisson distribution; Fork–join queue; Priority queue; Queue management system; Production (economics); State (computer science); Mathematical optimization; Computer network; Real-time computing; Mathematics; Algorithm; Statistics","score_opus":0.014110783026944861,"score_gpt":0.20699591859233932,"score_spread":0.19288513556539447,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2077606261","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9896988,0.000021328993,0.0050731795,0.0032708866,0.000014294466,0.00014252536,0.0000010983166,0.000067987734,0.0017098669],"genre_scores_gemma":[0.9970608,0.0000016812164,0.0011701433,0.0017204231,0.000028538972,0.000008505899,0.0000031899901,0.0000016947137,0.0000050495496],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992915,0.0000045002075,0.00017230229,0.000105793966,0.00026900554,0.00015692851],"domain_scores_gemma":[0.99972516,0.00005836969,0.00006331372,0.00008700968,0.00005953458,0.000006634508],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011171749,0.0000853935,0.00007671236,0.00012573085,0.00016255252,0.00020370838,0.00021655463,0.000014024978,0.0000030070626],"category_scores_gemma":[0.0000940872,0.000052643853,0.000013054259,0.00072641036,0.00004372679,0.0017450417,0.00002721487,0.00008544683,0.0000045768675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008392316,0.000011684571,0.0001517484,0.000026242004,0.0000016253703,1.422931e-7,0.00032772313,0.95249426,0.000022506096,0.04641321,0.0000025854933,0.00053990283],"study_design_scores_gemma":[0.0000891453,0.000007705729,0.0005903793,0.000021083257,0.0000047371527,0.0000019349184,0.00015170644,0.947509,0.000009344165,0.051413767,0.00011759161,0.00008359284],"about_ca_topic_score_codex":0.000034671368,"about_ca_topic_score_gemma":0.000027883885,"teacher_disagreement_score":0.007361941,"about_ca_system_score_codex":0.000016811919,"about_ca_system_score_gemma":0.000014267879,"threshold_uncertainty_score":0.2146754},"labels":[],"label_agreement":null},{"id":"W2078024031","doi":"10.4108/icst.valuetools2009.7463","title":"Heavy traffic steady state approximations in stochastic networks with Lévy inputs","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Limit (mathematics); Queue; Brownian motion; Stochastic process; Stationary distribution; Stationary state; Statistical physics; Reflected Brownian motion; State (computer science); Heavy traffic; Distribution (mathematics); Approximations of π; Heavy traffic approximation; Computer science; Applied mathematics; Steady state (chemistry); Mathematics; Geometric Brownian motion; Physics; Mathematical analysis; Diffusion process; Discrete mathematics; Algorithm; Engineering; Computer network; Statistics; Quantum mechanics; Markov chain","score_opus":0.009129471756142577,"score_gpt":0.21592373402482082,"score_spread":0.20679426226867825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078024031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34234688,0.000039275863,0.6480223,0.0012244083,0.000052663134,0.0003601708,6.321734e-7,0.0003717173,0.007581945],"genre_scores_gemma":[0.9964263,0.0000013885542,0.0009940875,0.0018363144,0.00015728732,0.000014435052,0.000024450712,0.000018924571,0.0005268317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989584,0.000013603942,0.00025995466,0.00027718762,0.00016407241,0.00032674658],"domain_scores_gemma":[0.9994971,0.00003859039,0.0001331651,0.00024633686,0.00007107625,0.000013729762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027556357,0.00017913237,0.00022558482,0.00033818465,0.00011770198,0.0001488702,0.00016920474,0.000036829657,0.0000974412],"category_scores_gemma":[0.00004056162,0.00014592991,0.00004154219,0.0011420739,0.000039915543,0.0009882316,0.000029912402,0.00016857602,0.0000733282],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005802694,0.0000989934,0.000065386164,0.000006225239,0.000013340405,0.000007578772,0.000049276943,0.97926044,0.000006317361,0.011968217,0.00009465394,0.008371515],"study_design_scores_gemma":[0.00064278237,0.000024418208,0.001112757,0.00005946997,0.000053587057,0.0000015441875,0.00017305778,0.9879739,0.0000025212446,0.009370161,0.00028216618,0.00030362996],"about_ca_topic_score_codex":0.000027848871,"about_ca_topic_score_gemma":0.00045094668,"teacher_disagreement_score":0.6540794,"about_ca_system_score_codex":0.000037776666,"about_ca_system_score_gemma":0.000010152581,"threshold_uncertainty_score":0.5950849},"labels":[],"label_agreement":null},{"id":"W2078349931","doi":"10.1016/j.spl.2014.09.019","title":"Note on the service time in an M/G/1 queue with bounded workload","year":2014,"lang":"en","type":"article","venue":"Statistics & Probability Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Workload; Queue; Bounded function; Mathematics; Service (business); Overshoot (microwave communication); Burke's theorem; Applied mathematics; Queueing theory; Discrete mathematics; Mathematical optimization; Computer science; Statistics; Queue management system; Computer network; Fork–join queue; Mathematical analysis; Telecommunications","score_opus":0.011372630765235998,"score_gpt":0.22321960869656338,"score_spread":0.21184697793132737,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078349931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7893344,0.0000016565051,0.19198619,0.016974306,0.00006188824,0.0004660977,0.000011878167,0.00013132064,0.0010322202],"genre_scores_gemma":[0.89234376,3.6512736e-7,0.05698541,0.050005674,0.00040828472,0.000073932526,0.00006962929,0.00006112393,0.00005183646],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984889,0.00013745522,0.00028133602,0.00044830437,0.00029743597,0.00034659504],"domain_scores_gemma":[0.998435,0.00051353994,0.00018996371,0.0007016783,0.00014246102,0.000017316115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001130642,0.00022950051,0.0002415728,0.00011189068,0.00020840025,0.00025254244,0.00039391106,0.000041899548,0.00015902311],"category_scores_gemma":[0.00048683502,0.00016306063,0.000029939589,0.0006364135,0.00018413298,0.00046445616,0.000078932084,0.0002787994,0.00037906822],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00067152147,0.0003794769,0.009001173,0.00028977054,0.000058751546,0.000023410916,0.00045440363,0.016784852,0.0018513119,0.95982534,0.001515053,0.00914494],"study_design_scores_gemma":[0.0005864327,0.00004306013,0.006412281,0.00013377256,0.00010215679,6.7776796e-7,0.000018955794,0.077760234,0.000037486127,0.9103992,0.0040038093,0.000501912],"about_ca_topic_score_codex":0.0003571748,"about_ca_topic_score_gemma":0.003866174,"teacher_disagreement_score":0.13500078,"about_ca_system_score_codex":0.00009537917,"about_ca_system_score_gemma":0.00001582638,"threshold_uncertainty_score":0.6649419},"labels":[],"label_agreement":null},{"id":"W2078612429","doi":"10.1017/s0269964811000349","title":"ANALYTICALLY EXPLICIT RESULTS FOR THE <i>GI</i>/<i>C</i>-<i>MSP</i>/1/∞ QUEUEING SYSTEM USING ROOTS","year":2012,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Simple (philosophy); Generating function; Markov chain; Applied mathematics; Queueing theory; Computer science; Mathematics; Epoch (astronomy); Distribution (mathematics); Queue; Matrix (chemical analysis); Geometric distribution; Function (biology); Algorithm; Mathematical optimization; Discrete mathematics; Probability distribution; Mathematical analysis; Statistics","score_opus":0.031089554356976593,"score_gpt":0.24670640045605283,"score_spread":0.21561684609907622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078612429","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9709008,0.00030497983,0.021288412,0.0019662231,0.00037603083,0.00084680214,0.000009486276,0.00014860829,0.0041586556],"genre_scores_gemma":[0.9980784,0.0000021155265,0.0011604541,0.00034960124,0.00035131234,0.00004668507,0.000003985389,0.000003882409,0.0000035606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99886644,0.0000142481995,0.00038257343,0.00012678702,0.00029595254,0.0003140046],"domain_scores_gemma":[0.9988436,0.00076675374,0.00014223429,0.0001629461,0.00007178099,0.000012677267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0053159795,0.000119839686,0.00012385788,0.00012249153,0.00049736234,0.00028092437,0.00035796364,0.00002999437,0.000001685007],"category_scores_gemma":[0.00090596185,0.00006826072,0.00005483365,0.0007016164,0.00010695141,0.0022902125,0.000086446555,0.00010230667,0.0000045663755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015675416,0.000012476925,0.0006397658,0.00014569891,0.000008255935,4.846772e-8,0.00035138137,0.72499907,0.00003318596,0.2733876,0.000024896326,0.00038189447],"study_design_scores_gemma":[0.00013550303,0.0000045005772,0.0011156887,0.000051379102,0.00002819708,0.0000042200213,0.0009676178,0.991044,0.000011158753,0.0031704977,0.0033548954,0.00011234685],"about_ca_topic_score_codex":0.00008483354,"about_ca_topic_score_gemma":0.000010851013,"teacher_disagreement_score":0.27021712,"about_ca_system_score_codex":0.00004884215,"about_ca_system_score_gemma":0.000014858251,"threshold_uncertainty_score":0.38253593},"labels":[],"label_agreement":null},{"id":"W2078854659","doi":"10.1287/opre.1110.0934","title":"TECHNICAL NOTE—Queueing Systems with Synergistic Servers","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Server; Computer science; Throughput; Queueing theory; Distributed computing; Markov process; Computer network; Operating system; Mathematics; Wireless","score_opus":0.08291687160238158,"score_gpt":0.33351531416601654,"score_spread":0.25059844256363495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2078854659","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.22482906,0.0001792404,0.3323872,0.0010951562,0.00032607396,0.0017112512,0.0000067223596,0.000796819,0.43866846],"genre_scores_gemma":[0.9941078,0.000003141047,0.0028269442,0.00006815982,0.00031021115,0.00012528208,0.000016715429,0.000029609384,0.0025121758],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862593,0.00006410572,0.00019507854,0.00030219328,0.00045802124,0.00035465974],"domain_scores_gemma":[0.99883705,0.000079165125,0.000025183115,0.00044834273,0.00058890163,0.000021324066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001219932,0.00011101679,0.00014487485,0.0004772566,0.00072213303,0.0004013943,0.00035526854,0.000059044225,0.0004255189],"category_scores_gemma":[0.0004450725,0.00008818825,0.000034807545,0.0013665853,0.00019191798,0.0010680495,0.00017730721,0.00032304955,0.00076896674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001125799,0.00018342506,0.0011238599,0.00013573846,0.000038999788,0.000111432215,0.00013396883,0.09465153,0.0056476,0.896185,0.0007921964,0.0008837027],"study_design_scores_gemma":[0.0011331534,0.00013259923,0.0015260213,0.00048466388,0.00021139323,0.000023797631,0.0031649556,0.95441735,0.0011030895,0.0067255786,0.030013045,0.0010643657],"about_ca_topic_score_codex":0.0026927427,"about_ca_topic_score_gemma":0.001593432,"teacher_disagreement_score":0.8894594,"about_ca_system_score_codex":0.000081584425,"about_ca_system_score_gemma":0.000052050684,"threshold_uncertainty_score":0.9883768},"labels":[],"label_agreement":null},{"id":"W2079017824","doi":"10.1007/s10479-010-0722-1","title":"Approximate performance analysis of CONWIP disciplines in unreliable non homogeneous transfer lines","year":2010,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Block (permutation group theory); Constant (computer programming); Theory of computation; Transfer line; Computer science; Mathematical optimization; Mathematics; Applied mathematics; Algorithm; Combinatorics; Engineering","score_opus":0.09388804598088185,"score_gpt":0.39155705456211143,"score_spread":0.2976690085812296,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079017824","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9963261,0.00004333962,0.00089194305,0.0007256302,0.000044544202,0.00021776109,0.00001338075,0.000014771316,0.0017225118],"genre_scores_gemma":[0.9986501,0.00010344571,0.00033317748,0.000059306334,0.00012229917,0.000048640308,0.0000734961,0.000016101594,0.00059343287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844635,0.000034955017,0.00050093397,0.00026851223,0.00042247164,0.00032681163],"domain_scores_gemma":[0.9979747,0.00013481714,0.000040884872,0.00046566036,0.0013676337,0.000016310045],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020642257,0.000120921155,0.0003850884,0.002112887,0.00022140094,0.00009548054,0.00039829264,0.00007359494,0.00033227776],"category_scores_gemma":[0.0004275872,0.00010494707,0.00014313628,0.004919596,0.00025737818,0.0008748327,0.000120980985,0.00029448207,0.000027488597],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016518153,0.0005217632,0.046936274,0.00029781825,0.0004303658,0.000005226445,0.0003363439,0.81709725,0.10570596,0.025464362,0.0001252446,0.0029142012],"study_design_scores_gemma":[0.00025727067,0.000028937477,0.014480458,0.000054932414,0.00016075495,3.3455288e-7,0.00027281448,0.9535978,0.029466776,0.00081496645,0.0006810788,0.00018390203],"about_ca_topic_score_codex":0.0007488293,"about_ca_topic_score_gemma":0.005915078,"teacher_disagreement_score":0.13650052,"about_ca_system_score_codex":0.000004961075,"about_ca_system_score_gemma":0.00004259459,"threshold_uncertainty_score":0.4279617},"labels":[],"label_agreement":null},{"id":"W2079045924","doi":"10.1007/s11750-011-0184-x","title":"Comments on: Light tail asymptotics in multidimensional reflecting processes for queueing networks","year":2011,"lang":"en","type":"article","venue":"Top","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Queueing theory; Statistical physics; Computer science; Applied mathematics; Mathematics; Mathematical economics; Physics; Computer network","score_opus":0.04618520478188533,"score_gpt":0.2826010092351892,"score_spread":0.2364158044533039,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2079045924","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8641297,0.0003757621,0.06198469,0.0029873007,0.0012852137,0.0013865307,0.0000032265104,0.0007232061,0.06712433],"genre_scores_gemma":[0.9933998,0.0000035269566,0.0034122898,0.002236177,0.0005191109,0.00003513947,0.000013457685,0.000033013795,0.00034749202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990895,0.0000112560065,0.00024770902,0.00025763543,0.00010110593,0.00029284038],"domain_scores_gemma":[0.9993478,0.00015342057,0.00018174686,0.00017175493,0.00013505174,0.00001023505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038204962,0.00015101465,0.0001875539,0.0001834623,0.00018560975,0.000041166895,0.0001539312,0.000060177157,0.00006592598],"category_scores_gemma":[0.00043202812,0.00014188931,0.000050563314,0.0004909303,0.000019354487,0.0004782431,0.00009358796,0.00013268355,0.000034653065],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002965838,0.0025351082,0.227137,0.0019774397,0.00055289106,0.00013784548,0.0029405986,0.17205583,0.0017419743,0.5189821,0.008733636,0.060239762],"study_design_scores_gemma":[0.009206987,0.0002886279,0.011824092,0.0029920312,0.0007355825,0.0000085505835,0.0028868369,0.541596,0.009094742,0.21073931,0.20675984,0.0038674143],"about_ca_topic_score_codex":0.000055801807,"about_ca_topic_score_gemma":0.0001440815,"teacher_disagreement_score":0.36954015,"about_ca_system_score_codex":0.00003764807,"about_ca_system_score_gemma":0.000010827412,"threshold_uncertainty_score":0.5786078},"labels":[],"label_agreement":null},{"id":"W2080176917","doi":"10.1007/s11134-006-7634-4","title":"Decay rate for a PH/M/2 queue with shortest queue discipline","year":2006,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Japan Society for the Promotion of Science","keywords":"Burke's theorem; Fork–join queue; Queue; Mathematics; Bulk queue; Multilevel queue; Combinatorics; Discrete mathematics; Applied mathematics; Computer science; Queue management system; Queueing theory; Statistics; Computer network","score_opus":0.009475817708492512,"score_gpt":0.22340212097842685,"score_spread":0.21392630326993434,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080176917","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5639663,0.0009450358,0.37946334,0.0016408056,0.0016832234,0.0030738476,0.00004321043,0.0019484246,0.047235858],"genre_scores_gemma":[0.99069387,0.0000015617039,0.00045168976,0.00021417039,0.0032931876,0.00029803583,0.00014700188,0.000121555684,0.004778931],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99783546,0.000044432072,0.00060927286,0.00063207897,0.0002808481,0.0005978885],"domain_scores_gemma":[0.9983195,0.00023738499,0.0005242598,0.0005666538,0.00032760916,0.000024581475],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010893248,0.00040369405,0.0005723679,0.0003469718,0.00046960489,0.00058496266,0.00037414167,0.00010698223,0.000026124804],"category_scores_gemma":[0.000093377486,0.0003236961,0.00016497892,0.0008028779,0.000094482886,0.001213416,0.00009751067,0.00015200599,0.00012137868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043528414,0.000257485,0.017202346,0.0010530609,0.00028621883,0.00008842708,0.000079512516,0.23783615,0.005419839,0.7317654,0.004706282,0.00087002374],"study_design_scores_gemma":[0.0057520033,0.00017660986,0.0032497065,0.0026648734,0.00162499,0.000051172214,0.0021483765,0.5693327,0.0020930816,0.03888298,0.37010148,0.0039219903],"about_ca_topic_score_codex":0.0030156183,"about_ca_topic_score_gemma":0.0019796405,"teacher_disagreement_score":0.6928824,"about_ca_system_score_codex":0.00010087451,"about_ca_system_score_gemma":0.000034058467,"threshold_uncertainty_score":0.9999215},"labels":[],"label_agreement":null},{"id":"W2080653155","doi":"10.1007/s10255-013-0244-0","title":"Discrete-time GI/G/1 retrial queues with time-controlled vacation policies","year":2013,"lang":"en","type":"article","venue":"Acta Mathematicae Applicatae Sinica English Series","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Discrete time and continuous time; Queue; Bernoulli's principle; Retrial queue; Computer science; Markov chain; Markov decision process; Service (business); Markov process; Real-time computing; Operations research; Mathematical optimization; Mathematics; Computer network; Queueing system; Economics; Statistics; Engineering","score_opus":0.005991132238751201,"score_gpt":0.21087597674337424,"score_spread":0.20488484450462305,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080653155","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.817381,0.00012468823,0.003024778,0.010150673,0.00024850407,0.006727082,0.000039053673,0.003703588,0.15860063],"genre_scores_gemma":[0.9867764,0.000015851123,0.0040788236,0.00079516217,0.002294859,0.0012137109,0.00020669053,0.00016584473,0.0044526705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99733406,0.00005165981,0.00087781315,0.0006487144,0.0005002061,0.0005875385],"domain_scores_gemma":[0.99654543,0.00069852034,0.0008389312,0.0012910927,0.0005728651,0.000053149608],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0007586134,0.00052856794,0.0011161542,0.00027723648,0.000380711,0.00091259525,0.0008491699,0.00016472301,0.0020295426],"category_scores_gemma":[0.0019152382,0.0003916115,0.00024873373,0.0009148462,0.00040611543,0.0043581263,0.0003455986,0.0002558116,0.0028936379],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007319368,0.0021842099,0.00050846714,0.0020600895,0.0035996945,0.00001717068,0.0065741176,0.00061939977,0.058424115,0.8325052,0.07956055,0.0066275885],"study_design_scores_gemma":[0.01798462,0.00039337267,0.0007160874,0.0008865051,0.0039264387,0.000028898981,0.00702431,0.027326586,0.004283145,0.6536724,0.27845678,0.005300853],"about_ca_topic_score_codex":0.00009148921,"about_ca_topic_score_gemma":0.000012931286,"teacher_disagreement_score":0.19889623,"about_ca_system_score_codex":0.000047498856,"about_ca_system_score_gemma":0.000030091052,"threshold_uncertainty_score":0.99985355},"labels":[],"label_agreement":null},{"id":"W2080833522","doi":"10.1023/b:anor.0000011190.86293.c1","title":"Unreliable Transfer Lines: Decomposition/Aggregation and Optimization","year":2004,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Computer science; Theory of computation; Scalability; Mathematical optimization; Transfer (computing); Obstacle; Line (geometry); Transfer line; Decomposition; Monte Carlo method; Measure (data warehouse); Algorithm; State (computer science); Mathematics; Parallel computing; Data mining; Engineering","score_opus":0.09345254129689068,"score_gpt":0.39678575484226725,"score_spread":0.30333321354537657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2080833522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61459064,0.00031512673,0.36820197,0.011794215,0.000061302795,0.00047737526,0.0000069711923,0.00007970591,0.0044726846],"genre_scores_gemma":[0.99381393,0.00019664058,0.005121081,0.00039468802,0.00017551523,0.000028977802,0.00008243681,0.000014798819,0.00017192998],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990839,0.000031076303,0.0002288336,0.00018833607,0.00028422783,0.00018365523],"domain_scores_gemma":[0.9985874,0.000057246805,0.000016215028,0.00017361679,0.0011515076,0.000014002415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008540997,0.000076562545,0.00011465877,0.0005110238,0.00043886274,0.00020182527,0.000117052135,0.000045958044,0.00013274756],"category_scores_gemma":[0.00031846517,0.000073991134,0.00003638365,0.0010217099,0.00012494833,0.0015223111,0.000045437842,0.00011586922,0.000043805467],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022959704,0.00006856581,0.000055911783,0.00003221234,0.000015568598,9.65425e-7,0.000055401146,0.8770779,0.0010291069,0.12046226,0.00007883556,0.0011003363],"study_design_scores_gemma":[0.0014151294,0.000101702804,0.0003529804,0.0003489234,0.0000625284,0.000004074088,0.0008844282,0.88850516,0.03367082,0.07041243,0.0038131087,0.0004287379],"about_ca_topic_score_codex":0.00049230247,"about_ca_topic_score_gemma":0.00018020906,"teacher_disagreement_score":0.3792233,"about_ca_system_score_codex":0.000013218279,"about_ca_system_score_gemma":0.00003716423,"threshold_uncertainty_score":0.33754218},"labels":[],"label_agreement":null},{"id":"W2081309163","doi":"10.1016/j.mcm.2006.04.008","title":"Discrete-time <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si53.gif\" display=\"inline\" overflow=\"scroll\"><mml:msup><mml:mrow><mml:mstyle mathvariant=\"italic\"><mml:mi>Geo</mml:mi></mml:mstyle></mml:mrow><mml:mrow><mml:mi>X</mml:mi></mml:mrow></mml:msup><mml:mo>/</mml:mo><mml:msup><mml:mrow><mml:mi>G</mml:mi></mml:mrow><mml:mrow><mml:mrow><mml:mo>(</mml:mo><mml:mi>a</mml:mi><mml:mo>,</mml:mo><mml:mi>b</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:msup><mml:mo>/</mml:mo><mml:mn>1</mml:mn><mml:mo>/</mml:mo><mml:mi>N</mml:mi></mml:math> queues with single and multiple vacations","year":2006,"lang":"lv","type":"article","venue":"Mathematical and Computer Modelling","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":35,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Queue; Computer science; Algorithm; Service (business); Database; Real-time computing; Computer network","score_opus":0.014963087776524482,"score_gpt":0.2192586114347495,"score_spread":0.20429552365822504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081309163","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4081817,0.0051941983,0.019042728,0.0025535284,0.0064557944,0.00030638863,0.0018321666,0.0017316103,0.55470186],"genre_scores_gemma":[0.9509416,0.0035597263,0.013917571,0.0045756106,0.009518218,0.005407224,0.006411627,0.00457628,0.0010921455],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.96131223,0.0021229074,0.008331773,0.00832974,0.00967131,0.010232025],"domain_scores_gemma":[0.9702535,0.0075650304,0.008918929,0.0075335884,0.0012567553,0.0044721826],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.007498327,0.0046265963,0.0018694728,0.003311668,0.008461021,0.0100322,0.009234836,0.0092472695,0.5331667],"category_scores_gemma":[0.005497917,0.0091096945,0.007776967,0.006077056,0.008008772,0.008381601,0.009931549,0.0073006004,0.0070135524],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0056458386,0.0018749792,0.00004580873,0.00533694,0.0074513596,0.004571715,0.004039145,0.02362007,0.003599022,0.56890154,0.37035915,0.0045544296],"study_design_scores_gemma":[0.0071320524,0.0043283445,0.000079448095,0.005387788,0.008824496,0.006303279,0.005231675,0.19087413,0.7519947,0.0044364897,0.007482283,0.0079252655],"about_ca_topic_score_codex":0.008012061,"about_ca_topic_score_gemma":0.0043293596,"teacher_disagreement_score":0.74839574,"about_ca_system_score_codex":0.000108373024,"about_ca_system_score_gemma":0.004212715,"threshold_uncertainty_score":0.9985937},"labels":[],"label_agreement":null},{"id":"W2081405254","doi":"10.1239/jap/1014842288","title":"A note on bias optimality in controlled queueing systems","year":2000,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Queue; Joins; Limit (mathematics); Queueing theory; Mathematics; Optimal control; Discounting; Conjecture; Markov decision process; Control (management); Mathematical optimization; Mathematical economics; Markov process; Computer science; Economics; Combinatorics; Statistics; Computer network","score_opus":0.02207779768593145,"score_gpt":0.24723907060491346,"score_spread":0.225161272918982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081405254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95906144,0.00004027241,0.000456727,0.00032040247,0.00013256019,0.00055292255,7.105504e-7,0.000040095263,0.03939488],"genre_scores_gemma":[0.99821794,0.000005208257,0.00077424187,0.0003652912,0.00054801174,0.000022003791,0.0000011268107,0.000017599936,0.000048604525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978335,0.000071217735,0.0011338603,0.0002681001,0.00041362742,0.00027969966],"domain_scores_gemma":[0.9982621,0.00032519083,0.0008679887,0.00033992453,0.00018111055,0.000023675326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046169353,0.00021322684,0.00082384644,0.00028405632,0.000095656214,0.00016458372,0.00031399002,0.00009170997,0.00030056873],"category_scores_gemma":[0.00041434183,0.00016484444,0.00024703433,0.00058062596,0.00007351147,0.0005691006,0.000037626753,0.00042776883,0.00009342493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013913563,0.0008049929,0.0036388831,0.00032521196,0.00014054599,0.000044326403,0.0001589665,0.8739331,0.0005530474,0.0908473,0.0000913835,0.015548697],"study_design_scores_gemma":[0.031256724,0.00017546542,0.010929668,0.00092663284,0.0008197126,0.000027653867,0.00062536815,0.19119965,0.00038171207,0.73648584,0.025538059,0.0016335542],"about_ca_topic_score_codex":0.00007842995,"about_ca_topic_score_gemma":0.000033769873,"teacher_disagreement_score":0.6827335,"about_ca_system_score_codex":0.00019511535,"about_ca_system_score_gemma":0.00003910234,"threshold_uncertainty_score":0.6722162},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Holding cost; Scheduling (production processes); Regular polygon; Mathematical optimization; Mathematics; Convex function; Computer science","score_opus":0.011139707828907192,"score_gpt":0.21807177377120532,"score_spread":0.20693206594229813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2081597576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8431953,0.00042156168,0.06349666,0.004705531,0.00016539863,0.00032313392,0.0000012184265,0.00054867595,0.087142505],"genre_scores_gemma":[0.984999,0.000020962725,0.004794487,0.005083024,0.00020458554,0.000021332855,0.0000114813065,0.000037150658,0.004827977],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990421,0.000017740596,0.00019413428,0.0002620819,0.000206167,0.00027779388],"domain_scores_gemma":[0.99926996,0.00006556147,0.00015200951,0.00038666336,0.00011520973,0.000010608882],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027233938,0.00017919688,0.00019268515,0.00011596791,0.00034490507,0.00022685595,0.00030901798,0.000039207724,0.0029053895],"category_scores_gemma":[0.00006913124,0.000105704254,0.000076642435,0.0005849156,0.0001057379,0.00072665437,0.00009630798,0.00014243748,0.0009906568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002803228,0.0003516559,0.011862864,0.00014156965,0.0009128218,0.00013724534,0.00019843825,0.12395242,0.00284039,0.8227996,0.005265391,0.031257268],"study_design_scores_gemma":[0.0008378887,0.0000063664575,0.00011708923,0.0000333299,0.00021368895,0.000004977844,0.0005803381,0.9653099,0.000053874184,0.008371195,0.024111958,0.00035937582],"about_ca_topic_score_codex":0.00019028733,"about_ca_topic_score_gemma":0.00029797197,"teacher_disagreement_score":0.8413575,"about_ca_system_score_codex":0.000047865833,"about_ca_system_score_gemma":0.000003309416,"threshold_uncertainty_score":0.9997872},"labels":[],"label_agreement":null},{"id":"W2082564863","doi":"10.1239/jap/1101840564","title":"Some fluctuation identities for Lévy processes with jumps of the same sign","year":2004,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Laplace transform; Interval (graph theory); Lévy process; Sign (mathematics); Expression (computer science); Distribution (mathematics); Mathematical analysis; Laplace–Stieltjes transform; Combinatorics; Calculus (dental); Applied mathematics; Fourier transform","score_opus":0.013946707377682792,"score_gpt":0.222269380582902,"score_spread":0.2083226732052192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2082564863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98435843,0.000078534365,0.013651917,0.00068813586,0.00010250133,0.000554072,0.0000022895556,0.00002118798,0.0005429112],"genre_scores_gemma":[0.9954139,0.000005830046,0.0037984212,0.00023538846,0.0004900837,0.0000196358,0.000001509613,0.000013468212,0.000021746691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989484,0.0000073496285,0.00045991695,0.0001334123,0.00031870714,0.00013222966],"domain_scores_gemma":[0.9979356,0.00012040931,0.0010615526,0.00020461346,0.000669682,0.000008132558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008862133,0.00011847028,0.00026863368,0.00010324866,0.00013538233,0.00006692648,0.0002969155,0.000037341106,0.000014488247],"category_scores_gemma":[0.000485747,0.000071595125,0.00011687952,0.00044544265,0.00016095697,0.000970343,0.00004928222,0.00011311238,0.0000021830333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027613253,0.0006814491,0.0030859562,0.004921892,0.00039479166,0.0000017067714,0.0008931375,0.34325933,0.007848283,0.63262177,0.00018015069,0.0033501997],"study_design_scores_gemma":[0.00075140246,0.000030791824,0.0009339772,0.00009683847,0.00022415377,0.0000018823655,0.00030086495,0.000065387496,0.006555275,0.9906536,0.00028751622,0.000098328],"about_ca_topic_score_codex":0.000007971755,"about_ca_topic_score_gemma":0.00005177613,"teacher_disagreement_score":0.3580318,"about_ca_system_score_codex":0.000074188814,"about_ca_system_score_gemma":0.0001401555,"threshold_uncertainty_score":0.29195642},"labels":[],"label_agreement":null},{"id":"W2083335372","doi":"10.1109/ciss.2012.6310776","title":"Predictable revenue under processor sharing","year":2012,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Revenue; Common value auction; Computer science; Operator (biology); Payment; Processor sharing; Revenue sharing; Service (business); Mathematical optimization; Operations research; Microeconomics; Economics; Finance; Computer network; Mathematics","score_opus":0.021565436655927913,"score_gpt":0.24380227850049804,"score_spread":0.22223684184457013,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083335372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5716794,0.00041606932,0.05020608,0.001363153,0.00063266605,0.0003204261,0.0000025557256,0.0008370442,0.3745426],"genre_scores_gemma":[0.98217946,0.0000014716611,0.0004555624,0.0016784428,0.0013601754,0.000013955366,0.000007740032,0.000021277276,0.014281889],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9993024,0.0000025850734,0.00012708417,0.00014916006,0.00012076903,0.0002980206],"domain_scores_gemma":[0.9996336,0.000015976355,0.00008594211,0.00020144659,0.00005156848,0.000011458096],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00036059367,0.00009376047,0.000107116684,0.00010261217,0.00013060201,0.00008897607,0.00017652837,0.000031756088,0.0009747106],"category_scores_gemma":[0.000096044794,0.00008174745,0.00004224469,0.00037843786,0.000019881509,0.0022282496,0.00015353311,0.00007112169,0.0008692525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035941644,0.00018965929,0.111763254,0.0002835199,0.00010368194,0.000002104182,0.000094120674,0.0038309663,0.0013381743,0.8685374,0.011350462,0.0024707066],"study_design_scores_gemma":[0.0009822221,0.0000075275466,0.014311577,0.00017639755,0.0005256409,0.000006207499,0.0011815195,0.030440306,0.0013811268,0.45632607,0.49347427,0.001187158],"about_ca_topic_score_codex":0.00006310271,"about_ca_topic_score_gemma":0.000021634862,"teacher_disagreement_score":0.4821238,"about_ca_system_score_codex":0.000019135165,"about_ca_system_score_gemma":0.0000031852633,"threshold_uncertainty_score":0.99993855},"labels":[],"label_agreement":null},{"id":"W2083462405","doi":"10.1007/s10479-007-0298-6","title":"Geometric decay in level-expanding QBD models","year":2007,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Japan Society for the Promotion of Science; Natural Sciences and Engineering Research Council of Canada; Mitacs","keywords":"Theory of computation; Computer science; Mathematics; Statistical physics; Physics; Algorithm","score_opus":0.36884821049072797,"score_gpt":0.466892429795915,"score_spread":0.09804421930518703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2083462405","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88534373,0.00029672403,0.06316277,0.0011964036,0.000048233353,0.00028198524,0.000003805276,0.00003631103,0.04963005],"genre_scores_gemma":[0.9977937,0.000061830484,0.0006476911,0.00021196909,0.00020237092,0.000015276975,0.000017581613,0.000017283086,0.0010323207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826235,0.000043173906,0.00039585403,0.00024530033,0.0005642436,0.0004890827],"domain_scores_gemma":[0.9983591,0.00028497927,0.000039528113,0.0003068906,0.0009901233,0.000019403698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0063721417,0.0000941531,0.00018418298,0.003734822,0.00029915472,0.00016302709,0.0003392036,0.000059050875,0.00022484614],"category_scores_gemma":[0.00073278736,0.00009124082,0.000065673434,0.005769301,0.000105462095,0.0018049487,0.00020175471,0.00026648716,0.00012963508],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009239399,0.00028597174,0.003399606,0.000072707466,0.000046033732,0.000028129522,0.00019047881,0.5099426,0.0041102665,0.46429524,0.0010053092,0.016531268],"study_design_scores_gemma":[0.0021521812,0.00012592324,0.021710336,0.0004730338,0.000053973803,0.000005134859,0.0059892833,0.71093154,0.07434588,0.16130628,0.021507328,0.0013991394],"about_ca_topic_score_codex":0.0014928353,"about_ca_topic_score_gemma":0.0016634212,"teacher_disagreement_score":0.30298895,"about_ca_system_score_codex":0.000029573903,"about_ca_system_score_gemma":0.000034623,"threshold_uncertainty_score":0.37206927},"labels":[],"label_agreement":null},{"id":"W2084179772","doi":"10.1504/ijor.2005.007432","title":"An M/G/1 retrial queue with balking and retrials during service","year":2005,"lang":"en","type":"article","venue":"International Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Retrial queue; Computer science; Queue; Service (business); Position (finance); Computer network; Joint probability distribution; Real-time computing; Queueing system; Mathematics; Business; Statistics","score_opus":0.04888835608910215,"score_gpt":0.37917009646586436,"score_spread":0.3302817403767622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084179772","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9905713,0.000060203485,0.0003182559,0.00762813,0.00013944901,0.0000860806,0.000001616151,0.000007676028,0.0011872649],"genre_scores_gemma":[0.9929488,0.000023376677,0.001477774,0.0005204727,0.0049297092,0.0000032785588,0.000007709607,0.00001452012,0.00007438331],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778837,0.00008407644,0.00044744505,0.0001752173,0.0013229327,0.00018197147],"domain_scores_gemma":[0.9968756,0.00022486428,0.00020232635,0.000099555575,0.0025718107,0.000025877078],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032297203,0.00009062652,0.00016615092,0.0010692996,0.00014630379,0.0005461407,0.00046033735,0.000043831536,0.0003147345],"category_scores_gemma":[0.0010197395,0.000073842384,0.00003276222,0.00056968664,0.000059994538,0.0033542174,0.00010273806,0.0003727382,0.000024332116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.020327803,0.0012103124,0.09757623,0.00012644607,0.00084205455,0.001224868,0.0014019005,0.4028144,0.12905124,0.31405136,0.0006320007,0.030741392],"study_design_scores_gemma":[0.0505532,0.00087710196,0.3257585,0.0034245616,0.00026799695,0.0019610184,0.0066419104,0.40133157,0.02121829,0.0914318,0.09378037,0.0027536936],"about_ca_topic_score_codex":0.00011967656,"about_ca_topic_score_gemma":0.00045162014,"teacher_disagreement_score":0.22818224,"about_ca_system_score_codex":0.00017311728,"about_ca_system_score_gemma":0.00010556449,"threshold_uncertainty_score":0.52664477},"labels":[],"label_agreement":null},{"id":"W2084350731","doi":"10.1007/s11134-009-9130-0","title":"On the stationary distribution of queue lengths in a multi-class priority queueing system with customer transfers","year":2009,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"National Natural Science Foundation of China","keywords":"Bulk queue; Layered queueing network; Queueing theory; Mean value analysis; Mathematics; Stationary distribution; Queue; Computer science; Priority queue; Applied mathematics; Mathematical optimization; Computer network; Markov chain; Statistics","score_opus":0.012917563615962092,"score_gpt":0.22963710521200217,"score_spread":0.2167195415960401,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084350731","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95691097,0.000117893476,0.037074033,0.0005321639,0.0002365832,0.0009757019,0.000020473615,0.0002712614,0.003860902],"genre_scores_gemma":[0.999442,0.0000029280543,0.000035049943,0.00014196239,0.00015165575,0.00004807631,0.000046518082,0.000028670043,0.00010316512],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803394,0.00015853801,0.0006183689,0.00038916845,0.00045048702,0.00034947993],"domain_scores_gemma":[0.99866724,0.00028648914,0.00040789112,0.0004115162,0.00020986353,0.000017013412],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012859674,0.00027915923,0.0004555091,0.00028302532,0.00022735889,0.00012976068,0.0002949199,0.00009911923,0.0000067591777],"category_scores_gemma":[0.00016409693,0.00019829856,0.00010436538,0.0010475359,0.00007794467,0.00076315727,0.000020479882,0.00028304293,0.000038997772],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002822358,0.00019091649,0.0025198273,0.0006964305,0.00008225551,0.00004526955,0.00038585396,0.16782765,0.00082496257,0.8261304,0.000098505785,0.00091572414],"study_design_scores_gemma":[0.003943341,0.00021690431,0.016906796,0.0073593296,0.00037678448,0.000024724737,0.016677983,0.9472335,0.0004898479,0.0019931635,0.003288531,0.0014891219],"about_ca_topic_score_codex":0.0021078247,"about_ca_topic_score_gemma":0.00027241893,"teacher_disagreement_score":0.8241372,"about_ca_system_score_codex":0.0002731571,"about_ca_system_score_gemma":0.00003978754,"threshold_uncertainty_score":0.80863804},"labels":[],"label_agreement":null},{"id":"W2084485622","doi":"10.1081/stm-200056021","title":"A Retrial Queue with a Constant Retrial Rate, Server Downs and Impatient Customers","year":2005,"lang":"en","type":"article","venue":"Stochastic Models","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Mount Saint Vincent University","funders":"","keywords":"Retrial queue; Orbit (dynamics); Exponential distribution; Computer science; Queue; Service (business); Constant (computer programming); Key (lock); Line (geometry); Probability-generating function; Idle; Mathematics; Queueing system; Computer network; Real-time computing; Operations research; Random variable; Statistics; Operating system; Business","score_opus":0.015142450035378924,"score_gpt":0.2208052264803542,"score_spread":0.20566277644497527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084485622","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7245871,0.00012878294,0.26497826,0.0007159627,0.00037265202,0.00094503845,0.00001963601,0.000286825,0.007965754],"genre_scores_gemma":[0.9975024,0.0000028423112,0.0005266925,0.00058391015,0.0010792719,0.000030031004,0.000019423642,0.000038942122,0.00021652655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984469,0.000028117474,0.00035660976,0.00046285611,0.00031328536,0.00039224004],"domain_scores_gemma":[0.9990446,0.00012351313,0.00028200145,0.0003262083,0.00018396441,0.00003972812],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005773417,0.00027647984,0.00038192872,0.00030740903,0.00021627726,0.00016342831,0.00016347332,0.00008331745,0.00013995786],"category_scores_gemma":[0.00020815569,0.00022174172,0.00008052449,0.0006000712,0.00017673404,0.0012557423,0.00013651772,0.00019677363,0.000058840327],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002615504,0.00008443891,0.000026488238,0.00005721747,0.00016195727,0.000022587417,0.00025584683,0.8352393,0.00022551505,0.15804216,0.00034167952,0.0029273238],"study_design_scores_gemma":[0.004745784,0.00007987149,0.000011341227,0.00015090554,0.00042064302,0.000011611858,0.00030866286,0.9540137,0.000016006592,0.03863703,0.0009993155,0.00060513016],"about_ca_topic_score_codex":0.00015596235,"about_ca_topic_score_gemma":0.00016433562,"teacher_disagreement_score":0.27291527,"about_ca_system_score_codex":0.000082335806,"about_ca_system_score_gemma":0.000046367335,"threshold_uncertainty_score":0.9042365},"labels":[],"label_agreement":null},{"id":"W2084502319","doi":"10.1016/s0377-2217(98)00396-8","title":"Quasi-birth-and-death Markov processes with a tree structure and the MMAP[K]/PH[K]/N/LCFS non-preemptive queue","year":2000,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Queueing theory; Computer science; Markov chain; Tree (set theory); Queue; Stationary distribution; Birth–death process; Markov process; Bulk queue; Mathematical optimization; Computer network; Mathematics; Combinatorics; Statistics; Machine learning","score_opus":0.022258352862121595,"score_gpt":0.28541215909177314,"score_spread":0.26315380622965157,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2084502319","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9639569,0.0006035349,0.0017004722,0.0057654744,0.000030866606,0.0003137828,0.0000071518307,0.00001536381,0.027606433],"genre_scores_gemma":[0.9946758,0.00021432374,0.0011736557,0.00049785763,0.00095272955,0.0000031475133,0.0000055572737,0.000034644774,0.0024422945],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99792784,0.00041718368,0.0003503826,0.00023424467,0.00081652094,0.00025384722],"domain_scores_gemma":[0.997924,0.0005092081,0.00017098064,0.0001706385,0.0011852501,0.00003998006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038361552,0.00016555225,0.0002444457,0.00027901737,0.000621663,0.000687458,0.00039334572,0.000019719102,0.0007132489],"category_scores_gemma":[0.0010051321,0.00009201123,0.000045037217,0.0005723065,0.00038448925,0.0012515667,0.00012686114,0.00056921353,0.00003936317],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.06639948,0.0018703333,0.058732443,0.0025067762,0.0039615026,0.004623915,0.01391745,0.054308217,0.0043213787,0.381679,0.015997438,0.3916821],"study_design_scores_gemma":[0.07509007,0.0053742863,0.2765942,0.005929526,0.0018009779,0.0041332818,0.01685965,0.086279996,0.0017007596,0.18008208,0.3412202,0.004935006],"about_ca_topic_score_codex":0.000025759287,"about_ca_topic_score_gemma":0.000086191576,"teacher_disagreement_score":0.38674706,"about_ca_system_score_codex":0.000025716625,"about_ca_system_score_gemma":0.00013103202,"threshold_uncertainty_score":0.7809575},"labels":[],"label_agreement":null},{"id":"W2085987981","doi":"10.5539/jmr.v3n1p3","title":"A Single Queue with Mutually Replacing m Servers","year":2011,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Server; Mathematics; Queue; Service (business); Probabilistic logic; Poisson distribution; Discrete mathematics; Applied mathematics; Computer science; Computer network; Statistics","score_opus":0.1427420411682217,"score_gpt":0.32499755682211595,"score_spread":0.18225551565389425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2085987981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92911214,0.00005790639,0.012800193,0.00025596676,0.00008095297,0.0001535007,3.2739615e-7,0.000038398113,0.057500638],"genre_scores_gemma":[0.97135526,0.0000067264773,0.027440635,0.00009198706,0.00038938544,0.0000026534656,4.6607698e-7,0.0000417869,0.00067107327],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980546,0.000048438116,0.00048584538,0.00013356056,0.00094347744,0.00033405324],"domain_scores_gemma":[0.99759036,0.00024876714,0.0005714862,0.00032545565,0.0012337926,0.000030106134],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004659191,0.00012092433,0.00029599393,0.0007739316,0.00017749089,0.00017039562,0.00049845054,0.000048199374,0.00040257923],"category_scores_gemma":[0.00090245745,0.000085417305,0.0001055394,0.00083015446,0.0001331211,0.0011567358,0.00016346715,0.00046714424,0.000116982694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004106857,0.009567868,0.0130353505,0.0068244785,0.0032700105,0.0053744544,0.02831653,0.0054055885,0.04915696,0.84245616,0.013083241,0.019402511],"study_design_scores_gemma":[0.0043475525,0.0012424326,0.0007297149,0.0038222377,0.0008087928,0.0008432918,0.0598943,0.023531202,0.012823618,0.86931974,0.021284156,0.0013529606],"about_ca_topic_score_codex":0.000047101137,"about_ca_topic_score_gemma":0.000055147375,"teacher_disagreement_score":0.056829564,"about_ca_system_score_codex":0.00008133688,"about_ca_system_score_gemma":0.000052914118,"threshold_uncertainty_score":0.44079605},"labels":[],"label_agreement":null},{"id":"W2086396347","doi":"10.1007/s10479-006-5293-9","title":"Discrete-time analysis of the GI/G/1 system with Bernoulli retrials: An algorithmic approach","year":2006,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Bernoulli's principle; Markov chain; Computer science; Independence (probability theory); Theory of computation; Mathematical optimization; Algorithm; Bernoulli process; Markov chain Monte Carlo; Matrix (chemical analysis); Continuous-time Markov chain; Exploit; Set (abstract data type); Markov process; Discrete time and continuous time; Applied mathematics; Mathematics; Markov property; Markov model; Bayesian probability; Artificial intelligence","score_opus":0.087525396369387,"score_gpt":0.3652298565749086,"score_spread":0.2777044602055216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086396347","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96387506,0.00015808914,0.013749614,0.001237097,0.000031845808,0.0008586931,0.000068859,0.0000741448,0.019946594],"genre_scores_gemma":[0.9972384,0.000004345688,0.0008794915,0.00003599134,0.00027874077,0.00004669483,0.00016512911,0.000022854265,0.0013283442],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975974,0.00029337886,0.000510798,0.00034943965,0.000927778,0.0003212336],"domain_scores_gemma":[0.99715865,0.00013323009,0.00016361852,0.0008888459,0.0016397259,0.000015942442],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0033299858,0.00014204059,0.00045414432,0.0011669111,0.00053375633,0.00021891814,0.0006665051,0.00006520985,0.00011252486],"category_scores_gemma":[0.00029416813,0.000091315065,0.00021245853,0.006518924,0.00035316712,0.0009702739,0.00018436709,0.00019940326,0.000022480954],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001192672,0.00031625733,0.0021475153,0.0001337526,0.0008881875,0.0000022277836,0.000084594154,0.8577474,0.0033027038,0.1343406,0.0005062072,0.00041127895],"study_design_scores_gemma":[0.00027742112,0.000041636657,0.004020509,0.000071846596,0.00060187414,7.796562e-7,0.0011041474,0.9908235,0.001683619,0.00064451975,0.000535098,0.00019507018],"about_ca_topic_score_codex":0.0044628144,"about_ca_topic_score_gemma":0.00071568653,"teacher_disagreement_score":0.13369608,"about_ca_system_score_codex":0.000025072894,"about_ca_system_score_gemma":0.000055307923,"threshold_uncertainty_score":0.67464703},"labels":[],"label_agreement":null},{"id":"W2086563672","doi":"10.5555/1030818.1031066","title":"Customer relations management: call center operations: routing heuristics for multi-skill call centers","year":2003,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Heuristics; Call centre; Call management; Computer science; Routing (electronic design automation); Center (category theory); Call blocking; Call control; Blocking (statistics); Call to action; Softswitch; Computer network; Operations research; Telecommunications; Engineering; Business; Marketing; Quality of service","score_opus":0.04235241345901059,"score_gpt":0.29665227037296954,"score_spread":0.25429985691395895,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086563672","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0062883506,0.000010152195,0.9772339,0.00023038939,0.00044212857,0.00061784167,0.000018863562,0.00018067684,0.014977739],"genre_scores_gemma":[0.9783827,0.0000026873902,0.014628013,0.001178772,0.0001712427,0.000057498775,0.00017921513,0.00004259538,0.0053572785],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984577,0.0000405215,0.00050925417,0.00045747202,0.00018992825,0.00034517984],"domain_scores_gemma":[0.9988064,0.00012257729,0.00019492264,0.00035078297,0.00049923157,0.000026074],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00032753072,0.00025231394,0.00022421953,0.00029283774,0.00039652747,0.00033387082,0.00023169348,0.00007736631,0.0003514243],"category_scores_gemma":[0.000494974,0.0002598002,0.00014343364,0.0003356095,0.000059929793,0.001115062,0.00008927872,0.00014086816,0.00041216635],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000052175375,0.00020773495,0.011221336,0.00009213377,0.00014714185,0.000005092877,0.00028755635,0.6764888,0.00004587206,0.3092718,0.00070298166,0.0014773132],"study_design_scores_gemma":[0.0012844789,0.000005264655,0.0008632874,0.00010130832,0.00014651976,5.8830716e-7,0.00020869868,0.93949974,0.000014920009,0.0017333541,0.055809304,0.00033251868],"about_ca_topic_score_codex":0.000023753859,"about_ca_topic_score_gemma":0.0001131237,"teacher_disagreement_score":0.97209436,"about_ca_system_score_codex":0.00008182081,"about_ca_system_score_gemma":0.00001339715,"threshold_uncertainty_score":0.9999854},"labels":[],"label_agreement":null},{"id":"W2086767841","doi":"10.1016/j.peva.2009.03.001","title":"A performance analysis of discrete-time tandem queues with Markovian sources","year":2009,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Multiplexer; Computer science; Queue; Queueing theory; Multiplexing; Generating function; Tandem; Topology (electrical circuits); Markov process; Mathematics; Algorithm; Computer network; Discrete mathematics; Telecommunications; Statistics; Combinatorics","score_opus":0.011974679961920252,"score_gpt":0.25016855896564427,"score_spread":0.23819387900372402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2086767841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899534,0.00005676236,0.00047411842,0.00019640324,0.000027458036,0.00023769923,0.0000012517452,0.00009569178,0.008957204],"genre_scores_gemma":[0.9988557,0.000023193337,0.00027912707,0.00024309309,0.00020212658,0.000021546659,0.00013414824,0.000015237485,0.00022581386],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982086,0.00003140051,0.00041130823,0.00031904937,0.0007629847,0.0002667011],"domain_scores_gemma":[0.9985628,0.00003620272,0.0005541663,0.00038087586,0.00045225665,0.00001369679],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015924469,0.00021418583,0.0004088861,0.0008536087,0.00023800117,0.00008427299,0.00024177686,0.000053633506,0.0006494032],"category_scores_gemma":[0.00009582912,0.0001708003,0.00012649872,0.0026188865,0.00008042558,0.0020842645,0.000034310313,0.00010057642,0.00008265253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003658897,0.00011010234,0.26846376,0.00007807837,0.00062932854,6.442418e-7,0.00029463685,0.6388977,0.0016850611,0.00042567652,0.00006694618,0.08898214],"study_design_scores_gemma":[0.00032602297,0.000056381214,0.22451675,0.000058467092,0.0023719727,3.3510213e-7,0.00006837527,0.77157605,0.00043290274,0.00020260367,0.00018777573,0.00020237891],"about_ca_topic_score_codex":0.000020669997,"about_ca_topic_score_gemma":0.000032506432,"teacher_disagreement_score":0.13267832,"about_ca_system_score_codex":0.000067308145,"about_ca_system_score_gemma":0.000029743569,"threshold_uncertainty_score":0.7110509},"labels":[],"label_agreement":null},{"id":"W2089143757","doi":"10.1016/s0305-0548(01)00094-6","title":"Optimization of an internationally distributed air–ground airline telecommunication system","year":2002,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis; Sonaca (Canada)","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scope (computer science); Dimensioning; Computer science; Operations research; Service (business); Distributed computing; Integer programming; Mathematical optimization; Algorithm; Engineering","score_opus":0.05124364738246541,"score_gpt":0.32228540743446127,"score_spread":0.2710417600519959,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089143757","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11083051,0.000077637356,0.8848984,0.001463662,0.00013485449,0.00038215928,0.000013302245,0.00017791499,0.002021557],"genre_scores_gemma":[0.97769886,0.000012650414,0.020895643,0.00009725491,0.00031610206,0.000037284375,0.000754879,0.000020697687,0.00016661793],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985223,0.00015381891,0.0003953055,0.00026456136,0.00045450064,0.00020950974],"domain_scores_gemma":[0.99776745,0.00013272105,0.00008308356,0.00059784384,0.0013988678,0.00002001071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009924987,0.000111564215,0.0001696861,0.00062253675,0.0005371142,0.00028479917,0.0006927783,0.00005324222,0.00018512103],"category_scores_gemma":[0.00023559803,0.000114028975,0.000054501103,0.001336314,0.00012783505,0.0017138926,0.00028877877,0.00020982417,0.00010497693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011705293,0.00016570883,0.000045374996,0.00003935148,0.000031677177,0.0000018927188,0.0000603323,0.94601935,0.0001577105,0.0499616,0.00031579676,0.003189509],"study_design_scores_gemma":[0.00027705432,0.000019307146,0.00025161635,0.00006063144,0.000016602178,0.0000022841198,0.00028723074,0.99739635,0.00005394328,0.00019302456,0.0013346004,0.00010735193],"about_ca_topic_score_codex":0.0002771395,"about_ca_topic_score_gemma":0.00014913271,"teacher_disagreement_score":0.8668684,"about_ca_system_score_codex":0.00015739705,"about_ca_system_score_gemma":0.000016698119,"threshold_uncertainty_score":0.46499667},"labels":[],"label_agreement":null},{"id":"W2089589086","doi":"10.1007/s11134-012-9322-x","title":"Congestion in large balanced multirate networks","year":2012,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Parameterized complexity; Computer science; Stationary distribution; Scaling; Erlang (programming language); Mathematical optimization; Large deviations theory; Erlang distribution; Limit (mathematics); Mathematics; Markov chain; Exponential distribution; Algorithm","score_opus":0.012772118542963297,"score_gpt":0.2345142388983309,"score_spread":0.2217421203553676,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089589086","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9638143,0.0012007073,0.026840314,0.00006983857,0.0017503347,0.00041757533,0.0000015758816,0.0003839931,0.0055213245],"genre_scores_gemma":[0.997264,0.0000052139058,0.00004320198,0.00025238935,0.0019711526,0.00004023125,0.000030289453,0.000032764878,0.00036070665],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987483,0.00005264264,0.00032853117,0.00020710999,0.00014343661,0.0005199949],"domain_scores_gemma":[0.99936867,0.0000632871,0.00024733084,0.00024306186,0.000060968272,0.00001667098],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012612974,0.00016496716,0.00026808176,0.0002236439,0.000115760085,0.00013497563,0.00014752653,0.00009362308,0.0000349622],"category_scores_gemma":[0.00014316905,0.000159179,0.00005624525,0.00055031123,0.000019361945,0.0014498002,0.00007027777,0.00016496766,0.00027193627],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003531698,0.00009763414,0.7453711,0.0001241631,0.00004200816,0.000008109026,0.00008629539,0.14378291,0.0003467407,0.10893079,0.00031713836,0.0008578133],"study_design_scores_gemma":[0.0013028694,0.000005170183,0.093887344,0.00045684038,0.00008781023,0.0000054540824,0.0005774911,0.8850251,0.000018636838,0.000533682,0.017430719,0.00066890544],"about_ca_topic_score_codex":0.0006000657,"about_ca_topic_score_gemma":0.00008824822,"teacher_disagreement_score":0.7412422,"about_ca_system_score_codex":0.000068922345,"about_ca_system_score_gemma":0.0000036474519,"threshold_uncertainty_score":0.6491132},"labels":[],"label_agreement":null},{"id":"W2089905954","doi":"10.1007/s11134-013-9345-y","title":"Optimal assignment of servers to tasks when collaboration is inefficient","year":2013,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Server; Computer science; Computer network; Throughput; Distributed computing; Markov process; Operating system; Mathematics; Wireless","score_opus":0.010348868682632257,"score_gpt":0.22503338013501947,"score_spread":0.2146845114523872,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2089905954","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9614335,0.00008404505,0.030688476,0.0013219601,0.00060680805,0.000902846,0.0000054253437,0.00015324143,0.004803704],"genre_scores_gemma":[0.99692225,5.7684053e-7,0.000674494,0.0006096593,0.00035196805,0.00009284403,0.000012783,0.000026497968,0.001308901],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986452,0.000030267302,0.00044137653,0.00028627398,0.00035889997,0.00023800806],"domain_scores_gemma":[0.9988349,0.000038183833,0.00036060944,0.0003474271,0.00039636577,0.000022518238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046624505,0.00016449281,0.00028639266,0.0002890285,0.00011392444,0.00029044537,0.00023176841,0.00005752943,0.000258764],"category_scores_gemma":[0.00010345449,0.00015375308,0.00006580095,0.0006700903,0.000024124136,0.00086223497,0.00011377391,0.00006202256,0.0006241428],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004827097,0.0001420731,0.0045551537,0.0006445358,0.00018850957,0.0000056115,0.0017709084,0.89558965,0.022132264,0.039477438,0.034207746,0.0012378551],"study_design_scores_gemma":[0.001571653,0.00013939019,0.0016102586,0.0013599752,0.00040303564,0.000003251317,0.020373339,0.7909292,0.0065548504,0.0023467385,0.17310818,0.0016001173],"about_ca_topic_score_codex":0.0022321867,"about_ca_topic_score_gemma":0.000024637742,"teacher_disagreement_score":0.13890043,"about_ca_system_score_codex":0.00010621956,"about_ca_system_score_gemma":0.000017330924,"threshold_uncertainty_score":0.8022302},"labels":[],"label_agreement":null},{"id":"W2090405113","doi":"10.1239/jap/1197908829","title":"Tail Asymptotics for the Queue Size Distribution in an M/G/1 Retrial Queue","year":2007,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Mathematics; Burke's theorem; Retrial queue; Queue; Exponential distribution; Exponential function; Generating function; Distribution (mathematics); Combinatorics; Discrete mathematics; Applied mathematics; Mathematical analysis; Queueing theory; Statistics; Queueing system; Fork–join queue; Queue management system; Computer science","score_opus":0.019184224982948476,"score_gpt":0.2619625526354869,"score_spread":0.24277832765253843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090405113","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9372764,0.000026967722,0.060258344,0.00072225725,0.00037635205,0.0006565746,0.0000055700743,0.000030266754,0.0006472653],"genre_scores_gemma":[0.9956652,0.00000263124,0.0021920537,0.000301156,0.0017939527,0.000009469272,0.0000107439455,0.00001571438,0.00000911328],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9982798,0.000024667706,0.00086405297,0.00021297851,0.00031450472,0.0003040096],"domain_scores_gemma":[0.9973308,0.0010086006,0.0008620619,0.0003303344,0.00044491555,0.000023307855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008151693,0.00016128711,0.00033709646,0.000074493946,0.00018452202,0.00012889542,0.00039920572,0.000110416426,0.000037398662],"category_scores_gemma":[0.002039687,0.00011366474,0.00016952169,0.000632557,0.00012179888,0.00067765947,0.00006838412,0.00035985318,0.00000479805],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.020549368,0.0016840086,0.036238566,0.00051291665,0.00028079093,0.000022309434,0.0004404922,0.08089646,0.0045082713,0.7894564,0.0010184848,0.06439192],"study_design_scores_gemma":[0.0033061788,0.00010072738,0.025462626,0.000050401388,0.00038205707,0.0000044870626,0.00081530446,0.008717504,0.0012766101,0.9420243,0.017446613,0.0004132024],"about_ca_topic_score_codex":0.000017731587,"about_ca_topic_score_gemma":0.00034677825,"teacher_disagreement_score":0.15256788,"about_ca_system_score_codex":0.00023701033,"about_ca_system_score_gemma":0.000047891364,"threshold_uncertainty_score":0.46351135},"labels":[],"label_agreement":null},{"id":"W2090470428","doi":"10.1016/j.peva.2008.03.001","title":"Limited choice and locality considerations for load balancing","year":2008,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Queue; Load balancing (electrical power); Locality; Server; Routing (electronic design automation); Scheme (mathematics); Distributed computing; Exploit; Process (computing); Computer network; Mathematics; Computer security","score_opus":0.06260934305467594,"score_gpt":0.29387319890684893,"score_spread":0.231263855852173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090470428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9911348,0.000079149235,0.006108761,0.0005484979,0.00011851247,0.00038986644,0.0000012071769,0.0000848411,0.0015343247],"genre_scores_gemma":[0.99742484,0.00001952462,0.0009953416,0.0008627729,0.0004874892,0.00009370948,0.000034065182,0.000011399849,0.00007088057],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991319,0.000015545615,0.0002067925,0.00020717643,0.00028701415,0.00015157899],"domain_scores_gemma":[0.9988769,0.00019785672,0.00014967969,0.0001562284,0.0006109999,0.0000083056975],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011878363,0.00010024681,0.00012485354,0.00010401225,0.0005872099,0.000059332455,0.000042976335,0.000036637604,0.00013077962],"category_scores_gemma":[0.0017511809,0.00009961672,0.00003317128,0.00022601201,0.00006063106,0.0013533686,0.000030216137,0.00005933215,0.00004418752],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030190364,0.0003296272,0.5509704,0.00094115105,0.00027946246,0.0000027893357,0.0014378525,0.28504804,0.007090559,0.022135485,0.010732595,0.12073014],"study_design_scores_gemma":[0.00068791787,0.000008666838,0.06973315,0.000021793801,0.0001263066,0.0000029309238,0.000036016256,0.91964906,0.00022280846,0.006361301,0.003001673,0.00014835819],"about_ca_topic_score_codex":0.000042202882,"about_ca_topic_score_gemma":0.00007383199,"teacher_disagreement_score":0.63460106,"about_ca_system_score_codex":0.000077036944,"about_ca_system_score_gemma":0.00005045168,"threshold_uncertainty_score":0.45164028},"labels":[],"label_agreement":null},{"id":"W2090884848","doi":"10.1007/s10957-014-0668-6","title":"Optimal Control of a Multistate Failure-Prone Manufacturing System under a Conditional Value-at-Risk Cost Criterion","year":2014,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"CVAR; Mathematical optimization; Expected shortfall; Control (management); Constant (computer programming); Computer science; Optimal control; Risk aversion (psychology); Value (mathematics); Point (geometry); Product (mathematics); Economics; Econometrics; Mathematics; Mathematical economics; Risk management; Expected utility hypothesis","score_opus":0.005414435977579333,"score_gpt":0.22217061612411113,"score_spread":0.21675618014653178,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2090884848","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.030900467,0.000053261636,0.96816236,0.00018656156,0.00003277735,0.00026728178,0.000020482836,0.000029541383,0.000347297],"genre_scores_gemma":[0.9869527,0.000015582777,0.012325439,0.00019467059,0.000355631,0.00003771001,0.00004198825,0.000019946357,0.000056328812],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988526,0.00012294907,0.0005539388,0.00015706159,0.00018736658,0.00012605118],"domain_scores_gemma":[0.9978423,0.00035000156,0.0013060545,0.000161374,0.00031238323,0.000027878177],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013695998,0.00013798548,0.00028885956,0.0002537729,0.00033542461,0.00008997673,0.0001479715,0.000053776224,0.00009847477],"category_scores_gemma":[0.00011502378,0.0001230408,0.0001035196,0.00017217845,0.00012835233,0.0006355275,0.000046221357,0.00012746819,0.000009567527],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017275823,0.000043682252,0.00007018274,0.00006499442,0.000071950766,4.867847e-7,0.000017526536,0.7115783,0.00034419418,0.28693032,0.000015739477,0.000689862],"study_design_scores_gemma":[0.0035580883,0.00005147301,0.0006754581,0.00018526972,0.0010685568,0.00007276945,0.0011265051,0.92454565,0.0011610802,0.05933966,0.007832682,0.0003828204],"about_ca_topic_score_codex":0.0000034974464,"about_ca_topic_score_gemma":9.551858e-7,"teacher_disagreement_score":0.95605224,"about_ca_system_score_codex":0.000051532345,"about_ca_system_score_gemma":0.000010710763,"threshold_uncertainty_score":0.50174576},"labels":[],"label_agreement":null},{"id":"W2091680062","doi":"10.1016/j.mcm.2007.08.005","title":"Selecting batch size in discrete-time two-phase queuing system","year":2007,"lang":"en","type":"article","venue":"Mathematical and Computer Modelling","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Queue; Computer science; Network packet; Queue management system; Bernoulli's principle; Bulk queue; Queueing theory; Discrete time and continuous time; Real-time computing; Mathematical optimization; Computer network; Mathematics; Statistics; Engineering","score_opus":0.012953693586748034,"score_gpt":0.2450247370576722,"score_spread":0.23207104347092417,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091680062","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.38403815,0.000025671905,0.6141788,0.000038360446,0.000028949045,0.00009527977,1.7703792e-7,0.00014303697,0.0014516005],"genre_scores_gemma":[0.95776415,8.876102e-7,0.041324932,0.00018040877,0.00061340845,0.0000051859224,0.0000025985619,0.00003148976,0.00007696652],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844235,0.000018332286,0.0005350588,0.00036847693,0.00020462624,0.00043116417],"domain_scores_gemma":[0.999071,0.0004997053,0.00015429276,0.00018653399,0.000058911668,0.000029561741],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013641418,0.00022234458,0.0004065985,0.00018740927,0.00018218347,0.00023376076,0.00016489603,0.000057782927,0.000032547247],"category_scores_gemma":[0.000042604446,0.00019553062,0.000080552905,0.00045730837,0.000038297814,0.0005421568,0.00017737549,0.00020067646,0.00009392649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000121044206,0.00025058215,0.0002660692,0.0011642093,0.00006921568,0.00013879388,0.0005306417,0.39392033,0.00049518043,0.58385104,0.000012771097,0.0191801],"study_design_scores_gemma":[0.0005953629,0.0000072753596,0.000003343877,0.000363788,0.000044944394,0.000010642491,0.00018095347,0.9381752,0.000044513374,0.060284868,0.000056512315,0.00023258339],"about_ca_topic_score_codex":0.000045064207,"about_ca_topic_score_gemma":0.00000480542,"teacher_disagreement_score":0.573726,"about_ca_system_score_codex":0.000043977278,"about_ca_system_score_gemma":0.00000412666,"threshold_uncertainty_score":0.7973507},"labels":[],"label_agreement":null},{"id":"W2091797596","doi":"10.1016/s0166-5316(00)00015-8","title":"Optimal (N,T)-policy for M/G/1 system with cost structures","year":2000,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Timer; Computer science; Real-time computing; Operations research; Mathematics; Telecommunications","score_opus":0.020622779703999228,"score_gpt":0.2823533980073662,"score_spread":0.26173061830336697,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2091797596","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9776363,0.000026736865,0.007845179,0.00019762591,0.00007328626,0.0008242927,0.0000027272758,0.00015954969,0.013234308],"genre_scores_gemma":[0.996348,0.00000389731,0.0013269443,0.00024652676,0.0013641777,0.00027064135,0.00010185065,0.00002501411,0.00031293073],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989878,0.000012171279,0.00018924408,0.00022669096,0.00035612937,0.00022797461],"domain_scores_gemma":[0.99930596,0.00002495563,0.00014710835,0.00021988888,0.00029330477,0.000008795316],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007470648,0.0001424267,0.00014736348,0.00019761363,0.00031123305,0.00012130164,0.0001416568,0.0000381173,0.0004024699],"category_scores_gemma":[0.00006131955,0.0001147742,0.000042997748,0.00046147895,0.000039211922,0.0012963894,0.000014252421,0.00005760411,0.00017978474],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032842899,0.00001198278,0.00074797554,0.00015353749,0.000032037497,2.2128381e-7,0.00004477804,0.7729307,0.000039083392,0.011007616,0.00015854565,0.21454512],"study_design_scores_gemma":[0.0008758457,0.000023178334,0.003702597,0.000055557848,0.00017868544,0.0000025230463,0.00011214325,0.9847334,0.00018230728,0.00062387745,0.009318619,0.00019123543],"about_ca_topic_score_codex":0.0000380511,"about_ca_topic_score_gemma":0.000014736383,"teacher_disagreement_score":0.21435387,"about_ca_system_score_codex":0.00013157443,"about_ca_system_score_gemma":0.000044539942,"threshold_uncertainty_score":0.46803558},"labels":[],"label_agreement":null},{"id":"W2092197733","doi":"10.1016/s0167-6377(02)00126-8","title":"Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D/k system","year":2002,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Queue; Computer science; Bulk queue; Constant (computer programming); Real-time computing; Mathematics; Mathematical optimization; Computer network","score_opus":0.02083138433353086,"score_gpt":0.25906677893165786,"score_spread":0.238235394598127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092197733","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99090713,0.00003990572,0.0027081517,0.004700666,0.000026911901,0.0005961035,0.000049861483,0.00013133245,0.0008399211],"genre_scores_gemma":[0.99806744,0.0000022102124,0.00023851384,0.00031471482,0.00013599485,0.00006581632,0.00029491933,0.00003343952,0.0008469626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982519,0.0001519629,0.00035310243,0.0003833325,0.00047135932,0.00038834836],"domain_scores_gemma":[0.9987184,0.0002102687,0.00009522501,0.00039180298,0.00054891995,0.000035376477],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0007620191,0.0001881643,0.00028740847,0.0002780212,0.0006194923,0.00036105694,0.00025873535,0.00006066704,0.00047577274],"category_scores_gemma":[0.00031858368,0.00015901065,0.00004643353,0.0010660106,0.00022657128,0.0010540012,0.00012879838,0.00024662865,0.00093152956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006073606,0.0006042984,0.002558227,0.0031129743,0.0010838624,0.00040012423,0.0012378154,0.71793795,0.22318827,0.029932661,0.016891047,0.002445441],"study_design_scores_gemma":[0.0005273085,0.000024151685,0.00016865811,0.0003485256,0.00009926757,0.0000071006034,0.00024235027,0.997346,0.00022230994,0.00002239643,0.0007802181,0.00021173566],"about_ca_topic_score_codex":0.0005823338,"about_ca_topic_score_gemma":0.00009837894,"teacher_disagreement_score":0.27940807,"about_ca_system_score_codex":0.000099037534,"about_ca_system_score_gemma":0.000013647496,"threshold_uncertainty_score":0.99984634},"labels":[],"label_agreement":null},{"id":"W2092214701","doi":"10.1007/bf02578926","title":"Performance analysis of a call center with interactive voice response units","year":2004,"lang":"en","type":"article","venue":"Top","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Center (category theory); Interactive voice response; Speech recognition; Telecommunications","score_opus":0.010601963183506742,"score_gpt":0.23429033216820486,"score_spread":0.22368836898469813,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092214701","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99448085,0.0000061779474,0.0017157713,0.00027230004,0.000024970426,0.000059303835,0.0000033369129,0.00004693781,0.0033903334],"genre_scores_gemma":[0.9987613,0.0000016683248,0.00023036037,0.0004474461,0.00005787868,0.0000051851594,0.000020340978,0.000012416347,0.0004634074],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.9993253,0.00001761302,0.00016977591,0.00018252696,0.00015170075,0.00015313207],"domain_scores_gemma":[0.99919546,0.000067409586,0.00020461739,0.00026362907,0.00026036106,0.000008533328],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027221654,0.00011338847,0.00023280698,0.00057315174,0.00006583198,0.000030162388,0.00016248951,0.000024958339,0.000102410115],"category_scores_gemma":[0.00014576981,0.00009109206,0.00006585587,0.0026087174,0.000058343503,0.00074107305,0.00006907823,0.000089925335,0.00007475266],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.022004588,0.00081342633,0.24460694,0.00030220317,0.0070927823,0.00013166465,0.0037169482,0.69498354,0.0055648535,0.012144123,0.00021689534,0.008422037],"study_design_scores_gemma":[0.010854289,0.0004923922,0.7193371,0.0012066354,0.018201385,0.000017725606,0.005055677,0.16747463,0.012264522,0.0042122095,0.058072172,0.0028112235],"about_ca_topic_score_codex":0.00018906376,"about_ca_topic_score_gemma":0.00019211492,"teacher_disagreement_score":0.5275089,"about_ca_system_score_codex":0.000048232083,"about_ca_system_score_gemma":0.000017819024,"threshold_uncertainty_score":0.37146264},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0708570981113848,"score_gpt":0.36531046775722054,"score_spread":0.29445336964583574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2092472841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98482937,0.00004697542,0.005257444,0.002121558,0.000038062048,0.00028900465,0.000002631914,0.000057822006,0.0073571634],"genre_scores_gemma":[0.9978157,0.000015117102,0.0006662105,0.00017640388,0.0003671249,0.000031375566,0.000029243807,0.000017281038,0.0008815373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998582,0.000114824266,0.0002968417,0.00029530385,0.0003907946,0.0003202248],"domain_scores_gemma":[0.99839497,0.0001863434,0.000025739024,0.00048777327,0.0008877862,0.00001741304],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001721248,0.000103622624,0.00017204475,0.00017075222,0.0006547493,0.00023499932,0.00032091202,0.00006007574,0.0025245512],"category_scores_gemma":[0.0002595595,0.00009232306,0.00005360382,0.0017968928,0.00015557732,0.0011467568,0.00019751687,0.000292449,0.00020931273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007596519,0.00023944554,0.0039556418,0.000095251424,0.00003825765,0.0000017630815,0.0001640741,0.9508962,0.002737243,0.035381433,0.00007789542,0.00633684],"study_design_scores_gemma":[0.00023679565,0.0000054330776,0.0040770704,0.00003260425,0.00002093652,2.4276798e-7,0.00058002915,0.98943377,0.00034300663,0.0031598867,0.0019757627,0.00013444397],"about_ca_topic_score_codex":0.002388021,"about_ca_topic_score_gemma":0.00840863,"teacher_disagreement_score":0.0385376,"about_ca_system_score_codex":0.000056429933,"about_ca_system_score_gemma":0.000042656877,"threshold_uncertainty_score":0.9983873},"labels":[],"label_agreement":null},{"id":"W2095059200","doi":"10.1016/j.laa.2003.12.013","title":"Finding equilibrium probabilities of QBD processes by spectral methods when eigenvalues vanish","year":2004,"lang":"en","type":"article","venue":"Linear Algebra and its Applications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Eigenvalues and eigenvectors; Mathematics; Dimension (graph theory); Zero (linguistics); Applied mathematics; Queue; Eigenvalue perturbation; Block (permutation group theory); Pure mathematics; Combinatorics; Computer science","score_opus":0.020925196644984035,"score_gpt":0.28985826425219563,"score_spread":0.2689330676072116,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095059200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.61079776,0.0036105663,0.37335885,0.0026850442,0.000077641715,0.0014517964,0.000053508393,0.0005118118,0.00745304],"genre_scores_gemma":[0.9306149,0.00012362874,0.06628917,0.00058494665,0.00080189254,0.00029501077,0.00016419051,0.000061072606,0.0010651794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990753,0.0000123110485,0.00029135222,0.00030058273,0.00012051246,0.00019997697],"domain_scores_gemma":[0.9992805,0.00010791159,0.0001990303,0.00021912195,0.00017607457,0.000017335826],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027465896,0.00015064281,0.00022103713,0.00010892296,0.00016574172,0.00007802969,0.00020632343,0.000052574676,0.00008912532],"category_scores_gemma":[0.00018624259,0.00014135629,0.000054839555,0.00049121614,0.000102971644,0.000680024,0.00010661802,0.00008780603,0.000029742005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031078725,0.0003113667,0.00065148616,0.0015217268,0.00014269864,5.3934696e-7,0.00074011664,0.0030851308,0.032279715,0.9560013,0.00041441343,0.0048204293],"study_design_scores_gemma":[0.00034707057,0.000019132622,0.00006647951,0.000060738592,0.00021435689,0.000001736584,0.000592454,0.0027317787,0.04418538,0.9155506,0.035882004,0.00034830262],"about_ca_topic_score_codex":0.00003871927,"about_ca_topic_score_gemma":0.00001063964,"teacher_disagreement_score":0.3198172,"about_ca_system_score_codex":0.000016807182,"about_ca_system_score_gemma":0.000026978109,"threshold_uncertainty_score":0.5764342},"labels":[],"label_agreement":null},{"id":"W2095784707","doi":"10.1007/s11134-006-7419-9","title":"Multi-layered round robin routing for parallel servers","year":2006,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Equal-cost multi-path routing; Distributed computing; Static routing; Scheduling (production processes); Computer network; Queue; Routing (electronic design automation); Mathematical optimization; Mathematics; Routing protocol","score_opus":0.023325071202118422,"score_gpt":0.24419215471556383,"score_spread":0.22086708351344542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2095784707","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30584094,0.00071868964,0.6791576,0.0005823648,0.0022521522,0.0019499231,0.000014106499,0.0015306792,0.007953521],"genre_scores_gemma":[0.9903556,7.9286997e-7,0.0032936628,0.00018149971,0.0019971472,0.00011936314,0.00007564366,0.00007644896,0.0038998057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821836,0.000033346296,0.0005613936,0.00046401922,0.00021348486,0.00050938997],"domain_scores_gemma":[0.99878114,0.00013231415,0.000510237,0.00037360922,0.0001888813,0.000013831556],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008773605,0.000278632,0.00040702504,0.0002310942,0.00044458482,0.0005555142,0.0003131278,0.00010860001,0.000011256438],"category_scores_gemma":[0.00016202881,0.00027687743,0.0002088424,0.00042915333,0.000035361078,0.0011731971,0.00008547274,0.00011424827,0.00014280522],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007562778,0.00010998203,0.0090733245,0.00052900636,0.00013598426,0.000018684854,0.000047942238,0.56405157,0.0051192837,0.41878778,0.0017705171,0.00028031608],"study_design_scores_gemma":[0.0019804968,0.000010801506,0.00056276406,0.00033711977,0.00019096171,0.0000048451893,0.0010226034,0.9451445,0.00008221364,0.0060276696,0.043858044,0.0007779869],"about_ca_topic_score_codex":0.005490124,"about_ca_topic_score_gemma":0.0003734268,"teacher_disagreement_score":0.6845147,"about_ca_system_score_codex":0.00012092656,"about_ca_system_score_gemma":0.000014129353,"threshold_uncertainty_score":0.99996835},"labels":[],"label_agreement":null},{"id":"W2096541983","doi":"10.1287/ijoc.13.3.172.12627","title":"Modeling and Analysis of Discrete-Time Multiserver Queues with Batch Arrivals: GI<sup>X</sup>/Geom/m","year":2001,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Computer science; Markov chain; Queue; Queueing theory; Bulk queue; State (computer science); Observer (physics); Random variable; Algorithm; Discrete time and continuous time; Real-time computing; Mathematical optimization; Mathematics; Computer network; Statistics","score_opus":0.012753032955314256,"score_gpt":0.24455783897218092,"score_spread":0.23180480601686665,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2096541983","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.931238,0.00006033637,0.067012146,0.00021146484,0.000034097236,0.000086756896,0.0000016712637,0.000078566874,0.0012769502],"genre_scores_gemma":[0.99639845,0.00002596999,0.0023541867,0.00068258756,0.00041972435,8.5255533e-7,0.000016578275,0.0000335661,0.0000680818],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979169,0.000023903762,0.0008338445,0.00028077004,0.000510178,0.00043443596],"domain_scores_gemma":[0.99835795,0.00016964965,0.00074098946,0.00029100318,0.00038867272,0.00005172963],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011658765,0.00031345978,0.0007028384,0.0011853834,0.00046176373,0.00042775352,0.00033911242,0.00007483816,0.00011948217],"category_scores_gemma":[0.00022769318,0.00022487545,0.00027337915,0.0017956715,0.00008033428,0.0019439375,0.00019369026,0.0003978472,0.00002372075],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017845348,0.00003194532,0.018474376,0.000030294754,0.0009285411,0.00003446369,0.00024008744,0.9676337,0.000030665367,0.0006177376,0.000013195191,0.011786517],"study_design_scores_gemma":[0.00062914006,0.000035733476,0.0010808547,0.00026633995,0.00095788646,0.0000270409,0.00061360875,0.9944679,0.000011257433,0.0011885549,0.00040256398,0.00031908564],"about_ca_topic_score_codex":0.00014090775,"about_ca_topic_score_gemma":0.000023646417,"teacher_disagreement_score":0.06516044,"about_ca_system_score_codex":0.000053474312,"about_ca_system_score_gemma":0.000015605267,"threshold_uncertainty_score":0.9170155},"labels":[],"label_agreement":null},{"id":"W2097344578","doi":"10.1109/mascot.1995.378694","title":"Approximate MVA for client-server systems with nonpreemptive priority","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Instituto de Telecomunicações","keywords":"Computer science; Rendezvous; Scheduling (production processes); Server; Queueing theory; Queue; Heuristic; FIFO (computing and electronics); Distributed computing; Computer network; Mathematical optimization; Mathematics; Artificial intelligence","score_opus":0.021632617157627963,"score_gpt":0.2220025999213346,"score_spread":0.20036998276370663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097344578","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44341186,0.00034084564,0.3453237,0.0010019726,0.0007781378,0.0031115976,0.000015815389,0.0014885234,0.20452754],"genre_scores_gemma":[0.9891174,0.0000030252354,0.0017955618,0.00045396623,0.00055584573,0.00010067834,0.000015631456,0.000037457154,0.007920457],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989247,0.000009428978,0.00021532705,0.0003453346,0.00019407294,0.0003111935],"domain_scores_gemma":[0.99918497,0.00006224476,0.00020247599,0.00033466442,0.00020257,0.000013086389],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00030786064,0.00018624598,0.00025393948,0.00013102016,0.00020300983,0.00021427397,0.00021030227,0.0000493239,0.0004160082],"category_scores_gemma":[0.00005474558,0.0001381372,0.00009135472,0.00032914025,0.00005403157,0.0011384069,0.000079719364,0.000075422766,0.00038578443],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041228757,0.00051906734,0.019156799,0.0012576971,0.00050008175,0.000022624383,0.00020345616,0.019558042,0.00017429538,0.9466394,0.0071709747,0.004385273],"study_design_scores_gemma":[0.002685239,0.000068701695,0.00068680703,0.00014868738,0.00057635474,0.000005199316,0.0013306102,0.88322514,0.00012444268,0.012298622,0.097779684,0.0010705306],"about_ca_topic_score_codex":0.00011291007,"about_ca_topic_score_gemma":0.000064445325,"teacher_disagreement_score":0.9343408,"about_ca_system_score_codex":0.000031733547,"about_ca_system_score_gemma":0.000002460789,"threshold_uncertainty_score":0.56330717},"labels":[],"label_agreement":null},{"id":"W2097823717","doi":"10.1111/j.1475-3995.2012.00845.x","title":"A normal copula model for the arrival process in a call center","year":2012,"lang":"en","type":"article","venue":"International Transactions in Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Copula (linguistics); Probabilistic logic; Goodness of fit; Statistics; Arrival time; Parametric statistics; Joint probability distribution; Parametric model; Computer science; Mathematics; Econometrics","score_opus":0.09810120215067007,"score_gpt":0.411636736108248,"score_spread":0.31353553395757794,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2097823717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17413045,0.00010958954,0.7855802,0.0248924,0.0009512013,0.0015292305,0.00009642222,0.00006223362,0.012648261],"genre_scores_gemma":[0.99583685,0.000010432187,0.00067063235,0.00048884255,0.0005914979,0.0006473328,0.0000560233,0.000017565611,0.0016808287],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984792,0.00002999741,0.00028803435,0.00019600401,0.00064735056,0.0003594528],"domain_scores_gemma":[0.99895877,0.00036034873,0.00003494943,0.00012441938,0.0005067162,0.000014778266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001761861,0.00009844345,0.00009512793,0.00059941015,0.00027873376,0.00016778208,0.0004145814,0.00005016991,0.0005169733],"category_scores_gemma":[0.000324075,0.000080741964,0.000070641516,0.0005529743,0.00011722379,0.0018188038,0.000024964074,0.00037654073,0.000059353355],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030245117,0.00043986063,0.0077005643,0.000025120495,0.000043449796,0.000001414616,0.0004526785,0.90977675,0.00010264258,0.079027645,0.00017565502,0.0019517514],"study_design_scores_gemma":[0.0006623151,0.000003027387,0.0016740082,0.000026599439,0.0000066835564,0.0000025091329,0.00031766837,0.9823439,0.000038132053,0.00798916,0.0068367906,0.000099223274],"about_ca_topic_score_codex":0.00023804828,"about_ca_topic_score_gemma":0.0014178326,"teacher_disagreement_score":0.82170635,"about_ca_system_score_codex":0.00019044465,"about_ca_system_score_gemma":0.00007181012,"threshold_uncertainty_score":0.5660495},"labels":[],"label_agreement":null},{"id":"W2099280887","doi":"10.1007/s10479-012-1100-y","title":"A MAP-modulated fluid flow model with multiple vacations","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Ministry of Education, Science and Technology; National Research Foundation of Korea; University of Seoul; National Research Foundation","keywords":"Markovian arrival process; Fluid dynamics; Fluid queue; Flow (mathematics); Laplace transform; Mathematics; Markov process; Computer science; Mathematical optimization; Applied mathematics; Queueing theory; Mathematical analysis; Geometry; Mechanics; Physics; Statistics","score_opus":0.1644797688412679,"score_gpt":0.3985013973777777,"score_spread":0.2340216285365098,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099280887","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9027719,0.00034971768,0.078496076,0.009000077,0.00006302779,0.00072277227,0.0000283741,0.00014265957,0.008425407],"genre_scores_gemma":[0.99162865,0.000017188286,0.005666158,0.0003141556,0.00027061894,0.00008754895,0.00010733878,0.000025818557,0.001882528],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99862057,0.000049705963,0.00023619656,0.00019253927,0.00045824013,0.00044277392],"domain_scores_gemma":[0.997785,0.00009748344,0.00003505611,0.00045191403,0.0015991504,0.000031441294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013654997,0.00010872283,0.00015543071,0.00057482236,0.0005544777,0.00013722121,0.00026853994,0.000048676226,0.00031880545],"category_scores_gemma":[0.0005190751,0.000091130416,0.000056735797,0.0010727954,0.00013993433,0.0020961002,0.00013838813,0.00018573913,0.00044026147],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060375434,0.00029524087,0.0018899406,0.000042526226,0.00007266878,7.3356506e-7,0.00019103757,0.94767463,0.005162432,0.03989795,0.0039839833,0.0007285003],"study_design_scores_gemma":[0.00019178922,0.00001117713,0.00064230955,0.000026312067,0.000018604143,4.6113948e-7,0.00020873343,0.9909533,0.0016948999,0.0020668863,0.004058556,0.0001269282],"about_ca_topic_score_codex":0.00030543737,"about_ca_topic_score_gemma":0.0002509048,"teacher_disagreement_score":0.08885676,"about_ca_system_score_codex":0.000014319682,"about_ca_system_score_gemma":0.00004914989,"threshold_uncertainty_score":0.5658817},"labels":[],"label_agreement":null},{"id":"W2099372980","doi":"10.1023/a:1019166716446","title":"Correction to: On a decomposition for infinite stochastic matrices","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Winnipeg","funders":"","keywords":"Mathematics; Queueing theory; Discrete mathematics; Applied mathematics; Combinatorics; Pure mathematics; Statistics","score_opus":0.01107711568855805,"score_gpt":0.2592340744636843,"score_spread":0.24815695877512625,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099372980","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6875331,0.00014449695,0.27065054,0.00047022666,0.0056585176,0.0018560608,0.000008988664,0.0010579452,0.032620132],"genre_scores_gemma":[0.99399203,8.982619e-7,0.00012661547,0.00057788315,0.0015780153,0.00014906994,0.00002758565,0.00003376934,0.0035141485],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990674,0.00001810387,0.00026582048,0.00027442857,0.00015313576,0.00022109984],"domain_scores_gemma":[0.99931747,0.00022851858,0.00015135435,0.00019600573,0.00009217739,0.0000144688875],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003488366,0.00015051778,0.00020194578,0.00033706124,0.00026398833,0.00027990786,0.00012925935,0.000041304218,0.00007704429],"category_scores_gemma":[0.00013922284,0.00014754696,0.00008494307,0.0005097681,0.000010162439,0.0005085479,0.000015152407,0.000072497336,0.0009166835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00031376802,0.00005312749,0.000093160525,0.0001665533,0.000047020058,0.000002735108,0.00007847939,0.9595553,0.0004929995,0.014627305,0.007406696,0.017162826],"study_design_scores_gemma":[0.0006746837,0.00010036704,0.00025819585,0.0012183331,0.00019807353,0.00000786361,0.0003005978,0.90469116,0.00006369972,0.003410694,0.08848114,0.0005952069],"about_ca_topic_score_codex":0.00046962927,"about_ca_topic_score_gemma":0.000031159936,"teacher_disagreement_score":0.30645892,"about_ca_system_score_codex":0.00006849983,"about_ca_system_score_gemma":0.0000067277647,"threshold_uncertainty_score":0.99986124},"labels":[],"label_agreement":null},{"id":"W2099823045","doi":"10.1109/cdc.2005.1583007","title":"An Extension of Duality and Hierarchical Decomposition to a Game-Theoretic Framework","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Nash equilibrium; Game theory; Duality (order theory); Mathematical optimization; Normal-form game; Best response; Mathematical economics; Equivalence (formal languages); Extension (predicate logic); Computer science; Decomposition; Optimization problem; Mathematics; Repeated game; Discrete mathematics","score_opus":0.0076718519194996695,"score_gpt":0.2750023837840211,"score_spread":0.26733053186452144,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099823045","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.809221,0.000011909959,0.1872273,0.00047730564,0.000026416825,0.00008195208,6.19058e-7,0.000077797326,0.0028756717],"genre_scores_gemma":[0.9855988,9.414965e-7,0.012968282,0.0011185814,0.00024569765,0.000003879301,0.000013904518,0.0000122142,0.000037710848],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99924153,0.00002648606,0.00021262038,0.00024719472,0.00013513592,0.00013701945],"domain_scores_gemma":[0.9994644,0.000091183545,0.00008419775,0.00025786515,0.00008831456,0.000014039733],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00036344375,0.00009807542,0.00016924841,0.00016631893,0.00006883906,0.000062122774,0.00008858966,0.000051562656,0.00017348891],"category_scores_gemma":[0.00011247985,0.00008561787,0.00004033386,0.0003401435,0.00008437368,0.00038655155,0.00007390032,0.000078577934,0.000026238617],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009841256,0.00010068846,0.00270585,0.000038066675,0.000005956171,0.000003047832,0.000020150785,0.002028422,0.0066645085,0.98502666,0.000048872764,0.0032593526],"study_design_scores_gemma":[0.00015493888,0.000023148166,0.021125328,0.00005763345,0.00006541695,0.0000015866908,0.00006548889,0.01935862,0.00090542214,0.957313,0.0007504673,0.00017892732],"about_ca_topic_score_codex":0.00017365412,"about_ca_topic_score_gemma":0.00003268382,"teacher_disagreement_score":0.17637776,"about_ca_system_score_codex":0.000006545094,"about_ca_system_score_gemma":0.0000022818426,"threshold_uncertainty_score":0.34913954},"labels":[],"label_agreement":null},{"id":"W2099949338","doi":"10.1142/s0217595914400016","title":"ON MULTISERVER RETRIAL QUEUES: HISTORY, OKUBO-TYPE HYPERGEOMETRIC SYSTEMS AND MATRIX CONTINUED-FRACTIONS","year":2014,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematics; Generating function; Applied mathematics; Singularity; Hypergeometric function; Hypergeometric distribution; Taylor series; Matrix (chemical analysis); Markov chain; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.056794314662746925,"score_gpt":0.33760670257978215,"score_spread":0.2808123879170352,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2099949338","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9127492,0.003955695,0.0038317216,0.0047175153,0.0052188304,0.00082551053,0.000008887492,0.00008046945,0.06861218],"genre_scores_gemma":[0.99225783,0.000084245396,0.00021163086,0.00006474705,0.002236193,0.0000057490524,0.000012085007,0.00002642927,0.005101102],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99744606,0.00025203146,0.00055549253,0.00024374222,0.0012067942,0.00029585394],"domain_scores_gemma":[0.99599934,0.0011560327,0.00033963853,0.00023562722,0.0022160574,0.00005331437],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005272381,0.00014830797,0.00033163585,0.0017899683,0.00038770927,0.0003767207,0.00027928475,0.00009447825,0.0004633978],"category_scores_gemma":[0.0074318238,0.00012443925,0.000101458776,0.0011754124,0.00014669728,0.0012645369,0.00007415865,0.00064584025,0.0002768571],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021862555,0.0005460425,0.007085382,0.00019633574,0.00041773135,0.00008954141,0.00016349385,0.02689475,0.0060836724,0.79471344,0.15737756,0.004245781],"study_design_scores_gemma":[0.0026295953,0.00036438674,0.0032279845,0.00024314482,0.00012349829,0.000085968975,0.0013106763,0.041819487,0.000051903866,0.008621876,0.9411099,0.00041159743],"about_ca_topic_score_codex":0.0001122564,"about_ca_topic_score_gemma":0.000009232845,"teacher_disagreement_score":0.78609157,"about_ca_system_score_codex":0.00030586676,"about_ca_system_score_gemma":0.00012477132,"threshold_uncertainty_score":0.88971245},"labels":[],"label_agreement":null},{"id":"W2100264258","doi":"10.1017/s0269964808000119","title":"MAXIMIZING THE THROUGHPUT OF TANDEM LINES WITH FLEXIBLE FAILURE-PRONE SERVERS AND FINITE BUFFERS","year":2008,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Server; Computer science; Throughput; Reliability (semiconductor); Markov process; Heuristics; Computer network; Queueing theory; Distributed computing; Operating system; Mathematics; Statistics","score_opus":0.021854435115014066,"score_gpt":0.2063125399319547,"score_spread":0.18445810481694064,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100264258","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99651307,0.00006844597,0.0009853796,0.0014250897,0.000018206769,0.00013864833,7.0214446e-7,0.000027191523,0.00082323904],"genre_scores_gemma":[0.9987132,0.000014801975,0.0010472762,0.00016560373,0.00003981811,0.000011406681,0.0000018448101,0.000001817074,0.000004229498],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940056,0.000008027085,0.00017589993,0.0000877612,0.00021302608,0.00011475628],"domain_scores_gemma":[0.99955267,0.00022137648,0.00008852457,0.00008478938,0.000047947473,0.000004665939],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010882836,0.00007737801,0.00009310142,0.000079051155,0.00027249707,0.00007093698,0.00017867664,0.00001623278,0.000004252462],"category_scores_gemma":[0.0002386129,0.000039824245,0.000016469776,0.00055737054,0.0003580286,0.0012960389,0.00005610425,0.000076941404,9.063985e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008629862,0.000009032436,0.010342665,0.000093414244,0.0000075804296,1.8293785e-7,0.0009749167,0.9435398,0.000013902089,0.044684608,0.000008655957,0.00031660585],"study_design_scores_gemma":[0.0002577901,0.00002631596,0.017693404,0.00007970205,0.00001950637,0.000013302318,0.0016507257,0.9538692,0.000057556976,0.024771651,0.001394251,0.00016655574],"about_ca_topic_score_codex":0.000064518106,"about_ca_topic_score_gemma":0.000020343688,"teacher_disagreement_score":0.019912958,"about_ca_system_score_codex":0.00000811506,"about_ca_system_score_gemma":0.000012974142,"threshold_uncertainty_score":0.20958546},"labels":[],"label_agreement":null},{"id":"W2100494428","doi":"10.1287/msom.1120.0406","title":"Strategic Queueing Behavior and Its Impact on System Performance in Service Systems with the Congestion-Based Staffing Policy","year":2012,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":47,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Hong Kong Polytechnic University","keywords":"Staffing; Queueing theory; Service (business); Queue; Server; Computer science; Service system; Information system; Operations research; Business; Microeconomics; Computer network; Marketing; Economics","score_opus":0.015916183368440112,"score_gpt":0.24620830456505352,"score_spread":0.2302921211966134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100494428","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99305856,0.00007053747,0.00018732878,0.0013664787,0.00011184837,0.0010916175,0.0000040555747,0.00018894063,0.0039206133],"genre_scores_gemma":[0.9975449,0.0000056026524,0.000074539,0.0013954646,0.0003659453,0.00040089223,0.000042618474,0.000052869775,0.00011715642],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983269,0.00006347615,0.00034100906,0.000376421,0.00034605063,0.000546174],"domain_scores_gemma":[0.99912137,0.00006171829,0.00017445406,0.00047343285,0.00013047594,0.000038543665],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00068813143,0.0003816049,0.00027588184,0.00060104433,0.0006965728,0.00073675887,0.0003467661,0.00005555386,0.000023691377],"category_scores_gemma":[0.0000041873677,0.00026081482,0.00003976865,0.00092074584,0.000017765551,0.0015491998,0.00016020778,0.0002301711,0.00012542201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006139578,0.00010183142,0.0024326793,0.001096938,0.00006878139,0.000010028136,0.0001476183,0.9646782,0.000027040027,0.031063253,0.0000027363612,0.00030945137],"study_design_scores_gemma":[0.0017855603,0.000056748846,0.14058828,0.0014544077,0.0006932929,0.000013375881,0.013003506,0.8401781,0.00036823936,0.000023321496,0.00077625166,0.0010589331],"about_ca_topic_score_codex":0.0025942787,"about_ca_topic_score_gemma":0.0014384338,"teacher_disagreement_score":0.1381556,"about_ca_system_score_codex":0.00033953533,"about_ca_system_score_gemma":0.000025069658,"threshold_uncertainty_score":0.9999844},"labels":[],"label_agreement":null},{"id":"W2100652140","doi":"10.1287/opre.48.2.243.12377","title":"Probabilistic Analysis of Renewal Cycles: An Application to a Non-Markovian Inventory Problem with Multiple Objectives","year":2000,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Random variable; Probability distribution; Mathematical optimization; Markov chain; Probabilistic logic; Renewal theory; Computer science; Mathematics; Statistics","score_opus":0.02247976830931433,"score_gpt":0.3230117444600153,"score_spread":0.300531976150701,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2100652140","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9805013,0.000007324857,0.009561663,0.0002733304,0.0000046269543,0.0009830889,0.000008850505,0.000054489774,0.008605326],"genre_scores_gemma":[0.99471915,0.0000025589634,0.003426092,0.00007133274,0.00011217993,0.0005215666,0.0001629081,0.00002304971,0.00096116145],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983873,0.000096323856,0.00028432283,0.00046749148,0.00047763507,0.00028697934],"domain_scores_gemma":[0.99848586,0.000082657614,0.000039206563,0.0006123443,0.00074174383,0.000038156923],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010919147,0.00012521168,0.00024463047,0.0012872058,0.00046961452,0.00020814972,0.00034290383,0.00004414758,0.00044545316],"category_scores_gemma":[0.00023657916,0.00010813298,0.00006545991,0.005536512,0.00016223869,0.0009014956,0.00007227548,0.00014841459,0.00011195097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019215458,0.00034230592,0.008491504,0.00004991895,0.0002514335,0.0000013739356,0.0006623113,0.97301453,0.0034883579,0.0055405293,0.00002827271,0.007937325],"study_design_scores_gemma":[0.0002996866,0.00007636447,0.008083077,0.000039858667,0.0003128425,2.6245476e-7,0.0010698873,0.9867107,0.0001804827,0.0020078353,0.0009993564,0.00021961768],"about_ca_topic_score_codex":0.0038479709,"about_ca_topic_score_gemma":0.024103932,"teacher_disagreement_score":0.020255962,"about_ca_system_score_codex":0.00008995231,"about_ca_system_score_gemma":0.00006638651,"threshold_uncertainty_score":0.9937036},"labels":[],"label_agreement":null},{"id":"W2102966671","doi":"10.1016/j.peva.2006.01.001","title":"Discrete-time single-server finite-buffer queues under discrete Markovian arrival process with vacations","year":2006,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Markovian arrival process; Computer science; Queue; Markov process; Blocking (statistics); Queueing theory; Real-time computing; Discrete time and continuous time; Fraction (chemistry); Markov chain; Process (computing); Computer network; Mathematics; Statistics; Operating system","score_opus":0.01655201620770077,"score_gpt":0.2544099327511873,"score_spread":0.2378579165434865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2102966671","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9756998,0.0000426608,0.007859684,0.00091593526,0.000093297145,0.00048640848,0.0000033844356,0.00021544713,0.014683424],"genre_scores_gemma":[0.9964947,0.0000022618715,0.00032926307,0.00032085468,0.0008264872,0.00014063508,0.00051455793,0.00005174486,0.0013194978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99803996,0.000042503754,0.00036585904,0.00042140906,0.00077971915,0.00035052866],"domain_scores_gemma":[0.998614,0.00007121467,0.0003653385,0.0003980352,0.0005358533,0.000015563552],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009011482,0.00027537355,0.00022954182,0.00029595543,0.00045137573,0.00027009659,0.0002481217,0.00007040303,0.00093202625],"category_scores_gemma":[0.00012789092,0.00022559594,0.000073369396,0.0008969203,0.0001044517,0.0033474327,0.000057875815,0.0001475059,0.00047226637],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030401413,0.00018912251,0.040713992,0.0001999836,0.00009685238,0.0000012573905,0.0001248842,0.94726187,0.0011331312,0.0044187666,0.00036905523,0.005187099],"study_design_scores_gemma":[0.00096138194,0.00004260767,0.058765996,0.00016363096,0.0005631119,0.000001458576,0.000187588,0.9176589,0.00079071044,0.019338043,0.0009350174,0.00059150317],"about_ca_topic_score_codex":0.00007970042,"about_ca_topic_score_gemma":0.00018802885,"teacher_disagreement_score":0.029602889,"about_ca_system_score_codex":0.00013327386,"about_ca_system_score_gemma":0.000049471942,"threshold_uncertainty_score":0.9999813},"labels":[],"label_agreement":null},{"id":"W2103039578","doi":"10.1287/msom.2014.0493","title":"Dynamic Call Center Routing Policies Using Call Waiting and Agent Idle Times","year":2014,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Heuristics; Routing (electronic design automation); Call management; Idle; Mathematical optimization; Operations research; Computer network; Distributed computing; Call control; Mathematics","score_opus":0.011074421339837106,"score_gpt":0.23320217211737898,"score_spread":0.22212775077754188,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2103039578","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.959711,0.000029036666,0.023642184,0.0021192322,0.00023776668,0.00047061613,0.0000039297993,0.00033641397,0.01344978],"genre_scores_gemma":[0.9876587,0.00001110307,0.005404471,0.0051285154,0.0003136336,0.000030941454,0.00007641286,0.000067549445,0.001308723],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805313,0.000044617915,0.00047606183,0.000589084,0.00029251736,0.00054458785],"domain_scores_gemma":[0.9991382,0.000041150375,0.00017851079,0.0005093504,0.00009721777,0.000035581605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00053126324,0.00037408952,0.0003102678,0.00042388166,0.0010165084,0.0008829448,0.0003628025,0.00005936742,0.000115134644],"category_scores_gemma":[0.000029637245,0.00037115216,0.00008787418,0.00032417715,0.00004365903,0.0011727262,0.0008461916,0.00017489691,0.00017108787],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003222275,0.00020532781,0.0016843113,0.0010859803,0.00042246384,0.0000293573,0.000696592,0.9194699,0.0010143003,0.058818765,0.00020241014,0.016338367],"study_design_scores_gemma":[0.00059428485,0.0000064766245,0.0032866383,0.00019618568,0.00031517242,0.0000055838045,0.0008674754,0.97842354,0.00027133903,0.0013694558,0.014089735,0.00057411456],"about_ca_topic_score_codex":0.001583831,"about_ca_topic_score_gemma":0.0014682297,"teacher_disagreement_score":0.058953635,"about_ca_system_score_codex":0.00013871909,"about_ca_system_score_gemma":0.000004957421,"threshold_uncertainty_score":0.99987406},"labels":[],"label_agreement":null},{"id":"W2104288018","doi":"10.1287/opre.2014.1300","title":"Double-Sided Batch Queues with Abandonment: Modeling Crossing Networks","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":48,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Abandonment (legal); Queue; Computer science; Queueing theory; Function (biology); Order (exchange); Real-time computing; Mathematical optimization; Mathematics; Computer network; Economics","score_opus":0.0602799683063076,"score_gpt":0.33512833002595727,"score_spread":0.27484836171964966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104288018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63458645,0.00006618953,0.34889394,0.001000454,0.000058017456,0.00032193022,4.420418e-7,0.00013892836,0.014933618],"genre_scores_gemma":[0.9955707,0.00000872835,0.0014100169,0.0002376007,0.00092573283,0.00008455943,0.000044012868,0.00004105674,0.0016775874],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982787,0.00007090698,0.00024310626,0.00039107513,0.0005184018,0.0004978177],"domain_scores_gemma":[0.99878633,0.00011925185,0.000028935005,0.00045843754,0.0005824694,0.00002455094],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020230012,0.00014969018,0.00018502412,0.00036779777,0.0022243087,0.0023052653,0.00030597125,0.00006157469,0.00023774891],"category_scores_gemma":[0.00023360025,0.000121972604,0.00004742945,0.00110641,0.0001993967,0.0015768245,0.00019214657,0.000384735,0.00019842148],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009766043,0.000034962988,0.0002813226,0.000013292394,0.000023417775,0.0000024603037,0.00009349554,0.94824094,0.0003565277,0.049247645,0.00008678499,0.0015215108],"study_design_scores_gemma":[0.0006634709,0.000010681962,0.000022752034,0.00007083053,0.000021949882,8.6997613e-7,0.0001785309,0.9938551,0.00009151812,0.0018869509,0.0030268088,0.00017053542],"about_ca_topic_score_codex":0.0018724398,"about_ca_topic_score_gemma":0.0023328473,"teacher_disagreement_score":0.36098424,"about_ca_system_score_codex":0.00006230999,"about_ca_system_score_gemma":0.000040300034,"threshold_uncertainty_score":0.99907464},"labels":[],"label_agreement":null},{"id":"W2104293546","doi":"10.1287/ijoc.1030.0045","title":"An Algorithm to Compute the Waiting Time Distribution for the M/G/1 Queue","year":2004,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; George Mason University; National Science Foundation","keywords":"Laplace transform; Convergence (economics); Applied mathematics; Queueing theory; Mathematical optimization; Algorithm; Mathematics; Queue; Computer science; Distribution (mathematics); Probability distribution; Mathematical proof; Mathematical analysis","score_opus":0.01100501900988031,"score_gpt":0.2535491209065889,"score_spread":0.24254410189670855,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2104293546","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.102999255,0.000018026289,0.8902702,0.0055311006,0.00047199868,0.0003187289,0.0000045943225,0.00012237254,0.00026377657],"genre_scores_gemma":[0.9777406,0.0000016562717,0.00592981,0.010860001,0.0053675263,0.000005880871,0.000036007114,0.00003201516,0.000026520875],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99856645,0.000014233126,0.00048751646,0.00017460111,0.00032829744,0.00042888155],"domain_scores_gemma":[0.9984713,0.00037627426,0.00051515177,0.0002783914,0.00032506685,0.000033776327],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0020584972,0.0002023747,0.00020114334,0.0001202503,0.0021163719,0.0010426576,0.0006847481,0.000043716256,0.000012625462],"category_scores_gemma":[0.00033371165,0.00011065688,0.00018717688,0.0005431868,0.0000507118,0.0010567008,0.00014748474,0.00039718175,0.00014210823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033337215,0.000025132707,0.000018947929,0.000006666994,0.00005141324,0.0000047869253,0.0001112743,0.6920263,0.000035925597,0.023492055,0.00038251647,0.2838116],"study_design_scores_gemma":[0.00056394783,0.00005795777,0.00030120034,0.00013310589,0.00007097677,0.000042948508,0.00036798534,0.9407821,0.00007212644,0.016518388,0.040862244,0.00022698705],"about_ca_topic_score_codex":0.000035205303,"about_ca_topic_score_gemma":0.0000057168604,"teacher_disagreement_score":0.88434035,"about_ca_system_score_codex":0.00014516794,"about_ca_system_score_gemma":0.000024059555,"threshold_uncertainty_score":0.99999434},"labels":[],"label_agreement":null},{"id":"W2105118276","doi":"10.1109/pacrim.1989.48344","title":"Analysis of asymmetric prioritized token ring","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Security token; Computer network; Queueing theory; Class (philosophy); Token ring; Service (business); Poisson process; Process (computing); Poisson distribution; Operating system; Artificial intelligence; Mathematics","score_opus":0.012611756198112596,"score_gpt":0.2399732132187856,"score_spread":0.227361457020673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105118276","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45572147,0.00011550929,0.038092162,0.000068923524,0.00010950203,0.00011768999,0.000001017248,0.00018707634,0.5055867],"genre_scores_gemma":[0.996781,0.000004592248,0.0017066211,0.00032910335,0.000059457627,0.0000035352332,0.000007992319,0.000012410337,0.0010952669],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906987,0.000017888537,0.00030359646,0.00021620134,0.00020198652,0.0001904355],"domain_scores_gemma":[0.99921805,0.00010584813,0.00021419335,0.00030690763,0.00014661232,0.000008407436],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0005908875,0.00011521072,0.00036706534,0.0017964967,0.00007434969,0.000055366738,0.0001648762,0.0000358392,0.0011266985],"category_scores_gemma":[0.0006522296,0.000104702674,0.0002622916,0.007444783,0.000030166955,0.0005478268,0.00005449451,0.0000594413,0.000083625826],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025841155,0.00011046846,0.10453024,0.00006213262,0.0018760036,0.0000061721416,0.000020438463,0.0149981445,0.00077535165,0.87065053,0.00011543776,0.0068292213],"study_design_scores_gemma":[0.006365349,0.000037067883,0.123183824,0.000116447074,0.047538303,0.0000032334167,0.00295657,0.4484404,0.011417684,0.16042534,0.19585511,0.0036606856],"about_ca_topic_score_codex":0.0001251722,"about_ca_topic_score_gemma":0.00005389233,"teacher_disagreement_score":0.7102252,"about_ca_system_score_codex":0.000019314142,"about_ca_system_score_gemma":0.000005896568,"threshold_uncertainty_score":0.99978644},"labels":[],"label_agreement":null},{"id":"W2105538778","doi":"10.1016/j.peva.2008.02.001","title":"Algorithmic analysis of the discrete time GIX/GY/1 queueing system","year":2008,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; University of Manitoba","funders":"","keywords":"Markov chain; Queueing theory; Bulk queue; Computer science; Markov process; Queue; Mean value analysis; Layered queueing network; Applied mathematics; Mathematics; Discrete mathematics; Statistics; Computer network","score_opus":0.018371359544014195,"score_gpt":0.2451642803064485,"score_spread":0.2267929207624343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2105538778","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9921359,0.000053609972,0.0021037038,0.00009494349,0.0001460638,0.0002677075,0.0000020075775,0.000080471815,0.005115591],"genre_scores_gemma":[0.9991066,0.000006623083,0.00013692556,0.00007679397,0.00028109868,0.00003317663,0.0000466009,0.000015306552,0.0002968921],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844337,0.000055958826,0.00038398308,0.00023097385,0.0007021828,0.00018352612],"domain_scores_gemma":[0.9986151,0.000041562518,0.00051209296,0.00045425675,0.00037024435,0.0000067712294],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015017418,0.00014092267,0.00028838322,0.00045683613,0.00041207555,0.000032343843,0.00028762192,0.000043656953,0.00025722486],"category_scores_gemma":[0.00014473479,0.00010392048,0.00021639568,0.0025299534,0.000084361105,0.001101488,0.00010142211,0.00009283693,0.0001836528],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006808962,0.00004895114,0.09424519,0.00021239689,0.001081451,0.0000012348926,0.00043246738,0.88254756,0.0030211643,0.00226093,0.00018930092,0.015891269],"study_design_scores_gemma":[0.00018956103,0.0000033969968,0.07688162,0.00005332433,0.001975416,9.714707e-7,0.000078080346,0.9200555,0.00036294933,0.000086881344,0.00018992287,0.000122366],"about_ca_topic_score_codex":0.00008497519,"about_ca_topic_score_gemma":0.000016657152,"teacher_disagreement_score":0.037507955,"about_ca_system_score_codex":0.00012445342,"about_ca_system_score_gemma":0.000030649062,"threshold_uncertainty_score":0.4237754},"labels":[],"label_agreement":null},{"id":"W2106135874","doi":"10.1109/icc.1993.397424","title":"Computational methods for performance evaluation of an ATM multiplexer supporting bursty traffic","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplexer; Computer science; Queueing theory; Asynchronous communication; Asynchronous Transfer Mode; Queue; Superposition principle; Set (abstract data type); Boundary (topology); Algorithm; Process (computing); Function (biology); Real-time computing; Multiplexing; Computer network; Theoretical computer science; Mathematics; Mathematical analysis","score_opus":0.0678318588103524,"score_gpt":0.3687486720840804,"score_spread":0.300916813273728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2106135874","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8364298,0.000025196357,0.16068803,0.00009691605,0.000074637595,0.00032294582,0.000001059479,0.00009167432,0.0022697656],"genre_scores_gemma":[0.84365517,5.0935375e-7,0.15575422,0.00016296885,0.0001739481,0.000031167216,0.000056363166,0.000015323005,0.00015034692],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998943,0.00004439761,0.00035654567,0.00022175434,0.00026128817,0.0001730253],"domain_scores_gemma":[0.99876463,0.00016515743,0.00033182098,0.00015452487,0.0005753723,0.000008483065],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.002926693,0.00010911522,0.00017817404,0.0001659583,0.00015262206,0.000042217613,0.00012871127,0.0000362053,0.001163706],"category_scores_gemma":[0.0004693922,0.00010029302,0.00008854713,0.0003176561,0.00003858332,0.0011972279,0.000027729926,0.000044811986,0.000024394176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000148725485,0.00006250226,0.00023822735,0.00004046262,0.000021830478,4.9580358e-8,0.000050931925,0.62289846,0.00017482514,0.002444878,0.000044320404,0.37400863],"study_design_scores_gemma":[0.0006345095,0.000011683227,0.0008023879,0.000010085967,0.00017828791,4.0435503e-7,0.00014392128,0.99220055,0.00023041769,0.004913753,0.0007447886,0.0001292103],"about_ca_topic_score_codex":0.000007872147,"about_ca_topic_score_gemma":0.0000073924684,"teacher_disagreement_score":0.3738794,"about_ca_system_score_codex":0.000026879725,"about_ca_system_score_gemma":0.000006983503,"threshold_uncertainty_score":0.99974936},"labels":[],"label_agreement":null},{"id":"W2107444807","doi":"10.1109/hicss.1998.649236","title":"Computation of bounds and performance guarantees for client-server systems using a queueing network model","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Queueing theory; Server; Layered queueing network; Distributed computing; Throughput; Computation; Upper and lower bounds; Software; Client; Computer network; Algorithm; Operating system","score_opus":0.039283964876878935,"score_gpt":0.24305515138912487,"score_spread":0.20377118651224593,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2107444807","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6761704,0.00024055019,0.3224089,0.0000184579,0.00007421887,0.0001498298,4.1890604e-7,0.000047783433,0.0008894142],"genre_scores_gemma":[0.99500626,0.000011482142,0.0043373127,0.00013112025,0.00026121084,0.0000073742485,0.0000041923086,0.000018138513,0.00022291185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99923617,0.00000656726,0.0002804152,0.00017641911,0.000111808054,0.0001885973],"domain_scores_gemma":[0.999479,0.000037975067,0.00024133947,0.00010388643,0.00013213466,0.000005655524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032202623,0.00011114467,0.00021058058,0.000112936956,0.00021255945,0.00011426747,0.00007532259,0.000036014524,0.000012083859],"category_scores_gemma":[0.000020594342,0.00010278591,0.00005286861,0.00023607555,0.000041544714,0.0010221023,0.000053910837,0.000037815673,0.0000040566388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027010412,0.000016151498,0.003776536,0.0003212089,0.000028457713,1.8590421e-7,0.000034903172,0.9681527,0.00008881404,0.02608381,0.000087386485,0.0013828106],"study_design_scores_gemma":[0.00028361173,0.000007206244,0.000100619414,0.0001287559,0.00008768417,7.9385563e-7,0.00009218848,0.99543005,0.0000108205095,0.0036210571,0.00011125259,0.0001259813],"about_ca_topic_score_codex":0.00007200645,"about_ca_topic_score_gemma":0.000013497713,"teacher_disagreement_score":0.31883582,"about_ca_system_score_codex":0.000016680446,"about_ca_system_score_gemma":0.0000024695075,"threshold_uncertainty_score":0.41914877},"labels":[],"label_agreement":null},{"id":"W2108062658","doi":"10.1287/opre.2014.1291","title":"Modified Echelon (<i>r, Q</i>) Policies with Guaranteed Performance Bounds for Stochastic Serial Inventory Systems","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Heuristic; Mathematical optimization; Position (finance); Upstream (networking); Upper and lower bounds; Computer science; Integer (computer science); Poisson distribution; Homogeneous; Inventory control; Fixed cost; Holding cost; Mathematics; Operations research; Combinatorics; Economics; Statistics; Microeconomics","score_opus":0.05600325632335443,"score_gpt":0.3196833356274496,"score_spread":0.2636800793040952,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108062658","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8681196,0.00003864341,0.12487642,0.0005709393,0.00021204076,0.00094285246,0.0000063673992,0.00012790842,0.0051052314],"genre_scores_gemma":[0.99508977,0.0000018153427,0.00029745876,0.00015440742,0.0013328299,0.00044810347,0.000058846257,0.000038333947,0.0025784587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984862,0.000070616436,0.00023848636,0.00030104662,0.00044976056,0.00045385672],"domain_scores_gemma":[0.9986542,0.00012870618,0.000043355823,0.00039660546,0.0007567068,0.000020461044],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018682813,0.00014649786,0.00020823936,0.00051882706,0.0012789065,0.0008155701,0.00033768464,0.000061142644,0.000022836677],"category_scores_gemma":[0.000501604,0.00012039285,0.000045017558,0.0008138051,0.00020047306,0.0009619646,0.00010511343,0.00020475406,0.00010024662],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024852957,0.00005561843,0.00015793694,0.00016700286,0.000039542057,3.5790188e-7,0.0001237416,0.78517175,0.0016820543,0.21149495,0.00046277672,0.00039573933],"study_design_scores_gemma":[0.0007177483,0.00007075627,0.000069827576,0.00006959186,0.000033590935,0.000001524248,0.00031445213,0.9916358,0.000076272445,0.0009880235,0.0058389427,0.00018344818],"about_ca_topic_score_codex":0.00083273795,"about_ca_topic_score_gemma":0.0005552772,"teacher_disagreement_score":0.21050693,"about_ca_system_score_codex":0.00007940784,"about_ca_system_score_gemma":0.000059848833,"threshold_uncertainty_score":0.98364437},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.014446493502689657,"score_gpt":0.24398057428783507,"score_spread":0.22953408078514542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2108246181","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4829958,0.000014949655,0.43809426,0.0026142949,0.000471568,0.0005332402,0.0000012019068,0.00039294173,0.074881725],"genre_scores_gemma":[0.98474157,0.0000033467636,0.008132793,0.006113554,0.00023908797,0.000031300442,0.00000313416,0.00002148079,0.000713722],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977095,0.000004667104,0.00027875273,0.000702201,0.0006880857,0.0006167614],"domain_scores_gemma":[0.9991491,0.0000062195413,0.000081302474,0.00060565514,0.00011352884,0.000044236956],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010199676,0.0002014615,0.00018115572,0.0008502307,0.0005070368,0.0004895409,0.0010706285,0.000020541662,0.000075002405],"category_scores_gemma":[0.00010484516,0.00019042517,0.00007488284,0.002729669,0.00014263664,0.0018763277,0.00093162706,0.00008657056,0.0015882036],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025413103,0.00010071568,0.00031337648,0.00005246417,0.000021351807,0.000038150687,0.00008972819,0.8665854,0.001322277,0.12615664,0.00022785807,0.005066647],"study_design_scores_gemma":[0.004646714,0.00005944129,0.003042073,0.00070719904,0.00039872812,0.000008701022,0.0025549792,0.60479164,0.0014811547,0.27950734,0.09981824,0.0029837885],"about_ca_topic_score_codex":0.00017706286,"about_ca_topic_score_gemma":0.00005812489,"teacher_disagreement_score":0.50174576,"about_ca_system_score_codex":0.00015530766,"about_ca_system_score_gemma":0.000011182508,"threshold_uncertainty_score":0.9991892},"labels":[],"label_agreement":null},{"id":"W2109494473","doi":"10.1017/s0269964808000053","title":"ON THE LAW OF THE <i>i</i>TH WAITING TIME IN A BUSY PERIOD OF <i>G</i>/<i>M</i>/<i>c</i> QUEUES","year":2007,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Recursion (computer science); Queue; Period (music); Mathematics; Combinatorics; Distribution (mathematics); Waiting period; Computer science; Discrete mathematics; Computer network; Physics; Algorithm; Mathematical analysis","score_opus":0.008955395829381386,"score_gpt":0.1980038958645435,"score_spread":0.18904850003516213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2109494473","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99039143,0.00002364196,0.00003599641,0.0012527965,0.00003157816,0.00016648424,0.0000012699226,0.000011309221,0.008085487],"genre_scores_gemma":[0.99930555,0.0000010956292,0.000061800056,0.00058817375,0.000030253486,0.000007149552,7.674482e-7,0.00000194032,0.0000032473522],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99908054,0.00001833833,0.00035248877,0.00008379296,0.00031407742,0.00015074864],"domain_scores_gemma":[0.9990575,0.00058707065,0.00016577824,0.00013887268,0.000047130667,0.0000036917515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004590653,0.000080397425,0.00010978158,0.00009088025,0.00014959327,0.000054456264,0.00040008876,0.000020929307,0.0000075524736],"category_scores_gemma":[0.0006732125,0.000039490697,0.000041758736,0.0008635143,0.00034857128,0.0006101555,0.00008574361,0.00012276167,0.000001908572],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009139807,0.000021950525,0.0008379753,0.00006671527,0.0000025969412,6.886902e-8,0.00079640595,0.3357707,0.00017144669,0.6620654,0.000007681884,0.00024993325],"study_design_scores_gemma":[0.00023524144,0.000022714594,0.0044503896,0.0002872849,0.000013615266,0.0000031527957,0.0027714611,0.85223734,0.00077930064,0.13797224,0.0010366985,0.00019058371],"about_ca_topic_score_codex":0.00013552884,"about_ca_topic_score_gemma":0.00008259539,"teacher_disagreement_score":0.52409315,"about_ca_system_score_codex":0.000015625159,"about_ca_system_score_gemma":0.0000122171605,"threshold_uncertainty_score":0.1610384},"labels":[],"label_agreement":null},{"id":"W2110091768","doi":"10.1109/mascot.2003.1240650","title":"Quantifying the properties of SRPT scheduling","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada; Sarepta Therapeutics","keywords":"Computer science; Workload; Scheduling (production processes); Distributed computing; Fair-share scheduling; Slowdown; Dynamic priority scheduling; Rate-monotonic scheduling; Response time; Real-time computing; Mathematical optimization; Computer network; Quality of service; Mathematics; Operating system","score_opus":0.05235911017085667,"score_gpt":0.25367990422611986,"score_spread":0.20132079405526318,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110091768","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97927827,0.00015475143,0.011948894,0.0015738533,0.00008064273,0.000091127185,7.049516e-8,0.00011370475,0.0067586605],"genre_scores_gemma":[0.9978066,0.000002417377,0.0011261273,0.0007291139,0.00020458635,0.0000045053403,6.7139916e-7,0.0000119308115,0.00011404513],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99943286,0.000004909521,0.00017810483,0.000118966556,0.00013243163,0.00013273575],"domain_scores_gemma":[0.9995515,0.000015561469,0.00012516673,0.00021305543,0.00009197811,0.0000027619103],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000326762,0.00008234029,0.00011696034,0.00008912134,0.00016695575,0.00006964856,0.00021178473,0.000019985386,0.00007468436],"category_scores_gemma":[0.00018342608,0.00004695091,0.0000715716,0.0003876132,0.00008171868,0.0006035424,0.00010196785,0.00006986159,0.00011776683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027439586,0.000042251097,0.001258687,0.00012397079,0.00005318516,0.0000015741728,0.00010141567,0.10326189,0.032763325,0.86113167,0.000011225199,0.0012233963],"study_design_scores_gemma":[0.003997825,0.000040524297,0.0024787136,0.0018808029,0.0012102952,0.000011819705,0.02106053,0.12537709,0.34413782,0.46923283,0.028298166,0.0022735707],"about_ca_topic_score_codex":0.00035417653,"about_ca_topic_score_gemma":0.0001094219,"teacher_disagreement_score":0.3918988,"about_ca_system_score_codex":0.000010638947,"about_ca_system_score_gemma":0.000008696045,"threshold_uncertainty_score":0.19146025},"labels":[],"label_agreement":null},{"id":"W2110475003","doi":"10.1109/infcom.1995.515894","title":"Characterization of statistical multiplexing of heterogeneous ATM sources","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Burstiness; Multiplexing; Queueing theory; Multiplexer; Queue; Statistical time division multiplexing; Computer science; Exponential function; Applied mathematics; Quality of service; Mathematics; Cauchy distribution; Mathematical optimization; Computer network; Statistics; Network packet; Telecommunications; Mathematical analysis","score_opus":0.017283104602630092,"score_gpt":0.22039489312077967,"score_spread":0.2031117885181496,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110475003","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9116792,0.000010436555,0.08596762,0.000043229695,0.00003346068,0.000057818896,0.0000060766374,0.000047446767,0.0021547126],"genre_scores_gemma":[0.9983133,0.0000034260145,0.0011847685,0.0001262873,0.00009958327,0.0000018823996,0.00002985885,0.000011361087,0.00022952608],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993965,0.000008424165,0.00025453384,0.00011737382,0.00012177306,0.00010139116],"domain_scores_gemma":[0.9995045,0.000050910046,0.00022814993,0.00012858908,0.00008297252,0.000004856039],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00009442654,0.00007493085,0.00016999959,0.00011371223,0.000037813355,0.00001787824,0.000091287635,0.000024532352,0.0018246395],"category_scores_gemma":[0.00011642569,0.0000673915,0.000046922607,0.00020825613,0.000057686728,0.00030397665,0.00005055176,0.000028354449,0.000051206058],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000120836376,0.0005218675,0.031957258,0.0007015032,0.00025003974,0.000016454234,0.0003373793,0.01830394,0.709098,0.20142695,0.00008550412,0.03718028],"study_design_scores_gemma":[0.0009059034,0.000033508008,0.005970241,0.00010339377,0.0002525933,0.000002984308,0.00020362034,0.89929503,0.075209476,0.010721215,0.0067803967,0.00052164134],"about_ca_topic_score_codex":0.000040303283,"about_ca_topic_score_gemma":0.000009114088,"teacher_disagreement_score":0.8809911,"about_ca_system_score_codex":0.0000048511433,"about_ca_system_score_gemma":8.142894e-7,"threshold_uncertainty_score":0.9990878},"labels":[],"label_agreement":null},{"id":"W2110664730","doi":"10.1017/s0269964801154021","title":"TWO CONTROL POLICIES FOR STOCHASTIC EOQ-TYPE MODELS","year":2001,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Brownian motion; Production (economics); Economic order quantity; Process (computing); Type (biology); Reflected Brownian motion; Geometric Brownian motion; Stochastic process; Control (management); Computer science; Mathematics; Mathematical optimization; Economics; Diffusion process; Microeconomics; Statistics; Business; Economy","score_opus":0.024857914471563103,"score_gpt":0.24723222408500475,"score_spread":0.22237430961344165,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2110664730","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9361108,0.000082675346,0.058406338,0.0020968134,0.00011740306,0.0004667853,0.0000030679862,0.00008256688,0.0026335448],"genre_scores_gemma":[0.9989357,0.0000017543734,0.00038051588,0.00051795685,0.000117300275,0.000035812995,0.0000035325959,0.0000019683553,0.0000054426378],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99941933,0.0000044067297,0.00017549473,0.00008379062,0.00015623776,0.00016073775],"domain_scores_gemma":[0.99955803,0.0002454862,0.00005543352,0.00006976927,0.00006577688,0.0000054759153],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013008711,0.000072633426,0.000084204905,0.00012252029,0.00018809419,0.00015572167,0.00019323366,0.000013954944,0.0000054863704],"category_scores_gemma":[0.00044897036,0.00004895202,0.000024778312,0.00046657698,0.0000976076,0.001586455,0.00002655471,0.00004935087,0.0000037436178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007831529,0.000005421182,0.00009725004,0.000017446595,0.000001981476,2.1340002e-8,0.00011461956,0.72719944,0.000004474064,0.27229184,0.0000058573946,0.0002538285],"study_design_scores_gemma":[0.00014075887,0.0000060188295,0.00016380083,0.00000905702,0.0000061766814,0.0000014446932,0.00014323428,0.8084944,4.7120838e-7,0.19052383,0.00045302667,0.000057767105],"about_ca_topic_score_codex":0.000057065525,"about_ca_topic_score_gemma":0.000014411803,"teacher_disagreement_score":0.081768006,"about_ca_system_score_codex":0.000014754616,"about_ca_system_score_gemma":0.000010371837,"threshold_uncertainty_score":0.19962054},"labels":[],"label_agreement":null},{"id":"W2111067176","doi":"10.1287/moor.25.4.679.12115","title":"Diffusion Approximations for Some Multiclass Queueing Networks with FIFO Service Disciplines","year":2000,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Semimartingale; Queueing theory; FIFO (computing and electronics); Layered queueing network; Mathematics; Heavy traffic approximation; Limit (mathematics); Diffusion; Computer science; Applied mathematics; Mathematical optimization; Discrete mathematics; Mathematical analysis; Computer network","score_opus":0.05305774655468025,"score_gpt":0.33971587626822725,"score_spread":0.286658129713547,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111067176","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85303134,0.000039021856,0.14026788,0.0027301942,0.000024573063,0.0011683009,0.000010420173,0.000094613315,0.0026336282],"genre_scores_gemma":[0.9418397,0.000016356862,0.053618595,0.00013939409,0.00041800545,0.00038981868,0.00008728461,0.000056288318,0.0034345773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99867296,0.000026024003,0.0003682814,0.00023174203,0.00039302252,0.00030798244],"domain_scores_gemma":[0.99834967,0.0003479738,0.000060181275,0.00043464117,0.0007900995,0.000017410754],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000981014,0.0001356929,0.00023376118,0.0003099232,0.0008008602,0.0002872153,0.00034046586,0.000046778536,0.00033561565],"category_scores_gemma":[0.0002875634,0.00010444223,0.000058131536,0.0011122676,0.00011205044,0.0011265579,0.00012285158,0.00016234396,0.00006936338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050540846,0.00036688434,0.00007225032,0.00058801164,0.000051261304,0.0000010221308,0.00037632862,0.82741797,0.0010835594,0.16795042,0.00010635164,0.0019354131],"study_design_scores_gemma":[0.00037787823,0.000014048819,0.00003588305,0.00014580051,0.000040898372,8.325419e-7,0.00077591825,0.97904307,0.00016044707,0.01869139,0.0005825332,0.00013131702],"about_ca_topic_score_codex":0.00016358202,"about_ca_topic_score_gemma":0.00069032586,"teacher_disagreement_score":0.1516251,"about_ca_system_score_codex":0.000028828927,"about_ca_system_score_gemma":0.000025868936,"threshold_uncertainty_score":0.615965},"labels":[],"label_agreement":null},{"id":"W2111377928","doi":"10.1109/ccece.2004.1347588","title":"Link-layer modeling of a wireless channel using stochastic network calculus","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Network calculus; Computer science; Queueing theory; Wireless network; Quality of service; Channel (broadcasting); Probabilistic logic; Network packet; Wireless; Markov chain; Markov process; Computer network; Algorithm; Distributed computing; Mathematical optimization; Mathematics; Telecommunications; Artificial intelligence","score_opus":0.033049184111609835,"score_gpt":0.25161846371515745,"score_spread":0.2185692796035476,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111377928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2459254,0.000054196993,0.7523362,0.00013221869,0.00013870507,0.0001019455,3.6452252e-7,0.0001078279,0.0012031066],"genre_scores_gemma":[0.9957072,0.0000013738926,0.0023668022,0.0005122472,0.0013079711,0.000004703753,0.0000055114006,0.000038981652,0.000055199966],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987841,0.0000072181488,0.00035758028,0.00027534395,0.0002124904,0.00036324706],"domain_scores_gemma":[0.99929124,0.000025727517,0.00020979394,0.00027220172,0.00018653004,0.000014506257],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032972632,0.00018849024,0.0003165896,0.00018791606,0.00018146953,0.000057099267,0.0002090922,0.000072388226,0.00006470395],"category_scores_gemma":[0.00006183582,0.00017469421,0.00013519777,0.0007658272,0.000046165624,0.00065480947,0.00016869306,0.00012540133,0.00004394222],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027954384,0.00002590009,0.000011513916,0.000039621176,0.00004266268,0.0000037979244,0.000028720287,0.93572176,0.00037957405,0.063356414,0.0000040739333,0.00035803698],"study_design_scores_gemma":[0.0003643517,0.0000033537967,0.000002252529,0.00012343124,0.00013736663,0.0000013127216,0.00013834021,0.923031,0.000046556816,0.07593949,0.000012700108,0.00019990103],"about_ca_topic_score_codex":0.0007468516,"about_ca_topic_score_gemma":0.00009360156,"teacher_disagreement_score":0.7499694,"about_ca_system_score_codex":0.000050200695,"about_ca_system_score_gemma":0.000021561093,"threshold_uncertainty_score":0.7123823},"labels":[],"label_agreement":null},{"id":"W2111555887","doi":"10.1109/iccs.1994.474199","title":"On traffic shaping in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network; Asynchronous Transfer Mode","score_opus":0.026389112030369158,"score_gpt":0.22082390085327688,"score_spread":0.1944347888229077,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111555887","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.76149184,0.00016449082,0.008745545,0.0012444537,0.00023273418,0.0001677308,1.0779181e-7,0.0005354861,0.22741762],"genre_scores_gemma":[0.99452305,0.000006393639,0.0000940222,0.0033127835,0.00034612438,0.000005338526,0.0000024159165,0.000016255892,0.0016936236],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993214,0.0000068392237,0.00015809959,0.00020062749,0.00009448079,0.00021854154],"domain_scores_gemma":[0.99968714,0.00006403054,0.000059911443,0.00016604929,0.000017644918,0.000005238368],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00018520995,0.00010584039,0.00012998143,0.00021049693,0.00007091033,0.000078135425,0.00013449465,0.0000393617,0.0028379732],"category_scores_gemma":[0.0000761052,0.000095486444,0.000056329714,0.00061225815,0.000018959163,0.0004720814,0.000040828287,0.00011943697,0.0008424596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013034437,0.00007358992,0.00044054913,0.000010401488,0.000010679898,0.000017613322,0.000015998747,0.85984147,0.000006291803,0.10917487,0.002754117,0.027641382],"study_design_scores_gemma":[0.00023545335,0.0000030008864,0.00022289636,0.000031075182,0.000012765718,2.522552e-7,0.00004420163,0.98875827,0.0000013685433,0.005186908,0.0053545213,0.00014930757],"about_ca_topic_score_codex":0.000020091917,"about_ca_topic_score_gemma":0.00011071413,"teacher_disagreement_score":0.23303121,"about_ca_system_score_codex":0.000023094657,"about_ca_system_score_gemma":5.0627006e-7,"threshold_uncertainty_score":0.9999355},"labels":[],"label_agreement":null},{"id":"W2111601904","doi":"10.1109/icdcs.1992.235029","title":"Performance analysis of hierarchical task queue organization for parallel systems","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Bottleneck; Computer science; Task (project management); Hierarchical organization; Factor (programming language); Distributed computing; Queueing theory; Parallel computing; Theoretical computer science; Computer network; Embedded system; Engineering; Programming language","score_opus":0.009922995860718197,"score_gpt":0.21727245634873957,"score_spread":0.20734946048802136,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111601904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5471571,0.000033861164,0.44024205,0.00008779159,0.00012495666,0.00027693555,0.0000033600054,0.00013295149,0.011941012],"genre_scores_gemma":[0.9974706,0.000005848885,0.0013931021,0.00017105881,0.00008700226,0.000012373638,0.0000976378,0.000019952124,0.0007424289],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991514,0.000015964415,0.00031417827,0.00021047097,0.00014278236,0.00016521697],"domain_scores_gemma":[0.99912876,0.00007607081,0.0002227585,0.00024147907,0.00032234465,0.0000085678175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040968508,0.00010966781,0.00031285643,0.00049564237,0.00013057637,0.00006224561,0.00014416041,0.000049259208,0.00024168237],"category_scores_gemma":[0.00038407277,0.00009733436,0.00011269126,0.0025478231,0.000036687023,0.00051080727,0.000027477925,0.00004406614,0.000027110213],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027128346,0.00006345838,0.041981768,0.00017296778,0.0006605779,3.5738276e-7,0.000022700378,0.3162188,0.0004920382,0.63984764,0.00021913505,0.0002934234],"study_design_scores_gemma":[0.000550746,0.000013742007,0.0048868386,0.000023320898,0.0030088685,6.5264226e-7,0.00026053662,0.9739524,0.00025934327,0.004172042,0.012518302,0.0003531666],"about_ca_topic_score_codex":0.00004641217,"about_ca_topic_score_gemma":0.000017089404,"teacher_disagreement_score":0.6577336,"about_ca_system_score_codex":0.000019910938,"about_ca_system_score_gemma":0.000009328606,"threshold_uncertainty_score":0.396918},"labels":[],"label_agreement":null},{"id":"W2111843581","doi":"10.1109/icps.2004.17","title":"Internet performance modeling using mixture dynamical system models","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"","keywords":"Marginal distribution; Log-normal distribution; Gaussian; Applied mathematics; Autocorrelation; Mathematics; Internet traffic; Connection (principal bundle); Computer science; Algorithm; Mathematical optimization; Random variable; Statistics; The Internet","score_opus":0.02530204963400252,"score_gpt":0.22107891039784183,"score_spread":0.19577686076383932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2111843581","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.494951,0.00001692088,0.49743345,0.000044774526,0.00008949465,0.00005913584,2.435862e-7,0.00023642821,0.007168532],"genre_scores_gemma":[0.99264586,0.0000012952577,0.00635218,0.00037830666,0.00039217327,0.0000045274114,0.000010578251,0.000035673223,0.00017940655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988993,0.00000582299,0.000284746,0.0003125622,0.00020533829,0.0002922691],"domain_scores_gemma":[0.99949324,0.000007869653,0.00010821383,0.00026100862,0.00011637776,0.000013317073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023455049,0.00019473501,0.00022673632,0.00020973383,0.00014177374,0.00015633031,0.00026648073,0.00007870211,0.000040636754],"category_scores_gemma":[0.000015601468,0.00016896534,0.00010306284,0.0003818744,0.000028724913,0.0020087617,0.00017346095,0.00015984022,0.00013958647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001833997,0.000014341117,0.000059215887,0.000105663305,0.000020297879,0.0000049516325,0.000017928189,0.8034437,0.00014360876,0.19597779,0.000003356224,0.00019083047],"study_design_scores_gemma":[0.00026389016,0.0000023609025,0.0000018339821,0.00017149623,0.000077636636,0.000007323071,0.00023308599,0.98288906,0.000049337083,0.016048543,0.00003230459,0.00022315909],"about_ca_topic_score_codex":0.00041228157,"about_ca_topic_score_gemma":0.00003538984,"teacher_disagreement_score":0.49769485,"about_ca_system_score_codex":0.00018522775,"about_ca_system_score_gemma":0.000012362218,"threshold_uncertainty_score":0.6890207},"labels":[],"label_agreement":null},{"id":"W2112518908","doi":"10.5555/1162708.1162738","title":"Modeling and simulation of call centers","year":2005,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Hierarchy; Management science; Operations research; Key (lock); Center (category theory); Point (geometry); Simulation modeling; Computer security; Engineering; Mathematics","score_opus":0.03065795609309194,"score_gpt":0.27538701789582526,"score_spread":0.24472906180273332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2112518908","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4420749,0.0000111951385,0.55624765,0.00017839785,0.000036361896,0.00006529174,7.708581e-7,0.000045844532,0.0013395954],"genre_scores_gemma":[0.9987695,0.0000011262899,0.0005572293,0.00034875542,0.0001998001,0.0000014530202,0.000011128537,0.000010377113,0.00010058648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999327,0.000009311138,0.00025568466,0.00018245894,0.00011948522,0.00010607401],"domain_scores_gemma":[0.999428,0.00006250671,0.00012710613,0.00014124063,0.00023286535,0.000008329743],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001379024,0.00009916506,0.0001355016,0.00015337522,0.000053780856,0.00006514245,0.00008734377,0.00003479657,0.00014067037],"category_scores_gemma":[0.00010878167,0.000099103585,0.000040358605,0.00012687406,0.000032187683,0.0010515064,0.00006639599,0.000055238168,0.000028217693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003530426,0.000013850232,0.0012338028,0.000021684946,0.000011369497,1.8019693e-7,0.000090027825,0.9869328,0.0001966845,0.0031475397,0.0000024093342,0.00831434],"study_design_scores_gemma":[0.00024405093,0.0000029798634,0.00020660105,0.000043942906,0.000031449264,7.185279e-8,0.000045397373,0.9957586,0.00002747851,0.00258261,0.00095556455,0.00010123136],"about_ca_topic_score_codex":0.00003179603,"about_ca_topic_score_gemma":0.00004192163,"teacher_disagreement_score":0.5566946,"about_ca_system_score_codex":0.00001504818,"about_ca_system_score_gemma":0.0000044753997,"threshold_uncertainty_score":0.4041327},"labels":[],"label_agreement":null},{"id":"W2113030856","doi":"10.1287/msom.1090.0281","title":"When Promotions Meet Operations: Cross-Selling and Its Effect on Call Center Performance","year":2009,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Staffing; Generality; Computer science; Profit center; Mathematical optimization; Profit (economics); Operations research; Control (management); Asymptotically optimal algorithm; Simple (philosophy); Service (business); Operations management; Business; Mathematics; Economics; Marketing; Microeconomics","score_opus":0.011360865619444688,"score_gpt":0.2420696479025086,"score_spread":0.2307087822830639,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113030856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98358124,0.000040604788,0.0017248617,0.0035512573,0.00018683953,0.001067295,0.000005633525,0.00032768663,0.009514594],"genre_scores_gemma":[0.9897783,0.000035744477,0.0011408584,0.0062003867,0.0003674646,0.00014495244,0.00013544476,0.000040663843,0.0021562232],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980856,0.00004072197,0.00043768046,0.0006655875,0.00033698633,0.00043340426],"domain_scores_gemma":[0.9991762,0.000028960962,0.00007963723,0.000536127,0.00014247808,0.000036583322],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00050836196,0.0003964714,0.0002812066,0.0004594919,0.0013028745,0.001147027,0.00039931046,0.00007022068,0.00019923148],"category_scores_gemma":[0.000023842109,0.00036284127,0.00007951279,0.0003340094,0.00002918604,0.0022841634,0.00021375046,0.0001998927,0.0005267209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008560366,0.00034528863,0.0005636299,0.00059061585,0.00016762834,0.00002126235,0.00030521027,0.9551399,0.00033692698,0.03191846,0.00021652551,0.010308951],"study_design_scores_gemma":[0.0041960776,0.00035197,0.029393274,0.0009844586,0.00082576874,0.000014294303,0.00033222718,0.90893704,0.012359574,0.003817075,0.03657959,0.0022086615],"about_ca_topic_score_codex":0.000056712026,"about_ca_topic_score_gemma":0.00029153543,"teacher_disagreement_score":0.046202872,"about_ca_system_score_codex":0.00009177894,"about_ca_system_score_gemma":0.0000053694876,"threshold_uncertainty_score":0.9999973},"labels":[],"label_agreement":null},{"id":"W2113539939","doi":"10.1287/moor.1090.0411","title":"Bid-Price Controls for Network Revenue Management: Martingale Characterization of Optimal Bid Prices","year":2009,"lang":"en","type":"article","venue":"Mathematics of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Martingale (probability theory); Bid price; Mathematics; Revenue; Revenue management; Econometrics; Mathematical economics; Mathematical optimization; Economics; Finance; Applied mathematics","score_opus":0.0436355011372705,"score_gpt":0.34033009454800384,"score_spread":0.29669459341073334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2113539939","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7794095,0.00007589578,0.21159439,0.0009191085,0.00006358238,0.0017754239,0.00003396781,0.000052638134,0.006075462],"genre_scores_gemma":[0.93109846,0.00003445625,0.065966,0.00008963067,0.0004132348,0.00012453548,0.00010352518,0.000027074355,0.0021430727],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986277,0.000027963779,0.0005119482,0.00018352852,0.00036935534,0.00027947073],"domain_scores_gemma":[0.99854606,0.0001831493,0.00020342882,0.00035184517,0.0007040995,0.000011385931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020630658,0.00010410779,0.00027208636,0.00038856224,0.00029853985,0.00014138034,0.00033236566,0.000037347076,0.000079620884],"category_scores_gemma":[0.00059295224,0.00009899751,0.000081479535,0.0010261133,0.00007277338,0.0006267132,0.0000998407,0.000094551535,0.00002586794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010217996,0.0005532798,0.00008757782,0.0012541199,0.00014273496,0.0000021275248,0.00035807502,0.075309075,0.106500946,0.8119151,0.00059763895,0.0031771578],"study_design_scores_gemma":[0.0015856061,0.00017362351,0.0013635366,0.000817423,0.00028404815,0.0000013762328,0.0009515547,0.86243755,0.008108069,0.11243828,0.0113660665,0.00047286437],"about_ca_topic_score_codex":0.0000076259225,"about_ca_topic_score_gemma":0.0000066531093,"teacher_disagreement_score":0.7871285,"about_ca_system_score_codex":0.000020288495,"about_ca_system_score_gemma":0.000014689195,"threshold_uncertainty_score":0.40370014},"labels":[],"label_agreement":null},{"id":"W2116021052","doi":"10.1007/978-1-4614-4909-6_1","title":"Factorization Properties for a MAP-Modulated Fluid Flow Model Under Server Vacation Policies","year":2012,"lang":"en","type":"book-chapter","venue":"Springer proceedings in mathematics & statistics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Markov chain; Computer science; Factorization; Fluid queue; Flow (mathematics); Fluid dynamics; Theoretical computer science; Algorithm; Mathematics; Mechanics; Physics; Computer network; Geometry; Queueing theory; Machine learning","score_opus":0.040841313504665286,"score_gpt":0.24777729106557259,"score_spread":0.2069359775609073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116021052","genre_codex":"methods","genre_gemma":"methods","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":"methods","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00168918,0.00031532056,0.9743249,0.00020263216,0.0003739568,0.0020101795,0.00015536648,0.0004125054,0.020515976],"genre_scores_gemma":[0.2401569,0.00034250057,0.5382658,0.0010230003,0.003975271,0.00062749424,0.0014202493,0.0014837258,0.21270503],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997637,0.0000018557586,0.00089506345,0.00046894554,0.0004975055,0.0004996664],"domain_scores_gemma":[0.99766666,0.00009408852,0.0009886931,0.00027593708,0.00094634923,0.00002826442],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005480106,0.00061052485,0.00067997107,0.0006263771,0.00019956293,0.0003419518,0.00037021487,0.0003494526,0.00008829611],"category_scores_gemma":[0.00046278033,0.00059657387,0.00012597373,0.00012978572,0.00010204987,0.0010104623,0.000228384,0.00031248387,0.0001082012],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000031108593,0.000077526085,0.000029638963,0.004430185,0.00012159643,5.444274e-7,0.0007814752,0.014649403,0.00067931594,0.9780829,0.0005353346,0.0005809602],"study_design_scores_gemma":[0.00019402526,0.0000056448384,0.000010651918,0.00048652192,0.0003455352,4.714172e-7,0.00009576027,0.39629233,0.0000624463,0.5987364,0.0032860315,0.00048416227],"about_ca_topic_score_codex":0.000017601453,"about_ca_topic_score_gemma":0.000026179105,"teacher_disagreement_score":0.43605906,"about_ca_system_score_codex":0.00026745658,"about_ca_system_score_gemma":0.000041524687,"threshold_uncertainty_score":0.9996486},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.026752530590354807,"score_gpt":0.2914396552845807,"score_spread":0.2646871246942259,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116690616","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84645206,0.000021291233,0.1302745,0.009417747,0.00048944645,0.00034185895,0.000022046064,0.0001904409,0.012790578],"genre_scores_gemma":[0.98751056,4.0585667e-7,0.003394407,0.005936532,0.002014917,0.00004699451,0.00027374373,0.000028657185,0.00079379167],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981905,0.000048521324,0.0005173208,0.00040514654,0.00059684855,0.0002416611],"domain_scores_gemma":[0.99841344,0.00019956577,0.0003932921,0.0003689335,0.0006015808,0.000023206167],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007670798,0.00019765274,0.00024193402,0.00018806447,0.0002038853,0.00016442337,0.00039725954,0.000051116953,0.00055982557],"category_scores_gemma":[0.00008765861,0.00018038548,0.00007061031,0.00081793655,0.00004197869,0.000586354,0.00009899907,0.00014320899,0.00012083114],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021628563,0.00022881017,0.0016030543,0.00003893627,0.00007401377,0.0000023849536,0.00003738633,0.8266921,0.00059027976,0.16787376,0.00035201656,0.0022909844],"study_design_scores_gemma":[0.002749817,0.000138085,0.047280423,0.0011215582,0.00046810115,0.0000060960697,0.0024437318,0.7851605,0.00024353137,0.08353631,0.07481186,0.0020399822],"about_ca_topic_score_codex":0.0019994667,"about_ca_topic_score_gemma":0.006400371,"teacher_disagreement_score":0.14105847,"about_ca_system_score_codex":0.000102241225,"about_ca_system_score_gemma":0.000017661534,"threshold_uncertainty_score":0.73559064},"labels":[],"label_agreement":null},{"id":"W2116717082","doi":"10.1287/ijoc.12.4.261.11882","title":"Internet-Type Queues with Power-Tailed Interarrival Times and Computational Methods for Their Analysis","year":2000,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":40,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; George Mason University; National Science Foundation","keywords":"Mathematics; Queue; Exponential function; Laplace transform; Applied mathematics; Steady state (chemistry); Exponential distribution; Heavy-tailed distribution; Mathematical optimization; Probability distribution; Computer science; Statistics; Mathematical analysis","score_opus":0.015289215175012884,"score_gpt":0.2948225607351147,"score_spread":0.27953334556010184,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116717082","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6652342,0.000058669542,0.33085462,0.00032631747,0.00012705679,0.00013142478,0.0000010297432,0.00009664516,0.0031699971],"genre_scores_gemma":[0.95451075,0.0000037797292,0.04280933,0.0020580601,0.000363419,0.0000014929036,0.000020547015,0.000025314877,0.0002072971],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987571,0.00003033724,0.0005090923,0.00023086365,0.00018148818,0.0002911226],"domain_scores_gemma":[0.9985611,0.00047392678,0.00046786637,0.0001357846,0.00032695453,0.00003436479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00097474386,0.000248357,0.0004344235,0.00064272096,0.00034747913,0.0006593197,0.00026143936,0.0000491632,0.00045136],"category_scores_gemma":[0.00014107222,0.00016633164,0.0002084417,0.00085148495,0.00007570905,0.0010343709,0.00007678669,0.0002830664,0.000024566132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011896621,0.000059405003,0.0055258046,0.000036693466,0.0020473963,0.000011280949,0.0006474695,0.5171314,0.000012902322,0.008066725,0.00027869098,0.46499255],"study_design_scores_gemma":[0.00085344125,0.00017193648,0.0013594087,0.00014232601,0.000426487,0.000043854263,0.00034603296,0.95861727,0.00004191031,0.020989666,0.0166539,0.0003537451],"about_ca_topic_score_codex":0.000009835445,"about_ca_topic_score_gemma":0.0000048175234,"teacher_disagreement_score":0.46463883,"about_ca_system_score_codex":0.000045577028,"about_ca_system_score_gemma":0.000016481521,"threshold_uncertainty_score":0.6782807},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.02694334533273859,"score_gpt":0.2511434062134888,"score_spread":0.2242000608807502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2116936991","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8475681,0.00001376316,0.034846146,0.001402092,0.0006820413,0.0005202913,0.0000022603122,0.00051282486,0.11445251],"genre_scores_gemma":[0.98859644,0.000006120706,0.008038262,0.0022563639,0.00028246213,0.000016957707,0.0000076247825,0.000023507837,0.0007722797],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9974019,0.00001630586,0.00039183852,0.0008023061,0.0007244864,0.00066315447],"domain_scores_gemma":[0.99851084,0.00010816122,0.00030683813,0.0008719476,0.00016556653,0.000036669022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026743277,0.0002568952,0.00024516863,0.00067869446,0.0010174211,0.0007791191,0.0011095473,0.00004577622,0.000357819],"category_scores_gemma":[0.00055439706,0.00023248876,0.00010439435,0.0025872162,0.00062485656,0.0024337978,0.0009462166,0.0003017344,0.0003050453],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025239071,0.000057411617,0.0031313228,0.000105413914,0.00003895806,0.000011751283,0.000037195383,0.026431514,0.0051778355,0.95210963,0.0000679766,0.012805776],"study_design_scores_gemma":[0.0013259549,0.000019481638,0.0494931,0.0003032697,0.0005115356,0.0000055116852,0.0015272256,0.35401592,0.0010764665,0.20625927,0.38339412,0.0020681655],"about_ca_topic_score_codex":0.00008887943,"about_ca_topic_score_gemma":0.00012073914,"teacher_disagreement_score":0.7458503,"about_ca_system_score_codex":0.00009968827,"about_ca_system_score_gemma":0.000013078103,"threshold_uncertainty_score":0.9480617},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.039330459393212266,"score_gpt":0.3084871387843281,"score_spread":0.2691566793911158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2117667427","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.368978,0.00012371957,0.6149744,0.0044062003,0.000096111675,0.0006998021,0.000008732874,0.0001522602,0.010560788],"genre_scores_gemma":[0.9764307,0.000013445706,0.021197299,0.00036426834,0.0005341961,0.000036562982,0.000042168376,0.000031058993,0.0013502622],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983569,0.00007274946,0.00028921108,0.00034862227,0.0005106269,0.00042193616],"domain_scores_gemma":[0.998812,0.00010523926,0.000043706492,0.0004186247,0.0005929248,0.00002750959],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009719157,0.00014562687,0.00022265266,0.0007237641,0.00041912677,0.000253834,0.0004324358,0.000045264384,0.00010473424],"category_scores_gemma":[0.0000614744,0.0001249743,0.00006213007,0.0011320359,0.00017365206,0.001327046,0.0003331672,0.00028517013,0.000100999336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000099355566,0.00023705936,0.00032926933,0.00006760364,0.00008924615,0.000013998186,0.0002966222,0.94753534,0.0011660041,0.03028008,0.0032540902,0.016631357],"study_design_scores_gemma":[0.00058586226,0.000020560987,0.000080039965,0.00009971634,0.000016999464,0.000002948387,0.00011573293,0.9916325,0.0002768061,0.000480252,0.0065213637,0.00016719748],"about_ca_topic_score_codex":0.00035068628,"about_ca_topic_score_gemma":0.00077563484,"teacher_disagreement_score":0.60745275,"about_ca_system_score_codex":0.00009816125,"about_ca_system_score_gemma":0.000045591816,"threshold_uncertainty_score":0.5096304},"labels":[],"label_agreement":null},{"id":"W2118552209","doi":"10.1287/ijoc.14.3.261.115","title":"Symbolic Computation of Moments in Priority Queues","year":2002,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Operator (biology); Priority queue; Moment (physics); Computer science; Computation; Mean value analysis; Queue; Laplace transform; Taylor series; Partition (number theory); Set (abstract data type); Applied mathematics; Algorithm; Layered queueing network; Mathematical optimization; Mathematics; Theoretical computer science; Combinatorics","score_opus":0.020560555334924905,"score_gpt":0.2599327109370633,"score_spread":0.23937215560213843,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118552209","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9893547,0.000044180095,0.0045110295,0.00022269104,0.0002374719,0.0000707481,1.7578853e-7,0.000041813306,0.0055171475],"genre_scores_gemma":[0.99835336,0.000007982591,0.00044377017,0.0007494158,0.00041124507,3.4056958e-7,0.0000013730804,0.000011371162,0.000021135018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874216,0.000010934876,0.0006097448,0.000107618194,0.00029813126,0.00023141823],"domain_scores_gemma":[0.9989748,0.00007149398,0.00069609843,0.000095180505,0.00014844559,0.000013983407],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006802365,0.00012966394,0.0002545951,0.00061367854,0.00015171831,0.00013865021,0.00019349292,0.000040949017,0.000041372063],"category_scores_gemma":[0.0001988644,0.000111584945,0.000093225346,0.00063337194,0.00003090014,0.001084491,0.000083787556,0.00029983916,0.000069023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007568266,0.00030081515,0.057914566,0.00017658627,0.00009534985,0.000055855937,0.00088275765,0.66176474,0.00019714527,0.014883449,0.0003735263,0.2632795],"study_design_scores_gemma":[0.0013081476,0.000040602088,0.01788556,0.00060111686,0.00003254266,0.000021626094,0.00038463288,0.9564372,0.00009917477,0.020726586,0.0021496643,0.00031317145],"about_ca_topic_score_codex":0.000027081005,"about_ca_topic_score_gemma":0.0000053455224,"teacher_disagreement_score":0.29467243,"about_ca_system_score_codex":0.00007448737,"about_ca_system_score_gemma":0.000004407404,"threshold_uncertainty_score":0.4550302},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.0640631890681417,"score_gpt":0.34920902483401234,"score_spread":0.28514583576587066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2118679801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.982115,0.0002354774,0.0067275795,0.0028400884,0.000038948598,0.0007962104,0.0000033858762,0.000052294243,0.007191054],"genre_scores_gemma":[0.9978937,0.000015401214,0.0010635385,0.00019650828,0.00011711953,0.000056727877,0.000012984616,0.000015357266,0.0006286822],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985066,0.0000613357,0.0004846459,0.0002135347,0.00046772233,0.0002661841],"domain_scores_gemma":[0.9985586,0.0001961313,0.000066662804,0.00041135238,0.0007525206,0.000014780436],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022482069,0.00012099922,0.0003118584,0.00060586084,0.00021850121,0.00038538527,0.00030662384,0.000064195825,0.00008101034],"category_scores_gemma":[0.0006347444,0.00010817954,0.000035569057,0.0011465909,0.000060719674,0.00097327173,0.00011215342,0.00020184934,0.00011741967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017156794,0.00024627958,0.00019251436,0.00043688572,0.00002256194,0.0000055332275,0.00034572728,0.08541654,0.0060933214,0.90691453,0.00006694457,0.00024201334],"study_design_scores_gemma":[0.00052681036,0.000017661629,0.0005065583,0.0002504735,0.000026234307,0.000002099825,0.0017079666,0.9536304,0.00028140785,0.042534713,0.00035097558,0.00016474152],"about_ca_topic_score_codex":0.00058854447,"about_ca_topic_score_gemma":0.0005974564,"teacher_disagreement_score":0.86821383,"about_ca_system_score_codex":0.000040126255,"about_ca_system_score_gemma":0.000031651056,"threshold_uncertainty_score":0.44114336},"labels":[],"label_agreement":null},{"id":"W2119356741","doi":"10.1109/spdp.1991.218224","title":"Approximate MVA from Markov model of software client/server systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Ministry of Colleges and Universities; Instituto de Telecomunicações","keywords":"Computer science; Rendezvous; FIFO (computing and electronics); Markov chain; Queueing theory; Server; Bottleneck; Simple (philosophy); Software; Task (project management); Human multitasking; Distributed computing; Theoretical computer science; Operating system; Computer network; Embedded system; Machine learning","score_opus":0.024189364741845822,"score_gpt":0.20876774309616192,"score_spread":0.1845783783543161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2119356741","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5542112,0.0004866075,0.3655644,0.00025990722,0.00044718958,0.00045906668,0.000029338038,0.0008164446,0.07772583],"genre_scores_gemma":[0.9867454,0.000009538991,0.0060826256,0.00040107264,0.00025438506,0.00001377905,0.00003228978,0.000034165172,0.006426742],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988718,0.00001187923,0.00035843044,0.00029641046,0.00023440193,0.0002271031],"domain_scores_gemma":[0.99911404,0.00005551962,0.00027008756,0.00045829982,0.000090606605,0.0000114297845],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017064509,0.00017128378,0.00030452208,0.00016114759,0.000087020846,0.00009559414,0.00029472556,0.00006486287,0.001521424],"category_scores_gemma":[0.00006829057,0.00014876667,0.00012754784,0.00028752198,0.000044473592,0.0009195293,0.00017278818,0.00007962478,0.00035926313],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014619989,0.0006196069,0.02301919,0.0010872767,0.0005375152,0.000017562059,0.00018548672,0.667832,0.0022806006,0.28076622,0.011403917,0.012104417],"study_design_scores_gemma":[0.00027650993,0.0000018734289,0.000047567424,0.000043719578,0.00011806464,1.4890539e-7,0.00014050187,0.98171586,0.0000707471,0.016642675,0.0007383804,0.00020397006],"about_ca_topic_score_codex":0.00020052168,"about_ca_topic_score_gemma":0.0000124182325,"teacher_disagreement_score":0.4325342,"about_ca_system_score_codex":0.000013904187,"about_ca_system_score_gemma":0.0000018055255,"threshold_uncertainty_score":0.9993913},"labels":[],"label_agreement":null},{"id":"W2120110116","doi":"10.1002/cjs.10026","title":"Large deviations of multiclass <i>M</i>/<i>G</i>/1 queues","year":2009,"lang":"en","type":"article","venue":"Canadian Journal of Statistics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Queue; Stationary distribution; Class (philosophy); Distribution (mathematics); Mathematics; Transformation (genetics); Product (mathematics); Statistics; Computer science; Econometrics; Markov chain; Mathematical analysis; Artificial intelligence","score_opus":0.012067076655114613,"score_gpt":0.22466994471439838,"score_spread":0.21260286805928377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120110116","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.16026203,0.0011551088,0.8233024,0.0030465743,0.0009935756,0.00022116529,0.00047749508,0.00003572185,0.01050596],"genre_scores_gemma":[0.9931498,0.00001519593,0.005087287,0.001305032,0.00032045963,2.3084993e-7,0.00001430986,0.000010969827,0.00009668114],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9991136,0.000012602275,0.00042566765,0.00007056456,0.00014957842,0.00022794696],"domain_scores_gemma":[0.9985426,0.00007782975,0.0005521884,0.00012308752,0.00064011227,0.00006419619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00034401982,0.00009547391,0.00022723278,0.00042070923,0.00012993679,0.000065550004,0.00020644427,0.00003418839,0.00019938938],"category_scores_gemma":[0.00083108403,0.00009342474,0.00006614422,0.0003632035,0.000057116293,0.00045619934,0.000006965241,0.0001302477,0.000022240029],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020941641,0.00005519695,0.006174005,0.00005376932,0.000082749226,0.00019068609,0.00028865365,0.0027557495,0.0003181624,0.9599089,0.024976486,0.0051746825],"study_design_scores_gemma":[0.0018116519,0.00011880431,0.020701546,0.00029775768,0.0008286377,0.000040848245,0.0018162213,0.017202659,0.00028658964,0.6100231,0.34621763,0.000654599],"about_ca_topic_score_codex":0.0006721671,"about_ca_topic_score_gemma":0.0124433255,"teacher_disagreement_score":0.8328878,"about_ca_system_score_codex":0.00005511978,"about_ca_system_score_gemma":0.00019807994,"threshold_uncertainty_score":0.69436675},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.00994156283407165,"score_gpt":0.21505813915492075,"score_spread":0.2051165763208491,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2120167960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08461338,0.000005575462,0.8078511,0.0004010819,0.00025207366,0.0005866969,0.0000011594391,0.0002630436,0.1060259],"genre_scores_gemma":[0.9111152,0.0000031076904,0.08743303,0.0006889165,0.00016845827,0.00005173477,0.000016780825,0.000022719483,0.00050004374],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979817,0.000008364084,0.00022516404,0.00067701435,0.00056786847,0.0005398497],"domain_scores_gemma":[0.9991042,0.00001820106,0.00024002267,0.00047147603,0.00013426409,0.000031839547],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011733621,0.00022364389,0.00017996706,0.0006313852,0.00060922565,0.000546506,0.000730905,0.000031253687,0.000090961825],"category_scores_gemma":[0.000076255106,0.00018529537,0.000046976278,0.002247788,0.00060153456,0.0022418578,0.0003241979,0.00016100942,0.000021170023],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000747521,0.000133027,0.0020448444,0.00016107892,0.00004977437,0.000024816036,0.00009773304,0.8251424,0.0007533539,0.16237256,0.00009736905,0.00904832],"study_design_scores_gemma":[0.00062765,0.000012215561,0.00034237528,0.000048619244,0.000096407,0.0000034791374,0.0006762384,0.99459535,0.00006825557,0.0012933181,0.0018746264,0.00036147021],"about_ca_topic_score_codex":0.000047516427,"about_ca_topic_score_gemma":0.000052984316,"teacher_disagreement_score":0.82650185,"about_ca_system_score_codex":0.000055318967,"about_ca_system_score_gemma":0.000015869762,"threshold_uncertainty_score":0.7556126},"labels":[],"label_agreement":null},{"id":"W2121515906","doi":"10.1287/ijoc.1050.0148","title":"Waiting-Time Distribution of <i>M/D<sub>N</sub>/1</i> Queues Through Numerical Laplace Inversion","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Queue; Laplace transform; Inversion (geology); Mathematics; Recursion (computer science); Burke's theorem; Numerical analysis; Applied mathematics; Mathematical optimization; Algorithm; Computer science; Mathematical analysis; Fork–join queue; Queue management system; Geology","score_opus":0.009484064999067985,"score_gpt":0.2327397478342008,"score_spread":0.2232556828351328,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2121515906","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9042482,0.00002399681,0.09182819,0.00031459474,0.0002918679,0.0000788593,0.0000014669947,0.00011602665,0.003096796],"genre_scores_gemma":[0.99647886,0.000007507578,0.00041715082,0.0018256342,0.0012019789,2.3725751e-7,0.00003346752,0.000023372495,0.000011789634],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979626,0.000017764576,0.0008358021,0.00018881298,0.0005271322,0.00046789856],"domain_scores_gemma":[0.9978937,0.00030487182,0.001228422,0.0001806602,0.00035773334,0.00003460234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018230382,0.00023400152,0.00036381182,0.00021971078,0.00049430266,0.00017801643,0.00030637134,0.000099218196,0.000021610755],"category_scores_gemma":[0.000580457,0.00019629083,0.00023493134,0.00081359554,0.00008006037,0.0017017185,0.00019736041,0.00051827723,0.00018700323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024030602,0.0007425865,0.011191031,0.00053784123,0.0006360206,0.00036664677,0.0009874426,0.3781505,0.047715206,0.10218827,0.016256427,0.43882498],"study_design_scores_gemma":[0.0035571505,0.00029711015,0.0027154183,0.0019892792,0.00038743264,0.00022895425,0.00162315,0.79305273,0.097298555,0.034215838,0.062885426,0.0017489594],"about_ca_topic_score_codex":0.000019356545,"about_ca_topic_score_gemma":0.0000016459268,"teacher_disagreement_score":0.437076,"about_ca_system_score_codex":0.00014872788,"about_ca_system_score_gemma":0.000018808756,"threshold_uncertainty_score":0.80045074},"labels":[],"label_agreement":null},{"id":"W2122482669","doi":"10.1287/opre.1070.0437","title":"Compensating for Failures with Flexible Servers","year":2007,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Server; Computer science; Independent and identically distributed random variables; Bounded function; Flexibility (engineering); Mathematical optimization; Probabilistic logic; Routing (electronic design automation); Markov process; Layered queueing network; Queueing theory; Distributed computing; Linear programming; Process (computing); Construct (python library); Service (business); Random variable; Mathematics; Computer network; Algorithm","score_opus":0.08480591749249393,"score_gpt":0.38325524129534205,"score_spread":0.2984493238028481,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122482669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6348652,0.000046110275,0.3012167,0.0047162273,0.00009076888,0.0012835612,0.000005216589,0.00027996156,0.05749626],"genre_scores_gemma":[0.98061436,7.78288e-7,0.014636916,0.00026375172,0.00048554988,0.00006068981,0.00004951959,0.000024823134,0.0038636127],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988785,0.000017552093,0.00015830247,0.00022679205,0.0003342083,0.00038466873],"domain_scores_gemma":[0.9987139,0.0002266394,0.000021226855,0.0002383074,0.0007854862,0.000014435131],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024652714,0.000082496306,0.000103201215,0.00044149449,0.0010973118,0.0004237073,0.00021186555,0.000031942836,0.00022921288],"category_scores_gemma":[0.00043612765,0.00006837006,0.000036080415,0.0010910383,0.00010620414,0.000919877,0.00008683046,0.00016392008,0.0001647489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023405814,0.000095771196,0.0033723654,0.00010803981,0.000072095965,0.000009328185,0.000149421,0.14263242,0.0058001694,0.8408457,0.0017342204,0.004946415],"study_design_scores_gemma":[0.0031950024,0.00017547834,0.0033140762,0.00023260787,0.00013159555,0.0000069248517,0.01424001,0.49280152,0.01125002,0.024429958,0.44914344,0.0010793693],"about_ca_topic_score_codex":0.0005409009,"about_ca_topic_score_gemma":0.0035961343,"teacher_disagreement_score":0.8164157,"about_ca_system_score_codex":0.000047850706,"about_ca_system_score_gemma":0.000032291824,"threshold_uncertainty_score":0.84397465},"labels":[],"label_agreement":null},{"id":"W2122572236","doi":"10.3138/infor.47.4.335","title":"History of Queueing Theory in Canada Prior to 1980","year":2009,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":true,"ca_institutions":"University of Windsor; York University","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto; Ministère de la Défense Nationale; University of Wisconsin-Milwaukee; University of Windsor; Princeton University","keywords":"Queueing theory; Computer science; Mathematical economics; History; Mathematics; Computer network","score_opus":0.029100719171042115,"score_gpt":0.28358925770228516,"score_spread":0.25448853853124304,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2122572236","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.81715107,0.00047704967,0.0039472356,0.0019304182,0.000549978,0.0014639108,0.000016358901,0.000045162957,0.17441884],"genre_scores_gemma":[0.99774295,0.000003927122,0.00006862912,0.0013057356,0.00010137877,0.000026017273,0.000024008461,0.0000031200284,0.00072426134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99859476,0.000031233718,0.0004984362,0.000079283236,0.00060789904,0.00018841478],"domain_scores_gemma":[0.99899393,0.00014582998,0.00010860443,0.00012591183,0.00060442835,0.000021271737],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021661045,0.00007482799,0.00014882092,0.0006599445,0.00009809311,0.00012592657,0.00014486977,0.000029886296,0.00004340655],"category_scores_gemma":[0.0006300849,0.000067469344,0.000016548596,0.0004500099,0.000027867056,0.0027744651,0.00005655135,0.00012780665,0.000042469495],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010184694,0.0000076053034,0.0015704035,0.00012080382,0.000007969808,0.0000013653762,0.000646474,0.02369953,0.000088861176,0.9576309,0.0029301634,0.013194104],"study_design_scores_gemma":[0.00080935925,0.000037762333,0.028729884,0.00030626665,0.000007939464,0.000003851507,0.0072720977,0.10034721,0.000044873617,0.0037135638,0.85837835,0.00034882658],"about_ca_topic_score_codex":0.3218429,"about_ca_topic_score_gemma":0.07926867,"teacher_disagreement_score":0.9539173,"about_ca_system_score_codex":0.0007073063,"about_ca_system_score_gemma":0.00073133217,"threshold_uncertainty_score":0.93753225},"labels":[],"label_agreement":null},{"id":"W2123029116","doi":"10.1017/s0269964800142068","title":"SUPPLEMENTARY VARIABLE TECHNIQUE IN STOCHASTIC MODELS","year":2000,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Variable (mathematics); Queueing theory; Class (philosophy); Computer science; Metric (unit); Applied mathematics; Random variable; Mathematics; Statistics; Artificial intelligence; Mathematical analysis; Operations management","score_opus":0.012022909249200972,"score_gpt":0.20843590162718229,"score_spread":0.19641299237798132,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123029116","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9769321,0.00003625214,0.011902872,0.001152067,0.000041534495,0.0006134625,0.000010340896,0.00006246641,0.00924889],"genre_scores_gemma":[0.9980646,0.0000019574643,0.0015210772,0.00028195782,0.0000337427,0.00007760487,0.000012452186,0.000001661966,0.0000049859505],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993829,0.0000069659027,0.00020377358,0.000093844414,0.00016523905,0.00014728995],"domain_scores_gemma":[0.999787,0.00009299829,0.00002886024,0.000073127594,0.000014031206,0.000004002038],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001762177,0.00006767334,0.000071174814,0.00014908616,0.000094076284,0.00009583579,0.00020331987,0.000017536013,0.00020477672],"category_scores_gemma":[0.00007976835,0.000048860136,0.000012631704,0.00067615113,0.000068271685,0.0015636587,0.00003265294,0.00008707018,0.0000042300303],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003109048,0.000011003553,0.00008377713,0.000021979484,7.744409e-7,8.044171e-8,0.000117490395,0.8885349,0.0000051285037,0.110709146,0.0000066213393,0.00050597836],"study_design_scores_gemma":[0.00005462376,0.0000029005278,0.00012670399,0.000020037787,0.0000019501356,0.0000013365884,0.00008065611,0.78880054,0.0000015812735,0.21025929,0.0005936552,0.000056721776],"about_ca_topic_score_codex":0.00024750835,"about_ca_topic_score_gemma":0.000029092582,"teacher_disagreement_score":0.099734366,"about_ca_system_score_codex":0.000023422814,"about_ca_system_score_gemma":0.000010270368,"threshold_uncertainty_score":0.22421615},"labels":[],"label_agreement":null},{"id":"W2123356441","doi":"10.1016/j.peva.2007.03.001","title":"Decomposition properties in fluid queues","year":2007,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Queue; Decomposition; Computer science; Statistical physics; Parallel computing; Physics; Computer network; Chemistry","score_opus":0.03347330409838538,"score_gpt":0.29632482014462924,"score_spread":0.26285151604624385,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2123356441","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9914207,0.00009503929,0.0014354555,0.00013690429,0.00014489936,0.00022566124,7.186656e-8,0.000077219534,0.006464051],"genre_scores_gemma":[0.9989821,0.00000953561,0.00016421366,0.00030277803,0.00042401423,0.000028837088,0.000027950415,0.000011835443,0.000048777456],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990411,0.000010104919,0.0002551696,0.00016494261,0.0003354824,0.00019322257],"domain_scores_gemma":[0.99951875,0.000016805903,0.0001180737,0.00013692994,0.00020464,0.0000047918966],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027953528,0.00009574728,0.000099555116,0.00036720504,0.00013361216,0.00005939006,0.00009389613,0.00003612101,0.00015199945],"category_scores_gemma":[0.00013157955,0.00008764493,0.000028372147,0.00049277535,0.000029531839,0.0019431685,0.00003270331,0.000068079666,0.00026147993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006777031,0.00030733156,0.14873238,0.00029791417,0.00003972532,0.000004136421,0.0006808893,0.22829159,0.08555364,0.0064648,0.00019631025,0.5287536],"study_design_scores_gemma":[0.0005119665,0.000010927839,0.10356751,0.000110008354,0.000056913672,8.803275e-7,0.00018722902,0.8804619,0.010907627,0.0031592702,0.0008164948,0.00020928259],"about_ca_topic_score_codex":0.00005059098,"about_ca_topic_score_gemma":0.0001835263,"teacher_disagreement_score":0.6521703,"about_ca_system_score_codex":0.00011947586,"about_ca_system_score_gemma":0.000012348585,"threshold_uncertainty_score":0.35740563},"labels":[],"label_agreement":null},{"id":"W2124313238","doi":"10.1109/icc.1996.533657","title":"Performance analysis of on-board switching in broadband satellite communication systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Telecommunications link; Statistical time division multiplexing; Multiplexing; Broadband; Computer science; Quality of service; Computer network; Communications satellite; Broadband networks; Satellite system; Blocking (statistics); Poisson process; Satellite; Telecommunications; Poisson distribution; Engineering; Mathematics","score_opus":0.020247888181157362,"score_gpt":0.2271362209230724,"score_spread":0.20688833274191504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124313238","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93456465,0.00026921704,0.0005242509,0.00011543647,0.000031288517,0.000090222165,3.5826773e-7,0.00005623459,0.06434833],"genre_scores_gemma":[0.99881226,0.00018522139,0.00014841233,0.00020551076,0.000040063816,0.00000766981,0.00001180953,0.000011074665,0.00057797635],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906397,0.000027375827,0.00039284292,0.00018075587,0.00018155275,0.0001534896],"domain_scores_gemma":[0.99900943,0.00011142142,0.00027629553,0.0005219901,0.00007492918,0.0000059132617],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004985994,0.00011668452,0.00033102246,0.0010589926,0.000084817926,0.000072491974,0.00026953584,0.000039799015,0.00022801205],"category_scores_gemma":[0.0000558568,0.000103904276,0.00010337738,0.0023571658,0.00002643597,0.00070635055,0.00006843914,0.00010976908,0.000079844314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000047789035,0.00021850635,0.26439887,0.00014257377,0.0005132565,0.0000019158588,0.00025282224,0.6679653,0.00028463066,0.04712124,0.00007963895,0.018973468],"study_design_scores_gemma":[0.00021565257,0.0000040020573,0.019073538,0.00007594334,0.00035245207,7.899672e-8,0.00023091711,0.9782725,0.00002298377,0.00013320662,0.0014818587,0.00013684721],"about_ca_topic_score_codex":0.0006000537,"about_ca_topic_score_gemma":0.0002846635,"teacher_disagreement_score":0.31030723,"about_ca_system_score_codex":0.000033285585,"about_ca_system_score_gemma":0.0000011022462,"threshold_uncertainty_score":0.42370936},"labels":[],"label_agreement":null},{"id":"W2124711711","doi":"10.1109/milcom.1998.726963","title":"Queue length performance of some non-exhaustive polling models with Bernoulli feedback","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Polling; Bernoulli's principle; Polling system; Queue; Computer science; Queueing theory; Service (business); Computer network; Engineering; Economics","score_opus":0.01677309234318716,"score_gpt":0.1940256760040966,"score_spread":0.17725258366090943,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2124711711","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8843085,0.0001021678,0.016288653,0.00030159325,0.00006385203,0.00019983585,0.0000014284175,0.00015683548,0.09857709],"genre_scores_gemma":[0.99375,0.00003800519,0.001868057,0.00050204823,0.00031922176,0.00000892724,0.0000056922663,0.000036486344,0.003471584],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988381,0.000003341801,0.00027967175,0.0003046108,0.00026411432,0.00031013155],"domain_scores_gemma":[0.999187,0.000025120575,0.00026506247,0.0003175644,0.00019095016,0.000014337753],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018097318,0.00021910759,0.00031340498,0.00025382417,0.00016255258,0.00005969814,0.00025607893,0.000055289325,0.0006413626],"category_scores_gemma":[0.000011479239,0.00017313175,0.0000801688,0.0006008599,0.000105421794,0.0028838788,0.00009839383,0.00014372164,0.00022686068],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032655156,0.00034052526,0.014177043,0.00049937796,0.00036235288,0.000015455073,0.00038900925,0.6350591,0.00073861534,0.34243557,0.0009171302,0.0047392617],"study_design_scores_gemma":[0.0006490966,0.000034438053,0.00032603703,0.00013048976,0.00016761271,0.0000015038604,0.0004924516,0.9862666,0.0012500314,0.009798693,0.00050615903,0.00037687324],"about_ca_topic_score_codex":0.00014122706,"about_ca_topic_score_gemma":0.000022426786,"teacher_disagreement_score":0.35120752,"about_ca_system_score_codex":0.000023391834,"about_ca_system_score_gemma":0.000005430585,"threshold_uncertainty_score":0.70601076},"labels":[],"label_agreement":null},{"id":"W2125142970","doi":"10.1287/msom.1120.0418","title":"Bayesian Dynamic Pricing in Queueing Systems with Unknown Delay Cost Characteristics","year":2013,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada); University of Toronto","funders":"","keywords":"Queue; Computer science; Bayesian probability; Dynamic pricing; Queueing theory; Mathematical optimization; Revenue; Bernoulli's principle; Economics; Mathematical economics; Microeconomics; Econometrics; Mathematics; Computer network","score_opus":0.005836747329554669,"score_gpt":0.20237947232494388,"score_spread":0.19654272499538922,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125142970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89651346,0.000035730714,0.08643854,0.0019465917,0.0003345671,0.0025534006,0.0000028101729,0.00042118662,0.011753716],"genre_scores_gemma":[0.99406576,0.000013251615,0.0018753537,0.001833176,0.0001739223,0.000538708,0.00012572746,0.00007602004,0.0012980623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793994,0.000036477955,0.0005759481,0.0005816657,0.00032522366,0.0005407155],"domain_scores_gemma":[0.9989412,0.000034743593,0.00020168549,0.00063158874,0.00015973153,0.00003105783],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00035976715,0.00038402938,0.00036538366,0.00069252984,0.00046353543,0.0012912522,0.00046113544,0.000063021624,0.00023494993],"category_scores_gemma":[0.00001186687,0.00034507638,0.000049141712,0.0007651516,0.000027619044,0.0022117267,0.0003261277,0.00023939573,0.00060052454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026516045,0.0001525031,0.0015639263,0.0009370076,0.00017289695,0.00009483776,0.00019241523,0.97313,0.00010103199,0.013394483,0.000046835994,0.010187549],"study_design_scores_gemma":[0.0008108855,0.000011116026,0.02084542,0.0005884513,0.00022991201,0.0000065874665,0.0019257964,0.96498203,0.000056733083,0.00051210774,0.009244367,0.00078660133],"about_ca_topic_score_codex":0.00359673,"about_ca_topic_score_gemma":0.004722435,"teacher_disagreement_score":0.097552314,"about_ca_system_score_codex":0.0002597113,"about_ca_system_score_gemma":0.000010605765,"threshold_uncertainty_score":0.9999001},"labels":[],"label_agreement":null},{"id":"W2125250181","doi":"10.1017/s0269964807000290","title":"DYNAMIC ASSIGNMENT OF DEDICATED AND FLEXIBLE SERVERS IN TANDEM LINES","year":2007,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; McMaster University Medical Centre","funders":"","keywords":"Server; Throughput; Computer science; Flexibility (engineering); Distributed computing; Queueing theory; Computer network; Service (business); Resource allocation; Queue management system; Operating system; Mathematics","score_opus":0.012871604241023304,"score_gpt":0.2349075460527627,"score_spread":0.2220359418117394,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125250181","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9978865,0.000055302342,0.001067341,0.00031165787,0.000021124915,0.00008734019,2.9234258e-7,0.000015444939,0.0005549998],"genre_scores_gemma":[0.99945927,0.000007180673,0.00043508763,0.00007775169,0.0000116851725,0.000004003954,0.0000021959024,9.898426e-7,0.0000018218911],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942476,0.0000042748584,0.0002272007,0.00007016348,0.00016502927,0.00010855153],"domain_scores_gemma":[0.9997252,0.00013358731,0.00006785941,0.0000458455,0.000022711942,0.0000047817225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027308504,0.00005276513,0.00007348307,0.00018222045,0.000054714463,0.000040189956,0.00011401322,0.000018484061,0.0000041847616],"category_scores_gemma":[0.00024574733,0.000036548285,0.000010724385,0.0005984833,0.00011617242,0.00078590104,0.000042438103,0.000056077315,6.6232013e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007641252,0.000027499424,0.038422193,0.00014102929,0.000003946097,2.6561645e-7,0.0005190785,0.902284,0.00012411854,0.05627272,0.00000248249,0.0021950174],"study_design_scores_gemma":[0.00013739459,0.0000074855043,0.06267008,0.000044636785,0.0000040804834,0.0000010189068,0.0005963621,0.91206264,0.000036444115,0.024129773,0.00023855694,0.000071524046],"about_ca_topic_score_codex":0.00005311288,"about_ca_topic_score_gemma":0.000056085122,"teacher_disagreement_score":0.032142945,"about_ca_system_score_codex":0.000019231215,"about_ca_system_score_gemma":0.0000073597894,"threshold_uncertainty_score":0.14903958},"labels":[],"label_agreement":null},{"id":"W2125407417","doi":"","title":"Control of Loss Network Systems: Call Admission and Routing Control","year":2007,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; McGill University","funders":"","keywords":"Hamilton–Jacobi–Bellman equation; Mathematics; Optimal control; Mathematical optimization; Markov process; Piecewise; Routing (electronic design automation); Stochastic control; Bellman equation; Admission control; Scalar (mathematics); Computer science; Computer network; Statistics","score_opus":0.006319042155151192,"score_gpt":0.2149702032510529,"score_spread":0.2086511610959017,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125407417","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12862682,0.0020894108,0.8663809,0.0007385921,0.00016087573,0.0007079685,0.00000989682,0.00047372634,0.00081180746],"genre_scores_gemma":[0.99318683,0.000032531527,0.0030796994,0.0023910487,0.0009685698,0.00006060142,0.000011700045,0.00007153488,0.0001974957],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974111,0.00007036547,0.0008466988,0.00044983657,0.0003682828,0.000853752],"domain_scores_gemma":[0.9978173,0.0004064428,0.0008344965,0.0005706693,0.0002740826,0.00009706011],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0031338814,0.00036616292,0.0006901747,0.00045526816,0.00032925012,0.0001924824,0.00036949976,0.00025055182,0.000023659293],"category_scores_gemma":[0.0006769776,0.00034809601,0.0001776053,0.000771033,0.0001365148,0.00076117757,0.00016418769,0.00033650786,0.000010413102],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014381248,0.00024455422,0.38414687,0.00043510366,0.00037589562,0.00021809316,0.00007565607,0.13636884,0.009264692,0.44776404,0.0011937604,0.018474385],"study_design_scores_gemma":[0.0034759382,0.00007055186,0.028551763,0.0005186967,0.0005880583,0.00006258734,0.00023448806,0.9402559,0.00058551924,0.010526723,0.0141819455,0.00094784587],"about_ca_topic_score_codex":0.005515775,"about_ca_topic_score_gemma":0.0006870066,"teacher_disagreement_score":0.86456,"about_ca_system_score_codex":0.00014921335,"about_ca_system_score_gemma":0.00004149019,"threshold_uncertainty_score":0.9998971},"labels":[],"label_agreement":null},{"id":"W2125742178","doi":"10.5267/j.ijiec.2012.02.004","title":"Planning Annuaulised hours when spike in demand exists","year":2012,"lang":"en","type":"article","venue":"International Journal of Industrial Engineering Computations","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Spike (software development); Computer science; Statistics; Mathematics; Operations management; Economics","score_opus":0.03311799355206232,"score_gpt":0.276242064354215,"score_spread":0.24312407080215268,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125742178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88128304,0.00016719462,0.11323396,0.0008380982,0.0036631846,0.000085754284,0.000003238187,0.000054630687,0.00067091594],"genre_scores_gemma":[0.993064,0.0000013414572,0.0021487316,0.0001546124,0.004587705,0.0000019569331,0.000011045122,0.000017896007,0.000012702102],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989006,0.0000126759405,0.00048333738,0.00007814884,0.00033494705,0.00019028997],"domain_scores_gemma":[0.99908674,0.0001661934,0.0003772385,0.000060530077,0.00028181061,0.000027479637],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060829625,0.000119953795,0.00018764928,0.00091312034,0.000034241904,0.00012724144,0.00031401246,0.000064711734,0.00004840349],"category_scores_gemma":[0.0007266277,0.00012238408,0.00009767698,0.00030528163,0.000015793757,0.0015817521,0.000063775515,0.00032007488,0.000015385285],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053474327,0.000070419395,0.032266192,0.0000038851085,0.000111628084,0.000041570347,0.00022356801,0.95962596,0.00012677429,0.0048579103,0.000510913,0.0021077327],"study_design_scores_gemma":[0.019193161,0.0001170496,0.13456735,0.0042219986,0.0007333781,0.00049667334,0.002456873,0.7051289,0.00075131597,0.029424155,0.10038897,0.0025201694],"about_ca_topic_score_codex":0.000024187832,"about_ca_topic_score_gemma":0.0000016034668,"teacher_disagreement_score":0.25449702,"about_ca_system_score_codex":0.000115178584,"about_ca_system_score_gemma":0.000026020673,"threshold_uncertainty_score":0.49906778},"labels":[],"label_agreement":null},{"id":"W2125894503","doi":"10.1002/asmb.1983","title":"Optimal design of multi‐server Markovian queues with polynomial waiting and service costs","year":2013,"lang":"en","type":"article","venue":"Applied Stochastic Models in Business and Industry","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Singapore Management University","keywords":"Computer science; Mathematical optimization; Queueing theory; Convexity; Staffing; Server; Polynomial; Queue; Service (business); Simple (philosophy); Focus (optics); Mathematics; Computer network","score_opus":0.02359008616030762,"score_gpt":0.21417540242199568,"score_spread":0.19058531626168806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2125894503","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82667255,0.000050472525,0.17200488,0.0003001562,0.000024911467,0.0004502435,0.0000017709226,0.000042150426,0.00045285336],"genre_scores_gemma":[0.9949528,0.0000034078685,0.004240327,0.000479983,0.00014758362,0.00010019623,0.000009565238,0.00004047792,0.000025671203],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987606,0.000012091775,0.0003371083,0.00039983506,0.00017169298,0.0003186891],"domain_scores_gemma":[0.99917555,0.00010156928,0.00025389987,0.0002104553,0.000230283,0.00002821957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00026758423,0.00027456923,0.0003848431,0.00024605155,0.0001285184,0.00013768724,0.00016315882,0.00023046591,0.00005218673],"category_scores_gemma":[0.000039068418,0.00023885365,0.000014423066,0.0006686797,0.00014708415,0.0010478417,0.00020497967,0.00032189774,0.0000045703505],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024347172,0.00007935608,0.00038265108,0.00020000752,0.000041670635,0.0000038620137,0.0001093007,0.9780846,0.0007398283,0.014685006,0.000026005993,0.0054042228],"study_design_scores_gemma":[0.0015639474,0.0000071883296,0.0021061094,0.000253841,0.000084007115,0.0000042786123,0.0009780355,0.9922053,0.000027112364,0.0024032702,0.0000057787943,0.0003610941],"about_ca_topic_score_codex":0.0020742146,"about_ca_topic_score_gemma":0.000093063245,"teacher_disagreement_score":0.16828021,"about_ca_system_score_codex":0.000026804719,"about_ca_system_score_gemma":0.000027234108,"threshold_uncertainty_score":0.97401696},"labels":[],"label_agreement":null},{"id":"W2126882180","doi":"10.1109/90.986568","title":"The impact of point-to-multipoint traffic concentration on multirate networks design","year":2002,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Heuristic; Computer science; Network planning and design; Mathematical optimization; Point (geometry); Basis (linear algebra); Computer network; Mathematics; Artificial intelligence","score_opus":0.03693535878669211,"score_gpt":0.25821409428934855,"score_spread":0.22127873550265645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2126882180","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0611211,0.00015428361,0.9352126,0.0005274944,0.001174451,0.0008586296,0.000002898745,0.00028344992,0.00066505163],"genre_scores_gemma":[0.99749756,0.000104815656,0.0007336923,0.00041291086,0.0009917262,0.000060234663,0.000003774644,0.000059273527,0.0001360213],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981164,0.00010994224,0.0005255215,0.0004083625,0.00028277904,0.0005570463],"domain_scores_gemma":[0.99796635,0.00082517264,0.00035193638,0.00067658734,0.00013980885,0.000040147163],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00070269447,0.0003343825,0.00031998486,0.00020313876,0.00083036395,0.00022462998,0.0004468955,0.00010645212,0.00015551866],"category_scores_gemma":[0.00006693645,0.00025401384,0.0003616931,0.0011566778,0.000093343646,0.00046615032,0.0000074027116,0.00039031278,0.00013566464],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027732633,0.00012872837,0.000023771618,0.0000053658378,0.00012521174,0.000003433972,0.00007833511,0.869657,0.00019311439,0.00009378063,0.00042637583,0.1289876],"study_design_scores_gemma":[0.0005779041,0.0001035398,0.00008522843,0.00015032242,0.00011722952,0.0000015261268,0.00006539129,0.9970054,0.00021698841,0.0005402572,0.00084822933,0.000287975],"about_ca_topic_score_codex":0.000054422024,"about_ca_topic_score_gemma":0.000056141118,"teacher_disagreement_score":0.93637645,"about_ca_system_score_codex":0.00014977773,"about_ca_system_score_gemma":0.000009276204,"threshold_uncertainty_score":0.99999124},"labels":[],"label_agreement":null},{"id":"W2127305225","doi":"10.1287/opre.1080.0568","title":"Cross-Selling in a Call Center with a Heterogeneous Customer Population","year":2009,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":32,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Staffing; Profitability index; Center (category theory); Product (mathematics); Market segmentation; Revenue; Business; Computer science; Revenue management; Population; Marketing; Economics; Finance; Mathematics","score_opus":0.04302358875044654,"score_gpt":0.3655008521459309,"score_spread":0.3224772633954844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127305225","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99161476,0.000021642356,0.0014598097,0.00052148604,0.000018755596,0.0002461682,0.0000011961029,0.000046371086,0.0060697985],"genre_scores_gemma":[0.9974034,0.000004705816,0.00057236076,0.00030175495,0.00020556577,0.000027042224,0.000065856955,0.0000146497005,0.0014047091],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880975,0.00004288484,0.00019892954,0.0002701967,0.0003530339,0.00032520905],"domain_scores_gemma":[0.99938345,0.000027186441,0.000019094008,0.0002453418,0.00031201178,0.000012895593],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007090097,0.000092710085,0.000119252225,0.0006199813,0.00039769342,0.0005551251,0.00016890712,0.000042874726,0.00023548029],"category_scores_gemma":[0.000115774325,0.00007837814,0.000030550214,0.001219207,0.000048989572,0.0010358383,0.000042233773,0.00023628706,0.00034365858],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012760029,0.00021160996,0.049361646,0.00001748158,0.00001343827,0.000049742222,0.00011202835,0.92838687,0.00080424326,0.016439062,0.00005338973,0.004422877],"study_design_scores_gemma":[0.0021675227,0.000083385064,0.07151969,0.0001920154,0.000027496024,0.000017473885,0.00019202565,0.9034452,0.00039156782,0.005403773,0.015856713,0.0007031592],"about_ca_topic_score_codex":0.0009336471,"about_ca_topic_score_gemma":0.0034992034,"teacher_disagreement_score":0.024941707,"about_ca_system_score_codex":0.000082991544,"about_ca_system_score_gemma":0.000014116616,"threshold_uncertainty_score":0.5353084},"labels":[],"label_agreement":null},{"id":"W2127545863","doi":"10.1109/glocom.1992.276554","title":"A novel approach to estimating the cell loss probability of an ATM multiplexer loaded with homogeneous bursty sources","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University; Technical University of Nova Scotia","funders":"","keywords":"Asynchronous Transfer Mode; Markov process; Multiplexer; Queueing theory; Computer science; Markov chain; Asynchronous communication; Algorithm; Superposition principle; Coverage probability; Queue; Mathematical optimization; Multiplexing; Applied mathematics; Mathematics; Computer network; Statistics; Telecommunications; Mathematical analysis","score_opus":0.01816055405725129,"score_gpt":0.21450316054598947,"score_spread":0.1963426064887382,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127545863","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6869134,0.000008975534,0.30189595,0.000052348678,0.000021249081,0.00041465164,0.0000012645954,0.00009225903,0.010599941],"genre_scores_gemma":[0.7954048,4.1495962e-8,0.20387769,0.00030057452,0.000089450674,0.000036348774,0.000005700161,0.00002532994,0.000260068],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99865425,0.000034518253,0.000300086,0.00044183392,0.00026898287,0.00030031393],"domain_scores_gemma":[0.9988163,0.00008773099,0.00025711668,0.00061845186,0.00019830519,0.0000221112],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007817641,0.00022390242,0.00027659044,0.000093228104,0.00025588673,0.00012023128,0.000367028,0.00004525301,0.000058268277],"category_scores_gemma":[0.00027884723,0.00013379389,0.00007989554,0.0007554606,0.0001551474,0.00048252114,0.000098465265,0.000112888825,0.00001864097],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012992072,0.0009069975,0.0046603037,0.0002708367,0.000066434164,0.0000024611659,0.0004927442,0.9668206,0.006021269,0.019530144,0.000015453414,0.00108283],"study_design_scores_gemma":[0.00309016,0.0001323506,0.0020594676,0.00011787153,0.000803655,0.00004022987,0.00555632,0.91661656,0.041999318,0.025012046,0.002843786,0.0017282389],"about_ca_topic_score_codex":0.00035900672,"about_ca_topic_score_gemma":0.00008005451,"teacher_disagreement_score":0.10849143,"about_ca_system_score_codex":0.000022976916,"about_ca_system_score_gemma":0.000016675782,"threshold_uncertainty_score":0.54559565},"labels":[],"label_agreement":null},{"id":"W2127574997","doi":"10.1017/s0269964808000247","title":"WARM-UP PERIODS IN SIMULATION CAN BE DETRIMENTAL","year":2008,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Initialization; Data collection; Computer science; Queue; State (computer science); Discrete event simulation; Event (particle physics); Statistics; Algorithm; Simulation; Mathematics; Physics","score_opus":0.027947397349161837,"score_gpt":0.24195983964483042,"score_spread":0.21401244229566857,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127574997","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9983036,0.000019464693,0.00015172923,0.0005342643,0.00004634135,0.00010590742,7.881647e-7,0.000024138528,0.0008137925],"genre_scores_gemma":[0.999489,0.0000025487623,0.00015635014,0.0002846316,0.000043621025,0.000012012265,0.0000056667336,0.0000014407832,0.0000047353114],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99937433,0.000007265529,0.00019498159,0.00008889453,0.0002077369,0.00012678943],"domain_scores_gemma":[0.99973726,0.00012718425,0.000047656016,0.000060065213,0.000023062777,0.000004780029],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009890738,0.00006644844,0.00006973587,0.00018517535,0.00017807273,0.00006958372,0.00014826717,0.000018080733,0.000012798277],"category_scores_gemma":[0.00033320996,0.00004830653,0.000018056326,0.0006737267,0.00011901571,0.0012930642,0.000041504034,0.00007544898,0.00000299893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000034046896,0.000009982384,0.0071007637,0.00002033774,9.280347e-7,2.3197221e-7,0.0008775637,0.9789496,0.000011385804,0.012698439,0.0000031152265,0.0003242659],"study_design_scores_gemma":[0.000110019006,0.0000043217037,0.01102144,0.000010232306,0.0000017905611,0.0000021291223,0.0003396348,0.98218346,0.000011530533,0.005476314,0.00076425046,0.00007486711],"about_ca_topic_score_codex":0.00013381963,"about_ca_topic_score_gemma":0.000047179354,"teacher_disagreement_score":0.0072221253,"about_ca_system_score_codex":0.000036475434,"about_ca_system_score_gemma":0.000013665219,"threshold_uncertainty_score":0.19698831},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.027639056450986077,"score_gpt":0.3411861512873318,"score_spread":0.31354709483634574,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2127943707","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97037303,0.00013328237,0.01623322,0.0036667406,0.00003879911,0.00035327778,0.000002486467,0.00010418149,0.009095004],"genre_scores_gemma":[0.9915346,0.000018572346,0.0044555836,0.0006495859,0.00015783642,0.000023197768,0.00008699163,0.000022674507,0.003050947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985141,0.00008979602,0.00023726952,0.00036427865,0.00041141803,0.0003831232],"domain_scores_gemma":[0.99891615,0.00013116206,0.00003403327,0.00026624967,0.00062547205,0.000026949012],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012224279,0.000140805,0.00017681411,0.00043965213,0.0011459087,0.0009944375,0.00018236137,0.000080855425,0.00037663733],"category_scores_gemma":[0.0003696244,0.00013771455,0.000043644213,0.0010343113,0.00021741822,0.0015951397,0.000097825665,0.00035694567,0.0017809178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011553588,0.00016987244,0.00026389078,0.00003168209,0.00009474254,0.00002691338,0.0003031484,0.8049535,0.04390096,0.12575881,0.00040964384,0.023971297],"study_design_scores_gemma":[0.00037475632,0.000019700103,0.0007054131,0.000028151064,0.00003298232,0.0000037168472,0.00057785853,0.99497104,0.000121284094,0.0018366748,0.0011386675,0.00018978262],"about_ca_topic_score_codex":0.00016563958,"about_ca_topic_score_gemma":0.00017911984,"teacher_disagreement_score":0.19001752,"about_ca_system_score_codex":0.00013992166,"about_ca_system_score_gemma":0.000060955314,"threshold_uncertainty_score":0.9989963},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.03535919632853935,"score_gpt":0.36859466933104584,"score_spread":0.3332354730025065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128483867","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1764724,0.00004071889,0.8224129,0.00023745703,0.0000071233517,0.0002644485,0.000019673516,0.000017536951,0.0005277506],"genre_scores_gemma":[0.97886705,0.0000015156788,0.020672427,0.00008258178,0.000051069233,0.000029312478,0.00010208806,0.000012295828,0.00018162857],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99848014,0.00035121228,0.00031481625,0.00024432383,0.00036966163,0.00023983313],"domain_scores_gemma":[0.9984944,0.00035859368,0.00006079056,0.00033379075,0.00073834124,0.000014098886],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0032855296,0.00008863497,0.0003077,0.0013452116,0.0002464052,0.000113850874,0.00018796769,0.000043453885,0.00019901898],"category_scores_gemma":[0.00031640113,0.000080126105,0.00008341706,0.0023409813,0.000103870865,0.00048192582,0.000054033822,0.000112457274,0.0000067964847],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010408356,0.00042721437,0.0044623846,0.00004704871,0.0003081423,0.000003540174,0.000028339575,0.9403235,0.020456146,0.03313954,0.000039446353,0.0006606229],"study_design_scores_gemma":[0.0007121481,0.000022827606,0.0018478734,0.000010847626,0.000406809,1.2626555e-7,0.00006452946,0.9944152,0.0015009356,0.00069217477,0.00025059073,0.00007589439],"about_ca_topic_score_codex":0.0013386073,"about_ca_topic_score_gemma":0.0013642154,"teacher_disagreement_score":0.8023947,"about_ca_system_score_codex":0.000023037917,"about_ca_system_score_gemma":0.00003717434,"threshold_uncertainty_score":0.3267448},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04070181517824167,"score_gpt":0.33748427954507054,"score_spread":0.29678246436682887,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2128586119","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.373702,0.0001525714,0.6042124,0.0022213303,0.0001498353,0.0015250888,0.000002481032,0.00024044562,0.017793829],"genre_scores_gemma":[0.9863369,0.000009475296,0.006048905,0.00024682106,0.000119912176,0.00024237556,0.00009454584,0.000036611436,0.0068644667],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998822,0.000061328,0.00016252138,0.0002972484,0.00028779628,0.00036911693],"domain_scores_gemma":[0.99872816,0.000099749595,0.000025946127,0.00033550715,0.00079501857,0.000015596022],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015973944,0.00010723213,0.00011498188,0.00033560293,0.00097148237,0.00048716544,0.00019233242,0.00005230471,0.00023561188],"category_scores_gemma":[0.00035242233,0.000094500734,0.00004339028,0.0013631844,0.000075594304,0.0013712384,0.00004674907,0.00019052706,0.000107372936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000032759963,0.00003702491,0.00047311623,0.000032060674,0.000030420815,0.0000010233647,0.000021945072,0.7668434,0.00023671101,0.23161563,0.00023231679,0.0004436213],"study_design_scores_gemma":[0.00047348722,0.000021257329,0.000216051,0.000042468433,0.000033498618,0.0000010540539,0.00058050535,0.9758278,0.0001641292,0.003881167,0.018568477,0.00019009881],"about_ca_topic_score_codex":0.00024597914,"about_ca_topic_score_gemma":0.002419926,"teacher_disagreement_score":0.6126349,"about_ca_system_score_codex":0.00009810239,"about_ca_system_score_gemma":0.00006230953,"threshold_uncertainty_score":0.74719554},"labels":[],"label_agreement":null},{"id":"W2129174856","doi":"10.1504/ijmor.2009.022874","title":"Transient results for M/M/1/c queues via path counting","year":2009,"lang":"en","type":"article","venue":"International Journal of Mathematics in Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Queue; Transient (computer programming); Path (computing); Mathematics; Physics; Computer science; Combinatorics; Computer network; Operating system","score_opus":0.06898663828890524,"score_gpt":0.3980168945879657,"score_spread":0.32903025629906046,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129174856","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6724064,0.00030193885,0.24432331,0.05099457,0.0014464405,0.0011294135,0.000045473127,0.00005902179,0.02929345],"genre_scores_gemma":[0.9822058,0.00002368219,0.015324432,0.0006223799,0.0015572172,0.00000954908,0.00002395895,0.000014206778,0.0002187453],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714065,0.00003495782,0.00091976405,0.00016253965,0.0015032149,0.00023887616],"domain_scores_gemma":[0.99527645,0.00080825755,0.00036611306,0.00012588846,0.0034056758,0.00001760789],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006265506,0.00011404889,0.00022565576,0.000922314,0.00012948523,0.0003523319,0.00068031566,0.000053875938,0.000057630987],"category_scores_gemma":[0.0040495424,0.00009806685,0.00013195357,0.00036415714,0.00006112415,0.001103168,0.00005209917,0.00033243553,0.000027217984],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010770122,0.0013178706,0.00019646085,0.00009268127,0.00017515227,0.000116778916,0.0009169157,0.049402036,0.00789153,0.9230961,0.0054898425,0.010227578],"study_design_scores_gemma":[0.0024455679,0.00009960026,0.0005443152,0.00048803497,0.000025526788,0.000043629872,0.00089396175,0.22491579,0.000564702,0.7550057,0.014754635,0.00021852425],"about_ca_topic_score_codex":0.00001623382,"about_ca_topic_score_gemma":0.000026936315,"teacher_disagreement_score":0.30979943,"about_ca_system_score_codex":0.00019113653,"about_ca_system_score_gemma":0.00009267865,"threshold_uncertainty_score":0.48479733},"labels":[],"label_agreement":null},{"id":"W2129389632","doi":"10.1109/ccece.1995.526590","title":"Departure process characterization of the leaky bucket with modified geometric mode","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Burstiness; Leaky bucket; Smoothing; Computer science; Token bucket; Process (computing); Queueing theory; Real-time computing; Computer network; Network packet","score_opus":0.013916113069630498,"score_gpt":0.21126310936609932,"score_spread":0.19734699629646882,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129389632","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95758873,0.0000097632865,0.027187034,0.000510753,0.000042166685,0.00017423106,0.0000019978909,0.00009263441,0.014392701],"genre_scores_gemma":[0.99717665,0.000002995417,0.00004585141,0.0006447322,0.00013505116,0.000011449373,0.000013692977,0.000017032857,0.0019525299],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993119,0.0000073480887,0.00015736642,0.00016760564,0.00021760323,0.00013818123],"domain_scores_gemma":[0.9993251,0.000016854963,0.00023955478,0.00025414448,0.00015928414,0.000005090629],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008565384,0.00011161737,0.00014403874,0.00022519812,0.000110793684,0.000051469546,0.00023482599,0.0000381263,0.00028317605],"category_scores_gemma":[0.00007655569,0.00006529798,0.000047245077,0.0020382144,0.000043815533,0.00076946215,0.00004891592,0.00007634683,0.000031060492],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00076235656,0.0019792246,0.1334897,0.002486209,0.0009061516,0.000021079615,0.00090581045,0.43906203,0.05612135,0.3030558,0.0019795448,0.059230756],"study_design_scores_gemma":[0.0016396128,0.00002814057,0.029862544,0.00017627576,0.00064634904,0.0000056751587,0.00031183902,0.9271819,0.0142738065,0.017798262,0.0071050473,0.00097057864],"about_ca_topic_score_codex":0.00002677214,"about_ca_topic_score_gemma":0.000040055595,"teacher_disagreement_score":0.48811984,"about_ca_system_score_codex":0.0000094270035,"about_ca_system_score_gemma":0.000002953928,"threshold_uncertainty_score":0.3100579},"labels":[],"label_agreement":null},{"id":"W2129682828","doi":"10.1017/s0269964813000065","title":"WAITING TIME ANALYSIS OF MULTI-CLASS QUEUES WITH IMPATIENT CUSTOMERS","year":2013,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Poisson distribution; Class (philosophy); Queue; Exponential distribution; Service (business); Preemption; Patience; Queueing system; Server; Distributed computing; Mathematical optimization; Computer network; Mathematics; Operating system; Statistics; Business","score_opus":0.010314589244750845,"score_gpt":0.20445737048094473,"score_spread":0.19414278123619388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129682828","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9985638,0.00001284137,0.000035704372,0.00020626182,0.000009267273,0.00013403801,0.0000011099975,0.000024163637,0.0010127857],"genre_scores_gemma":[0.99970746,9.2662265e-7,0.00015176118,0.00008969447,0.000013917415,0.00002327052,0.0000071459426,0.000001621437,0.000004194238],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992926,0.000008243123,0.00023978043,0.00009422629,0.00023295882,0.00013215472],"domain_scores_gemma":[0.9995487,0.00014414775,0.00012936244,0.000084979176,0.000086516535,0.000006309357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094992423,0.00007758831,0.00013277182,0.00034232863,0.000102082166,0.00011190219,0.00018151391,0.0000152278335,0.000038381862],"category_scores_gemma":[0.00020528267,0.000045992427,0.000036093184,0.0015004607,0.00014999502,0.0014127522,0.00004303647,0.000056313253,0.000010052544],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000018182965,0.000014505768,0.00113172,0.000035557296,0.000028220857,3.001352e-8,0.0003455662,0.9892381,0.000029426628,0.00854458,0.0000025780466,0.0006279324],"study_design_scores_gemma":[0.000060560727,0.0000069445928,0.002204161,0.000015448839,0.0000469706,2.6192924e-7,0.00050561584,0.99631405,0.000007965485,0.0006946626,0.00007364082,0.000069740236],"about_ca_topic_score_codex":0.00022272751,"about_ca_topic_score_gemma":0.00002142107,"teacher_disagreement_score":0.007849918,"about_ca_system_score_codex":0.00001665459,"about_ca_system_score_gemma":0.000008159356,"threshold_uncertainty_score":0.18755166},"labels":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"high"}],"label_agreement":"agree"},{"id":"W2129870634","doi":"10.1111/poms.12009","title":"Design Principles for Flexible Systems","year":2013,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":33,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Division of Civil, Mechanical and Manufacturing Innovation; Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Bottleneck; Flexibility (engineering); Chaining; Computer science; Server; Distributed computing; Computer network; A priori and a posteriori; Tree network; Time complexity; Embedded system; Algorithm","score_opus":0.04185856741795376,"score_gpt":0.24801901427116782,"score_spread":0.20616044685321405,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129870634","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.011477903,0.00023876519,0.96735185,0.005883749,0.00095001695,0.0037375423,7.558478e-7,0.0004842504,0.00987518],"genre_scores_gemma":[0.88827103,0.00009737591,0.04145885,0.0010150626,0.0016142606,0.0030549334,0.00004883328,0.00004521043,0.06439443],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992546,0.00001143489,0.00019924314,0.00029836295,0.000092596354,0.00014378432],"domain_scores_gemma":[0.9995294,0.000011014304,0.000056097284,0.0002169045,0.00017789354,0.000008692226],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040338794,0.00010614178,0.00010247232,0.00021747677,0.00044815426,0.00053671224,0.00008337784,0.00001861309,0.000085186315],"category_scores_gemma":[0.00008527264,0.000094762305,0.00002540474,0.00026204807,0.000029486766,0.001242487,0.00006955237,0.000031487176,0.00019334712],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001266129,0.00006023736,0.0000689706,0.00022705708,0.00007568555,2.450268e-7,0.00003222938,0.46673775,0.00032228266,0.5195036,0.006881369,0.0060779233],"study_design_scores_gemma":[0.00042577492,0.000019066454,0.00044400015,0.000071049835,0.00026592627,0.0000023611692,0.001513883,0.6895143,0.00035937922,0.01467147,0.2922721,0.0004406923],"about_ca_topic_score_codex":0.000054805194,"about_ca_topic_score_gemma":0.00000867033,"teacher_disagreement_score":0.925893,"about_ca_system_score_codex":0.000021570295,"about_ca_system_score_gemma":0.000002843515,"threshold_uncertainty_score":0.51755285},"labels":[],"label_agreement":null},{"id":"W2129871504","doi":"10.1109/infcom.1995.515950","title":"Approximation formulae for blocking probabilities in a large Erlang loss system: a probabilistic approach","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique; McGill University","funders":"","keywords":"Erlang (programming language); Probabilistic logic; Erlang distribution; Blocking (statistics); Approximation theory; Applied mathematics; Computer science; Approximation algorithm; Mathematical optimization; Mathematics; Algorithm; Theoretical computer science; Mathematical analysis; Statistics; Artificial intelligence","score_opus":0.02240988828111987,"score_gpt":0.21831169885219942,"score_spread":0.19590181057107955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2129871504","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.37514365,0.00018602966,0.51656127,0.00047707488,0.00021146229,0.005229395,0.000012632244,0.0013367154,0.10084175],"genre_scores_gemma":[0.99103266,5.421644e-7,0.006933633,0.00015399083,0.00031395548,0.0006584775,0.00004344305,0.000035670317,0.0008276418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99849665,0.000019182487,0.00044236457,0.0004048344,0.00019188528,0.00044505755],"domain_scores_gemma":[0.9992293,0.00010491673,0.00020956072,0.00030253417,0.00014356528,0.000010120113],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00086882117,0.00020876077,0.00032134407,0.00034823854,0.00019127251,0.00018154689,0.00021147727,0.00007571725,0.00007461556],"category_scores_gemma":[0.00040047767,0.00018202445,0.00012320041,0.0006491027,0.000039475257,0.0011452569,0.00009046865,0.000096470954,0.00004898724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004285893,0.00030449292,0.0023315523,0.004106106,0.00003262987,0.0000027890292,0.0003790212,0.012824735,0.000029539464,0.9787851,0.00014180955,0.0010193988],"study_design_scores_gemma":[0.0008247171,0.0000073105184,0.00006101195,0.00011781496,0.00007414083,0.0000030856227,0.0018137222,0.9567477,0.000011055454,0.03865561,0.0014077261,0.0002760957],"about_ca_topic_score_codex":0.00005230316,"about_ca_topic_score_gemma":0.00011273453,"teacher_disagreement_score":0.943923,"about_ca_system_score_codex":0.0001420224,"about_ca_system_score_gemma":0.0000046304212,"threshold_uncertainty_score":0.74227417},"labels":[],"label_agreement":null},{"id":"W2130360396","doi":"10.1007/s10479-013-1370-z","title":"A make-to-stock mountain-type inventory model","year":2013,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Queue; Buffer (optical fiber); Fluid queue; Theory of computation; Markov chain; Computer science; Markov process; Content (measure theory); State (computer science); Mathematical optimization; Applied mathematics; Mathematics; Algorithm; Statistics; Mathematical analysis; Computer network; Telecommunications","score_opus":0.2188306103057322,"score_gpt":0.4250922636527753,"score_spread":0.2062616533470431,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2130360396","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9670963,0.00008531821,0.002998509,0.009584195,0.000042972177,0.00064372766,0.0000029548967,0.000061636834,0.019484388],"genre_scores_gemma":[0.9878729,0.000016604077,0.0010430159,0.0021985823,0.00022766337,0.000117422496,0.000022035758,0.000026071508,0.008475718],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984873,0.000049389062,0.00027961898,0.0002637391,0.0005248678,0.00039510397],"domain_scores_gemma":[0.9967345,0.00004691959,0.000030707823,0.0004773905,0.0026743526,0.00003610004],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012154909,0.000108144406,0.00017008804,0.00083722867,0.00038272748,0.0002872984,0.00043260687,0.000050927225,0.0009205675],"category_scores_gemma":[0.0010170707,0.000101677375,0.00006449616,0.0016195644,0.000114737384,0.0011366302,0.00031951576,0.00021211825,0.0023411873],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000583008,0.00022950569,0.0008706849,0.00008149463,0.00007743791,0.0000029716437,0.00023431743,0.7065296,0.014649513,0.22649069,0.04580051,0.0049749347],"study_design_scores_gemma":[0.0001262944,0.000029995053,0.00031474937,0.00003545804,0.000009724841,2.993478e-7,0.0003289823,0.9512517,0.00092663936,0.034813587,0.011984256,0.00017831348],"about_ca_topic_score_codex":0.0012696699,"about_ca_topic_score_gemma":0.0002584878,"teacher_disagreement_score":0.24472207,"about_ca_system_score_codex":0.000021572443,"about_ca_system_score_gemma":0.00006983155,"threshold_uncertainty_score":0.9999927},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.005396278547896633,"score_gpt":0.19082039171519763,"score_spread":0.185424113167301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131297116","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9627003,0.00008577137,0.02848393,0.000041743682,0.000778755,0.00044260698,0.0000043842324,0.00028856183,0.0071739545],"genre_scores_gemma":[0.99900395,2.35103e-7,0.000119845856,0.000055662727,0.00028861788,0.000037277077,0.000008406717,0.000050778868,0.00043520777],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859184,0.000028015347,0.00043954828,0.00030710752,0.00035079653,0.00028266475],"domain_scores_gemma":[0.9985947,0.00007608509,0.00062839617,0.00050122174,0.00018269909,0.000016907528],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00060323323,0.00021841921,0.00046409713,0.00023759827,0.00012441979,0.00015484214,0.00028570672,0.000085929576,0.000023330662],"category_scores_gemma":[0.00006674533,0.0001736693,0.00009784539,0.00038779905,0.00007750621,0.0006971805,0.000046878256,0.00016511882,0.000093619376],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00088661443,0.00052499457,0.10231395,0.0069930516,0.0014091306,0.00020510297,0.00028700026,0.067923404,0.2738885,0.54394865,0.00015119421,0.001468418],"study_design_scores_gemma":[0.010315022,0.00016513761,0.00565334,0.0044161137,0.0016933692,0.00013471916,0.0037043092,0.9506347,0.001174125,0.0010787979,0.018722676,0.0023076457],"about_ca_topic_score_codex":0.0008034549,"about_ca_topic_score_gemma":0.00026758018,"teacher_disagreement_score":0.88271135,"about_ca_system_score_codex":0.000054444878,"about_ca_system_score_gemma":0.00001178014,"threshold_uncertainty_score":0.7082028},"labels":[],"label_agreement":null},{"id":"W2131900839","doi":"10.1109/icccn.1995.540180","title":"Bandwidth allocation for VBR video traffic in ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Technical University of Nova Scotia","funders":"","keywords":"Variable bitrate; Bandwidth (computing); Computer science; Dynamic bandwidth allocation; Bandwidth allocation; Markov process; Multiplexer; Autocorrelation; Asynchronous Transfer Mode; Gaussian; Burstiness; Gaussian process; Real-time computing; Multiplexing; Computer network; Algorithm; Bit rate; Mathematics; Telecommunications; Network packet; Statistics","score_opus":0.017076657595506018,"score_gpt":0.22020229995587073,"score_spread":0.2031256423603647,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2131900839","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41231006,0.00062076503,0.52844274,0.005836148,0.0006372718,0.0012535637,0.0000010458841,0.00084663753,0.050051786],"genre_scores_gemma":[0.9947182,0.00001317888,0.00079468556,0.001522974,0.0005532006,0.000044240373,0.000019446134,0.000020097452,0.0023139587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999283,0.000006795189,0.0002073441,0.0002179978,0.000065821114,0.00021904947],"domain_scores_gemma":[0.9995951,0.000082871025,0.000089067755,0.0001707086,0.000056033812,0.0000062214917],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029398067,0.00010939588,0.00014531607,0.00016741709,0.000086280066,0.00008454836,0.00013253883,0.000050574796,0.0007021612],"category_scores_gemma":[0.00010850618,0.00010142829,0.000072744035,0.00051678,0.000019682084,0.0007205785,0.00002830738,0.00006281615,0.00013506706],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048943006,0.00013485033,0.001195137,0.000053999334,0.000032009353,0.0000026741216,0.00004225988,0.8201058,0.000042709165,0.079604805,0.009504068,0.08923276],"study_design_scores_gemma":[0.00044362855,0.000003929066,0.00023384347,0.000015694839,0.00003627911,1.9317186e-7,0.00005711557,0.9656409,0.0000065565637,0.005455019,0.027955344,0.0001515185],"about_ca_topic_score_codex":0.00002933701,"about_ca_topic_score_gemma":0.00037147908,"teacher_disagreement_score":0.58240813,"about_ca_system_score_codex":0.00002576377,"about_ca_system_score_gemma":0.0000012780001,"threshold_uncertainty_score":0.7688173},"labels":[],"label_agreement":null},{"id":"W2132453336","doi":"10.1109/glocom.1998.775824","title":"Performance modeling of advance resource reservation service","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Javna Agencija za Raziskovalno Dejavnost RS","keywords":"Reservation; Computer science; Routing (electronic design automation); Computer network; Residual; Resource (disambiguation); Set (abstract data type); Service (business); Distributed computing","score_opus":0.030350525866070233,"score_gpt":0.22005941392272704,"score_spread":0.1897088880566568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2132453336","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.83766025,0.00006678166,0.013687149,0.0011107848,0.000037888425,0.000090105576,3.3678987e-7,0.00016875117,0.14717796],"genre_scores_gemma":[0.99472106,0.000013035174,0.001780425,0.0017929187,0.00020141203,0.0000051100506,0.000007149713,0.000017724866,0.0014611593],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99919015,0.0000064361466,0.00025847522,0.00018693302,0.00019450538,0.00016347608],"domain_scores_gemma":[0.9992653,0.000026388876,0.00016298331,0.0003126539,0.00022710294,0.000005555627],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025678694,0.0001018096,0.00014768621,0.000159998,0.00011273552,0.000028085626,0.00022963916,0.000032841894,0.0005342084],"category_scores_gemma":[0.00009534149,0.00009624624,0.000040979514,0.00089584937,0.000016267973,0.0016265888,0.000101131125,0.000075441014,0.00021883631],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003596919,0.000043716504,0.0025931795,0.00021982727,0.000015725309,6.662984e-7,0.000062180385,0.97347224,0.0006534944,0.017448356,0.00041845193,0.005036173],"study_design_scores_gemma":[0.0001490654,0.0000027306667,0.00006981763,0.000044022585,0.000024278852,2.485314e-7,0.00014079032,0.98585117,0.00010033694,0.0023524626,0.011148213,0.00011686244],"about_ca_topic_score_codex":0.00007565878,"about_ca_topic_score_gemma":0.000038381742,"teacher_disagreement_score":0.15706083,"about_ca_system_score_codex":0.000013760414,"about_ca_system_score_gemma":0.0000013512,"threshold_uncertainty_score":0.5849207},"labels":[],"label_agreement":null},{"id":"W2133434949","doi":"10.1287/ijoc.13.4.345.9731","title":"Phantom Harmonic Gradient Estimators for Nonpreemptive Priority Queueing Systems","year":2001,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"University of Melbourne; National Science Foundation","keywords":"Estimator; Variance reduction; Mathematics; Minimum-variance unbiased estimator; Imaging phantom; Queueing theory; Applied mathematics; Variance (accounting); Upper and lower bounds; Bias of an estimator; Harmonic; Mathematical optimization; Algorithm; Statistics; Mathematical analysis; Physics; Monte Carlo method","score_opus":0.021545803696729978,"score_gpt":0.27105548440786903,"score_spread":0.24950968071113905,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2133434949","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7786696,0.00011519294,0.21651973,0.00026404535,0.0015132331,0.00034507216,0.0000011015401,0.0001972343,0.0023747806],"genre_scores_gemma":[0.9945964,0.000011416565,0.0016501585,0.001003876,0.0025961993,0.0000059143754,0.000006109947,0.000040198014,0.0000896789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99796635,0.000015262132,0.0007524065,0.00025872185,0.00039741315,0.0006098745],"domain_scores_gemma":[0.9980219,0.00026648806,0.0010482015,0.00022176346,0.00039099925,0.00005063256],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016127004,0.0002952328,0.00041509606,0.00053317286,0.0009648527,0.0008824963,0.00041926853,0.00007586915,0.000015680509],"category_scores_gemma":[0.0004446144,0.00024078997,0.00027604177,0.00058878656,0.00004714714,0.0018591608,0.00014196117,0.0004456999,0.00008691556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007672358,0.0002640642,0.027998954,0.00044175316,0.0006292431,0.00030184063,0.00070679147,0.7157664,0.00022826837,0.091152966,0.0015292538,0.16021328],"study_design_scores_gemma":[0.0016275834,0.00008574518,0.0014011741,0.0007997508,0.00016353496,0.00022073074,0.00080321153,0.93101037,0.00006447577,0.009880629,0.05331065,0.0006321594],"about_ca_topic_score_codex":0.00006101308,"about_ca_topic_score_gemma":0.0000070624665,"teacher_disagreement_score":0.21592684,"about_ca_system_score_codex":0.00023028112,"about_ca_system_score_gemma":0.000029338538,"threshold_uncertainty_score":0.98191303},"labels":[],"label_agreement":null},{"id":"W2135990523","doi":"10.1287/opre.1120.1117","title":"Congestion-Based Lead-Time Quotation for Heterogenous Customers with Convex-Concave Delay Costs: Optimality of a Cost-Balancing Policy Based on Convex Hull Functions","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":36,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Computer science; Convex hull; Valuation (finance); Mathematical optimization; Context (archaeology); Regular polygon; Fixed cost; Operations research; Microeconomics; Economics; Mathematics","score_opus":0.04367738569817148,"score_gpt":0.3439887711782291,"score_spread":0.30031138548005765,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2135990523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.714996,0.000084948995,0.2596116,0.0053977324,0.00022554708,0.0051707104,0.00029753224,0.0003130032,0.013902944],"genre_scores_gemma":[0.99469984,0.0000012871989,0.0021936607,0.000784171,0.0003747043,0.0006732582,0.00062336866,0.000050929535,0.0005988001],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99781865,0.0002026126,0.00039252834,0.00036379645,0.00060828845,0.00061411865],"domain_scores_gemma":[0.9965282,0.00089148694,0.0001273333,0.0004872704,0.0019047726,0.000060954524],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023354464,0.00021499436,0.00033133413,0.0010586773,0.0009677975,0.00022242834,0.00022189139,0.000100586374,0.0002491446],"category_scores_gemma":[0.0014079798,0.00019492653,0.00011268672,0.0016030311,0.00035135745,0.00095007336,0.0000397297,0.00028588512,0.00029599993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009455955,0.00062326016,0.00465624,0.00017829434,0.00015100931,0.0000027391463,0.00015146965,0.95792854,0.0089520635,0.02394863,0.0004472338,0.0020149092],"study_design_scores_gemma":[0.0021130415,0.00020040266,0.00067773974,0.00012125836,0.00014945703,0.0000016312457,0.0008875327,0.9891972,0.0027127576,0.000069202506,0.003526107,0.00034367637],"about_ca_topic_score_codex":0.001211513,"about_ca_topic_score_gemma":0.00040098437,"teacher_disagreement_score":0.27970386,"about_ca_system_score_codex":0.0004777696,"about_ca_system_score_gemma":0.00034647284,"threshold_uncertainty_score":0.7948873},"labels":[],"label_agreement":null},{"id":"W2136844606","doi":"10.4236/am.2012.312a298","title":"Server Workload in an M/M/1 Queue with Bulk Arrivals and Special Delays","year":2012,"lang":"en","type":"article","venue":"Applied Mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Joins; Queue; Workload; Computer science; Queueing theory; State (computer science); Computer network; Real-time computing; Algorithm; Operating system","score_opus":0.016184361299853955,"score_gpt":0.22872414400411767,"score_spread":0.2125397827042637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2136844606","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9691082,0.000037863105,0.0051565436,0.000059454836,0.00004860245,0.00023837812,5.1678e-7,0.00008756374,0.025262875],"genre_scores_gemma":[0.9813417,0.000004581908,0.016622074,0.00037266032,0.0015152236,0.000030198564,0.000006172709,0.000041765605,0.00006563235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990675,0.000004653514,0.00024281537,0.00018552113,0.00017775212,0.00032179843],"domain_scores_gemma":[0.99939394,0.0000641082,0.00017864468,0.00030680042,0.00003179813,0.000024734416],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004941057,0.00018680585,0.00027505078,0.0001535969,0.00008467168,0.00010804331,0.000154687,0.00006140095,0.00017329317],"category_scores_gemma":[0.000029273533,0.00015496604,0.000023449866,0.00038192896,0.000061853934,0.00082060427,0.00010500598,0.00012285182,0.00016403686],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007547717,0.0003744737,0.006471834,0.0002999227,0.000048109952,0.000007775738,0.0010978162,0.00096495636,0.00056470017,0.98484087,0.00011057722,0.005143479],"study_design_scores_gemma":[0.002845364,0.000031701617,0.0048980517,0.000465537,0.00069147325,0.000021352713,0.0068413713,0.009795219,0.00084258424,0.96237576,0.009246147,0.0019454121],"about_ca_topic_score_codex":0.00000945579,"about_ca_topic_score_gemma":0.00012480294,"teacher_disagreement_score":0.025197243,"about_ca_system_score_codex":0.000021730832,"about_ca_system_score_gemma":0.0000047594904,"threshold_uncertainty_score":0.63193315},"labels":[],"label_agreement":null},{"id":"W2139443691","doi":"10.1287/mnsc.1110.1399","title":"Modeling Security-Check Queues","year":2011,"lang":"en","type":"article","venue":"Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":49,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Council","keywords":"Stylized fact; Computer science; Queueing theory; Robustness (evolution); Queue; Computer security model; Convexity; Operations research; Computer security; Business; Mathematics; Computer network; Economics; Finance","score_opus":0.02838316223081876,"score_gpt":0.2385538916557642,"score_spread":0.21017072942494544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139443691","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33762023,0.000036490932,0.04288501,0.0001877589,0.00041598952,0.00027015954,3.4749812e-7,0.00050214294,0.61808187],"genre_scores_gemma":[0.9954137,0.0000080888085,0.0026982296,0.0011574037,0.00016289948,0.000018065622,0.0000016315529,0.00001650779,0.00052346865],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826086,0.0000064352716,0.00022953305,0.00054907415,0.0004897248,0.00046439286],"domain_scores_gemma":[0.99923795,0.000006040122,0.00009909662,0.0005285999,0.00010780346,0.000020502173],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012248106,0.00016816311,0.00014284636,0.0006413521,0.0004927139,0.000257823,0.0009903761,0.000021975167,0.00036066017],"category_scores_gemma":[0.000067934714,0.00015859386,0.00006860052,0.0018301618,0.000271873,0.0027941107,0.00074191415,0.0000917989,0.0008000575],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019522435,0.00008321364,0.0012716621,0.00007906073,0.00002449388,0.000028850181,0.00021001899,0.009580826,0.00011171671,0.98464817,0.00015920262,0.0037832754],"study_design_scores_gemma":[0.00020026366,0.000005129442,0.0003461429,0.000041791576,0.00009688592,4.816899e-7,0.0015125187,0.675044,0.00018809419,0.3168885,0.0052946294,0.00038156356],"about_ca_topic_score_codex":0.00021474436,"about_ca_topic_score_gemma":0.000043809407,"teacher_disagreement_score":0.66775966,"about_ca_system_score_codex":0.000046675523,"about_ca_system_score_gemma":0.000006302014,"threshold_uncertainty_score":0.99997795},"labels":[],"label_agreement":null},{"id":"W2139690251","doi":"10.1109/glocom.1991.188514","title":"Burst control in statistical multiplexing: an application to broadband networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Asynchronous Transfer Mode; Bandwidth (computing); Computer science; Multiplexing; Computer network; Broadband; Statistical time division multiplexing; Broadband networks; Asynchronous communication; Blocking (statistics); Bandwidth allocation; Telecommunications","score_opus":0.012930329948018652,"score_gpt":0.24140910174019986,"score_spread":0.2284787717921812,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139690251","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.014764989,0.000016446033,0.97805315,0.00055875856,0.000038715454,0.00027430814,0.0000018132259,0.00013671396,0.006155109],"genre_scores_gemma":[0.9935751,0.000001064866,0.0020541504,0.0036406657,0.00042717232,0.000047298407,0.000028369437,0.00001833997,0.00020783293],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99912226,0.000014901733,0.00021779524,0.00028922412,0.000112766116,0.0002430326],"domain_scores_gemma":[0.9995369,0.00008794507,0.000062572835,0.00023846445,0.000052015686,0.000022143133],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002515799,0.00011618152,0.00016698637,0.00017412516,0.000079252866,0.00010965105,0.00015552048,0.000043910895,0.0006464013],"category_scores_gemma":[0.000119061166,0.00011053255,0.00002453914,0.000470445,0.000027707796,0.00056551496,0.000035985384,0.00009100694,0.00037019284],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012799332,0.00028787937,0.019765504,0.000018352528,0.000024396331,0.000012635211,0.000045789493,0.6296768,0.00039022323,0.2701367,0.0018816541,0.07763206],"study_design_scores_gemma":[0.0005280267,0.00000672107,0.002369509,0.0000063375182,0.000019988318,2.351287e-7,0.000052622738,0.9815632,0.0000023418775,0.0043065706,0.010982624,0.00016178635],"about_ca_topic_score_codex":0.000326061,"about_ca_topic_score_gemma":0.0006572285,"teacher_disagreement_score":0.97881013,"about_ca_system_score_codex":0.000026940894,"about_ca_system_score_gemma":9.508173e-7,"threshold_uncertainty_score":0.7077641},"labels":[],"label_agreement":null},{"id":"W2139697012","doi":"10.1109/icc.1989.49776","title":"Queueing analysis of transport-layer connections in an internet environment","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Computer science; Communication source; Transport layer; Computer network; Host (biology); The Internet; Blocking (statistics); Layer (electronics); Queue; Process (computing); Distributed computing; Operating system","score_opus":0.018671837758155257,"score_gpt":0.23570719234679205,"score_spread":0.2170353545886368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139697012","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9396782,0.000016055768,0.043977853,0.000052394942,0.0000308027,0.00006870101,9.2908505e-7,0.00004266479,0.016132392],"genre_scores_gemma":[0.9984889,0.0000025601753,0.00058761844,0.00024228766,0.000022608721,0.000008334136,0.00002407089,0.00001194857,0.0006116705],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991231,0.000023528415,0.00033111137,0.00024795532,0.00011989828,0.00015441595],"domain_scores_gemma":[0.99954194,0.00003408976,0.00013590409,0.0002539453,0.000024811912,0.000009323142],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0003760893,0.00011349371,0.0002791569,0.00085354794,0.000032728596,0.000020305923,0.00011673867,0.000037979327,0.003949322],"category_scores_gemma":[0.000032755834,0.000108586835,0.00014691321,0.0012454169,0.00003868141,0.000675321,0.00001508391,0.00007103227,0.00003431034],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026847796,0.00029918033,0.3654627,0.000021521986,0.0005498204,0.0000091234815,0.00017957964,0.25382528,0.001644478,0.37724155,0.000012962357,0.0007269719],"study_design_scores_gemma":[0.0025204965,0.00006672742,0.24231653,0.00008874283,0.010896762,0.0000016218835,0.0070415125,0.62126565,0.009326185,0.04774708,0.05672894,0.0019997398],"about_ca_topic_score_codex":0.0007894032,"about_ca_topic_score_gemma":0.003491997,"teacher_disagreement_score":0.3674404,"about_ca_system_score_codex":0.000030491341,"about_ca_system_score_gemma":0.0000033717142,"threshold_uncertainty_score":0.9969612},"labels":[],"label_agreement":null},{"id":"W2139807504","doi":"10.1287/msom.2014.0476","title":"On the Downs–Thomson Paradox in a Self-Financing Two-Tier Queuing System","year":2014,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":53,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University; University of British Columbia","funders":"","keywords":"Toll; Service (business); Queueing theory; Constraint (computer-aided design); Welfare; Microeconomics; Economics; Economies of scale; Computer science; Finance; Business; Operations research; Computer network; Economy; Engineering","score_opus":0.007379460404043471,"score_gpt":0.20434343293132726,"score_spread":0.1969639725272838,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2139807504","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92597055,0.000022519529,0.015009082,0.0051112114,0.00043306235,0.0011313156,0.0000012693275,0.0006667937,0.051654167],"genre_scores_gemma":[0.99109,0.0000037791076,0.0014031654,0.0062465523,0.0004074762,0.00027579683,0.000022099995,0.000059229937,0.00049190153],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977765,0.00011025922,0.0005354573,0.0006407965,0.00041170843,0.0005252978],"domain_scores_gemma":[0.99861103,0.00014846137,0.00018068196,0.00096205866,0.000077479875,0.00002027746],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0014825326,0.00038841576,0.0003323265,0.0005619424,0.0008381555,0.00074515847,0.00068849727,0.000055804867,0.00011332318],"category_scores_gemma":[0.000043375498,0.00030606895,0.00010659686,0.0007863663,0.000020703397,0.00092301663,0.00041844422,0.00029972492,0.0009803575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022375138,0.00008628383,0.00009242494,0.00039060414,0.00007189857,0.00002198217,0.00023775526,0.5688039,0.000032714135,0.42727655,0.00011132744,0.0028521772],"study_design_scores_gemma":[0.001870131,0.000023298959,0.0046301717,0.0011341232,0.000449685,0.000005490729,0.0040343357,0.93105924,0.0007952545,0.012995052,0.041795556,0.001207676],"about_ca_topic_score_codex":0.0009773279,"about_ca_topic_score_gemma":0.00172511,"teacher_disagreement_score":0.4142815,"about_ca_system_score_codex":0.0002827372,"about_ca_system_score_gemma":0.0000068808226,"threshold_uncertainty_score":0.99993914},"labels":[],"label_agreement":null},{"id":"W2140122547","doi":"10.1287/opre.1070.0442","title":"Regulated Random Walks and the LCFS Backlog Probability: Analysis and Application","year":2008,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Random walk; Probability distribution; Queue; Constraint (computer-aided design); Upper and lower bounds; Mathematics; Computer science; Queueing theory; Mathematical optimization; Statistics","score_opus":0.0334362468084673,"score_gpt":0.3083572831801008,"score_spread":0.2749210363716335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140122547","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96515346,0.00020289655,0.024621725,0.0051667537,0.000011054047,0.0008936026,0.0000018156627,0.00006145584,0.0038872657],"genre_scores_gemma":[0.997477,0.000097684264,0.000594234,0.00014992121,0.00012280035,0.00020166431,0.000044498534,0.000009843099,0.0013023481],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99877965,0.00017217472,0.00021408302,0.00033076436,0.00030555422,0.00019779004],"domain_scores_gemma":[0.9987478,0.00029473292,0.000029580928,0.00043537456,0.00047739004,0.000015075092],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0025911608,0.000090685826,0.00021241787,0.00045328555,0.0015468755,0.000285093,0.00016292749,0.000046822955,0.00010928874],"category_scores_gemma":[0.0005433545,0.000060946197,0.00005777985,0.0025385756,0.0008190963,0.00056449405,0.00018826962,0.00020060052,0.000050449267],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014318052,0.00028727693,0.024139276,0.00013945415,0.0014924891,0.00001007241,0.0015358472,0.10951836,0.005295843,0.83397955,0.00087119604,0.021298816],"study_design_scores_gemma":[0.002443762,0.000006987303,0.009183318,0.000007671569,0.00039710582,0.000004823477,0.0003934094,0.94757104,0.000109377856,0.03492187,0.0047768103,0.00018385162],"about_ca_topic_score_codex":0.0012573894,"about_ca_topic_score_gemma":0.0013729184,"teacher_disagreement_score":0.83805263,"about_ca_system_score_codex":0.000023236285,"about_ca_system_score_gemma":0.000018980578,"threshold_uncertainty_score":0.999753},"labels":[],"label_agreement":null},{"id":"W2140340598","doi":"10.1109/qest.2006.34","title":"Modeling and Optimization Problems in Contact Centers","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Staffing; Computer science; Scheduling (production processes); Key (lock); Center (category theory); Context (archaeology); Software; Operations research; Industrial engineering; Mathematical optimization; Engineering; Computer security; Programming language; Mathematics","score_opus":0.00941203962128346,"score_gpt":0.20177362839414026,"score_spread":0.1923615887728568,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140340598","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28542897,0.00004231647,0.6975762,0.00025436206,0.000032513908,0.0001234808,1.6378002e-7,0.0001054855,0.016436495],"genre_scores_gemma":[0.9973751,0.0000037848265,0.002095344,0.0002722715,0.00008395632,0.000004244281,0.000014993097,0.000009178181,0.00014115695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995692,0.0000035789476,0.00013616889,0.00013125181,0.000053414715,0.000106411346],"domain_scores_gemma":[0.999864,0.0000075850317,0.00003689184,0.00006152967,0.000027655838,0.0000023385219],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013191145,0.00006457883,0.000081691185,0.00015641196,0.000041202773,0.00008127064,0.00004047353,0.000019269559,0.000058705944],"category_scores_gemma":[0.000015195767,0.000059395825,0.00001628176,0.00020517253,0.000007370015,0.0007533635,0.00003296594,0.000034270663,0.000007851001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004564035,0.000013916884,0.0061337487,0.000015524472,0.0000023235007,7.4043464e-7,0.0000035681217,0.9705828,0.00008686745,0.022998698,0.000012372948,0.00014488392],"study_design_scores_gemma":[0.0002385033,8.812005e-7,0.0001335725,0.000018868715,0.000010278119,1.6693767e-7,0.00004840817,0.98940545,0.0000037806576,0.009946292,0.0001166981,0.000077093224],"about_ca_topic_score_codex":0.001466789,"about_ca_topic_score_gemma":0.0005219736,"teacher_disagreement_score":0.7119461,"about_ca_system_score_codex":0.0000138580735,"about_ca_system_score_gemma":0.000001313971,"threshold_uncertainty_score":0.24220915},"labels":[],"label_agreement":null},{"id":"W2140727000","doi":"10.1007/s11518-010-5139-5","title":"Construction of continuous time Markovian arrival processes","year":2010,"lang":"en","type":"article","venue":"Journal of Systems Science and Systems Engineering","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Markov process; Markovian arrival process; Queueing theory; Constructive; Computer science; Poisson distribution; Markov chain; Stochastic process; Applied mathematics; Mathematical optimization; Statistical physics; Mathematics; Process (computing); Physics; Statistics","score_opus":0.0046267654881791825,"score_gpt":0.18730688636900103,"score_spread":0.18268012088082186,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2140727000","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9930987,0.00030991805,0.0035777707,0.000032326734,0.0019977512,0.00012772527,0.0000010273901,0.000030967436,0.00082385505],"genre_scores_gemma":[0.99861497,0.0000052242344,0.0003565505,0.0000055752844,0.0009503836,0.00000212438,2.0675097e-7,0.000011263745,0.000053699496],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851006,0.0000069799466,0.00060580677,0.00013945984,0.0005408275,0.00019688006],"domain_scores_gemma":[0.9976549,0.000070352165,0.0008392156,0.00014202713,0.001259903,0.000033601555],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002493317,0.00012284095,0.00039994836,0.00064585026,0.00011273157,0.0003074786,0.00028592936,0.00004862857,0.000004659151],"category_scores_gemma":[0.0010427138,0.000098291595,0.00004397863,0.00084412686,0.0001816342,0.0018319645,0.000045457116,0.00017377,0.0000047190274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000041389314,0.000044564138,0.013202161,0.0036723488,0.00012193915,0.000042953423,0.00021714054,0.04990909,0.8890287,0.042245347,0.00013070006,0.0013436377],"study_design_scores_gemma":[0.0024076987,0.00020694925,0.0045336513,0.0059967465,0.00063684664,0.0047217514,0.008464455,0.91760373,0.007342375,0.00074874493,0.045646414,0.0016906441],"about_ca_topic_score_codex":0.000046660527,"about_ca_topic_score_gemma":0.0000013651718,"teacher_disagreement_score":0.88168633,"about_ca_system_score_codex":0.000025724565,"about_ca_system_score_gemma":0.00008032116,"threshold_uncertainty_score":0.40082148},"labels":[],"label_agreement":null},{"id":"W2141389202","doi":"10.1109/ccece.1998.685603","title":"Effect of mobility on QoS in wireless communication networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Quality of service; Computer science; Computer network; Queueing theory; Wireless; Homogeneous; Mobility model; Stochastic geometry models of wireless networks; Wireless network; Mobile QoS; Distributed computing; Radio resource management; Telecommunications; Service (business); Mathematics","score_opus":0.009862738436112914,"score_gpt":0.2334160545068766,"score_spread":0.2235533160707637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2141389202","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9630455,0.000042816977,0.0013395766,0.00013254941,0.000052761803,0.00017057496,1.14564536e-7,0.00006283658,0.035153292],"genre_scores_gemma":[0.99944574,0.000012001326,0.000028359425,0.00022003983,0.000099796176,0.000013757103,0.0000053888525,0.000008243573,0.00016668641],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994312,0.00006250001,0.00018784759,0.00012736498,0.00008372974,0.000107375046],"domain_scores_gemma":[0.9991289,0.00029266227,0.00011756974,0.00042716422,0.000030531788,0.000003218816],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00075465546,0.000084367435,0.00017839744,0.00011891331,0.000043778116,0.000019382698,0.00019499336,0.000039036706,0.00042273884],"category_scores_gemma":[0.00010797843,0.00006947808,0.00005353278,0.0004488965,0.000045527253,0.0003120716,0.00007616561,0.000107929984,0.00006712726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006961979,0.0011968218,0.14009336,0.0006283457,0.00010555571,0.000006973301,0.00010061581,0.37498555,0.0005914509,0.2580048,0.0031061275,0.2204842],"study_design_scores_gemma":[0.00073420734,0.00003706612,0.0031256739,0.00010564286,0.000050152317,1.1269871e-7,0.000033909528,0.992084,0.0006403047,0.0021635047,0.00084333995,0.00018204024],"about_ca_topic_score_codex":0.00016295024,"about_ca_topic_score_gemma":0.00011088017,"teacher_disagreement_score":0.6170985,"about_ca_system_score_codex":0.00002031277,"about_ca_system_score_gemma":3.92943e-7,"threshold_uncertainty_score":0.4628694},"labels":[],"label_agreement":null},{"id":"W2142059412","doi":"10.1109/glocom.2006.249","title":"NGL02-1: Multi-Stage Investment Decision under Contingent Demand for Networking Planning","year":2006,"lang":"en","type":"article","venue":"Globecom","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada); University of Waterloo","funders":"","keywords":"Stochastic programming; Investment (military); Computer science; Operations research; The Internet; Service (business); Investment decisions; Process (computing); Plan (archaeology); Installation; Business; Mathematical optimization; Production (economics); Economics; Engineering; Microeconomics; Marketing","score_opus":0.044006623806988505,"score_gpt":0.2933518968994105,"score_spread":0.249345273092422,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142059412","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.31089267,0.0007602518,0.67982715,0.00022249292,0.00070216507,0.0004905205,0.0000049123973,0.00028106288,0.0068187877],"genre_scores_gemma":[0.9809125,0.0000027350454,0.012799159,0.0031455404,0.0018822748,0.00004627377,0.00007651339,0.000049195954,0.0010857912],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99858093,0.000014224472,0.0003933199,0.0003893029,0.00018890388,0.0004333391],"domain_scores_gemma":[0.99911827,0.00017747871,0.0003201763,0.00027164706,0.000096015545,0.000016415363],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005940526,0.00023067462,0.0002764785,0.00017306303,0.0003931143,0.00025549144,0.00022411034,0.00007412428,0.00005405871],"category_scores_gemma":[0.00007716262,0.00022003594,0.00015669448,0.00031013723,0.00004055613,0.00050172635,0.0001642089,0.000092923096,0.000065437845],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027089135,0.0003135513,0.052536964,0.00015619386,0.0001731548,0.000035355508,0.000059430997,0.7324971,0.00053888984,0.1877916,0.01479416,0.010832697],"study_design_scores_gemma":[0.0033949804,0.000017178549,0.0142171895,0.00029170612,0.0003063997,0.000001751557,0.00045539896,0.35784587,0.00014371934,0.17352962,0.44896647,0.00082967605],"about_ca_topic_score_codex":0.00025133474,"about_ca_topic_score_gemma":0.00032846848,"teacher_disagreement_score":0.67001987,"about_ca_system_score_codex":0.00008081469,"about_ca_system_score_gemma":0.000008676055,"threshold_uncertainty_score":0.8972806},"labels":[],"label_agreement":null},{"id":"W2142721553","doi":"10.1287/opre.2013.1236","title":"Using Strategic Idleness to Improve Customer Service Experience in Service Networks","year":2014,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Queue; Service (business); Queueing theory; Operations research; Computer network; Quality of service; Service quality; Mathematical optimization; Business; Mathematics; Marketing","score_opus":0.13658974880440025,"score_gpt":0.3996399555342409,"score_spread":0.2630502067298407,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142721553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97255653,0.000015002585,0.016117763,0.0014295026,0.00012643174,0.00040073597,9.856607e-7,0.000055125158,0.009297925],"genre_scores_gemma":[0.9953852,0.000002039936,0.0011708302,0.0023130449,0.0006186882,0.00013514646,0.000016158316,0.000030920302,0.00032793076],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981969,0.00012349267,0.0002773734,0.00045219366,0.0004096685,0.00054037746],"domain_scores_gemma":[0.9983222,0.000097962,0.000026931795,0.00051735976,0.001000738,0.000034810728],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016288842,0.00014732312,0.00018208455,0.00063371425,0.00060319353,0.00067209883,0.0005337526,0.00007611609,0.00031892073],"category_scores_gemma":[0.00021153994,0.00014453765,0.000027163122,0.0048673586,0.000042184525,0.0013941001,0.00038980268,0.00034125103,0.0008264642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002617211,0.00004938552,0.0003851848,0.000041013875,0.0000059197214,0.0000030227209,0.00025177916,0.94720036,0.010843152,0.04038464,0.000016559663,0.0007927968],"study_design_scores_gemma":[0.00019899783,0.0000045797246,0.0001528293,0.000049270777,0.000007346986,5.5493734e-7,0.0019496154,0.99363774,0.00016550123,0.0012012075,0.0024391995,0.00019317605],"about_ca_topic_score_codex":0.006845676,"about_ca_topic_score_gemma":0.014229038,"teacher_disagreement_score":0.046437345,"about_ca_system_score_codex":0.000101729056,"about_ca_system_score_gemma":0.00004968254,"threshold_uncertainty_score":0.9999515},"labels":[],"label_agreement":null},{"id":"W2142962949","doi":"10.5555/1516744.1517034","title":"Speeding up call center simulation and optimization by Markov chain uniformization","year":2008,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Markov chain; Uniformization (probability theory); Mathematical optimization; Discrete event simulation; Scheduling (production processes); Markov process; Limit (mathematics); Variable-order Markov model; Algorithm; Markov model; Simulation; Mathematics; Machine learning","score_opus":0.028009563260084264,"score_gpt":0.25824965839567426,"score_spread":0.23024009513559,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2142962949","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07712942,0.000014461272,0.9195917,0.0002579777,0.00019526528,0.00020686108,0.0000047862927,0.00016385333,0.0024356707],"genre_scores_gemma":[0.9965669,0.000009646657,0.0011754477,0.00057515246,0.00026578113,0.0000046895343,0.00026921806,0.000026749569,0.0011064108],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988978,0.0000238078,0.0003353608,0.00033536812,0.00021362749,0.00019402374],"domain_scores_gemma":[0.9990643,0.00010580835,0.00027216648,0.00017193044,0.00036604208,0.000019719042],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001893674,0.0001917787,0.00018095245,0.00024113929,0.00026624385,0.0001684581,0.00011619717,0.00008174208,0.00038838267],"category_scores_gemma":[0.00022703173,0.00019835428,0.000044937526,0.00033294622,0.00006901541,0.0020867225,0.00008942646,0.000097075885,0.0000387883],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000059803926,0.000021970254,0.006147538,0.000021787213,0.000014820132,0.0000012444655,0.00014690628,0.98993313,0.0000778362,0.0012231948,0.00016390442,0.002187857],"study_design_scores_gemma":[0.0005880335,0.0000063556167,0.00054199836,0.00004186704,0.000028162436,0.0000010623515,0.000048775517,0.99383765,0.000023089313,0.000605346,0.004058343,0.00021932586],"about_ca_topic_score_codex":0.000023081848,"about_ca_topic_score_gemma":0.000008662734,"teacher_disagreement_score":0.91943747,"about_ca_system_score_codex":0.000043504308,"about_ca_system_score_gemma":0.000008791069,"threshold_uncertainty_score":0.80886525},"labels":[],"label_agreement":null},{"id":"W2143019208","doi":"10.1109/glocom.1990.116786","title":"Performance and reliability of DQDB metropolitan networks under faults","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University; EnGlobe (Canada)","funders":"","keywords":"Redundancy (engineering); Computer science; Computer network; Node (physics); Fault tolerance; Integrated Services Digital Network; Distributed-queue dual-bus; Modular design; Asynchronous communication; Metropolitan area network; Distributed computing; Local area network; Engineering","score_opus":0.012188568491648677,"score_gpt":0.2167753376721709,"score_spread":0.2045867691805222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143019208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90387094,0.0000685755,0.0069252574,0.0003135692,0.000058343234,0.000071676215,2.7228168e-7,0.000084918654,0.088606425],"genre_scores_gemma":[0.9973681,0.000035867655,0.000532934,0.00048690624,0.00015825556,0.0000023871467,0.0000020304133,0.000011070472,0.0014024269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992937,0.000009011979,0.00021033933,0.0001983783,0.000112919806,0.0001756826],"domain_scores_gemma":[0.99946046,0.000058410977,0.000120082135,0.00026035903,0.00009154546,0.000009143473],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00027225006,0.00010583254,0.0001777572,0.00010623313,0.00009538392,0.000022628305,0.00011064106,0.000041463863,0.0007438591],"category_scores_gemma":[0.00008435759,0.00008653835,0.000048634734,0.00040657385,0.00011943426,0.00073738035,0.000099190635,0.00007792581,0.000038958515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001426108,0.0004085776,0.371047,0.00060181733,0.00015359609,0.0000039456872,0.00007733989,0.20601475,0.00018526675,0.39684957,0.0047983876,0.019717123],"study_design_scores_gemma":[0.0003241616,0.000012752921,0.018373277,0.00002354876,0.00010212324,7.209506e-7,0.0003778157,0.9643232,0.00005182923,0.012573637,0.003606737,0.00023017007],"about_ca_topic_score_codex":0.00012381143,"about_ca_topic_score_gemma":0.000019196203,"teacher_disagreement_score":0.7583085,"about_ca_system_score_codex":0.000029454106,"about_ca_system_score_gemma":8.8152575e-7,"threshold_uncertainty_score":0.81447357},"labels":[],"label_agreement":null},{"id":"W2143324015","doi":"10.1080/0740817x.2014.905735","title":"Maximizing throughput in zero-buffer tandem lines with dedicated and flexible servers","year":2014,"lang":"en","type":"article","venue":"IIE Transactions","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Server; Heuristics; Throughput; Computer science; Queue; Distributed computing; Tandem; Buffer (optical fiber); Zero (linguistics); Queueing theory; Computer network; Mathematical optimization; Operating system; Mathematics; Engineering; Wireless","score_opus":0.013927282822819461,"score_gpt":0.2212751497083812,"score_spread":0.20734786688556173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143324015","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3532787,0.00004707737,0.64077634,0.0016427743,0.000093146344,0.000142449,0.0000011824478,0.00029863176,0.003719739],"genre_scores_gemma":[0.9974161,0.000017106295,0.0014448641,0.0005934162,0.000115916366,0.000017725075,0.0000074571044,0.000026170272,0.0003612626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992292,0.000015484704,0.00017394141,0.0002526408,0.000115406845,0.00021335381],"domain_scores_gemma":[0.99961936,0.00006192527,0.00007512281,0.00017259015,0.000056233344,0.000014744693],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022371433,0.00014571285,0.00019140531,0.00024399642,0.00021957721,0.00008952083,0.00009824904,0.0000557164,0.00014130831],"category_scores_gemma":[0.000022520646,0.00012638731,0.00004247361,0.00070581853,0.00008462872,0.00094342773,0.000008502599,0.00016013638,0.000033596178],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013353487,0.0011325949,0.11042487,0.0010781417,0.0010483182,0.00008500467,0.0015590234,0.6773558,0.0074014305,0.0761708,0.000714821,0.1216938],"study_design_scores_gemma":[0.013565113,0.0001782201,0.059976585,0.001225938,0.0026869113,0.000054222433,0.0031002862,0.57360566,0.0039216913,0.187096,0.15096024,0.0036291513],"about_ca_topic_score_codex":0.00035204427,"about_ca_topic_score_gemma":0.0010193055,"teacher_disagreement_score":0.6441374,"about_ca_system_score_codex":0.000023345214,"about_ca_system_score_gemma":0.000007903016,"threshold_uncertainty_score":0.5153925},"labels":[],"label_agreement":null},{"id":"W2143395415","doi":"10.1109/icc.2000.853712","title":"Efficient estimation of the cell loss probability in a two-buffer PGPS scheduler","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Generalized processor sharing; Computer science; Quality of service; Scheduling (production processes); Processor sharing; Queue; Network packet; Markov process; Real-time computing; Global Positioning System; Queueing theory; Packet loss; Markov chain; Computer network; Distributed computing; Dynamic priority scheduling; Mathematical optimization; Round-robin scheduling; Mathematics; Statistics","score_opus":0.014045209170523463,"score_gpt":0.22795722404885474,"score_spread":0.21391201487833128,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143395415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9734122,0.000015744985,0.005215013,0.00048044272,0.000055645596,0.00022254566,2.832806e-7,0.000041007625,0.020557076],"genre_scores_gemma":[0.9980046,2.3704668e-7,0.0012098856,0.00025748904,0.000043619817,0.000010385248,9.551362e-7,0.000008319547,0.00046447208],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922526,0.000022979466,0.00024633153,0.00018506695,0.00017443362,0.00014594893],"domain_scores_gemma":[0.9993966,0.00004591737,0.00014932228,0.00033554467,0.00006849891,0.0000041205476],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040794283,0.00009581122,0.00013350576,0.00010446322,0.000060825736,0.000030138423,0.00018891405,0.000022683747,0.0008052755],"category_scores_gemma":[0.00018917701,0.000063861786,0.00007690977,0.00071904116,0.00007793762,0.00018263326,0.00012342595,0.00008910853,0.00015000335],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009985936,0.0002588703,0.010187606,0.0000933003,0.000005164455,6.3874165e-7,0.00005173827,0.95139366,0.00021841351,0.036553796,0.000049059825,0.0011777875],"study_design_scores_gemma":[0.0003430043,0.00000142643,0.0033267157,0.000025227657,0.000028819766,1.6446882e-7,0.0000404506,0.973132,0.0007665954,0.022102935,0.00013651352,0.00009612579],"about_ca_topic_score_codex":0.00011633508,"about_ca_topic_score_gemma":0.00007067113,"teacher_disagreement_score":0.024592394,"about_ca_system_score_codex":0.000033381417,"about_ca_system_score_gemma":0.0000029814805,"threshold_uncertainty_score":0.88172024},"labels":[],"label_agreement":null},{"id":"W2143793200","doi":"10.1287/opre.1060.0308","title":"Dynamic Control of a Multiclass Queue with Thin Arrival Streams","year":2006,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Computer science; Queue; Mathematical optimization; Queueing theory; Context (archaeology); Operations research; Scheduling (production processes); Holding cost; Revenue management; Real-time computing; Admission control; Revenue; Control (management); Computer network; Mathematics; Economics; Finance","score_opus":0.016247495163008052,"score_gpt":0.3067362332167247,"score_spread":0.29048873805371667,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143793200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9452855,0.000051269544,0.0414953,0.001350351,0.00002651289,0.0004460646,0.000011588948,0.000067437526,0.01126595],"genre_scores_gemma":[0.9957128,0.0000016643322,0.0016266404,0.00005296588,0.0001325193,0.000052854408,0.00004526265,0.000020380267,0.0023549136],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987744,0.00006515313,0.00021616418,0.00022603288,0.00044675329,0.00027149727],"domain_scores_gemma":[0.9988228,0.00012209296,0.000036582038,0.0003275316,0.00068132085,0.0000096543],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008271466,0.00009757526,0.00016375263,0.00038484842,0.00036733082,0.00020451158,0.00023305467,0.000039123228,0.00023311765],"category_scores_gemma":[0.00022811227,0.0000766134,0.00004301786,0.00092249946,0.00020979658,0.00068340875,0.00006345006,0.00020647983,0.00013874081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014709246,0.0002698942,0.0028425076,0.000051339277,0.00006608475,0.00001624935,0.000044759912,0.7686521,0.020477368,0.2056967,0.00019660787,0.001539337],"study_design_scores_gemma":[0.0008430655,0.000022022949,0.0008875469,0.000033907538,0.000034452147,9.725292e-7,0.00038539732,0.99249804,0.00048267367,0.0033143796,0.0013748547,0.00012268648],"about_ca_topic_score_codex":0.0035973187,"about_ca_topic_score_gemma":0.0069749155,"teacher_disagreement_score":0.22384597,"about_ca_system_score_codex":0.00005218109,"about_ca_system_score_gemma":0.000049372975,"threshold_uncertainty_score":0.54380935},"labels":[],"label_agreement":null},{"id":"W2143988898","doi":"10.1145/511442.511445","title":"Estimation of blocking probabilities in cellular networks with dynamic channel assignment","year":2002,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Computer Simulation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Blocking (statistics); Computer science; Estimator; Channel (broadcasting); Importance sampling; Mathematical optimization; Call blocking; Algorithm; Mathematics; Statistics; Monte Carlo method; Telecommunications","score_opus":0.018287219481313913,"score_gpt":0.21423291536648023,"score_spread":0.1959456958851663,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2143988898","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2647268,0.0000261503,0.7349901,0.000060854247,0.000034574077,0.000104038074,2.3827117e-7,0.000042894262,0.00001435989],"genre_scores_gemma":[0.9930681,0.000005902113,0.0067894123,0.00005586671,0.00004080513,0.000010602528,0.000006412215,0.0000132878085,0.0000096327985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932396,0.000014639364,0.00022313566,0.0002030744,0.00012143502,0.00011374956],"domain_scores_gemma":[0.99959487,0.00007199879,0.000090492955,0.00018850718,0.00004790176,0.0000062212007],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013972358,0.000113778005,0.00014047459,0.00024009241,0.00011542672,0.000048342205,0.00007125355,0.000042743413,0.000009364464],"category_scores_gemma":[0.000005235532,0.000107171305,0.000032171793,0.00024082602,0.000020532694,0.0004511751,0.0000065553754,0.00009846463,0.0000014403173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002656252,0.00006515672,0.00002165871,0.00003680793,0.000014576638,5.04034e-7,0.00012951336,0.9537821,0.0000036271274,0.0001434823,8.6721386e-8,0.04577597],"study_design_scores_gemma":[0.00033173565,0.000023323462,0.000015390127,0.00012486317,0.000045515226,2.689154e-7,0.000047414233,0.9916089,0.0000071601194,0.007679944,0.0000013921078,0.00011408544],"about_ca_topic_score_codex":0.000031946864,"about_ca_topic_score_gemma":0.000019103038,"teacher_disagreement_score":0.7283413,"about_ca_system_score_codex":0.000029118353,"about_ca_system_score_gemma":0.0000015798121,"threshold_uncertainty_score":0.4370319},"labels":[],"label_agreement":null},{"id":"W2144092592","doi":"10.1109/soli.2008.4686449","title":"Staffing a call center with interactive voice response units and impatient calls","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"Division of Mathematical Sciences; National Natural Science Foundation of China","keywords":"Computer science; Abandonment (legal); Call management; Queue; Call control; Staffing; Telephone call; Queueing theory; Service (business); Computer network; Telephone line; Line (geometry); Center (category theory); Operations research; Telecommunications; Real-time computing; Telephone network; Business; Engineering; Mathematics","score_opus":0.01457431206259807,"score_gpt":0.22304563910914207,"score_spread":0.208471327046544,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144092592","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99238205,0.000011025422,0.0028010365,0.0003901435,0.00003543682,0.00012437999,0.0000020119403,0.00010636931,0.0041475655],"genre_scores_gemma":[0.99659705,0.0000035482835,0.00041174213,0.001398464,0.00008631753,0.000007741029,0.000009053054,0.000022059488,0.0014640453],"study_design_codex":"observational","study_design_gemma":"not_applicable","domain_scores_codex":[0.99918664,0.000033702952,0.00015865684,0.00025426975,0.00015185986,0.00021487297],"domain_scores_gemma":[0.99925697,0.00017369725,0.00013257602,0.00017911253,0.00024010865,0.000017535156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020997974,0.00015575708,0.00016583128,0.0002170136,0.00019988132,0.00006924953,0.00009857045,0.000027047805,0.00008921989],"category_scores_gemma":[0.00025338438,0.000115957446,0.000024529205,0.0004968066,0.00008343476,0.0010729546,0.00014552117,0.000118392665,0.00007531693],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.13414729,0.004894611,0.61685,0.0010648762,0.004059025,0.0054399683,0.033449236,0.044154383,0.019903725,0.057121646,0.038179956,0.040735256],"study_design_scores_gemma":[0.024977153,0.0013279387,0.266387,0.0018581807,0.0015134175,0.00066251936,0.023474557,0.17555732,0.005009648,0.00813165,0.4835962,0.007504429],"about_ca_topic_score_codex":0.0002816697,"about_ca_topic_score_gemma":0.0002473645,"teacher_disagreement_score":0.44541624,"about_ca_system_score_codex":0.000040646595,"about_ca_system_score_gemma":0.000016579968,"threshold_uncertainty_score":0.47286075},"labels":[],"label_agreement":null},{"id":"W2144654200","doi":"10.1109/infcom.1995.515939","title":"Queueing analysis of ATM tandem queues with correlated arrivals","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Queueing theory; Node (physics); Queue; Computer science; Layered queueing network; Tandem; Joint (building); Function (biology); Moment (physics); Mean value analysis; Computer network; Applied mathematics; Mathematical optimization; Mathematics; Engineering","score_opus":0.015038696828883105,"score_gpt":0.21197807522163933,"score_spread":0.19693937839275621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144654200","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8776574,0.00015762664,0.015546526,0.00031145834,0.000057956928,0.00013929284,0.0000014267857,0.0003717033,0.105756596],"genre_scores_gemma":[0.99581486,0.000012143656,0.00047983316,0.00050732936,0.00009181903,0.000004881648,0.000015707788,0.000024011284,0.0030494246],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988048,0.00001794604,0.00036624356,0.00030186557,0.0002693288,0.0002397949],"domain_scores_gemma":[0.99891853,0.000098623415,0.00038281336,0.0003775392,0.00020936305,0.000013114057],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00028283792,0.00018917808,0.0005014309,0.0007790838,0.00012157016,0.00007960514,0.00021969623,0.00006024804,0.0043960833],"category_scores_gemma":[0.000120905366,0.00014427226,0.00020457177,0.0038188598,0.00008896269,0.00079675595,0.00006982058,0.00010105687,0.00014234176],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014883625,0.00045861397,0.3610769,0.00013587247,0.010115876,0.000077580255,0.00042246943,0.40958676,0.0025753486,0.20496827,0.0021351092,0.008298385],"study_design_scores_gemma":[0.0006976437,0.000021811298,0.0056903227,0.00008292714,0.008046031,0.0000012701839,0.0006725709,0.9738957,0.0005111917,0.0040897797,0.0056823334,0.0006084075],"about_ca_topic_score_codex":0.00040608534,"about_ca_topic_score_gemma":0.0004886491,"teacher_disagreement_score":0.56430894,"about_ca_system_score_codex":0.000023453682,"about_ca_system_score_gemma":0.000002997232,"threshold_uncertainty_score":0.996514},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014294316411297525,"score_gpt":0.2217028616186853,"score_spread":0.20740854520738777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144892099","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9480339,0.000034297536,0.004302323,0.011105833,0.00050850055,0.0017577616,0.000003259036,0.00039550595,0.03385862],"genre_scores_gemma":[0.98518634,0.0000060547727,0.0011916431,0.0105315,0.00039800678,0.00064475083,0.00017910248,0.000044868095,0.0018177181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99797875,0.00004571924,0.0005874287,0.00056193705,0.0003913937,0.0004347826],"domain_scores_gemma":[0.99884444,0.000035898294,0.00013797222,0.000695076,0.0002614634,0.000025170619],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0004896722,0.00031665197,0.00028813936,0.00052979786,0.00045625315,0.0014083921,0.00055281207,0.00006744001,0.0010324012],"category_scores_gemma":[0.000016323735,0.00031687817,0.00006295335,0.0009633912,0.000019359815,0.0029922838,0.00043230076,0.00020138339,0.0038240466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001604493,0.0002263813,0.00057589496,0.00090545363,0.0001424723,0.00001676222,0.00017872684,0.8639781,0.00017321766,0.13166563,0.0007120162,0.0014093153],"study_design_scores_gemma":[0.0024347268,0.000010478883,0.065157175,0.00039445973,0.00036135098,0.000005077628,0.006193264,0.79521513,0.0005811652,0.041252118,0.08658696,0.0018080848],"about_ca_topic_score_codex":0.01283209,"about_ca_topic_score_gemma":0.007849495,"teacher_disagreement_score":0.09041352,"about_ca_system_score_codex":0.00017951934,"about_ca_system_score_gemma":0.000012383019,"threshold_uncertainty_score":0.99992836},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Vagueness; Computer science; Service (business); Queueing theory; Robustness (evolution); Business; Service provider; Marketing","score_opus":0.051135704477000145,"score_gpt":0.30671042580661917,"score_spread":0.255574721329619,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2144979199","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7990845,0.00031418988,0.010855661,0.007292489,0.00004996492,0.001596206,0.000009098065,0.000299713,0.18049821],"genre_scores_gemma":[0.98778546,0.000025510437,0.004694038,0.00011809815,0.000163021,0.00027324958,0.00003180597,0.000039626317,0.0068692015],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99864405,0.00004949959,0.00015959561,0.0003868624,0.00040626497,0.00035374967],"domain_scores_gemma":[0.99902165,0.00005260773,0.00003258904,0.0003593015,0.00050290354,0.000030929667],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041028764,0.00015248306,0.00015371636,0.00062152976,0.0011250466,0.0004087973,0.00021236847,0.00003652468,0.0008752739],"category_scores_gemma":[0.00008588751,0.00010853172,0.00002240244,0.0013132116,0.00033001642,0.002352337,0.000130044,0.00024887527,0.00011625019],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009664192,0.0011570677,0.010110285,0.00054186786,0.00082117325,0.0004206595,0.015862748,0.017633313,0.0042257374,0.9365307,0.0023573048,0.009372691],"study_design_scores_gemma":[0.01388098,0.0011655391,0.009926322,0.0022837773,0.002049001,0.00026821333,0.21361616,0.34240973,0.016656185,0.07063027,0.32001212,0.007101691],"about_ca_topic_score_codex":0.00066050596,"about_ca_topic_score_gemma":0.0022481,"teacher_disagreement_score":0.86590046,"about_ca_system_score_codex":0.000035150737,"about_ca_system_score_gemma":0.000043280863,"threshold_uncertainty_score":0.95836353},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01534793979028453,"score_gpt":0.25475451076931477,"score_spread":0.23940657097903023,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145197897","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7924507,0.000026531861,0.20079635,0.00021854168,0.0002188277,0.00048101819,3.6158403e-7,0.0003287901,0.005478818],"genre_scores_gemma":[0.988844,0.00000925911,0.010116965,0.0004957082,0.00012425958,0.000010912153,0.000003778079,0.000014257674,0.00038089018],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984853,0.000007148612,0.00020584793,0.00048802732,0.0004292945,0.00038432566],"domain_scores_gemma":[0.9994401,0.000029459714,0.00015236228,0.00026586268,0.00008943919,0.000022814995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00061345566,0.00014861964,0.00012725734,0.00046895538,0.000813444,0.00016783155,0.00032518755,0.00001895038,0.00001926229],"category_scores_gemma":[0.00008390416,0.00014364543,0.00003820986,0.0012576286,0.00038832804,0.0019919416,0.00045300732,0.000071876915,0.000070848815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006897151,0.00024704591,0.07616176,0.00030390103,0.00006976808,0.00017977817,0.0004927033,0.70798665,0.0011052258,0.021676844,0.000095814015,0.19161153],"study_design_scores_gemma":[0.0004134728,0.000008220073,0.014188502,0.0000422569,0.000055239583,0.0000019673905,0.00020687585,0.96628344,0.000044356802,0.00089128513,0.017564481,0.0002998869],"about_ca_topic_score_codex":0.00007530978,"about_ca_topic_score_gemma":0.000011934817,"teacher_disagreement_score":0.2582968,"about_ca_system_score_codex":0.000052315263,"about_ca_system_score_gemma":0.0000037621724,"threshold_uncertainty_score":0.6256436},"labels":[],"label_agreement":null},{"id":"W2145798290","doi":"10.1016/j.orl.2013.09.008","title":"A first passage time problem for spectrally positive Lévy processes and its application to a dynamic priority queue","year":2013,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Laplace transform; Queue; Poisson distribution; Class (philosophy); Mathematical optimization; Computer science; First-hitting-time model; Lévy process; Process (computing); Queueing theory; Priority queue; Mathematics; Applied mathematics; Mathematical analysis; Computer network; Statistics","score_opus":0.012512005975808241,"score_gpt":0.29076447427547286,"score_spread":0.2782524682996646,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2145798290","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7404039,0.00006799701,0.10457753,0.1460027,0.000020853857,0.0074317283,0.00003194468,0.00018819117,0.0012751962],"genre_scores_gemma":[0.9877414,0.000008593544,0.0054179123,0.0026064334,0.00022825979,0.0027807273,0.00011118914,0.000035085603,0.001070396],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987485,0.00003245241,0.0001847965,0.00040812072,0.0002599924,0.00036614298],"domain_scores_gemma":[0.9987628,0.000160423,0.000031938307,0.00020278535,0.0008142128,0.000027883721],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006155963,0.00012924,0.00013979305,0.00036104128,0.00080343883,0.0006784982,0.00023023335,0.000037063608,0.00008166259],"category_scores_gemma":[0.00057601434,0.00012182809,0.000030421617,0.0009657159,0.000061625884,0.0015878848,0.00013172283,0.00015158487,0.00061826815],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023605446,0.0005401772,0.00043357487,0.0019200427,0.00028964307,0.000010737865,0.0015557817,0.12755004,0.7587857,0.082158536,0.016971119,0.0095485505],"study_design_scores_gemma":[0.0007887194,0.00008498402,0.0019104122,0.00021442171,0.0000777871,0.000003186783,0.00030170503,0.96812195,0.0019999186,0.010427061,0.015379108,0.0006907429],"about_ca_topic_score_codex":0.00042930245,"about_ca_topic_score_gemma":0.0014713575,"teacher_disagreement_score":0.84057194,"about_ca_system_score_codex":0.00010719897,"about_ca_system_score_gemma":0.00003671486,"threshold_uncertainty_score":0.7946793},"labels":[],"label_agreement":null},{"id":"W2146542925","doi":"10.1016/j.camwa.2012.03.081","title":"Estimating the loss probability under heavy traffic conditions","year":2012,"lang":"en","type":"article","venue":"Computers & Mathematics with Applications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"National Chiao Tung University; Simon Fraser University; National Science Council; Ministry of Education","keywords":"Erlang (programming language); Queueing theory; Mathematics; Heavy traffic; Infinity; Erlang distribution; Exponential distribution; Exponential function; Probability distribution; Applied mathematics; Coverage probability; Queue; Heavy-tailed distribution; Statistics; Computer science; Mathematical analysis; Computer network","score_opus":0.020599259394722153,"score_gpt":0.25724842528741565,"score_spread":0.2366491658926935,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2146542925","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.095315166,0.000027450422,0.900594,0.0013203602,0.000065366425,0.00080341526,0.000003093797,0.00029900786,0.0015721347],"genre_scores_gemma":[0.85474694,3.9609353e-7,0.14330597,0.00071278174,0.0005960032,0.00052735675,0.000037872767,0.0000310942,0.000041586296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989647,0.000013901244,0.00029870498,0.00021697473,0.0001966965,0.0003090084],"domain_scores_gemma":[0.9985411,0.00030823212,0.00029884337,0.0006920388,0.00013313121,0.000026633588],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004480281,0.00018558087,0.00019687384,0.0000861155,0.00065644115,0.00016858068,0.00038967375,0.00003534541,0.000049147697],"category_scores_gemma":[0.000035550158,0.00012699739,0.00007572386,0.0006908839,0.00024886738,0.0005863241,0.000116497926,0.00014674562,0.00028406648],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000003894628,0.0004474601,0.00028615032,0.00020608562,0.00007846814,2.6639884e-7,0.00029914064,0.22198626,0.0000128406145,0.7741592,0.00046974447,0.0020504661],"study_design_scores_gemma":[0.00030396372,0.000006631194,0.0006616437,0.000098798344,0.00040019816,0.000023545168,0.0005053771,0.5778562,0.000013977205,0.41343445,0.0062735747,0.00042165074],"about_ca_topic_score_codex":0.0000039601905,"about_ca_topic_score_gemma":0.0000072658067,"teacher_disagreement_score":0.7594318,"about_ca_system_score_codex":0.000045438253,"about_ca_system_score_gemma":0.00001527735,"threshold_uncertainty_score":0.5178803},"labels":[],"label_agreement":null},{"id":"W2147182881","doi":"10.1109/its.1990.175591","title":"Queuing analysis of a shared buffer strategy for transport-layer connections","year":2002,"lang":"en","type":"article","venue":"SBT/IEEE International Symposium on Telecommunications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Transport layer; Queueing theory; Communication source; Buffer (optical fiber); Computer network; Host (biology); Layer (electronics); Queue; Process (computing); Distributed computing; Blocking (statistics); Operating system; Telecommunications","score_opus":0.059357144058786435,"score_gpt":0.3054481480868602,"score_spread":0.24609100402807377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147182881","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.55583614,0.0004055906,0.12132936,0.03951107,0.0018828852,0.0024798359,0.0013232046,0.0011898356,0.27604204],"genre_scores_gemma":[0.99530965,0.00007507246,0.0012531265,0.00072588905,0.00024255888,0.00022934924,0.0006189903,0.000037811238,0.0015075526],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99840873,0.000032689688,0.00066946074,0.00035652975,0.0002907758,0.00024179513],"domain_scores_gemma":[0.99752223,0.0004672017,0.0005098633,0.0008459513,0.00063239475,0.000022324513],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032932806,0.00022221786,0.00038050913,0.0009811171,0.0003677784,0.00010985181,0.0009903294,0.00009104093,0.0019069404],"category_scores_gemma":[0.00015027566,0.00023553366,0.0005251399,0.0015495775,0.00009660861,0.0007978907,0.000057130343,0.00020157572,0.000088921166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015603178,0.0016076592,0.006438675,0.000062618295,0.0060606683,0.000002151285,0.00045903123,0.62240505,0.014607045,0.34252244,0.0027949857,0.002883643],"study_design_scores_gemma":[0.0015144111,0.000070435395,0.0063778837,0.00011632628,0.0043681213,0.0000023135642,0.00047577277,0.88501805,0.0012770859,0.009993271,0.0899163,0.00087002834],"about_ca_topic_score_codex":0.00046501588,"about_ca_topic_score_gemma":0.001318937,"teacher_disagreement_score":0.43947348,"about_ca_system_score_codex":0.000106533145,"about_ca_system_score_gemma":0.000010044018,"threshold_uncertainty_score":0.99900544},"labels":[],"label_agreement":null},{"id":"W2147314910","doi":"10.1109/wsc.2003.1261636","title":"Modelling and simulation of a telephone call center","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Queueing theory; Markov chain; Staffing; Service (business); Center (category theory); Markov process; Distributed computing; GPSS; Call management; Operations research; Computer network; Simulation; Call control; Engineering; Mathematics; Statistics; Machine learning","score_opus":0.015580826415047114,"score_gpt":0.23153120679889536,"score_spread":0.21595038038384823,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147314910","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.50835186,0.000012098117,0.48827332,0.0000826884,0.000013061029,0.000036591275,2.0703372e-7,0.000035238823,0.0031949582],"genre_scores_gemma":[0.99687153,0.0000023388495,0.002672039,0.00024463882,0.00008430968,7.7851155e-7,0.000003807923,0.000007375812,0.000113181115],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999635,0.0000016306716,0.00011945974,0.000100772595,0.00006800406,0.0000751279],"domain_scores_gemma":[0.999774,0.000016567397,0.00006958654,0.00008130567,0.000055044824,0.0000035136873],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00008646018,0.000055175744,0.00008820176,0.000094349554,0.000036832098,0.000021585105,0.00003783793,0.0000188984,0.000041647407],"category_scores_gemma":[0.000019470897,0.000048291462,0.000026388258,0.00015613614,0.000021449076,0.00045681474,0.00003780231,0.000027515202,0.00001846516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014703038,0.000021531343,0.0003530215,0.00002249667,0.000008944464,6.2552357e-7,0.000019123921,0.9868726,0.00014349523,0.012003872,0.0000026970806,0.00053688284],"study_design_scores_gemma":[0.00036654144,0.0000017773506,0.00003578251,0.000017968903,0.000023564875,1.5874951e-7,0.000032783693,0.9509556,0.0001620994,0.04764,0.0006967351,0.00006693599],"about_ca_topic_score_codex":0.00018450731,"about_ca_topic_score_gemma":0.000019115829,"teacher_disagreement_score":0.48851967,"about_ca_system_score_codex":0.000007829191,"about_ca_system_score_gemma":0.000001765945,"threshold_uncertainty_score":0.19692688},"labels":[],"label_agreement":null},{"id":"W2147877327","doi":"10.1109/pccc.1994.504139","title":"An Analysis of Space Priority Queueing in ATM Switches","year":2005,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan; University of Toronto","funders":"","keywords":"Computer science; Queueing theory; Computer network; Network congestion; Quality of service; Flow control (data); Network packet; Priority queue; Network traffic control; Asynchronous Transfer Mode; Packet loss; Distributed computing; Real-time computing; Queue","score_opus":0.010264332543164228,"score_gpt":0.2564263203734731,"score_spread":0.2461619878303089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2147877327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9826604,0.00003760128,0.007142173,0.00045179873,0.00001737562,0.0000590022,4.552538e-7,0.00009303051,0.009538178],"genre_scores_gemma":[0.99680394,0.0000046024193,0.002364911,0.00036387716,0.00018648646,0.0000026833684,0.000010852718,0.000011521017,0.00025112374],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990595,0.000014183942,0.00030398747,0.00026262485,0.00016521182,0.00019452079],"domain_scores_gemma":[0.9992991,0.000047325437,0.00019604234,0.00036484815,0.00008302784,0.00000965951],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005989155,0.00012367828,0.0003500163,0.0008957205,0.000049719754,0.000058565412,0.00022221131,0.000046230507,0.0005335412],"category_scores_gemma":[0.00010610569,0.000114857,0.0001423432,0.002518544,0.000035639237,0.0015459314,0.00006895931,0.000083316256,0.00004039967],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004821422,0.0002530667,0.61976963,0.000041344763,0.00037582227,0.000003850721,0.00016798169,0.2500387,0.005025975,0.11095558,0.000024650204,0.013295161],"study_design_scores_gemma":[0.0004074263,0.0000069618272,0.15430929,0.000024069457,0.0015009228,1.4082502e-7,0.0011916521,0.82811296,0.001809109,0.0072629843,0.0049526887,0.00042179658],"about_ca_topic_score_codex":0.0020249926,"about_ca_topic_score_gemma":0.009707125,"teacher_disagreement_score":0.5780742,"about_ca_system_score_codex":0.00003865088,"about_ca_system_score_gemma":0.00000709855,"threshold_uncertainty_score":0.5841902},"labels":[],"label_agreement":null},{"id":"W2148307089","doi":"10.1287/15-ssy179","title":"Randomized Assignment of Jobs to Servers in Heterogeneous Clusters of Shared Servers for Low Delay","year":2016,"lang":"en","type":"article","venue":"Stochastic Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":27,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Server; Exponential distribution; Computer science; Poisson distribution; Limit (mathematics); Mathematics; Inter-process communication; Distributed computing; Computer network; Statistics; Mathematical analysis","score_opus":0.015476965141775626,"score_gpt":0.23718080154274992,"score_spread":0.2217038364009743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148307089","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35244244,0.00007231684,0.6444196,0.00018291247,0.0005709708,0.002108349,0.00003776628,0.000044380995,0.00012127263],"genre_scores_gemma":[0.99906415,6.174286e-7,0.00021763502,0.00008616964,0.00013830313,0.0002853219,0.000009294678,0.000033033695,0.00016545756],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982347,0.00006285383,0.00080235314,0.0003153043,0.00028870592,0.00029611585],"domain_scores_gemma":[0.99817127,0.0006489296,0.0006142521,0.00033168733,0.00020973268,0.000024129658],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001295758,0.00020372006,0.0008758906,0.00042072666,0.000038467453,0.000028672508,0.00028779038,0.00006501976,0.000035398098],"category_scores_gemma":[0.0008380426,0.0001484811,0.00026104186,0.00037101848,0.00007345688,0.0002902559,0.00010265976,0.00003106083,0.000021012578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.027925618,0.00010596671,0.00029269673,0.0013427611,0.00048035439,0.000007446897,0.0002899409,0.9568639,0.0046847854,0.0071881553,0.00018467434,0.00063373824],"study_design_scores_gemma":[0.34845248,0.00023781696,0.00010853512,0.009214519,0.001475381,0.000010877371,0.0028360202,0.6250259,0.0014633936,0.008766421,0.0006290553,0.0017795913],"about_ca_topic_score_codex":0.00040546787,"about_ca_topic_score_gemma":0.000102892016,"teacher_disagreement_score":0.6466217,"about_ca_system_score_codex":0.00011537997,"about_ca_system_score_gemma":0.000018334498,"threshold_uncertainty_score":0.60548836},"labels":[],"label_agreement":null},{"id":"W2148752646","doi":"10.1109/glocom.1998.776622","title":"A non-Gaussian self-similar process for broadband heavy traffic modeling","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Upper and lower bounds; Computer science; Broadband; Gaussian process; Process (computing); Gaussian; Stochastic process; Traffic generation model; Broadband networks; Noise (video); Traffic equations; Gaussian noise; Heavy traffic; Algorithm; Mathematical optimization; Real-time computing; Computer network; Mathematics; Telecommunications; Engineering; Statistics; Physics; Queueing theory","score_opus":0.0234697015075361,"score_gpt":0.247168523330156,"score_spread":0.22369882182261988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148752646","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.745322,0.00024367614,0.19679198,0.0031909663,0.0002779925,0.0012070923,0.0000034592783,0.0016232172,0.051339626],"genre_scores_gemma":[0.9945315,0.000007455676,0.0019941647,0.0015321686,0.0006771552,0.00007546997,0.000011783085,0.000051994448,0.001118314],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99873185,0.0000038298144,0.00029218246,0.00039964085,0.00018067064,0.0003918495],"domain_scores_gemma":[0.9994176,0.000028039341,0.00011826182,0.00026372846,0.00015320665,0.000019160625],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002542914,0.0002243819,0.00026899934,0.0002381732,0.00032351466,0.00018392557,0.00025940445,0.000072748495,0.00046855432],"category_scores_gemma":[0.000056408342,0.00019807825,0.00015489731,0.0005356186,0.000021005968,0.0012136038,0.00004153304,0.00009920988,0.00017785694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009974115,0.00036411692,0.00017301666,0.0006275799,0.00016611657,0.000007986113,0.00039101587,0.98086107,0.00006943259,0.0074832533,0.0028231496,0.0069335494],"study_design_scores_gemma":[0.00056981464,0.000008436881,0.0000022811303,0.00003027191,0.00015024742,0.0000010105166,0.0002987672,0.9867582,0.000037626127,0.005933,0.005914686,0.00029567126],"about_ca_topic_score_codex":0.000012129131,"about_ca_topic_score_gemma":0.00003299723,"teacher_disagreement_score":0.2492095,"about_ca_system_score_codex":0.000025447962,"about_ca_system_score_gemma":0.000005630393,"threshold_uncertainty_score":0.8077397},"labels":[],"label_agreement":null},{"id":"W2148761941","doi":"10.1109/ccece.2005.1557332","title":"Call center performance evaluation","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Scalability; Flexibility (engineering); Computer science; Fraction (chemistry); Center (category theory); Simulation; Scale (ratio); Operating system","score_opus":0.013143353250947211,"score_gpt":0.23539098857579843,"score_spread":0.22224763532485123,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2148761941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.67737895,0.000012295091,0.0020282217,0.00025408136,0.000097311866,0.000086905726,1.7276703e-7,0.00012120902,0.32002082],"genre_scores_gemma":[0.99494946,6.6742706e-7,0.00024006535,0.000800181,0.0006460258,0.000009590146,0.000039310828,0.000009432703,0.003305295],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99940866,0.0000052875225,0.00012420368,0.0001344371,0.00019722765,0.00013018979],"domain_scores_gemma":[0.9996525,0.000008798806,0.0000681163,0.00014069352,0.00012762022,0.0000022479157],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003556363,0.000071844195,0.00006724247,0.00010293548,0.000090949325,0.00006676823,0.00008685716,0.000019786621,0.0011332836],"category_scores_gemma":[0.00002587732,0.00006104252,0.000037800575,0.000227982,0.000016953793,0.0008579688,0.000039622668,0.000037148882,0.00093850424],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011928044,0.00044958305,0.31742895,0.00015027788,0.000077558994,0.0000063524644,0.000021624086,0.12695433,0.002398105,0.35689667,0.054766286,0.140731],"study_design_scores_gemma":[0.000891916,0.0000041429134,0.042182606,0.000023293214,0.0001376469,0.0000010388505,0.00002967498,0.7697706,0.00039152443,0.028070498,0.15814273,0.00035432083],"about_ca_topic_score_codex":0.0001354003,"about_ca_topic_score_gemma":0.00009710997,"teacher_disagreement_score":0.6428163,"about_ca_system_score_codex":0.000025596099,"about_ca_system_score_gemma":0.0000034115953,"threshold_uncertainty_score":0.99983937},"labels":[],"label_agreement":null},{"id":"W2149000759","doi":"10.1109/ccece.1998.682568","title":"MMPP modeling of aggregated ATM traffic","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":29,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Queueing theory; Computer science; Matching (statistics); Poisson distribution; Markov process; Markov chain; Moment (physics); Superposition principle; State (computer science); Algorithm; Aggregate (composite); Mathematics; Statistics; Computer network","score_opus":0.02563797996042185,"score_gpt":0.2133277202606028,"score_spread":0.18768974030018093,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2149000759","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8947655,0.00019070714,0.017444203,0.00041811645,0.00008978907,0.00009710825,4.6621255e-7,0.00034829922,0.08664583],"genre_scores_gemma":[0.9971072,0.000009701653,0.00063520856,0.00036542778,0.00016833046,0.0000024151366,0.0000042949555,0.000017532788,0.0016898711],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992926,0.0000053615613,0.00023261378,0.00017016457,0.00013514255,0.00016409291],"domain_scores_gemma":[0.999534,0.000020899748,0.00012384816,0.00021364984,0.000101521844,0.0000060707075],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014693239,0.000105372135,0.00017431009,0.00017650465,0.00006989167,0.000036157406,0.0001607142,0.000036070825,0.002309023],"category_scores_gemma":[0.00008449105,0.00009284638,0.000094917785,0.00055501284,0.000028546372,0.0006048192,0.00005124339,0.000060512757,0.00042011228],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013705617,0.000085635584,0.00011150731,0.000052729105,0.00005102145,0.000004901629,0.000037371436,0.9569343,0.00033908844,0.027531702,0.00059974677,0.014238316],"study_design_scores_gemma":[0.0001884012,0.0000021705864,0.000003315427,0.000021019181,0.00005738006,3.9683405e-7,0.00009657935,0.9941368,0.000049551403,0.0036298132,0.001695827,0.00011871377],"about_ca_topic_score_codex":0.00004529988,"about_ca_topic_score_gemma":0.000022880891,"teacher_disagreement_score":0.102341734,"about_ca_system_score_codex":0.000009371772,"about_ca_system_score_gemma":0.000001208742,"threshold_uncertainty_score":0.998603},"labels":[],"label_agreement":null},{"id":"W2150118366","doi":"10.1287/ijoc.1060.0190","title":"Efficient Computations for the Discrete GI/G/1 System","year":2007,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Program for New Century Excellent Talents in University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Queue; Computation; Discrete time and continuous time; Computer science; Mathematical optimization; Discrete system; Algorithm; Mathematics; Discrete mathematics; Applied mathematics; Statistics; Computer network","score_opus":0.014892103570001347,"score_gpt":0.26742301415472086,"score_spread":0.2525309105847195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2150118366","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.12925021,0.000036529796,0.8649339,0.0006458669,0.0009523933,0.00022165707,8.108786e-7,0.00012818666,0.0038304161],"genre_scores_gemma":[0.99328923,3.9808077e-7,0.0023151054,0.0018535816,0.0024801423,0.000001603683,0.0000035185071,0.000021626123,0.00003479393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998559,0.0000062487543,0.0005850576,0.00012942767,0.00032389048,0.00039637033],"domain_scores_gemma":[0.9979805,0.0008477186,0.00067740935,0.0001756459,0.00029536852,0.000023380713],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.002754396,0.00016258388,0.00019058364,0.00030460957,0.0015449044,0.0004992456,0.0003575536,0.00003720644,0.000007287115],"category_scores_gemma":[0.00027402054,0.00009846545,0.00022320694,0.0004967107,0.000049944618,0.0002685353,0.000103285456,0.00029761196,0.000072346025],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006227167,0.00001354626,0.0001924792,0.000045761433,0.000062852814,0.000009008451,0.00008981866,0.89202684,0.000009037958,0.08117512,0.00021230582,0.02610094],"study_design_scores_gemma":[0.0004765696,0.000015682941,0.0006629894,0.00018448284,0.00008074835,0.00004012804,0.0015688553,0.9784997,0.000013443163,0.0014606311,0.01683291,0.00016382009],"about_ca_topic_score_codex":0.000008128949,"about_ca_topic_score_gemma":0.0000034882041,"teacher_disagreement_score":0.864039,"about_ca_system_score_codex":0.00011627951,"about_ca_system_score_gemma":0.000011618648,"threshold_uncertainty_score":0.99975497},"labels":[],"label_agreement":null},{"id":"W2151111317","doi":"","title":"CanQueue 2006: 8th Annual Conference for Canadian Queueing Theorists and Practitioners","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Queueing theory; Computer science; Telephone line; Erlang (programming language); Phone; Server; Operations research; Layered queueing network; Service (business); Telephony; Theoretical computer science; Computer network; Mathematics","score_opus":0.00802405035247993,"score_gpt":0.22375540642613265,"score_spread":0.2157313560736527,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2151111317","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36162588,0.00021923552,0.13018537,0.014720205,0.0006578945,0.0013821744,0.00016539166,0.0006780754,0.49036577],"genre_scores_gemma":[0.991734,0.0000024620554,0.0013680996,0.0017476869,0.0005689814,0.000029150407,0.00008826597,0.000020942804,0.004440402],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99916375,0.000009296552,0.0001695258,0.00025663903,0.00008996644,0.00031082536],"domain_scores_gemma":[0.99936664,0.000077349556,0.00012223629,0.0001422241,0.0002668534,0.000024685698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031679493,0.00014067975,0.00014839285,0.00019554014,0.00033997558,0.00024019167,0.00010789612,0.000053797026,0.0002589486],"category_scores_gemma":[0.00015111719,0.00013330432,0.000040547544,0.0002376796,0.0000720689,0.0012847726,0.00003152777,0.000070839254,0.000037454723],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002282575,0.000014480058,0.0025298807,0.00003929658,0.000022630362,0.000008040451,0.000041501477,0.0008517055,0.00008485765,0.98283947,0.011666286,0.0018790577],"study_design_scores_gemma":[0.0008239945,0.000012469907,0.0029016118,0.000050145198,0.00018802217,0.0000066128173,0.0030067188,0.024478832,0.0001365808,0.42442736,0.5432157,0.00075195864],"about_ca_topic_score_codex":0.38179386,"about_ca_topic_score_gemma":0.5594322,"teacher_disagreement_score":0.6301081,"about_ca_system_score_codex":0.000060785424,"about_ca_system_score_gemma":0.0000647628,"threshold_uncertainty_score":0.62232286},"labels":[],"label_agreement":null},{"id":"W2152242816","doi":"10.1109/infcom.2007.217","title":"On Q(H log H) Scaling of Network Delays","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Network calculus; Bounded function; Upper and lower bounds; Scaling; Node (physics); Computer science; Network packet; Binary logarithm; Path (computing); Computer network; Discrete mathematics; Mathematics; Combinatorics; Topology (electrical circuits); Quality of service; Physics","score_opus":0.011225395150081918,"score_gpt":0.23516255143629192,"score_spread":0.22393715628621,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2152242816","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4277088,0.000037631067,0.26605955,0.00013577286,0.00022817186,0.000082730534,1.8654508e-7,0.0001704778,0.30557665],"genre_scores_gemma":[0.9952303,8.628988e-7,0.0018115932,0.0017667294,0.0006883087,6.3158086e-7,0.000003989522,0.000013835303,0.00048372446],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992773,0.000003591194,0.00021989232,0.00014152711,0.0001368319,0.00022083713],"domain_scores_gemma":[0.9994487,0.00014045608,0.00014371815,0.00018772493,0.00007317417,0.0000062194035],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082325406,0.00008712019,0.00013996688,0.00013503952,0.000079698286,0.00002215413,0.00013232879,0.000036170703,0.0004946994],"category_scores_gemma":[0.0001278856,0.00007461994,0.00007470456,0.0005223885,0.00003327476,0.0002530798,0.00006326953,0.0000679704,0.00021443525],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008594807,0.000037186586,0.00264036,0.000023382963,0.000031382693,0.000006837558,0.000006610674,0.085464224,0.00021040594,0.90139264,0.0014219328,0.008679096],"study_design_scores_gemma":[0.0007702112,0.00002349705,0.0037194076,0.00016503909,0.00022628039,0.0000013120676,0.00034192106,0.05346826,0.0015811847,0.9097348,0.029349497,0.00061858166],"about_ca_topic_score_codex":0.000051391762,"about_ca_topic_score_gemma":0.000054659766,"teacher_disagreement_score":0.5675215,"about_ca_system_score_codex":0.000011840992,"about_ca_system_score_gemma":0.0000020831405,"threshold_uncertainty_score":0.54166114},"labels":[],"label_agreement":null},{"id":"W2153532876","doi":"10.1287/mnsc.1080.0914","title":"Performance Analysis of a Queue with Congestion-Based Staffing Policy","year":2008,"lang":"en","type":"article","venue":"Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":39,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Simon Fraser University","funders":"Western Washington University","keywords":"Staffing; Computer science; Queue; Benchmark (surveying); Queueing theory; Mathematical optimization; Operations research; Limit (mathematics); Set (abstract data type); Line (geometry); Range (aeronautics); Distributed computing; Computer network; Mathematics; Economics; Engineering","score_opus":0.012368187173404011,"score_gpt":0.2304978894072622,"score_spread":0.2181297022338582,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153532876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95101285,0.0000065668164,0.01240539,0.00029557678,0.000033805765,0.00016848069,0.0000010980727,0.00011560102,0.035960626],"genre_scores_gemma":[0.9968202,0.000007912166,0.0020399077,0.00064699614,0.00005819588,0.000017056413,0.0000076215565,0.000011265696,0.0003908544],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821687,0.000008321017,0.00026080638,0.00044838813,0.00070074014,0.00036485586],"domain_scores_gemma":[0.99887764,0.000036270758,0.0003129688,0.0005334594,0.00021997557,0.000019654912],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072657096,0.00016391961,0.00027335598,0.0030956168,0.00053612667,0.00008256011,0.0006317313,0.000017301094,0.000087369204],"category_scores_gemma":[0.00008877733,0.00013863943,0.00008630488,0.013508349,0.0007700643,0.001333322,0.00018485489,0.00006328119,0.000035218658],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007111695,0.000107627864,0.15236686,0.00012098291,0.00028212016,0.00002212344,0.000058247897,0.7681733,0.00024555303,0.07497416,0.000030411406,0.0035475236],"study_design_scores_gemma":[0.00051436515,0.000027497153,0.2708814,0.00007280159,0.001149725,8.194688e-7,0.0002245316,0.72433996,0.00031896486,0.00031216256,0.0017802754,0.00037747604],"about_ca_topic_score_codex":0.00024491694,"about_ca_topic_score_gemma":0.000055538276,"teacher_disagreement_score":0.11851453,"about_ca_system_score_codex":0.000086627144,"about_ca_system_score_gemma":0.000050683848,"threshold_uncertainty_score":0.6490314},"labels":[],"label_agreement":null},{"id":"W2153722981","doi":"10.1109/glocom.2009.5426077","title":"Revenue Management in the Presence of Self-Similar Alpha-Stable Distributions","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Burstiness; Bandwidth allocation; Revenue; Computer science; Revenue management; Bandwidth (computing); Mathematical optimization; Network topology; Context (archaeology); Alpha (finance); Econometrics; Computer network; Mathematics; Economics; Network packet; Statistics","score_opus":0.010640585186571813,"score_gpt":0.2398624573220591,"score_spread":0.22922187213548728,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2153722981","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41238555,0.00042066808,0.07247012,0.023349723,0.0002846162,0.00192183,0.00003743866,0.00050025596,0.4886298],"genre_scores_gemma":[0.9965965,0.000024452442,0.0014533455,0.0010765372,0.000080981976,0.000012312631,0.00001602877,0.0000043529258,0.0007354771],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992745,0.000019990313,0.00019990749,0.00015462068,0.000171587,0.00017940023],"domain_scores_gemma":[0.99945384,0.000047067333,0.00010531068,0.00034473414,0.000045320154,0.0000037229672],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055300794,0.000087040295,0.000117740594,0.00011409291,0.00009591825,0.000050008235,0.00035613234,0.000020090178,0.00010242181],"category_scores_gemma":[0.00006614693,0.0000638622,0.000055742974,0.0008439141,0.000025567995,0.00050844,0.000065999244,0.00007244576,0.000040885498],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000020074554,0.0003110173,0.0013806899,0.00006924588,0.00004056014,0.000024214132,0.00009667639,0.0024192503,0.000109666726,0.9813164,0.0103187505,0.003893452],"study_design_scores_gemma":[0.00078734796,0.000019497564,0.030853521,0.00011434146,0.00037623593,0.0000019307063,0.0012413069,0.016880535,0.00031038164,0.5953366,0.3536517,0.00042660168],"about_ca_topic_score_codex":0.00006256269,"about_ca_topic_score_gemma":0.000049932383,"teacher_disagreement_score":0.58421093,"about_ca_system_score_codex":0.000017573313,"about_ca_system_score_gemma":0.0000024988574,"threshold_uncertainty_score":0.26042247},"labels":[],"label_agreement":null},{"id":"W2154342726","doi":"10.1109/pacrim.1989.48409","title":"A performance study of a user access strategy for ISDN","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Narrowband; Wideband; Computer science; Computer network; Queueing theory; Integrated Services Digital Network; Bandwidth (computing); Queue; Asynchronous communication; Blocking (statistics); Telecommunications; Engineering; Electronic engineering","score_opus":0.04468077430111624,"score_gpt":0.3016180575729291,"score_spread":0.25693728327181287,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2154342726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9655345,0.0000048879037,0.0034576252,0.000019758232,0.000049670674,0.00036281574,3.2576528e-7,0.000053066382,0.030517343],"genre_scores_gemma":[0.9977859,9.713149e-7,0.00021314548,0.00018810134,0.00007563037,0.000045689038,0.0000020455682,0.000015367756,0.0016731373],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99932617,0.000008188476,0.00021299286,0.00018141024,0.00011253696,0.00015872529],"domain_scores_gemma":[0.9994237,0.00004072066,0.00015298206,0.00022391969,0.00015393765,0.0000047725302],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003207146,0.00010298744,0.00017632994,0.00014990717,0.000096994256,0.0000863322,0.00022326676,0.00002156287,0.00038871702],"category_scores_gemma":[0.00009351515,0.000084993546,0.00005192091,0.0004505353,0.00001823046,0.0013341409,0.000053059583,0.000038193157,0.0000223142],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000553052,0.0031791518,0.33460206,0.0010148911,0.00060086447,0.0000061847577,0.00031198747,0.14140867,0.00088115525,0.50060433,0.003529091,0.0133085875],"study_design_scores_gemma":[0.02825135,0.0015251073,0.13516903,0.00031080574,0.0039228676,0.0000063500834,0.045200013,0.36851472,0.00846008,0.16253152,0.24107061,0.0050375606],"about_ca_topic_score_codex":0.00006450654,"about_ca_topic_score_gemma":0.00011325102,"teacher_disagreement_score":0.33807278,"about_ca_system_score_codex":0.000007532834,"about_ca_system_score_gemma":0.0000076104498,"threshold_uncertainty_score":0.42561787},"labels":[],"label_agreement":null},{"id":"W2155128235","doi":"10.1109/glocom.2000.891905","title":"Traffic modeling: techniques, algorithms and statistical measures","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Autocorrelation; Computer science; Marginal distribution; Algorithm; Queueing theory; Spatial analysis; Gaussian process; Stochastic process; Gaussian; Traffic generation model; Data mining; Statistics; Mathematics; Random variable; Real-time computing","score_opus":0.0335817913482945,"score_gpt":0.24318001656445848,"score_spread":0.20959822521616397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155128235","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018768515,0.0002685582,0.9349937,0.000931239,0.000060638402,0.00018258966,0.0000023385219,0.00094541354,0.043847043],"genre_scores_gemma":[0.97865,0.000029549661,0.019364955,0.00085455197,0.0003174288,0.000010867397,0.0000064946116,0.00002303816,0.0007431128],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992315,0.000008162924,0.00016922301,0.00023976243,0.00016539538,0.00018593563],"domain_scores_gemma":[0.9996907,0.000033225468,0.00004129612,0.00015264096,0.000069161215,0.000012981909],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023673657,0.00012472991,0.00015235826,0.00014741524,0.0001237432,0.00012643085,0.00010090588,0.000044491513,0.00074620213],"category_scores_gemma":[0.00011801989,0.00010684542,0.00003092519,0.00021209908,0.000054075463,0.00048806722,0.000060332964,0.00009322569,0.0001274211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021863741,0.00014993912,0.00011098174,0.000067712404,0.000066287896,0.000033443095,0.00004225977,0.017602313,0.00017729812,0.27279535,0.0055183065,0.70341426],"study_design_scores_gemma":[0.00010192551,0.0000040156733,0.0000045554602,0.00000762831,0.00005364272,0.0000022567497,0.000051767474,0.9660482,0.000016131647,0.0181102,0.015434961,0.00016473631],"about_ca_topic_score_codex":0.000041347506,"about_ca_topic_score_gemma":0.000020470829,"teacher_disagreement_score":0.9598815,"about_ca_system_score_codex":0.000011145564,"about_ca_system_score_gemma":0.0000013503336,"threshold_uncertainty_score":0.817039},"labels":[],"label_agreement":null},{"id":"W2155470018","doi":"10.1016/j.peva.2013.05.007","title":"Performance analysis of an inventory–production system with shipment consolidation in the production facility","year":2013,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Warehouse; Production (economics); Consolidation (business); Computer science; Operations management; Operations research; Business; Engineering; Economics; Marketing","score_opus":0.03234956952043506,"score_gpt":0.26057992414729025,"score_spread":0.2282303546268552,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155470018","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99780494,0.000014700119,0.00022816705,0.0002128872,0.00015414417,0.0009555852,7.4772083e-7,0.00005497377,0.00057382946],"genre_scores_gemma":[0.9990849,0.000007829792,0.00007126057,0.00004444056,0.0001942099,0.0003459344,0.00022126528,0.0000075421485,0.00002261763],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980941,0.00013094097,0.00044399002,0.00037172626,0.0007760853,0.00018317005],"domain_scores_gemma":[0.9982563,0.00001961608,0.0004991679,0.00052299496,0.00069415534,0.000007724735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004174433,0.0001550317,0.0002346946,0.0007103481,0.00021384117,0.00008373284,0.00019255499,0.00004186822,0.00010758338],"category_scores_gemma":[0.00018903421,0.00011057128,0.000048955142,0.002082693,0.00007911536,0.0040553166,0.00002257185,0.00011442224,0.000066312095],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000118420234,0.00014159761,0.24135166,0.00028674086,0.00014399197,1.14620626e-7,0.0008177212,0.72131413,0.0008581783,0.00018539467,0.000017773495,0.034764282],"study_design_scores_gemma":[0.00013205013,0.00002313243,0.33470896,0.000051292882,0.0006055988,6.464121e-7,0.0013727801,0.66234356,0.0006026473,0.000029190824,0.000024832392,0.00010530887],"about_ca_topic_score_codex":0.00025940407,"about_ca_topic_score_gemma":0.00035468547,"teacher_disagreement_score":0.09335731,"about_ca_system_score_codex":0.00019832415,"about_ca_system_score_gemma":0.000031742427,"threshold_uncertainty_score":0.4508966},"labels":[],"label_agreement":null},{"id":"W2155532749","doi":"10.1002/asmb.879","title":"On the use of phase‐type distributions for inventory management with supply disruptions","year":2011,"lang":"en","type":"article","venue":"Applied Stochastic Models in Business and Industry","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of New Brunswick","funders":"ExxonMobil Research and Engineering Company","keywords":"Computer science; Type (biology); Duration (music); State (computer science); Differential (mechanical device); Phase (matter); Mathematical optimization; Operations research; Mathematics; Algorithm; Engineering","score_opus":0.08660784554436114,"score_gpt":0.25761818134589576,"score_spread":0.17101033580153463,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155532749","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42318758,0.00001063916,0.5740751,0.0002093583,0.000054959524,0.00070271123,0.000030055411,0.00003512424,0.001694434],"genre_scores_gemma":[0.9983263,0.0000035071428,0.0009320402,0.00025254706,0.00006190274,0.00027052496,0.0000652565,0.000023172985,0.00006476567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99910456,0.0000058589467,0.0002521454,0.0002715669,0.00014040631,0.00022545984],"domain_scores_gemma":[0.99924463,0.00010909117,0.00017814962,0.00030993266,0.0001442639,0.000013958901],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00017655743,0.00018243252,0.00021122357,0.00019771043,0.00019427337,0.000049969563,0.00016524836,0.000105776264,0.00006162651],"category_scores_gemma":[0.00005059002,0.00012896345,0.000028419541,0.0007611222,0.00020167085,0.00042391106,0.0000989844,0.00020240834,0.0000026982816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039821208,0.00027092657,0.000060643033,0.00006588893,0.00005258972,0.0000015601273,0.000048227215,0.07346252,0.000018930512,0.9243251,0.00018385354,0.0011115558],"study_design_scores_gemma":[0.00440742,0.00007345337,0.0019409918,0.0005570125,0.0007222645,0.0000024990866,0.0011673939,0.30791274,0.000033105713,0.6813317,0.0011176207,0.00073378003],"about_ca_topic_score_codex":0.00008698538,"about_ca_topic_score_gemma":0.000024836341,"teacher_disagreement_score":0.5751387,"about_ca_system_score_codex":0.00002279212,"about_ca_system_score_gemma":0.000013080674,"threshold_uncertainty_score":0.5258977},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.06578392342394168,"score_gpt":0.29055063318513075,"score_spread":0.22476670976118907,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2155819330","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9617306,0.00006983757,0.0054992307,0.0003919054,0.000048355443,0.0011835012,0.000016985981,0.00013593721,0.030923665],"genre_scores_gemma":[0.9933043,0.000003567539,0.001663908,0.00010892484,0.0002857986,0.00018597084,0.000043695396,0.000033626136,0.0043702186],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887204,0.00005890633,0.00016939148,0.0002951547,0.00028817364,0.00031632406],"domain_scores_gemma":[0.99879277,0.000109352026,0.000029974966,0.0002673326,0.00077417167,0.000026373144],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012799319,0.000117510324,0.00016737467,0.0003469882,0.0008748186,0.00036734453,0.00019343087,0.000053987238,0.00033586],"category_scores_gemma":[0.00017667291,0.00009323594,0.000023046801,0.0007999335,0.0001157424,0.0010982199,0.00011909701,0.00015710654,0.00060729013],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002907143,0.0017733421,0.036402054,0.0053576124,0.002741613,0.00007900319,0.010329133,0.37564826,0.101761475,0.43736467,0.02194015,0.0036955618],"study_design_scores_gemma":[0.00081422454,0.00004309199,0.00057754177,0.00014712977,0.00014334264,0.000006270027,0.0005392513,0.98529625,0.0005768698,0.00079498295,0.010707694,0.00035332606],"about_ca_topic_score_codex":0.001158386,"about_ca_topic_score_gemma":0.00028650588,"teacher_disagreement_score":0.60964805,"about_ca_system_score_codex":0.000033490815,"about_ca_system_score_gemma":0.00003556717,"threshold_uncertainty_score":0.78056884},"labels":[],"label_agreement":null},{"id":"W2156521325","doi":"10.1109/pacrim.1989.48321","title":"Blocking in an ISDN ring","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Blocking (statistics); Computer science; Integrated Services Digital Network; Ring (chemistry); Computation; Function (biology); Computer network; Tandem; Transmission (telecommunications); Theoretical computer science; Algorithm; Telecommunications; Engineering","score_opus":0.016650523593634257,"score_gpt":0.24422180505040397,"score_spread":0.22757128145676972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156521325","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82454664,0.000017099841,0.003738039,0.00006955399,0.00007186752,0.000048927104,3.3990933e-8,0.00013329579,0.17137453],"genre_scores_gemma":[0.9973429,6.088708e-7,0.0010729524,0.0008902607,0.00013816988,0.0000036921945,0.0000016034475,0.000014406674,0.00053542975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99938667,0.000011628461,0.00014229248,0.00018557445,0.00008385239,0.00018999363],"domain_scores_gemma":[0.999702,0.000020928213,0.000054565287,0.00018533134,0.000031614465,0.000005606777],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00038629887,0.000085485975,0.000106156585,0.00023293098,0.000074274816,0.00010313278,0.0001114589,0.000025369502,0.000703639],"category_scores_gemma":[0.00013650594,0.00008146896,0.000031676816,0.00051088346,0.000014493924,0.0011641152,0.000034403794,0.00007416118,0.00017294363],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008633629,0.000070416056,0.077058084,0.00002295227,0.000009860201,0.000021220832,0.00004159823,0.014081475,0.0012800116,0.9032203,0.000041318806,0.0041441093],"study_design_scores_gemma":[0.0023963684,0.00001754863,0.01395386,0.00016327805,0.00016624558,0.000006405434,0.0039158454,0.19865733,0.0037764425,0.6294826,0.14559424,0.0018698063],"about_ca_topic_score_codex":0.00008213435,"about_ca_topic_score_gemma":0.0004108084,"teacher_disagreement_score":0.2737377,"about_ca_system_score_codex":0.00001776275,"about_ca_system_score_gemma":0.000003121598,"threshold_uncertainty_score":0.77043533},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.10829215085009539,"score_gpt":0.3577038544373128,"score_spread":0.2494117035872174,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2156761946","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.36968783,0.0008712218,0.5666899,0.005280449,0.00045657076,0.0004594334,0.00000965491,0.000043809265,0.056501154],"genre_scores_gemma":[0.98374104,0.000012796377,0.01049207,0.0007181745,0.0034024124,0.000004239701,0.000008473628,0.000040191346,0.001580571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99815774,0.00017589504,0.00043566158,0.00013041009,0.0006869986,0.00041327704],"domain_scores_gemma":[0.9979547,0.0002227976,0.0002057558,0.00015885883,0.0014101018,0.000047776088],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.009638863,0.00010824955,0.00016769675,0.00045131816,0.0004314675,0.00027791766,0.00042469415,0.000016936012,0.00015876228],"category_scores_gemma":[0.0016591031,0.00009164666,0.00012772938,0.00037614212,0.00007803891,0.00225729,0.00014624343,0.00034908863,0.00019709868],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016114144,0.00057171076,0.006895848,0.00023694035,0.00034355096,0.0001173055,0.0008836634,0.36274803,0.020554764,0.52931017,0.051700056,0.025026534],"study_design_scores_gemma":[0.0015401258,0.000076512304,0.0033626808,0.00019161294,0.00007517083,0.000044237036,0.0003871433,0.87135416,0.00022557724,0.010784358,0.11157004,0.00038835875],"about_ca_topic_score_codex":0.000004051807,"about_ca_topic_score_gemma":0.0000033491863,"teacher_disagreement_score":0.61405325,"about_ca_system_score_codex":0.00006772849,"about_ca_system_score_gemma":0.00006718628,"threshold_uncertainty_score":0.37372422},"labels":[],"label_agreement":null},{"id":"W2157522295","doi":"10.1109/glocom.2003.1258815","title":"Simulation study of the effective bandwidth for multiclass Markovian sources in a partitioned buffer","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Markov process; Quality of service; Bandwidth (computing); Buffer overflow; Packet loss; Buffer (optical fiber); Markov chain; Multiplexing; Statistical time division multiplexing; Network packet; Heuristic; Queueing theory; Distributed computing; Algorithm; Real-time computing; Computer network; Mathematics; Statistics; Telecommunications; Artificial intelligence","score_opus":0.011103853508189281,"score_gpt":0.25413635254443184,"score_spread":0.24303249903624255,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2157522295","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97861284,0.0000032386163,0.01976451,0.00016665841,0.000043905773,0.0010187421,5.203046e-7,0.000032012358,0.00035755898],"genre_scores_gemma":[0.9994299,5.9896834e-8,0.00012458411,0.00019158248,0.00007925894,0.00009484522,0.000002234173,0.000010421312,0.00006712512],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994089,0.000023689541,0.00018731477,0.00015519066,0.00011161784,0.00011330817],"domain_scores_gemma":[0.9993584,0.00025269843,0.00013420908,0.00016159104,0.00008984247,0.000003232149],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00031616128,0.00008550693,0.00014226531,0.000117195625,0.00010684295,0.000031268944,0.000105731415,0.000023876799,0.000017878205],"category_scores_gemma":[0.00039213515,0.00005774455,0.000064904736,0.00041339683,0.000027410304,0.00037053623,0.000053615426,0.000043316068,0.00000453612],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013273516,0.00039449948,0.04147165,0.000034445995,0.000033002325,3.608783e-7,0.00034625203,0.95293105,0.00021190784,0.0037500553,0.000002063054,0.0006919843],"study_design_scores_gemma":[0.01112371,0.00012321827,0.2958824,0.00013394204,0.00040185108,1.033529e-7,0.006576276,0.5667465,0.0016584503,0.11639296,0.0005290683,0.0004315184],"about_ca_topic_score_codex":0.00039115906,"about_ca_topic_score_gemma":0.002327539,"teacher_disagreement_score":0.38618454,"about_ca_system_score_codex":0.000034451296,"about_ca_system_score_gemma":0.0000034934765,"threshold_uncertainty_score":0.23547544},"labels":[],"label_agreement":null},{"id":"W2158556837","doi":"10.1287/opre.1040.0116","title":"An Invariance Relation and a Unified Method to Derive Stationary Queue-Length Distributions","year":2004,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Korea Advanced Institute of Science and Technology; Korea Institute of Science and Technology","keywords":"Queue; Markovian arrival process; Queueing theory; Relation (database); Computer science; Fork–join queue; Discrete time and continuous time; Mathematics; Bulk queue; Mathematical optimization; Applied mathematics; Simple (philosophy); Queue management system; Statistics; Computer network","score_opus":0.05679358312859142,"score_gpt":0.39521664414088753,"score_spread":0.33842306101229613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158556837","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18644786,0.000026590173,0.804754,0.0062993118,0.000026114627,0.0004347108,0.000020535379,0.00008045012,0.0019104248],"genre_scores_gemma":[0.91404194,0.000008771149,0.08457885,0.00035062188,0.00021239131,0.00013158633,0.0003207245,0.000017157172,0.00033793715],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987536,0.00013898184,0.00019667452,0.00034757203,0.00031139312,0.0002517859],"domain_scores_gemma":[0.9988055,0.00012405418,0.00002280866,0.00031151113,0.0006966175,0.00003946876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015048649,0.00009643002,0.00010741551,0.0004452111,0.0012009259,0.00046483372,0.00018095529,0.000050952043,0.00012803815],"category_scores_gemma":[0.0008019758,0.0000976295,0.00002101314,0.001620752,0.00008519021,0.0020659098,0.00011889215,0.00023100102,0.00022241521],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000026665934,0.00007611884,0.00013816393,0.000009477516,0.000014606412,0.0000034601742,0.00021737542,0.22944649,0.009462875,0.7574368,0.000055130753,0.0031128107],"study_design_scores_gemma":[0.0017703096,0.00015876342,0.019292045,0.00014197666,0.00011344236,0.000011031564,0.005040996,0.48974836,0.0022732716,0.4465755,0.03398512,0.000889187],"about_ca_topic_score_codex":0.0011777942,"about_ca_topic_score_gemma":0.0017285327,"teacher_disagreement_score":0.7275941,"about_ca_system_score_codex":0.00012824209,"about_ca_system_score_gemma":0.00009274895,"threshold_uncertainty_score":0.92366725},"labels":[],"label_agreement":null},{"id":"W2158888309","doi":"10.48550/arxiv.1006.4387","title":"A note on the stability of multiclass Markovian queueing networks","year":2010,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Queueing theory; Markov chain; Computer science; Stability (learning theory); Scheduling (production processes); Markov process; Class (philosophy); Mathematical optimization; Mathematics; Discrete mathematics; Computer network; Statistics; Artificial intelligence","score_opus":0.04397707401197128,"score_gpt":0.18331153141441692,"score_spread":0.13933445740244563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158888309","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9163097,0.000010216727,0.0739186,0.0002742482,0.0004702665,0.00039292127,0.0000068555437,0.00015059605,0.008466566],"genre_scores_gemma":[0.99889284,0.000012637003,0.000093728784,0.00036428607,0.0003799736,0.0000013400362,0.000017876608,0.0000360279,0.00020125721],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984434,0.00009426764,0.00027933062,0.0007530487,0.00010224779,0.00032768972],"domain_scores_gemma":[0.99716514,0.00048853864,0.0006914486,0.0013748127,0.00025767737,0.000022362025],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009388078,0.00034205508,0.0004202944,0.0002486518,0.00024842055,0.00009237991,0.001031263,0.00032580932,0.00035537427],"category_scores_gemma":[0.00042537402,0.00030013098,0.00036327468,0.000669366,0.00031318713,0.0003518414,0.0012871057,0.0012475481,0.000057343466],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00027406993,0.00014115787,0.007790609,0.00019057437,0.00014952928,0.00004621172,0.00005317479,0.7359381,0.00019604767,0.25455397,0.00006549989,0.0006010697],"study_design_scores_gemma":[0.0002711134,0.0000061314636,0.0010148461,0.00014197103,0.0003449591,1.5030612e-7,0.00019224503,0.9384742,0.00012193864,0.058206752,0.0008433435,0.00038234927],"about_ca_topic_score_codex":0.00065253326,"about_ca_topic_score_gemma":0.00078616623,"teacher_disagreement_score":0.20253612,"about_ca_system_score_codex":0.00010147242,"about_ca_system_score_gemma":0.00003481619,"threshold_uncertainty_score":0.9999451},"labels":[],"label_agreement":null},{"id":"W2158995607","doi":"10.1111/poms.12508","title":"Operational Impact of Service Innovations in Multi‐Step Service Systems","year":2015,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":22,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"National Natural Science Foundation of China","keywords":"Service (business); Stylized fact; Service system; Service design; Service delivery framework; Computer science; Service level objective; Service provider; Competition (biology); Service quality; Process management; Process (computing); Service guarantee; Business; Marketing; Economics","score_opus":0.04360144330017628,"score_gpt":0.2925958041129105,"score_spread":0.24899436081273418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2158995607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95196277,0.00019452255,0.028624674,0.011428911,0.0007798871,0.0015789738,0.000009634454,0.00017134105,0.0052493145],"genre_scores_gemma":[0.99471545,0.000010545384,0.003163928,0.0008107434,0.00023467894,0.00011264474,0.00011101174,0.000015270054,0.0008257522],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989733,0.000025844518,0.00038130695,0.0002946157,0.00019189742,0.00013303086],"domain_scores_gemma":[0.99879193,0.0000064615656,0.000099013465,0.00025667864,0.00083112996,0.000014789413],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006094903,0.00013658739,0.00016518844,0.00058100774,0.00015055775,0.0001805031,0.00011790239,0.000030501766,0.00003925548],"category_scores_gemma":[0.000120294084,0.0001259378,0.00002574968,0.0020756726,0.000022820539,0.0014348706,0.00012315529,0.00007510209,0.00006252951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030321436,0.00021718084,0.00567476,0.00017654616,0.00008482087,0.0000012390684,0.00022909322,0.9052004,0.00026344162,0.086699955,0.0008310725,0.0005911252],"study_design_scores_gemma":[0.0012171034,0.000017531447,0.018266562,0.00012783904,0.00013286194,0.0000052791916,0.0042245477,0.96837765,0.00003795786,0.00084896723,0.0063636955,0.0003799998],"about_ca_topic_score_codex":0.0027451133,"about_ca_topic_score_gemma":0.0026506078,"teacher_disagreement_score":0.08585099,"about_ca_system_score_codex":0.00009047818,"about_ca_system_score_gemma":0.000027909233,"threshold_uncertainty_score":0.51355946},"labels":[],"label_agreement":null},{"id":"W2159266597","doi":"10.1287/ijoc.15.4.412.24889","title":"The Use of Eigenvalues for Finding Equilibrium Probabilities of Certain Markovian Two-Dimensional Queueing Problems","year":2003,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Eigenvalues and eigenvectors; Mathematics; Queueing theory; Interval (graph theory); Binary number; Applied mathematics; Matrix (chemical analysis); Markov process; Boundary (topology); Extension (predicate logic); Mathematical optimization; Combinatorics; Computer science; Mathematical analysis; Statistics; Arithmetic; Physics","score_opus":0.04761154075326107,"score_gpt":0.26872835384338367,"score_spread":0.2211168130901226,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159266597","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9876051,0.00008048912,0.010525303,0.00023614979,0.0003970815,0.00036997054,0.0000017408427,0.000039068535,0.0007450819],"genre_scores_gemma":[0.9918815,0.0000019501165,0.007279347,0.00034802334,0.00031777663,0.0000038199755,0.0000032737732,0.000028592489,0.00013571716],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980197,0.000041525742,0.0009861594,0.00015529775,0.00038641677,0.0004109191],"domain_scores_gemma":[0.9964808,0.0013433816,0.0014236569,0.00021985134,0.000511572,0.000020697136],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0025427227,0.00020173859,0.0003386025,0.0003034766,0.0005773729,0.00030673924,0.0002804458,0.00004592328,0.000014524702],"category_scores_gemma":[0.0020573658,0.0001341122,0.00026821753,0.00039167795,0.00013540017,0.0013275342,0.00011359772,0.00024787357,0.0000025206725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014725905,0.000042381238,0.003926879,0.00023353053,0.0001323807,0.0000019140007,0.00019910355,0.90449685,0.0007669253,0.07609946,0.00014436238,0.013808961],"study_design_scores_gemma":[0.0023837031,0.00021475207,0.0006232845,0.0020699252,0.00022133984,0.000058308848,0.0013761708,0.75638694,0.0034453191,0.19699878,0.035430223,0.000791265],"about_ca_topic_score_codex":0.000028222545,"about_ca_topic_score_gemma":0.000010526951,"teacher_disagreement_score":0.14810991,"about_ca_system_score_codex":0.00006389152,"about_ca_system_score_gemma":0.000049418522,"threshold_uncertainty_score":0.54689366},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.0690515575263588,"score_gpt":0.2778830845658288,"score_spread":0.20883152703946997,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159279836","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9680991,0.000086576765,0.00055034447,0.005534367,0.00003701316,0.00064734556,0.000003819154,0.000093493094,0.024947895],"genre_scores_gemma":[0.9977866,0.000036265505,0.00014985567,0.0017274313,0.00021511826,0.00003591723,0.0000060148095,0.000017666067,0.000025161404],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99847984,0.000058353493,0.00045663252,0.0003837729,0.00029321306,0.0003281888],"domain_scores_gemma":[0.997875,0.00045177081,0.00032748023,0.0010886636,0.00023964066,0.000017487286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038636336,0.00021883202,0.0003290424,0.000049081325,0.00034889247,0.00010678722,0.0005288968,0.00006193794,0.00022855261],"category_scores_gemma":[0.00043651197,0.00012571913,0.00012052613,0.0006078009,0.0007243672,0.00033173623,0.00035311433,0.0002377132,0.000029450259],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0016513012,0.0008684995,0.052186847,0.00049865333,0.00034006155,0.0000029848086,0.00086608494,0.008002958,0.0027442428,0.8782615,0.0012649316,0.053311925],"study_design_scores_gemma":[0.00022227807,0.000015896156,0.022010345,0.000016331614,0.0001469197,0.0000011685959,0.0005419759,0.003371194,0.001175939,0.9558654,0.016358193,0.0002743705],"about_ca_topic_score_codex":0.00011196902,"about_ca_topic_score_gemma":0.0001375887,"teacher_disagreement_score":0.07760388,"about_ca_system_score_codex":0.000014162891,"about_ca_system_score_gemma":0.000018202476,"threshold_uncertainty_score":0.5126677},"labels":[],"label_agreement":null},{"id":"W2159775981","doi":"10.1504/ijor.2008.016159","title":"Optimal management of cross-trained workers, using Markov decision approach","year":2007,"lang":"en","type":"article","venue":"International Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Heuristics; Computer science; Markov decision process; Queue; Mathematical optimization; Linear programming; Markov chain; Operations research; Queueing theory; Markov process; Operations management; Mathematics; Algorithm; Machine learning; Statistics; Economics; Computer network","score_opus":0.08180872814932913,"score_gpt":0.43443007874024187,"score_spread":0.3526213505909127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2159775981","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7511286,0.000107728105,0.23728946,0.00024753445,0.00039304013,0.00012745702,0.0000032784658,0.000007497757,0.010695382],"genre_scores_gemma":[0.90475726,0.000017826993,0.09343371,0.00009019461,0.0012607032,0.0000017532548,0.000016645106,0.000018957811,0.00040297647],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9960819,0.00003754509,0.00083964766,0.00020485635,0.002554863,0.00028122574],"domain_scores_gemma":[0.99456596,0.00034129812,0.00039792043,0.00015564002,0.0045069684,0.000032189895],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0069797835,0.00012520107,0.00020385385,0.0012509442,0.00018792484,0.00038761093,0.00090877723,0.00006193395,0.00045692982],"category_scores_gemma":[0.00058535195,0.0001097994,0.00017634228,0.0007248549,0.00021239746,0.0016866862,0.00033925314,0.00035123734,0.000021948184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006513291,0.0009761057,0.02981534,0.00012699334,0.0014931508,0.0006755437,0.00012395762,0.63662195,0.0071495418,0.2534195,0.0014409692,0.061643686],"study_design_scores_gemma":[0.01651296,0.0003121335,0.21406102,0.003090418,0.00049323594,0.00079444185,0.008528643,0.58051044,0.0059990794,0.10540995,0.062421963,0.001865721],"about_ca_topic_score_codex":0.000040988532,"about_ca_topic_score_gemma":0.000003866847,"teacher_disagreement_score":0.18424568,"about_ca_system_score_codex":0.00022825313,"about_ca_system_score_gemma":0.000086299966,"threshold_uncertainty_score":0.50030607},"labels":[],"label_agreement":null},{"id":"W2160325740","doi":"10.3138/infor.51.3.92","title":"Logarithmic Asymptotics for the<i>GI</i>/<i>G</i>/<i>1</i>-type Markov Chains and their Applications to the<i>BMAP</i>/<i>G</i>/<i>1</i>Queue with Vacations","year":2013,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Markov chain; Logarithm; Mathematics; Distribution (mathematics); Combinatorics; Queue; Discrete mathematics; Mathematical analysis; Computer science; Statistics","score_opus":0.03213181178776388,"score_gpt":0.29267630715211285,"score_spread":0.260544495364349,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160325740","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.035463735,0.0016578254,0.8238157,0.0829382,0.0008371026,0.03002714,0.0003392324,0.00046108532,0.02445998],"genre_scores_gemma":[0.9769072,0.00012808316,0.0012509417,0.01050693,0.0013253328,0.0071901963,0.0003358749,0.000043605898,0.0023118681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99798775,0.000048957267,0.00061154197,0.00026440536,0.00061550294,0.00047184803],"domain_scores_gemma":[0.9951726,0.0011145589,0.00021372526,0.0005277538,0.0029011194,0.00007023954],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0023045985,0.00025987267,0.00024584826,0.00045261718,0.0023764512,0.0026039898,0.0005016178,0.000093348506,0.000037532882],"category_scores_gemma":[0.00045463143,0.00014518817,0.00005210518,0.0013098412,0.00027968021,0.0037753729,0.00027252507,0.00031714473,0.00035875366],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013486475,0.000043159755,0.00072882226,0.0003640183,0.00018554916,1.8419335e-7,0.001214393,0.025412707,0.0001488012,0.91996896,0.028023003,0.023775525],"study_design_scores_gemma":[0.00045835355,0.00005062126,0.0007571056,0.00005427096,0.000031061307,0.000014557463,0.0040819724,0.12240955,0.000018233088,0.0016842572,0.87018496,0.00025504825],"about_ca_topic_score_codex":0.00070548226,"about_ca_topic_score_gemma":0.000179877,"teacher_disagreement_score":0.94144344,"about_ca_system_score_codex":0.00006870555,"about_ca_system_score_gemma":0.00013575036,"threshold_uncertainty_score":0.99892235},"labels":[],"label_agreement":null},{"id":"W2160386020","doi":"10.1109/glocom.1989.64094","title":"A discrete-time single server queue with a two-level modulated input and its applications","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Queueing theory; Poisson distribution; Discrete time and continuous time; Asynchronous Transfer Mode; Markov process; Queue; Real-time computing; Markov chain; Algorithm; Unimodality; Asynchronous communication; Computer network; Mathematics; Statistics","score_opus":0.015406102255668403,"score_gpt":0.22135251930010308,"score_spread":0.20594641704443467,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2160386020","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7806667,0.000134829,0.11590878,0.00079735665,0.000027963419,0.0008431196,0.0000060538746,0.0006017324,0.10101343],"genre_scores_gemma":[0.9901696,0.000001285244,0.0026292831,0.000719595,0.00007863849,0.00005026295,0.000022528233,0.000031488293,0.006297316],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991653,0.000014622218,0.0001633944,0.0003169166,0.00012955414,0.0002101898],"domain_scores_gemma":[0.9994368,0.000039933842,0.00011348219,0.00025454749,0.00013772195,0.000017516848],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018083148,0.00016750797,0.00017911993,0.00014082777,0.00018326408,0.00014461449,0.00011004422,0.00003661415,0.00043449725],"category_scores_gemma":[0.00006896798,0.00013167254,0.000034583132,0.00070958276,0.00004229685,0.0008956363,0.000061856175,0.00007242484,0.0002952383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000109629495,0.00036542915,0.0029666503,0.00017942343,0.0003372397,0.000015462401,0.00007757374,0.020966286,0.023043115,0.9487718,0.00025263042,0.0029147908],"study_design_scores_gemma":[0.008575198,0.00011878406,0.0034331088,0.00035951618,0.00198186,0.00006542177,0.0009552233,0.50777733,0.01278083,0.30646,0.15303992,0.00445282],"about_ca_topic_score_codex":0.0000627477,"about_ca_topic_score_gemma":0.0001318461,"teacher_disagreement_score":0.64231175,"about_ca_system_score_codex":0.000019763675,"about_ca_system_score_gemma":0.00000850377,"threshold_uncertainty_score":0.536945},"labels":[],"label_agreement":null},{"id":"W2161466748","doi":"10.1109/glocom.1988.26128","title":"The performance of interconnected ring networks with priority","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Ring (chemistry); Class (philosophy); Queue; Computer science; Service (business); Computer network; Independence (probability theory); Queueing theory; Reduced ring; Connection (principal bundle); Discrete mathematics; Topology (electrical circuits); Mathematics; Combinatorics; Principal ideal ring; Artificial intelligence; Commutative ring; Geometry","score_opus":0.006316995046974782,"score_gpt":0.19659202412511695,"score_spread":0.19027502907814217,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161466748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95039725,0.00004131583,0.014269366,0.000054232707,0.00007038952,0.000074585034,3.173363e-8,0.0000702113,0.03502261],"genre_scores_gemma":[0.9988368,0.000009441465,0.00044296694,0.00013816616,0.000078395235,0.0000038961107,7.616325e-7,0.000010007478,0.0004795233],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9994773,0.000011542805,0.00014649497,0.00011355835,0.00009093334,0.00016012411],"domain_scores_gemma":[0.99944705,0.00008308674,0.00013459969,0.00022212035,0.00010910398,0.0000040345953],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004089118,0.00008358005,0.00010727565,0.00004622881,0.00019598221,0.000057373825,0.00014774756,0.000019547531,0.00008486137],"category_scores_gemma":[0.00010504028,0.00004785217,0.000032079126,0.00042944474,0.00006998037,0.00046995276,0.00004257657,0.00008985905,0.000013987154],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022646078,0.000063799875,0.11052373,0.000098845754,0.00017395848,0.0000030385913,0.00004096925,0.11956028,0.00031185854,0.75796556,0.00013009003,0.010901408],"study_design_scores_gemma":[0.0013708384,0.000063980784,0.013969015,0.00021801825,0.00030186423,0.0000063563457,0.0012297728,0.92149514,0.0032755209,0.0074764425,0.0498561,0.00073695206],"about_ca_topic_score_codex":0.000024279085,"about_ca_topic_score_gemma":0.00011212597,"teacher_disagreement_score":0.80193484,"about_ca_system_score_codex":0.0000094515135,"about_ca_system_score_gemma":0.0000048739316,"threshold_uncertainty_score":0.19513547},"labels":[],"label_agreement":null},{"id":"W2161756652","doi":"10.1109/icc.1998.682911","title":"Performance analysis of OBP based multimedia multibeam satellite networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Jitter; Computer science; Real-time computing; Frame (networking); Computer network; Markov process; Markov chain; Poisson distribution; Telecommunications","score_opus":0.01479664788927449,"score_gpt":0.20852946313453102,"score_spread":0.19373281524525654,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2161756652","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84452915,0.0004836225,0.07044489,0.00032611855,0.00029951587,0.00034657557,0.0000040899868,0.0005693594,0.08299669],"genre_scores_gemma":[0.99460226,0.00005164369,0.0028550718,0.0008871917,0.0002095229,0.0000078094845,0.0000511336,0.000022193759,0.0013131809],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987247,0.000014629406,0.00041119827,0.0003093631,0.00023961726,0.0003004646],"domain_scores_gemma":[0.99888605,0.00014742643,0.00030808884,0.00046889842,0.00017320286,0.000016329042],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000345267,0.00019759283,0.0004299552,0.00084228197,0.00010966403,0.000052590916,0.000278098,0.00007285459,0.0041563287],"category_scores_gemma":[0.00010347321,0.00017340943,0.0002994858,0.0032214336,0.00009002886,0.00071664975,0.00007220435,0.00011203241,0.00022507647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000036567424,0.00015739334,0.11633639,0.000055799086,0.0006759563,0.0000032929313,0.00002647032,0.82024866,0.00018886871,0.00060721365,0.00025804725,0.061405357],"study_design_scores_gemma":[0.00028928896,0.0000043871487,0.01651807,0.000014210866,0.0013559423,5.1659043e-8,0.000029695208,0.97819424,0.00009681035,0.000032622655,0.0032537717,0.00021093362],"about_ca_topic_score_codex":0.000070953196,"about_ca_topic_score_gemma":0.0000729095,"teacher_disagreement_score":0.15794557,"about_ca_system_score_codex":0.00002006639,"about_ca_system_score_gemma":0.0000019505092,"threshold_uncertainty_score":0.996754},"labels":[],"label_agreement":null},{"id":"W2163749311","doi":"10.1002/nla.811","title":"A Markov‐modulated fluid flow queueing model under <i>D</i>‐policy","year":2011,"lang":"en","type":"article","venue":"Numerical Linear Algebra with Applications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Idle; Markov chain; Queueing theory; Markov process; Fluid queue; Mathematical optimization; Mathematics; Flow (mathematics); Computer science; Applied mathematics; Statistics; Operating system","score_opus":0.017080964280070325,"score_gpt":0.23537497000156704,"score_spread":0.2182940057214967,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163749311","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0073834085,0.0000293686,0.9677684,0.0008619266,0.000017961687,0.0004719717,0.000010134078,0.00062681624,0.022830041],"genre_scores_gemma":[0.9169233,0.0000043856026,0.0769925,0.0040732957,0.00071562926,0.00037590796,0.00013712213,0.000096247415,0.000681633],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998431,0.000015141139,0.00034725366,0.0005267732,0.00025597625,0.00042380166],"domain_scores_gemma":[0.9987833,0.0000549152,0.00020495364,0.00066814513,0.00023251494,0.000056180095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001584591,0.00028384823,0.00029600973,0.00027820063,0.00034788792,0.00007014702,0.00041007652,0.000092917115,0.00031272156],"category_scores_gemma":[0.00007628465,0.00024395101,0.00010474525,0.0021222744,0.00011530646,0.0006561439,0.00014935604,0.00022616798,0.0007085124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026934777,0.00065066,0.0006603024,0.00008741179,0.0002739322,0.0000070414235,0.00015724315,0.22411779,0.0013859307,0.76028913,0.0009150389,0.011186186],"study_design_scores_gemma":[0.00032955033,0.000010838417,0.0003098279,0.00001556929,0.00016332325,0.0000032569938,0.000050295694,0.8980036,0.00011973787,0.088413574,0.012183659,0.00039680838],"about_ca_topic_score_codex":0.0002851071,"about_ca_topic_score_gemma":0.000022272077,"teacher_disagreement_score":0.9095399,"about_ca_system_score_codex":0.000056247114,"about_ca_system_score_gemma":0.00006497523,"threshold_uncertainty_score":0.99480337},"labels":[],"label_agreement":null},{"id":"W2163870399","doi":"10.1109/cdc.1989.70303","title":"Control of multi-service loss networks","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"Natural Sciences and Engineering Research Council of Canada; Politechnika Warszawska","keywords":"Routing (electronic design automation); Computer science; Service (business); Class (philosophy); Mathematical optimization; Function (biology); State (computer science); Shadow price; Set (abstract data type); Independence (probability theory); Bellman equation; Markov process; Path (computing); Markov decision process; Computer network; Mathematics; Artificial intelligence; Algorithm; Economics","score_opus":0.012312555985263604,"score_gpt":0.22585259329675864,"score_spread":0.21354003731149504,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163870399","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04644124,0.0001162971,0.9218603,0.00034933287,0.00018278412,0.00016439719,5.925311e-7,0.00015425449,0.030730812],"genre_scores_gemma":[0.9945332,0.0000016630012,0.001110439,0.0037437563,0.00013028034,0.000004647903,0.0000029500734,0.000014862845,0.00045820695],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993728,0.000014373946,0.00019996952,0.00014946455,0.00008996049,0.00017345653],"domain_scores_gemma":[0.9993759,0.000060709644,0.00015575928,0.00022464331,0.00017654515,0.000006475656],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003266007,0.000101652644,0.00018665132,0.000086678985,0.000059990678,0.000030090709,0.0001433706,0.000040427123,0.0007787245],"category_scores_gemma":[0.00014233784,0.000087691005,0.000070500384,0.0005172289,0.000029350453,0.00041681514,0.000027823178,0.000063030035,0.00014163944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000053338706,0.00015117605,0.019911384,0.000077998484,0.00012522493,0.0000075804446,0.0000108869535,0.24665134,0.0004620631,0.7309772,0.00027387167,0.0012979502],"study_design_scores_gemma":[0.0025775596,0.0000050138465,0.0011567295,0.00003352275,0.00028291135,0.000001477175,0.00020531629,0.9272232,0.00029710642,0.016209269,0.051593147,0.00041476166],"about_ca_topic_score_codex":0.00012664565,"about_ca_topic_score_gemma":0.00013422495,"teacher_disagreement_score":0.948092,"about_ca_system_score_codex":0.00000689356,"about_ca_system_score_gemma":0.0000037884606,"threshold_uncertainty_score":0.85264874},"labels":[],"label_agreement":null},{"id":"W2163977791","doi":"10.1109/ccece.2005.1557297","title":"Quality of service for digital video broadc","year":2006,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Computer network; Quality of service; Network packet; Broadcasting (networking); Telecommunications; Mobile QoS; Digital Video Broadcasting; Service provider; Bandwidth (computing); Service (business); The Internet; Business; World Wide Web","score_opus":0.019868477203852482,"score_gpt":0.26480191488976534,"score_spread":0.24493343768591286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2163977791","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6633389,0.00003045736,0.13075474,0.0017644175,0.00010837189,0.00029208203,0.000016996164,0.00028443593,0.20340958],"genre_scores_gemma":[0.995324,1.0006662e-7,0.0009085855,0.0011498628,0.00035842136,0.00000801991,0.00005799695,0.00001288022,0.0021801204],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933344,0.0000029961516,0.00027313427,0.00015043239,0.00010963826,0.00013034052],"domain_scores_gemma":[0.9992904,0.00010873248,0.00019236396,0.00018932954,0.00021610645,0.000003087435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002433961,0.000083859406,0.0001690564,0.00008016917,0.000053509517,0.00008253164,0.00014167171,0.000026479554,0.00015166221],"category_scores_gemma":[0.00012904803,0.0000741957,0.00010245336,0.000345843,0.00002111626,0.0010359787,0.00006579737,0.000023335388,0.000079520236],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012727513,0.00014645282,0.010994234,0.0004081877,0.000045908993,4.1848716e-7,0.0000071029235,0.0036740238,0.0027315218,0.9731815,0.0033716848,0.0053116973],"study_design_scores_gemma":[0.0011389733,0.000006799211,0.008383485,0.000028290286,0.00009490896,2.5559459e-7,0.00028149792,0.0142961675,0.0012427993,0.8703201,0.10375681,0.00044993742],"about_ca_topic_score_codex":0.0008509809,"about_ca_topic_score_gemma":0.00040249745,"teacher_disagreement_score":0.33198512,"about_ca_system_score_codex":0.000008181891,"about_ca_system_score_gemma":0.000003627167,"threshold_uncertainty_score":0.30256128},"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,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.01926511805754496,"score_gpt":0.22213713493765194,"score_spread":0.20287201688010698,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165180682","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8277125,0.00048374708,0.1405668,0.0018059221,0.0015188571,0.0022386545,0.0000091353995,0.0007984391,0.024865963],"genre_scores_gemma":[0.98540914,0.000036844416,0.008093687,0.0045629013,0.00073852553,0.00024411011,0.00010304391,0.00009021487,0.00072151306],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9977406,0.00006669698,0.00045753492,0.0005920239,0.000344743,0.0007983739],"domain_scores_gemma":[0.9989141,0.00011741923,0.00016991489,0.00063986244,0.000089876004,0.00006881285],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00066710106,0.0004826188,0.00038740443,0.00048483073,0.0008131453,0.0006582804,0.00041258853,0.00008701599,0.00007071563],"category_scores_gemma":[0.000040513994,0.0004601196,0.000112911126,0.00042410646,0.000036661484,0.0035682286,0.00092407403,0.00022829478,0.00024717615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000119608696,0.0011004712,0.0036568886,0.00981108,0.0015593354,0.0001169295,0.0013684637,0.6605696,0.0004408083,0.25067058,0.0018271295,0.06875907],"study_design_scores_gemma":[0.0031605586,0.00003256301,0.011695634,0.00092211977,0.0018679091,0.000021575022,0.001083697,0.90459216,0.0033463705,0.02048517,0.05049125,0.002301022],"about_ca_topic_score_codex":0.0004153796,"about_ca_topic_score_gemma":0.00024456525,"teacher_disagreement_score":0.2440225,"about_ca_system_score_codex":0.0001023519,"about_ca_system_score_gemma":0.000003815262,"threshold_uncertainty_score":0.99978507},"labels":[],"label_agreement":null},{"id":"W2165797884","doi":"10.1287/msom.2013.0434","title":"Pricing Time-Sensitive Services Based on Realized Performance","year":2013,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Revenue; Payment; Stochastic game; Microeconomics; Valuation (finance); Revenue management; Incentive; Pricing schedule; Rational pricing; Business; Price discrimination; Economics; Econometrics; Capital asset pricing model; Finance","score_opus":0.0060276959062552345,"score_gpt":0.19616009848364357,"score_spread":0.19013240257738834,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2165797884","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87078506,0.0000051103198,0.0037152811,0.0034765191,0.0002006088,0.0013695885,0.0000027078802,0.0006937949,0.119751334],"genre_scores_gemma":[0.9740488,0.000008822616,0.0031424693,0.019476108,0.00032945836,0.00024140577,0.00019800135,0.00007090742,0.002484047],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980353,0.000034532168,0.00040944625,0.000614837,0.0004339159,0.00047198564],"domain_scores_gemma":[0.9988017,0.00006137251,0.0001630575,0.00077711255,0.0001664996,0.000030259098],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0003399125,0.0003958475,0.0002983332,0.0005848931,0.00077627134,0.0008115634,0.00048637693,0.000062194194,0.0015486579],"category_scores_gemma":[0.000010055894,0.00036719054,0.000097436714,0.0005976325,0.000025992082,0.0019705768,0.00030660626,0.00018047389,0.007405854],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006125604,0.00017551903,0.00011076464,0.000791542,0.00014013342,0.00001474803,0.00011376329,0.97743094,0.00035823762,0.002498694,0.0002883366,0.018016044],"study_design_scores_gemma":[0.00076683855,0.000017503455,0.0069167,0.00026578526,0.00020884148,7.1634537e-7,0.00050102273,0.9716442,0.0026233217,0.00054137944,0.015930312,0.0005833629],"about_ca_topic_score_codex":0.001088463,"about_ca_topic_score_gemma":0.00023697807,"teacher_disagreement_score":0.11726729,"about_ca_system_score_codex":0.000116859424,"about_ca_system_score_gemma":0.0000067876394,"threshold_uncertainty_score":0.999878},"labels":[],"label_agreement":null},{"id":"W2166422211","doi":"10.1287/mnsc.1080.0918","title":"The Value of Partial Resource Pooling: Should a Service Network Be Integrated or Product-Focused?","year":2008,"lang":"en","type":"article","venue":"Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Reliability (semiconductor); Service (business); Pooling; Variance (accounting); Quality of service; Service quality; Product (mathematics); Network planning and design; Computer science; Value (mathematics); Quality (philosophy); Resource (disambiguation); Reliability engineering; Operations research; Computer network; Business; Engineering; Mathematics; Marketing; Artificial intelligence","score_opus":0.04079289491148329,"score_gpt":0.25981892130183687,"score_spread":0.21902602639035357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166422211","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77822226,0.0004610885,0.02922087,0.03727525,0.002001451,0.0029975537,0.0000049865666,0.0012433568,0.14857319],"genre_scores_gemma":[0.98942316,0.000032110107,0.0019865432,0.0045663756,0.0006203307,0.000041821386,0.0000060683633,0.000028705103,0.0032948975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99739176,0.00003711339,0.00043550794,0.0006155078,0.00087133516,0.0006487501],"domain_scores_gemma":[0.9983384,0.000104978295,0.00037485568,0.0009070313,0.00024933156,0.000025419726],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0024985988,0.00022338043,0.00023509511,0.0002621859,0.0015926237,0.00022975846,0.0015975292,0.000026514377,0.00007411106],"category_scores_gemma":[0.00039247985,0.00014356412,0.000076594886,0.005995517,0.00076393667,0.0010255326,0.00090343866,0.00016562545,0.000054515807],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00096189126,0.00029808903,0.0069858553,0.00034569306,0.00021129893,0.0001439994,0.00056846737,0.3584892,0.0006682811,0.57937956,0.028040664,0.023907013],"study_design_scores_gemma":[0.0005356438,0.000022915858,0.002957422,0.00012556472,0.0002289055,0.000005119639,0.0010250334,0.121088214,0.0006106823,0.0062864833,0.86663467,0.00047934888],"about_ca_topic_score_codex":0.00016897498,"about_ca_topic_score_gemma":0.00007515672,"teacher_disagreement_score":0.838594,"about_ca_system_score_codex":0.000053997494,"about_ca_system_score_gemma":0.000038543247,"threshold_uncertainty_score":0.99970716},"labels":[],"label_agreement":null},{"id":"W2166999867","doi":"10.1051/ro:2003002","title":"Optimal QoS control of interacting service stations","year":2002,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa; Carleton University","funders":"","keywords":"Queue; Network packet; Quality of service; Computer science; Monotonic function; Computer network; Queueing theory; Queue management system; Controller (irrigation); Mathematical optimization; Real-time computing; Mathematics","score_opus":0.07844059589662435,"score_gpt":0.35818244647099423,"score_spread":0.2797418505743699,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2166999867","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8847348,0.00013963442,0.07482257,0.013614912,0.00024264239,0.0008712669,0.000029112423,0.00018345511,0.025361577],"genre_scores_gemma":[0.9955031,0.000006301661,0.0016290934,0.00040234244,0.00047529364,0.0000703893,0.000030332867,0.00002304263,0.0018600965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998616,0.00006905572,0.00033204225,0.00024113091,0.00043031372,0.0003114736],"domain_scores_gemma":[0.9979133,0.00039423065,0.000055799064,0.0003461107,0.0012729114,0.000017642196],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009638152,0.00010415118,0.00017440344,0.0005985419,0.00065210793,0.00027765107,0.00031619112,0.00004196559,0.002968128],"category_scores_gemma":[0.0014249341,0.00010131348,0.00006185538,0.0016276236,0.00008833048,0.0015754136,0.00013407352,0.00031111678,0.000986677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050468527,0.00033744393,0.0005822683,0.00011394501,0.00012508892,0.000007380489,0.00081687904,0.9032131,0.015198234,0.07274068,0.0033578246,0.0034567288],"study_design_scores_gemma":[0.0005258175,0.000012528639,0.00013642017,0.00004424702,0.000035191668,0.0000010638443,0.0016250955,0.9860061,0.00043563847,0.00035493908,0.010691224,0.00013173251],"about_ca_topic_score_codex":0.0005798344,"about_ca_topic_score_gemma":0.0006319783,"teacher_disagreement_score":0.11076828,"about_ca_system_score_codex":0.00004858419,"about_ca_system_score_gemma":0.000019745916,"threshold_uncertainty_score":0.99979115},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.014641885972481403,"score_gpt":0.23815020435338854,"score_spread":0.22350831838090715,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168550848","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9622473,0.00028416823,0.0046085585,0.01146436,0.0026010864,0.00009544369,3.3056904e-7,0.00004642184,0.018652294],"genre_scores_gemma":[0.9927213,0.00001265965,0.0005650842,0.0021961234,0.0036612223,4.1171302e-7,2.1037725e-7,0.00001623685,0.0008267566],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917597,0.00004135603,0.00029632737,0.00007668137,0.00025633926,0.00015331806],"domain_scores_gemma":[0.9983898,0.00015049442,0.00065693056,0.00063264056,0.00016122163,0.000008925922],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001309818,0.00009391169,0.00017261785,0.00014909405,0.00017267028,0.000089917805,0.0015127327,0.000034204037,0.00032897553],"category_scores_gemma":[0.003965608,0.000057367517,0.00026082745,0.0004139896,0.000050984025,0.0009463358,0.00053656934,0.00022980473,0.00007608703],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0050000018,0.0006414268,0.07323597,0.00016310884,0.0025504935,0.000646126,0.0008750372,0.08804347,0.021604253,0.62654716,0.077295125,0.1033978],"study_design_scores_gemma":[0.0006818887,0.000008431133,0.0016958436,0.00009168023,0.00035824731,0.000070750495,0.0003912318,0.0005969699,0.00016921539,0.85315925,0.14262849,0.00014801354],"about_ca_topic_score_codex":0.000010412826,"about_ca_topic_score_gemma":0.0000070367805,"teacher_disagreement_score":0.22661206,"about_ca_system_score_codex":0.000037893842,"about_ca_system_score_gemma":0.0000152576595,"threshold_uncertainty_score":0.47474894},"labels":[],"label_agreement":null},{"id":"W2168928846","doi":"10.1017/s0269964810000112","title":"ON THE PROBABILITY DISTRIBUTION OF JOIN QUEUE LENGTH IN A FORK-JOIN MODEL","year":2010,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Communications Research Centre Canada","funders":"","keywords":"Fork–join queue; Join (topology); Mathematics; Queue; Exponential distribution; Bulk queue; Generating function; Joint probability distribution; Discrete mathematics; Computer science; Combinatorics; Queueing theory; Queue management system; Statistics","score_opus":0.01633373002389637,"score_gpt":0.217235582362505,"score_spread":0.20090185233860863,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2168928846","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99628925,0.0000047802223,0.0009030287,0.0014806257,0.000035751145,0.00025914685,0.0000043057685,0.00001912706,0.0010039904],"genre_scores_gemma":[0.9995271,0.000001035593,0.00025827193,0.00013152958,0.000026388161,0.00004469163,0.000007738159,0.0000016052398,0.0000016674481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999145,0.00001536493,0.00030901638,0.000119149045,0.00025948635,0.00015200526],"domain_scores_gemma":[0.99930805,0.0003673979,0.00010540581,0.00016094148,0.00005282273,0.0000053920235],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004061291,0.000089060355,0.00010317838,0.00009245171,0.00013270142,0.00008585817,0.00029583692,0.000033436518,0.000009124238],"category_scores_gemma":[0.0019058123,0.000050580646,0.000033441327,0.00064425904,0.00022578242,0.001000321,0.00006270236,0.00022087783,0.000002512725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005276884,0.000022404916,0.00061968516,0.00003736606,8.718571e-7,1.7946945e-8,0.00015141969,0.54727304,0.000027129554,0.45159078,0.0000059102617,0.00026610217],"study_design_scores_gemma":[0.000053381842,0.0000048341894,0.0031923412,0.000018081477,0.0000021411695,3.4116204e-7,0.00007640827,0.7134517,0.000020842528,0.28305542,0.00007509419,0.000049451017],"about_ca_topic_score_codex":0.00007896189,"about_ca_topic_score_gemma":0.00013225857,"teacher_disagreement_score":0.16853534,"about_ca_system_score_codex":0.000024590594,"about_ca_system_score_gemma":0.000022656246,"threshold_uncertainty_score":0.2281573},"labels":[],"label_agreement":null},{"id":"W2170563208","doi":"10.1109/glocom.1998.775930","title":"Performance of a priority-based dynamic capacity allocation scheme for WATM systems","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Telecommunications link; Scheduling (production processes); Queue; Computer network; Real-time computing; Time division multiple access; Queueing theory; Markov process; Engineering","score_opus":0.020996271450147604,"score_gpt":0.2214742836457442,"score_spread":0.2004780121955966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2170563208","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9500389,0.000034573244,0.045909997,0.00022152247,0.000120089084,0.00034683076,0.0000021153537,0.00013225416,0.0031937307],"genre_scores_gemma":[0.9953222,0.0000026682417,0.0035472875,0.00015723797,0.000109748784,0.000042745687,0.000018168601,0.000015588792,0.00078431866],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992511,0.000006916909,0.0002527454,0.00018064078,0.00014199103,0.00016655188],"domain_scores_gemma":[0.99924093,0.00004892774,0.00022276447,0.00024591124,0.00023511781,0.0000063305115],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033917502,0.000111412155,0.00018814391,0.00015467798,0.00011272583,0.000043185613,0.0001499655,0.00004494581,0.00009882253],"category_scores_gemma":[0.00009910958,0.00010017502,0.000079385776,0.00033528972,0.000043273812,0.0006379427,0.000022488632,0.00004977407,0.00006728718],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006218154,0.0016157634,0.077448785,0.017085262,0.0006267408,0.0000029520502,0.00028001028,0.3544698,0.08024527,0.44269007,0.0022711856,0.022642352],"study_design_scores_gemma":[0.00034488455,0.000010849598,0.00027014452,0.0000487169,0.000055683286,1.7269036e-7,0.0000389245,0.99559736,0.00036910706,0.00032686573,0.0028072065,0.00013006397],"about_ca_topic_score_codex":0.00007643953,"about_ca_topic_score_gemma":0.000025695203,"teacher_disagreement_score":0.6411276,"about_ca_system_score_codex":0.000039864888,"about_ca_system_score_gemma":0.000004133827,"threshold_uncertainty_score":0.40850186},"labels":[],"label_agreement":null},{"id":"W2172986851","doi":"10.1287/mnsc.2015.2368","title":"Queueing Models of Case Managers","year":2016,"lang":"en","type":"article","venue":"Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":50,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Queueing theory; Computer science; Baseline (sea); Service (business); Heuristic; Operations research; Server; Social Welfare; Throughput; Customer service; Stability (learning theory); Limit (mathematics); Operations management; Business; Computer network; Marketing; Artificial intelligence; Mathematics; Economics","score_opus":0.017448648155816975,"score_gpt":0.23691929303591794,"score_spread":0.21947064488010096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2172986851","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.29179412,0.000035569035,0.2817765,0.0010862985,0.0003626574,0.00039760946,0.0000015638168,0.00029868732,0.424247],"genre_scores_gemma":[0.9951405,0.000009044556,0.0023814111,0.00043615635,0.00007788658,0.000012056187,3.324471e-7,0.000014257065,0.0019283588],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983962,0.000007505708,0.0002705805,0.00047284635,0.0004660663,0.0003867903],"domain_scores_gemma":[0.99903655,0.000037139904,0.00023243585,0.00057147717,0.00010467953,0.000017714046],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012062206,0.00014485673,0.00016357536,0.00080239796,0.00029220164,0.000113088914,0.00067083316,0.00001769319,0.00014018183],"category_scores_gemma":[0.00007062967,0.00010389396,0.000074123695,0.0018165571,0.00052210613,0.0034175012,0.00063768803,0.00003534235,0.00015510288],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000136100725,0.00003235177,0.0003474989,0.00009362753,0.000028191016,0.00038573454,0.00002472084,0.0056447657,0.0015439297,0.95066416,0.00019961978,0.041021813],"study_design_scores_gemma":[0.0017282844,0.000022668419,0.0009066283,0.0005397956,0.00053582,0.000061153776,0.0024604904,0.15374541,0.0025458785,0.8085861,0.027577931,0.0012898043],"about_ca_topic_score_codex":0.000099653815,"about_ca_topic_score_gemma":0.000020296064,"teacher_disagreement_score":0.7033464,"about_ca_system_score_codex":0.000059166174,"about_ca_system_score_gemma":0.0000055975406,"threshold_uncertainty_score":0.42366728},"labels":[],"label_agreement":null},{"id":"W2177526080","doi":"10.1016/j.peva.2015.11.001","title":"An alternative method for computing system-length distributions of BMAP/R/1 and BMAP/D/1 queues using roots","year":2015,"lang":"en","type":"article","venue":"Performance Evaluation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Mathematics; Markovian arrival process; Applied mathematics; Phase-type distribution; Laplace transform; Matrix (chemical analysis); Computation; Exponential function; Mathematical analysis; Algorithm; Queueing theory; Exponential distribution; Statistics","score_opus":0.07553246955462467,"score_gpt":0.37438770553341244,"score_spread":0.29885523597878777,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2177526080","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.60648894,0.000050921622,0.39277056,0.000027260448,0.00013547303,0.0002996603,0.000006026303,0.00004499682,0.00017618178],"genre_scores_gemma":[0.97592354,0.0000017605117,0.023338057,0.000026211093,0.0005354484,0.000024244639,0.00012951081,0.000016663684,0.000004594181],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99878174,0.000082106555,0.00034561843,0.00025409728,0.00035508923,0.00018135805],"domain_scores_gemma":[0.9981327,0.00009704895,0.0004955741,0.0001984999,0.0010570119,0.000019145064],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040361416,0.00013813328,0.00023800228,0.00020190125,0.00025930902,0.000082021004,0.0001297813,0.000042698015,0.0000057844727],"category_scores_gemma":[0.0004297735,0.00013278479,0.00004446316,0.00034251442,0.000045754467,0.0016434696,0.000060483853,0.0000618711,0.000004208338],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00026336717,0.00011078767,0.01176898,0.00065601844,0.00013846884,3.1491885e-7,0.0007297039,0.86699456,0.004741681,0.03260057,0.00003815898,0.08195738],"study_design_scores_gemma":[0.0006416341,0.000029707657,0.001335736,0.00012724218,0.00032138114,0.0000016207517,0.00093400286,0.99162245,0.001477304,0.0032252187,0.00013224506,0.00015144802],"about_ca_topic_score_codex":0.00014763484,"about_ca_topic_score_gemma":0.00002282641,"teacher_disagreement_score":0.3694346,"about_ca_system_score_codex":0.00016335025,"about_ca_system_score_gemma":0.000043351414,"threshold_uncertainty_score":0.5414806},"labels":[],"label_agreement":null},{"id":"W2188636836","doi":"10.1007/978-1-4615-0849-6_12","title":"Analysis of Frame-Based Fair Queueing under Self-Similar Traffic","year":2002,"lang":"en","type":"book-chapter","venue":"Kluwer international series in engineering and computer science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Computer network; Queueing theory; Network packet; Weighted round robin; Weighted fair queueing; Quality of service; Generalized processor sharing; Packet analyzer; Fair queuing; Scheduling (production processes); Frame (networking); Processor sharing; Real-time computing; Asynchronous communication; Processing delay; Transmission delay; Round-robin scheduling; Dynamic priority scheduling; Mathematical optimization; Mathematics","score_opus":0.007241163496856129,"score_gpt":0.1940008818572485,"score_spread":0.18675971836039237,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188636836","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0919909,0.0007961325,0.79514575,0.0017969921,0.00517144,0.00065147784,0.00005290953,0.0014005203,0.102993846],"genre_scores_gemma":[0.98651737,0.000048534122,0.009737325,0.00046593876,0.00046561644,0.0000073322476,0.00003281479,0.000045882018,0.0026792123],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99836904,0.0000027069439,0.00039143456,0.0005086219,0.0005123677,0.00021582645],"domain_scores_gemma":[0.9991717,0.00007079143,0.00024023606,0.0002858561,0.00021167674,0.000019742038],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00034303355,0.00027876228,0.00041304313,0.0021724359,0.000075106924,0.00021547347,0.0006473547,0.000099087076,0.00014590948],"category_scores_gemma":[0.000029704783,0.00029327744,0.00015845474,0.00073136913,0.00019881423,0.0008731594,0.00027137517,0.00022953266,0.0000066291846],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005867018,0.000017262277,0.00012593527,0.000048651193,0.00023259642,0.00000827239,0.000038116523,0.8079119,0.000014789088,0.19035617,0.000010790916,0.0012296658],"study_design_scores_gemma":[0.00011750145,0.000008153002,0.00046066352,0.0001652855,0.00021799307,0.0000014361218,0.000006109934,0.98514307,0.000009299621,0.0018146691,0.01175142,0.00030438972],"about_ca_topic_score_codex":0.000013620882,"about_ca_topic_score_gemma":0.000016757207,"teacher_disagreement_score":0.8945264,"about_ca_system_score_codex":0.00010927604,"about_ca_system_score_gemma":0.000020425843,"threshold_uncertainty_score":0.99995196},"labels":[],"label_agreement":null},{"id":"W2188979760","doi":"10.1109/wsc.2015.7408410","title":"Waiting time predictors for multi-skill call centers","year":2015,"lang":"en","type":"article","venue":"2015 Winter Simulation Conference (WSC)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Queue; Queueing theory; Heuristic; Artificial neural network; Customer service; Service (business); Recurrent neural network; Regression; Machine learning; Artificial intelligence; Real-time computing; Computer network; Statistics; Mathematics","score_opus":0.07507864866832731,"score_gpt":0.31117094938358186,"score_spread":0.23609230071525455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2188979760","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24570778,0.000037081423,0.73970383,0.0014605749,0.0012801235,0.0011306396,0.000041338757,0.0008248838,0.009813776],"genre_scores_gemma":[0.9928538,3.719783e-7,0.0015355974,0.0007621995,0.00076618686,0.00002576066,0.00018628652,0.00004460012,0.0038251858],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99852365,0.000028115925,0.0004118033,0.00041723892,0.0002617887,0.00035740674],"domain_scores_gemma":[0.99840957,0.00013767609,0.0003386376,0.00031122926,0.0007516363,0.00005125557],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00053437945,0.00025186542,0.00028963268,0.0002453443,0.00012831436,0.0002548504,0.00031683245,0.00009401349,0.00029991617],"category_scores_gemma":[0.00086465623,0.0002416759,0.00013983843,0.00022051796,0.00006895319,0.0013335835,0.00015300908,0.00011759895,0.00066593714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00079066417,0.00039232682,0.023404665,0.00022453266,0.0004034774,0.000012153399,0.0018676545,0.92058057,0.0010451091,0.016436482,0.023735903,0.011106491],"study_design_scores_gemma":[0.0012096007,0.000017196864,0.00027257059,0.00007388032,0.00009263633,3.152043e-7,0.00022119455,0.95873517,0.000041505933,0.0020007878,0.037053514,0.00028165497],"about_ca_topic_score_codex":0.000055983648,"about_ca_topic_score_gemma":0.000049521484,"teacher_disagreement_score":0.747146,"about_ca_system_score_codex":0.00008586558,"about_ca_system_score_gemma":0.000034423047,"threshold_uncertainty_score":0.9855257},"labels":[],"label_agreement":null},{"id":"W2196093576","doi":"10.1007/s10479-015-2075-2","title":"The impact of disruption characteristics on the performance of a server","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of New Brunswick; University of Toronto","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Queueing theory; Exponential distribution; Queueing system; Queue; Service (business); Theory of computation; Counterintuitive; Idle; Process (computing); Computer network; Real-time computing; Operations research; Operating system; Statistics; Mathematics; Algorithm","score_opus":0.22508071540636565,"score_gpt":0.4446745214119028,"score_spread":0.21959380600553713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2196093576","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9963637,0.000029258836,0.000027276155,0.001896859,0.000017306655,0.00015053152,0.0000059936788,0.0000043921705,0.0015046538],"genre_scores_gemma":[0.99929655,0.000071557144,0.000010381058,0.00004040259,0.00010421368,0.000014235234,0.00001179061,0.0000071487193,0.00044375018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989969,0.00008633779,0.00025413552,0.00008171871,0.00042628238,0.00015462689],"domain_scores_gemma":[0.99742883,0.00022532728,0.000091988804,0.0003811084,0.0018633856,0.000009368546],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003187752,0.000059108625,0.00011841112,0.00016000273,0.00026025964,0.00007143832,0.00031490863,0.000022090633,0.00006183054],"category_scores_gemma":[0.0014934143,0.000030401432,0.00007829286,0.0007038439,0.000224464,0.00044921212,0.0001098852,0.00013409441,0.000040336636],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018380614,0.0011176434,0.049602274,0.0003109391,0.0006303847,0.0000025094657,0.0015006402,0.32195982,0.019638294,0.57138807,0.0142015405,0.01780984],"study_design_scores_gemma":[0.0006159085,0.00075613987,0.1309186,0.00035827587,0.000056812853,0.0000011265043,0.0029460893,0.83140653,0.018009556,0.0103865685,0.0042272354,0.0003171563],"about_ca_topic_score_codex":0.00037462555,"about_ca_topic_score_gemma":0.000040814,"teacher_disagreement_score":0.5610015,"about_ca_system_score_codex":0.000011917012,"about_ca_system_score_gemma":0.000057700483,"threshold_uncertainty_score":0.20017329},"labels":[],"label_agreement":null},{"id":"W2198430235","doi":"10.1239/jap/1450802746","title":"Conditional Sojourn times and the volatility of payment schemes for bandwidth sharing in packet networks","year":2015,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Processor sharing; Payment; Volatility (finance); Predictability; Revenue; Logarithm; Prepayment of loan; Network packet; Computer science; Bandwidth (computing); Regret; Econometrics; Mathematics; Computer network; Queueing theory; Economics; Finance; Statistics","score_opus":0.02340897960375154,"score_gpt":0.24393572991853388,"score_spread":0.22052675031478233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2198430235","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9715145,0.00020326169,0.02512186,0.00090520235,0.00008459643,0.0005725795,0.0000033188237,0.000011371069,0.0015832707],"genre_scores_gemma":[0.9973859,0.000004008165,0.0021350367,0.00015451285,0.00028160383,0.00001725567,0.0000054724164,0.000008057099,0.000008161794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987612,0.00002358291,0.00066365796,0.0001612129,0.00023552205,0.00015485381],"domain_scores_gemma":[0.9983742,0.0002942259,0.0007879694,0.00018141416,0.0003413627,0.000020826994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052085733,0.000119456585,0.00040550716,0.000095284544,0.000071911505,0.000060251114,0.00021092477,0.000049629514,0.000040101528],"category_scores_gemma":[0.00045985682,0.00007731653,0.0001183471,0.00021611128,0.00024349832,0.00041676982,0.00012196368,0.00020315271,5.5908805e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011452447,0.0005738044,0.16242802,0.00056570163,0.00039610517,0.0000028207148,0.0005664477,0.08784408,0.00008033667,0.7249766,0.0010748551,0.010038764],"study_design_scores_gemma":[0.0027557826,0.000014709106,0.0028173262,0.000033909906,0.00010514349,0.0000015346959,0.00027236305,0.085724734,0.000054821438,0.90700465,0.0011265667,0.00008844318],"about_ca_topic_score_codex":0.000006918204,"about_ca_topic_score_gemma":0.000018922694,"teacher_disagreement_score":0.18202806,"about_ca_system_score_codex":0.000060707527,"about_ca_system_score_gemma":0.000034708377,"threshold_uncertainty_score":0.31528768},"labels":[],"label_agreement":null},{"id":"W2205749379","doi":"10.1007/s10479-015-2026-y","title":"A simple analysis of the batch arrival queue with infinite-buffer and Markovian service process using roots method: $$ GI ^{[X]}/C$$ G I [ X ] / C - $$ MSP /1/\\infty $$ M S P / 1 / ∞","year":2015,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":21,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Theory of computation; Simple (philosophy); Markovian arrival process; Markov process; Applied mathematics; Mathematics; Computer science; Buffer (optical fiber); Burke's theorem; Algorithm; Mathematical optimization; Discrete mathematics; Combinatorics; Queue management system; Statistics; Computer network; Fork–join queue; Telecommunications","score_opus":0.2093153899610347,"score_gpt":0.45275628948718816,"score_spread":0.24344089952615347,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2205749379","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9907124,0.0000659931,0.00493404,0.0023013821,0.000016680675,0.00035796114,0.00002697307,0.000020843849,0.0015637443],"genre_scores_gemma":[0.997485,0.0000067029996,0.0016665003,0.00053510815,0.000099846926,0.000028321927,0.00003766598,0.000026176405,0.00011467207],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99758166,0.00030402857,0.00045300796,0.0003740953,0.00091012265,0.00037709423],"domain_scores_gemma":[0.9945808,0.0002647263,0.0001630335,0.0006637092,0.004277416,0.00005029082],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0037191496,0.00018163506,0.0004580481,0.0011447758,0.0004504757,0.00023832933,0.0005314015,0.00007608277,0.0001412417],"category_scores_gemma":[0.0012789983,0.00012651314,0.00010973635,0.008056502,0.0002442407,0.0012708252,0.00038236874,0.00029013382,0.000009832535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033587372,0.00020901243,0.06680043,0.00027832013,0.0013005395,0.0000046265236,0.0012355592,0.9186102,0.0024933806,0.0073034056,0.00036985686,0.0010587986],"study_design_scores_gemma":[0.00045361792,0.000041284817,0.012462266,0.000092861395,0.0007145021,0.0000016111927,0.0037490556,0.9726594,0.0024682947,0.0056070886,0.001479511,0.00027050622],"about_ca_topic_score_codex":0.0045241714,"about_ca_topic_score_gemma":0.008283306,"teacher_disagreement_score":0.054338165,"about_ca_system_score_codex":0.000018636454,"about_ca_system_score_gemma":0.00020948269,"threshold_uncertainty_score":0.6839224},"labels":[],"label_agreement":null},{"id":"W2213146353","doi":"10.1090/fic/028/09","title":"Long range dependence of inputs and outputs of some classical queues","year":2000,"lang":"en","type":"other","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Queue; Range (aeronautics); Statistical physics; Mathematics; Applied mathematics; Mathematical economics; Statistics; Computer science; Physics; Computer network; Materials science","score_opus":0.011109443046283946,"score_gpt":0.2319634577735663,"score_spread":0.22085401472728236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2213146353","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0047783535,0.0019620939,0.0025210113,0.000258535,0.00014684448,0.00028668088,0.000013693732,0.00026820853,0.9897646],"genre_scores_gemma":[0.33761203,0.0004752191,0.0008555215,0.00085395237,0.0014164493,0.000011200951,0.000044714547,0.00041029844,0.6583206],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99895895,0.000014961661,0.0003098315,0.00030671566,0.00023987157,0.0001697008],"domain_scores_gemma":[0.99914867,0.00004937842,0.00044492033,0.00031216064,0.0000342137,0.000010663341],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014252916,0.00023258732,0.0005587776,0.0004988562,0.000022487844,0.000027792254,0.00023937246,0.00018916391,0.002791812],"category_scores_gemma":[0.00004865318,0.00019857175,0.00010968499,0.0002459423,0.00019375845,0.00034459485,0.00014054975,0.0001236053,0.00006720131],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006666093,0.0009734524,0.039539203,0.0102008125,0.0021546588,0.0001880127,0.00016671537,0.0003469679,0.0011830142,0.5441748,0.31080365,0.08960214],"study_design_scores_gemma":[0.0029975872,0.00006653685,0.0034734227,0.003949138,0.0023134106,0.000007993544,0.00014795562,0.0029151642,0.0012202018,0.062115803,0.91806763,0.0027251611],"about_ca_topic_score_codex":0.000346499,"about_ca_topic_score_gemma":0.0005942344,"teacher_disagreement_score":0.607264,"about_ca_system_score_codex":0.0000059481217,"about_ca_system_score_gemma":0.000009653962,"threshold_uncertainty_score":0.9981198},"labels":[],"label_agreement":null},{"id":"W2221884260","doi":"10.1239/jap/1450802745","title":"Tollbooth tandem queues with infinite homogeneous servers","year":2015,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Laboratory; Army Research Office; Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Poisson distribution; Queue; Server; Mathematics; Queueing theory; Tandem; Markovian arrival process; Service (business); Applied mathematics; Homogeneous; Computer science; Computer network; Statistics; Combinatorics","score_opus":0.023854799030926434,"score_gpt":0.22232846609351806,"score_spread":0.19847366706259162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2221884260","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9753371,0.000051675917,0.0010217008,0.0003396212,0.0001080176,0.00019688858,7.050344e-7,0.00006210499,0.02288221],"genre_scores_gemma":[0.9950933,0.0000019072478,0.0036822825,0.000572106,0.0005766057,0.0000055945166,0.000001868482,0.000022465512,0.000043901844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985775,0.000019277688,0.0005054259,0.00020624677,0.00046121594,0.0002303434],"domain_scores_gemma":[0.9981571,0.00006532373,0.0008154425,0.0003058547,0.0006083582,0.00004795875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016483244,0.0001913442,0.00040735418,0.000180863,0.00009330526,0.00012622155,0.00032314152,0.00006412877,0.00006186643],"category_scores_gemma":[0.00019951783,0.00013824864,0.000116572606,0.0005641422,0.00012865897,0.00052015285,0.00009295512,0.00025179845,0.00004129584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0089392755,0.0013259083,0.091030136,0.00064643956,0.0010563389,0.000304172,0.0013177677,0.6817942,0.0012009431,0.18458082,0.0038791625,0.023924816],"study_design_scores_gemma":[0.0037849504,0.00020816953,0.0016121787,0.00012004917,0.00073966174,0.00006959865,0.0015645296,0.003269943,0.0009753534,0.92651236,0.060328946,0.00081425847],"about_ca_topic_score_codex":0.000020530306,"about_ca_topic_score_gemma":0.00009080675,"teacher_disagreement_score":0.74193156,"about_ca_system_score_codex":0.00013407905,"about_ca_system_score_gemma":0.00010261153,"threshold_uncertainty_score":0.5637616},"labels":[],"label_agreement":null},{"id":"W2228632909","doi":"10.1016/j.orl.2016.02.011","title":"Fast Engset computation","year":2016,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Fixed-point iteration; Uniqueness; Mathematics; Fixed point; Convergence (economics); Computation; Simple (philosophy); Queue; Applied mathematics; Mathematical optimization; Computer science; Algorithm; Mathematical analysis","score_opus":0.04349622580139683,"score_gpt":0.3333929454138204,"score_spread":0.2898967196124236,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2228632909","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7258557,0.0000112752,0.19384268,0.0729655,0.00014420047,0.00031516215,0.0000064597975,0.00017186753,0.006687162],"genre_scores_gemma":[0.9948945,0.0000034317482,0.0009935208,0.0024461,0.00064834923,0.000046797784,0.000031721906,0.00001852578,0.00091701874],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988861,0.00006311537,0.00014992499,0.00023659597,0.0003737872,0.00029047063],"domain_scores_gemma":[0.9993236,0.00013753369,0.00001853397,0.000212168,0.0002951743,0.00001297659],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0008716894,0.00008040048,0.00008400135,0.00046831122,0.00054052554,0.00032890585,0.00020530348,0.000023724977,0.0004958755],"category_scores_gemma":[0.00048261535,0.000056972527,0.00004149992,0.00070855964,0.00015505304,0.0015088951,0.00011751421,0.0001180718,0.002490409],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006508682,0.00014038125,0.0016899494,0.0000474342,0.000099284276,0.00004060224,0.00015813606,0.19384325,0.45805454,0.19318618,0.07748123,0.075193934],"study_design_scores_gemma":[0.0042959754,0.00006588087,0.0062760804,0.0004438921,0.0001251378,0.000010833485,0.0014559769,0.47723722,0.007468464,0.033267256,0.46743482,0.0019184668],"about_ca_topic_score_codex":0.00014150587,"about_ca_topic_score_gemma":0.00015373927,"teacher_disagreement_score":0.45058608,"about_ca_system_score_codex":0.000071462004,"about_ca_system_score_gemma":0.000013429522,"threshold_uncertainty_score":0.99828625},"labels":[],"label_agreement":null},{"id":"W2252673298","doi":"10.1080/00207179.2016.1146968","title":"<i>r</i>-extreme signalling for congestion control","year":2016,"lang":"en","type":"article","venue":"International Journal of Control","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"Science Foundation Ireland; European Commission","keywords":"Interval (graph theory); Network congestion; Maxima; Maxima and minima; Resource (disambiguation); Population; Computer science; Scalar (mathematics); Instant; Control (management); Operations research; Econometrics; Mathematics; Computer network; Combinatorics; Demography; Biology; Sociology; Artificial intelligence; History","score_opus":0.015878293528881003,"score_gpt":0.24461147273779893,"score_spread":0.22873317920891792,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2252673298","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.025429439,0.00012738092,0.95869386,0.013579452,0.0013418412,0.00016219159,0.000015437377,0.00003251582,0.00061789673],"genre_scores_gemma":[0.9922995,0.000009225979,0.0003894286,0.0029095584,0.004184696,0.000009205147,0.0000019119586,0.00001861767,0.00017783942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99879515,0.000018449338,0.00051688025,0.0001192964,0.0003911585,0.00015908643],"domain_scores_gemma":[0.9966619,0.0005947068,0.00090183277,0.00007635861,0.0017483612,0.000016817889],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000855648,0.00012084384,0.00025757813,0.00032084432,0.000053612588,0.00012077627,0.00042322537,0.000042778647,0.00019983492],"category_scores_gemma":[0.001159176,0.00008109034,0.00027325712,0.00006846815,0.00004441612,0.0013168855,0.000017031783,0.00007274758,0.00004517932],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011468278,0.0003873958,0.016414233,0.0000452589,0.0038219318,0.00017196142,0.000039531806,0.02678499,0.29705152,0.36263186,0.005128445,0.2760546],"study_design_scores_gemma":[0.05200308,0.00020399239,0.0029249215,0.00090112654,0.0016223819,0.00010374108,0.0000991564,0.046117324,0.0020561048,0.4153299,0.47773042,0.0009078392],"about_ca_topic_score_codex":0.000004453079,"about_ca_topic_score_gemma":0.0000051108177,"teacher_disagreement_score":0.96687007,"about_ca_system_score_codex":0.00007079298,"about_ca_system_score_gemma":0.00002590971,"threshold_uncertainty_score":0.3306768},"labels":[],"label_agreement":null},{"id":"W2254128681","doi":"10.3138/infor.52.4.197","title":"Efficient Methods to find the Equilibrium Distribution of the Number of Customers in<i>GI</i>/<i>M</i>/<i>c</i>Queues","year":2014,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Fraction (chemistry); Distribution (mathematics); Computer science; Mathematics; Combinatorics; Discrete mathematics; Mathematical optimization; Mathematical analysis; Computer network; Chemistry; Chromatography","score_opus":0.03042801423593704,"score_gpt":0.3598732378649653,"score_spread":0.3294452236290282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2254128681","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9651115,0.000034192348,0.01230213,0.0012101952,0.00023658112,0.00089038286,0.00002810882,0.000014722165,0.020172182],"genre_scores_gemma":[0.99919224,0.0000016206178,0.00015222472,0.00030448852,0.00009975199,0.00006052109,0.000033464723,0.0000043309037,0.0001513753],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99824125,0.00015485294,0.0006324431,0.000087956374,0.000693979,0.00018952417],"domain_scores_gemma":[0.99806863,0.00047991762,0.00022479531,0.00025438864,0.00095762504,0.000014652445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006104201,0.00008793839,0.00017496974,0.00019607392,0.00021766352,0.00021385211,0.00028939237,0.00004863653,0.000017787252],"category_scores_gemma":[0.0017503194,0.00005172384,0.00005194228,0.0011343204,0.00016349477,0.00085340795,0.00026318373,0.00015866199,0.000051147686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006803918,0.000018728448,0.0047280747,0.0002693513,0.000018356863,3.3557956e-8,0.0005483638,0.42565235,0.0006790132,0.56319165,0.0006533617,0.004172642],"study_design_scores_gemma":[0.0006067882,0.000018394565,0.021588407,0.00026774008,0.000020386533,0.0000034404131,0.0024493267,0.7372967,0.0009047767,0.0014094217,0.23523203,0.00020259246],"about_ca_topic_score_codex":0.0005540455,"about_ca_topic_score_gemma":0.000011971399,"teacher_disagreement_score":0.56178224,"about_ca_system_score_codex":0.00004514772,"about_ca_system_score_gemma":0.00004979626,"threshold_uncertainty_score":0.21156065},"labels":[],"label_agreement":null},{"id":"W2273298990","doi":"10.1016/j.ejor.2016.02.010","title":"Multi-server accumulating priority queues with heterogeneous servers","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":40,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Computer science; Queue; Service (business); Idle; Queueing theory; Class (philosophy); Function (biology); Computer network; Operations research; Distributed computing; Operating system; Mathematics; Business","score_opus":0.09992637560611724,"score_gpt":0.35210793849242805,"score_spread":0.25218156288631083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2273298990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98994327,0.000067136454,0.005564764,0.0017730362,0.00007766053,0.00010441103,0.0000015386771,0.000023633647,0.0024445362],"genre_scores_gemma":[0.99430466,0.000009448673,0.0034760523,0.000257531,0.0010622246,0.0000010321776,0.000002165546,0.000038908205,0.0008479562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9978051,0.00032071507,0.00042297313,0.00020499005,0.0009487185,0.0002974895],"domain_scores_gemma":[0.9974075,0.00025804565,0.0002562498,0.00021006979,0.0018289371,0.000039200357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005187396,0.00012969763,0.00017609951,0.00038173053,0.00038449487,0.00033813197,0.00047696952,0.000016800595,0.00046326264],"category_scores_gemma":[0.0014148974,0.00007601094,0.00009387468,0.00042877323,0.0001467204,0.0018874541,0.00016114835,0.00029044622,0.00033777225],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0065628695,0.0018625834,0.2102163,0.00048710487,0.0021920756,0.009095866,0.001255053,0.33443347,0.24650702,0.07407761,0.006354848,0.1069552],"study_design_scores_gemma":[0.04673999,0.0030782218,0.31793934,0.0077719036,0.00082330056,0.0016202743,0.0043426678,0.1535057,0.021597477,0.013146074,0.4236118,0.0058232704],"about_ca_topic_score_codex":0.000018552722,"about_ca_topic_score_gemma":0.00004268897,"teacher_disagreement_score":0.41725695,"about_ca_system_score_codex":0.00008821561,"about_ca_system_score_gemma":0.000078086414,"threshold_uncertainty_score":0.5072401},"labels":[],"label_agreement":null},{"id":"W2276622541","doi":"10.1002/nav.21672","title":"Using a birth‐and‐death process to estimate the steady‐state distribution of a periodic queue","year":2015,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Steady state (chemistry); Queue; Queueing theory; Poisson distribution; Burke's theorem; Applied mathematics; Distribution (mathematics); Parametric statistics; Function (biology); Mathematics; State (computer science); Bulk queue; Birth–death process; Computer science; Mathematical optimization; Statistics; Mathematical analysis; Algorithm; Fork–join queue; Queue management system; Population","score_opus":0.1770562333190942,"score_gpt":0.44507910199850137,"score_spread":0.26802286867940717,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2276622541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8747674,0.00017903521,0.12115454,0.00082822586,0.00010514334,0.000598149,0.000049068694,0.000093133574,0.0022252828],"genre_scores_gemma":[0.9987042,0.00000768839,0.00063662016,0.000082576415,0.00022742258,0.000028644856,0.000030650295,0.000027871509,0.00025430246],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976549,0.00011625358,0.00033502825,0.00036190468,0.00096187764,0.000570019],"domain_scores_gemma":[0.9974363,0.0003028304,0.00017042855,0.00040092925,0.0016179105,0.00007158924],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.003953226,0.00017785978,0.0002783449,0.00027714696,0.00042650267,0.0003245983,0.00047011458,0.00006105301,0.000014523757],"category_scores_gemma":[0.009919754,0.00013009022,0.00005267162,0.0013698724,0.0004114772,0.00038504135,0.00051417423,0.00038716535,0.00006519442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002343702,0.0004973153,0.026993182,0.0018397848,0.00025824617,0.00020915808,0.002414936,0.42928955,0.0031723853,0.51502675,0.0013096976,0.016645253],"study_design_scores_gemma":[0.0010629683,0.0001757175,0.0023783185,0.0003455608,0.00017628452,0.000012646504,0.002952292,0.5799926,0.0006546575,0.3990878,0.012588916,0.0005722418],"about_ca_topic_score_codex":0.000962604,"about_ca_topic_score_gemma":0.00012981075,"teacher_disagreement_score":0.15070304,"about_ca_system_score_codex":0.00015408595,"about_ca_system_score_gemma":0.00017037474,"threshold_uncertainty_score":0.9984201},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.012602607733057417,"score_gpt":0.2531806199058625,"score_spread":0.24057801217280508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2277393385","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84465927,0.000068316476,0.09113125,0.0016930472,0.00018296676,0.0013764657,0.000005785839,0.0004014038,0.060481474],"genre_scores_gemma":[0.9841557,0.000014124723,0.010295517,0.0006101673,0.00019313673,0.00010055886,0.000005491283,0.000026324291,0.004598964],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99826556,0.000008636793,0.00021629958,0.0006177955,0.00042731804,0.00046437565],"domain_scores_gemma":[0.9992037,0.00006601847,0.00023324856,0.0003019148,0.00016712565,0.000028012095],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009451104,0.00020542338,0.00016841441,0.00045423643,0.00053914223,0.0004108097,0.00043939395,0.000022891976,0.00013699928],"category_scores_gemma":[0.000049531624,0.00013527044,0.00003658744,0.000959368,0.00045139893,0.002267376,0.00023643952,0.00003866017,0.00019581038],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000567566,0.00040561342,0.0119914785,0.0008027993,0.0005483034,0.00006975647,0.0002973226,0.022782452,0.033320997,0.8775816,0.0023968252,0.04923528],"study_design_scores_gemma":[0.023497568,0.00079077546,0.021665012,0.001978642,0.0048217713,0.000043812106,0.010914343,0.4942063,0.011516608,0.20350194,0.21796373,0.0090994965],"about_ca_topic_score_codex":0.000021895145,"about_ca_topic_score_gemma":0.000011203456,"teacher_disagreement_score":0.67407966,"about_ca_system_score_codex":0.000072697294,"about_ca_system_score_gemma":0.0000140947295,"threshold_uncertainty_score":0.55161685},"labels":[],"label_agreement":null},{"id":"W22828699","doi":"10.2139/ssrn.2317410","title":"Slowdown Services: Staffing Service Systems with Load-Dependent Service Rate","year":2013,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Staffing; Service (business); Business; Slowdown; Operations management; Process management; Marketing; Economics; Management; Economic growth","score_opus":0.005359433122041495,"score_gpt":0.19130045126785758,"score_spread":0.1859410181458161,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W22828699","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9744099,0.0015897835,0.012045067,0.0045130206,0.00045263645,0.0006822049,0.0000016253574,0.0004061738,0.0058995876],"genre_scores_gemma":[0.9920206,0.00016127904,0.00006924692,0.004338221,0.0014286281,0.00004235947,0.000016453161,0.00010656733,0.0018166642],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99552894,0.00008156453,0.0005553316,0.00047959556,0.00068386673,0.0026706762],"domain_scores_gemma":[0.997144,0.00006642071,0.00078546966,0.00048848486,0.0014634234,0.000052241252],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0025216239,0.00044249665,0.0004511319,0.0002964032,0.0006226735,0.0011677024,0.00089708366,0.00011010486,0.00022637259],"category_scores_gemma":[0.000029290066,0.00034877242,0.0001039102,0.00133139,0.000023571663,0.003751496,0.00019659124,0.0015520351,0.0016737349],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017211777,0.00081276917,0.0086831665,0.0034676264,0.005283716,0.00016435038,0.0014376197,0.44411936,0.009698436,0.50918525,0.00042444153,0.015002094],"study_design_scores_gemma":[0.009465448,0.00032085128,0.0010445737,0.0019698902,0.0026167424,0.0013533585,0.0800933,0.31350252,0.00026140054,0.54513484,0.039727263,0.004509823],"about_ca_topic_score_codex":0.00664143,"about_ca_topic_score_gemma":0.018049711,"teacher_disagreement_score":0.13061686,"about_ca_system_score_codex":0.00095647865,"about_ca_system_score_gemma":0.0006163367,"threshold_uncertainty_score":0.9999734},"labels":[],"label_agreement":null},{"id":"W2296648693","doi":"","title":"Be Fair and Be Selfish! Characterizing Deterministic Diffusive Load-Balancing Schemes with Small Discrepancy","year":2014,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Rounding; Load balancing (electrical power); Mathematics; Set (abstract data type); Interval (graph theory); Node (physics); Discrete mathematics; Computer science; Spectral gap; Combinatorics; Topology (electrical circuits)","score_opus":0.028505051527010643,"score_gpt":0.16046153377819922,"score_spread":0.13195648225118858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2296648693","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9635134,0.000008823285,0.0323746,0.00021608023,0.0000540935,0.000121569734,0.0000025590475,0.00019936051,0.0035095322],"genre_scores_gemma":[0.9975439,0.000010937663,0.00036789227,0.0010944251,0.00021226761,9.977975e-7,0.00001576186,0.000034675075,0.0007191757],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987766,0.000028015485,0.00015203681,0.00060683204,0.00008436763,0.0003521559],"domain_scores_gemma":[0.9990301,0.00012578716,0.0002728845,0.00038681383,0.0001435674,0.000040812076],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00022531107,0.00026717188,0.00030827927,0.00018971275,0.00035294238,0.00015298386,0.00027274495,0.000065061635,0.000046438978],"category_scores_gemma":[0.0001656891,0.00025880852,0.000076544515,0.00052759243,0.00016163486,0.0010421552,0.00026266268,0.00015723743,0.00002610976],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008443177,0.0003051667,0.24163827,0.00075584743,0.00054851384,0.00079612393,0.00057132664,0.0054611713,0.0055698426,0.7386938,0.00008757872,0.0047280756],"study_design_scores_gemma":[0.008236335,0.00028868954,0.055346027,0.0010102902,0.0035578543,0.000049986164,0.0046748873,0.7415629,0.001188454,0.068425134,0.111070596,0.0045888727],"about_ca_topic_score_codex":0.00009762848,"about_ca_topic_score_gemma":0.00024975225,"teacher_disagreement_score":0.7361017,"about_ca_system_score_codex":0.00006372317,"about_ca_system_score_gemma":0.000019085626,"threshold_uncertainty_score":0.9999864},"labels":[],"label_agreement":null},{"id":"W2308806806","doi":"10.1007/s11009-015-9476-1","title":"Waiting Time Distributions in the Preemptive Accumulating Priority Queue","year":2015,"lang":"en","type":"article","venue":"Methodology And Computing In Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":23,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Priority inheritance; Queue; Prioritization; Priority queue; Class (philosophy); Operations research; Service (business); Queueing theory; Priority ceiling protocol; Selection (genetic algorithm); Queueing system; Mathematics; Computer network; Computer science; Mathematical optimization; Business; Quality of service; Process management; Marketing; Dynamic priority scheduling; Artificial intelligence","score_opus":0.12312811416877656,"score_gpt":0.32971967437287375,"score_spread":0.2065915602040972,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2308806806","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9440165,0.000034497567,0.048730806,0.0004508456,0.000056566987,0.00048678232,0.0000011749319,0.00009354313,0.006129271],"genre_scores_gemma":[0.96927476,2.2972554e-7,0.030157795,0.00031668367,0.00019230983,0.00002849016,0.000016193733,0.000008821451,0.0000047205103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.997761,0.00076215115,0.0004744572,0.00049511326,0.0001390866,0.00036815772],"domain_scores_gemma":[0.9967705,0.002570806,0.00025590183,0.00031570336,0.00007270167,0.000014365357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.015183365,0.00018656207,0.00038547014,0.00012518658,0.00023688513,0.00007727656,0.00030356497,0.0001238617,0.000009857812],"category_scores_gemma":[0.0034094818,0.00015242548,0.0000462073,0.0007975051,0.00023585098,0.00018471062,0.00029608855,0.0005073328,0.000016576649],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036104268,0.0003428547,0.15283774,0.0002052658,0.000041224564,0.000013900348,0.0044892873,0.06554485,0.00047466814,0.7201232,0.000034469635,0.055531517],"study_design_scores_gemma":[0.00065192964,0.000009634842,0.031316433,0.00003357757,0.00004093874,0.0000043805753,0.0013670775,0.2230053,0.000041002728,0.74294096,0.00033391392,0.0002548632],"about_ca_topic_score_codex":0.00026338545,"about_ca_topic_score_gemma":0.00015916456,"teacher_disagreement_score":0.15746044,"about_ca_system_score_codex":0.000083520026,"about_ca_system_score_gemma":0.000026250686,"threshold_uncertainty_score":0.62157303},"labels":[],"label_agreement":null},{"id":"W2311766507","doi":"10.1287/opre.2016.1484","title":"Rate-Based Daily Arrival Process Models with Application to Call Centers","year":2016,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":35,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Statistics; Poisson distribution; Sample (material); Estimation; Mathematics","score_opus":0.03866242244906953,"score_gpt":0.33563072899507224,"score_spread":0.2969683065460027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2311766507","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15147965,0.0000039750535,0.83475524,0.008046218,0.000016651686,0.000634346,0.000005637722,0.00009445892,0.0049638506],"genre_scores_gemma":[0.9958584,8.979088e-7,0.0014950394,0.000598389,0.00019766056,0.0004414407,0.00002996278,0.000027888816,0.0013503209],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998681,0.00004198248,0.00015507828,0.0003749578,0.00042008364,0.00032687385],"domain_scores_gemma":[0.99854624,0.0000763445,0.000021482932,0.00041522365,0.0009090335,0.00003165049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008958324,0.00010669836,0.00010793615,0.00044095668,0.0004891325,0.0002833255,0.0003393848,0.000032200885,0.00012005342],"category_scores_gemma":[0.0002127057,0.00006932255,0.00002567433,0.0012076779,0.000096842945,0.0012460316,0.000074222684,0.00010853752,0.0006441119],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003186391,0.000141248,0.00060467824,0.00004977399,0.000029140963,0.0000045824427,0.00007417942,0.85622567,0.021531055,0.11281777,0.0006696487,0.007533622],"study_design_scores_gemma":[0.0013819898,0.00006054075,0.00037712738,0.00013831367,0.000037392918,6.4942543e-7,0.00035802514,0.96564496,0.0050109825,0.016218444,0.010309538,0.0004620183],"about_ca_topic_score_codex":0.00027032942,"about_ca_topic_score_gemma":0.00082879374,"teacher_disagreement_score":0.84437877,"about_ca_system_score_codex":0.00008583842,"about_ca_system_score_gemma":0.000078107885,"threshold_uncertainty_score":0.827897},"labels":[],"label_agreement":null},{"id":"W2312281960","doi":"10.1109/tcns.2015.2428331","title":"Analysis of Randomized Join-the-Shortest-Queue (JSQ) Schemes in Large Heterogeneous Processor-Sharing Systems","year":2015,"lang":"en","type":"article","venue":"IEEE Transactions on Control of Network Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":54,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Server; Processor sharing; Queue; Computer science; Queueing theory; Routing (electronic design automation); Distributed computing; Computer network","score_opus":0.018803425256123506,"score_gpt":0.24110636037100014,"score_spread":0.22230293511487664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2312281960","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.08768039,0.002761402,0.90593255,0.00008107468,0.0010738198,0.0017289887,0.000029676376,0.00013403571,0.0005780524],"genre_scores_gemma":[0.998915,0.000022499258,0.00002446555,0.00008722583,0.0003964678,0.00034366487,0.00001005437,0.000043510005,0.00015707726],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99660856,0.00027399446,0.0016079058,0.0004537663,0.00057693163,0.00047883793],"domain_scores_gemma":[0.99675095,0.0006865281,0.001275494,0.0006675628,0.000581497,0.00003793752],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0043305885,0.00034013658,0.0022137705,0.00096199743,0.00015484584,0.00014285608,0.00048418762,0.0001424538,0.000018557164],"category_scores_gemma":[0.000120683464,0.0002636646,0.00072731747,0.0029452343,0.00012573808,0.00048986357,0.0000063853286,0.00025500837,0.000012330345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004614973,0.00015653354,0.0014170925,0.000185284,0.003125564,0.000008145149,0.00007367169,0.9882301,0.000048039525,0.001989991,0.000018432904,0.00013213434],"study_design_scores_gemma":[0.020184616,0.000019289248,0.000014774964,0.00031108843,0.004372474,0.0000023976247,0.00029568342,0.9738558,0.000025773503,0.00020611972,0.00046268277,0.00024931782],"about_ca_topic_score_codex":0.0007377148,"about_ca_topic_score_gemma":0.00065249554,"teacher_disagreement_score":0.9112346,"about_ca_system_score_codex":0.00008857931,"about_ca_system_score_gemma":0.000036633908,"threshold_uncertainty_score":0.9999816},"labels":[],"label_agreement":null},{"id":"W2315384942","doi":"10.3934/jimo.2015.11.763","title":"Stability of a cyclic polling system with an adaptive mechanism","year":2014,"lang":"en","type":"article","venue":"Journal of Industrial and Management Optimization","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Polling; Polling system; Queue; Computer science; Moment (physics); Computer network; Limit (mathematics); Queue management system; Stability (learning theory); Mechanism (biology); Distributed computing; Real-time computing; Mathematics; Physics","score_opus":0.02778302263092815,"score_gpt":0.21280667309057294,"score_spread":0.18502365045964478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2315384942","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.109030046,0.000011221229,0.8883464,0.0001150292,0.00016310265,0.00022031296,7.283005e-7,0.000026928226,0.0020862508],"genre_scores_gemma":[0.9866643,0.000011666592,0.012730083,0.000054022617,0.00051150005,0.000002459801,0.0000032960286,0.000013298052,0.000009388163],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989975,0.000053006093,0.00043712568,0.00014029151,0.00025943934,0.00011262438],"domain_scores_gemma":[0.99859774,0.000031954838,0.00096728944,0.0001305635,0.00025360877,0.000018832365],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011245045,0.0001194906,0.00028000047,0.0003116615,0.00009589985,0.00007639583,0.00012806348,0.000054838147,0.000018122508],"category_scores_gemma":[0.000059517133,0.000090826754,0.000049099137,0.00038638545,0.0000361526,0.0011243076,0.000055971643,0.00010492119,5.6039767e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011441045,0.00010329942,0.00043521237,0.000146923,0.00020197754,0.000005975448,0.000038200153,0.5147803,0.00006310279,0.4772764,0.000013462461,0.005791056],"study_design_scores_gemma":[0.004548702,0.000667426,0.00008596177,0.00082027435,0.0012497933,0.000010323072,0.005212503,0.97836226,0.00042309365,0.007925825,0.0003222882,0.0003715239],"about_ca_topic_score_codex":0.000029957506,"about_ca_topic_score_gemma":0.000006483795,"teacher_disagreement_score":0.8776342,"about_ca_system_score_codex":0.000036417438,"about_ca_system_score_gemma":0.0000075148964,"threshold_uncertainty_score":0.37038076},"labels":[],"label_agreement":null},{"id":"W2319522714","doi":"10.1142/9789812777164_0009","title":"A LINEAR PROGRAM APPROACH TO ERGODICITY OF M/G/1 TYPE MARKOV CHAINS WITH A TREE STRUCTURE","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Mount Saint Vincent University; Dalhousie University","funders":"","keywords":"Markov chain; Type (biology); Ergodicity; Mathematics; Tree (set theory); Computer science; Markov process; Discrete mathematics; Combinatorics; Statistics","score_opus":0.016405553936847197,"score_gpt":0.22474390272304026,"score_spread":0.20833834878619306,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2319522714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7571849,0.00004691215,0.02333895,0.0006447974,0.00007587257,0.0010390145,0.000004425946,0.0006118921,0.21705323],"genre_scores_gemma":[0.9604364,0.0000011150397,0.036024746,0.00068864436,0.00027390197,0.000015226636,0.000014174217,0.000026688649,0.0025190955],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99907666,0.000009587552,0.0001826084,0.00028400857,0.00021886702,0.00022828623],"domain_scores_gemma":[0.9993351,0.000015479913,0.00012339794,0.0003305601,0.00017733446,0.000018097066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00011355653,0.00016872479,0.0002536279,0.00021413797,0.00007289931,0.00004532297,0.00022613959,0.000052101244,0.00054317014],"category_scores_gemma":[0.00008507828,0.00011916174,0.0000558461,0.0013450441,0.000060613907,0.00031076165,0.00009269506,0.0001059251,0.00004691643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024069673,0.0050640567,0.035922643,0.0019962925,0.0014688987,0.00005580984,0.0012488771,0.08014388,0.0038217618,0.38153026,0.019098835,0.4672417],"study_design_scores_gemma":[0.0017586803,0.0002926785,0.0033502956,0.000110129,0.00055179396,0.000009206027,0.0008443937,0.9321826,0.0004672497,0.003773275,0.055514667,0.0011450431],"about_ca_topic_score_codex":0.00007216126,"about_ca_topic_score_gemma":0.00013055789,"teacher_disagreement_score":0.85203874,"about_ca_system_score_codex":0.000014077785,"about_ca_system_score_gemma":0.000003963566,"threshold_uncertainty_score":0.5947332},"labels":[],"label_agreement":null},{"id":"W2331744328","doi":"10.1142/9781860949531_0029","title":"TRANSIENT ANALYSIS OF SOME INFINITE SERVER QUEUES","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Transient (computer programming); Queue; Transient analysis; Computer network; Operating system; Transient response; Engineering; Electrical engineering","score_opus":0.019806500823774116,"score_gpt":0.22374246150253244,"score_spread":0.20393596067875833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2331744328","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94649684,0.00016645409,0.0025470797,0.00069301756,0.00007410917,0.000088291126,0.0000029248042,0.00019780415,0.04973348],"genre_scores_gemma":[0.9961619,0.000017970759,0.00016149816,0.0014926007,0.00012918339,0.0000038643625,0.000015460346,0.000013002308,0.0020045168],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990694,0.000010647397,0.00031528928,0.00021297515,0.00021265226,0.00017904333],"domain_scores_gemma":[0.9993304,0.00004890187,0.00017227215,0.00032680202,0.00011276648,0.000008835221],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00021933435,0.00012952863,0.0003406863,0.00087429694,0.000063133055,0.000049424318,0.0001900498,0.000039441682,0.0065280427],"category_scores_gemma":[0.00005384027,0.000111461784,0.00031553666,0.0024044637,0.00005196194,0.0010788334,0.000049614344,0.000058822567,0.00025535433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000062217,0.0005675749,0.028270826,0.00022260856,0.005541055,0.0000194944,0.0004189326,0.18220419,0.0019047069,0.7673805,0.0029365895,0.0104713],"study_design_scores_gemma":[0.00090617384,0.000018478066,0.018507948,0.000043341297,0.01069902,3.8686258e-7,0.0006010379,0.87705296,0.0007089289,0.02890864,0.061644785,0.00090831675],"about_ca_topic_score_codex":0.00022842249,"about_ca_topic_score_gemma":0.00022818804,"teacher_disagreement_score":0.73847187,"about_ca_system_score_codex":0.00001158861,"about_ca_system_score_gemma":0.0000012262367,"threshold_uncertainty_score":0.9943801},"labels":[],"label_agreement":null},{"id":"W2332649167","doi":"10.1017/s0269964813000417","title":"ALTERNATIVE ANALYSIS OF FINITE-TIME PROBABILITY DISTRIBUTIONS OF RENEWAL THEORY","year":2014,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Renewal theory; Probability density function; Stochastic process; Mathematics; Class (philosophy); Applied mathematics; Probability distribution; Computer science; Limiting; Process (computing); Statistical physics; Calculus (dental); Statistics; Physics; Engineering","score_opus":0.011888485655544226,"score_gpt":0.22026167170984895,"score_spread":0.20837318605430472,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2332649167","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98574466,0.000011967245,0.011691546,0.00016849741,0.000021558986,0.00012524954,0.000015204095,0.000018618095,0.0022027323],"genre_scores_gemma":[0.99939036,0.0000010311262,0.0005127395,0.000034119956,0.000024154333,0.0000118437,0.000022456454,0.0000011070355,0.0000021551823],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913067,0.000036767997,0.0003630899,0.00011070803,0.00024770922,0.00011104835],"domain_scores_gemma":[0.998678,0.0008580333,0.00020063242,0.0001463537,0.00011118461,0.000005764609],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004118955,0.00007711618,0.00018736081,0.00027984852,0.00009175364,0.0000391242,0.0002783858,0.000020944792,0.000029760315],"category_scores_gemma":[0.0024261572,0.000051997802,0.00007304643,0.0016533032,0.00032514695,0.0007277898,0.000070864764,0.000059934468,0.0000018343829],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000005239533,0.000020012876,0.0016067893,0.000041526833,0.000023923107,7.3125737e-9,0.00016143534,0.61545527,0.000020046115,0.38237795,6.1824414e-7,0.00028718615],"study_design_scores_gemma":[0.000042628795,0.0000073824403,0.0038842345,0.000011586767,0.00006238187,8.4733344e-8,0.000048235812,0.69664043,0.00003546028,0.29916275,0.00005789334,0.000046909034],"about_ca_topic_score_codex":0.00007457044,"about_ca_topic_score_gemma":0.00001321736,"teacher_disagreement_score":0.08321521,"about_ca_system_score_codex":0.000016029113,"about_ca_system_score_gemma":0.000010793693,"threshold_uncertainty_score":0.2904512},"labels":[],"label_agreement":null},{"id":"W2333428765","doi":"10.1145/2851553.2858658","title":"Predicting the System Performance by Combining Calibrated Performance Models of its Components","year":2016,"lang":"en","type":"preprint","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Computer science; Workload; Component (thermodynamics); Simple (philosophy); Performance prediction; Focus (optics); Noise (video); Simulation; Artificial intelligence","score_opus":0.02395573199194269,"score_gpt":0.2136145302093589,"score_spread":0.1896587982174162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2333428765","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9560346,0.00020630637,0.008395506,0.00018060592,0.0005896951,0.0005576633,0.000027151666,0.00038700327,0.033621464],"genre_scores_gemma":[0.9980762,0.000070959126,0.00008036849,0.00015184892,0.00038621997,0.00007008257,0.000114021226,0.000075623684,0.00097468216],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974272,0.000056384273,0.00090212683,0.0005854275,0.00056190597,0.0004669568],"domain_scores_gemma":[0.997209,0.00013521977,0.001402514,0.0008304043,0.0004036321,0.00001922863],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0010503224,0.0004803825,0.00069279445,0.000246674,0.0004690248,0.00018717398,0.0011852357,0.00022368462,0.00009458202],"category_scores_gemma":[0.000049207913,0.00030654157,0.00018587931,0.00040514502,0.00013218312,0.0017148718,0.0016863607,0.0005335643,0.000110518566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005860421,0.00027999454,0.05108544,0.019556684,0.0015479834,0.000010752709,0.0004703209,0.8210756,0.007895602,0.08916645,0.002016711,0.0063084206],"study_design_scores_gemma":[0.00037618948,0.000006879514,0.00028308737,0.0024673624,0.00022342449,0.0000014150522,0.00021232142,0.9938357,0.0010881939,0.0008144723,0.0002997381,0.0003912435],"about_ca_topic_score_codex":0.00015524408,"about_ca_topic_score_gemma":0.000003098791,"teacher_disagreement_score":0.17276007,"about_ca_system_score_codex":0.00009485353,"about_ca_system_score_gemma":0.00003178642,"threshold_uncertainty_score":0.99993867},"labels":[],"label_agreement":null},{"id":"W2337001255","doi":"10.1016/b978-0-443-14081-5.00060-x","title":"Control of Stochastic Systems","year":2025,"lang":"en","type":"book-chapter","venue":"Elsevier eBooks","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Markov chain; Phone; Grading (engineering); Computer science; Dynamic programming; Operations research; Markov process; Library science; Mathematics; Engineering; Algorithm; Statistics; Machine learning; Linguistics; Philosophy","score_opus":0.009111440930250922,"score_gpt":0.21333537514937845,"score_spread":0.20422393421912752,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337001255","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000005615311,0.0010101619,0.0041941307,0.0000324394,0.0005905486,0.00054972555,0.000024032526,0.00011638763,0.993477],"genre_scores_gemma":[0.049645543,0.0000025381285,0.000023959466,0.00043590073,0.0009500688,0.000032874883,0.000025577374,0.00006861499,0.9488149],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9983924,0.000010166823,0.0006402108,0.00040277126,0.00031819814,0.00023622841],"domain_scores_gemma":[0.9980247,0.00015158436,0.0008597281,0.00063290814,0.00031845673,0.000012636532],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00037802642,0.00040859688,0.0009396027,0.000551492,0.000096231066,0.00008023949,0.00040718008,0.00022666335,0.00018138802],"category_scores_gemma":[0.00010784355,0.00039074963,0.00035519616,0.000040890933,0.00013698831,0.00012829501,0.00016030061,0.000300164,0.00023619381],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048291953,0.000006892156,0.0000015834664,0.00079820375,0.0004342718,0.000012048368,0.0000063084212,0.0012474586,0.000015542497,0.69103456,0.000176142,0.30621868],"study_design_scores_gemma":[0.00047714752,0.000006945431,6.4611663e-7,0.0017110632,0.0014928494,0.000001230951,0.000009938703,0.0035191278,0.0000011904971,0.086060345,0.90627277,0.00044676807],"about_ca_topic_score_codex":0.0000038829558,"about_ca_topic_score_gemma":0.0000090310305,"teacher_disagreement_score":0.9060966,"about_ca_system_score_codex":0.00005082006,"about_ca_system_score_gemma":0.000043419954,"threshold_uncertainty_score":0.99985445},"labels":[],"label_agreement":null},{"id":"W2337136367","doi":"10.1109/wsc.2008.4736250","title":"Speeding up call center simulation and optimization by Markov chain uniformization","year":2008,"lang":"en","type":"article","venue":"2008 Winter Simulation Conference","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Markov chain; Uniformization (probability theory); Mathematical optimization; Scheduling (production processes); Discrete event simulation; Limit (mathematics); Variable-order Markov model; Algorithm; Markov model; Simulation; Mathematics; Machine learning","score_opus":0.02722660027512881,"score_gpt":0.2563483864053878,"score_spread":0.22912178613025902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2337136367","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.057721283,0.000023865861,0.9388989,0.00024900123,0.00018601712,0.00023351455,0.000006263198,0.00017848847,0.0025026663],"genre_scores_gemma":[0.99566984,0.0000148651725,0.0016898678,0.0006116513,0.00029528837,0.0000052354194,0.00030634168,0.00003122351,0.0013756558],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987653,0.000028628636,0.00037407104,0.00036693114,0.00024090585,0.00022418352],"domain_scores_gemma":[0.9989727,0.00010996445,0.00029976273,0.0001833645,0.00041065124,0.00002353692],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020396024,0.00021675506,0.00020326942,0.00027314504,0.00030027464,0.00016410455,0.00012713559,0.00009429551,0.0004779756],"category_scores_gemma":[0.00019202533,0.00022546618,0.00005073183,0.00038105375,0.000080094345,0.002197538,0.00009022422,0.00010979319,0.000049429615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006535267,0.000026947742,0.0063406006,0.000021283464,0.000016583173,0.00000182989,0.0001363762,0.9898025,0.00007963175,0.00075152674,0.00039835417,0.0023590436],"study_design_scores_gemma":[0.0006509611,0.0000072767116,0.0006080141,0.000042983975,0.000029470264,0.0000016605951,0.000043305037,0.9916978,0.000027409465,0.00045351355,0.0061896034,0.00024798902],"about_ca_topic_score_codex":0.000029996469,"about_ca_topic_score_gemma":0.000009094446,"teacher_disagreement_score":0.9379486,"about_ca_system_score_codex":0.000049637056,"about_ca_system_score_gemma":0.000011260233,"threshold_uncertainty_score":0.9194244},"labels":[],"label_agreement":null},{"id":"W2338193250","doi":"10.2139/ssrn.2318157","title":"Optimal Price-Lead Time Menus for Queues with Customer Choice: Priorities, Pooling &amp; Strategic Delay","year":2013,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University; University of Toronto","funders":"","keywords":"Pooling; Lead (geology); Queue; Lead time; Business; Microeconomics; Computer science; Operations research; Marketing; Industrial organization; Operations management; Economics; Engineering; Computer network","score_opus":0.011051069378295185,"score_gpt":0.23511997816750513,"score_spread":0.22406890878920993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2338193250","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9670243,0.0013466587,0.023600288,0.0008011666,0.00014177006,0.0006024508,0.0000021855012,0.00022385466,0.0062573045],"genre_scores_gemma":[0.9851242,0.00016125984,0.0020356805,0.00037946855,0.002341507,0.00006312296,0.000030476784,0.00010887769,0.009755418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9965258,0.00003115761,0.00040930707,0.00035162756,0.00034342858,0.0023386804],"domain_scores_gemma":[0.9986575,0.00011493141,0.000495384,0.00025434926,0.00044246996,0.000035336936],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0013417992,0.00033718717,0.00037136138,0.0003442578,0.0005689539,0.0005806375,0.000442247,0.000098132594,0.00031284182],"category_scores_gemma":[0.00010028808,0.00027166645,0.00017661715,0.00048661538,0.00008046266,0.00212448,0.00006326787,0.0011018177,0.0007277692],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011714775,0.0004992141,0.0025455814,0.00035936182,0.0034124388,0.000026523754,0.0002976964,0.09753537,0.00790488,0.8681911,0.0025518616,0.015504464],"study_design_scores_gemma":[0.0054111537,0.00041772926,0.00017596094,0.00032000578,0.0016931723,0.00057695364,0.0044887103,0.05547074,0.00017376673,0.845473,0.08318455,0.0026142779],"about_ca_topic_score_codex":0.00025369035,"about_ca_topic_score_gemma":0.00051504397,"teacher_disagreement_score":0.08063269,"about_ca_system_score_codex":0.00051195786,"about_ca_system_score_gemma":0.00051426375,"threshold_uncertainty_score":0.99997354},"labels":[],"label_agreement":null},{"id":"W2340807402","doi":"10.2139/ssrn.2612230","title":"Pricing of Differentiated Services: Apparent Loss and Welfare","year":2015,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Welfare; Business; Deadweight loss; Economics; Market economy","score_opus":0.008474350521203907,"score_gpt":0.21568270750840624,"score_spread":0.20720835698720233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2340807402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9906227,0.001094811,0.006519518,0.0004346777,0.000105195635,0.00006736012,4.3610842e-7,0.00004651952,0.0011087647],"genre_scores_gemma":[0.99919915,0.00023878782,0.000032652053,0.000094994844,0.00029751362,0.0000014556867,0.000007822765,0.000021017577,0.00010661051],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99843705,0.000020869327,0.00027780345,0.00015971549,0.00023995608,0.00086460594],"domain_scores_gemma":[0.9992854,0.00001587586,0.00037679076,0.00013789952,0.00016174975,0.00002228419],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009923234,0.00014449016,0.00022920522,0.00021771624,0.00015425924,0.00008577603,0.00022146975,0.000041580144,0.00002685023],"category_scores_gemma":[0.000055049662,0.000119938304,0.000067938476,0.00033669476,0.000039669827,0.00064640964,0.000110032095,0.000503214,0.000011960973],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036909178,0.00022173102,0.07302127,0.000325426,0.00076316297,0.000016127777,0.00040344615,0.0023626327,0.0005042041,0.892018,0.000019414167,0.029975476],"study_design_scores_gemma":[0.001969082,0.00007356581,0.0020606874,0.00013744354,0.0004693722,0.00010446117,0.012356682,0.0076948376,0.00008338617,0.9680506,0.006573049,0.00042686056],"about_ca_topic_score_codex":0.00016156101,"about_ca_topic_score_gemma":0.0004304281,"teacher_disagreement_score":0.07603256,"about_ca_system_score_codex":0.00016207976,"about_ca_system_score_gemma":0.00008544293,"threshold_uncertainty_score":0.4890942},"labels":[],"label_agreement":null},{"id":"W2342804801","doi":"10.2139/ssrn.2472107","title":"Efficient Ignorance: Information Heterogeneity in a Queue","year":2014,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":36,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Toronto","funders":"","keywords":"Ignorance; Queue; Computer science; Political science; Law; Computer network","score_opus":0.00431458246263078,"score_gpt":0.21166972639528708,"score_spread":0.2073551439326563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2342804801","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9074847,0.00013208209,0.08909985,0.0003905625,0.00013878618,0.0000832859,2.1184381e-7,0.000051775358,0.0026187266],"genre_scores_gemma":[0.99875444,0.000034825076,0.000051023657,0.0006564636,0.00044561745,0.000005039605,0.000004825276,0.000011319334,0.000036414884],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99812853,0.000034571807,0.0003340837,0.0001186175,0.00022333756,0.0011608832],"domain_scores_gemma":[0.9994189,0.000026002983,0.00028837513,0.00015454202,0.00010144193,0.000010743681],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027573374,0.00013146808,0.00016954468,0.00038880392,0.00017502275,0.0001497008,0.00023797883,0.000047581805,0.000021717544],"category_scores_gemma":[0.0002484361,0.00011947173,0.000093872746,0.0005181774,0.000026514948,0.0008892864,0.00005193161,0.00078125537,0.00023040245],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000107025975,0.00006858883,0.0067979447,0.000028225584,0.00005042565,0.0000012706743,0.000052324525,0.18018286,0.00013442639,0.76768404,0.000024030665,0.044868838],"study_design_scores_gemma":[0.0017464675,0.000043617776,0.0026168805,0.00006399001,0.00007422157,0.00004769806,0.0009219342,0.24913307,0.00006266798,0.73004895,0.014778467,0.0004620462],"about_ca_topic_score_codex":0.00011579129,"about_ca_topic_score_gemma":0.0012039846,"teacher_disagreement_score":0.091269754,"about_ca_system_score_codex":0.00038922613,"about_ca_system_score_gemma":0.00011048415,"threshold_uncertainty_score":0.4871916},"labels":[],"label_agreement":null},{"id":"W2392609035","doi":"10.1016/j.ejor.2016.05.009","title":"Resource pooling in the presence of failures: Efficiency versus risk","year":2016,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Pooling; Queue; Server; Computer science; Queueing theory; Resource (disambiguation); Risk pool; Computer network; Artificial intelligence; Economics; Actuarial science","score_opus":0.05861832224142698,"score_gpt":0.32879188586161956,"score_spread":0.27017356362019257,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2392609035","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96004146,0.0002137535,0.0064891162,0.005614935,0.00010844217,0.00014131636,0.0000026784508,0.000006857705,0.027381456],"genre_scores_gemma":[0.9986615,0.000031307663,0.00029361396,0.00007417648,0.0007370283,8.961943e-7,7.639113e-7,0.000013016687,0.00018766365],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99717337,0.0009150137,0.0004696211,0.00013538977,0.00108657,0.00022003235],"domain_scores_gemma":[0.99686366,0.0018548075,0.0002841678,0.00022002976,0.0007636012,0.000013725188],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.014948587,0.000076004304,0.00012631148,0.0005020104,0.00023555961,0.00013886328,0.0008691105,0.0000119881415,0.0001614016],"category_scores_gemma":[0.007925812,0.000040214585,0.00007880385,0.0007971115,0.0002095285,0.00077297137,0.00016318045,0.00036932537,0.00009985799],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0104684,0.0014417008,0.029318977,0.00021531618,0.00045001792,0.0016318639,0.0058113593,0.2303197,0.05172854,0.53028196,0.026360312,0.11197187],"study_design_scores_gemma":[0.020619137,0.0016211226,0.089536875,0.0032102263,0.00029238765,0.00011521381,0.02376694,0.02454363,0.0029423404,0.027529228,0.8044625,0.0013604112],"about_ca_topic_score_codex":0.000023551205,"about_ca_topic_score_gemma":0.000013694323,"teacher_disagreement_score":0.77810216,"about_ca_system_score_codex":0.000033451863,"about_ca_system_score_gemma":0.00005475088,"threshold_uncertainty_score":0.9488509},"labels":[],"label_agreement":null},{"id":"W2400062668","doi":"10.1080/03155986.2001.11732428","title":"Steady-State Distributions Of Parallel Queues","year":2001,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Queue; Joins; Fork–join queue; Markov chain; Burke's theorem; Generating function; Mathematics; Steady state (chemistry); Computer science; Probability distribution; Applied mathematics; Queue management system; Combinatorics; Computer network; Statistics","score_opus":0.048194561956117835,"score_gpt":0.33104788334135127,"score_spread":0.28285332138523345,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2400062668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7175174,0.00037465058,0.08667906,0.00219771,0.0003938447,0.0017208275,0.00017861203,0.00019198789,0.19074593],"genre_scores_gemma":[0.998299,0.00004537315,0.00010633392,0.0001396333,0.00016067615,0.00006681149,0.00028231603,0.000004597122,0.0008952615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99855965,0.000024876834,0.00052568415,0.00008177648,0.00060079567,0.00020721075],"domain_scores_gemma":[0.99815476,0.00012625127,0.0001599468,0.00015101954,0.0013882429,0.000019779518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015458156,0.00008648092,0.00014800373,0.0004567775,0.00040733392,0.00053570286,0.00014331655,0.000043281012,0.00008162081],"category_scores_gemma":[0.00046424766,0.0000728975,0.000036083104,0.00065508817,0.0001224267,0.00513671,0.00010782467,0.00013028656,0.00026868982],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000076878256,0.000018274259,0.0035089294,0.00015445446,0.00003172151,9.502214e-7,0.00021678879,0.026919039,0.00004844645,0.9640768,0.0019209088,0.0030268],"study_design_scores_gemma":[0.0007412019,0.000026611864,0.0046960227,0.00011402596,0.000013659285,0.0000115547555,0.0030675954,0.18336745,0.000031005333,0.008679342,0.7990117,0.00023983709],"about_ca_topic_score_codex":0.0007831941,"about_ca_topic_score_gemma":0.000041785977,"teacher_disagreement_score":0.9553975,"about_ca_system_score_codex":0.000039141196,"about_ca_system_score_gemma":0.00005282383,"threshold_uncertainty_score":0.5165795},"labels":[],"label_agreement":null},{"id":"W2410106254","doi":"10.1287/opre.2016.1499","title":"Modeling Load and Overwork Effects in Queueing Systems with Adaptive Service Rates","year":2016,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Queueing theory; Server; Staffing; Process (computing); Service (business); Real-time computing; Distributed computing; Computer network; Operating system","score_opus":0.04115734453721014,"score_gpt":0.31670431190014675,"score_spread":0.2755469673629366,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2410106254","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94402176,0.00036433022,0.051869225,0.0011500573,0.0000348281,0.0005081155,0.0000010189253,0.000051738305,0.0019989498],"genre_scores_gemma":[0.9985989,0.000021657374,0.00045330747,0.00009044408,0.00018430004,0.00011149597,0.0000022929578,0.000020234753,0.0005173741],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883425,0.000096881515,0.00014747033,0.00028946137,0.00034289656,0.000289042],"domain_scores_gemma":[0.9987998,0.00025174447,0.00001496941,0.00021149243,0.00070733024,0.000014683725],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012190405,0.00010233054,0.00014592012,0.00033971557,0.00037299976,0.000397869,0.0001376583,0.000040241965,0.000019888532],"category_scores_gemma":[0.00037754758,0.00006616369,0.000011756065,0.0011334406,0.000053825042,0.0015538913,0.00014313402,0.00015615246,0.00011053953],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015166787,0.000042108382,0.0026846726,0.00015416903,0.00003861946,0.000024782932,0.00018302776,0.87817687,0.004042123,0.112397805,0.000024917299,0.0020792596],"study_design_scores_gemma":[0.00047111252,0.00001379906,0.00017403367,0.00060894416,0.000010738958,0.0000010826152,0.0006520866,0.9960048,0.00007444738,0.0016839235,0.00017583458,0.00012916661],"about_ca_topic_score_codex":0.0049556,"about_ca_topic_score_gemma":0.007793,"teacher_disagreement_score":0.11782799,"about_ca_system_score_codex":0.00011304417,"about_ca_system_score_gemma":0.000055033648,"threshold_uncertainty_score":0.7491418},"labels":[],"label_agreement":null},{"id":"W2412110880","doi":"10.5539/ijsp.v5n4p45","title":"Dynamic Reliability of a Cluster Server","year":2016,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Queue; Computer science; Task (project management); Channel (broadcasting); Poisson process; Function (biology); Poisson distribution; Dependency (UML); Reliability (semiconductor); Computer network; Process (computing); Real-time computing; Operating system; Mathematics; Statistics; Artificial intelligence; Engineering","score_opus":0.008787367478200086,"score_gpt":0.2545118288699656,"score_spread":0.24572446139176551,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2412110880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8440963,0.000024738398,0.15303081,0.002097979,0.00034171614,0.00006733872,0.00005805369,0.0000064830133,0.00027660103],"genre_scores_gemma":[0.9868569,0.00002230749,0.012786253,0.00016237909,0.00011070322,8.431302e-7,0.00000259399,0.000005833893,0.000052216386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899274,0.0000232962,0.00049288047,0.00011346241,0.00030110372,0.00007653664],"domain_scores_gemma":[0.9976847,0.00029106124,0.00059127115,0.00011812198,0.0013027417,0.00001211049],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096683204,0.00007736643,0.00017659135,0.000106906315,0.000023047922,0.000035406072,0.0002141262,0.00002729917,0.00018839112],"category_scores_gemma":[0.0014088764,0.000048900583,0.00006316027,0.00006852692,0.00015059422,0.00055048073,0.00010601729,0.00006528806,0.00000497712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024416507,0.00075943477,0.28390443,0.0005597808,0.0005688101,0.000049126327,0.00016607474,0.0022944934,0.0028755565,0.5361029,0.00133165,0.1689461],"study_design_scores_gemma":[0.0007021595,0.000026217227,0.039480887,0.00009787295,0.00006456249,0.000008844457,0.000014405356,0.0028922213,0.00004699464,0.9532088,0.003365869,0.00009116245],"about_ca_topic_score_codex":0.000025744395,"about_ca_topic_score_gemma":0.000036672223,"teacher_disagreement_score":0.4171059,"about_ca_system_score_codex":0.000054835702,"about_ca_system_score_gemma":0.000022114496,"threshold_uncertainty_score":0.20627506},"labels":[],"label_agreement":null},{"id":"W2413881819","doi":"","title":"Dimensioning large call centers","year":2000,"lang":"en","type":"article","venue":"Data Archiving and Networked Services (DANS)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"Centrum Wiskunde and Informatica; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; Israel Science Foundation; European Research Consortium for Informatics and Mathematics","keywords":"Staffing; Rule of thumb; Queue; Queueing theory; Mathematical optimization; Computer science; Constraint (computer-aided design); Range (aeronautics); Quality (philosophy); Mathematics; Operations research; Algorithm; Engineering; Economics; Computer network; Physics","score_opus":0.009742676584529094,"score_gpt":0.22143591252787037,"score_spread":0.21169323594334127,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2413881819","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98245597,0.00027911022,0.0022234672,0.00022384958,0.00015629214,0.00012825172,0.000060690563,0.0003056115,0.0141667295],"genre_scores_gemma":[0.9935155,0.00013637422,0.00066083606,0.0025290768,0.0008550326,0.0000046862583,0.0015727311,0.000043877437,0.000681896],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983872,0.00004297108,0.00027060576,0.00060323847,0.00018743369,0.0005085573],"domain_scores_gemma":[0.9988213,0.00011331555,0.00013089788,0.0008802503,0.000019797046,0.000034417997],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00058358465,0.00024292145,0.0002562398,0.00011514736,0.00057265314,0.0002640925,0.00089536497,0.00004036547,0.00022697772],"category_scores_gemma":[0.000012238904,0.00021597763,0.00004833125,0.00036304613,0.000059207105,0.0014697431,0.00084202,0.00019494195,0.00019896838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001969499,0.000968942,0.40393472,0.0027651922,0.0014300916,0.00045784272,0.0060458807,0.119891874,0.0031165131,0.021599742,0.015585036,0.42223468],"study_design_scores_gemma":[0.00046621205,0.0000054428756,0.009106524,0.0003287108,0.00017223721,0.00000548389,0.00033118404,0.8282226,0.0000033562737,0.0023533772,0.15862109,0.00038381224],"about_ca_topic_score_codex":0.0005736088,"about_ca_topic_score_gemma":0.001221685,"teacher_disagreement_score":0.7083307,"about_ca_system_score_codex":0.000009809216,"about_ca_system_score_gemma":0.0000040231657,"threshold_uncertainty_score":0.8807312},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.017076388159439834,"score_gpt":0.24866434120553155,"score_spread":0.2315879530460917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2416587397","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47491744,0.0000051921315,0.5224762,0.0005950698,0.00017338542,0.00037513752,0.0000011693663,0.00016510107,0.0012913091],"genre_scores_gemma":[0.9881507,0.000003096,0.011051219,0.00042982734,0.00014888313,0.000076294455,0.0000041799003,0.000025465328,0.00011029464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99805284,0.000018822377,0.00027061306,0.0007377537,0.00036722628,0.00055272214],"domain_scores_gemma":[0.998954,0.00013309265,0.00028732457,0.00033167592,0.00025932537,0.00003456299],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016701833,0.0002360349,0.00021947107,0.00048895355,0.00086732366,0.000530315,0.00043461635,0.00002765484,0.000007015953],"category_scores_gemma":[0.00009341727,0.0001655546,0.000046903922,0.0011303659,0.00021732651,0.0026343097,0.00030668027,0.000055373504,0.000024101246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00063003565,0.00008993479,0.0014726887,0.0014573205,0.00022176479,0.000022523585,0.00024206769,0.20468952,0.0953039,0.66142786,0.00003112622,0.034411263],"study_design_scores_gemma":[0.0036962011,0.000052761414,0.001232786,0.0017230596,0.00046596178,0.0000033002584,0.011185346,0.9603947,0.008758316,0.009831316,0.001561815,0.0010944568],"about_ca_topic_score_codex":0.000040767016,"about_ca_topic_score_gemma":0.00013172478,"teacher_disagreement_score":0.7557052,"about_ca_system_score_codex":0.00025057016,"about_ca_system_score_gemma":0.000012595341,"threshold_uncertainty_score":0.67511207},"labels":[],"label_agreement":null},{"id":"W2460485959","doi":"10.2139/ssrn.2616933","title":"Collaboration and Multitasking in Networks: Capacity versus Queue Control","year":2015,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Human multitasking; Queue; Control (management); Computer science; Operations management; Computer network; Business; Psychology; Cognitive psychology; Engineering; Artificial intelligence","score_opus":0.01368566775148637,"score_gpt":0.23492932483161416,"score_spread":0.2212436570801278,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2460485959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91900325,0.0019507888,0.07579331,0.0011701277,0.0005463222,0.00018596063,5.954045e-7,0.00006563588,0.0012840256],"genre_scores_gemma":[0.9986509,0.00012324304,0.00007509517,0.00020762059,0.00087333255,0.000004290298,0.0000030345352,0.000016282873,0.000046216424],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984738,0.000048750804,0.00022956451,0.00016102797,0.00016237135,0.0009244402],"domain_scores_gemma":[0.99941385,0.000065490014,0.00022171889,0.00009455815,0.00018482414,0.000019532015],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024330332,0.00012576085,0.00018315451,0.00021742212,0.00014193702,0.00020450096,0.00012193015,0.000057574296,0.000005845634],"category_scores_gemma":[0.0004901654,0.00012017383,0.000035255704,0.0005146613,0.000040405015,0.001403066,0.000030146977,0.0007462112,0.000012828912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001541615,0.00008873038,0.021654705,0.000013756118,0.0002588004,0.000016800415,0.00020809201,0.19394891,0.00012526085,0.76857424,0.00014176377,0.013427323],"study_design_scores_gemma":[0.011734017,0.00010997151,0.00084387057,0.000057634716,0.0002518875,0.000037993726,0.0084623955,0.3546588,0.00000680386,0.618962,0.004343575,0.0005310577],"about_ca_topic_score_codex":0.0002766209,"about_ca_topic_score_gemma":0.010834397,"teacher_disagreement_score":0.16070989,"about_ca_system_score_codex":0.0005830076,"about_ca_system_score_gemma":0.00020515884,"threshold_uncertainty_score":0.60458475},"labels":[],"label_agreement":null},{"id":"W2464850106","doi":"10.1007/s11134-016-9488-8","title":"Choosing among heterogeneous server clouds","year":2016,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Blocking (statistics); Computer science; Stationary distribution; Cloud computing; Poisson process; Load balancing (electrical power); Mathematics; Distributed computing; Poisson distribution; Computer network; Statistics; Operating system; Markov chain","score_opus":0.011809012230126042,"score_gpt":0.21415256460573365,"score_spread":0.2023435523756076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2464850106","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.980192,0.00023077634,0.010582859,0.00017311033,0.0011390833,0.00022439286,0.0000014895342,0.0005847955,0.0068715084],"genre_scores_gemma":[0.9948729,0.000003571217,0.00003394896,0.00024941642,0.002048868,0.000027288053,0.0000037828092,0.00006662074,0.002693598],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984108,0.000043571745,0.00040864153,0.00041828584,0.00028885482,0.00042981323],"domain_scores_gemma":[0.99887276,0.00009095077,0.00035503102,0.00052638864,0.00013196314,0.00002292157],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0006202382,0.0002434129,0.00032529217,0.00022059417,0.00024722496,0.00032411213,0.00033054265,0.00009483298,0.00013273979],"category_scores_gemma":[0.00016500773,0.00017395246,0.00015358724,0.00039002724,0.00007584338,0.0013960646,0.00014484796,0.0000846735,0.00089494075],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021724161,0.00023065832,0.41932634,0.001683063,0.000994178,0.0005494465,0.0002955841,0.07251037,0.021309577,0.4605314,0.0043745018,0.017977625],"study_design_scores_gemma":[0.009312436,0.00012948024,0.030204514,0.014341366,0.0020207274,0.00023902465,0.0019549653,0.2906118,0.007923161,0.08015026,0.55313957,0.009972695],"about_ca_topic_score_codex":0.00073461945,"about_ca_topic_score_gemma":0.00007920777,"teacher_disagreement_score":0.54876506,"about_ca_system_score_codex":0.00010142537,"about_ca_system_score_gemma":0.000008398233,"threshold_uncertainty_score":0.999883},"labels":[],"label_agreement":null},{"id":"W2467420907","doi":"10.1080/15326349.2016.1193753","title":"On a general mixed priority queue with server discretion","year":2016,"lang":"en","type":"article","venue":"Stochastic Models","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Priority queue; Priority inheritance; Priority ceiling protocol; Deadline-monotonic scheduling; Class (philosophy); Queueing theory; Service (business); Queue; Mathematics; Operations research; Computer science; Computer network; Business; Quality of service; Dynamic priority scheduling; Rate-monotonic scheduling","score_opus":0.013899630839446708,"score_gpt":0.21870720864782986,"score_spread":0.20480757780838316,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2467420907","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2700117,0.000004874403,0.72801304,0.00038264695,0.00008232813,0.00013490333,0.000003028926,0.000112309135,0.0012551468],"genre_scores_gemma":[0.99712384,4.378689e-7,0.0007649634,0.00041242523,0.0003781667,0.000032885575,0.000008745943,0.000032577656,0.0012459664],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99891603,0.000014723818,0.00016602859,0.00035707137,0.00027634265,0.00026983334],"domain_scores_gemma":[0.9992546,0.000068311434,0.0001932291,0.00035453658,0.00011154697,0.000017785995],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002226973,0.00019250409,0.00019597041,0.0001442502,0.00013526263,0.00006371638,0.00016879171,0.00004879331,0.00019671535],"category_scores_gemma":[0.000093155126,0.00011569113,0.000068113244,0.00023715674,0.00007227762,0.0010115552,0.0000577635,0.00007750957,0.00019530352],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028758563,0.000048733968,0.000023595157,0.000020125159,0.00004280035,0.000005701424,0.000019306402,0.27619252,0.00031677354,0.7193299,0.00008096138,0.003632045],"study_design_scores_gemma":[0.0009804828,0.000033819397,0.00012508214,0.00018249251,0.00012715762,0.0000016332443,0.00002141277,0.35027874,0.000042952015,0.64774245,0.00010196952,0.0003618342],"about_ca_topic_score_codex":0.00008908263,"about_ca_topic_score_gemma":0.00010840075,"teacher_disagreement_score":0.7272481,"about_ca_system_score_codex":0.000056000612,"about_ca_system_score_gemma":0.0000137683555,"threshold_uncertainty_score":0.47177473},"labels":[],"label_agreement":null},{"id":"W2473416305","doi":"10.1007/978-1-4939-3420-1_10","title":"Special Single Node Queueing Models","year":2015,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Queueing theory; Network packet; Queue; Layered queueing network; Class (philosophy); Node (physics); Computer network; Service (business); Priority queue; Distributed computing; Artificial intelligence; Engineering","score_opus":0.05526840895070956,"score_gpt":0.23348316297763816,"score_spread":0.1782147540269286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2473416305","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000111906065,0.00011375434,0.008061753,0.00021391497,0.00079180015,0.00014477254,0.0000037452835,0.00036216652,0.9902969],"genre_scores_gemma":[0.0017719964,0.000008583671,0.0009454979,0.0015348507,0.03571161,0.000004088135,0.00010521144,0.00017757785,0.9597406],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9982426,0.0000037572127,0.0004197046,0.0005430743,0.0004716898,0.0003191618],"domain_scores_gemma":[0.9986203,0.00003603184,0.00043287888,0.000541993,0.00034593756,0.00002290718],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00034105786,0.00046570337,0.0005537667,0.0004693116,0.00013749611,0.00025025045,0.00041113637,0.0002753595,0.0066445],"category_scores_gemma":[0.000060518894,0.00045065585,0.0002717416,0.00008900471,0.00008980527,0.0014440792,0.00038718054,0.00032090867,0.0035491756],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027102198,0.00001532775,0.0000011604834,0.000042511583,0.00008010134,0.000031429667,0.000009384149,0.008278774,0.000008315851,0.9363995,0.05020576,0.0049005835],"study_design_scores_gemma":[0.00010731846,0.0000021221751,6.477741e-8,0.00006275395,0.00015217414,7.7369293e-7,0.000012245947,0.005290045,0.0000014984756,0.4902087,0.5038213,0.0003410186],"about_ca_topic_score_codex":0.000096399555,"about_ca_topic_score_gemma":0.00020764842,"teacher_disagreement_score":0.45361555,"about_ca_system_score_codex":0.00015024126,"about_ca_system_score_gemma":0.000027266584,"threshold_uncertainty_score":0.99979454},"labels":[],"label_agreement":null},{"id":"W2490944477","doi":"10.1007/978-1-4939-3420-1_7","title":"Multiserver Single Node Queueing Models","year":2015,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Server; Queueing theory; Computer science; Layered queueing network; Computer network; Node (physics); Queueing system; Distributed computing; Engineering","score_opus":0.06800811765396003,"score_gpt":0.24075921610210455,"score_spread":0.1727510984481445,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2490944477","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000044845026,0.0003280778,0.014494197,0.00018838444,0.00026581893,0.00017678074,0.0000043351047,0.00050744426,0.98399013],"genre_scores_gemma":[0.019634409,0.000011767568,0.002084532,0.0017610352,0.0019061114,0.000007688668,0.0001363259,0.000227259,0.9742309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981982,0.00000445065,0.00043556956,0.0005877386,0.00044319817,0.0003308099],"domain_scores_gemma":[0.9984045,0.000042695137,0.0004525225,0.00065434416,0.00042036016,0.0000255883],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00035590242,0.00050184113,0.0005610415,0.00043669867,0.00013180105,0.00022228765,0.0004339749,0.00029825425,0.0031893451],"category_scores_gemma":[0.00006457363,0.00047705928,0.00028802417,0.00008753304,0.00008024811,0.001774851,0.00044216268,0.00031745475,0.003005489],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000024413197,0.000023095141,0.000005008109,0.00008862608,0.00012316108,0.000035046778,0.000008245978,0.025572732,0.000027430831,0.96332943,0.0074560465,0.0033067493],"study_design_scores_gemma":[0.00022488758,0.0000028686707,3.3116424e-7,0.00014508615,0.0002598047,0.0000010165385,0.000015235299,0.04738567,0.0000044727353,0.5820649,0.36932552,0.00057020265],"about_ca_topic_score_codex":0.000287435,"about_ca_topic_score_gemma":0.00025837283,"teacher_disagreement_score":0.38126454,"about_ca_system_score_codex":0.00013642466,"about_ca_system_score_gemma":0.000020789947,"threshold_uncertainty_score":0.99976814},"labels":[],"label_agreement":null},{"id":"W2504042649","doi":"10.1007/978-1-4615-4559-0_6","title":"ATM Switches with the Guaranteed-Rate Property","year":2000,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Crossbar switch; Computer science; Property (philosophy); Computer network; Network packet; Packet switching; Transmission (telecommunications); Telecommunications","score_opus":0.014034080195259141,"score_gpt":0.18902173565940295,"score_spread":0.1749876554641438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2504042649","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00020152252,0.00011368336,0.00040485032,0.0020873288,0.000050392544,0.00033339844,0.0000022130314,0.00029821735,0.9965084],"genre_scores_gemma":[0.020445671,0.000036107314,0.00006086688,0.0073673483,0.0011813573,0.000019276606,0.000031272375,0.00013340115,0.9707247],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986849,0.000004895295,0.00026192993,0.0004871855,0.0002779893,0.00028310632],"domain_scores_gemma":[0.9988135,0.000055561726,0.00031734185,0.00067776296,0.00012718134,0.000008666455],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00034887283,0.0004837308,0.00042475248,0.00016985538,0.0003127602,0.000286333,0.00052406074,0.00014545444,0.0073553217],"category_scores_gemma":[0.000014775862,0.00020154736,0.00019259576,0.00011765445,0.000211066,0.0004944422,0.00013224506,0.00036744188,0.0033779037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036773545,0.000026437338,0.000031662887,0.00013471527,0.00060919893,0.000066222,0.00004004278,0.0011723127,0.00004496307,0.9616755,0.01682187,0.019009298],"study_design_scores_gemma":[0.00016648609,0.000008401904,0.0000054711377,0.00013455046,0.0004624876,0.0000034879865,0.000041542233,0.0003807898,0.000008114723,0.09858867,0.89974606,0.00045392272],"about_ca_topic_score_codex":0.00014448224,"about_ca_topic_score_gemma":0.00042158214,"teacher_disagreement_score":0.8829242,"about_ca_system_score_codex":0.000026740045,"about_ca_system_score_gemma":0.00002201391,"threshold_uncertainty_score":0.9973981},"labels":[],"label_agreement":null},{"id":"W2513809928","doi":"10.2139/ssrn.2816718","title":"Real-Time Dynamic Pricing for Revenue Management with Reusable Resources and Deterministic Service Time Requirements","year":2016,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Revenue management; Business; Revenue; Service (business); Dynamic pricing; Time management; Operations research; Operations management; Computer science; Industrial organization; Process management; Economics; Finance; Marketing; Engineering; Operating system","score_opus":0.005236964287991178,"score_gpt":0.2205801324680732,"score_spread":0.21534316818008203,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2513809928","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9704867,0.00022664934,0.022153597,0.00234302,0.0000714724,0.00062100036,0.0000069780904,0.00014343623,0.003947117],"genre_scores_gemma":[0.96511275,0.00070980226,0.0020594723,0.00047775786,0.0005733076,0.00004473473,0.00001183845,0.00012513444,0.030885179],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976566,0.00002850299,0.0003191256,0.00035473844,0.00024815815,0.0013929048],"domain_scores_gemma":[0.99901426,0.00009171545,0.00044654953,0.0002787875,0.00014517811,0.000023514945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016732858,0.0002288754,0.00027144613,0.0002554403,0.00044522906,0.00015774451,0.00032795095,0.00004538927,0.000042736465],"category_scores_gemma":[0.00007142314,0.00015955622,0.000062362145,0.00034459893,0.000049860642,0.0008530208,0.00012912203,0.00022828243,0.00012937568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009489415,0.0007706924,0.0065376833,0.0027013419,0.00794872,0.0003143994,0.00067983824,0.0026133351,0.14235197,0.3464822,0.0022404452,0.47786996],"study_design_scores_gemma":[0.0056591,0.00041498878,0.00075253315,0.0015809415,0.0018884763,0.00025238303,0.00092758,0.015988106,0.00008956591,0.94805473,0.023143169,0.0012484236],"about_ca_topic_score_codex":0.000032530028,"about_ca_topic_score_gemma":0.00024199343,"teacher_disagreement_score":0.6015726,"about_ca_system_score_codex":0.00043032374,"about_ca_system_score_gemma":0.00007188199,"threshold_uncertainty_score":0.6506514},"labels":[],"label_agreement":null},{"id":"W2515226632","doi":"10.1016/j.ifacol.2016.07.836","title":"Estimating the Clearing Function for a Multi-Product Production Network Based on Mean-Value Analysis","year":2016,"lang":"en","type":"article","venue":"IFAC-PapersOnLine","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Bottleneck; Clearing; Queueing theory; Product (mathematics); Throughput; Function (biology); Production (economics); Computer science; Value (mathematics); Mathematical optimization; Mathematics; Economics; Microeconomics; Machine learning; Computer network","score_opus":0.02867355372655724,"score_gpt":0.267143306546016,"score_spread":0.23846975281945873,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2515226632","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1436258,0.00006434333,0.84478885,0.00857797,0.0012743337,0.0008257005,0.000008364422,0.00049852574,0.00033612276],"genre_scores_gemma":[0.7395436,0.0000016901624,0.25070915,0.0017860712,0.006790303,0.000100024874,0.000073890136,0.00006714476,0.00092807773],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981167,0.00005117819,0.00037057576,0.00072497985,0.000302272,0.00043434263],"domain_scores_gemma":[0.9984169,0.00024012572,0.00041739436,0.00067964464,0.000228846,0.00001710445],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015071358,0.00028478945,0.00034389133,0.00031045722,0.00072735734,0.00013164307,0.00026437547,0.000058381964,0.00010434584],"category_scores_gemma":[0.0014313147,0.00017191596,0.00035306613,0.0016123295,0.000082691346,0.00066094677,0.00006703947,0.00014412672,0.00007873143],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003678575,0.00010015605,0.0027182784,0.000057450416,0.00042646026,0.0000010377064,0.00003089166,0.9489716,0.0022794136,0.0021550304,0.000033937245,0.042857867],"study_design_scores_gemma":[0.0006186306,0.000024824545,0.0024396356,0.00010750649,0.0018130373,3.5883278e-7,0.00007963394,0.9918431,0.00012214792,0.0014261063,0.0012306068,0.00029443015],"about_ca_topic_score_codex":0.00007156979,"about_ca_topic_score_gemma":0.00024485626,"teacher_disagreement_score":0.5959178,"about_ca_system_score_codex":0.000084710264,"about_ca_system_score_gemma":0.000014451839,"threshold_uncertainty_score":0.70105296},"labels":[],"label_agreement":null},{"id":"W2520918008","doi":"10.1109/wsc.2016.7822351","title":"Two-stage chance-constrained staffing with agent recourse for multi-skill call centers","year":2016,"lang":"en","type":"article","venue":"2016 Winter Simulation Conference (WSC)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Staffing; Randomness; Computer science; Mathematical optimization; Stochastic programming; Operations research; Imperfect; Service (business); Integer programming; Stage (stratigraphy); Mathematics; Economics; Statistics","score_opus":0.05460483476627123,"score_gpt":0.302281586837485,"score_spread":0.24767675207121378,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2520918008","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06277901,0.00001142748,0.93292797,0.0010304024,0.00039320855,0.00060496875,0.000044782097,0.00024226932,0.0019659894],"genre_scores_gemma":[0.98669875,0.00000571225,0.004553308,0.00086456677,0.0005168906,0.000056923822,0.000051679446,0.000054515018,0.007197685],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99827063,0.000029183951,0.00042239568,0.0005725852,0.00023270909,0.00047251806],"domain_scores_gemma":[0.9982175,0.00023584747,0.00048022324,0.0004159206,0.00061034504,0.00004016064],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00039469797,0.00032634306,0.0003283317,0.00028802492,0.00019001064,0.00019639879,0.00030835392,0.00007070418,0.000984106],"category_scores_gemma":[0.00030439353,0.00022309774,0.00014863237,0.00019640202,0.00014076453,0.0016371919,0.00010080862,0.000090023284,0.00022716116],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007998589,0.0016964029,0.033597525,0.0021217857,0.002116167,0.0001184015,0.002977889,0.30350646,0.03251009,0.1477655,0.0034730027,0.46211815],"study_design_scores_gemma":[0.008885644,0.00010179109,0.0009105265,0.002333547,0.00023741172,0.0000012750136,0.0007658918,0.9367837,0.0008828435,0.0021649145,0.045763947,0.0011685475],"about_ca_topic_score_codex":0.00005144619,"about_ca_topic_score_gemma":0.0002898287,"teacher_disagreement_score":0.92837465,"about_ca_system_score_codex":0.00010179916,"about_ca_system_score_gemma":0.00005061097,"threshold_uncertainty_score":0.99992913},"labels":[],"label_agreement":null},{"id":"W2525466116","doi":"10.2139/ssrn.2842316","title":"Optimal Mean-Reversion Strategy in the Presence of Bid-Ask Spread and Delays in Capital Allocations","year":2016,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mean reversion; Reversion; Ask price; Bid price; Economics; Econometrics; Microeconomics; Finance","score_opus":0.008674541562320276,"score_gpt":0.230054644662123,"score_spread":0.22138010309980272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2525466116","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.991902,0.00053031585,0.0059253015,0.0010731159,0.000021590151,0.000085306296,5.8947506e-7,0.0000070900696,0.00045467846],"genre_scores_gemma":[0.9990856,0.0005472622,0.0000415631,0.000049706196,0.0001093509,0.000003433573,0.0000011339148,0.00000836949,0.00015357113],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987638,0.000048757698,0.00024158393,0.00014096033,0.00016862528,0.00063627266],"domain_scores_gemma":[0.99949336,0.00012410313,0.00017976642,0.0001346152,0.00006141061,0.000006769948],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016742718,0.00009613457,0.00012713444,0.00025506734,0.00008452959,0.000042878484,0.000280787,0.00003614552,0.00002537009],"category_scores_gemma":[0.00013892671,0.000058825248,0.000043712407,0.00038047976,0.00007270383,0.00092019903,0.000053356827,0.0004053256,0.000009648408],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002139861,0.00016701869,0.025200263,0.000030491987,0.00010601502,0.00001823762,0.0006045354,0.01534391,0.008338561,0.9238401,0.00006397303,0.026072897],"study_design_scores_gemma":[0.0022470944,0.00013395114,0.01076356,0.0002475123,0.00014645689,0.000102442325,0.01822627,0.007498727,0.0002509599,0.95948726,0.0004933237,0.00040245],"about_ca_topic_score_codex":0.00036701854,"about_ca_topic_score_gemma":0.0050764247,"teacher_disagreement_score":0.035647143,"about_ca_system_score_codex":0.00012824529,"about_ca_system_score_gemma":0.00013828621,"threshold_uncertainty_score":0.2832764},"labels":[],"label_agreement":null},{"id":"W2526189009","doi":"10.5539/jmr.v8n5p56","title":"Semigroup Methods for the M/G/1 Queueing Model with Working Vacation and Vacation Interruption","year":2016,"lang":"en","type":"article","venue":"Journal of Mathematics Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Natural Science Foundation of Xinjiang; Xinjiang University; National Natural Science Foundation of China","keywords":"Mathematics; Semigroup; Operator (biology); Queueing theory; Constant (computer programming); Queueing system; Discrete mathematics; Statistics; Computer science","score_opus":0.21206477340385055,"score_gpt":0.4622786062797499,"score_spread":0.2502138328758994,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2526189009","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.038160805,0.00014195839,0.95855093,0.0025675553,0.000032787615,0.00019019358,1.3835636e-7,0.000009926546,0.00034573392],"genre_scores_gemma":[0.8070361,0.00009952736,0.19186926,0.000061016657,0.00045172058,0.000023073902,4.1884712e-7,0.000026497783,0.00043241182],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989689,0.000058925743,0.00034101313,0.0001046763,0.00034943447,0.00017705657],"domain_scores_gemma":[0.9966632,0.0019362216,0.0004764016,0.0001805402,0.000731233,0.000012374863],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.008650428,0.000081001715,0.00016179627,0.00036970535,0.00025413441,0.00018686059,0.00025084347,0.000038296297,0.000012081368],"category_scores_gemma":[0.0014981051,0.00003891385,0.000056127108,0.00031960505,0.00007925122,0.0008206663,0.00008960229,0.0001823934,0.000003574564],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045950452,0.00020757965,0.0006779071,0.00072484405,0.00036496445,0.0000023211037,0.001662303,0.014206071,0.04341619,0.399047,0.0005928871,0.5386385],"study_design_scores_gemma":[0.0004220279,0.000029054332,0.00006484161,0.0006234749,0.00011627806,0.000011025653,0.0012645076,0.6324766,0.00057198526,0.36249363,0.0018413145,0.00008520676],"about_ca_topic_score_codex":0.0000043526206,"about_ca_topic_score_gemma":0.000009216996,"teacher_disagreement_score":0.76887524,"about_ca_system_score_codex":0.00007270051,"about_ca_system_score_gemma":0.000023694016,"threshold_uncertainty_score":0.29980826},"labels":[],"label_agreement":null},{"id":"W2531539956","doi":"10.3934/jimo.2016070","title":"Stability of a queue with discriminatory random order service discipline and heterogeneous servers","year":2016,"lang":"en","type":"article","venue":"Journal of Industrial and Management Optimization","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Server; Computer science; Service (business); Queue; Class (philosophy); Queueing theory; Poisson distribution; Stability (learning theory); Order (exchange); Computer network; Distributed computing; Mathematics; Statistics; Business; Artificial intelligence; Marketing","score_opus":0.021995928908178582,"score_gpt":0.2183483132544103,"score_spread":0.1963523843462317,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2531539956","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82083136,0.00008537947,0.17494099,0.0029958896,0.00018560584,0.0004277298,0.0000041198323,0.000023113671,0.0005057955],"genre_scores_gemma":[0.99688494,0.00017899202,0.002448031,0.0001730202,0.00024403751,0.0000040496393,0.0000041425924,0.000015838288,0.000046954898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990924,0.00003249813,0.000400263,0.00015031622,0.00021122703,0.00011327764],"domain_scores_gemma":[0.9988335,0.00005453106,0.00064685295,0.00011659558,0.00032824563,0.00002028903],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005848918,0.00013051585,0.00027062104,0.00021244331,0.00007784547,0.000055489927,0.00010036131,0.000048516726,0.00006525394],"category_scores_gemma":[0.0000874023,0.0000762152,0.00003812787,0.00038235355,0.00007423802,0.0010012876,0.00012474648,0.00006482002,4.192074e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.017376835,0.00079056027,0.033844486,0.0015493255,0.0020512785,0.00010104883,0.00046287125,0.8470966,0.0008483705,0.016955212,0.00040979366,0.07851359],"study_design_scores_gemma":[0.2963668,0.0032905503,0.009807005,0.0152782565,0.026952425,0.00029222752,0.022500148,0.53754187,0.0068448074,0.04642645,0.027678687,0.0070207505],"about_ca_topic_score_codex":0.00002220258,"about_ca_topic_score_gemma":0.000037132104,"teacher_disagreement_score":0.30955473,"about_ca_system_score_codex":0.000024787223,"about_ca_system_score_gemma":0.000011133758,"threshold_uncertainty_score":0.31079656},"labels":[],"label_agreement":null},{"id":"W2543253245","doi":"10.1287/msom.2016.0591","title":"Strategic Idleness and Dynamic Scheduling in an Open-Shop Service Network: Case Study and Analysis","year":2016,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":42,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Scheduling (production processes); Macro; Service provider; Service (business); Operations research; Workstation; Open shop; Dynamic priority scheduling; Operations management; Quality of service; Flow shop scheduling; Business; Computer network; Marketing","score_opus":0.028219838386356028,"score_gpt":0.2835787673987213,"score_spread":0.25535892901236523,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2543253245","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9931334,0.000042002262,0.0036938814,0.0012781683,0.000065800785,0.001041059,0.000003616765,0.00012262579,0.00061940093],"genre_scores_gemma":[0.99571073,0.000024311315,0.0021958258,0.0015631902,0.000100741185,0.00014453098,0.000043085507,0.00004749319,0.00017009488],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976901,0.00010017333,0.0005384875,0.0009701758,0.0002269497,0.0004741117],"domain_scores_gemma":[0.99879956,0.0000581205,0.00015609218,0.0008012223,0.00013731595,0.000047708287],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010170632,0.00039075775,0.00047114477,0.00079500093,0.0007010918,0.0016386411,0.0005825574,0.00006121014,0.00013752293],"category_scores_gemma":[0.0000063888524,0.00032311358,0.000037099024,0.0017197756,0.000029560191,0.0033684368,0.0014918192,0.00013772059,0.00003736693],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000094109244,0.00058199663,0.019677138,0.0003679636,0.0010653741,0.0011662489,0.0006095973,0.9544202,0.00009935417,0.008191988,0.0000015090162,0.013724506],"study_design_scores_gemma":[0.003430819,0.000057260495,0.048597246,0.00022170293,0.003371981,0.000040405957,0.035911903,0.89945495,0.000019871666,0.0074114725,0.00019186459,0.0012905417],"about_ca_topic_score_codex":0.0044671334,"about_ca_topic_score_gemma":0.1681787,"teacher_disagreement_score":0.16371158,"about_ca_system_score_codex":0.000087716835,"about_ca_system_score_gemma":0.000009468839,"threshold_uncertainty_score":0.9999221},"labels":[],"label_agreement":null},{"id":"W2559863272","doi":"10.1109/mascots.2016.47","title":"Exact Analysis of Energy-Aware Multiserver Queueing Systems with Setup Times","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Queueing theory; Computer science; Energy consumption; Constant (computer programming); Function (biology); Queueing system; Layered queueing network; Distributed computing; Energy (signal processing); Consumption (sociology); Computer network; Mathematics","score_opus":0.008341600328925407,"score_gpt":0.20942034978649063,"score_spread":0.2010787494575652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2559863272","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43134168,0.00019732912,0.52579844,0.00047961416,0.00017667157,0.00022584459,0.000021197513,0.00060666935,0.041152578],"genre_scores_gemma":[0.9929474,0.000006207656,0.00018446684,0.00015911116,0.00014330096,0.000011627672,0.000022187764,0.000027591768,0.0064981235],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99880844,0.000023694238,0.00032841452,0.0003335014,0.00026892472,0.00023704059],"domain_scores_gemma":[0.99878883,0.00013855057,0.00036895977,0.000454134,0.00023517087,0.0000143237385],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00027315746,0.00019552873,0.00047322086,0.0007322462,0.00008536079,0.00007760609,0.00023363215,0.000051504718,0.001269937],"category_scores_gemma":[0.000037569647,0.000110417575,0.00018829163,0.0016779765,0.00006709955,0.0011790558,0.000099791,0.00003288503,0.00005845375],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00053304556,0.00037134372,0.3780654,0.000564719,0.015850313,0.00008666529,0.00008006669,0.11752468,0.005646054,0.45808932,0.002799948,0.02038844],"study_design_scores_gemma":[0.0034986108,0.00006590214,0.019627012,0.0011533403,0.018920561,0.0000038594294,0.0017003966,0.90285647,0.0029600363,0.0054226574,0.041269735,0.0025213931],"about_ca_topic_score_codex":0.0020446475,"about_ca_topic_score_gemma":0.00078843813,"teacher_disagreement_score":0.7853318,"about_ca_system_score_codex":0.00003293465,"about_ca_system_score_gemma":0.000008845195,"threshold_uncertainty_score":0.999643},"labels":[],"label_agreement":null},{"id":"W2560119880","doi":"10.1017/jpr.2016.66","title":"Detailed computational analysis of queueing-time distributions of the BMAP/G/1 queue using roots","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":20,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Mathematics; Queueing theory; Applied mathematics; Computation; Markovian arrival process; Laplace transform; Algorithm; Mathematical analysis; Statistics","score_opus":0.014267918973192314,"score_gpt":0.23640784311947602,"score_spread":0.2221399241462837,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560119880","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93937385,0.000012644075,0.059477966,0.00043289328,0.000052438587,0.00015840614,0.000022126267,0.000011548079,0.00045814645],"genre_scores_gemma":[0.99658847,6.3572895e-7,0.0032283675,0.000050995717,0.000104519306,0.0000020960833,0.0000048850807,0.000009272846,0.000010748609],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981223,0.000052318315,0.0010237821,0.00018294778,0.00045278412,0.00016588533],"domain_scores_gemma":[0.99631685,0.00033465863,0.0021246965,0.00035804728,0.0008480299,0.000017714774],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015764146,0.00014787716,0.00061171025,0.00033289063,0.0001320722,0.000025873846,0.0004097068,0.000062195795,0.00023427031],"category_scores_gemma":[0.00047885926,0.00008591236,0.00054233294,0.001841504,0.00029752863,0.00042099893,0.00015713068,0.000126721,0.0000047516683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006760811,0.00062058767,0.108071126,0.00020423246,0.002961038,0.0000016756111,0.00008499538,0.66852033,0.052245315,0.1637437,0.000070695925,0.002800242],"study_design_scores_gemma":[0.0013327282,0.000020782754,0.14926745,0.00020291218,0.0065394538,0.0000031320747,0.00008402386,0.06727461,0.004939539,0.76964563,0.00033614002,0.00035361323],"about_ca_topic_score_codex":0.000017946038,"about_ca_topic_score_gemma":0.00004920826,"teacher_disagreement_score":0.6059019,"about_ca_system_score_codex":0.00014061871,"about_ca_system_score_gemma":0.00008950061,"threshold_uncertainty_score":0.35034043},"labels":[],"label_agreement":null},{"id":"W2560192555","doi":"10.1109/mascots.2016.48","title":"Autoscaling Effects in Speed Scaling Systems","year":2016,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Sarepta Therapeutics","keywords":"Scaling; Computer science; Robustness (evolution); Markov chain; Scheduling (production processes); Processor sharing; Markov process; Distributed computing; Mathematical optimization; Computer network; Mathematics; Queueing theory; Statistics","score_opus":0.00964648228392629,"score_gpt":0.22245245874828118,"score_spread":0.2128059764643549,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560192555","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.87768793,0.000105795014,0.08489408,0.0006013865,0.0006749366,0.00030672588,3.300495e-7,0.00054712116,0.03518172],"genre_scores_gemma":[0.9975441,0.0000017910226,0.00022417838,0.00036156777,0.00056315836,0.000006671095,0.0000012240193,0.000023544942,0.001273756],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990282,0.000019394784,0.00025349946,0.00026211803,0.00015377403,0.00028300378],"domain_scores_gemma":[0.9993869,0.00022025478,0.00011275597,0.00022367427,0.000047254292,0.000009142148],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000564565,0.0001356317,0.0002232552,0.00033020665,0.00006621348,0.00011521283,0.00017261344,0.00004996389,0.00011904555],"category_scores_gemma":[0.00037797928,0.00008747194,0.000063396685,0.00049647695,0.000029164574,0.00091502274,0.00009777916,0.000056623583,0.00073955883],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008438276,0.000111380345,0.049455892,0.00058494415,0.00008006335,0.00010453875,0.00003524145,0.021226067,0.037469886,0.8613247,0.0004679332,0.029054958],"study_design_scores_gemma":[0.007421988,0.0000234547,0.015473045,0.0044402033,0.00038406468,0.000009797821,0.00083755824,0.7341781,0.0054990486,0.18343021,0.045572247,0.0027302466],"about_ca_topic_score_codex":0.00023206798,"about_ca_topic_score_gemma":0.000029317247,"teacher_disagreement_score":0.7129521,"about_ca_system_score_codex":0.00005112411,"about_ca_system_score_gemma":0.0000041887674,"threshold_uncertainty_score":0.950578},"labels":[],"label_agreement":null},{"id":"W2560805977","doi":"10.1017/jpr.2016.64","title":"Sequential stochastic assignment problem with time-dependent random success rates","year":2016,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Mathematics; Task (project management); Mathematical optimization; Extension (predicate logic); Random variable; Expected value; Stochastic modelling; Stochastic optimization; Assignment problem; Computer science; Statistics","score_opus":0.01043175796452573,"score_gpt":0.22223550324376876,"score_spread":0.21180374527924303,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2560805977","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6899722,0.000031861615,0.3010686,0.0013437698,0.00016697563,0.0010404842,0.000004140569,0.000107328866,0.0062646046],"genre_scores_gemma":[0.9970938,0.0000013734801,0.0019801995,0.00014028761,0.00058193965,0.000030664756,0.0000017039978,0.00002976568,0.00014024178],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979759,0.0000397248,0.0007201237,0.0003198621,0.0006230331,0.000321352],"domain_scores_gemma":[0.99786115,0.00022153198,0.0011549551,0.0003146845,0.00040926697,0.000038424016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022594922,0.00025528437,0.0005280047,0.00018463022,0.00014934437,0.00015582681,0.00039825888,0.00006575842,0.00063176063],"category_scores_gemma":[0.00012580729,0.00013991125,0.00015201341,0.00030003008,0.00018301162,0.0009705763,0.00013043667,0.00019776191,0.0001296854],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.05466208,0.003386637,0.010991991,0.0013354062,0.0030782414,0.0001743276,0.00047363035,0.6166211,0.13398921,0.100840636,0.0016235571,0.07282322],"study_design_scores_gemma":[0.020412164,0.00028257104,0.00070126,0.00065383315,0.0017698824,0.00005643846,0.00020551767,0.0042366027,0.010918201,0.9565965,0.0028136126,0.0013534522],"about_ca_topic_score_codex":0.000008013453,"about_ca_topic_score_gemma":0.0000148364825,"teacher_disagreement_score":0.8557558,"about_ca_system_score_codex":0.00019919283,"about_ca_system_score_gemma":0.00007276488,"threshold_uncertainty_score":0.69173354},"labels":[],"label_agreement":null},{"id":"W2564669092","doi":"10.1109/infcom.1994.337669","title":"Capacity allocation in statistical multiplexing of ATM sources","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Multiplexer; Multiplexing; Linear approximation; Nonlinear system; Approximation algorithm; Mathematical optimization; Computer science; Simple (philosophy); Applied mathematics; Upper and lower bounds; Mathematics; Telecommunications; Mathematical analysis; Physics","score_opus":0.03220497350725152,"score_gpt":0.23354045162399298,"score_spread":0.20133547811674146,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2564669092","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90463483,0.000021744634,0.07519693,0.00032986127,0.000039413455,0.00008972089,0.0000015362668,0.000077193385,0.019608777],"genre_scores_gemma":[0.995446,0.0000016412383,0.004038488,0.00020586223,0.00008147168,0.0000033835245,0.0000061737665,0.0000073509304,0.00020958339],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99942344,0.00001071583,0.00020474067,0.00013100116,0.00011037318,0.000119716846],"domain_scores_gemma":[0.9996404,0.00009384514,0.00009752624,0.00011488331,0.000048990572,0.0000043675764],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002139676,0.000068345726,0.00012694384,0.000148169,0.000037439204,0.000024690728,0.00008691895,0.000025447065,0.0011839067],"category_scores_gemma":[0.0003259283,0.000063029845,0.000026332245,0.00031447868,0.000056518384,0.0004460288,0.0000374766,0.00005637608,0.00011431364],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003549301,0.00030615286,0.10396376,0.00020355199,0.000042573818,0.000006864065,0.0003555799,0.037806127,0.0040849936,0.8316456,0.0004997993,0.021049516],"study_design_scores_gemma":[0.0005219354,0.0000056223284,0.014965405,0.000041817086,0.000039648912,4.1903115e-7,0.00042890798,0.93276554,0.00072149525,0.047140144,0.0031306746,0.00023836776],"about_ca_topic_score_codex":0.0005821694,"about_ca_topic_score_gemma":0.00038346477,"teacher_disagreement_score":0.89495945,"about_ca_system_score_codex":0.000014979914,"about_ca_system_score_gemma":8.857331e-7,"threshold_uncertainty_score":0.99972916},"labels":[],"label_agreement":null},{"id":"W2565839211","doi":"10.1287/ijoc.2016.0720","title":"Efficient Computational Analysis of Stationary Probabilities for the Queueing System <i>BMAP</i>/<i>G</i>/1/<i>N</i> With or Without Vacation(s)","year":2016,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markovian arrival process; Markov chain; Queueing theory; Bulk queue; Computer science; Mathematical optimization; Queue; Markov process; Applied mathematics; Mathematics; Statistics; Computer network","score_opus":0.014795973728286603,"score_gpt":0.24730424359293712,"score_spread":0.2325082698646505,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2565839211","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.30316064,0.000019861045,0.69520223,0.0006980651,0.00014611873,0.0003409581,0.0000084694775,0.000076138684,0.00034755413],"genre_scores_gemma":[0.99232984,0.0000010747094,0.006332451,0.00080606365,0.00041937464,0.000014866066,0.000010001929,0.000023607934,0.000062737876],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980932,0.000022977743,0.0008036632,0.00021009638,0.0005826504,0.0002874493],"domain_scores_gemma":[0.99553823,0.0018308039,0.0013909964,0.0002330035,0.000985196,0.000021762238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015264031,0.00021267039,0.00042829913,0.0006597129,0.00071927236,0.00021025547,0.00034960583,0.000036816746,0.00002351463],"category_scores_gemma":[0.00029049726,0.000094342664,0.00024010094,0.0012834517,0.00013110369,0.0005296896,0.00007424099,0.00013172223,0.000007937146],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00048583956,0.000038230635,0.006003364,0.00011721158,0.00085276604,0.0000020023201,0.00019721671,0.938208,0.000016133861,0.04452901,0.0000522917,0.009497928],"study_design_scores_gemma":[0.0010277067,0.00006427083,0.0022897182,0.0004915121,0.0009475726,0.000019504647,0.0016298004,0.9901637,0.000022953744,0.0017390146,0.0013853642,0.00021891012],"about_ca_topic_score_codex":0.000018389423,"about_ca_topic_score_gemma":0.000020593303,"teacher_disagreement_score":0.68916917,"about_ca_system_score_codex":0.00012339001,"about_ca_system_score_gemma":0.000077411496,"threshold_uncertainty_score":0.5532134},"labels":[],"label_agreement":null},{"id":"W2575790218","doi":"10.5555/3042094.3042160","title":"New history-based delay predictors for service systems","year":2016,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Queue; Service (business); Simple (philosophy); Class (philosophy); Simplicity; Real-time computing; Computer network; Operations research; Artificial intelligence; Mathematics; Business","score_opus":0.03928727533269249,"score_gpt":0.25032364228541937,"score_spread":0.21103636695272687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2575790218","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013491144,0.000024240739,0.98218745,0.00097068044,0.0007069658,0.0002763244,0.00000503767,0.00022548267,0.0021126615],"genre_scores_gemma":[0.99471766,1.96266e-7,0.00058036525,0.0011823294,0.0007195825,0.00002433458,0.000021262584,0.000024440638,0.0027298373],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991027,0.000013412708,0.00026273503,0.00028461154,0.00015386616,0.00018268314],"domain_scores_gemma":[0.99872017,0.00023946632,0.00024365861,0.00028258987,0.0004940296,0.000020098632],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018464368,0.00015168855,0.00017171749,0.0001657349,0.000060546747,0.000083110615,0.00023504674,0.000058429352,0.0006865382],"category_scores_gemma":[0.00019285009,0.00011475485,0.00007586708,0.00014277438,0.000021141732,0.0008961652,0.00004025464,0.00003664307,0.00023356033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00070305995,0.00007529198,0.009669002,0.00047529256,0.00017830472,0.0000040230634,0.00021465754,0.79944205,0.0037309786,0.15413521,0.0108705545,0.020501561],"study_design_scores_gemma":[0.00084950984,0.000008974225,0.00025957293,0.00016949803,0.00007858365,1.1551844e-7,0.000019700436,0.7278029,0.000040430514,0.0039240355,0.2666408,0.00020592581],"about_ca_topic_score_codex":0.000099069424,"about_ca_topic_score_gemma":0.00005969779,"teacher_disagreement_score":0.9816071,"about_ca_system_score_codex":0.00012785348,"about_ca_system_score_gemma":0.00005879898,"threshold_uncertainty_score":0.75171113},"labels":[],"label_agreement":null},{"id":"W2591549786","doi":"10.5539/ijsp.v6n2p93","title":"Reliability of a Clustered-Task Server under Modulated Correlation","year":2017,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Reliability (semiconductor); Workload; Computer science; Task (project management); Function (biology); Server; Independence (probability theory); Correlation; Process (computing); Mathematical optimization; Mathematics; Statistics; Computer network","score_opus":0.017874350201886807,"score_gpt":0.27279435950008446,"score_spread":0.25492000929819764,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2591549786","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8560725,0.000017414375,0.14219856,0.0006457043,0.0004914732,0.000078241574,0.000037110774,0.0000060309585,0.00045296462],"genre_scores_gemma":[0.99353075,0.000011718317,0.006103886,0.00009736553,0.00020150773,6.768914e-7,0.000011976084,0.0000064655364,0.00003563564],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99890244,0.000023085355,0.00052869983,0.00013018276,0.0003388324,0.00007678311],"domain_scores_gemma":[0.9965835,0.00013459123,0.0013580929,0.00023386552,0.0016759223,0.000013985943],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009850617,0.00008924128,0.00020385506,0.00009590284,0.000115227835,0.0001638317,0.00034046947,0.00004304363,0.00008860116],"category_scores_gemma":[0.0016723105,0.000075013384,0.00006629473,0.000041073967,0.0001879568,0.0009551941,0.00015399817,0.0001285563,0.0000031820894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017054479,0.0006597908,0.37297285,0.0004137439,0.0006350885,0.000042413965,0.00021973738,0.10110261,0.0012061978,0.48583993,0.0005704005,0.034631763],"study_design_scores_gemma":[0.00050281634,0.00001694076,0.25941685,0.000053850334,0.00008317488,0.000005127487,0.000020097898,0.046879306,0.000019564759,0.6925015,0.00042351353,0.00007727973],"about_ca_topic_score_codex":0.00016698024,"about_ca_topic_score_gemma":0.00006526218,"teacher_disagreement_score":0.20666154,"about_ca_system_score_codex":0.00004927775,"about_ca_system_score_gemma":0.00002598299,"threshold_uncertainty_score":0.30589572},"labels":[],"label_agreement":null},{"id":"W2592566858","doi":"10.2139/ssrn.2921743","title":"Performance Bounds and Asymptotic Optimality of Modified (r, Q) Policies for Stochastic Distribution Inventory Systems","year":2017,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Distribution (mathematics); Mathematical optimization; Mathematics; Computer science; Economics; Applied mathematics","score_opus":0.01626645736401212,"score_gpt":0.2523719678347861,"score_spread":0.236105510470774,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2592566858","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9011406,0.00053645036,0.09752626,0.00017232311,0.00017721827,0.00015862996,0.0000048582783,0.000021125616,0.00026258596],"genre_scores_gemma":[0.9990197,0.0001222018,0.00001272031,0.000017570434,0.0005303482,0.000010974904,0.000014016711,0.000015547954,0.000256913],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850464,0.000014175031,0.00029379284,0.00015293396,0.00016737098,0.00086710893],"domain_scores_gemma":[0.9987581,0.00003326876,0.00073833327,0.00025372588,0.00020184703,0.000014758239],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018372355,0.00013694148,0.00025102159,0.000102853795,0.00090995315,0.0002811608,0.0003119634,0.000049934086,0.000001749534],"category_scores_gemma":[0.0003456928,0.000124066,0.00009130809,0.00007055273,0.00016445358,0.0011201963,0.0000849104,0.00034349685,0.000002244853],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002466964,0.000055236054,0.007259015,0.00026526852,0.00025139554,3.5822606e-7,0.000031662887,0.03470642,0.0002564791,0.9539477,0.000027441141,0.0029523226],"study_design_scores_gemma":[0.001948786,0.00015736859,0.009633207,0.00023914383,0.0006259646,0.00005715267,0.0010089548,0.6223829,0.000029285678,0.36293313,0.0005103767,0.00047377398],"about_ca_topic_score_codex":0.00019413998,"about_ca_topic_score_gemma":0.00008026612,"teacher_disagreement_score":0.59101456,"about_ca_system_score_codex":0.00026143476,"about_ca_system_score_gemma":0.00015410938,"threshold_uncertainty_score":0.6998716},"labels":[],"label_agreement":null},{"id":"W2593156224","doi":"10.1017/jpr.2017.20","title":"A unified approach for drawdown (drawup) of time-homogeneous Markov processes","year":2017,"lang":"en","type":"preprint","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Infimum and supremum; Markov process; Drawdown (hydrology); Mathematics; Applied mathematics; Homogeneous; Markov chain; Process (computing); Stochastic process; Overshoot (microwave communication); Lévy process; Mathematical optimization; Markov renewal process; Statistical physics; Mathematical economics; Markov property; Markov model; Mathematical analysis; Computer science; Statistics; Physics; Combinatorics; Engineering; Aquifer","score_opus":0.02250906747813936,"score_gpt":0.24934079757834093,"score_spread":0.22683173010020158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2593156224","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6078493,0.0013524852,0.23073646,0.0011734214,0.0014473518,0.01032221,0.00022812659,0.00038617227,0.14650446],"genre_scores_gemma":[0.935058,0.000029687735,0.062478237,0.00012084596,0.0017811921,0.00014275873,0.000086003914,0.000088442735,0.00021481057],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99682343,0.000031264415,0.001511689,0.0006492352,0.00059654465,0.000387822],"domain_scores_gemma":[0.9901378,0.00031790676,0.0061913943,0.0012386006,0.0020751213,0.000039160735],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0035000804,0.00051593874,0.001559526,0.0004025383,0.00028263265,0.0003271417,0.0016914834,0.00038589732,0.00008773952],"category_scores_gemma":[0.0021106536,0.00043899022,0.0006503804,0.00028721464,0.00037871322,0.00046820514,0.0008957514,0.00073135004,0.000008010239],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.026925951,0.007049094,0.003255004,0.117703654,0.006277641,0.000049859522,0.0011228315,0.697102,0.007592683,0.047777265,0.005684424,0.079459555],"study_design_scores_gemma":[0.0013724866,0.00006439255,0.00012634706,0.00052343827,0.0020506321,0.000011366795,0.00013092069,0.012863007,0.0018633155,0.9745883,0.0054908334,0.0009149695],"about_ca_topic_score_codex":0.000020626047,"about_ca_topic_score_gemma":0.000010821315,"teacher_disagreement_score":0.92681104,"about_ca_system_score_codex":0.00014050429,"about_ca_system_score_gemma":0.00043923524,"threshold_uncertainty_score":0.99980617},"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,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_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","score_opus":0.09270631862722876,"score_gpt":0.40285870037742794,"score_spread":0.31015238175019916,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2596292818","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9893482,0.000014956337,0.000013454191,0.005216881,0.000027361508,0.00021630387,0.000006751505,0.0000100094485,0.0051461365],"genre_scores_gemma":[0.9988613,0.000005339891,0.0000108036875,0.000014673106,0.00021179707,0.00002945252,0.000009247189,0.0000104728815,0.00084688264],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9992449,0.0000671366,0.00013769105,0.00014990114,0.00021397986,0.00018638729],"domain_scores_gemma":[0.9992982,0.000065461645,0.000049967428,0.000321391,0.00025891094,0.0000060554116],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0011627317,0.00006325643,0.00009802692,0.00021095751,0.0019082268,0.0006729977,0.0002477043,0.000038225055,0.00004279557],"category_scores_gemma":[0.0009198161,0.000046011763,0.000043943757,0.00026979376,0.0002473769,0.00082144834,0.00018906106,0.00020898016,0.000022423397],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011386675,0.00089011213,0.055584732,0.00017444379,0.0002155775,0.000030752755,0.0011964771,0.05265559,0.033275094,0.8012255,0.0063371225,0.047275968],"study_design_scores_gemma":[0.003235828,0.00028141556,0.71917355,0.00028285562,0.000058025656,0.0000034993425,0.00337055,0.21238759,0.0014594643,0.028061263,0.030960385,0.000725596],"about_ca_topic_score_codex":0.004266962,"about_ca_topic_score_gemma":0.010366066,"teacher_disagreement_score":0.7731642,"about_ca_system_score_codex":0.00009561448,"about_ca_system_score_gemma":0.000022983884,"threshold_uncertainty_score":0.99939114},"labels":[],"label_agreement":null},{"id":"W2600658505","doi":"10.2139/ssrn.2854492","title":"A Fluid Model for an Overloaded Bipartite Queueing System with Heterogeneous Matching Utility","year":2016,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia Hospital; University of British Columbia; McGill University","funders":"","keywords":"Bipartite graph; Queueing theory; Matching (statistics); Layered queueing network; Computer science; Fluid queue; Mathematics; Computer network; Theoretical computer science; Statistics","score_opus":0.014383395784517132,"score_gpt":0.23246935250026093,"score_spread":0.2180859567157438,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2600658505","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4271231,0.00013629053,0.5720711,0.00014922282,0.00004800317,0.0001460328,0.000001946812,0.00012922563,0.00019511316],"genre_scores_gemma":[0.9981769,0.000030241039,0.00045770282,0.00016847091,0.0006802426,0.000023926194,0.0000036302258,0.000065283,0.00039361505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971232,0.000037303034,0.00037414656,0.00037531176,0.00027140733,0.001818658],"domain_scores_gemma":[0.9989692,0.000054797885,0.00039577595,0.00032875105,0.00021759125,0.00003390988],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019867974,0.00025609427,0.00031022143,0.00021457483,0.00051766046,0.0002300386,0.00036329587,0.00006468968,0.000010692442],"category_scores_gemma":[0.00006056362,0.00016692077,0.00017202775,0.00022262588,0.000046464298,0.0020724246,0.0000574317,0.0003857226,0.000026862606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018356807,0.00013960912,0.0008815026,0.00019032208,0.0006777348,0.000015298305,0.00014921377,0.09608814,0.014881634,0.85875577,0.000030333618,0.02635478],"study_design_scores_gemma":[0.001542513,0.000105308485,0.000014720367,0.00022720131,0.000279697,0.00019447146,0.0008045276,0.57197064,0.00031634633,0.42370173,0.00037681125,0.00046605512],"about_ca_topic_score_codex":0.00009575488,"about_ca_topic_score_gemma":0.0016800178,"teacher_disagreement_score":0.5716134,"about_ca_system_score_codex":0.0005824358,"about_ca_system_score_gemma":0.00027590274,"threshold_uncertainty_score":0.68068314},"labels":[],"label_agreement":null},{"id":"W2606788291","doi":"10.71781/9657","title":"Modèles Pareto hybrides pour distributions asymétriques et à queues lourdes","year":2007,"lang":"fr","type":"dissertation","venue":"Open MIND","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Mathematics; Physics; Combinatorics","score_opus":0.03631448818623064,"score_gpt":0.3453757729658954,"score_spread":0.30906128477966477,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2606788291","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77250224,0.0057778587,0.031347573,0.0036638943,0.0014846346,0.0019540808,0.00064148434,0.00006613787,0.1825621],"genre_scores_gemma":[0.88796806,0.00038188955,0.019057127,0.00038440494,0.0013743129,0.0000982658,0.014485202,0.0001751197,0.07607562],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9966409,0.00013723374,0.0009851484,0.0010413057,0.00044957874,0.0007457978],"domain_scores_gemma":[0.99663275,0.00047679894,0.0012113281,0.0006606483,0.0009656941,0.0000527717],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018769812,0.00078001444,0.00093095883,0.00056066195,0.00082530273,0.002507909,0.0013859081,0.00038968635,0.006542642],"category_scores_gemma":[0.0014558982,0.00082431635,0.000404118,0.0010134422,0.00019393588,0.0037333413,0.0004983682,0.0006176195,0.0038223858],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0020393985,0.0028392265,0.0221314,0.002214572,0.0037396024,0.00087210955,0.0034469827,0.02296645,0.0071327104,0.31614205,0.013620159,0.6028553],"study_design_scores_gemma":[0.0015301303,0.000066343295,0.006000925,0.0052634766,0.0040604225,0.000017982265,0.02208845,0.020861674,0.024235714,0.12966672,0.7822672,0.0039409394],"about_ca_topic_score_codex":0.003080105,"about_ca_topic_score_gemma":0.01329869,"teacher_disagreement_score":0.7686471,"about_ca_system_score_codex":0.00021875862,"about_ca_system_score_gemma":0.00020422261,"threshold_uncertainty_score":0.99942076},"labels":[],"label_agreement":null},{"id":"W2611691351","doi":"10.4108/eai.25-10-2016.2266403","title":"A Stable Mean Value Analysis Algorithm for Closed Systems with Load-dependent Queues","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Queue; Computer science; Algorithm; Value (mathematics); Stability (learning theory); Mathematical optimization; Algorithm design; Mean value; Mathematics; Statistics","score_opus":0.015953330284147606,"score_gpt":0.251307406634108,"score_spread":0.2353540763499604,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2611691351","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.028161794,0.00012247106,0.9329158,0.0003599129,0.0002851606,0.00080637773,0.0000216595,0.00041827184,0.036908533],"genre_scores_gemma":[0.9771752,0.0000051707216,0.00839499,0.00027732467,0.0007931149,0.000114532144,0.000047175374,0.0000547225,0.013137815],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982353,0.000017761051,0.00032381064,0.00053437473,0.0004709551,0.000417788],"domain_scores_gemma":[0.9976562,0.00007604383,0.000619317,0.0010961844,0.000528023,0.000024186957],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0010510763,0.000269954,0.00056752056,0.0003436886,0.00093777705,0.0014010725,0.0006367829,0.00006775063,0.00014313903],"category_scores_gemma":[0.00013486415,0.00020324715,0.00025113794,0.00041144266,0.00008598904,0.0018176987,0.00017698601,0.000088617664,0.00008089486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00082576636,0.00077680725,0.023284994,0.0009838538,0.019819474,0.00014657485,0.0003373118,0.31459188,0.00083911815,0.5806737,0.003121995,0.054598518],"study_design_scores_gemma":[0.001280546,0.000023343886,0.00041941184,0.000050721454,0.0044431775,0.0000011389272,0.00093165104,0.9725253,0.00022776135,0.0071224277,0.012394366,0.00058015884],"about_ca_topic_score_codex":0.0066626575,"about_ca_topic_score_gemma":0.00263875,"teacher_disagreement_score":0.94901335,"about_ca_system_score_codex":0.00009937456,"about_ca_system_score_gemma":0.00003141692,"threshold_uncertainty_score":0.9999521},"labels":[],"label_agreement":null},{"id":"W2625517256","doi":"","title":"Self and social optimization in multi-class multi-server queueing systems with relative priorities","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Queueing theory; Layered queueing network; Class (philosophy); Computer science; Server; Mathematical optimization; Poisson distribution; Queueing system; Routing (electronic design automation); Social planner; Operations research; Computer network; Mathematics; Economics; Microeconomics; Statistics; Artificial intelligence","score_opus":0.016287523168919286,"score_gpt":0.22793875243547895,"score_spread":0.21165122926655966,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2625517256","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.20599192,0.00007241685,0.78637296,0.0003907322,0.00012542635,0.00048744326,7.294251e-7,0.00045611613,0.006102252],"genre_scores_gemma":[0.98018837,0.000003200627,0.018549578,0.0001980626,0.0001576678,0.00001707892,0.000008445862,0.000026835774,0.0008507359],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992016,0.000044083106,0.00020517423,0.00024702653,0.00012333496,0.00017876585],"domain_scores_gemma":[0.9995418,0.00006893313,0.00017040805,0.000098682634,0.00011406132,0.00000609125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041648577,0.00014825274,0.00022094608,0.00020190989,0.00019423358,0.00019138638,0.00007824252,0.00006656299,0.000014089124],"category_scores_gemma":[0.00007172418,0.00012383258,0.000025545003,0.0003028233,0.000053041626,0.0017042129,0.000072393996,0.00010751262,0.000013637455],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008868099,0.00014407672,0.048348792,0.00061013957,0.00013511354,0.000007904683,0.0014373773,0.6249297,0.000031353622,0.32383037,0.000020071488,0.0004163871],"study_design_scores_gemma":[0.001084277,0.000005163878,0.0016616104,0.00005902437,0.000059008664,5.003213e-7,0.0012775355,0.99447376,0.0000036311924,0.00027054886,0.00089801283,0.00020691461],"about_ca_topic_score_codex":0.00043502406,"about_ca_topic_score_gemma":0.00066299125,"teacher_disagreement_score":0.77419645,"about_ca_system_score_codex":0.000044878394,"about_ca_system_score_gemma":0.0000062355625,"threshold_uncertainty_score":0.5049746},"labels":[],"label_agreement":null},{"id":"W2729273587","doi":"10.1145/3089254","title":"Copula Analysis of Temporal Dependence Structure in Markov Modulated Poisson Process and Its Applications","year":2017,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Victoria","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Copula (linguistics); Computer science; Poisson distribution; Markov process; Markov chain; Statistical physics; Erlang (programming language); Poisson process; Econometrics; Mathematics; Statistics; Theoretical computer science; Physics; Machine learning","score_opus":0.036602176872459175,"score_gpt":0.31571859036917455,"score_spread":0.27911641349671534,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2729273587","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9195155,0.00014486536,0.079846196,0.000038852475,0.00005312935,0.00031853432,0.000009490895,0.000022192316,0.000051223484],"genre_scores_gemma":[0.9995911,0.00002328477,0.0002731904,0.0000088224215,0.000039821087,0.000016404374,0.000029220042,0.0000103741595,0.000007766117],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986625,0.000040726067,0.00048795383,0.00027594756,0.00040938667,0.00012351587],"domain_scores_gemma":[0.9983178,0.00005686839,0.0005728166,0.0004180589,0.0006226272,0.000011830523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014535877,0.00013548312,0.00034807413,0.00062001374,0.00043379035,0.00008697447,0.00024534142,0.00007325781,0.000009190068],"category_scores_gemma":[0.00010463733,0.00013308246,0.00004462124,0.00057361793,0.00003993745,0.00063649693,0.000015108548,0.00013017467,5.124394e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000034805023,0.000024553943,0.008347761,0.00024872043,0.00012166895,5.5631563e-8,0.00016812966,0.9794901,0.00013537351,0.00007258199,9.570705e-8,0.011356171],"study_design_scores_gemma":[0.00038659328,0.000010029523,0.0064463927,0.00023160123,0.0007484574,7.192886e-7,0.00022328245,0.9911418,0.00006873333,0.00061807997,0.0000012960859,0.00012304439],"about_ca_topic_score_codex":0.0002846879,"about_ca_topic_score_gemma":0.00012431604,"teacher_disagreement_score":0.08007561,"about_ca_system_score_codex":0.00002586666,"about_ca_system_score_gemma":0.000025388312,"threshold_uncertainty_score":0.5426945},"labels":[],"label_agreement":null},{"id":"W2735928715","doi":"10.1287/opre.2017.1613","title":"Nonlinear Accumulating Priority Queues with Equivalent Linear Proxies","year":2017,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":18,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Western University","funders":"","keywords":"Queue; Computer science; Queueing theory; Class (philosophy); Nonlinear system; Mathematical optimization; Service (business); Priority queue; Power (physics); Operations research; Computer network; Mathematics","score_opus":0.13316252936454062,"score_gpt":0.4256130067872707,"score_spread":0.2924504774227301,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2735928715","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97147125,0.000035157347,0.0019885015,0.0033478548,0.00007101559,0.0005526177,0.000004337291,0.00013305931,0.02239619],"genre_scores_gemma":[0.9856789,0.000008554503,0.008518128,0.00008848973,0.0013410815,0.00007451159,0.000030818,0.000034366585,0.004225143],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833804,0.000045079938,0.00021461553,0.0003726677,0.00060854305,0.0004210355],"domain_scores_gemma":[0.9978187,0.00008487749,0.0000720423,0.00095494115,0.0010476338,0.000021812464],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016845672,0.0001418915,0.00018012134,0.00029208898,0.0039275493,0.0018025619,0.00067031686,0.000054033888,0.00026379782],"category_scores_gemma":[0.0020015235,0.000111448615,0.000049798084,0.00036026136,0.0003468406,0.0025916188,0.00044892367,0.00039660322,0.00045733983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00080872065,0.0015853941,0.09406693,0.0009569408,0.0006060581,0.00023180104,0.0015200782,0.34480584,0.024927225,0.48524907,0.0015068917,0.043735046],"study_design_scores_gemma":[0.0007302904,0.000055402914,0.0028624767,0.0001861447,0.000055490804,0.0000025314066,0.0010194038,0.9624881,0.0019518145,0.002473129,0.027738193,0.00043698127],"about_ca_topic_score_codex":0.0013958408,"about_ca_topic_score_gemma":0.0026074878,"teacher_disagreement_score":0.61768234,"about_ca_system_score_codex":0.000054672466,"about_ca_system_score_gemma":0.00008223198,"threshold_uncertainty_score":0.99923366},"labels":[],"label_agreement":null},{"id":"W2739784970","doi":"10.1016/j.orl.2017.07.005","title":"The advantage of relative priority regimes in multi-class multi-server queueing systems with strategic customers","year":2017,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"Government of Canada","keywords":"Class (philosophy); Queueing theory; Computer science; Poisson distribution; Queueing system; Mathematical optimization; Server; Routing (electronic design automation); Layered queueing network; Nash equilibrium; Operations research; Computer network; Mathematics; Statistics; Artificial intelligence","score_opus":0.08374648839579794,"score_gpt":0.3626902892683113,"score_spread":0.27894380087251336,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2739784970","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9883465,0.000120382814,0.0019333292,0.005067658,0.00010844362,0.0008113781,0.0000037900243,0.00003695736,0.00357152],"genre_scores_gemma":[0.9974489,0.00002815455,0.0006108893,0.00008815426,0.00009876913,0.00009162694,0.000009028772,0.000025981552,0.0015984613],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998154,0.0002157628,0.0003331742,0.00034359668,0.0005220596,0.00043143952],"domain_scores_gemma":[0.9982363,0.00024111169,0.00018073234,0.0008769966,0.00044496453,0.000019906247],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0025758108,0.00015684932,0.00023588756,0.0003683431,0.002009648,0.0010547296,0.00072823366,0.000053535357,0.000009508896],"category_scores_gemma":[0.0008067817,0.000107181935,0.000057824447,0.0005103571,0.000704002,0.0028319259,0.00023558803,0.00054865127,0.00005311073],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030054897,0.00030892022,0.033580605,0.0002785816,0.00031452507,0.00015329407,0.0007460966,0.63054585,0.014698172,0.3183145,0.00018767599,0.00057124306],"study_design_scores_gemma":[0.002828718,0.000034009052,0.014180749,0.00057408575,0.0000730245,0.0000023783762,0.012689534,0.96417475,0.00032607105,0.0003501669,0.0042215134,0.0005449907],"about_ca_topic_score_codex":0.0057312157,"about_ca_topic_score_gemma":0.010660065,"teacher_disagreement_score":0.33362892,"about_ca_system_score_codex":0.0001306821,"about_ca_system_score_gemma":0.00006931379,"threshold_uncertainty_score":0.9999823},"labels":[],"label_agreement":null},{"id":"W2741500941","doi":"","title":"Modeling Daily Arrivals to a Telephone Call Center","year":2003,"lang":"fr","type":"article","venue":"Les Cahiers du GERAD","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Focus (optics); Center (category theory); Goodness of fit; Call management; Variance (accounting); Statistics; Mathematics; Telecommunications; Call control","score_opus":0.010358602340037439,"score_gpt":0.21447263293982255,"score_spread":0.2041140305997851,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2741500941","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56659,0.00577984,0.39453158,0.01001103,0.0027368008,0.0005796162,0.000022849492,0.00032019088,0.019428067],"genre_scores_gemma":[0.9421643,0.00019413534,0.017643223,0.011125065,0.001782145,0.000040116924,0.000039689865,0.00015836251,0.026852941],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9971386,0.00012890097,0.0006188172,0.0007713727,0.00039019945,0.00095210096],"domain_scores_gemma":[0.9986375,0.00009542973,0.00020079415,0.0006550308,0.00030357973,0.000107663895],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00088720315,0.0005172462,0.00058234064,0.000483547,0.00064474717,0.00043010246,0.00044401528,0.00029612787,0.00094368594],"category_scores_gemma":[0.00096336013,0.0005746884,0.0003377379,0.0011688557,0.00020103638,0.001281349,0.00013499298,0.00055118167,0.0018098777],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025605905,0.00057710125,0.0041656303,0.00073848997,0.0006937319,0.00039032043,0.0022315057,0.35354608,0.0015980842,0.59723616,0.016583504,0.02198331],"study_design_scores_gemma":[0.0016568919,0.000028694058,0.000049202445,0.00042792034,0.000588679,0.000031959327,0.0014755527,0.098456144,0.00027713188,0.08021737,0.8152956,0.0014948632],"about_ca_topic_score_codex":0.000455403,"about_ca_topic_score_gemma":0.00017263879,"teacher_disagreement_score":0.7987121,"about_ca_system_score_codex":0.0002995659,"about_ca_system_score_gemma":0.000032055643,"threshold_uncertainty_score":0.9999696},"labels":[],"label_agreement":null},{"id":"W2754802962","doi":"10.5539/ijsp.v6n6p43","title":"Comments on a Two Queue Network","year":2017,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Queue; Queueing theory; Service (business); Queueing system; Bulk queue; Computer science; Layered queueing network; Server; Mathematics; G-network; Computer network; Mathematical optimization; Business","score_opus":0.023356774815092605,"score_gpt":0.3066529581965751,"score_spread":0.2832961833814825,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2754802962","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7925176,0.00009871484,0.1701714,0.012384889,0.004624809,0.0003036501,0.00012239217,0.000033005253,0.019743567],"genre_scores_gemma":[0.98961127,0.000014988354,0.0080737015,0.0009942899,0.0012501562,0.0000010625722,0.00000591254,0.000006547847,0.000042093878],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99921966,0.000014898521,0.00029367834,0.00010125011,0.00027598251,0.00009450554],"domain_scores_gemma":[0.9983676,0.00013261674,0.00076784706,0.00016423737,0.0005533703,0.000014343791],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007725599,0.000081631864,0.00014724972,0.000058375834,0.00021193385,0.00039146366,0.0003967398,0.000017582228,0.00009317927],"category_scores_gemma":[0.00088983943,0.000067607594,0.00004389696,0.000022500297,0.00010602309,0.00048059746,0.00014073789,0.00013378661,0.000010671824],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004398076,0.00014963391,0.07413198,0.00002791467,0.00022038342,0.00007116311,0.000024431916,0.0047879303,0.000015689686,0.8608725,0.0036212944,0.055637285],"study_design_scores_gemma":[0.00065754255,0.000023439812,0.03132084,0.00007440096,0.000048240458,0.000006688625,0.0000079431875,0.005368739,0.0000053032327,0.94460267,0.017794972,0.00008924204],"about_ca_topic_score_codex":0.000083693856,"about_ca_topic_score_gemma":0.00007281613,"teacher_disagreement_score":0.19709368,"about_ca_system_score_codex":0.0000362716,"about_ca_system_score_gemma":0.000012675887,"threshold_uncertainty_score":0.37748933},"labels":[],"label_agreement":null},{"id":"W2764314492","doi":"10.1007/s00186-017-0612-2","title":"An M/PH/K queue with constant impatient time","year":2017,"lang":"en","type":"article","venue":"Mathematical Methods of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":12,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Queueing theory; Constant (computer programming); Computer science; Server; Burke's theorem; Reduction (mathematics); Queueing system; Mathematical optimization; Algorithm; Applied mathematics; Mathematics; Queue management system; Computer network; Fork–join queue","score_opus":0.11633538334010268,"score_gpt":0.4869793571310019,"score_spread":0.3706439737908992,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2764314492","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35780793,0.000022540731,0.55723447,0.0017661047,0.00003814103,0.0008702152,0.000008115939,0.000099365854,0.082153134],"genre_scores_gemma":[0.58287203,0.0000015693136,0.41607487,0.00006350204,0.00013775544,0.00007760022,0.000008527799,0.00003097002,0.0007331552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981945,0.0002705872,0.00036136442,0.00030002283,0.0005456888,0.00032782057],"domain_scores_gemma":[0.99713284,0.000492708,0.00010397433,0.0012927292,0.0009396438,0.00003811534],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0057558995,0.00013601319,0.0003474906,0.00032922896,0.0011039291,0.0007252552,0.0007677475,0.000057435424,0.0014340709],"category_scores_gemma":[0.004408055,0.00009618478,0.0000610999,0.0003233499,0.00075634907,0.0013886008,0.0002856155,0.00025351954,0.00033493852],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009281606,0.00047676553,0.0001385259,0.00018278496,0.000074146476,0.000009605653,0.00015963933,0.003591541,0.02199087,0.9636135,0.00008599652,0.0095838],"study_design_scores_gemma":[0.00050130504,0.00013930458,0.00016752396,0.00020590387,0.00008617222,0.000004631433,0.000671622,0.6914085,0.007280889,0.29843003,0.00081557984,0.00028854937],"about_ca_topic_score_codex":0.00012806949,"about_ca_topic_score_gemma":0.00004537192,"teacher_disagreement_score":0.687817,"about_ca_system_score_codex":0.000031874206,"about_ca_system_score_gemma":0.000054613196,"threshold_uncertainty_score":0.99947876},"labels":[],"label_agreement":null},{"id":"W2765340072","doi":"","title":"Large deviations of queues under qos scheduling algorithms","year":2006,"lang":"en","type":"article","venue":"Allerton Conference on Communication, Control, and Computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Queue; Computer science; Scheduling (production processes); Queueing theory; Fork–join queue; Mathematical optimization; Distributed computing; Algorithm; Real-time computing; Queue management system; Mathematics; Computer network","score_opus":0.018688417317154156,"score_gpt":0.2545301436818937,"score_spread":0.23584172636473955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2765340072","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.42714158,0.0018534121,0.5430736,0.00893359,0.00016782527,0.00046073724,0.000007637541,0.00036045988,0.018001134],"genre_scores_gemma":[0.9968019,0.00011312919,0.0013057047,0.0013816671,0.0002536558,0.0000087033995,0.000054622717,0.000020177675,0.00006042613],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987115,0.000085825304,0.0004965195,0.00026427765,0.00018942634,0.00025245082],"domain_scores_gemma":[0.9980222,0.00038634162,0.00051283726,0.00056800287,0.0004970094,0.000013600782],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00068011123,0.0001948605,0.0003360242,0.0001989076,0.0005980952,0.00018503398,0.000434442,0.00006951523,0.000042411135],"category_scores_gemma":[0.00011516063,0.00019380872,0.00008107554,0.00030925852,0.00011625258,0.0004530957,0.00019171517,0.00019147326,0.000017854127],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029798537,0.00015461586,0.0026990147,0.00003217842,0.0000830534,4.7090091e-7,0.000096510674,0.018172283,0.00046893914,0.97400594,0.00013036876,0.0041268375],"study_design_scores_gemma":[0.0016012911,0.000015287644,0.0070502744,0.00022850194,0.0001234101,0.0000010611861,0.0012408494,0.85438,0.000079140336,0.13101538,0.0039044877,0.00036028808],"about_ca_topic_score_codex":0.00045471068,"about_ca_topic_score_gemma":0.00038663953,"teacher_disagreement_score":0.8429905,"about_ca_system_score_codex":0.00002027749,"about_ca_system_score_gemma":0.000022608832,"threshold_uncertainty_score":0.79032904},"labels":[],"label_agreement":null},{"id":"W2766386424","doi":"10.1287/mnsc.2019.3447","title":"Efficient Inaccuracy: User-Generated Information Sharing in a Queue","year":2020,"lang":"en","type":"article","venue":"Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":37,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Queue; Computer science; Multilevel queue; Queue management system; Social Welfare; Pairwise comparison; Service (business); Information sharing; Operations research; Business; Computer network; Mathematics; Marketing; World Wide Web; Artificial intelligence","score_opus":0.01566965614575423,"score_gpt":0.23300408455334426,"score_spread":0.21733442840759004,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766386424","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90827155,0.00001221484,0.02131679,0.0025793547,0.00021154663,0.0003773633,8.142729e-7,0.00033554784,0.066894844],"genre_scores_gemma":[0.99385023,0.0000018984084,0.0007880449,0.005130974,0.000094500894,0.000025167334,0.000007888464,0.000008238516,0.000093030896],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983916,0.000006236322,0.0003362633,0.00040385127,0.0004813975,0.00038062525],"domain_scores_gemma":[0.99939543,0.000011027509,0.00019119696,0.00028886978,0.00008809013,0.000025370016],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00093094434,0.00014846734,0.0001443619,0.00070704654,0.00026267022,0.0005976159,0.00083929166,0.000020121286,0.000095496805],"category_scores_gemma":[0.0002645873,0.0001460439,0.000037456794,0.0049563143,0.00012007403,0.0027181313,0.0008873501,0.0001077871,0.0007195387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043603093,0.00004911462,0.007003574,0.00021024657,0.000011865364,0.000022782317,0.00033752425,0.61024916,0.0007054092,0.3712401,0.00022369751,0.009902889],"study_design_scores_gemma":[0.00045133266,0.000005407534,0.0071934513,0.00005516851,0.000026427648,2.1623259e-7,0.0007713323,0.9675713,0.00013194744,0.001496627,0.022021888,0.00027488935],"about_ca_topic_score_codex":0.00009002974,"about_ca_topic_score_gemma":0.000016483418,"teacher_disagreement_score":0.3697435,"about_ca_system_score_codex":0.0001013188,"about_ca_system_score_gemma":0.000009899084,"threshold_uncertainty_score":0.92484546},"labels":[],"label_agreement":null},{"id":"W2766981005","doi":"10.1016/j.cie.2017.10.011","title":"Strategic behavior and social optimization in a double-ended queue with gated policy","year":2017,"lang":"en","type":"article","venue":"Computers & Industrial Engineering","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":33,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Unobservable; Social planner; Queue; Taxis; Queueing theory; Point (geometry); Observable; Limit (mathematics); Social Welfare; Microeconomics; Mathematical optimization; Computer science; Operations research; Economics; Mathematical economics; Mathematics; Econometrics; Engineering; Political science; Transport engineering","score_opus":0.04222519415374009,"score_gpt":0.25016810349364643,"score_spread":0.20794290933990633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2766981005","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97582847,0.000006483223,0.022179425,0.0005315505,0.00030163134,0.00032237972,0.0000013543867,0.00020330296,0.00062540016],"genre_scores_gemma":[0.99759346,8.90138e-7,0.00091187406,0.00004368082,0.001371321,0.000013216676,0.0000204259,0.000026871541,0.000018266906],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99922675,0.0000056448253,0.00018507736,0.00023359086,0.00010982991,0.00023910843],"domain_scores_gemma":[0.9995604,0.000016679136,0.00018051498,0.0001844125,0.000044206598,0.000013768716],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00016259601,0.00017655407,0.0002252075,0.00036355437,0.00024224471,0.0005490517,0.00022667073,0.00011307908,0.000007197192],"category_scores_gemma":[0.000028470298,0.00017837544,0.000031775493,0.00027991168,0.000047482095,0.0009183231,0.00013378638,0.00023214126,0.000002234202],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014643675,0.000032337844,0.0014229484,0.000026596785,0.000037664304,0.000041249637,0.00005324116,0.96267164,0.00013959166,0.03261268,0.000012479934,0.0028031087],"study_design_scores_gemma":[0.005900141,0.00001910904,0.0019077127,0.00014792525,0.0001238503,0.000005411402,0.0000964739,0.9904588,0.00006115692,0.00023914303,0.00052707415,0.00051321415],"about_ca_topic_score_codex":0.00044258195,"about_ca_topic_score_gemma":0.000031577285,"teacher_disagreement_score":0.03237354,"about_ca_system_score_codex":0.00006382495,"about_ca_system_score_gemma":0.000027904332,"threshold_uncertainty_score":0.7273939},"labels":[],"label_agreement":null},{"id":"W2767124918","doi":"10.1287/ijoc.2017.0759","title":"Space Reduction for a Class of Multidimensional Markov Chains: A Summary and Some Applications","year":2017,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":23,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Waterloo","funders":"","keywords":"Markov chain; Computer science; Stochastic matrix; Generator matrix; Class (philosophy); Subroutine; Queueing theory; Continuous-time Markov chain; Markov model; Generator (circuit theory); Matrix (chemical analysis); Examples of Markov chains; Markov process; Construct (python library); Algorithm; Variable-order Markov model; Theoretical computer science; Mathematics; Programming language; Machine learning; Artificial intelligence; Statistics","score_opus":0.015731626044080564,"score_gpt":0.2686128935138592,"score_spread":0.2528812674697786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2767124918","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8844021,0.00015483153,0.10771583,0.003976403,0.00060185086,0.0005981966,0.0000046331306,0.00007890372,0.0024672293],"genre_scores_gemma":[0.98949194,0.000018851799,0.008069608,0.00047661675,0.0017765325,0.000006840086,0.000006281959,0.000016698017,0.0001366535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991756,0.000004388044,0.00034048868,0.00013277346,0.00016725903,0.0001795073],"domain_scores_gemma":[0.99833614,0.00009544307,0.001096311,0.0002221048,0.00023106097,0.000018961931],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00074631575,0.00011764807,0.0001983332,0.00024101014,0.0010893752,0.0002246195,0.0001944537,0.000044243774,0.0000036428885],"category_scores_gemma":[0.00026852044,0.0000983196,0.00010142692,0.00007824228,0.000090633046,0.0014032683,0.0001511068,0.0001781278,0.0000044694993],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068585813,0.00019385717,0.0030345859,0.00047629257,0.0003296512,0.000008687677,0.0002054134,0.033554338,0.0059841364,0.5470383,0.0018416947,0.40664718],"study_design_scores_gemma":[0.004477884,0.00012681846,0.0077383826,0.001275203,0.00030397627,0.00014854885,0.001084873,0.7425322,0.0010910865,0.11530066,0.12503633,0.0008840306],"about_ca_topic_score_codex":0.000010889037,"about_ca_topic_score_gemma":0.0000015865182,"teacher_disagreement_score":0.7089779,"about_ca_system_score_codex":0.000031595802,"about_ca_system_score_gemma":0.0000139672375,"threshold_uncertainty_score":0.83787036},"labels":[],"label_agreement":null},{"id":"W2780747774","doi":"10.5539/ijsp.v7n1p125","title":"M/M/1 Model with Unreliable Service","year":2017,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematics; Markov chain; Stationary distribution; Queueing theory; Applied mathematics; Queue; Bulk queue; Burke's theorem; Laplace transform; Laplace–Stieltjes transform; Mathematical optimization; Generating function; Construct (python library); Computer science; Discrete mathematics; Fork–join queue; Statistics; Queue management system; Mathematical analysis; Computer network","score_opus":0.024199920992709872,"score_gpt":0.2738937083673916,"score_spread":0.2496937873746817,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2780747774","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48296687,0.00003847994,0.50135845,0.008528321,0.00055428315,0.000121387304,0.000068823785,0.000017732407,0.006345629],"genre_scores_gemma":[0.95329726,0.00001212677,0.04570935,0.0005823601,0.00028657497,9.770148e-7,0.000004500194,0.0000074516793,0.0000994202],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99933046,0.0000046551586,0.00022310314,0.00009702452,0.0002683414,0.00007644069],"domain_scores_gemma":[0.9978135,0.000054592303,0.0006308902,0.00015708427,0.001330937,0.000012985784],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045057287,0.00007512608,0.00012978677,0.00006274357,0.00015870684,0.0003727396,0.00038313132,0.000018715016,0.00004600739],"category_scores_gemma":[0.00043819277,0.00005624055,0.000022032013,0.000028903183,0.00008506269,0.0009110642,0.00011757249,0.0001009718,0.0000050105386],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000991466,0.0002116439,0.045062453,0.00017244769,0.0003755533,0.000096643,0.00009992996,0.07907924,0.00018790312,0.852744,0.001491521,0.019487213],"study_design_scores_gemma":[0.0005146808,0.000011939118,0.0056573222,0.00006364535,0.00007756911,0.000013943136,0.000019210143,0.17677058,0.000012709534,0.8134775,0.0032826385,0.00009824978],"about_ca_topic_score_codex":0.00010088185,"about_ca_topic_score_gemma":0.0002084419,"teacher_disagreement_score":0.47033036,"about_ca_system_score_codex":0.000024139907,"about_ca_system_score_gemma":0.000030604504,"threshold_uncertainty_score":0.35943365},"labels":[],"label_agreement":null},{"id":"W2784800541","doi":"","title":"Ekonomiska utvärderingar av organtransplantationer: En systematisk litteraturöversikt","year":2011,"lang":"sv","type":"article","venue":"Lund University Publications (Lund University)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Institute of Health Economics","funders":"","keywords":"Political science; Humanities; Philosophy","score_opus":0.013848627260964582,"score_gpt":0.17144057410911936,"score_spread":0.15759194684815478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2784800541","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.019835293,0.00011795996,0.020776324,0.0015044047,0.00051197247,0.0007135728,0.00019731505,0.0006833145,0.95565987],"genre_scores_gemma":[0.13287605,0.0004976343,0.0027998758,0.00039868135,0.0005304664,0.0000010551413,0.0006869571,0.00011300142,0.86209625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997036,0.00029903272,0.0004330587,0.001090964,0.00037907466,0.00076186826],"domain_scores_gemma":[0.9967516,0.0002548057,0.00078936573,0.0011774868,0.00085699046,0.0001697577],"candidate_categories":["metaepi_narrow","sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00048785505,0.0005978614,0.00065691187,0.0032175842,0.002176183,0.00045028527,0.0019033314,0.00041596964,0.002736248],"category_scores_gemma":[0.00012254724,0.0008075126,0.00043138443,0.005094361,0.00036708443,0.0067861164,0.00060083147,0.00056979567,0.0011902063],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024759423,0.00036216632,0.002534138,0.0005714405,0.0008721405,0.00018430043,0.0018875502,0.0002553818,0.00010907154,0.9906669,0.0021499135,0.00015935091],"study_design_scores_gemma":[0.0015655636,0.000026919564,0.0018674202,0.00024462564,0.002491914,0.000014146489,0.013624023,0.0017901539,0.000028559423,0.00068040757,0.9767247,0.00094157155],"about_ca_topic_score_codex":0.0011528359,"about_ca_topic_score_gemma":0.00061361986,"teacher_disagreement_score":0.98998654,"about_ca_system_score_codex":0.00080285425,"about_ca_system_score_gemma":0.00022613817,"threshold_uncertainty_score":0.9995875},"labels":[],"label_agreement":null},{"id":"W2791281269","doi":"10.1080/21693277.2017.1422812","title":"Optimal planning of buffer sizes and inspection station positions","year":2018,"lang":"en","type":"article","venue":"Production & Manufacturing Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Sizing; Mathematical optimization; Convexity; Computer science; Production line; Buffer (optical fiber); Line (geometry); Integer (computer science); Series (stratigraphy); Algorithm; Mathematics; Engineering","score_opus":0.051398006419830444,"score_gpt":0.34420516106841964,"score_spread":0.2928071546485892,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2791281269","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99511576,0.00005221777,0.0018124179,0.0008860911,0.00020041762,0.00018230437,9.34168e-7,0.00014241505,0.0016074259],"genre_scores_gemma":[0.99702084,0.000011438213,0.00090802036,0.000022189943,0.0016171593,0.000016902803,0.0000144617225,0.000018331262,0.00037064168],"study_design_codex":"bench_or_experimental","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9988114,0.00004263469,0.00019667263,0.00034905213,0.0003594442,0.00024077782],"domain_scores_gemma":[0.99913406,0.000069935406,0.00011531127,0.00021921152,0.00044915432,0.000012294874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011317055,0.00009602244,0.00011986643,0.00056671357,0.0006621809,0.00012862115,0.00009885943,0.000039726372,0.000103085025],"category_scores_gemma":[0.000444651,0.000094402276,0.000028135175,0.0004425442,0.00032040107,0.0011666202,0.00013316913,0.00021472415,0.000061576524],"study_design_candidate":"bench_or_experimental","study_design_consensus":"bench_or_experimental","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045827283,0.0014645895,0.04264526,0.0036874611,0.0009773424,0.000039773844,0.009506168,0.19586757,0.49971324,0.074998155,0.018471668,0.14804606],"study_design_scores_gemma":[0.00079540117,0.00019625892,0.106853895,0.00036822306,0.00015390504,0.000022669476,0.0045556366,0.012707897,0.78613055,0.07199579,0.0155733805,0.00064641534],"about_ca_topic_score_codex":0.00018635427,"about_ca_topic_score_gemma":0.000019788016,"teacher_disagreement_score":0.2864173,"about_ca_system_score_codex":0.0000492403,"about_ca_system_score_gemma":0.000010013108,"threshold_uncertainty_score":0.5093027},"labels":[],"label_agreement":null},{"id":"W2792055769","doi":"10.4018/978-1-4666-5202-6.ch176","title":"Queuing Networks for Designing Shared Services","year":2014,"lang":"en","type":"book-chapter","venue":"IGI Global eBooks","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Saint Mary's University","funders":"","keywords":"Queueing theory; Computer science; Computer network; Distributed computing","score_opus":0.015403343624616437,"score_gpt":0.23015337449696663,"score_spread":0.2147500308723502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2792055769","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00003570297,0.00026785492,0.12152526,0.000048782964,0.0005203411,0.00055069756,0.000023618773,0.0004930214,0.8765347],"genre_scores_gemma":[0.66184515,0.000009210459,0.012463808,0.020872619,0.027215194,0.0003383918,0.0005254357,0.000978743,0.27575144],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99782854,0.000008945671,0.0005502246,0.0007509102,0.0002958962,0.00056545273],"domain_scores_gemma":[0.99810225,0.00011654241,0.00085229916,0.0005874251,0.00030768508,0.000033787634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004479891,0.00064717676,0.00075504,0.0001764853,0.0003692516,0.0005409636,0.0006691066,0.00044748394,0.00009534614],"category_scores_gemma":[0.000044990506,0.0006749245,0.00047430396,0.000050380684,0.000068715635,0.00030617637,0.00032806807,0.00027131237,0.00023723475],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000090109206,0.0000031108214,0.000019872645,0.0003416661,0.00020344747,0.000011523099,0.000007828349,0.004498636,0.000009265013,0.9858521,0.0011197207,0.007842701],"study_design_scores_gemma":[0.00043568746,0.000012947675,0.0000031982327,0.0008839983,0.0007392692,0.0000029503062,0.000019939896,0.031858034,0.000004074015,0.77029926,0.19488364,0.0008570259],"about_ca_topic_score_codex":0.00010300507,"about_ca_topic_score_gemma":0.0002527547,"teacher_disagreement_score":0.66180944,"about_ca_system_score_codex":0.00014150373,"about_ca_system_score_gemma":0.000023048979,"threshold_uncertainty_score":0.9995702},"labels":[],"label_agreement":null},{"id":"W2801481979","doi":"10.1007/s11134-018-9582-1","title":"The state-dependent M / G / 1 queue with orbit","year":2018,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Queueing theory; Markov chain; Queue; Probabilistic logic; Service (business); Node (physics); Computer network; Bulk queue; State (computer science); Markov process; Retrial queue; Distributed computing; Real-time computing; Queueing system; Algorithm; Mathematics; Engineering; Statistics; Artificial intelligence","score_opus":0.008609727379317943,"score_gpt":0.2149337979784225,"score_spread":0.20632407059910454,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2801481979","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.85508347,0.001004304,0.03721721,0.0012681368,0.00331396,0.0011868748,0.0000048730635,0.0014831307,0.09943803],"genre_scores_gemma":[0.9891136,0.000005000243,0.000045257497,0.0003160709,0.0020379943,0.000046401852,0.0000037879715,0.000056169254,0.008375718],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984434,0.000047112582,0.0003343772,0.00034916218,0.00039515278,0.0004307552],"domain_scores_gemma":[0.99856615,0.00013149266,0.0003541209,0.00059426733,0.0003368469,0.00001711268],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001039853,0.00021791921,0.00023573723,0.00013430697,0.0008207479,0.0008008558,0.0004479756,0.000044756074,0.000043449178],"category_scores_gemma":[0.0001258383,0.00013269825,0.000057549376,0.00053667993,0.00019938995,0.0007669145,0.00012357482,0.0001495118,0.0011009864],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011124937,0.00020121633,0.024061112,0.0008117114,0.0012741627,0.000286388,0.0012189815,0.038158003,0.0033793293,0.8987345,0.013958067,0.016803995],"study_design_scores_gemma":[0.0016496279,0.00014891136,0.0007652019,0.00091381336,0.00038604482,0.00006341337,0.0049918164,0.102691196,0.00096180127,0.027366929,0.85834897,0.0017122993],"about_ca_topic_score_codex":0.0021685355,"about_ca_topic_score_gemma":0.0013557912,"teacher_disagreement_score":0.87136763,"about_ca_system_score_codex":0.00006666292,"about_ca_system_score_gemma":0.00002378397,"threshold_uncertainty_score":0.99967676},"labels":[],"label_agreement":null},{"id":"W2806564398","doi":"10.1007/978-3-319-93736-6_17","title":"Maximizing Throughput in Zero-Buffer Tandem Lines with Constrained Flexible Servers","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Server; Computer science; Throughput; Dimensioning; Flexibility (engineering); Distributed computing; Queue; Computer network; Queueing theory; Tandem; Scalability; Operating system; Wireless; Engineering; Mathematics","score_opus":0.01958569986217445,"score_gpt":0.2386265612034624,"score_spread":0.21904086134128795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806564398","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0040384824,0.00011321174,0.9821475,0.00054858235,0.0005736588,0.00032903644,0.0000018160681,0.0001994157,0.012048277],"genre_scores_gemma":[0.8707644,0.00002172243,0.11752992,0.007042885,0.0030817685,0.000014776084,0.00003186595,0.00014249112,0.0013702218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9972156,0.000011364644,0.00045469895,0.001128362,0.00059249945,0.0005974356],"domain_scores_gemma":[0.9983825,0.00021358002,0.00040617315,0.0006674988,0.0003047913,0.00002545097],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00085584127,0.0005353301,0.0006209037,0.0011200568,0.00024567312,0.00046836757,0.0010419767,0.00023059176,0.0002132969],"category_scores_gemma":[0.00013454705,0.00044311018,0.00010453493,0.0011321446,0.0012292749,0.00124294,0.0005748066,0.0005595987,0.00008809211],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002740302,0.0001296324,0.0070486786,0.0005476222,0.00016731175,0.0006282195,0.0010166032,0.686877,0.00038572584,0.09864389,0.00015927864,0.204122],"study_design_scores_gemma":[0.0011368433,0.00007861396,0.00020020317,0.002022565,0.00010513263,0.000027628992,0.000004800296,0.29190117,0.00040025942,0.6949536,0.00766063,0.0015085216],"about_ca_topic_score_codex":0.00008426809,"about_ca_topic_score_gemma":0.0006441796,"teacher_disagreement_score":0.86672586,"about_ca_system_score_codex":0.00017806087,"about_ca_system_score_gemma":0.00013566006,"threshold_uncertainty_score":0.99980205},"labels":[],"label_agreement":null},{"id":"W2806849789","doi":"10.1007/s10479-018-2915-y","title":"On a 2-class polling model with reneging and $$k_i$$ k i -limited service","year":2018,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Polling; Polling system; Computer science; Service (business); Queue; Poisson distribution; Class (philosophy); Queueing theory; Mathematical optimization; Computer network; Mathematics; Statistics; Economics","score_opus":0.17696072489331402,"score_gpt":0.40529354322275973,"score_spread":0.2283328183294457,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2806849789","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96810395,0.000035707282,0.00729857,0.012984397,0.0000124344,0.00018593087,0.0000032363232,0.000042853877,0.011332942],"genre_scores_gemma":[0.9955121,0.000014089961,0.0012875958,0.0020869744,0.0002071088,0.000018808916,0.0000123173595,0.000021226693,0.00083972816],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988301,0.000039500428,0.00017214227,0.00026636253,0.00040215746,0.00028975535],"domain_scores_gemma":[0.9975774,0.00011198535,0.000036410405,0.000331365,0.0019236774,0.000019149707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011246181,0.000100043515,0.00014301794,0.000632161,0.0006507957,0.0002373405,0.00020014597,0.000038158865,0.000074034346],"category_scores_gemma":[0.0003953806,0.000082097955,0.000023040891,0.0014608302,0.00019028985,0.00086516485,0.00014034125,0.0001730604,0.00007333088],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000389016,0.00014814603,0.00022676268,0.00011299555,0.00010477385,0.0000055824275,0.00044306627,0.5018929,0.008544242,0.4843294,0.0016706589,0.002132405],"study_design_scores_gemma":[0.00020126122,0.000051773543,0.000068432295,0.0001246298,0.0000138029045,6.482992e-7,0.00034035795,0.98349893,0.0023146244,0.012220393,0.0010457112,0.000119447344],"about_ca_topic_score_codex":0.00043280606,"about_ca_topic_score_gemma":0.0010004911,"teacher_disagreement_score":0.48160598,"about_ca_system_score_codex":0.000008685906,"about_ca_system_score_gemma":0.000039826467,"threshold_uncertainty_score":0.50054604},"labels":[],"label_agreement":null},{"id":"W2808010655","doi":"","title":"A make-to-stock mountain-type inventory model","year":2011,"lang":"en","type":"article","venue":"TU/e Research Portal (Eindhoven University of Technology)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Queue; Buffer (optical fiber); Fluid queue; Markov process; Markov chain; State (computer science); Computer science; Content (measure theory); Mathematics; Mathematical optimization; Control theory (sociology); Algorithm; Statistics; Mathematical analysis; Computer network; Artificial intelligence","score_opus":0.06658646571087729,"score_gpt":0.28347189588737587,"score_spread":0.21688543017649858,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808010655","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92982966,0.000053826214,0.0015879932,0.00084310205,0.00004464429,0.0004010237,0.000005812176,0.0004026257,0.06683134],"genre_scores_gemma":[0.99261117,0.000014098907,0.0025005685,0.000092517854,0.00004603606,0.0000014832362,0.000010005178,0.000029706964,0.0046944134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.998166,0.000023843611,0.00020639009,0.00047785678,0.00051178684,0.00061408064],"domain_scores_gemma":[0.99832135,0.00002079832,0.00018348622,0.0007286845,0.0006967624,0.000048889313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00090622983,0.00018288278,0.00032369862,0.0024254308,0.0003533745,0.000019320569,0.001252373,0.00024194171,0.0007182597],"category_scores_gemma":[0.00035094324,0.00021607584,0.00012242956,0.0028146033,0.0005514738,0.0005462393,0.0012821035,0.0005713491,0.00057003915],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019616594,0.0013008998,0.051614136,0.00045073393,0.00077698176,0.0017129667,0.0010981276,0.0037654624,0.016154759,0.88023424,0.020299017,0.020630999],"study_design_scores_gemma":[0.0036778545,0.0007317063,0.004385579,0.0006018742,0.00061324285,0.000029036617,0.02606489,0.090558425,0.006453775,0.72758967,0.13683546,0.0024584604],"about_ca_topic_score_codex":0.00088027155,"about_ca_topic_score_gemma":0.0005035412,"teacher_disagreement_score":0.15264456,"about_ca_system_score_codex":0.0001118423,"about_ca_system_score_gemma":0.000096788564,"threshold_uncertainty_score":0.8811317},"labels":[],"label_agreement":null},{"id":"W2808796982","doi":"","title":"Multi-layered round robin routing for parallel servers","year":2004,"lang":"en","type":"article","venue":"TU/e Research Portal (Eindhoven University of Technology)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Equal-cost multi-path routing; Distributed computing; Computer network; Static routing; Scheduling (production processes); Routing (electronic design automation); Mathematical optimization; Mathematics; Routing protocol","score_opus":0.04764796242681567,"score_gpt":0.29644342420542213,"score_spread":0.24879546177860645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2808796982","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9523091,0.000107414446,0.03668795,0.0056574177,0.00007941865,0.0010235949,0.000021088254,0.0006278497,0.003486195],"genre_scores_gemma":[0.983475,0.000016684746,0.015188084,0.000037217127,0.00006810531,0.000003238921,0.00003574946,0.000030081443,0.0011458334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981574,0.000018554036,0.00024347505,0.00050323847,0.00038590314,0.0006914489],"domain_scores_gemma":[0.99852884,0.0000668734,0.00028878875,0.00052367337,0.0005613433,0.000030493904],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011094201,0.00019433664,0.00036604572,0.0013281064,0.0006489678,0.000048641465,0.0009879232,0.00026795978,0.00009447976],"category_scores_gemma":[0.0005418212,0.00023033818,0.00021623574,0.0017026025,0.00050993904,0.0009451003,0.00067082496,0.00048451265,0.000110389905],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010004585,0.0011601493,0.012325662,0.00049353536,0.0009026771,0.00075662567,0.00027461484,0.041847844,0.028343681,0.90371853,0.0015117292,0.0076645217],"study_design_scores_gemma":[0.037516426,0.00093125633,0.006234146,0.0016733669,0.001114783,0.000054001583,0.09646494,0.05339863,0.01359957,0.65736693,0.12747447,0.004171505],"about_ca_topic_score_codex":0.0013085388,"about_ca_topic_score_gemma":0.00090624875,"teacher_disagreement_score":0.2463516,"about_ca_system_score_codex":0.00018336046,"about_ca_system_score_gemma":0.00009185329,"threshold_uncertainty_score":0.9392918},"labels":[],"label_agreement":null},{"id":"W2809786943","doi":"10.1177/0008068318770566","title":"Analytically Simple and Computationally Efficient Solution to Geo/G/1 and Geo/G/1/N Queues Involving Heavy-tailed Distributions for Service Times","year":2018,"lang":"en","type":"article","venue":"Calcutta Statistical Association Bulletin","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Queue; Simple (philosophy); Service (business); Computer science; Heavy-tailed distribution; Queueing theory; Mathematics; Probability distribution; Statistics; Computer network; Business","score_opus":0.009928795354104394,"score_gpt":0.2541354907767324,"score_spread":0.24420669542262802,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2809786943","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0789724,0.0000360555,0.89689654,0.022240462,0.000117312586,0.00055603194,0.00043009355,0.00017034572,0.00058078254],"genre_scores_gemma":[0.9748563,0.0000023890764,0.017820688,0.005382723,0.0006992315,0.0000637703,0.00082823297,0.000031555723,0.00031509125],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983056,0.000051651314,0.00043314637,0.00046596333,0.0003175576,0.00042609117],"domain_scores_gemma":[0.9970628,0.0013814439,0.0002599251,0.00013014999,0.0010937057,0.000071990435],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00077153795,0.00020373956,0.00031435984,0.00015112643,0.00068085315,0.00033520357,0.000110823545,0.00010267887,0.00029379126],"category_scores_gemma":[0.0047167814,0.0002097416,0.000047773727,0.00043940768,0.00010416408,0.00013230191,0.00018926604,0.00011091178,0.00026120918],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002977905,0.00020663426,0.0046678907,0.0002033369,0.000211024,0.0000031499783,0.00014767224,0.0034807634,0.0004658694,0.9393743,0.04770103,0.0032405157],"study_design_scores_gemma":[0.0011644559,0.00008532535,0.03626134,0.00007028885,0.00047916741,0.0000014661441,0.00021666872,0.7653321,0.00003219726,0.09656814,0.09918445,0.0006044051],"about_ca_topic_score_codex":0.00016706297,"about_ca_topic_score_gemma":0.00021806698,"teacher_disagreement_score":0.8958839,"about_ca_system_score_codex":0.00022799103,"about_ca_system_score_gemma":0.000028253557,"threshold_uncertainty_score":0.85530144},"labels":[],"label_agreement":null},{"id":"W28419686","doi":"10.1007/bfb0113246","title":"Asymptotically optimal policies for controlled queues in heavy traffic","year":2007,"lang":"en","type":"book-chapter","venue":"Lecture notes in control and information sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Queue; Brownian motion; Heavy traffic approximation; Mathematics; Limiting; Diffusion; Optimal control; Heavy traffic; Queueing theory; Controller (irrigation); Control theory (sociology); Mathematical optimization; Computer science; Control (management); Discrete mathematics; Physics; Statistics; Engineering","score_opus":0.01585434159934663,"score_gpt":0.26100840475250486,"score_spread":0.24515406315315824,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W28419686","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.016732797,0.0030779836,0.5494352,0.014875329,0.0010852617,0.0059740143,0.00007104491,0.00043947675,0.40830886],"genre_scores_gemma":[0.98696417,0.000070766226,0.0009973232,0.010870823,0.0005541394,0.00005488268,0.00003790178,0.00001777788,0.00043219447],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823093,0.000009241159,0.000809282,0.00024427628,0.00034072943,0.00036550837],"domain_scores_gemma":[0.99810684,0.0010435702,0.00051364925,0.00012163614,0.00019772493,0.000016594156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018013493,0.00030888864,0.0006935468,0.0013971726,0.00021627375,0.00047724758,0.00026509727,0.0002529969,0.000051284707],"category_scores_gemma":[0.0012536081,0.00023650686,0.00014821794,0.00027203732,0.00037574573,0.0028220387,0.000045831694,0.00025727018,0.000018387756],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013478907,0.00001880394,0.00011771804,0.00016847946,0.000055905526,0.0000019671793,0.00036816136,0.3874285,0.000007727288,0.51015514,0.000028411669,0.10030128],"study_design_scores_gemma":[0.00784803,0.00010872529,0.00013484004,0.0003150762,0.00015168833,0.000003362972,0.00010284445,0.806775,0.000006755461,0.123888075,0.05991765,0.0007479949],"about_ca_topic_score_codex":0.000061643455,"about_ca_topic_score_gemma":0.0006720734,"teacher_disagreement_score":0.9702314,"about_ca_system_score_codex":0.000046742076,"about_ca_system_score_gemma":0.00005283755,"threshold_uncertainty_score":0.96444696},"labels":[],"label_agreement":null},{"id":"W2883368372","doi":"10.1111/poms.12931","title":"A Fixed Rate Production Problem with Poisson Demand and Lost Sales Penalties","year":2018,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity Western University; Western University","funders":"Oregon State University","keywords":"Poisson distribution; Lost sales; Queue; Mathematical optimization; Computer science; Inventory control; Production (economics); Function (biology); Holding cost; Lead time; Safety stock; Mathematical economics; Mathematics; Operations research; Economics; Operations management; Statistics; Microeconomics; Supply chain","score_opus":0.010568255765764716,"score_gpt":0.221687720604065,"score_spread":0.21111946483830027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2883368372","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9637985,0.0002467946,0.009075576,0.018066403,0.00044638658,0.0014915148,0.0000011996159,0.00027956488,0.006594014],"genre_scores_gemma":[0.9839308,0.00015283679,0.005040469,0.00044519693,0.0011030857,0.00009021648,0.000025980913,0.0000236318,0.009187733],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989308,0.000028413739,0.0001978177,0.0005309433,0.00013735717,0.0001746462],"domain_scores_gemma":[0.9993966,0.000005683095,0.00008886488,0.00024675165,0.0002475917,0.000014510142],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055047846,0.00017524841,0.0001435923,0.0003072975,0.00075702934,0.00039073455,0.00006472754,0.000023341023,0.000067833906],"category_scores_gemma":[0.00007774099,0.00014203718,0.000016951923,0.00049811,0.00022145499,0.001520801,0.00010946338,0.000068239555,0.00010101606],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019421316,0.0012024906,0.025247857,0.0037643325,0.0017148991,0.000031508185,0.0039497307,0.057713434,0.015774986,0.79314095,0.026092287,0.06942541],"study_design_scores_gemma":[0.007047404,0.0010394031,0.10384862,0.0026376988,0.0063349158,0.000248482,0.028222675,0.09579686,0.021675045,0.087191,0.6392964,0.0066614444],"about_ca_topic_score_codex":0.00003846924,"about_ca_topic_score_gemma":0.0005909487,"teacher_disagreement_score":0.7059499,"about_ca_system_score_codex":0.000021896405,"about_ca_system_score_gemma":0.0000052195924,"threshold_uncertainty_score":0.5822534},"labels":[],"label_agreement":null},{"id":"W2886867729","doi":"10.23919/acc.2018.8431012","title":"Asymptotic Performance of Energy-Aware Multiserver Queueing Systems with Setup Times","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Server; Computer science; Queue; Queueing theory; Infinity; Function (biology); Energy (signal processing); Mathematical optimization; Computer network; Distributed computing; Real-time computing; Mathematics; Statistics","score_opus":0.007219674275740347,"score_gpt":0.1952169206606402,"score_spread":0.18799724638489984,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886867729","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93563044,0.00005707643,0.018453076,0.000059362013,0.00019051178,0.00011872962,0.0000011953615,0.00024857488,0.04524103],"genre_scores_gemma":[0.99448746,0.000003075347,0.00034190106,0.0002309797,0.00051485247,0.000008883138,0.000011001856,0.000030473895,0.0043713795],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990421,0.0000116962165,0.00025060563,0.0002461906,0.00021787021,0.00023151706],"domain_scores_gemma":[0.99907446,0.000035257082,0.00025102744,0.00032580912,0.00030286584,0.000010603694],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021030926,0.00016986002,0.0002515674,0.00019609794,0.00015370532,0.00008183148,0.0002209741,0.000043940665,0.0004976417],"category_scores_gemma":[0.000016741988,0.00012570653,0.000050564657,0.00052021205,0.00012565445,0.0012042021,0.00010451443,0.000050923958,0.00017522613],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013250543,0.0005401623,0.41747093,0.0037580554,0.0014767499,0.000049908245,0.00030347463,0.09779634,0.0029052913,0.45084885,0.0063752146,0.017149976],"study_design_scores_gemma":[0.0007192813,0.00007863267,0.0023278566,0.0004937909,0.00024090876,0.000004752119,0.0004107987,0.9829008,0.0019391178,0.0005868057,0.009765183,0.0005320874],"about_ca_topic_score_codex":0.000694233,"about_ca_topic_score_gemma":0.0001658436,"teacher_disagreement_score":0.8851044,"about_ca_system_score_codex":0.000020637019,"about_ca_system_score_gemma":0.000011172887,"threshold_uncertainty_score":0.5448827},"labels":[],"label_agreement":null},{"id":"W2886990954","doi":"10.1007/978-3-319-99154-2_25","title":"On Saturation Effects in Coupled Speed Scaling","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scaling; Computer science; Markov chain; Bounded function; Saturation (graph theory); Exponent; Polynomial; Speedup; Algorithm; Control theory (sociology); Real-time computing; Simulation; Mathematics; Parallel computing; Mathematical analysis; Geometry; Artificial intelligence","score_opus":0.01015538234745892,"score_gpt":0.23286519664425687,"score_spread":0.22270981429679795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2886990954","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.018823136,0.000063670755,0.97409135,0.00023358263,0.0013618739,0.000405455,4.4847852e-7,0.000120274155,0.0049002073],"genre_scores_gemma":[0.9815723,0.0000034854177,0.011704567,0.0039859684,0.002423507,0.0000036714378,0.00001812732,0.000052832176,0.00023556931],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790376,0.000010842574,0.00033515456,0.00085180905,0.0005253721,0.00037303186],"domain_scores_gemma":[0.9985278,0.00048379131,0.0003062534,0.0005107509,0.00015628395,0.000015091067],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008637021,0.00036020373,0.00040672798,0.0012987707,0.00017033973,0.00036966245,0.00068086374,0.0001951109,0.00009584402],"category_scores_gemma":[0.00046866483,0.00032580225,0.00008676103,0.0007412401,0.00035774056,0.0006750176,0.00032027857,0.00048224613,0.00023500553],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013652969,0.000060360388,0.0002007571,0.00029736123,0.000025479956,0.00016125967,0.00027849973,0.70527375,0.0010162953,0.10678662,0.000034635614,0.18572843],"study_design_scores_gemma":[0.00021271736,0.000017353725,0.000092807015,0.00061185996,0.000015536663,0.0000011286068,1.3488538e-7,0.58645487,0.00015375137,0.41191882,0.00021865069,0.0003024009],"about_ca_topic_score_codex":0.000035780606,"about_ca_topic_score_gemma":0.00019899358,"teacher_disagreement_score":0.9627491,"about_ca_system_score_codex":0.00020570509,"about_ca_system_score_gemma":0.000041779243,"threshold_uncertainty_score":0.9999194},"labels":[],"label_agreement":null},{"id":"W2889233420","doi":"10.1155/2018/7462439","title":"A Note on the Waiting-Time Distribution in an Infinite-Buffer <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" id=\"M1\"><mml:mi>G</mml:mi><mml:msup><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mo stretchy=\"false\">[</mml:mo><mml:mi>X</mml:mi><mml:mo stretchy=\"false\">]</mml:mo></mml:mrow></mml:msup><mml:mo>/</mml:mo><mml:mi>C</mml:mi><mml:mtext>-</mml:mtext><mml:mi>M</mml:mi><mml:mi>S</mml:mi><mml:mi>P</mml:mi><mml:mo>/</mml:mo><mml:mn fontstyle=\"italic\">1</mml:mn></mml:math> Queueing System","year":2018,"lang":"en","type":"article","venue":"Journal of Probability and Statistics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Armed Forces; Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Markovian arrival process; Computer science; Function (biology); Distribution (mathematics); Mathematics; Markov chain; Machine learning; Mathematical analysis","score_opus":0.017589624787894324,"score_gpt":0.24053403872551077,"score_spread":0.22294441393761644,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2889233420","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7567074,0.0026110497,0.009163653,0.002500513,0.0068349536,0.00029765136,0.0027867674,0.001071533,0.21802653],"genre_scores_gemma":[0.97176987,0.0017149727,0.0066156676,0.0032316556,0.0069580236,0.0025949755,0.004459695,0.0023662555,0.00028891332],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9708196,0.002262233,0.007128668,0.005282963,0.0075769024,0.0069296584],"domain_scores_gemma":[0.97469807,0.0064624846,0.009094887,0.0055001224,0.001368231,0.002876223],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.0095963115,0.0030530384,0.0014338782,0.0023643596,0.0063391416,0.0065387897,0.0068763075,0.0062755616,0.25261226],"category_scores_gemma":[0.010305232,0.005657126,0.0049697384,0.004629542,0.00594963,0.0063507054,0.005622123,0.0063161547,0.0035464815],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0058698426,0.0012985485,0.00011530875,0.0040250826,0.004693723,0.0035579444,0.0033864372,0.00777226,0.0023064616,0.65797627,0.3022746,0.006723503],"study_design_scores_gemma":[0.007269979,0.0057763983,0.00025841236,0.0057199732,0.00784315,0.0045945668,0.008532033,0.036298085,0.8852788,0.022711096,0.008772316,0.0069451528],"about_ca_topic_score_codex":0.006154958,"about_ca_topic_score_gemma":0.0072114677,"teacher_disagreement_score":0.88297236,"about_ca_system_score_codex":0.0001439546,"about_ca_system_score_gemma":0.003842776,"threshold_uncertainty_score":0.99849695},"labels":[],"label_agreement":null},{"id":"W2892240799","doi":"10.1051/ps/2021018","title":"Exact tail asymptotics for a three-dimensional Brownian-driven tandem queue with intermediate inputs","year":2021,"lang":"en","type":"article","venue":"ESAIM Probability and Statistics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shandong Province; China Scholarship Council","keywords":"Mathematics; Semimartingale; Stationary distribution; Brownian motion; Reflected Brownian motion; Heavy traffic approximation; Copula (linguistics); Queue; Joint probability distribution; Mathematical analysis; Statistical physics; Geometric Brownian motion; Diffusion process; Physics; Markov chain; Computer science; Statistics","score_opus":0.016522872977004714,"score_gpt":0.23331774107539804,"score_spread":0.21679486809839332,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892240799","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23274146,0.000073320305,0.76506567,0.0008386219,0.00018498361,0.0004957339,0.00017496597,0.000119468226,0.0003057715],"genre_scores_gemma":[0.84200823,0.000007179954,0.15506667,0.0016511225,0.0004126419,0.00006548296,0.00039721906,0.00005258257,0.0003388374],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985699,0.000031516745,0.00034437282,0.0004926318,0.0002407589,0.00032084103],"domain_scores_gemma":[0.9984315,0.00043299416,0.00021465647,0.00031165255,0.0005736582,0.00003555433],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040520556,0.00023679779,0.00035579372,0.000074853444,0.0002775002,0.00019097232,0.00012697281,0.0000824947,0.0001244993],"category_scores_gemma":[0.0010013424,0.00020575714,0.000059653223,0.00029097285,0.00025488427,0.00041193046,0.00016778572,0.00017875066,0.000017383702],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00089876936,0.0008211167,0.11027707,0.0021761453,0.0005948245,0.00021170008,0.0002770729,0.026476683,0.00036130333,0.8159405,0.0031197506,0.03884505],"study_design_scores_gemma":[0.001808962,0.00011900321,0.013580865,0.00019806076,0.00049592997,0.000014715517,0.00007452076,0.25965518,0.00010398007,0.7112034,0.012041559,0.0007038397],"about_ca_topic_score_codex":0.00002977001,"about_ca_topic_score_gemma":0.0027203248,"teacher_disagreement_score":0.609999,"about_ca_system_score_codex":0.00005381496,"about_ca_system_score_gemma":0.00008861904,"threshold_uncertainty_score":0.8390533},"labels":[],"label_agreement":null},{"id":"W2892251471","doi":"10.1142/s0217595918500380","title":"Asymptotically Maximal Throughput in Tandem Systems with Flexible and Dedicated Servers","year":2018,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Server; Throughput; Flexibility (engineering); Computer science; Computer network; Markov process; Distributed computing; Queue; Infinity; Mathematics; Operating system; Statistics","score_opus":0.04527977279817552,"score_gpt":0.3255007031245078,"score_spread":0.2802209303263323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2892251471","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9358549,0.00038633528,0.0075888354,0.006761109,0.00020279769,0.00036560785,0.0000017375767,0.00003023847,0.048808444],"genre_scores_gemma":[0.9977806,0.000023249728,0.0008068362,0.00007317548,0.00080579554,0.0000048281295,0.0000049385467,0.000017107332,0.00048344294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9979618,0.000105484476,0.00040455823,0.00020204515,0.0010075386,0.0003185712],"domain_scores_gemma":[0.997736,0.00019799153,0.00015195983,0.00013619932,0.0017399476,0.000037900532],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0036219743,0.00011268799,0.00023265982,0.00063016487,0.00029832456,0.00044205188,0.00024243385,0.00006259696,0.00017947386],"category_scores_gemma":[0.00055183645,0.00008266195,0.0000322659,0.001081272,0.0004035433,0.0014544924,0.00008935428,0.00043469144,0.000071133305],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001905173,0.0005135968,0.32745293,0.00019621389,0.0005175375,0.0005428282,0.0005511759,0.013934922,0.004227005,0.641421,0.0061788107,0.0025587738],"study_design_scores_gemma":[0.01776397,0.0032731767,0.3283612,0.0040669916,0.00047780946,0.001832184,0.04282712,0.31266224,0.0017139629,0.12580465,0.15860963,0.0026070685],"about_ca_topic_score_codex":0.000059393966,"about_ca_topic_score_gemma":0.000037113747,"teacher_disagreement_score":0.51561636,"about_ca_system_score_codex":0.00009957605,"about_ca_system_score_gemma":0.00019311556,"threshold_uncertainty_score":0.42627165},"labels":[],"label_agreement":null},{"id":"W2894171144","doi":"10.1007/s42243-018-0151-y","title":"MMPP/M/C queue with congestion-based staffing policy and applications in operations of steel industry","year":2018,"lang":"en","type":"article","venue":"Journal of Iron and Steel Research International","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Key Research and Development Program of China; Higher Education Discipline Innovation Project","keywords":"Slab; Staffing; Queue; Computer science; Poisson distribution; Service (business); Queueing theory; Operations research; Production (economics); Real-time computing; Simulation; Computer network; Mathematics; Statistics; Engineering; Business; Structural engineering; Economics; Microeconomics","score_opus":0.03745110774266113,"score_gpt":0.3618498516012329,"score_spread":0.32439874385857176,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2894171144","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98931205,0.00004825338,0.002761725,0.0029640738,0.000035165744,0.00013226733,0.000005945893,0.000005340141,0.0047351946],"genre_scores_gemma":[0.9980804,0.000019429772,0.00064184563,0.00014258003,0.0007249407,0.000007575327,0.000005053174,0.000008455559,0.0003697322],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9989423,0.000041453524,0.00030761637,0.000119057564,0.0004521779,0.0001374018],"domain_scores_gemma":[0.9983799,0.00022115676,0.00017437177,0.00009078535,0.0011058995,0.000027925584],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011269499,0.00007406249,0.00014112379,0.0010670561,0.00013853013,0.00013946637,0.00019003447,0.000060085218,0.00008655301],"category_scores_gemma":[0.0006893025,0.000058520953,0.000022964015,0.0005073072,0.00031052314,0.00063058984,0.000076082455,0.00038633408,0.0000021491337],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009536537,0.00061018625,0.21191613,0.00018436053,0.00018399011,0.000026771007,0.00040520128,0.031891234,0.0071938443,0.73010683,0.00035636255,0.016171444],"study_design_scores_gemma":[0.012926081,0.0011656109,0.5715579,0.0023257546,0.0002167311,0.000100970436,0.01440996,0.2595023,0.003054307,0.038589068,0.09504989,0.0011014489],"about_ca_topic_score_codex":0.00022888821,"about_ca_topic_score_gemma":0.000511887,"teacher_disagreement_score":0.6915178,"about_ca_system_score_codex":0.000076282675,"about_ca_system_score_gemma":0.00015404256,"threshold_uncertainty_score":0.23864152},"labels":[],"label_agreement":null},{"id":"W2896136758","doi":"10.1109/itc30.2018.10062","title":"Network Calculus for Mean Delay Analysis Through a Network","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Burstiness; Bounded function; Poisson distribution; Network calculus; Upper and lower bounds; Computer science; Queue; Queueing theory; Constraint (computer-aided design); Topology (electrical circuits); Routing (electronic design automation); Mathematical optimization; Mathematics; Applied mathematics; Quality of service; Computer network; Combinatorics; Network packet; Mathematical analysis; Statistics","score_opus":0.02096538089614641,"score_gpt":0.2641467809344657,"score_spread":0.24318140003831928,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896136758","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008421381,0.0001018516,0.9348785,0.0006239883,0.0004295524,0.00028749788,0.0000016659088,0.00038480613,0.054870732],"genre_scores_gemma":[0.944754,0.000003530885,0.027075117,0.01122752,0.013401099,0.000058507845,0.00008155767,0.000054879267,0.003343768],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823654,0.000019445242,0.00037846458,0.00048997445,0.00020277989,0.00067281857],"domain_scores_gemma":[0.9986876,0.00014841506,0.00026699415,0.0005390486,0.00034160697,0.000016329204],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00079290604,0.0002453667,0.00045388468,0.00014996013,0.0006358779,0.00020380093,0.00035878437,0.00008901131,0.0012922811],"category_scores_gemma":[0.0001112228,0.00020964083,0.00042266466,0.0034712641,0.00012986075,0.00091516256,0.00018929283,0.00008584773,0.00038386878],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019201498,0.000047451846,0.004043508,0.000028418483,0.0018569982,0.000005081771,0.00007046282,0.20652297,0.000011616022,0.7190153,0.066062935,0.0021432089],"study_design_scores_gemma":[0.00043245652,0.000022111612,0.0002314746,0.000017265733,0.0038974558,5.807368e-7,0.00011925503,0.37399027,0.000015377733,0.3035298,0.31724116,0.00050278264],"about_ca_topic_score_codex":0.00032543807,"about_ca_topic_score_gemma":0.002717715,"teacher_disagreement_score":0.93633264,"about_ca_system_score_codex":0.000032669857,"about_ca_system_score_gemma":0.000008870068,"threshold_uncertainty_score":0.9996207},"labels":[],"label_agreement":null},{"id":"W2896572082","doi":"10.1109/itc30.2018.00013","title":"On Occupancy Based Randomized Routing Schemes in Large Systems of Shared Servers","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Routing (electronic design automation); Server; Queue; Fixed point; Field (mathematics); Mathematics; Discrete mathematics; Computer network; Mathematical analysis","score_opus":0.012753309202047584,"score_gpt":0.2472406198492826,"score_spread":0.23448731064723502,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2896572082","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91396683,0.000051863495,0.050420422,0.00023974117,0.00037637615,0.00075206574,0.0000058815376,0.0002733351,0.03391349],"genre_scores_gemma":[0.9982375,4.502387e-7,0.0005501025,0.00060900016,0.00021463822,0.000020636562,0.000019748555,0.000019368374,0.0003285571],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987506,0.00005836845,0.000468773,0.00025394233,0.00020576284,0.00026251347],"domain_scores_gemma":[0.99887013,0.00030174345,0.00035597367,0.00028803092,0.0001765548,0.000007588273],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001689083,0.00015676724,0.00054694,0.00039694054,0.00008454109,0.00007601951,0.0002053119,0.000053743068,0.0006274136],"category_scores_gemma":[0.0012020932,0.00012726757,0.00015622159,0.0007144286,0.00006923462,0.0005618954,0.00007512102,0.00008029204,0.00015665582],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.019315163,0.00024135425,0.019818762,0.00041307672,0.00015404186,0.000009471254,0.000066811444,0.005600594,0.00051342376,0.95317125,0.0005058876,0.00019017767],"study_design_scores_gemma":[0.08585302,0.000013960645,0.00033931728,0.0006144242,0.0001512947,1.3687347e-7,0.00043564124,0.9033756,0.0005955967,0.007022535,0.0012025804,0.00039585648],"about_ca_topic_score_codex":0.00038409542,"about_ca_topic_score_gemma":0.00014043956,"teacher_disagreement_score":0.9461487,"about_ca_system_score_codex":0.000028658995,"about_ca_system_score_gemma":0.000011390166,"threshold_uncertainty_score":0.6869739},"labels":[],"label_agreement":null},{"id":"W2900523842","doi":"10.3934/mbe.2019270","title":"Equivalences between age structured models and state dependent distributed delay differential equations","year":2019,"lang":"en","type":"article","venue":"Mathematical Biosciences & Engineering","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":19,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal; McGill University","funders":"","keywords":"Delay differential equation; Distributed parameter system; Differential equation; Ordinary differential equation; State dependent; State (computer science); Stability (learning theory); Variable (mathematics)","score_opus":0.01859354284836055,"score_gpt":0.2305828099255982,"score_spread":0.21198926707723767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2900523842","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5390123,0.000017010467,0.46049273,0.000040085095,0.000074168405,0.00011497095,0.00001013854,0.00010103026,0.00013758213],"genre_scores_gemma":[0.9979054,0.0000021707906,0.0018542247,0.0000238759,0.00010272739,0.000008836004,0.000020351186,0.0000142839635,0.00006816238],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986464,0.000007636374,0.00029724807,0.00032948525,0.00037003597,0.00034920487],"domain_scores_gemma":[0.99941117,0.00020769835,0.00010726365,0.00020217916,0.000037820177,0.00003388484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028079786,0.0001938934,0.00028295413,0.00018690675,0.00012433068,0.00035269157,0.00031772334,0.000044703822,0.00014860678],"category_scores_gemma":[0.00018397387,0.00015374077,0.000059541235,0.00045355185,0.0000902629,0.001012102,0.0002312714,0.00011755196,0.000056026976],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013771516,0.00007160609,0.002585847,0.0006069717,0.00012152405,0.000018193095,0.00032393128,0.35676023,0.025429407,0.6119271,0.000007825265,0.0021335992],"study_design_scores_gemma":[0.00015998214,0.000008525283,0.00081144634,0.00006607815,0.0000756029,0.0000010776828,0.00009123926,0.8395754,0.00036391118,0.1585306,0.000045890873,0.00027023192],"about_ca_topic_score_codex":0.000011932472,"about_ca_topic_score_gemma":0.000004479,"teacher_disagreement_score":0.48281518,"about_ca_system_score_codex":0.000022587028,"about_ca_system_score_gemma":0.0000060374136,"threshold_uncertainty_score":0.6269367},"labels":[],"label_agreement":null},{"id":"W2901406050","doi":"10.2139/ssrn.3125120","title":"Can Customer Arrival Rates Be Modelled by Sine Waves?","year":2018,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Sine; Physics; Acoustics; Econometrics; Mathematics; Geology; Geometry","score_opus":0.008036317437351592,"score_gpt":0.23478624059858863,"score_spread":0.22674992316123704,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2901406050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92152697,0.001406097,0.03985257,0.012659625,0.0006845124,0.00027081408,0.000006348066,0.00030368345,0.023289386],"genre_scores_gemma":[0.98791474,0.0002189391,0.000079920166,0.0016725793,0.0026194758,0.0000037675293,0.00002111445,0.000056452598,0.0074130334],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99697423,0.000033566917,0.0003455131,0.00029737252,0.00032364807,0.0020256424],"domain_scores_gemma":[0.9990603,0.000032910357,0.00034747933,0.0002545284,0.00027487252,0.000029927143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013938578,0.00025957107,0.00028850802,0.00028399398,0.00058175897,0.00022022713,0.00043990792,0.00007450643,0.0004523548],"category_scores_gemma":[0.0001412904,0.00022453637,0.00016312835,0.0005978066,0.00014686651,0.0009111752,0.00009935752,0.0010293621,0.00033587503],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057645614,0.00026529713,0.0014914394,0.00003066409,0.0010793678,0.00001766561,0.0001601416,0.0029850344,0.011928315,0.95113695,0.013575574,0.016753085],"study_design_scores_gemma":[0.0014216334,0.000082001956,0.000019357121,0.000029009394,0.0003481338,0.00007256302,0.000936777,0.027854087,0.00074553204,0.887927,0.07992985,0.0006340356],"about_ca_topic_score_codex":0.00017840687,"about_ca_topic_score_gemma":0.00088666566,"teacher_disagreement_score":0.06638776,"about_ca_system_score_codex":0.00038512956,"about_ca_system_score_gemma":0.0002546175,"threshold_uncertainty_score":0.9156328},"labels":[],"label_agreement":null},{"id":"W2910549536","doi":"10.5539/ijsp.v8n2p1","title":"M/M/1 Model With Unreliable Service and a Working Vacation","year":2019,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Queue; Service (business); Work (physics); Stationary distribution; Distribution (mathematics); Mathematics; Random variable; Mathematical optimization; Operations research; Computer science; Mathematical economics; Statistics; Business; Marketing; Markov chain; Computer network; Engineering; Mathematical analysis","score_opus":0.016415085168303645,"score_gpt":0.2425543451457208,"score_spread":0.22613925997741716,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2910549536","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8326251,0.00005172462,0.16445568,0.0014826511,0.00016508845,0.0000965423,0.000009190926,0.000009001027,0.0011050436],"genre_scores_gemma":[0.96651876,0.000016936538,0.032754622,0.00051836786,0.000120583056,9.341852e-7,0.0000060714106,0.000006410411,0.000057304907],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99939287,0.0000068343966,0.00021255887,0.000104571714,0.00021780278,0.00006535542],"domain_scores_gemma":[0.9988065,0.00009192358,0.00032074246,0.0000632095,0.0007070715,0.00001059439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040944194,0.00006866882,0.00011667317,0.00008762702,0.00003533821,0.00013447079,0.00011113689,0.000018868503,0.000037597023],"category_scores_gemma":[0.000100706246,0.00005374698,0.000012744475,0.000089637826,0.000027810103,0.00048054723,0.000059108515,0.00009202588,0.0000039286456],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009825858,0.00014688136,0.16240667,0.00029435998,0.00029246177,0.000016555932,0.0002609097,0.17383207,0.00041326482,0.6366397,0.00024587018,0.024468673],"study_design_scores_gemma":[0.00057734596,0.00001756867,0.006485001,0.00012319577,0.00007116433,0.000016023858,0.000059135047,0.39659795,0.000008085125,0.59401375,0.0019233784,0.00010743042],"about_ca_topic_score_codex":0.000035432287,"about_ca_topic_score_gemma":0.000058038822,"teacher_disagreement_score":0.22276588,"about_ca_system_score_codex":0.000025565443,"about_ca_system_score_gemma":0.000021017915,"threshold_uncertainty_score":0.21917382},"labels":[],"label_agreement":null},{"id":"W2912703927","doi":"10.1142/s0217595919500039","title":"Customer Strategic Joining Behavior in Markovian Queues with Working Vacations and Vacation Interruptions Under Bernoulli Schedule","year":2019,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"China Scholarship Council; National Natural Science Foundation of China","keywords":"Unobservable; Bernoulli's principle; Schedule; Queue; Computer science; Markov process; Queueing theory; Queue management system; Operations research; Mathematical optimization; Computer network; Mathematics; Econometrics; Engineering; Statistics","score_opus":0.08036126464956433,"score_gpt":0.35213213953252576,"score_spread":0.2717708748829614,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912703927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792028,0.00013480833,0.0008041758,0.002405506,0.0000675628,0.00024800366,0.0000010260877,0.000010615035,0.0171255],"genre_scores_gemma":[0.9978215,0.00002795767,0.0010299127,0.000060312606,0.00025669808,0.000022482513,0.000023387629,0.000021075119,0.000736682],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.9983837,0.000097413365,0.00040882602,0.00021170922,0.0006431794,0.0002551769],"domain_scores_gemma":[0.99860066,0.00019621893,0.00020072912,0.00015944264,0.00081365183,0.000029268522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019689847,0.000118944175,0.00019114435,0.0011411898,0.00027164767,0.00046841174,0.00019620378,0.00005975802,0.00045389734],"category_scores_gemma":[0.00011552317,0.000099058656,0.000045064655,0.0010040774,0.00010550695,0.0016066899,0.00006784083,0.00060500065,0.00010490207],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035448596,0.0004193743,0.3265338,0.000064076245,0.0001446308,0.000039929128,0.00041967657,0.038640305,0.008431502,0.6224074,0.00019328485,0.0023515846],"study_design_scores_gemma":[0.007754818,0.0007162464,0.57848394,0.0026702045,0.0005526497,0.0005118647,0.15348533,0.09153335,0.00061218016,0.14363077,0.0179477,0.0021009296],"about_ca_topic_score_codex":0.00005130975,"about_ca_topic_score_gemma":0.00014090228,"teacher_disagreement_score":0.4787766,"about_ca_system_score_codex":0.0001322205,"about_ca_system_score_gemma":0.00015636176,"threshold_uncertainty_score":0.49698576},"labels":[],"label_agreement":null},{"id":"W2912891030","doi":"10.1145/3308897.3308924","title":"The Mean-field Behavior of Processor Sharing Systems with General Job Lengths Under the SQ(d) Policy","year":2019,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Server; Load sharing; Computer science; Robustness (evolution); Poisson point process; Point process; Martingale (probability theory); Distributed computing; Mathematics; Statistics; Computer network","score_opus":0.04500153812439963,"score_gpt":0.32436502820566177,"score_spread":0.27936349008126216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2912891030","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94590557,0.042710267,0.00048225,0.0025898758,0.00035173373,0.0029726306,0.0000012275713,0.00007203383,0.0049143955],"genre_scores_gemma":[0.9851849,0.011506419,0.00007624197,0.0017411825,0.0004169193,0.00036133398,0.000013717865,0.000031857864,0.00066740334],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976437,0.000061827894,0.0006090441,0.0003109627,0.0010850342,0.00028941347],"domain_scores_gemma":[0.99645096,0.000437372,0.00087210216,0.0011844166,0.0010426291,0.000012506708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005216987,0.0002132345,0.000366903,0.00034138994,0.0003758512,0.00019674393,0.0010719418,0.000050790448,0.00012526437],"category_scores_gemma":[0.0019465405,0.00011271407,0.000107801556,0.0039114607,0.00005428086,0.0011783531,0.0002691971,0.00021663733,0.00015903519],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001902231,0.00023500767,0.16933945,0.017482163,0.0005999797,0.000001515753,0.0001992097,0.12020881,0.00032157978,0.1788895,0.0020021542,0.5105304],"study_design_scores_gemma":[0.0030846533,0.00033731025,0.043901574,0.01095084,0.0071351817,0.000025845788,0.0014577216,0.8419207,0.0004979599,0.004861023,0.08382233,0.002004878],"about_ca_topic_score_codex":0.000099090605,"about_ca_topic_score_gemma":0.000020933976,"teacher_disagreement_score":0.7217119,"about_ca_system_score_codex":0.00009843067,"about_ca_system_score_gemma":0.00010115301,"threshold_uncertainty_score":0.45963463},"labels":[],"label_agreement":null},{"id":"W2913239517","doi":"","title":"Proceedings of the 4th International Conference on Queueing Theory and Network Applications","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Queueing theory; Presentation (obstetrics); Computer science; Operations research; China; Telecommunications; Library science; Political science; Computer network; Engineering","score_opus":0.011101113774127142,"score_gpt":0.24054460839099445,"score_spread":0.2294434946168673,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2913239517","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11700596,0.00002649153,0.012395829,0.0044352585,0.00008698044,0.0003235485,6.547667e-7,0.00012677899,0.8655985],"genre_scores_gemma":[0.9961812,0.000005384321,0.00031241513,0.0020337973,0.0003122021,0.000008134926,0.0000011442893,0.0000041615613,0.0011415629],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9995828,0.000002880928,0.000111299865,0.00012399023,0.00009919259,0.000079818434],"domain_scores_gemma":[0.9996399,0.00003243105,0.00013267636,0.00007682896,0.00011445379,0.0000036567392],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003063846,0.00006382957,0.000075224634,0.000047662663,0.00010712153,0.00006942249,0.00020394633,0.000018755312,0.000115048904],"category_scores_gemma":[0.000049872186,0.00004298591,0.00003053762,0.00023751172,0.000050198007,0.000305157,0.00006426858,0.0000610649,0.000009276925],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019354793,0.000015238314,0.001047227,0.000005306049,0.000010405967,3.3468957e-8,0.000011310379,0.00023861244,0.0005528186,0.99228257,0.00026364313,0.005553479],"study_design_scores_gemma":[0.00009945039,0.0000035845064,0.0031745653,0.00004326315,0.000032669373,3.606246e-7,0.00023603675,0.0047490154,0.00014880682,0.98425555,0.0071762847,0.00008040002],"about_ca_topic_score_codex":0.000005086898,"about_ca_topic_score_gemma":0.0000033685253,"teacher_disagreement_score":0.87917525,"about_ca_system_score_codex":0.0000068813433,"about_ca_system_score_gemma":0.000002779613,"threshold_uncertainty_score":0.17529146},"labels":[],"label_agreement":null},{"id":"W2914679402","doi":"10.1080/03155986.2018.1533775","title":"A numerical method to determine the waiting time and the idle time distributions of a <i>GI/G/</i>1 queue when inter-arrival times and/or service times have geometric tails","year":2019,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia; University of Saskatchewan","funders":"","keywords":"Idle; Queue; Queueing theory; Arrival time; Discrete time and continuous time; Computer science; Geometric distribution; Mathematics; Applied mathematics; Mathematical optimization; Probability distribution; Statistics; Engineering; Computer network","score_opus":0.029320772012245696,"score_gpt":0.3142298458415845,"score_spread":0.2849090738293388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2914679402","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7661997,0.00076646305,0.11749097,0.037090074,0.00031992485,0.010879786,0.0005618292,0.00025492866,0.06643629],"genre_scores_gemma":[0.9951772,0.000006210609,0.0006322932,0.0009922776,0.00017388936,0.00013147159,0.00013381359,0.000010174016,0.002742681],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998319,0.00013573,0.00059006864,0.00014701221,0.0005667801,0.00024144731],"domain_scores_gemma":[0.9970387,0.0015064945,0.00021137475,0.00021851569,0.000990214,0.00003466385],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004208282,0.0001392959,0.00029192466,0.00045661433,0.00052034465,0.000962191,0.0002503371,0.00005796312,0.00031160726],"category_scores_gemma":[0.001249976,0.00007718385,0.000042087588,0.0009108289,0.00012370152,0.0024483919,0.00039428624,0.00019571098,0.0003976621],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0039420174,0.00014444336,0.003876372,0.0028852322,0.0009848578,0.0000045865886,0.013270433,0.06500821,0.0016894512,0.79365176,0.020126104,0.09441652],"study_design_scores_gemma":[0.0008275884,0.000040420837,0.0002699134,0.00012975822,0.00003110298,0.00002079677,0.0017636776,0.9384381,0.000064785534,0.0006777871,0.057588194,0.00014787135],"about_ca_topic_score_codex":0.0010432613,"about_ca_topic_score_gemma":0.000014836406,"teacher_disagreement_score":0.8734299,"about_ca_system_score_codex":0.000034317072,"about_ca_system_score_gemma":0.000058654638,"threshold_uncertainty_score":0.92784303},"labels":[],"label_agreement":null},{"id":"W2921838721","doi":"10.1016/j.orl.2019.03.003","title":"Double-sided matching queues: Priority and impatient customers","year":2019,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":29,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Queue; Computer science; Poisson distribution; Priority queue; Patience; Matching (statistics); Queueing theory; Poisson process; Mathematical optimization; Computer network; Mathematics; Statistics","score_opus":0.031049150511296364,"score_gpt":0.3234884503273505,"score_spread":0.29243929981605415,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2921838721","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892272,0.000024995094,0.00031283704,0.0055554146,0.00010941591,0.00046057906,0.0000014022462,0.00007100626,0.004237155],"genre_scores_gemma":[0.9967359,0.000009682117,0.00031414127,0.0019134147,0.00026305323,0.000046617963,0.000032423002,0.000024123154,0.000660653],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850315,0.0000614683,0.00020816707,0.00036265995,0.00046571353,0.00039884704],"domain_scores_gemma":[0.9992475,0.00011059394,0.00003181944,0.00036587293,0.00021917492,0.000025052137],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0012060507,0.0001288617,0.00016083336,0.0005438078,0.00058632996,0.0006802799,0.0002280727,0.00003850968,0.0003043964],"category_scores_gemma":[0.0001409128,0.00011822655,0.00004912342,0.0007514597,0.00012868048,0.0017186173,0.00026611483,0.00035429373,0.0008763383],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003389864,0.00019901474,0.010052715,0.0003376739,0.0002135009,0.000040412117,0.0019297728,0.5867139,0.16164398,0.22859545,0.0048698075,0.0050647613],"study_design_scores_gemma":[0.011219663,0.00014891443,0.009481997,0.0008963902,0.00029771516,0.000020208647,0.016235607,0.7125254,0.0046112086,0.013533938,0.22749196,0.0035369808],"about_ca_topic_score_codex":0.0020025235,"about_ca_topic_score_gemma":0.00042565516,"teacher_disagreement_score":0.22262216,"about_ca_system_score_codex":0.000097207965,"about_ca_system_score_gemma":0.000024842046,"threshold_uncertainty_score":0.9999016},"labels":[],"label_agreement":null},{"id":"W2922722935","doi":"10.1155/2019/6538265","title":"Equilibrium and Optimization in a Double-Ended Queueing System with Dynamic Control","year":2019,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"National Natural Science Foundation of China","keywords":"Taxis; Queueing theory; Computer science; Control (management); Queueing system; Service (business); Optimal control; Operations research; Mathematical optimization; Transport engineering; Economics; Engineering; Mathematics; Computer network","score_opus":0.003918641988756384,"score_gpt":0.206042163517861,"score_spread":0.20212352152910462,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2922722935","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8922514,0.000072769435,0.10701003,0.0001106748,0.00011991922,0.00021246575,8.732783e-7,0.000028687204,0.00019322465],"genre_scores_gemma":[0.9955774,0.000008160753,0.004231226,0.000062113155,0.00006118417,0.000003875337,0.000013541227,0.000021181511,0.000021344587],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99903506,0.000010347621,0.0004603334,0.00014841856,0.00020749048,0.00013837326],"domain_scores_gemma":[0.9989555,0.000036946578,0.00069419126,0.000088745575,0.00021238775,0.000012249286],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00025423936,0.00012633494,0.00030073646,0.00037054825,0.000022722368,0.000051782714,0.00007827024,0.0000391314,0.000011553634],"category_scores_gemma":[0.000008649141,0.00010678749,0.000050397033,0.00040477846,0.000019144753,0.0025669653,0.000002069184,0.00013572664,0.000002544518],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0015460787,0.00002073982,0.00859985,0.00021434938,0.000029103801,0.000031092324,0.000105781925,0.9821014,0.0024385068,0.0045366124,2.1400108e-7,0.00037627525],"study_design_scores_gemma":[0.02817986,0.0002172197,0.09743324,0.0021046824,0.0006395527,0.000040147108,0.0057651456,0.86282986,0.00017526356,0.00172658,0.00018547062,0.0007029915],"about_ca_topic_score_codex":0.00001679844,"about_ca_topic_score_gemma":0.000111977875,"teacher_disagreement_score":0.11927155,"about_ca_system_score_codex":0.00006221282,"about_ca_system_score_gemma":0.000016809212,"threshold_uncertainty_score":0.43546674},"labels":[],"label_agreement":null},{"id":"W2924995203","doi":"10.22215/etd/2015-10629","title":"Fluid Approximation of Smart Grid Systems: Optimal Control of Energy Storage Unit","year":2015,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Mathematical optimization; Energy storage; Smart grid; Grid; Limit (mathematics); Optimal control; Optimization problem; Computer science; Energy (signal processing); Work (physics); Markov decision process; Markov process; Power (physics); Engineering; Mathematics; Electrical engineering","score_opus":0.012261226180555787,"score_gpt":0.23483309155659784,"score_spread":0.22257186537604207,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2924995203","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.53257835,0.0030650978,0.21279655,0.000078324025,0.004916087,0.0016390835,0.00014913912,0.00063266273,0.24414468],"genre_scores_gemma":[0.98935443,0.000009479324,0.0001815298,0.000045315246,0.00060572,0.00004364147,0.002332573,0.000058726055,0.007368593],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982502,0.000044144632,0.00075933867,0.00028855505,0.00047298663,0.00018478025],"domain_scores_gemma":[0.9968353,0.00007053592,0.0014531561,0.00039333582,0.001234126,0.000013551994],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006666578,0.00029326585,0.0007714849,0.00065039156,0.00005410696,0.000057589987,0.00031170767,0.00021388414,0.00017798171],"category_scores_gemma":[0.0002250182,0.0002724275,0.00018089102,0.00055270235,0.00003889508,0.00070740795,0.00003252333,0.00010851279,0.000025056026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002376436,0.0004310954,0.0004090954,0.0076615587,0.0014629283,0.000012039373,0.00023131011,0.29430276,0.008689819,0.6754375,0.0057402793,0.0032451893],"study_design_scores_gemma":[0.004789774,0.0001538601,0.00029504678,0.0018740518,0.004848293,0.0000026806765,0.014380489,0.89311093,0.004344805,0.014905038,0.05911697,0.0021780329],"about_ca_topic_score_codex":0.0009502037,"about_ca_topic_score_gemma":0.00020421472,"teacher_disagreement_score":0.6605325,"about_ca_system_score_codex":0.000037733706,"about_ca_system_score_gemma":0.000053242027,"threshold_uncertainty_score":0.9999728},"labels":[],"label_agreement":null},{"id":"W2940662702","doi":"10.2139/ssrn.3345302","title":"On the Optimal Design of a Bipartite Matching Queueing System","year":2019,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Queueing theory; Matching (statistics); Layered queueing network; Computer science; Mathematics; Mathematical optimization; Statistics; Theoretical computer science","score_opus":0.008238001044069283,"score_gpt":0.20780868867483665,"score_spread":0.19957068763076738,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2940662702","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.792869,0.00024603299,0.20374894,0.00041594915,0.00016985468,0.00019602661,2.0784981e-7,0.00006337925,0.0022906035],"genre_scores_gemma":[0.9987986,0.00002794012,0.00014712171,0.00020687636,0.00035012543,0.0000041711783,6.369783e-7,0.000030402705,0.0004341369],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99811125,0.00007477992,0.00031345212,0.00016700846,0.00028667852,0.0010468244],"domain_scores_gemma":[0.9989645,0.0002129109,0.00047405032,0.00024728727,0.00009319496,0.000008042937],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003670507,0.00015319903,0.00022806413,0.00021329508,0.00023958297,0.00012365275,0.00040004076,0.00003903119,0.00007769019],"category_scores_gemma":[0.000095847805,0.000102752136,0.0001435542,0.00038500442,0.000027238486,0.00057861983,0.000063873784,0.0008970123,0.00029917955],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000104781204,0.00001612286,0.00014884208,0.000027471018,0.00013200672,0.0000020211912,0.00003439775,0.15156654,0.0014101372,0.8459602,0.000016616152,0.00058088335],"study_design_scores_gemma":[0.00086805114,0.00013190984,0.00005449081,0.00053412153,0.0002905986,0.00009824242,0.00961546,0.12224234,0.00038391553,0.86475694,0.0005822246,0.0004417131],"about_ca_topic_score_codex":0.00005903227,"about_ca_topic_score_gemma":0.000020300111,"teacher_disagreement_score":0.20592959,"about_ca_system_score_codex":0.00029061333,"about_ca_system_score_gemma":0.0001524485,"threshold_uncertainty_score":0.41901106},"labels":[],"label_agreement":null},{"id":"W2942743594","doi":"10.1007/s11750-019-00509-1","title":"A 2-class maintenance model with dynamic server behavior","year":2019,"lang":"en","type":"article","venue":"Top","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Polling system; Computer science; Queue; Polling; Bernoulli's principle; Function (biology); Mathematical optimization; Mathematics; Computer network; Engineering","score_opus":0.006847424993105401,"score_gpt":0.21478272409440638,"score_spread":0.20793529910130099,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2942743594","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9783758,0.000010775885,0.0051142173,0.00036781575,0.000060353635,0.00017448122,0.0000012301826,0.00014365544,0.0157517],"genre_scores_gemma":[0.9784627,9.914883e-7,0.00069321296,0.0010679163,0.00005746523,0.000022781427,0.000011245778,0.000028665347,0.01965505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992705,0.000003572975,0.00011111632,0.00024478883,0.00014626682,0.00022373824],"domain_scores_gemma":[0.9994402,0.000009927636,0.00010158919,0.00035985277,0.00008098928,0.00000746763],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00012174651,0.00012626412,0.00015430852,0.0000917781,0.00005535211,0.00006613944,0.00019371978,0.000033620978,0.0003949209],"category_scores_gemma":[0.000012785825,0.00009983712,0.00005356793,0.00027881862,0.000029671233,0.0007311034,0.000084243875,0.00009576505,0.001144554],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000563212,0.00040619206,0.07750417,0.00042466234,0.0001906128,0.00013749351,0.00015551424,0.4451398,0.006085907,0.4551444,0.0016704898,0.012577568],"study_design_scores_gemma":[0.0008725062,0.0000135368955,0.0035346444,0.000080794365,0.00022065947,0.000003962985,0.00016377759,0.9707934,0.000051238938,0.015625518,0.008167663,0.00047229417],"about_ca_topic_score_codex":0.00004237218,"about_ca_topic_score_gemma":0.00008571399,"teacher_disagreement_score":0.5256536,"about_ca_system_score_codex":0.000035985504,"about_ca_system_score_gemma":0.000009149964,"threshold_uncertainty_score":0.9996332},"labels":[],"label_agreement":null},{"id":"W2946332541","doi":"10.1142/s0217595919500192","title":"Performance Analysis of Joining the Shortest Queue Model Among a Large Number of Queues","year":2019,"lang":"en","type":"article","venue":"Asia Pacific Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Bulk queue; Queue; Queueing theory; Fork–join queue; Computer science; Multilevel queue; Mean value analysis; Queue management system; Set (abstract data type); Limiting; Mathematics; Computer network; Engineering","score_opus":0.037873178342053115,"score_gpt":0.3390445940980144,"score_spread":0.3011714157559613,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946332541","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97375405,0.000054504904,0.00113003,0.00046789608,0.00004472495,0.0001261903,0.0000066925177,0.000004457281,0.024411434],"genre_scores_gemma":[0.9983498,0.00004030332,0.0003688856,0.000045221754,0.00016433334,0.0000045260367,0.000019289664,0.000016350079,0.0009913268],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9972859,0.00011170315,0.00075659505,0.00017686636,0.0013773341,0.00029160478],"domain_scores_gemma":[0.99624056,0.00040423952,0.0005315482,0.00033238047,0.0024699955,0.000021274705],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.005830898,0.00012459168,0.00045590114,0.00092723937,0.00023112306,0.00012255105,0.000517848,0.000057907277,0.0009623537],"category_scores_gemma":[0.00058009767,0.00008515572,0.0002786922,0.0023279975,0.00018595834,0.001531884,0.00014993951,0.00047380137,0.000043228003],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016326089,0.00013916807,0.54556394,0.000054870914,0.0009185182,0.000003850259,0.00034426496,0.38740548,0.0020521372,0.0625677,0.0004766474,0.00031014968],"study_design_scores_gemma":[0.00033388473,0.000029262541,0.034502666,0.00012003889,0.0003760073,0.000003892445,0.0031911049,0.95835006,0.00033888742,0.0018770264,0.00075351406,0.00012365771],"about_ca_topic_score_codex":0.000048406386,"about_ca_topic_score_gemma":0.00004196194,"teacher_disagreement_score":0.5709446,"about_ca_system_score_codex":0.000050356117,"about_ca_system_score_gemma":0.00015561769,"threshold_uncertainty_score":0.9999509},"labels":[],"label_agreement":null},{"id":"W2946906726","doi":"10.1109/ccsse.2018.8724754","title":"Dynamic Model of Bank Queuing System and Its Optimal Management","year":2018,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Server; Queueing theory; Computer science; Service (business); Queue management system; Mathematical optimization; Queue; Operations research; Distributed computing; Computer network; Engineering; Mathematics; Economics","score_opus":0.010728558478285107,"score_gpt":0.22533079022289626,"score_spread":0.21460223174461115,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2946906726","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7072164,0.00007766724,0.18054417,0.00013123706,0.00011142622,0.00023998528,0.0000017726633,0.00028290754,0.11139447],"genre_scores_gemma":[0.9909552,0.0000051687116,0.0067474255,0.00016507675,0.000090670124,0.000007754283,0.000003456172,0.000021032642,0.0020042441],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99913245,0.000006453686,0.00024577652,0.00026202473,0.00015680422,0.0001964831],"domain_scores_gemma":[0.9994638,0.000014458716,0.00016112949,0.00021656971,0.00013479701,0.000009246408],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00032004868,0.00013741582,0.00020127828,0.0002477814,0.0001259148,0.000058250727,0.00017248248,0.00003463969,0.00007712916],"category_scores_gemma":[0.00001656674,0.00012358546,0.000050891285,0.0002967708,0.00005756869,0.00066355435,0.00026429634,0.000043718763,0.00010049983],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060065864,0.000031063722,0.00011036111,0.0008528884,0.00013468761,0.0000057929583,0.000046972906,0.053837627,0.0020328143,0.9401508,0.00009544413,0.0026414816],"study_design_scores_gemma":[0.00021374604,0.0000050520966,0.00004350524,0.00008979015,0.00014007131,8.1719327e-7,0.0005181742,0.9959009,0.0001695061,0.0025718927,0.00020008124,0.00014642836],"about_ca_topic_score_codex":0.000020482188,"about_ca_topic_score_gemma":0.000019048486,"teacher_disagreement_score":0.94206333,"about_ca_system_score_codex":0.000030714982,"about_ca_system_score_gemma":0.00000274252,"threshold_uncertainty_score":0.50396687},"labels":[],"label_agreement":null},{"id":"W2950407838","doi":"10.1145/3312741","title":"Nonhomogeneous Place-dependent Markov Chains, Unsynchronised AIMD, and Optimisation","year":2019,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"FP7 Ideas: European Research Council; Science Foundation Ireland","keywords":"Markov chain; Constraint (computer-aided design); Mathematical optimization; Convergence (economics); Computer science; Markov process; Resource (disambiguation); Key (lock); Class (philosophy); Mathematics; Artificial intelligence; Machine learning; Computer network","score_opus":0.007230562928702009,"score_gpt":0.20966830750040452,"score_spread":0.20243774457170252,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2950407838","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99370855,0.00023366985,0.00036828805,0.0036681225,0.0005155738,0.00011522408,5.64689e-7,0.00001479037,0.0013752332],"genre_scores_gemma":[0.99588686,0.000036962818,0.00089310005,0.00092559116,0.00065463025,7.345092e-7,6.9464693e-7,0.000017827535,0.001583606],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99917465,0.000027340087,0.00027172704,0.000109810564,0.00027915437,0.00013734202],"domain_scores_gemma":[0.99860275,0.00008599541,0.00062824914,0.00054717046,0.00012399176,0.000011834906],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006994247,0.00010864431,0.00019169276,0.00013344659,0.00011440568,0.00011673609,0.00074000744,0.000041062227,0.00020818252],"category_scores_gemma":[0.00059317285,0.00007222503,0.00011914245,0.00017225483,0.000031023756,0.00056048646,0.0004544716,0.00017009597,0.000058397494],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037188628,0.0006890948,0.13492809,0.0010629204,0.0021347883,0.00028267043,0.0010462151,0.6039093,0.11067046,0.01799066,0.024707243,0.0988597],"study_design_scores_gemma":[0.026891878,0.00056686613,0.061021984,0.0025821922,0.0054989615,0.0017074742,0.0060354983,0.28688034,0.017702209,0.35122502,0.23563641,0.0042511676],"about_ca_topic_score_codex":0.000011218312,"about_ca_topic_score_gemma":0.000010008502,"teacher_disagreement_score":0.33323437,"about_ca_system_score_codex":0.000060385704,"about_ca_system_score_gemma":0.000019919877,"threshold_uncertainty_score":0.29452512},"labels":[],"label_agreement":null},{"id":"W2951932791","doi":"10.48550/arxiv.1209.1695","title":"Decentralized Stochastic Control with Partial History Sharing: A Common Information Approach","year":2012,"lang":"en","type":"preprint","venue":"ArXiv.org","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Partially observable Markov decision process; Computer science; Decentralised system; Mathematical optimization; Markov decision process; Information structure; Optimal control; Controller (irrigation); Markov chain; Stochastic control; Control (management); Complete information; Information sharing; Markov process; Markov model; Artificial intelligence; Mathematics; Mathematical economics; Machine learning","score_opus":0.0351433072427131,"score_gpt":0.22972731954673103,"score_spread":0.19458401230401795,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2951932791","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8083292,0.00035709902,0.18320051,0.00019114651,0.0008281151,0.0009482475,0.000007736177,0.0005430797,0.00559484],"genre_scores_gemma":[0.99668586,0.000004065062,0.00029450684,0.0012647365,0.00088568527,0.00020983999,0.00047365052,0.000055703622,0.00012595249],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980632,0.000032942175,0.0005691371,0.00042891168,0.0003621596,0.0005436178],"domain_scores_gemma":[0.99788094,0.00004666266,0.0010270063,0.0008077353,0.00019485127,0.000042820262],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.000582343,0.00046280358,0.000651652,0.00032576366,0.00016232603,0.00015666024,0.00060209766,0.00023221673,0.00029095632],"category_scores_gemma":[0.00014912293,0.00041583893,0.00019489878,0.00019884657,0.0001349667,0.0021110014,0.00055268675,0.00066070934,0.00045168132],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023184482,0.000616612,0.5643084,0.0019691712,0.001442636,0.000013787903,0.0012009159,0.38567418,0.00010282679,0.03839941,0.001861191,0.002092387],"study_design_scores_gemma":[0.012988385,0.000052414718,0.0854971,0.00108531,0.009044645,0.000017489416,0.0007876749,0.6972137,0.000046294546,0.010191987,0.17778562,0.0052893483],"about_ca_topic_score_codex":0.0003329424,"about_ca_topic_score_gemma":0.000020332656,"teacher_disagreement_score":0.47881132,"about_ca_system_score_codex":0.00035657373,"about_ca_system_score_gemma":0.000052015093,"threshold_uncertainty_score":0.99982935},"labels":[],"label_agreement":null},{"id":"W2952496990","doi":"10.48550/arxiv.1403.1982","title":"On multiserver retrial queues: history, Okubo-type hypergeometric systems and matrix continued-fractions","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Academia Româna","keywords":"Mathematics; Generating function; Applied mathematics; Hypergeometric function; Hypergeometric distribution; Singularity; Taylor series; Matrix (chemical analysis); Markov chain; Pure mathematics; Mathematical analysis; Statistics","score_opus":0.05670044805399077,"score_gpt":0.19748482645703866,"score_spread":0.1407843784030479,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2952496990","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9726377,0.0006504435,0.011281161,0.000056601963,0.005224088,0.0006241252,0.000014616901,0.0005237988,0.008987431],"genre_scores_gemma":[0.9879661,0.00015329855,0.00003503113,0.00015377885,0.0011279207,0.0000019159056,0.00007601887,0.00006459534,0.01042131],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99793184,0.000107514155,0.00034967568,0.0010887993,0.0001554693,0.000366712],"domain_scores_gemma":[0.99741256,0.00036052938,0.0008429466,0.00093476754,0.00039708978,0.000052117844],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00060571946,0.00046250966,0.00069411105,0.0016611806,0.0002518714,0.00018146884,0.00057554763,0.00040841888,0.000278079],"category_scores_gemma":[0.0008581712,0.0005299267,0.00026865886,0.0011997096,0.00015231932,0.00066583545,0.0007099142,0.0007176214,0.0005727578],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00074188336,0.00019984115,0.0045270245,0.00070914155,0.00048633423,0.00017498682,0.00002842357,0.69797933,0.00005140913,0.2845123,0.0103853205,0.00020398543],"study_design_scores_gemma":[0.0029083402,0.00006847378,0.0010236469,0.0005499708,0.0021768417,0.0000042587594,0.0002609741,0.7435295,0.000005220249,0.030098261,0.21759175,0.0017827888],"about_ca_topic_score_codex":0.0016496101,"about_ca_topic_score_gemma":0.00008343322,"teacher_disagreement_score":0.25441405,"about_ca_system_score_codex":0.0005871978,"about_ca_system_score_gemma":0.000050493596,"threshold_uncertainty_score":0.9997152},"labels":[],"label_agreement":null},{"id":"W2964083367","doi":"10.1239/aap/1427814590","title":"Diffusion-Scale Tightness of Invariant Distributions of a Large-Scale Flexible Service System","year":2015,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Mathematics; Scaling; Invariant (physics); Server; Scale invariance; Limiting; Statistical physics; Scaling limit; Diffusion process; Asymptotic distribution; Discrete mathematics; Applied mathematics; Mathematical optimization; Innovation diffusion; Statistics; Computer science; Computer network; Physics; Geometry; Mathematical physics; Engineering","score_opus":0.015337350338428021,"score_gpt":0.24949654184413939,"score_spread":0.23415919150571135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2964083367","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.86657804,0.00035529575,0.088165425,0.00021579549,0.00025931073,0.0011174993,0.00009024306,0.00025363365,0.04296476],"genre_scores_gemma":[0.993922,0.0000059342656,0.005676961,0.000069173555,0.000090687274,0.00012481972,0.000075623255,0.000017470722,0.000017358052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99809784,0.000041617343,0.00074209593,0.0004542221,0.0003419298,0.00032231657],"domain_scores_gemma":[0.99823886,0.000116940224,0.0005543398,0.00069788384,0.00036215002,0.000029812652],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00137327,0.0002122157,0.0005711774,0.0001533159,0.00009069845,0.000020319805,0.0004418946,0.00009100152,0.000036869813],"category_scores_gemma":[0.00013220593,0.0001916843,0.00008509191,0.0017115374,0.00016987347,0.000705293,0.00037786874,0.000154604,0.000028632392],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006921034,0.001363873,0.0384092,0.004363548,0.00003666269,0.000002584022,0.0005457959,0.038887557,0.0029157368,0.9101927,0.00003255592,0.0025576535],"study_design_scores_gemma":[0.004355974,0.000039632363,0.006418178,0.00069609785,0.0003273592,0.0000031051375,0.0073163705,0.045602415,0.011941117,0.89778066,0.024455763,0.0010633174],"about_ca_topic_score_codex":0.00016588587,"about_ca_topic_score_gemma":0.0011528687,"teacher_disagreement_score":0.12734394,"about_ca_system_score_codex":0.0001412287,"about_ca_system_score_gemma":0.0000452797,"threshold_uncertainty_score":0.7816659},"labels":[],"label_agreement":null},{"id":"W2965617717","doi":"10.1017/s0269964819000299","title":"OPTIMAL CONTROL POLICIES FOR AN <i>M</i>/<i>M</i>/1 QUEUE WITH A REMOVABLE SERVER AND DYNAMIC SERVICE RATES","year":2019,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Computer science; Queue; Monotonic function; Service (business); Set (abstract data type); Control (management); Exponential distribution; Mathematical optimization; Distributed computing; Computer network; Real-time computing; Mathematics; Statistics; Economics","score_opus":0.00886520082173479,"score_gpt":0.22037317339671658,"score_spread":0.2115079725749818,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2965617717","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99752754,0.00003122056,0.0005651054,0.0011800486,0.000020482295,0.00034089977,0.000003099631,0.000033465898,0.00029812555],"genre_scores_gemma":[0.9977076,0.0000019079923,0.0012306876,0.0009746592,0.00002900006,0.000037663754,0.000008291264,0.00000328554,0.000006912547],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993935,0.0000074534773,0.00015572022,0.00012914963,0.00014883526,0.00016533132],"domain_scores_gemma":[0.9995831,0.00016551881,0.00006761058,0.00009721591,0.00007849795,0.000008039111],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013015033,0.00009507723,0.000110934794,0.00009451437,0.00015467427,0.0002601736,0.00017763764,0.000020798769,0.0000046081664],"category_scores_gemma":[0.00008696094,0.000059574955,0.000013667631,0.00040808145,0.00007854514,0.0024800836,0.000032558688,0.00005831159,0.0000028911056],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003092531,0.000010963051,0.0024103213,0.0001911155,0.0000054157204,3.3637804e-8,0.0003578877,0.95167994,0.00005930139,0.04512554,0.0000023095138,0.00012621733],"study_design_scores_gemma":[0.00030473786,0.00003175651,0.002861181,0.000028926332,0.000010369696,0.0000038019168,0.00062987115,0.9878654,0.0000055683618,0.007489313,0.00066123786,0.00010782675],"about_ca_topic_score_codex":0.00015592272,"about_ca_topic_score_gemma":0.00013730896,"teacher_disagreement_score":0.037636228,"about_ca_system_score_codex":0.000012548385,"about_ca_system_score_gemma":0.0000142014405,"threshold_uncertainty_score":0.250886},"labels":[],"label_agreement":null},{"id":"W2968879960","doi":"10.1017/etds.2020.100","title":"Markov chains with exponential return times are finitary","year":2020,"lang":"en","type":"article","venue":"Ergodic Theory and Dynamical Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Finitary; Markov chain; Ergodic theory; Countable set; Independent and identically distributed random variables; Exponential function; Chain (unit); Stationary distribution; Markov process; State space","score_opus":0.0073117248519971164,"score_gpt":0.1886372910241563,"score_spread":0.1813255661721592,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2968879960","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9157375,0.0010781636,0.069657415,0.002554154,0.00046222316,0.0005310618,0.0000251766,0.00066768675,0.009286612],"genre_scores_gemma":[0.9964164,0.0000072153916,0.000058548118,0.0013736878,0.001225784,0.000022002674,0.00004261852,0.000039761773,0.0008139752],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99855447,0.0001444725,0.00029753108,0.0004583789,0.00024192815,0.00030322862],"domain_scores_gemma":[0.99918926,0.00022079615,0.00023661283,0.00023708845,0.00005679704,0.00005943573],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006355555,0.00026076566,0.00041056587,0.00009605553,0.00025151565,0.00018591828,0.00022540623,0.00010185213,0.0002484915],"category_scores_gemma":[0.00024827453,0.00019710512,0.00008799736,0.00034620194,0.00019393345,0.0005459355,0.00016147805,0.00023396184,0.000118097276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0032790967,0.00011146575,0.004856812,0.0008161123,0.00034607857,0.00040798067,0.00030515762,0.004116496,0.0005872244,0.9823128,0.0012010144,0.0016597639],"study_design_scores_gemma":[0.0040952624,0.00023381328,0.004009613,0.0010402313,0.0011395289,0.000086673535,0.009430559,0.8737683,0.000030677256,0.07644989,0.027267454,0.0024479693],"about_ca_topic_score_codex":0.000036165187,"about_ca_topic_score_gemma":0.000013132618,"teacher_disagreement_score":0.9058629,"about_ca_system_score_codex":0.0000192112,"about_ca_system_score_gemma":0.00000882122,"threshold_uncertainty_score":0.8037714},"labels":[],"label_agreement":null},{"id":"W2969973120","doi":"10.1080/01605682.2019.1644978","title":"Strategic joining in an M/M/K queue with asynchronous and synchronous multiple vacations","year":2019,"lang":"en","type":"article","venue":"Journal of the Operational Research Society","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Unobservable; Social planner; Social Welfare; Asynchronous communication; Queue; Microeconomics; Computer science; Queueing theory; Operations research; Business; Economics; Econometrics; Mathematics; Computer network","score_opus":0.044773392016632066,"score_gpt":0.32200251657684503,"score_spread":0.277229124560213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2969973120","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99596655,0.000086502616,0.0004264868,0.002541646,0.000048769423,0.00018256536,0.0000010706366,0.000005675337,0.00074073655],"genre_scores_gemma":[0.99682295,0.000018721192,0.0022023397,0.0003959555,0.0003642935,0.0000058851774,0.0000036283232,0.0000140820885,0.00017212065],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986861,0.00009467975,0.00023913261,0.00015216299,0.0006103349,0.00021759051],"domain_scores_gemma":[0.99863297,0.00026476124,0.00017815921,0.00018813684,0.0007144665,0.000021519292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020020339,0.00009118749,0.00016102525,0.0001306783,0.0003786432,0.00034684016,0.00032147858,0.000045980232,0.00011206953],"category_scores_gemma":[0.00022351567,0.000057688325,0.00008059837,0.00058907527,0.00012640141,0.0016466758,0.00012230453,0.0005583502,0.000016502026],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041109553,0.0006282016,0.34944594,0.00022325665,0.0003376464,0.000021558984,0.0017036595,0.47315794,0.035386316,0.13586646,0.0014335915,0.0013843223],"study_design_scores_gemma":[0.0040167402,0.0003323776,0.12556815,0.0005640434,0.00009951174,0.000079609184,0.016617317,0.8037448,0.0003801103,0.045267396,0.002792059,0.0005378949],"about_ca_topic_score_codex":0.00009682845,"about_ca_topic_score_gemma":0.00024499238,"teacher_disagreement_score":0.33058685,"about_ca_system_score_codex":0.0001563311,"about_ca_system_score_gemma":0.00024662787,"threshold_uncertainty_score":0.33445877},"labels":[],"label_agreement":null},{"id":"W2970396343","doi":"10.1155/2019/7398658","title":"Analytically Explicit Results for the Distribution of the Number of Customers Served during a Busy Period for Special Cases of the <i>M/G/</i>1 Queue","year":2019,"lang":"en","type":"article","venue":"Journal of Probability and Statistics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Algorithm; Computer science; Database","score_opus":0.017395357845467998,"score_gpt":0.2574342214318702,"score_spread":0.24003886358640222,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2970396343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97067994,0.000016793123,0.02741356,0.00058360584,0.00019303188,0.00050242385,0.00054014433,0.000001929733,0.0000685952],"genre_scores_gemma":[0.9970739,0.0000067584283,0.0025584844,0.000027287955,0.0002510854,0.0000039251854,0.000006576514,0.0000065057816,0.000065488326],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987738,0.000043462427,0.0007137384,0.00010766908,0.0002411355,0.0001201849],"domain_scores_gemma":[0.9967619,0.0008717958,0.001249782,0.00025202497,0.0008555566,0.000008897201],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001180811,0.000096341995,0.0003143358,0.00002431734,0.00014991322,0.000027729537,0.0002557442,0.00003948166,0.000013534247],"category_scores_gemma":[0.0033763533,0.00005002736,0.000213638,0.00023718589,0.00021052516,0.0001842415,0.00008924161,0.00011589119,2.1465584e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.007307734,0.00049145345,0.0805961,0.0043867766,0.0006228624,0.000002045215,0.0009183425,0.021738915,0.001705527,0.87886584,0.00096797536,0.00239645],"study_design_scores_gemma":[0.009461011,0.00033805842,0.2929484,0.00122131,0.0043368526,0.000059269925,0.0057841735,0.05693271,0.0038304068,0.6174911,0.0069596367,0.00063703593],"about_ca_topic_score_codex":0.000043655815,"about_ca_topic_score_gemma":0.00013997155,"teacher_disagreement_score":0.26137468,"about_ca_system_score_codex":0.000035331224,"about_ca_system_score_gemma":0.000051590116,"threshold_uncertainty_score":0.4042054},"labels":[],"label_agreement":null},{"id":"W2971459170","doi":"10.1155/2019/6480139","title":"Analytically Simple and Computationally Efficient Results for the <i>GI</i><sup><i>X</i></sup>/<i>Geo</i>/<i>c</i> Queues","year":2019,"lang":"en","type":"article","venue":"Journal of Probability and Statistics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canadian Armed Forces; Royal Military College of Canada","funders":"","keywords":"Simple (philosophy); Queue; Queueing theory; Basis (linear algebra); Mathematics; Applied mathematics; Algorithm; Mathematical optimization; Combinatorics; Computer science; Discrete mathematics; Statistics; Geometry","score_opus":0.01464368427428271,"score_gpt":0.24803919805545782,"score_spread":0.23339551378117512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2971459170","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.33183798,0.00033772932,0.66264623,0.0033906137,0.00018419941,0.00076855224,0.00024674935,0.0000304677,0.000557477],"genre_scores_gemma":[0.92818856,0.000039842434,0.069614634,0.001574375,0.0004197317,0.0000052138544,0.0000315065,0.000020152296,0.00010595632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99844307,0.000042608728,0.00072395283,0.00023991142,0.0003322199,0.00021824098],"domain_scores_gemma":[0.9961638,0.0021940991,0.0006007251,0.00019930261,0.0008096685,0.000032429714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002214955,0.00016818516,0.00036124073,0.00010237933,0.00024893478,0.00024041279,0.00019492995,0.00005026293,0.000019639272],"category_scores_gemma":[0.0018691645,0.00011505378,0.00009263837,0.00021962025,0.0002167365,0.00030620617,0.00010605006,0.00020090373,0.000006177435],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011510762,0.00018798166,0.0034382043,0.0005174997,0.00021601983,0.000007319603,0.00028009622,0.46730068,0.00004489737,0.5150234,0.0035590571,0.008273749],"study_design_scores_gemma":[0.0013069839,0.00009613613,0.0022785491,0.000042901243,0.0003218164,0.000011371413,0.0003003766,0.6389599,0.0000044941894,0.33927572,0.017234793,0.00016696427],"about_ca_topic_score_codex":0.000020021076,"about_ca_topic_score_gemma":0.000026587044,"teacher_disagreement_score":0.5963506,"about_ca_system_score_codex":0.000029876095,"about_ca_system_score_gemma":0.000050407354,"threshold_uncertainty_score":0.4691757},"labels":[],"label_agreement":null},{"id":"W2974538316","doi":"10.1016/j.ejor.2019.09.002","title":"Ranking flexibility structures in queueing systems","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Flexibility (engineering); Ranking (information retrieval); Scheduling (production processes); Mathematical optimization; Queueing theory; Construct (python library); Operations research; Distributed computing; Mathematics; Artificial intelligence; Statistics; Computer network","score_opus":0.07116925766332625,"score_gpt":0.3478621419927272,"score_spread":0.2766928843294009,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2974538316","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96366554,0.0002373125,0.0008793443,0.00042719208,0.00028830493,0.00015027812,5.132439e-7,0.0000099149465,0.034341585],"genre_scores_gemma":[0.9979112,0.0000058703276,0.0002970709,0.00014155052,0.0011446972,7.170903e-7,0.0000032631483,0.000022509657,0.00047311847],"study_design_codex":"simulation_or_modeling","study_design_gemma":"observational","domain_scores_codex":[0.99754167,0.0005454307,0.0005609717,0.00018594354,0.00091605383,0.00024991148],"domain_scores_gemma":[0.99839056,0.00025782562,0.00020401969,0.00019507266,0.00093478075,0.000017752025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011923029,0.00009538856,0.00020725456,0.00074454484,0.00015752786,0.00048458326,0.0004499127,0.000017188931,0.00046433817],"category_scores_gemma":[0.001242056,0.00007743372,0.00007409649,0.000668727,0.00006151791,0.0014114336,0.00016524519,0.0005836461,0.0003402167],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00054788426,0.00010411516,0.04233312,0.00021143584,0.00008558575,0.00041487635,0.00026437547,0.6047845,0.012520229,0.33337405,0.000923397,0.0044364],"study_design_scores_gemma":[0.010752112,0.00043921187,0.33627802,0.0027954965,0.000106534164,0.0002701924,0.00792077,0.32993653,0.00085808395,0.09460341,0.21422967,0.0018099708],"about_ca_topic_score_codex":0.000049466264,"about_ca_topic_score_gemma":0.000008861752,"teacher_disagreement_score":0.2939449,"about_ca_system_score_codex":0.00010096504,"about_ca_system_score_gemma":0.00006732036,"threshold_uncertainty_score":0.5084177},"labels":[],"label_agreement":null},{"id":"W2975615174","doi":"10.18280/isi.240302","title":"Analysis of an N-policy MX/M/1 Two-phase Queueing System with State-dependent Arrival Rates and Unreliable Server","year":2019,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Queueing system; Queueing theory; State (computer science); Phase (matter); Computer science; State dependent; Computer network; Mathematics; Physics; Algorithm; Mathematical economics; Quantum mechanics","score_opus":0.007413299569483161,"score_gpt":0.24233552548080037,"score_spread":0.2349222259113172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2975615174","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97456795,0.000022016025,0.021124167,0.000009715113,0.00006994791,0.0002884709,0.000013045152,0.00016563544,0.0037390436],"genre_scores_gemma":[0.9990757,0.0000022245085,0.0004374439,0.00013368571,0.00007918729,0.00001311302,0.00017697489,0.000020516116,0.000061149185],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998433,0.000032128642,0.0006731279,0.00019839483,0.000361212,0.00030214226],"domain_scores_gemma":[0.9982108,0.000065356944,0.0008598077,0.00038473052,0.00044853365,0.000030774212],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010326689,0.00022925815,0.000483715,0.0016280247,0.00018185886,0.00040043445,0.00019639023,0.00005665115,0.000044148477],"category_scores_gemma":[0.00010426472,0.00019747297,0.000081891165,0.00219373,0.00009469563,0.0087724645,0.00010278076,0.00009821571,0.00005642049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012237866,0.0001245214,0.08052516,0.004268238,0.0020041715,0.000014881984,0.0032024656,0.77965426,0.001276255,0.10453018,0.0000074199756,0.02316867],"study_design_scores_gemma":[0.0031156952,0.00013353638,0.008094541,0.0004723475,0.0015305164,0.000011787133,0.010231666,0.9705544,0.0018362575,0.0030189224,0.00030731614,0.00069300615],"about_ca_topic_score_codex":0.0027538487,"about_ca_topic_score_gemma":0.0003536323,"teacher_disagreement_score":0.19090016,"about_ca_system_score_codex":0.00018379428,"about_ca_system_score_gemma":0.0000397687,"threshold_uncertainty_score":0.8052714},"labels":[],"label_agreement":null},{"id":"W2981507393","doi":"10.1109/itc31.2019.00010","title":"Fluctuations Around the Mean-Field for a Large Scale Erlang Loss System Under the SQ(d) Load Balancing","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Erlang (programming language); Server; Poisson process; Erlang distribution; Limit (mathematics); Poisson distribution; Discrete mathematics; Computer science; Exponential distribution; Algorithm; Mathematics; Statistics; Theoretical computer science; Mathematical analysis; Computer network","score_opus":0.009695658103697354,"score_gpt":0.234412181644866,"score_spread":0.22471652354116864,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2981507393","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.41965887,0.00013216025,0.50446934,0.008109522,0.00077604415,0.0012849444,0.000006360991,0.00040056108,0.065162204],"genre_scores_gemma":[0.98967385,0.0000011040183,0.00024724542,0.004526899,0.00079247943,0.00006185377,0.000011626186,0.000025760544,0.0046592047],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989083,0.000021645825,0.00023721703,0.0002513912,0.00025982756,0.00032160993],"domain_scores_gemma":[0.99851805,0.0005602939,0.0001698038,0.00055115746,0.00019299838,0.000007723558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011485957,0.00015320689,0.00018300099,0.00006467308,0.000592252,0.00030555416,0.00040325295,0.000052104082,0.00026212717],"category_scores_gemma":[0.0001038467,0.0000829194,0.00016182344,0.00040863664,0.000025044124,0.0006333788,0.00014433808,0.00012600739,0.0006312743],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004543328,0.000030859486,0.0021674498,0.00017695327,0.00013526835,8.767514e-7,0.0002730484,0.011120231,0.00039315302,0.9828569,0.0025113565,0.00028844638],"study_design_scores_gemma":[0.0017698708,0.000022304905,0.0010677045,0.00022719869,0.00078150415,0.000008947175,0.0781543,0.7587249,0.00035032787,0.07078424,0.08736471,0.00074396865],"about_ca_topic_score_codex":0.00021127104,"about_ca_topic_score_gemma":0.0011103855,"teacher_disagreement_score":0.91207266,"about_ca_system_score_codex":0.000077994315,"about_ca_system_score_gemma":0.000020084517,"threshold_uncertainty_score":0.8113965},"labels":[],"label_agreement":null},{"id":"W2986699483","doi":"10.1017/apr.2019.41","title":"Insensitivity of the mean field limit of loss systems under SQ(<i>d</i>) routeing","year":2019,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Orthant; Markov chain; Context (archaeology); Applied mathematics; Discrete mathematics; Statistics","score_opus":0.009310284771704974,"score_gpt":0.2188710645630095,"score_spread":0.20956077979130452,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986699483","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9768515,0.00019195465,0.003118879,0.00012006164,0.0003178999,0.00073257776,0.0000025008744,0.00004364849,0.01862093],"genre_scores_gemma":[0.9992237,0.000010660946,0.00039537574,0.00020304752,0.00009473843,0.000023363045,0.0000022671654,0.000014599882,0.00003225294],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985323,0.00005096821,0.0005286245,0.000375713,0.0002850491,0.00022735579],"domain_scores_gemma":[0.9981342,0.00041871617,0.0005583775,0.00077563303,0.00010598315,0.0000071174345],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010607321,0.00017395805,0.00044951634,0.0000886955,0.000053764124,0.00002052271,0.00037684955,0.00007826474,0.000022364631],"category_scores_gemma":[0.00018984276,0.00013356008,0.00011720007,0.0008263889,0.00018218199,0.0005417749,0.0002875672,0.00020751018,0.000013933111],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00024766932,0.00021142606,0.11314845,0.0016098986,0.00003750356,8.61252e-7,0.00011954444,0.2799168,0.0037859194,0.5952426,0.0000044577278,0.00567482],"study_design_scores_gemma":[0.0013984408,0.000030257142,0.014129676,0.00053204823,0.00014348747,0.0000016896385,0.001116664,0.014068965,0.015026583,0.94878495,0.0040944894,0.00067276426],"about_ca_topic_score_codex":0.00019821321,"about_ca_topic_score_gemma":0.00044125924,"teacher_disagreement_score":0.3535423,"about_ca_system_score_codex":0.00006001356,"about_ca_system_score_gemma":0.00001805158,"threshold_uncertainty_score":0.5446422},"labels":[],"label_agreement":null},{"id":"W2986715421","doi":"","title":"Fluctuations Around the Mean-Field for a Large Scale Erlang Loss System Under the SQ(d) Load Balancing.","year":2019,"lang":"en","type":"article","venue":"International Test Conference","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Erlang (programming language); Server; Poisson point process; Scaling; Mathematics; Stochastic process; Point process; Computer science; Statistics","score_opus":0.01605728233050696,"score_gpt":0.2581851506786287,"score_spread":0.24212786834812172,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2986715421","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43712145,0.00009043025,0.43094808,0.02883634,0.0026241976,0.0013272208,0.00008086901,0.00037869313,0.09859273],"genre_scores_gemma":[0.9934158,0.0000019256959,0.00015097666,0.0026954906,0.00080745266,0.00007616457,0.000032658318,0.000015471469,0.002804103],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99894905,0.000013561239,0.00023108255,0.00024419246,0.0003583895,0.00020370174],"domain_scores_gemma":[0.9978306,0.00097408163,0.00021946177,0.00034422107,0.00062355096,0.000008042344],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005977377,0.00013582797,0.0001317139,0.000068072084,0.0002676826,0.0003957635,0.0007106816,0.00004243005,0.00037207338],"category_scores_gemma":[0.00042340098,0.00008528116,0.00010424465,0.00019405509,0.000039709365,0.00054946425,0.00015718612,0.00013889335,0.0005665589],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000033442826,0.0000471964,0.008382993,0.000047032358,0.00009756108,0.0000013672728,0.00018546337,0.0023475385,0.0005063955,0.9869689,0.00095313275,0.00042902437],"study_design_scores_gemma":[0.0011468359,0.000023018258,0.0063215843,0.00029668474,0.00020236807,0.00001343266,0.00984121,0.79830104,0.00019356863,0.09294877,0.09026063,0.00045084802],"about_ca_topic_score_codex":0.00015974701,"about_ca_topic_score_gemma":0.0005866684,"teacher_disagreement_score":0.8940201,"about_ca_system_score_codex":0.000097051234,"about_ca_system_score_gemma":0.000047357295,"threshold_uncertainty_score":0.7282158},"labels":[],"label_agreement":null},{"id":"W2989126433","doi":"","title":"On Occupancy Based Randomized Routing Schemes in Large Systems of Shared Servers.","year":2018,"lang":"en","type":"article","venue":"International Test Conference","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Server; Computer science; Queue; Routing (electronic design automation); Fixed point; Exponential distribution; Mathematics; Field (mathematics); Statistics; Computer network","score_opus":0.022145484702574415,"score_gpt":0.2736501199179476,"score_spread":0.25150463521537314,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989126433","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8743759,0.00003646591,0.07431345,0.001224042,0.0012606254,0.0006762629,0.000065430264,0.00022647847,0.04782139],"genre_scores_gemma":[0.998664,9.1424965e-7,0.00033999796,0.00042032189,0.00028691502,0.000025892152,0.000047007255,0.000011566716,0.00020338975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988595,0.00002985341,0.00041586478,0.00024084131,0.00028907493,0.00016483378],"domain_scores_gemma":[0.99820566,0.0006003939,0.00041064192,0.00018432482,0.0005914561,0.0000074938484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000787787,0.00012886246,0.00032606692,0.00033827376,0.00004875399,0.00012658825,0.00038901423,0.000043010234,0.0006766533],"category_scores_gemma":[0.0037516463,0.000121821686,0.0000916239,0.0002939005,0.0000917854,0.00052889274,0.000095673844,0.00009784711,0.00015165644],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033682426,0.00021038365,0.040822852,0.00006910252,0.00007380812,0.000009407386,0.00004582984,0.0009768443,0.00066823274,0.95334345,0.00009621748,0.00031560563],"study_design_scores_gemma":[0.027174663,0.000014367071,0.002697712,0.00083944906,0.000043005733,4.2308238e-7,0.00009521472,0.9486702,0.00037831074,0.018565346,0.0012679114,0.00025339363],"about_ca_topic_score_codex":0.0002478455,"about_ca_topic_score_gemma":0.0000943033,"teacher_disagreement_score":0.94769335,"about_ca_system_score_codex":0.000040138595,"about_ca_system_score_gemma":0.00002769013,"threshold_uncertainty_score":0.7408879},"labels":[],"label_agreement":null},{"id":"W2989913882","doi":"10.1016/j.ejor.2019.11.041","title":"Comparison of fluid approximations for service systems with state-dependent service rates and return probabilities","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Regina; University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Service (business); Bistability; Queueing theory; Ordinary differential equation; Applied mathematics; Stochastic differential equation; Set (abstract data type); Differential equation; Mathematical optimization; Mathematics; Physics; Mathematical analysis; Economics","score_opus":0.0762223104135542,"score_gpt":0.3469369497810108,"score_spread":0.2707146393674566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2989913882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9893884,0.00019983982,0.0055319476,0.001384604,0.000066687484,0.0005141649,0.0000076040815,0.000009092495,0.0028976817],"genre_scores_gemma":[0.99722105,0.0000043553205,0.0017649065,0.00013802738,0.0002481442,0.000005312227,0.00001582995,0.000026343532,0.0005760285],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99818784,0.00020116911,0.0005542197,0.00015282886,0.0007187879,0.000185183],"domain_scores_gemma":[0.9943938,0.00046197782,0.00033492464,0.00015411593,0.004631804,0.000023351718],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005807064,0.00010019188,0.00025317384,0.00035378145,0.00019750469,0.00031425545,0.00027782284,0.0000139379,0.000041217692],"category_scores_gemma":[0.00035327332,0.0000736207,0.000031675256,0.0005116296,0.00006095049,0.001009742,0.00011077405,0.0002256014,0.000028824812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00463169,0.00072968006,0.06408998,0.0074117994,0.000751732,0.000032593427,0.004902897,0.701822,0.064030044,0.14874907,0.0013839036,0.0014646155],"study_design_scores_gemma":[0.008595337,0.0016316292,0.01865257,0.002715419,0.00029186645,0.000108885506,0.04856371,0.8622445,0.007927239,0.012316922,0.03584286,0.001109098],"about_ca_topic_score_codex":0.000029052133,"about_ca_topic_score_gemma":0.000039159146,"teacher_disagreement_score":0.16042247,"about_ca_system_score_codex":0.000035511282,"about_ca_system_score_gemma":0.00007951575,"threshold_uncertainty_score":0.30303726},"labels":[],"label_agreement":null},{"id":"W2995625743","doi":"10.48550/arxiv.1912.08368","title":"Real-Time Prediction of Delay Distribution in Service Systems using Mixture Density Networks","year":2019,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Queueing theory; Variance (accounting); Service (business); Percentile; Stability (learning theory); Statistics; Machine learning; Mathematics; Computer network","score_opus":0.03077856169877187,"score_gpt":0.172086336382359,"score_spread":0.14130777468358713,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2995625743","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84055424,0.000026413425,0.157981,0.000009507229,0.0004350921,0.00034433152,0.000043781678,0.00011637299,0.0004892406],"genre_scores_gemma":[0.9986386,0.000047026413,0.00003148583,0.000025272317,0.0003286214,5.263352e-7,0.0007084482,0.000028676743,0.00019137215],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985169,0.00008742509,0.00034336702,0.00067675253,0.00009403847,0.00028150537],"domain_scores_gemma":[0.99799335,0.00006796603,0.00081820576,0.0006659567,0.00043671302,0.000017813638],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00051677605,0.00029783408,0.0005331482,0.00032770613,0.00010286645,0.00006795219,0.00041910916,0.00043466437,0.000024738702],"category_scores_gemma":[0.000045353005,0.00035972625,0.0001686242,0.0012670428,0.000050535313,0.00069598935,0.0007500402,0.000462823,0.00004023562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012737971,0.000048234535,0.029181719,0.00045309917,0.00009750934,0.00004296698,0.000011850192,0.9613071,0.00022923895,0.008441263,0.000050563405,0.000009073861],"study_design_scores_gemma":[0.0003306068,0.000003632822,0.0029885888,0.0004787783,0.0004940554,0.0000013230654,0.00009736748,0.9920339,0.000009997509,0.0032293526,0.00006810267,0.00026432436],"about_ca_topic_score_codex":0.004713149,"about_ca_topic_score_gemma":0.0001861097,"teacher_disagreement_score":0.15808432,"about_ca_system_score_codex":0.00037519488,"about_ca_system_score_gemma":0.00004273116,"threshold_uncertainty_score":0.9998855},"labels":[],"label_agreement":null},{"id":"W2996386544","doi":"10.1145/3365669","title":"AMIR","year":2019,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Hewlett-Packard (Canada); University of Calgary","funders":"","keywords":"Burstiness; Schedule; Bottleneck; Computer science; Scheduling (production processes); Session (web analytics); Service (business); Computer network; Mathematical optimization; Mathematics","score_opus":0.04234072071516095,"score_gpt":0.2806580517183494,"score_spread":0.23831733100318844,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2996386544","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82391804,0.00006656748,0.17409268,0.000048824364,0.0004052062,0.00023452396,6.3446174e-7,0.000071756054,0.0011617563],"genre_scores_gemma":[0.9992502,0.0000107075875,0.00040621049,0.00007127438,0.00015559533,0.000008383168,0.0000061831847,0.000016543176,0.00007494985],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99871904,0.00003937683,0.00036319566,0.00023350665,0.00049928774,0.0001455824],"domain_scores_gemma":[0.9988861,0.000077722136,0.00021090992,0.00036814532,0.00044853525,0.0000086021855],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020803476,0.00012971876,0.00021822685,0.00029505574,0.00020660015,0.00006956816,0.00016287468,0.0000516035,0.000048324215],"category_scores_gemma":[0.000042984317,0.0001240489,0.00005781605,0.00030619674,0.00001999562,0.00052112306,0.000009632133,0.00012737766,0.0000877079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025325797,0.000020934425,0.0005923098,0.00013845043,0.000028355977,2.6406752e-8,0.00009684794,0.97171545,0.00007025155,0.00040475035,0.000001950882,0.02690536],"study_design_scores_gemma":[0.00047999152,0.000021999536,0.0001906472,0.00025048587,0.00012253033,0.000001328794,0.00029280255,0.9976875,0.000030293735,0.00073173427,0.000054624383,0.00013602596],"about_ca_topic_score_codex":0.000074934025,"about_ca_topic_score_gemma":0.0000023640102,"teacher_disagreement_score":0.1753321,"about_ca_system_score_codex":0.000035975634,"about_ca_system_score_gemma":0.00002056441,"threshold_uncertainty_score":0.5058567},"labels":[],"label_agreement":null},{"id":"W2997157141","doi":"10.5539/ijsp.v9n1p63","title":"Decomposition of M/M/1 With Unreliable Service and a Working Vacation","year":2020,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Laplace transform; Mathematics; Decomposition; Queue; Service (business); Value (mathematics); Stationary distribution; Distribution (mathematics); Variance (accounting); Function (biology); Mathematical optimization; Applied mathematics; Combinatorics; Statistics; Mathematical economics; Mathematical analysis; Computer science; Economics; Markov chain; Computer network","score_opus":0.016975150406384212,"score_gpt":0.25594601598651906,"score_spread":0.23897086558013486,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W2997157141","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72189885,0.00007292184,0.27310866,0.004435566,0.000089174406,0.00007591399,0.000014284803,0.0000073378687,0.00029727316],"genre_scores_gemma":[0.97104806,0.00001706527,0.028170405,0.000592599,0.00015770769,5.622822e-7,0.000007956865,0.000004126213,0.0000015096239],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99944973,0.0000095951455,0.0002425576,0.00007815303,0.00017785438,0.000042110838],"domain_scores_gemma":[0.9987364,0.000095924304,0.00041446387,0.000032472086,0.00070832076,0.000012438696],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00024699044,0.0000532444,0.00011445903,0.000054051125,0.000029135395,0.00006174075,0.00008548136,0.000014080871,0.000023433928],"category_scores_gemma":[0.00016430703,0.000043496526,0.000012488206,0.00011160502,0.000036169284,0.00032136147,0.00004376321,0.00006624417,6.554499e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0042895647,0.0003685845,0.24006315,0.0012453297,0.00084577384,0.000060126968,0.001346367,0.04241787,0.00427444,0.61564606,0.0005110768,0.08893166],"study_design_scores_gemma":[0.0021387613,0.0001637695,0.052681692,0.00051778107,0.00041998277,0.00004587605,0.00033711366,0.1408697,0.00038967395,0.796355,0.0057717054,0.0003089077],"about_ca_topic_score_codex":0.00003334758,"about_ca_topic_score_gemma":0.0000264326,"teacher_disagreement_score":0.2491492,"about_ca_system_score_codex":0.00001293128,"about_ca_system_score_gemma":0.000013081483,"threshold_uncertainty_score":0.17737369},"labels":[],"label_agreement":null},{"id":"W3010541414","doi":"10.23919/cnsm46954.2019.9012688","title":"Predicting Distributions of Waiting Times in Customer Service Systems using Mixture Density Networks","year":2019,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Queueing theory; Variance (accounting); Queue; Service (business); Percentile; Data mining; Statistics; Computer network; Mathematics","score_opus":0.009490698506952867,"score_gpt":0.21761436066125975,"score_spread":0.2081236621543069,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3010541414","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97994053,0.000055010198,0.01347997,0.00006636229,0.0002101196,0.00019810595,0.000002356361,0.00010226221,0.005945292],"genre_scores_gemma":[0.99909437,9.45111e-7,0.00020706095,0.00016014988,0.0003180303,0.0000028424352,0.000037559923,0.000018479695,0.0001605385],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989302,0.000025781403,0.00037270194,0.0002404552,0.00015769592,0.0002731351],"domain_scores_gemma":[0.99907255,0.00010540901,0.00032967972,0.000246131,0.0002372435,0.000008982908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00051822903,0.00014555392,0.00030124004,0.00018527186,0.00011011427,0.00007764306,0.00016874209,0.00008774649,0.00015038652],"category_scores_gemma":[0.00009276883,0.0001359759,0.000067827656,0.0011778903,0.000020634232,0.0008132767,0.00017984404,0.00017749591,0.00007520566],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021977856,0.00003732957,0.3284358,0.00030008226,0.00005230405,0.0000038304397,0.000026652111,0.62848014,0.0015252002,0.04094706,0.00004611873,0.00012349812],"study_design_scores_gemma":[0.00019486004,9.834303e-7,0.0019603858,0.00022271965,0.00008408303,0.0000018310003,0.00063883234,0.9960387,0.000072767456,0.00038822985,0.00024054083,0.0001560973],"about_ca_topic_score_codex":0.0027044292,"about_ca_topic_score_gemma":0.00029912073,"teacher_disagreement_score":0.36755854,"about_ca_system_score_codex":0.000053285505,"about_ca_system_score_gemma":0.00000950725,"threshold_uncertainty_score":0.5544936},"labels":[],"label_agreement":null},{"id":"W3011562138","doi":"10.1080/03155986.2020.1734902","title":"Balancing herding and congestion in service systems: a queueing perspective","year":2020,"lang":"en","type":"article","venue":"INFOR Information Systems and Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Herding; Computer science; Queue; Service (business); Queueing theory; Operations research; Bulk queue; Mathematical optimization; Traffic intensity; Computer network; Business; Mathematics; Marketing","score_opus":0.04815407499824664,"score_gpt":0.31832470624632236,"score_spread":0.2701706312480757,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011562138","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9310906,0.0010544595,0.007819635,0.01103624,0.00031298707,0.0021388854,0.000022104317,0.00020417233,0.04632095],"genre_scores_gemma":[0.998339,0.000017037642,0.000039842133,0.0011024458,0.0003478671,0.00007405812,0.00003530623,0.000007302877,0.000037162434],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986452,0.000048514892,0.0004433461,0.00015069904,0.0004992018,0.00021304382],"domain_scores_gemma":[0.998439,0.00017563134,0.00012459517,0.00007766787,0.0011502568,0.00003283386],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0017615749,0.00010912154,0.00018431521,0.00045958953,0.0003595429,0.0014176796,0.00009649442,0.00006594835,0.000011423402],"category_scores_gemma":[0.0009111359,0.00010135517,0.000014906308,0.00086840877,0.00004179618,0.0066768276,0.00014583813,0.00023715828,0.000098453915],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010504709,0.0000064387355,0.007072802,0.0009609299,0.000029228426,0.0000035436417,0.004336214,0.11782511,0.00017132821,0.8685486,0.00025948108,0.0006813233],"study_design_scores_gemma":[0.0005963575,0.000013980063,0.0023153634,0.00026929122,0.0000071913514,0.0000077645855,0.042959433,0.92927223,0.0000051212814,0.00039535319,0.02398474,0.00017314564],"about_ca_topic_score_codex":0.0040054177,"about_ca_topic_score_gemma":0.00016231765,"teacher_disagreement_score":0.8681532,"about_ca_system_score_codex":0.00012114973,"about_ca_system_score_gemma":0.000056012363,"threshold_uncertainty_score":0.99961895},"labels":[],"label_agreement":null},{"id":"W3011769773","doi":"10.1017/s0269964820000121","title":"ANALYTICALLY CLOSED-FORM SOLUTIONS FOR THE DISTRIBUTION OF A NUMBER OF CUSTOMERS SERVED DURING A BUSY PERIOD FOR SPECIAL CASES OF THE<i>GEO/G/1</i>QUEUE","year":2020,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Queue; Bernoulli's principle; Mathematics; Computation; Applied mathematics; Distribution (mathematics); Variance (accounting); Computer science; Mathematical analysis; Algorithm; Physics; Computer network","score_opus":0.023982330290847165,"score_gpt":0.2373908195035364,"score_spread":0.21340848921268923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3011769773","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9952135,0.000015011152,0.0024646039,0.0016700071,0.000041875708,0.00041125366,0.000048445385,0.000008310953,0.00012698384],"genre_scores_gemma":[0.999627,0.000002224817,0.00016595412,0.000044281023,0.00011378602,0.00003539584,0.000008486502,0.0000015932285,0.0000012674274],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99926835,0.0000067258743,0.0003323022,0.000073919866,0.0001898293,0.00012884867],"domain_scores_gemma":[0.9992414,0.00034873193,0.00018441038,0.00008307576,0.00013668175,0.000005699866],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010966301,0.00006551634,0.00012238396,0.000029732875,0.00022790022,0.000033498578,0.00025998562,0.000018743407,0.000005612487],"category_scores_gemma":[0.0014613059,0.000036332072,0.000094152056,0.0005892877,0.00025902552,0.0005439582,0.00007525025,0.00004937657,2.4633465e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000066403176,0.000027887017,0.002209063,0.00073932833,0.000022747514,2.2529067e-8,0.000989755,0.71629727,0.00009460416,0.2790954,0.000018792463,0.00043869895],"study_design_scores_gemma":[0.00027028957,0.000017829303,0.012064685,0.000056067147,0.00006175109,0.0000018855134,0.0013361213,0.97250646,0.00014216892,0.01275961,0.00069899135,0.000084131076],"about_ca_topic_score_codex":0.000038130493,"about_ca_topic_score_gemma":0.000022563143,"teacher_disagreement_score":0.26633582,"about_ca_system_score_codex":0.000016863954,"about_ca_system_score_gemma":0.000026731555,"threshold_uncertainty_score":0.17528473},"labels":[],"label_agreement":null},{"id":"W3013428630","doi":"10.1007/978-3-319-92378-9_2","title":"SMVA: A Stable Mean Value Analysis Algorithm for Closed Systems with Load-Dependent Queues","year":2018,"lang":"en","type":"book-chapter","venue":"EAI/Springer Innovations in Communication and Computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University; Toronto Metropolitan University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Mean value analysis; Queueing theory; Stability (learning theory); Algorithm; Computer science; Mathematical optimization; Value (mathematics); Mathematics; Layered queueing network; Machine learning","score_opus":0.02533057273564437,"score_gpt":0.2594867334109554,"score_spread":0.23415616067531103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3013428630","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009322888,0.0024318355,0.8141921,0.0010076705,0.0004090539,0.0023227714,0.00005035941,0.00073729723,0.169526],"genre_scores_gemma":[0.8387519,0.00024830195,0.1052546,0.002073773,0.0018470915,0.00024350776,0.0014789748,0.00038504746,0.049716823],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99763834,0.00004165442,0.0009712921,0.0006144218,0.00041451884,0.00031977365],"domain_scores_gemma":[0.9957104,0.0003227387,0.0012736688,0.0012754794,0.0014010236,0.000016693322],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002056139,0.00043014743,0.0007389994,0.001539189,0.00071536604,0.00055836345,0.0006835629,0.00020879546,0.000057723446],"category_scores_gemma":[0.000096604104,0.0004375146,0.00013237994,0.0012372074,0.00019708977,0.0005325572,0.0005904194,0.00048079836,0.00001991177],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005543846,0.00011587282,0.0007597552,0.00030585338,0.002041369,0.0000037930993,0.0006404171,0.03162188,0.000017671171,0.929391,0.00041491434,0.034631994],"study_design_scores_gemma":[0.0010877622,0.000025818323,0.00022315967,0.0009642128,0.0014968037,0.0000030013477,0.00085752964,0.86730224,0.000010125717,0.037743747,0.0892532,0.0010323757],"about_ca_topic_score_codex":0.00050885504,"about_ca_topic_score_gemma":0.0008061012,"teacher_disagreement_score":0.8916473,"about_ca_system_score_codex":0.00026977021,"about_ca_system_score_gemma":0.00006040108,"threshold_uncertainty_score":0.99980766},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.04003862520928552,"score_gpt":0.3258170514260944,"score_spread":0.2857784262168089,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3018789859","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.92647696,0.00012061593,0.018355696,0.026975162,0.000048872615,0.0043428945,0.00007605798,0.00035357047,0.023250155],"genre_scores_gemma":[0.8264689,0.00021135152,0.09849971,0.0044611422,0.0009870268,0.0014820178,0.0008938378,0.0003065512,0.06668947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99819523,0.000071166236,0.0003063163,0.00054713065,0.00047274397,0.0004073966],"domain_scores_gemma":[0.99856645,0.00014380807,0.00007154669,0.0004410483,0.0007376471,0.000039481238],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011770071,0.00016172833,0.00021378565,0.00026970406,0.0010455963,0.00046665035,0.00037973185,0.000042665626,0.00012648151],"category_scores_gemma":[0.00050855393,0.00015328515,0.00002567819,0.0016354768,0.000088120636,0.0012185071,0.00035007924,0.00016270843,0.00033753557],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006526375,0.001009531,0.00389737,0.01212437,0.0016028521,0.00038688292,0.0053400407,0.5088787,0.27405235,0.11098145,0.040303774,0.034896296],"study_design_scores_gemma":[0.0009949385,0.00009547685,0.0004212768,0.00029006385,0.00011261864,0.000001771881,0.00046908337,0.93819314,0.000092694776,0.0029513305,0.056042973,0.00033465162],"about_ca_topic_score_codex":0.00019091454,"about_ca_topic_score_gemma":0.00033235003,"teacher_disagreement_score":0.42931443,"about_ca_system_score_codex":0.00008783697,"about_ca_system_score_gemma":0.000029626151,"threshold_uncertainty_score":0.80419874},"labels":[],"label_agreement":null},{"id":"W3024928891","doi":"10.2139/ssrn.3046905","title":"Efficient Inaccuracy: User-Generated Information Sharing in a Queue","year":2017,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Queue; Computer science; Computer network; Operations research; Mathematics","score_opus":0.009139232513702031,"score_gpt":0.24077231477506775,"score_spread":0.23163308226136572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3024928891","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9862172,0.00011976026,0.009289336,0.0007452583,0.00020305159,0.00010988152,3.611287e-7,0.0000540109,0.0032611382],"genre_scores_gemma":[0.9988699,0.00006471394,0.000044253542,0.0002631793,0.00047002372,0.0000061794713,0.0000073850756,0.000016031729,0.00025835927],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979575,0.000013171754,0.00037956375,0.00015578003,0.0002182976,0.0012756335],"domain_scores_gemma":[0.99878097,0.000015065241,0.0006794755,0.0003570637,0.00015461103,0.000012808523],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022761347,0.00015587916,0.00018674898,0.00044094576,0.00075264723,0.0008924761,0.0006698902,0.000058269612,0.00003908333],"category_scores_gemma":[0.00061099976,0.0001445786,0.000085332016,0.0002745144,0.000036679823,0.0027251479,0.00020438575,0.0010263504,0.00019077593],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014477124,0.00006990025,0.02134758,0.000031276348,0.00009776012,0.000010762901,0.00010662965,0.09651012,0.0002787644,0.8581315,0.000033242897,0.023237675],"study_design_scores_gemma":[0.0029257962,0.000036791036,0.012760528,0.00022566812,0.00014747001,0.00007392371,0.0021084673,0.37467626,0.00010672311,0.59711784,0.00903711,0.00078343006],"about_ca_topic_score_codex":0.00058282097,"about_ca_topic_score_gemma":0.002281285,"teacher_disagreement_score":0.27816615,"about_ca_system_score_codex":0.0005849467,"about_ca_system_score_gemma":0.0002053632,"threshold_uncertainty_score":0.86061674},"labels":[],"label_agreement":null},{"id":"W3026638561","doi":"10.2139/ssrn.2971841","title":"Flexible Workers or Full-Time Employees? On Staffing Systems with a Blended Workforce","year":2017,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Staffing; Workforce; Business; Workforce diversity; Labour economics; Operations management; Nursing; Engineering; Economics; Medicine; Economic growth","score_opus":0.015843214241632424,"score_gpt":0.25249653937906813,"score_spread":0.2366533251374357,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3026638561","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9147841,0.0008413798,0.047953244,0.0022428196,0.00071477436,0.00066636375,0.0000019155068,0.00060040306,0.032195028],"genre_scores_gemma":[0.97808224,0.00011318666,0.00012138525,0.00015107874,0.0015688809,0.000014577381,0.0000042813886,0.00008901553,0.01985534],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9964592,0.000037124733,0.00036457565,0.0003870803,0.00048372723,0.0022683253],"domain_scores_gemma":[0.99801576,0.000074760195,0.0010033988,0.00069334614,0.0001768019,0.000035924844],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0018727642,0.00034078193,0.000418567,0.00034400195,0.0017332328,0.0014287158,0.0009039051,0.00008465687,0.000118358206],"category_scores_gemma":[0.00025919324,0.00023993831,0.00014814029,0.00035080328,0.00010338988,0.0018751485,0.00012765445,0.0013640422,0.00040800296],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012018305,0.0005190393,0.011043937,0.00017184645,0.0027545765,0.00029678535,0.00011485203,0.15317182,0.00065235805,0.75855833,0.0016260601,0.059072074],"study_design_scores_gemma":[0.022387326,0.0042546443,0.0017948073,0.007965014,0.004424949,0.0022692159,0.02334701,0.0689232,0.00033806256,0.74723876,0.10917041,0.007886624],"about_ca_topic_score_codex":0.0001239242,"about_ca_topic_score_gemma":0.00054441515,"teacher_disagreement_score":0.10754435,"about_ca_system_score_codex":0.0005626222,"about_ca_system_score_gemma":0.0005582599,"threshold_uncertainty_score":0.9996079},"labels":[],"label_agreement":null},{"id":"W3029129703","doi":"10.1145/3388831.3388845","title":"Speed scaling in fork-join queues","year":2020,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Fork–join queue; Computer science; Queue; Join (topology); Power consumption; Server; Fork (system call); Throughput; Scaling; Distributed computing; Real-time computing; Adaptation (eye); Power (physics); Computer network; Queue management system; Operating system; Mathematics","score_opus":0.02491154183826012,"score_gpt":0.23970189121380311,"score_spread":0.214790349375543,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3029129703","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8446689,0.00007277197,0.010050247,0.0106746135,0.00011710965,0.00020645489,5.0843425e-7,0.0005901898,0.13361916],"genre_scores_gemma":[0.99002653,0.0000019088932,0.00065236277,0.008400978,0.0005708076,0.000001730646,0.0000064490287,0.000017893515,0.00032135175],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992761,0.0000070882616,0.00020188725,0.00021833809,0.00011013191,0.00018646393],"domain_scores_gemma":[0.9997345,0.000033023807,0.00007312355,0.00011526273,0.00003389031,0.000010153215],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00020099577,0.00010426742,0.00016884784,0.00012918796,0.00005044444,0.00009979808,0.0001630815,0.000030799423,0.0007149491],"category_scores_gemma":[0.00026397186,0.00009525065,0.00006350704,0.0007124919,0.000021136157,0.00076220266,0.00011957579,0.00009379234,0.00068322755],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005930695,0.000310844,0.11746266,0.00075357663,0.00020608457,0.000271804,0.0010121859,0.1870521,0.01645613,0.5908997,0.023902092,0.061079755],"study_design_scores_gemma":[0.0014240231,0.000010966544,0.0020969643,0.00010242787,0.00011133691,7.407199e-7,0.0023785122,0.80202425,0.0017738133,0.05805999,0.13114688,0.0008700983],"about_ca_topic_score_codex":0.0001911271,"about_ca_topic_score_gemma":0.00011451671,"teacher_disagreement_score":0.6149722,"about_ca_system_score_codex":0.000013667339,"about_ca_system_score_gemma":0.0000037748698,"threshold_uncertainty_score":0.8781736},"labels":[],"label_agreement":null},{"id":"W30294657","doi":"10.1016/j.ssmph.2018.08.010","title":"'QNA reloaded': a tool for traffic engineering in medical grade networks","year":2006,"lang":"en","type":"article","venue":"International Conference on Parallel and Distributed Computing and Networks","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"McMaster University; Bell (Canada)","funders":"","keywords":"Computer science; Computer network; Embedded system; Computer security","score_opus":0.013737813250296329,"score_gpt":0.2472415284676109,"score_spread":0.23350371521731458,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W30294657","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34042716,0.00016661825,0.65730655,0.0011981088,0.00023365262,0.00014673328,0.0000053708372,0.00012023142,0.00039555668],"genre_scores_gemma":[0.9979923,0.000045320423,0.00027746276,0.00036353213,0.00093526783,0.000014907287,0.00033201912,0.000012784403,0.000026400592],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99887735,0.000011633125,0.00032561683,0.0003242752,0.00018102885,0.00028008642],"domain_scores_gemma":[0.9994695,0.00021667904,0.00012845868,0.000081913524,0.000081495666,0.000021948006],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003559336,0.00018393064,0.00022177673,0.00012898332,0.00011436613,0.00021190263,0.00017809983,0.00012227238,0.000024713567],"category_scores_gemma":[0.00010497891,0.00017717652,0.000054113752,0.00018902599,0.00005084513,0.00016885331,0.000095073665,0.00024802506,0.0000015008728],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008803523,0.000046087516,0.0018189033,0.000012193233,0.000021933518,0.000012723821,0.0000041359895,0.84098756,0.0000015994983,0.14909047,0.0003453664,0.007571015],"study_design_scores_gemma":[0.001025329,0.000012826893,0.0036115223,0.00017103662,0.000017021115,0.0000058198834,0.000019789542,0.98866135,2.6388855e-7,0.005187024,0.001080974,0.0002070487],"about_ca_topic_score_codex":0.000049744198,"about_ca_topic_score_gemma":0.000038064783,"teacher_disagreement_score":0.6575651,"about_ca_system_score_codex":0.000023222075,"about_ca_system_score_gemma":0.000008944252,"threshold_uncertainty_score":0.72250485},"labels":[],"label_agreement":null},{"id":"W3034227841","doi":"10.1002/nav.21908","title":"Multiclass state‐dependent service systems with returns","year":2020,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Workload; Computer science; Service system; Service (business); Rework; Queueing theory; Markov chain; Markov process; Stability (learning theory); Operations research; System dynamics; Mathematical optimization; Computer network; Mathematics; Economics; Statistics","score_opus":0.14137741078807226,"score_gpt":0.3397664212838575,"score_spread":0.19838901049578522,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034227841","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.54319376,0.0013452184,0.26495916,0.040001795,0.0015702294,0.005896993,0.0002383721,0.0029497645,0.1398447],"genre_scores_gemma":[0.99605703,0.000019896575,0.00044660168,0.0012447537,0.0010458556,0.000042124087,0.000048451322,0.00006984967,0.0010254078],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9963467,0.00014878345,0.00038758735,0.0006458578,0.0016216694,0.0008493775],"domain_scores_gemma":[0.9968702,0.00055717543,0.00019553192,0.0005368669,0.0017340704,0.00010614433],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001981106,0.00026385958,0.00037424473,0.00027385398,0.00040428637,0.00067986967,0.0008153425,0.00010166297,0.00010865156],"category_scores_gemma":[0.0033417451,0.00021348492,0.000059657505,0.0018605868,0.00024056008,0.0005943396,0.0006020686,0.000892423,0.0013492918],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0049495664,0.0007601433,0.01240911,0.0057997876,0.0009924339,0.0032544467,0.0016818632,0.68005747,0.0146623235,0.25782943,0.012798132,0.0048053027],"study_design_scores_gemma":[0.0021781533,0.00021971026,0.0004705736,0.00026566058,0.00021185355,0.000009267303,0.004239869,0.89819527,0.0006696093,0.018072268,0.074494176,0.0009735947],"about_ca_topic_score_codex":0.0012996745,"about_ca_topic_score_gemma":0.00058896554,"teacher_disagreement_score":0.45286328,"about_ca_system_score_codex":0.00015374192,"about_ca_system_score_gemma":0.00009766562,"threshold_uncertainty_score":0.9994283},"labels":[],"label_agreement":null},{"id":"W3034347614","doi":"10.71781/10847","title":"Stochastic optimization of staffing for multiskill call centers","year":2019,"lang":"en","type":"dissertation","venue":"Papyrus : Institutional Repository (Université de Montréal)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Centre interuniversitaire de recherche sur les reseaux d'entreprise, la logistique et le transport; Université de Montréal; Hydro-Québec","keywords":"Staffing; Stochastic optimization; Computer science; Operations research; Mathematical optimization; Mathematics; Economics; Management","score_opus":0.004865129990927832,"score_gpt":0.17803261873587176,"score_spread":0.17316748874494392,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034347614","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.63670725,0.005600766,0.3037542,0.00021163576,0.0054759397,0.003236206,0.0002330469,0.0005611719,0.04421974],"genre_scores_gemma":[0.9696994,0.0000339595,0.0026221534,0.00009598668,0.00031224836,0.000033268403,0.002256162,0.000070749185,0.024876092],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99850315,0.000016890914,0.00038661103,0.00045034164,0.00036569734,0.00027733602],"domain_scores_gemma":[0.99811035,0.00011068986,0.0008893688,0.00029449887,0.0005668429,0.00002827232],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.00016539513,0.00031183125,0.00042944137,0.00053678727,0.0017265265,0.000055462544,0.0003261242,0.00023385038,0.00003087267],"category_scores_gemma":[0.00018992684,0.0003657889,0.00032682033,0.00031588518,0.000068611276,0.00078121637,0.00009095777,0.00016911604,0.000019196515],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011268018,0.00010368019,0.0004248939,0.0005762021,0.00029643354,0.000034683562,0.0013794479,0.97643733,0.0020816484,0.016276734,0.00017139409,0.0010907783],"study_design_scores_gemma":[0.0040685064,0.00007527175,0.0016495576,0.0014177776,0.0027643384,0.000028144024,0.02529936,0.949155,0.0016398967,0.0014023321,0.010896027,0.0016038179],"about_ca_topic_score_codex":0.005419491,"about_ca_topic_score_gemma":0.001443831,"teacher_disagreement_score":0.3329921,"about_ca_system_score_codex":0.0012677852,"about_ca_system_score_gemma":0.00024837232,"threshold_uncertainty_score":0.9998794},"labels":[],"label_agreement":null},{"id":"W3034534017","doi":"10.1007/s10107-020-01518-w","title":"On a multistage discrete stochastic optimization problem with stochastic constraints and nested sampling","year":2020,"lang":"en","type":"article","venue":"Mathematical Programming","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Mathematical optimization; Convergence (economics); Stochastic programming; Consistency (knowledge bases); Infinity; Optimization problem; Applied mathematics; Discrete mathematics","score_opus":0.022984888365795837,"score_gpt":0.24943939202105908,"score_spread":0.22645450365526323,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3034534017","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.009963091,0.0000086916125,0.9879543,0.00060273986,0.000010406294,0.00068371143,0.0000015094862,0.00031442128,0.00046110802],"genre_scores_gemma":[0.879783,8.6094e-8,0.119552754,0.0004055708,0.00010981837,0.000064737214,0.000019118786,0.000048794387,0.000016173562],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986726,0.000014558163,0.00031319668,0.0004076913,0.000263245,0.0003286808],"domain_scores_gemma":[0.99922585,0.00028025385,0.00020670406,0.00015491532,0.00007869759,0.00005358735],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023039372,0.00025254773,0.00032901356,0.00010126867,0.00021857428,0.00035685993,0.00012744401,0.000051613795,0.00011879585],"category_scores_gemma":[0.00080440636,0.00019839752,0.00004800581,0.00044180395,0.0002398592,0.0004368945,0.000102777674,0.0001899472,0.000055005617],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016616493,0.00009429542,0.000013140313,0.0006764838,0.00007171495,0.000017931647,0.0003477167,0.82899654,0.000045014298,0.15384725,0.000003560588,0.015720189],"study_design_scores_gemma":[0.00066443597,0.00006104464,0.0000031196973,0.00039332669,0.00019949248,0.0000068107674,0.0005434265,0.9753451,0.000002032418,0.02243739,0.000031076986,0.00031274208],"about_ca_topic_score_codex":0.0000030717188,"about_ca_topic_score_gemma":0.0000017191031,"teacher_disagreement_score":0.8698199,"about_ca_system_score_codex":0.000019146952,"about_ca_system_score_gemma":0.000008327446,"threshold_uncertainty_score":0.8090416},"labels":[],"label_agreement":null},{"id":"W3042292135","doi":"10.1080/03610926.2020.1790602","title":"The queue GeoX/G/1/N+1 revisited","year":2020,"lang":"en","type":"article","venue":"Communication in Statistics- Theory and Methods","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Markov chain; Queue; Queueing theory; Applied mathematics; Mathematics; State (computer science); Markov process; Epoch (astronomy); Steady state (chemistry); Computer science; Mathematical optimization; Algorithm; Statistics","score_opus":0.037860732906486616,"score_gpt":0.3720161716893687,"score_spread":0.33415543878288206,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3042292135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001214499,0.0029767614,0.9855778,0.0025306903,0.000051372812,0.00019697471,0.000007906115,0.0000902647,0.0073537305],"genre_scores_gemma":[0.5854788,0.0021445123,0.39944798,0.011748203,0.0003442084,0.00009618861,0.00011776999,0.00006566573,0.0005566755],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9980801,0.0011373976,0.0003438047,0.00019230097,0.00008298023,0.00016343681],"domain_scores_gemma":[0.9953688,0.0036847459,0.0002354736,0.0005781991,0.0001148878,0.000017927603],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0055231242,0.00012534656,0.00020050743,0.00006900439,0.00047474355,0.00018202294,0.0005009411,0.0000420417,0.000090689304],"category_scores_gemma":[0.0060866894,0.000099197976,0.000030531213,0.00048130564,0.0002777473,0.00032053358,0.00036743176,0.00026529847,0.0000355283],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001056044,0.00000875823,0.0002098272,0.000040000574,0.000016334701,9.2306385e-7,0.00020280236,0.000099519624,0.00012928937,0.8903157,0.00035236735,0.10851884],"study_design_scores_gemma":[0.00021063749,0.0000044876356,0.000621404,0.000035672863,0.000057817088,5.411573e-7,0.0006759269,0.017253412,0.00003568904,0.8609657,0.12000035,0.00013834448],"about_ca_topic_score_codex":0.0000211229,"about_ca_topic_score_gemma":0.000017262197,"teacher_disagreement_score":0.58612984,"about_ca_system_score_codex":0.000014081428,"about_ca_system_score_gemma":0.000008928607,"threshold_uncertainty_score":0.7286775},"labels":[],"label_agreement":null},{"id":"W3043896928","doi":"10.1002/nav.21931","title":"Optimal policies for stochastic clearing systems with time‐dependent delay penalties","year":2020,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Clearing; Markov decision process; Mathematical optimization; Markov process; Computer science; Function (biology); Nonlinear system; Sequence (biology); Time horizon; Process (computing); State (computer science); Control theory (sociology); Mathematics; Algorithm; Economics; Finance","score_opus":0.10854618172520832,"score_gpt":0.3431260228406786,"score_spread":0.2345798411154703,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3043896928","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.054544937,0.00038237733,0.92843384,0.002862631,0.00021458253,0.0017921801,0.00006529383,0.0005113641,0.011192823],"genre_scores_gemma":[0.99493074,0.000005633478,0.0012885759,0.0003537909,0.0016625536,0.00010473306,0.000045100325,0.00007898858,0.001529892],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970435,0.000072856856,0.00036162784,0.00053488766,0.0011045785,0.00088252965],"domain_scores_gemma":[0.9970687,0.0009588035,0.00018245832,0.0003531884,0.0013556527,0.00008121708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0018424497,0.00025952575,0.0004121981,0.00037163202,0.00065052573,0.0007556733,0.0006644883,0.0000979676,0.00009541302],"category_scores_gemma":[0.006037396,0.0002166862,0.00009666663,0.00080149644,0.00040349524,0.00050168537,0.00052100484,0.0005431499,0.00065038446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011169456,0.000063917774,0.00010013316,0.0005217793,0.00016432257,0.00006377732,0.00018631294,0.90077066,0.0007912683,0.0930835,0.002723129,0.0004142618],"study_design_scores_gemma":[0.00095608085,0.00028305757,0.000036603407,0.00014894658,0.00018562903,0.0000072540806,0.0023426304,0.983479,0.000080639904,0.005154598,0.006842169,0.00048338357],"about_ca_topic_score_codex":0.0004904821,"about_ca_topic_score_gemma":0.000038265593,"teacher_disagreement_score":0.9403858,"about_ca_system_score_codex":0.00013146507,"about_ca_system_score_gemma":0.00009121774,"threshold_uncertainty_score":0.8836207},"labels":[],"label_agreement":null},{"id":"W3082802461","doi":"10.2139/ssrn.3628751","title":"Privacy Management in Service Systems","year":2020,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer security; Internet privacy; Business; Computer science","score_opus":0.012046787141420278,"score_gpt":0.22350014406588978,"score_spread":0.2114533569244695,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3082802461","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8475423,0.00458442,0.07013971,0.035621878,0.00080026384,0.001001218,0.0000011612241,0.0005278623,0.039781194],"genre_scores_gemma":[0.9950502,0.00030075593,0.00006169693,0.0031299714,0.0010525871,0.000008626513,0.000004108465,0.00003287222,0.0003592059],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977099,0.000027347704,0.00034586378,0.00024680202,0.00026028045,0.0014098503],"domain_scores_gemma":[0.9994763,0.000016289488,0.00024252346,0.0001649481,0.00008006812,0.000019882207],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010975887,0.00016887394,0.00022219088,0.0002397012,0.00013635059,0.00020248239,0.000511022,0.000039354967,0.000043552547],"category_scores_gemma":[0.000054792235,0.00015950525,0.0000798702,0.0011249925,0.000011906124,0.0009281555,0.00016982353,0.0009592521,0.00042668372],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012966689,0.000056580993,0.0018505674,0.0001562293,0.0002698319,0.00005804971,0.00010492804,0.021669962,0.0001088277,0.9668409,0.00017647001,0.0085779615],"study_design_scores_gemma":[0.0030680543,0.000054444547,0.0006504706,0.00016705618,0.00041579938,0.00008519875,0.011803802,0.089408785,0.000012579849,0.7642239,0.12919727,0.00091268314],"about_ca_topic_score_codex":0.00011037515,"about_ca_topic_score_gemma":0.00022003756,"teacher_disagreement_score":0.20261708,"about_ca_system_score_codex":0.00034484503,"about_ca_system_score_gemma":0.00008531232,"threshold_uncertainty_score":0.6504435},"labels":[],"label_agreement":null},{"id":"W3089121886","doi":"10.1016/j.jfranklin.2020.09.018","title":"Stabilization of supply networks with a varying manager-reaction time delay","year":2020,"lang":"en","type":"article","venue":"Journal of the Franklin Institute","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"National Natural Science Foundation of China","keywords":"Business; Computer science; Control theory (sociology); Control (management); Artificial intelligence","score_opus":0.010766635972598693,"score_gpt":0.20205565241311654,"score_spread":0.19128901644051785,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3089121886","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.71165144,0.00023530415,0.27786416,0.0049516573,0.000993583,0.00039584778,0.0000019568895,0.00006623829,0.0038397824],"genre_scores_gemma":[0.9969122,0.00001419876,0.0010579757,0.00095516647,0.0009811796,0.0000015795035,0.0000035138423,0.000018076924,0.000056098135],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990249,0.000024014642,0.00042586168,0.00010894988,0.00029492663,0.00012130633],"domain_scores_gemma":[0.9984942,0.000038048835,0.0010142232,0.00016542141,0.0002724852,0.000015611071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003901427,0.00012011431,0.0002592732,0.00012361119,0.00013507616,0.000056583245,0.00033773354,0.00004427908,0.00004511739],"category_scores_gemma":[0.00020073919,0.00007754144,0.00015238117,0.0007944981,0.00008449121,0.0015966967,0.00008540307,0.00023830059,0.000014643615],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005539431,0.00005778463,0.0034670453,0.000096761185,0.00023533395,0.000026897305,0.00009509501,0.98355716,0.0053768884,0.0026862144,0.00056123396,0.0032856287],"study_design_scores_gemma":[0.0034247786,0.00014687054,0.004872121,0.0010199827,0.002440843,0.00008184078,0.00021827,0.900777,0.0011874213,0.0074628964,0.07772942,0.00063860376],"about_ca_topic_score_codex":0.000019829167,"about_ca_topic_score_gemma":0.000009544789,"teacher_disagreement_score":0.28526074,"about_ca_system_score_codex":0.000029201703,"about_ca_system_score_gemma":0.000024351008,"threshold_uncertainty_score":0.31620482},"labels":[],"label_agreement":null},{"id":"W3100800830","doi":"10.1145/3422711","title":"Analysis of a Queueing Model for Energy Storage Systems with Self-discharge","year":2020,"lang":"en","type":"article","venue":"ACM Transactions on Modeling and Performance Evaluation of Computing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Arithmetic underflow; Queueing theory; Energy storage; Queue; Computer science; Layered queueing network; Weighted fair queueing; Physics; Computer network; Thermodynamics; Operating system","score_opus":0.04949444567444626,"score_gpt":0.2714553059755667,"score_spread":0.22196086030112044,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3100800830","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4095128,0.00009896674,0.58996713,0.000042752323,0.000054493477,0.00020393131,0.000006578699,0.000065927,0.00004743255],"genre_scores_gemma":[0.99772847,0.000015349517,0.001960868,0.000061580344,0.00012323362,0.00004308779,0.000027410622,0.000027040898,0.000012965318],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99821305,0.00005698819,0.00063001795,0.0003404315,0.0005788605,0.00018066562],"domain_scores_gemma":[0.9980605,0.00012459872,0.00055406336,0.0003156665,0.0009223514,0.000022767663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016503372,0.000195468,0.0005463143,0.00055865705,0.00028235215,0.000073971714,0.00019940856,0.00006448074,0.000003241729],"category_scores_gemma":[0.000049810107,0.00017595265,0.00013612892,0.0010189393,0.000025168332,0.00050202705,0.000010354012,0.000095445335,6.7882166e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00012670142,0.000041149182,0.00020938674,0.0005251232,0.00069931144,4.3300403e-8,0.00068420643,0.9948947,0.00005195349,0.00084371073,0.0000015358465,0.0019222121],"study_design_scores_gemma":[0.0006622357,0.00005491995,0.000014179793,0.00023868642,0.0031860035,4.2573947e-7,0.0005579007,0.995006,0.00001562939,0.00006700864,0.000009483233,0.00018752554],"about_ca_topic_score_codex":0.00018770935,"about_ca_topic_score_gemma":0.000012557567,"teacher_disagreement_score":0.58821565,"about_ca_system_score_codex":0.000043156422,"about_ca_system_score_gemma":0.000051575393,"threshold_uncertainty_score":0.7175141},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.006424677251106922,"score_gpt":0.21447856431025616,"score_spread":0.20805388705914923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101156441","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.90711033,0.000008776808,0.055066455,0.0002692739,0.000060050028,0.0002123614,5.099438e-7,0.0001638997,0.03710833],"genre_scores_gemma":[0.9976028,5.392606e-7,0.001092475,0.0010729099,0.00011327765,0.000022532298,0.000017698012,0.0000065140966,0.0000712297],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.999368,0.0000037443094,0.00023963433,0.000103712424,0.000103911494,0.00018098124],"domain_scores_gemma":[0.9996319,0.000021808873,0.000113700335,0.0001369576,0.000090028065,0.0000056008007],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013822454,0.000103918435,0.00012485954,0.00026045338,0.00006374265,0.0006013606,0.00017094293,0.000037889262,0.0014693873],"category_scores_gemma":[0.00005580622,0.00008684529,0.00003609188,0.00026904355,0.000021290118,0.008900823,0.00006367038,0.0000847589,0.00046717082],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000040898103,0.000010251337,0.0043490482,0.000034787667,0.000035569916,0.0000013259272,0.00007467636,0.4150433,0.000312239,0.5758422,0.00035992582,0.003895782],"study_design_scores_gemma":[0.0010347565,0.0000059475633,0.016917663,0.000013062792,0.000039479102,7.5003845e-7,0.0033764814,0.72961265,0.000043351203,0.24664669,0.0019949544,0.0003142155],"about_ca_topic_score_codex":0.0013712998,"about_ca_topic_score_gemma":0.00014175235,"teacher_disagreement_score":0.3291955,"about_ca_system_score_codex":0.00001820795,"about_ca_system_score_gemma":0.000005539921,"threshold_uncertainty_score":0.9994434},"labels":[],"label_agreement":null},{"id":"W3101805011","doi":"10.22215/etd/2020-14163","title":"Equilibrium Behaviour of Double-Sided Queueing System with Dependent Matching Time","year":2020,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Taxis; Queueing theory; Matching (statistics); Context (archaeology); Observable; Terminal (telecommunication); Pickup; Computer science; Mathematical optimization; Queue; Operations research; Mathematics; Engineering; Statistics; Transport engineering; Computer network; Physics; Artificial intelligence; Geography","score_opus":0.010139363657327947,"score_gpt":0.2285121440271976,"score_spread":0.21837278036986965,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3101805011","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80272204,0.00008631528,0.0037029511,0.00010247592,0.00040453754,0.00073687104,0.000005785077,0.0008923214,0.19134669],"genre_scores_gemma":[0.9878629,8.0412764e-7,0.00056466385,0.00009045149,0.0004488743,0.000033406835,0.000978734,0.00014193535,0.00987826],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99784917,0.000018169805,0.0006624866,0.0005827866,0.0005769128,0.00031048027],"domain_scores_gemma":[0.9980671,0.000055410306,0.0011414888,0.00041073927,0.0003030306,0.000022257158],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00030742845,0.0004559816,0.00080297963,0.0004140038,0.0000984408,0.00023548736,0.00046236734,0.00018689687,0.00038191004],"category_scores_gemma":[0.00002936611,0.00039297715,0.00021006096,0.00058585044,0.000021012378,0.0009995926,0.00011956712,0.0003145795,0.0003632619],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012553748,0.0005735676,0.005251701,0.03327171,0.004115285,0.0011703075,0.0025321057,0.070108876,0.10064423,0.76605606,0.0011153813,0.0026070466],"study_design_scores_gemma":[0.038951702,0.0006730289,0.006381626,0.067935,0.057620026,0.00016765937,0.23455998,0.33615664,0.19239575,0.03224051,0.004100132,0.028817946],"about_ca_topic_score_codex":0.001462164,"about_ca_topic_score_gemma":0.00057175,"teacher_disagreement_score":0.73381555,"about_ca_system_score_codex":0.00007954351,"about_ca_system_score_gemma":0.000048915063,"threshold_uncertainty_score":0.99985224},"labels":[],"label_agreement":null},{"id":"W3104505899","doi":"10.1007/s11009-020-09836-4","title":"A New and Pragmatic Approach to the GIX/Geo/c/N Queues Using Roots","year":2020,"lang":"en","type":"article","venue":"Methodology And Computing In Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Mathematics; Queue; Pure mathematics; Computer science","score_opus":0.1040470936623194,"score_gpt":0.30250523470890217,"score_spread":0.19845814104658277,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3104505899","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3913666,0.00008235569,0.60410637,0.0017805418,0.000041370713,0.0005238661,2.658155e-7,0.00008963203,0.0020090085],"genre_scores_gemma":[0.6649404,6.1471843e-7,0.33224636,0.002520805,0.00026394345,0.000010019634,0.0000019102054,0.000011823131,0.0000041179833],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998339,0.00032489217,0.00035877497,0.0005906728,0.00010080714,0.0002858438],"domain_scores_gemma":[0.9986879,0.0008269078,0.00017310213,0.0002475409,0.000030178138,0.000034343266],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0040010046,0.00019790638,0.00042980874,0.00008433789,0.00025150986,0.00009672031,0.00023908238,0.00008918837,0.000009397068],"category_scores_gemma":[0.0011834587,0.00015352151,0.00003651121,0.00069098664,0.00012813671,0.00010695519,0.00054809346,0.00029465606,0.000006592463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000604936,0.00013292325,0.022643153,0.0012537469,0.00012207583,0.0000035729558,0.0051201344,0.2795589,0.0021507835,0.52641803,0.00015578953,0.16183597],"study_design_scores_gemma":[0.0006452714,0.0000167571,0.01193636,0.00003803484,0.0001469311,0.000006902656,0.000978442,0.53251183,0.000054564887,0.45128506,0.0019667712,0.00041308012],"about_ca_topic_score_codex":0.00021463141,"about_ca_topic_score_gemma":0.000040629442,"teacher_disagreement_score":0.27357382,"about_ca_system_score_codex":0.000019745816,"about_ca_system_score_gemma":0.000018453975,"threshold_uncertainty_score":0.62604254},"labels":[],"label_agreement":null},{"id":"W3114113748","doi":"10.1007/s40305-021-00382-5","title":"Approximations for a Queueing Game Model with Join-the-Shortest-Queue Strategy","year":2022,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Join (topology); Queue; Computer science; Queueing theory; Bulk queue; Mathematical optimization; Mathematical economics; Mathematics; Computer network; Combinatorics","score_opus":0.05689808837259584,"score_gpt":0.33087566564746945,"score_spread":0.2739775772748736,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3114113748","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6580198,0.00029098138,0.28725517,0.05020531,0.00012619824,0.0015628069,0.000039014634,0.00003143648,0.002469301],"genre_scores_gemma":[0.99045795,0.000016350796,0.006845392,0.0003355125,0.0002765736,0.000074093754,0.0000051669044,0.00002275019,0.0019661963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982588,0.00012019611,0.00040231168,0.00012645248,0.0008534862,0.00023874188],"domain_scores_gemma":[0.998295,0.00017319371,0.00026397986,0.0003335986,0.00091918657,0.000015018837],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.003748188,0.000101338934,0.00020201576,0.00014307188,0.002131279,0.00024390944,0.0007859145,0.000024684206,0.00007384359],"category_scores_gemma":[0.00032272754,0.00005897896,0.00034832564,0.0011305709,0.0002384151,0.00095495133,0.00028442728,0.00070946396,8.945373e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00005072606,0.00010832791,0.00004768768,0.000041964988,0.00012290984,3.6804576e-7,0.00069259986,0.9587192,0.0016391377,0.03423122,0.0040013776,0.00034450105],"study_design_scores_gemma":[0.00039069977,0.000056583736,0.00010807027,0.000034979472,0.000077859084,0.000008594776,0.0035418149,0.95781344,0.000107315165,0.034770396,0.0030115987,0.00007862483],"about_ca_topic_score_codex":0.00008649686,"about_ca_topic_score_gemma":0.00007172715,"teacher_disagreement_score":0.3324382,"about_ca_system_score_codex":0.00012139071,"about_ca_system_score_gemma":0.00029366632,"threshold_uncertainty_score":0.9991678},"labels":[],"label_agreement":null},{"id":"W3116690882","doi":"10.2139/ssrn.3422404","title":"Customer Acquisition and Retention: A Fluid Approach for Staffing","year":2019,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Staffing; Customer retention; Business; Employee retention; Operations management; Marketing; Engineering; Management; Economics; Service (business); Service quality","score_opus":0.007889318927239009,"score_gpt":0.21607958666850094,"score_spread":0.20819026774126193,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3116690882","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69720805,0.0013435254,0.29228675,0.0005334913,0.00023692906,0.0004582825,0.0000011802478,0.00011202895,0.007819792],"genre_scores_gemma":[0.99627835,0.00013739691,0.0006950573,0.00028294258,0.00087165105,0.000010423532,0.000020656094,0.000028412229,0.0016750854],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984398,0.000014185497,0.00020083322,0.00022215828,0.0001549567,0.00096806535],"domain_scores_gemma":[0.9994997,0.000025458832,0.00021143841,0.00012732345,0.00012576794,0.000010347858],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015921487,0.00012871939,0.0001719733,0.00021964495,0.0002582069,0.00017882207,0.00013671878,0.00005032082,0.00006333031],"category_scores_gemma":[0.000039179322,0.00011688828,0.00011583499,0.00025068794,0.000022474449,0.0011241151,0.000047993297,0.00042210068,0.000060501912],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025923178,0.00005581127,0.0016557026,0.00010506426,0.000225819,7.8496237e-7,0.000028012686,0.0025183312,0.0037149617,0.97743714,0.00014829432,0.013850875],"study_design_scores_gemma":[0.002640653,0.00010788849,0.0002857053,0.00006183141,0.00045768204,0.00013461367,0.0032989269,0.068121195,0.00007681796,0.9086326,0.015577613,0.0006044951],"about_ca_topic_score_codex":0.000008395627,"about_ca_topic_score_gemma":0.00001012886,"teacher_disagreement_score":0.29907036,"about_ca_system_score_codex":0.00018292856,"about_ca_system_score_gemma":0.00007285096,"threshold_uncertainty_score":0.4766566},"labels":[],"label_agreement":null},{"id":"W3117153971","doi":"10.2139/ssrn.3464899","title":"Pricing in Service Systems with Rational Balking and Abandonment of Time-Sensitive Customers","year":2019,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Abandonment (legal); Service (business); Business; Marketing; Political science","score_opus":0.00285034346484051,"score_gpt":0.18239167337616416,"score_spread":0.17954132991132365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3117153971","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99513465,0.00021787018,0.002429822,0.0001356898,0.000040119063,0.00014180892,2.453529e-7,0.000011720445,0.00188805],"genre_scores_gemma":[0.9993802,0.00008202655,0.000032187334,0.00012056872,0.00013330374,0.0000018506727,0.0000031385464,0.000015397347,0.00023136409],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987902,0.000024435221,0.00022336235,0.00014986325,0.0002225745,0.0005895755],"domain_scores_gemma":[0.99944085,0.00006466589,0.00031363007,0.000078876554,0.00009459544,0.000007412479],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012127574,0.000110849185,0.00021210367,0.00025594744,0.00006929157,0.000055391214,0.000082181614,0.000027641972,0.00001570343],"category_scores_gemma":[0.000022049653,0.00009114457,0.000027919614,0.00039779118,0.000018954051,0.00063211855,0.00003543708,0.0004165888,0.000029554081],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0014134425,0.0001884642,0.11311258,0.00045938685,0.0010940174,0.000030611023,0.0009885421,0.436901,0.01677535,0.42120698,0.000009694845,0.007819926],"study_design_scores_gemma":[0.017398167,0.0005466231,0.023546066,0.003124196,0.0013295591,0.0011482616,0.047114357,0.7747557,0.0011484409,0.123260155,0.003844514,0.0027839355],"about_ca_topic_score_codex":0.00023982264,"about_ca_topic_score_gemma":0.00037237426,"teacher_disagreement_score":0.33785474,"about_ca_system_score_codex":0.00024584762,"about_ca_system_score_gemma":0.00012710485,"threshold_uncertainty_score":0.37167677},"labels":[],"label_agreement":null},{"id":"W3118420773","doi":"10.1017/s0269964820000704","title":"ON MARKOVIAN QUEUES WITH SINGLE WORKING VACATION AND BERNOULLI INTERRUPTIONS","year":2021,"lang":"en","type":"article","venue":"Probability in the Engineering and Informational Sciences","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":8,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Unobservable; Computer science; Bernoulli's principle; Queue; Service (business); Mathematical optimization; Markov process; Operations research; Bulk queue; Server; Queueing theory; Real-time computing; Computer network; Mathematics; Business; Econometrics; Statistics; Marketing; Engineering","score_opus":0.019922464682221423,"score_gpt":0.21347119982650578,"score_spread":0.19354873514428436,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118420773","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939147,0.000040676783,0.00069874956,0.0013463617,0.000029341563,0.00007177289,4.3921412e-7,0.00003005162,0.003867893],"genre_scores_gemma":[0.9991078,0.0000038127544,0.0005128459,0.0003074559,0.000041365358,0.000012011707,0.000005902701,0.0000016468924,0.000007200862],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9995323,0.000008128665,0.00012207568,0.000099672805,0.00014660807,0.00009121647],"domain_scores_gemma":[0.9996913,0.00015434648,0.000046908288,0.000066226436,0.00003633139,0.000004871843],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065091153,0.00006091158,0.000056651275,0.00009384508,0.00016951177,0.00024414023,0.00008296437,0.000014147843,0.000009885798],"category_scores_gemma":[0.0002756566,0.00004037477,0.000010513086,0.0004441009,0.000088615794,0.000866188,0.00003800419,0.00006911628,0.0000023637933],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000073415063,0.000033769742,0.0029219098,0.0000694635,0.0000056166696,4.8579795e-7,0.0005875456,0.63498336,0.000034914585,0.35621873,0.0000072009652,0.0051296754],"study_design_scores_gemma":[0.00016883806,0.000025298876,0.008386853,0.00019023863,0.000015654226,0.000013794718,0.0011660121,0.8892272,0.00003908251,0.09830213,0.002271657,0.0001932052],"about_ca_topic_score_codex":0.000013405104,"about_ca_topic_score_gemma":0.000035573757,"teacher_disagreement_score":0.2579166,"about_ca_system_score_codex":0.00001733159,"about_ca_system_score_gemma":0.0000081841545,"threshold_uncertainty_score":0.235425},"labels":[],"label_agreement":null},{"id":"W3118816434","doi":"10.2139/ssrn.3536517","title":"Synchronizing Travelling and Waiting Processes: Customer Strategy with an Online Reservation System","year":2020,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Synchronizing; Reservation; Business; Reservation system; Operations research; Computer science; Marketing; Process management; Operations management; Telecommunications; Engineering; Computer network","score_opus":0.027423682182678447,"score_gpt":0.23227892676864914,"score_spread":0.2048552445859707,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3118816434","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94561857,0.0007637964,0.05197958,0.00080256123,0.00002147558,0.00012681694,9.044709e-7,0.00016324018,0.0005230429],"genre_scores_gemma":[0.99758106,0.00015569758,0.00032895795,0.00030483815,0.0015174821,0.0000030292629,0.000020215577,0.000048426267,0.00004031738],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9980527,0.000030249907,0.0002884929,0.00030525244,0.00026444462,0.001058841],"domain_scores_gemma":[0.99917126,0.00003404397,0.0004027258,0.00010169012,0.0002556706,0.000034601337],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00096589775,0.00019846523,0.00023736553,0.00015354966,0.00045079848,0.0003520778,0.00021886325,0.00004974007,0.00000927484],"category_scores_gemma":[0.000110714085,0.00016464153,0.000034198005,0.00075514475,0.000037930775,0.0023087629,0.000037154423,0.0009646766,0.00001008274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010303109,0.00016490066,0.005924349,0.0022968715,0.00073278346,0.000096872,0.000757284,0.111133635,0.0025504068,0.8171564,0.000015317208,0.05814088],"study_design_scores_gemma":[0.0022720036,0.00047660916,0.00018110638,0.0007985873,0.0007866966,0.00037932902,0.09124518,0.8566767,0.00012674942,0.04473113,0.0012484975,0.0010774031],"about_ca_topic_score_codex":0.00005956305,"about_ca_topic_score_gemma":0.00066671136,"teacher_disagreement_score":0.77242523,"about_ca_system_score_codex":0.00023101247,"about_ca_system_score_gemma":0.0003932101,"threshold_uncertainty_score":0.6713887},"labels":[],"label_agreement":null},{"id":"W3120266904","doi":"10.1609/aaai.v35i1.16123","title":"Queue-Learning: A Reinforcement Learning Approach for Providing Quality of Service","year":2021,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":24,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Queueing theory; Reinforcement learning; Quality of service; Probabilistic logic; Queue; Service (business); Distributed computing; Controller (irrigation); Computer network; Artificial intelligence","score_opus":0.10823393950558702,"score_gpt":0.31468509961001045,"score_spread":0.20645116010442344,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3120266904","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7249392,0.000065236454,0.1720841,0.0051154187,0.00040245146,0.0018597445,0.000004251178,0.00033947767,0.09519008],"genre_scores_gemma":[0.9967409,0.000008033162,0.0018120251,0.00038639276,0.00017451256,0.000059451762,0.000009413223,0.000026649694,0.00078266993],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978699,0.000021844036,0.00084359426,0.00047302363,0.00046253862,0.00032906453],"domain_scores_gemma":[0.99592096,0.00016149698,0.0012918807,0.00020585569,0.0024006031,0.00001919162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014570553,0.0002375965,0.00045095212,0.0001565095,0.00033752384,0.00018496298,0.00068694074,0.00008857107,0.00011506005],"category_scores_gemma":[0.0034794847,0.00020038328,0.00023218186,0.0011506918,0.0001413839,0.0005941422,0.00038564825,0.00035211703,0.0000183989],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0003059784,0.00013681587,0.0006823018,0.00096621213,0.00005862582,1.1764519e-7,0.00046590093,0.048939437,0.09831902,0.8444606,0.000016958053,0.005648042],"study_design_scores_gemma":[0.00009912363,0.000058759462,0.000051686184,0.00037790654,0.00014109712,7.7546423e-7,0.008907069,0.48850223,0.37618834,0.12457386,0.0007098441,0.00038931586],"about_ca_topic_score_codex":0.00013916883,"about_ca_topic_score_gemma":0.000019606785,"teacher_disagreement_score":0.7198867,"about_ca_system_score_codex":0.000042084823,"about_ca_system_score_gemma":0.000066024615,"threshold_uncertainty_score":0.81713927},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.010659359734794344,"score_gpt":0.21856629903478442,"score_spread":0.20790693929999007,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121407226","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1721087,0.000021063825,0.8165793,0.00058484194,0.000081270926,0.000120914796,0.0000015484464,0.0002801951,0.010222166],"genre_scores_gemma":[0.9960348,0.00001401264,0.0006179348,0.0004835711,0.00012930948,0.000023697508,0.0000042468128,0.000027506454,0.0026649223],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992487,0.0000074833865,0.00014821421,0.0002126132,0.00015329178,0.00022973468],"domain_scores_gemma":[0.99959475,0.000029908391,0.0000798041,0.00020462718,0.0000780104,0.000012911454],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00012855891,0.00012870268,0.00013060033,0.00020905236,0.0002892531,0.000105464875,0.00011363251,0.000023625385,0.000679351],"category_scores_gemma":[0.000007781131,0.00011059792,0.00006095237,0.0006392553,0.000038503727,0.00097286934,0.000005064674,0.00013759705,0.00023716377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000831183,0.0005438582,0.004486883,0.0001381954,0.00056092016,0.00033153096,0.0005110439,0.88965917,0.0032406372,0.009367854,0.00012865514,0.09020007],"study_design_scores_gemma":[0.013013066,0.00025429888,0.017959021,0.00089134474,0.0057544596,0.0005148809,0.008083084,0.29166108,0.0072736396,0.16112979,0.48687124,0.006594081],"about_ca_topic_score_codex":0.0004618077,"about_ca_topic_score_gemma":0.0021500785,"teacher_disagreement_score":0.8239261,"about_ca_system_score_codex":0.000036672085,"about_ca_system_score_gemma":0.000011574083,"threshold_uncertainty_score":0.7438417},"labels":[],"label_agreement":null},{"id":"W3121914451","doi":"","title":"Capability Flexibility: A Decision Support Methodology for Parallel Service and Manufacturing Systems with Flexible Servers","year":2010,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Flexibility (engineering); Computer science; Server; Ranking (information retrieval); Queue; Queueing theory; Context (archaeology); Distributed computing; Service (business); Service level; Mathematical optimization; Operations research; Industrial engineering; Engineering; Computer network; Mathematics; Artificial intelligence","score_opus":0.027313798465351216,"score_gpt":0.28266229173986074,"score_spread":0.25534849327450954,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3121914451","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.77368057,0.00011330589,0.2247191,0.000607623,0.00025479405,0.0003379499,0.0000016008062,0.00008785299,0.00019719635],"genre_scores_gemma":[0.9885116,0.000043416363,0.0099522695,0.00043364253,0.0006614144,0.000032638287,0.000011297956,0.0000465825,0.00030713936],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99730617,0.00006124225,0.00041076896,0.0004658115,0.00023873195,0.0015172892],"domain_scores_gemma":[0.998519,0.00039557327,0.00039453295,0.0003836033,0.0002693084,0.000037964357],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0068903645,0.0002587185,0.00042248386,0.00023915354,0.00046211574,0.00023140098,0.00034692834,0.00012801129,0.00004689261],"category_scores_gemma":[0.00030584523,0.00020211586,0.000111441615,0.00024027097,0.00008293758,0.0011040303,0.00010631523,0.0012847091,0.000015837613],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006479762,0.00029908403,0.019580947,0.001006506,0.001369758,0.000020164856,0.00028086954,0.04499323,0.003866085,0.84050065,0.0001112924,0.08149168],"study_design_scores_gemma":[0.0020639198,0.00013704212,0.0009468742,0.00004053016,0.00041702733,0.00039443205,0.002409592,0.009921237,0.0002536478,0.9741473,0.008798176,0.00047018696],"about_ca_topic_score_codex":0.0004701014,"about_ca_topic_score_gemma":0.0070561636,"teacher_disagreement_score":0.21483102,"about_ca_system_score_codex":0.00019994656,"about_ca_system_score_gemma":0.00029604023,"threshold_uncertainty_score":0.82420456},"labels":[],"label_agreement":null},{"id":"W3122006133","doi":"10.1017/jpr.2020.99","title":"Sensitivity of mean-field fluctuations in Erlang loss models with randomized routing","year":2021,"lang":"en","type":"preprint","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Erlang (programming language); Queue; Sensitivity (control systems); Mathematics; Poisson process; Sigma; Lambda; Combinatorics; Queueing theory; Poisson distribution; Discrete mathematics; Physics; Computer science; Statistics; Computer network; Theoretical computer science","score_opus":0.01613481605490883,"score_gpt":0.236950670458274,"score_spread":0.22081585440336518,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122006133","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.814477,0.00004926757,0.18094449,0.00041406477,0.000113752925,0.0006783626,0.000002188229,0.000024217821,0.0032966128],"genre_scores_gemma":[0.983312,0.0000120209625,0.016160207,0.0001563069,0.00029327703,0.000022619583,0.000013314625,0.00002563043,0.0000045898364],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99714303,0.00019880827,0.001459434,0.00040326183,0.0005513746,0.00024408576],"domain_scores_gemma":[0.9945201,0.0011878451,0.0027994702,0.00054256414,0.00092988013,0.00002009287],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.009096319,0.00031832114,0.0017641458,0.00037714845,0.000070919865,0.00013268598,0.00027873833,0.00021086994,0.000037807687],"category_scores_gemma":[0.001296574,0.00025332917,0.0004731924,0.00054792315,0.00017516821,0.00064488495,0.00047521948,0.0010670285,0.0000010379252],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.017955214,0.0002863768,0.0009090203,0.00082974974,0.00041507185,0.000047066726,0.0006573541,0.91479987,0.00045802863,0.062055804,0.000004073259,0.0015823711],"study_design_scores_gemma":[0.01704551,0.000009477626,0.00022129426,0.0008117942,0.00091553497,0.0000090212625,0.00073614606,0.1724926,0.0008632583,0.8064807,0.000005711919,0.000408975],"about_ca_topic_score_codex":0.0003445911,"about_ca_topic_score_gemma":0.00083378784,"teacher_disagreement_score":0.7444249,"about_ca_system_score_codex":0.00014968854,"about_ca_system_score_gemma":0.0001947035,"threshold_uncertainty_score":0.9999919},"labels":[],"label_agreement":null},{"id":"W3122343540","doi":"","title":"A Survey and Experimental Comparison of Service-Level-Approximation Methods for Non-Stationary M(T)/M/S(T) Queueing Systems with Exhaustive Discipline","year":2002,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":14,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computation; Approximation error; Queueing theory; Approximation algorithm; Ordinary differential equation; Applied mathematics; Closure (psychology); Solver; Computer science; Mathematics; Mathematical optimization; Differential equation; Algorithm; Mathematical analysis; Statistics","score_opus":0.04220464371971054,"score_gpt":0.33394942912614317,"score_spread":0.2917447854064326,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3122343540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.35505283,0.0018348331,0.6423602,0.00016163249,0.00007316859,0.0003389553,0.0000045965126,0.000024344517,0.00014944027],"genre_scores_gemma":[0.9933007,0.000025884257,0.006146331,0.00004297174,0.00021896111,0.000029837745,0.000041642026,0.00003132753,0.00016239256],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99847955,0.00006689689,0.00040989253,0.00021295946,0.00017770896,0.000652998],"domain_scores_gemma":[0.998688,0.00018505444,0.00064677687,0.000114449,0.0003505603,0.000015200987],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022531352,0.00017684793,0.00035311925,0.00022874709,0.00029718003,0.000103080194,0.00015273504,0.00004525931,0.000014825663],"category_scores_gemma":[0.00007456147,0.00014591146,0.00005066281,0.00045375555,0.000044208395,0.0009338279,0.000053983356,0.00035221124,0.000002832164],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0056698,0.0026711195,0.120730914,0.002207562,0.004688533,0.0000072322264,0.009230747,0.23100434,0.021400593,0.5113278,0.0003930016,0.09066835],"study_design_scores_gemma":[0.0017325089,0.00017749131,0.0021391131,0.00012629622,0.00019481762,0.000026084404,0.015064359,0.9581396,0.0004528778,0.021528626,0.00008750808,0.00033070153],"about_ca_topic_score_codex":0.00020474455,"about_ca_topic_score_gemma":0.0006972421,"teacher_disagreement_score":0.7271353,"about_ca_system_score_codex":0.00020759899,"about_ca_system_score_gemma":0.00006133317,"threshold_uncertainty_score":0.5950097},"labels":[],"label_agreement":null},{"id":"W3123284425","doi":"10.2139/ssrn.426620","title":"Gradient Estimation for a Class of Systems with Bulk Services: A Problem in Public Transportation","year":2003,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Estimator; Train; Public transport; Computer science; Function (biology); Line (geometry); Moment (physics); Focus (optics); Operations research; Telecommunications; Sensitivity (control systems); Mathematical optimization; Real-time computing; Transport engineering; Mathematics; Statistics; Engineering; Geography; Electronic engineering","score_opus":0.007614946721201253,"score_gpt":0.20862051833847367,"score_spread":0.20100557161727242,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123284425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6386446,0.00050213473,0.35911852,0.00032255513,0.00007304636,0.0006069213,0.000001796679,0.00004174785,0.0006887236],"genre_scores_gemma":[0.99876505,0.00003466893,0.00094782613,0.000037114038,0.000060190236,0.000043051186,0.000023667659,0.0000210018,0.00006744787],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99851525,0.000021868354,0.00036189787,0.00014883367,0.00018157632,0.0007705878],"domain_scores_gemma":[0.9991692,0.000026647009,0.0004888064,0.000095456235,0.00021061715,0.000009322155],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015644102,0.000118206415,0.00019953553,0.00034418431,0.00009848812,0.00008444505,0.00012547903,0.000038389844,0.0000035652258],"category_scores_gemma":[0.000027581313,0.000097428485,0.000062241656,0.0005891608,0.000018128027,0.0010014104,0.0000023085572,0.00029332456,0.000002138698],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092316535,0.00007335963,0.0024891663,0.00026546366,0.00008884045,9.403527e-7,0.00008349119,0.083547436,0.00007098805,0.9119462,0.0000013250065,0.001340511],"study_design_scores_gemma":[0.0026437938,0.00016459948,0.00030798337,0.00033813907,0.0002803444,0.000036933907,0.004786279,0.09800779,0.000034353263,0.88926804,0.0038037999,0.00032794918],"about_ca_topic_score_codex":0.00012495446,"about_ca_topic_score_gemma":0.0037307267,"teacher_disagreement_score":0.36012048,"about_ca_system_score_codex":0.00025827106,"about_ca_system_score_gemma":0.00021631725,"threshold_uncertainty_score":0.39730182},"labels":[],"label_agreement":null},{"id":"W3123568445","doi":"10.2139/ssrn.2857256","title":"Coverage, Coarseness and Classification: Determinants of Social Efficiency in Priority Queues","year":2016,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Queue; Business; Computer science; Priority queue; Econometrics; Industrial organization; Mathematics; Computer network","score_opus":0.011148909783756327,"score_gpt":0.2593038950678495,"score_spread":0.2481549852840932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123568445","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9939547,0.00019122484,0.004749151,0.0003983908,0.000062648025,0.000059067122,6.4383477e-7,0.00001591568,0.00056821207],"genre_scores_gemma":[0.99910367,0.00031571934,0.000010418894,0.00004362709,0.00026758938,0.0000021535134,4.7561056e-7,0.000011529168,0.00024483903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986162,0.000029348845,0.00031194912,0.00016464687,0.00016651879,0.00071130454],"domain_scores_gemma":[0.9993726,0.00005836595,0.00036550977,0.00009248312,0.00010379688,0.0000072523376],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014410357,0.000107109714,0.0002131051,0.00021371106,0.0001581172,0.000041711297,0.00017501936,0.00005148181,0.000020842017],"category_scores_gemma":[0.00016746066,0.000078443896,0.00005721183,0.00030919872,0.000102626116,0.00070215453,0.0000529347,0.00029127844,0.000011534491],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018179005,0.00013267169,0.18367209,0.000046298068,0.000042556934,0.0000066475577,0.000086528984,0.00002159737,0.0045391507,0.6402013,0.000010299308,0.17105909],"study_design_scores_gemma":[0.0020790887,0.000048672464,0.092760384,0.00011767393,0.00010526129,0.000045775225,0.0011786042,0.0014584805,0.00025601283,0.89979434,0.0017771835,0.00037853577],"about_ca_topic_score_codex":0.00003284019,"about_ca_topic_score_gemma":0.000782186,"teacher_disagreement_score":0.25959304,"about_ca_system_score_codex":0.0002042539,"about_ca_system_score_gemma":0.00019308992,"threshold_uncertainty_score":0.31988493},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01265754191159323,"score_gpt":0.259395675313262,"score_spread":0.24673813340166878,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123594288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8406993,0.000006836392,0.0063773096,0.00052907504,0.00033551836,0.00021342101,6.027333e-7,0.00008928383,0.15174861],"genre_scores_gemma":[0.9984138,0.0000024325702,0.0005247731,0.00082130596,0.00007256193,0.000027789152,0.000002048543,0.000005140642,0.00013014299],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858314,0.000005382692,0.00024303811,0.00030948975,0.0004894625,0.0003695091],"domain_scores_gemma":[0.99875236,0.0000075888256,0.00032133117,0.0008262847,0.00007861688,0.000013796451],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0015715947,0.00012774392,0.00012862298,0.0006527897,0.0009935453,0.001181506,0.0012586046,0.000019632413,0.00003642892],"category_scores_gemma":[0.0002228057,0.000121612335,0.000044790268,0.00076321093,0.00037735715,0.003508512,0.0008542166,0.000075025135,0.0005420062],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000065333195,0.00015992949,0.059897374,0.00027333247,0.00002113405,0.00003887216,0.00012900976,0.19173726,0.00039881235,0.6682324,0.00019406216,0.078852475],"study_design_scores_gemma":[0.0013125086,0.000008336711,0.40658668,0.00016608604,0.000059072092,9.616987e-7,0.0005968412,0.5335254,0.00032166307,0.017196193,0.039542817,0.00068344985],"about_ca_topic_score_codex":0.00019769985,"about_ca_topic_score_gemma":0.00010978676,"teacher_disagreement_score":0.6510362,"about_ca_system_score_codex":0.000091518734,"about_ca_system_score_gemma":0.000007656249,"threshold_uncertainty_score":0.99985534},"labels":[],"label_agreement":null},{"id":"W3123980964","doi":"","title":"When Does Cμ Rule Apply to Finite-Population Queuing Systems","year":2004,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Preemption; Queueing theory; Queueing system; Computer science; Scheduling (production processes); Population; Holding cost; Unit (ring theory); Queue; Mathematical optimization; Real-time computing; Computer network; Mathematics; Operating system; Medicine","score_opus":0.005892698564821096,"score_gpt":0.2159833773316651,"score_spread":0.21009067876684398,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3123980964","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72508353,0.00077769737,0.26629198,0.00373839,0.0012181816,0.00042860542,0.000001769988,0.0003165198,0.0021433388],"genre_scores_gemma":[0.9954441,0.000057976504,0.00029509686,0.0005795797,0.0023240307,0.000014930409,0.00001528221,0.000047628422,0.0012213836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99737567,0.000027241618,0.00041855476,0.00028301313,0.000347014,0.0015484993],"domain_scores_gemma":[0.99919075,0.000041991672,0.00035525882,0.00023190014,0.00015123979,0.000028868515],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017400256,0.00021807755,0.0002701039,0.00045117878,0.00045130917,0.00041201204,0.0003535569,0.00007010227,0.000041588828],"category_scores_gemma":[0.00025839597,0.00017375988,0.00013780768,0.0004969697,0.000018113577,0.0013127121,0.00008127585,0.00081961794,0.00032126324],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008008831,0.000054488053,0.0031931198,0.000041152132,0.00016457225,0.0000119853985,0.000090525136,0.27591765,0.0005101116,0.7125196,0.00006076851,0.007355957],"study_design_scores_gemma":[0.00057735905,0.000024714749,0.0002228477,0.00011120721,0.00013073391,0.000039940413,0.0015249897,0.0022485764,0.00002364935,0.9864281,0.008320219,0.00034765157],"about_ca_topic_score_codex":0.0013274903,"about_ca_topic_score_gemma":0.0016089509,"teacher_disagreement_score":0.27390853,"about_ca_system_score_codex":0.0009528082,"about_ca_system_score_gemma":0.00015526802,"threshold_uncertainty_score":0.7085722},"labels":[],"label_agreement":null},{"id":"W3124172922","doi":"","title":"Capacity Selection under Uncertainty with Ratio Objectives","year":2007,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Newsvendor model; Profitability index; Economics; Microeconomics; Profit (economics); Econometrics; Capacity utilization; Unit cost; Business","score_opus":0.007970929374929553,"score_gpt":0.2236426805457529,"score_spread":0.21567175117082335,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3124172922","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5590948,0.00009788981,0.43694502,0.00036876925,0.00008658037,0.00008627359,1.4365676e-7,0.00009805152,0.0032225067],"genre_scores_gemma":[0.99732155,0.000035443012,0.00019310275,0.00044071034,0.0012254674,0.0000023538223,0.0000033763035,0.000029864608,0.0007481635],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9976331,0.000025864496,0.00024331475,0.00023186248,0.00028801008,0.0015778688],"domain_scores_gemma":[0.999225,0.000056281635,0.0003124319,0.00011963936,0.0002691146,0.000017497698],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0026369847,0.00018900487,0.0001826548,0.0003268182,0.0005424335,0.00015269339,0.00017755771,0.00006035126,0.00006882953],"category_scores_gemma":[0.00009058268,0.00014999167,0.000094104944,0.0008173811,0.00007705612,0.0012431772,0.00002502611,0.0012263341,0.00004895015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004128057,0.00007788493,0.0061454624,0.000009705732,0.00034723483,0.0000039195156,0.000052343083,0.050351575,0.0015800796,0.9335198,0.000024633351,0.0074745766],"study_design_scores_gemma":[0.0009467918,0.00010218738,0.0031558406,0.000026998767,0.00023179522,0.00020870261,0.003839774,0.0050559277,0.00031043563,0.98377216,0.00192805,0.00042134893],"about_ca_topic_score_codex":0.00028588658,"about_ca_topic_score_gemma":0.012701185,"teacher_disagreement_score":0.43822676,"about_ca_system_score_codex":0.0009223159,"about_ca_system_score_gemma":0.00028384294,"threshold_uncertainty_score":0.7087559},"labels":[],"label_agreement":null},{"id":"W3125814563","doi":"","title":"Due-Date Scheduling: Asymptotic Optimality of Generalized Longest Queue and Generalized Largest Delay Rules","year":2003,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Parameterized complexity; Queue; Scheduling (production processes); Mathematics; Probabilistic logic; Combinatorics; Mathematical optimization; Discrete mathematics; Computer science; Statistics","score_opus":0.01805685137361541,"score_gpt":0.244952455650044,"score_spread":0.2268956042764286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125814563","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.965055,0.00048568475,0.020571137,0.00032408902,0.0001379257,0.00020740929,0.0000054334605,0.00018012925,0.013033197],"genre_scores_gemma":[0.94583994,0.00007338017,0.051934976,0.0010269196,0.0002075659,0.000015732321,0.000053671174,0.000049657363,0.00079813786],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981889,0.000098476776,0.00055369205,0.00050115533,0.00025337463,0.00040436527],"domain_scores_gemma":[0.9987521,0.00009159387,0.00038118704,0.0004899952,0.0002491088,0.000035975198],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011026128,0.00031987054,0.0005727717,0.000273226,0.00021130269,0.00016399763,0.00024020638,0.00011448883,0.0008929236],"category_scores_gemma":[0.00051645655,0.00028305603,0.00015603016,0.0005040196,0.00016993466,0.0009179279,0.00015243233,0.00013957228,0.00009704079],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009642001,0.00016289469,0.014886155,0.00018753104,0.00021462172,0.000028484872,0.000025358686,0.017741106,0.0045393878,0.96156937,0.00010291365,0.0004457705],"study_design_scores_gemma":[0.021860618,0.00014199875,0.021321598,0.0005430617,0.004668909,0.00015473168,0.0012814546,0.3610237,0.03478983,0.40320736,0.14399697,0.007009753],"about_ca_topic_score_codex":0.00050061714,"about_ca_topic_score_gemma":0.0001767604,"teacher_disagreement_score":0.558362,"about_ca_system_score_codex":0.000018446106,"about_ca_system_score_gemma":0.0000223946,"threshold_uncertainty_score":0.99996215},"labels":[],"label_agreement":null},{"id":"W3125991013","doi":"","title":"Maximizing Throughput in Finite-Source Parallel Queue Systems","year":2011,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Server; Pooling; Computer science; Throughput; Queue; Markov process; Queueing theory; Fork–join queue; Routing (electronic design automation); Computer network; Markovian arrival process; Markov decision process; Mathematical optimization; Distributed computing; Queue management system; Mathematics; Telecommunications","score_opus":0.019254392381447154,"score_gpt":0.21653566488409504,"score_spread":0.19728127250264788,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125991013","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.3723843,0.0071250754,0.5692119,0.0006911441,0.0010771947,0.00051532214,0.000001159654,0.00042000847,0.048573885],"genre_scores_gemma":[0.9959609,0.00044552502,0.00026037087,0.0003217461,0.00085180526,0.000011491046,0.0000033881488,0.000052866708,0.0020919216],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9968894,0.00005814164,0.00049247313,0.00029150624,0.00026012879,0.0020083531],"domain_scores_gemma":[0.99910843,0.000068858506,0.0004346349,0.00026731176,0.00010268276,0.000018098057],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024845265,0.00024053772,0.00033467507,0.00047804692,0.000252453,0.00016907338,0.0004957611,0.00009412647,0.000092460206],"category_scores_gemma":[0.00023595801,0.00022057751,0.00015878965,0.000603492,0.000050245544,0.0013784851,0.00010908311,0.0015123619,0.0002617165],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022402902,0.00014207659,0.011347083,0.000047047226,0.00023401089,0.00004812127,0.00030960713,0.036976907,0.00007856758,0.9417399,0.000056171797,0.0087964395],"study_design_scores_gemma":[0.0016939148,0.000057550886,0.0004895095,0.00017112169,0.00020834517,0.00016299126,0.008956851,0.0410968,0.000014347641,0.9306517,0.01572919,0.00076763995],"about_ca_topic_score_codex":0.0011638756,"about_ca_topic_score_gemma":0.0014492183,"teacher_disagreement_score":0.6235766,"about_ca_system_score_codex":0.00045952376,"about_ca_system_score_gemma":0.00018550246,"threshold_uncertainty_score":0.8994889},"labels":[],"label_agreement":null},{"id":"W3125992442","doi":"","title":"Call Center Labor Cross-Training: It's a Small World after All","year":2013,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Flexibility (engineering); Computer science; Queueing theory; Service (business); Metric (unit); Server; Focus (optics); Distributed computing; Path (computing); Computer network; Operations research; Mathematical optimization; Operations management; Engineering; Mathematics","score_opus":0.013083735276509016,"score_gpt":0.24546080825461059,"score_spread":0.23237707297810156,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3125992442","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9702021,0.0008358675,0.006023339,0.009202053,0.00050555106,0.00030517502,0.0000025855404,0.00020284708,0.012720501],"genre_scores_gemma":[0.9714227,0.00010510165,0.00020264504,0.00835038,0.0020059603,0.00003635287,0.000011062122,0.00007024156,0.01779561],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99610686,0.0000344095,0.000465428,0.0003504854,0.00028067618,0.0027621211],"domain_scores_gemma":[0.99895084,0.00004868124,0.0003500631,0.00030110622,0.00030509455,0.00004418739],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0012983188,0.00030477124,0.00030077738,0.00043781727,0.00020808468,0.00076596835,0.000519515,0.000075842465,0.0013989124],"category_scores_gemma":[0.00014436909,0.00026338873,0.00025272247,0.0005584857,0.000090178924,0.0017571516,0.00014765923,0.0015795255,0.001429037],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011095698,0.0008804144,0.20832382,0.0001812489,0.0030937693,0.00021073609,0.0013133265,0.0022187356,0.0014055097,0.67562306,0.008816846,0.096822955],"study_design_scores_gemma":[0.0017325918,0.00004103954,0.0053166123,0.00008857832,0.00023939402,0.00011162868,0.0010782212,0.0015991542,0.000016862881,0.6345563,0.35442165,0.0007979719],"about_ca_topic_score_codex":0.00019434933,"about_ca_topic_score_gemma":0.00504028,"teacher_disagreement_score":0.34560478,"about_ca_system_score_codex":0.00038571696,"about_ca_system_score_gemma":0.00021739112,"threshold_uncertainty_score":0.9999818},"labels":[],"label_agreement":null},{"id":"W3126117025","doi":"","title":"Gradient Estimation for a Class of Systems with Bulk Services: A Problem in Public Transportation","year":2003,"lang":"en","type":"preprint","venue":"RePEc: Research Papers in Economics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Estimator; Train; Computer science; Public transport; Function (biology); Moment (physics); Line (geometry); Focus (optics); Sensitivity (control systems); Operations research; Telecommunications; Mathematical optimization; Real-time computing; Transport engineering; Mathematics; Statistics; Engineering; Geography","score_opus":0.026230236904450026,"score_gpt":0.27258967363409436,"score_spread":0.24635943672964433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3126117025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9764128,0.00010422072,0.0017367457,0.00039940354,0.00021082454,0.004139861,0.0000596793,0.00007503673,0.016861428],"genre_scores_gemma":[0.9949524,0.00015774003,0.0030091803,0.000040309023,0.00008281598,0.0010908828,0.00045633203,0.00006093056,0.00014942473],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9978036,0.00006410456,0.00078858034,0.0006427978,0.00022598836,0.000474875],"domain_scores_gemma":[0.99831295,0.00018857278,0.00063797267,0.0005094201,0.0003291836,0.00002192767],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002261349,0.0002445178,0.000552964,0.001185843,0.00008011031,0.0002141281,0.0003984844,0.00021043462,0.000009656983],"category_scores_gemma":[0.00010968561,0.0002458435,0.000107022155,0.000465294,0.00010325376,0.0005791685,0.00007460342,0.00047774738,0.0000019295323],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00023352729,0.00017949502,0.0062529966,0.0057521923,0.00010829481,0.0000058231726,0.00023751834,0.9408089,0.000022707856,0.034244858,0.0000027803892,0.012150912],"study_design_scores_gemma":[0.0016714047,0.000054692944,0.0016909138,0.0019397421,0.00007847042,0.0000012241169,0.0020549607,0.9471587,0.000015795695,0.035967596,0.008793565,0.00057293265],"about_ca_topic_score_codex":0.00047657607,"about_ca_topic_score_gemma":0.0037269508,"teacher_disagreement_score":0.018539585,"about_ca_system_score_codex":0.00046043823,"about_ca_system_score_gemma":0.00015149164,"threshold_uncertainty_score":0.9999994},"labels":[],"label_agreement":null},{"id":"W3128553668","doi":"10.1287/opre.2020.2027","title":"On the Optimal Design of a Bipartite Matching Queueing System","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":41,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Bipartite graph; Queueing theory; Matching (statistics); Computer science; Mathematical optimization; Queueing system; Layered queueing network; Mathematics; Theoretical computer science; Statistics; Computer network; Graph","score_opus":0.08790752156144246,"score_gpt":0.34373971583209384,"score_spread":0.2558321942706514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3128553668","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.69885325,0.0001220223,0.27659166,0.003968457,0.00010549981,0.0005078011,0.0000030560172,0.000101254846,0.01974697],"genre_scores_gemma":[0.9960209,0.000003770406,0.0022974734,0.00013882003,0.00018726567,0.000060825467,0.000007131652,0.000016279915,0.0012675277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872786,0.00023710364,0.00019905332,0.00019840313,0.00041637337,0.00022122706],"domain_scores_gemma":[0.99844086,0.0005174785,0.000027939164,0.00039386263,0.0006118288,0.000008018964],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0024310467,0.00007252355,0.000118329874,0.00023536073,0.0007841226,0.00039705873,0.0002407636,0.000028232647,0.00035494956],"category_scores_gemma":[0.000933029,0.000052612057,0.00004883612,0.0012546717,0.00007507338,0.00046057883,0.00017979188,0.00023367352,0.00035426804],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000012169847,0.000023491408,0.0000091500815,0.000029883297,0.000019689483,0.000010418545,0.00007061437,0.49688905,0.009144517,0.4934445,0.00020340472,0.0001431031],"study_design_scores_gemma":[0.00017004598,0.00001251989,0.000029111987,0.00026935546,0.00003013516,0.0000032390064,0.005249667,0.9798812,0.00691131,0.006023644,0.0012846577,0.00013508607],"about_ca_topic_score_codex":0.00023462277,"about_ca_topic_score_gemma":0.00007712096,"teacher_disagreement_score":0.48742086,"about_ca_system_score_codex":0.000048609534,"about_ca_system_score_gemma":0.000063700245,"threshold_uncertainty_score":0.60309166},"labels":[],"label_agreement":null},{"id":"W3130305711","doi":"10.1287/opre.2020.2015","title":"A Fluid Model for One-Sided Bipartite Matching Queues with Match-Dependent Rewards","year":2021,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia; McGill University","funders":"","keywords":"Outcome (game theory); Ranking (information retrieval); Matching (statistics); Queue; Computer science; Bipartite graph; Resource allocation; Decision maker; Mathematical optimization; Class (philosophy); Balance (ability); Operations research; Microeconomics; Economics; Mathematics; Artificial intelligence; Statistics; Psychology; Theoretical computer science","score_opus":0.10073748920836752,"score_gpt":0.36512088502437245,"score_spread":0.26438339581600495,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3130305711","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5534229,0.00017493284,0.42687058,0.008474053,0.00007601402,0.00094246,0.000027900542,0.00023586521,0.009775241],"genre_scores_gemma":[0.96436757,0.000026709755,0.01684588,0.0005166417,0.0004367994,0.0004142413,0.00015151684,0.000058919097,0.017181695],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99813783,0.00006402717,0.0002626563,0.00045362723,0.00062521076,0.00045663872],"domain_scores_gemma":[0.9976324,0.00014518143,0.000030319754,0.00053008564,0.0016360079,0.000026046493],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0014585628,0.00014021993,0.0002122232,0.00036386307,0.0010606294,0.0010870587,0.00027056172,0.000056188357,0.00028482062],"category_scores_gemma":[0.0007386146,0.0001269028,0.00007301089,0.000979862,0.000083524894,0.0014688773,0.00025618332,0.00024907338,0.00020589014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010402701,0.00014420995,0.00004734521,0.00009747253,0.00008756496,0.000016734804,0.00028639962,0.8058805,0.025624482,0.1663325,0.0006783455,0.00070041633],"study_design_scores_gemma":[0.00045914133,0.000012597257,0.000013230104,0.00010797015,0.0000556855,0.0000025417417,0.0010311933,0.9597418,0.0038699966,0.0325405,0.0019528214,0.00021256942],"about_ca_topic_score_codex":0.00047381237,"about_ca_topic_score_gemma":0.005378254,"teacher_disagreement_score":0.41094464,"about_ca_system_score_codex":0.00008887258,"about_ca_system_score_gemma":0.00019000724,"threshold_uncertainty_score":0.99994993},"labels":[],"label_agreement":null},{"id":"W3134366789","doi":"10.1145/3453953.3453975","title":"Frequency scaling in multilevel queues","year":2021,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary; Mount Royal University","funders":"","keywords":"Queue; Bulk queue; Computer science; Multilevel queue; Scaling; Fork–join queue; Scheduling (production processes); Queueing theory; Queue management system; Real-time computing; Mathematical optimization; Mathematics; Computer network; Geometry","score_opus":0.08088553930748711,"score_gpt":0.33841692164745135,"score_spread":0.25753138233996425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3134366789","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7653274,0.21194357,0.0020734423,0.0026886736,0.00079845625,0.0013685816,0.0000030896058,0.00023587322,0.015560935],"genre_scores_gemma":[0.9451366,0.043289654,0.0042469357,0.006399787,0.00042104305,0.00016259162,0.00016235547,0.000039616363,0.00014138916],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99768794,0.00009374486,0.00070831296,0.00043221645,0.0007821511,0.00029565356],"domain_scores_gemma":[0.9974614,0.0002505642,0.00040588816,0.00078813796,0.0010793589,0.000014700504],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004677146,0.00020665846,0.00042703366,0.00069304125,0.00015008768,0.0001060172,0.00043299168,0.000064956286,0.0014883046],"category_scores_gemma":[0.016960813,0.0002020266,0.00012720995,0.0054812296,0.000029369117,0.0017672521,0.00023410017,0.00022429928,0.00065198616],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000052092782,0.0001352064,0.042092633,0.0037400671,0.00003988703,0.0000125504,0.00002958467,0.0072605014,0.0002428291,0.0057154237,0.00057901023,0.9401471],"study_design_scores_gemma":[0.0021104265,0.000015362442,0.06680918,0.0124480985,0.0013202266,0.000012178787,0.0001584292,0.83917075,0.00077417435,0.034322314,0.041275803,0.001583049],"about_ca_topic_score_codex":0.00003291886,"about_ca_topic_score_gemma":0.000025883128,"teacher_disagreement_score":0.93856406,"about_ca_system_score_codex":0.00016408872,"about_ca_system_score_gemma":0.00010142053,"threshold_uncertainty_score":0.99942446},"labels":[],"label_agreement":null},{"id":"W3135805902","doi":"10.1017/jpr.2021.18","title":"Bounds on the mean and squared coefficient of variation of phase-type distributions","year":2021,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Mathematics; Poisson distribution; Type (biology); Coefficient of variation; Event (particle physics); Phase-type distribution; Class (philosophy); Markov chain; Applied mathematics; Statistics; Mean squared error; Statistical physics; Combinatorics","score_opus":0.01957103974712575,"score_gpt":0.2530134855296679,"score_spread":0.23344244578254214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3135805902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9899525,0.000029402201,0.007936396,0.0005550587,0.00007320698,0.000120494515,0.000006398606,0.0000059594295,0.0013205775],"genre_scores_gemma":[0.9992702,0.0000035243374,0.0005443402,0.00007432588,0.00008879272,0.0000015698096,0.000007877182,0.000004590284,0.000004750439],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990628,0.000029916933,0.0004704795,0.00011237448,0.00024069753,0.00008373071],"domain_scores_gemma":[0.99817187,0.00020251419,0.00075958256,0.00022421205,0.00063274207,0.000009086279],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013448868,0.00007742269,0.00023784353,0.000061696715,0.00010013013,0.00003465282,0.00011483095,0.00003190398,0.000088738074],"category_scores_gemma":[0.0005373859,0.00005381092,0.000084579464,0.00053326983,0.0001198454,0.00013245965,0.000056789624,0.00012486603,0.0000014712103],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011813,0.0017451127,0.00064552156,0.0003060067,0.00024317986,0.0000027610656,0.00046091116,0.016571118,0.0421405,0.93240196,0.0001653166,0.004136324],"study_design_scores_gemma":[0.002569995,0.00018726745,0.007862042,0.00015522959,0.00087350915,0.0000056020185,0.0010459214,0.014524086,0.023370923,0.94448245,0.0046533607,0.00026960814],"about_ca_topic_score_codex":0.0000041147155,"about_ca_topic_score_gemma":0.0000068163017,"teacher_disagreement_score":0.018769577,"about_ca_system_score_codex":0.000040256902,"about_ca_system_score_gemma":0.000044516848,"threshold_uncertainty_score":0.21943456},"labels":[],"label_agreement":null},{"id":"W3141062956","doi":"","title":"SPEEDING UP CALL CENTER SIMULATION AND OPTIMIZATION BY MARKOV CHAIN UNIFORMIZATION","year":2009,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Fonds Québécois de la Recherche sur la Nature et les Technologies; Natural Sciences and Engineering Research Council of Canada; Canada Research Chairs","keywords":"Computer science; Markov chain; Uniformization (probability theory); Mathematical optimization; Discrete event simulation; Scheduling (production processes); Limit (mathematics); Markov process; Variable-order Markov model; Algorithm; Markov model; Simulation; Mathematics; Machine learning","score_opus":0.009617420837669602,"score_gpt":0.23676447156652944,"score_spread":0.22714705072885982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3141062956","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0210066,0.00002198867,0.96261084,0.0010102061,0.000094479336,0.00015988949,0.0000011218466,0.0002071022,0.014887793],"genre_scores_gemma":[0.9927662,0.00000998927,0.003210053,0.0017985059,0.00023316385,0.000001051791,0.00016607344,0.000013009083,0.001801947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993802,0.000007108859,0.00017360326,0.00018595303,0.00011508655,0.00013810121],"domain_scores_gemma":[0.9996605,0.000024513227,0.00012297626,0.00009206099,0.00009095951,0.00000901836],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00019957579,0.00010901188,0.000102392776,0.00016305874,0.00013530206,0.00015623131,0.000057526067,0.0000453291,0.00019751705],"category_scores_gemma":[0.000098266115,0.000102842416,0.000025223515,0.00032891004,0.000014144456,0.0015235925,0.000029031758,0.000044939436,0.00001465729],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030345807,0.000022607725,0.00094599486,0.000011455115,0.00000769653,4.6074118e-7,0.000017198989,0.97864515,0.000153397,0.00930839,0.00082173315,0.010035602],"study_design_scores_gemma":[0.00033848066,0.0000042635993,0.0001483397,0.000012466629,0.000026967433,2.57651e-7,0.00003904146,0.99291456,0.0000269971,0.0024880785,0.0038680371,0.00013249417],"about_ca_topic_score_codex":0.000014841699,"about_ca_topic_score_gemma":0.0000044474705,"teacher_disagreement_score":0.9717596,"about_ca_system_score_codex":0.000024351575,"about_ca_system_score_gemma":0.0000015421987,"threshold_uncertainty_score":0.4193792},"labels":[],"label_agreement":null},{"id":"W3142188339","doi":"10.5555/1030818.1031065","title":"Modelling and simulation of a telephone call center","year":2003,"lang":"en","type":"article","venue":"Winter Simulation Conference","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":31,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Queueing theory; Markov chain; Staffing; Service (business); GPSS; Center (category theory); Markov process; Operations research; Distributed computing; Real-time computing; Computer network; Simulation; Engineering; Mathematics","score_opus":0.034243664499198835,"score_gpt":0.26236713468187445,"score_spread":0.22812347018267562,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3142188339","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.2982306,0.000011926578,0.6981846,0.000031255022,0.000049908354,0.0000823772,0.0000010329916,0.000036856636,0.0033714252],"genre_scores_gemma":[0.9986002,0.0000014261344,0.0009518562,0.00017478236,0.00006820777,0.0000021503288,0.000009785593,0.000012637221,0.00017898277],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99925786,0.000019131117,0.00026435868,0.00020885633,0.00012720872,0.00012259415],"domain_scores_gemma":[0.9992512,0.0001124455,0.00019412905,0.00016319881,0.00026963637,0.000009424186],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00018334207,0.00011514324,0.00016315513,0.00015847482,0.00006039168,0.00006849719,0.000070797316,0.00004260356,0.00021462548],"category_scores_gemma":[0.00013844023,0.00011318266,0.0000439547,0.0001909481,0.000044730583,0.0007310678,0.000037431873,0.00006389943,0.000026277105],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000030844516,0.000024601812,0.0023925013,0.000032170254,0.000014469862,5.1258945e-7,0.00008975867,0.9865783,0.00010625571,0.009667104,0.0000033029655,0.0010601926],"study_design_scores_gemma":[0.00035270638,0.0000039940137,0.000117824566,0.0000451963,0.00002853473,1.8929202e-7,0.000044218195,0.9836743,0.00008883175,0.012449054,0.0030780965,0.000117051444],"about_ca_topic_score_codex":0.000021344225,"about_ca_topic_score_gemma":0.00000835717,"teacher_disagreement_score":0.7003696,"about_ca_system_score_codex":0.000011113738,"about_ca_system_score_gemma":0.0000064098226,"threshold_uncertainty_score":0.4615455},"labels":[],"label_agreement":null},{"id":"W3144499601","doi":"10.1051/ro/2021054","title":"Complete analysis of a discrete-time batch service queue with batch-size-dependent service time under correlated arrival process: D-MAP/<i>G<sub>n</sub><sup>(a,b)</sup>/</i>1","year":2021,"lang":"en","type":"article","venue":"RAIRO - Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markovian arrival process; Computer science; Epoch (astronomy); Queueing theory; Bulk queue; Queue; Generating function; Markov process; Function (biology); Discrete time and continuous time; Real-time computing; Applied mathematics; Mathematical optimization; Algorithm; Mathematics; Discrete mathematics; Computer network; Statistics","score_opus":0.023418408882001123,"score_gpt":0.2928427222999386,"score_spread":0.26942431341793743,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3144499601","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9801834,0.000097592165,0.0063918657,0.009088388,0.00003924901,0.0008997145,0.00016251416,0.00027055125,0.002866727],"genre_scores_gemma":[0.99244696,0.000015547457,0.00076020753,0.001694923,0.0002689466,0.00018704886,0.0019809054,0.00013268922,0.0025127938],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9945307,0.0004900531,0.00093621184,0.0011988034,0.0018891804,0.00095507794],"domain_scores_gemma":[0.9919335,0.0007343352,0.00021480852,0.0013688668,0.0056354795,0.000112988375],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018893142,0.0005117979,0.0010287631,0.0012895768,0.0011766225,0.0008010488,0.0009746738,0.00022158808,0.0030441384],"category_scores_gemma":[0.000705766,0.0004673419,0.00027074447,0.014890029,0.00024137451,0.001962578,0.0006889467,0.00086971757,0.0019614208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002810635,0.00040471114,0.0005823339,0.00032111237,0.002509653,0.00005548728,0.0007767312,0.93178684,0.06046354,0.002353811,0.0003212841,0.00014344195],"study_design_scores_gemma":[0.0013029198,0.00004100803,0.00064794644,0.00022767004,0.0019737561,0.000007796122,0.0033102809,0.9858214,0.004019969,0.0011831591,0.0007879275,0.0006761403],"about_ca_topic_score_codex":0.0013187835,"about_ca_topic_score_gemma":0.0070332503,"teacher_disagreement_score":0.05644357,"about_ca_system_score_codex":0.000214193,"about_ca_system_score_gemma":0.00048037918,"threshold_uncertainty_score":0.99977785},"labels":[],"label_agreement":null},{"id":"W3150001128","doi":"10.1109/wsc.2005.1574295","title":"A java library for simulating contact centers","year":2006,"lang":"en","type":"article","venue":"Proceedings of the Winter Simulation Conference, 2005.","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":28,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Java; Interoperability; Flexibility (engineering); Extensibility; Programmer; Interface (matter); Operating system; Architecture; Routing (electronic design automation); Programming language; Software engineering; Computer architecture; Embedded system","score_opus":0.016301099943393783,"score_gpt":0.23477694354516968,"score_spread":0.21847584360177588,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3150001128","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.91339165,0.00003363609,0.016856173,0.0022722746,0.00046423322,0.0011436956,0.00002255528,0.0004337941,0.065382],"genre_scores_gemma":[0.9959479,4.2997084e-7,0.0006572507,0.00054958864,0.00069169217,0.000016408983,0.000021536642,0.0000398051,0.002075409],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99875474,0.0000033138679,0.00046756066,0.00028501733,0.00020622088,0.0002831424],"domain_scores_gemma":[0.99872124,0.00013081804,0.00065026485,0.0001252866,0.00036150793,0.00001088797],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00021681913,0.00020278669,0.00026167187,0.0002156174,0.0001848962,0.00028516303,0.00043353386,0.00006594474,0.00022761333],"category_scores_gemma":[0.00018076281,0.00015992597,0.0002280755,0.00031208253,0.00006079602,0.0021541822,0.00019047286,0.000101517224,0.000016463055],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00085913105,0.00028723115,0.16899587,0.0008017084,0.00021850938,4.9992093e-7,0.00018244938,0.278444,0.013410461,0.5208314,0.012140125,0.0038286315],"study_design_scores_gemma":[0.0009958419,0.000012639662,0.0034783965,0.0002702687,0.000150087,3.3352288e-7,0.0002122025,0.8829338,0.001560889,0.06529352,0.044788804,0.00030320807],"about_ca_topic_score_codex":0.00001951904,"about_ca_topic_score_gemma":0.0000063113525,"teacher_disagreement_score":0.6044898,"about_ca_system_score_codex":0.000023015702,"about_ca_system_score_gemma":0.000013079161,"threshold_uncertainty_score":0.65215915},"labels":[],"label_agreement":null},{"id":"W3159329547","doi":"","title":"On a modified M/M/m/n queueing model","year":2021,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Queueing theory; Computer science; Computer network","score_opus":0.013623108730439464,"score_gpt":0.22732738397370322,"score_spread":0.21370427524326377,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3159329547","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23053855,0.00028240812,0.74455404,0.00424857,0.00012683752,0.0003033508,0.0000091551665,0.0013464391,0.018590637],"genre_scores_gemma":[0.9607386,0.000028018092,0.01876431,0.016556434,0.00041006497,0.00018246341,0.00004896677,0.0001133004,0.0031578625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99764013,0.00004702241,0.00046650707,0.00066843507,0.00043511848,0.00074275583],"domain_scores_gemma":[0.9981494,0.00013017828,0.00029840716,0.0011018667,0.00025789795,0.00006223289],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00063024793,0.00040507724,0.00044933506,0.00060935406,0.00041628478,0.00043568487,0.00051286264,0.0002137368,0.00013085207],"category_scores_gemma":[0.0007752277,0.00042887309,0.00030247658,0.0012108604,0.00006772839,0.0010956123,0.0003903318,0.00047266405,0.00016720069],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000078263576,0.00014625964,0.00044599222,0.000035888952,0.00004492196,0.00011491622,0.00002340311,0.47776562,0.0049144938,0.51196045,0.0013028571,0.0031669585],"study_design_scores_gemma":[0.0003534133,0.000008148895,0.00025154563,0.00006480709,0.0000799519,0.000012511163,0.000055993478,0.8006652,0.0025743044,0.19443735,0.0010850668,0.00041168174],"about_ca_topic_score_codex":0.0017271509,"about_ca_topic_score_gemma":0.0014014287,"teacher_disagreement_score":0.73020005,"about_ca_system_score_codex":0.00027985344,"about_ca_system_score_gemma":0.00011476336,"threshold_uncertainty_score":0.9998163},"labels":[],"label_agreement":null},{"id":"W3160735545","doi":"10.2139/ssrn.3464763","title":"Dynamic Pricing of a Multiclass Make-to-Stock Queue","year":2019,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Queue; Dynamic pricing; Variable pricing; Economics; Stock (firearms); Computer science; Business; Financial economics; Econometrics; Microeconomics; Engineering; Computer network","score_opus":0.0044204075682287465,"score_gpt":0.22554156612017784,"score_spread":0.22112115855194908,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3160735545","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9644985,0.00023847549,0.031856354,0.0005447638,0.00019487194,0.00021213289,4.8456604e-7,0.00005549669,0.00239893],"genre_scores_gemma":[0.9964701,0.000043119326,0.00037615784,0.00037274283,0.00019388873,0.0000034182744,0.000002582221,0.000040611605,0.0024973636],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99765295,0.000023768367,0.00037942475,0.0002388331,0.00028833305,0.0014166908],"domain_scores_gemma":[0.9990707,0.000053107342,0.00040625487,0.00027289763,0.00017910142,0.00001791071],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014903873,0.00017942008,0.0003074951,0.00045118376,0.00012283784,0.00007058561,0.00039729272,0.000054543943,0.00010293306],"category_scores_gemma":[0.00017137239,0.00016309241,0.00016985906,0.00068481185,0.000024603492,0.0005190595,0.00011632471,0.00086046587,0.00039218384],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00057862623,0.00026681225,0.024469638,0.00021445214,0.00082762947,0.000013393798,0.00022843761,0.060601056,0.042994205,0.7939346,0.000052927153,0.075818226],"study_design_scores_gemma":[0.0034660469,0.0002781366,0.004095237,0.0003966371,0.000577945,0.00015394505,0.005036238,0.18535297,0.0004456246,0.78826386,0.010686115,0.0012472351],"about_ca_topic_score_codex":0.00010603387,"about_ca_topic_score_gemma":0.00077952346,"teacher_disagreement_score":0.12475191,"about_ca_system_score_codex":0.00048532462,"about_ca_system_score_gemma":0.00021140517,"threshold_uncertainty_score":0.66507155},"labels":[],"label_agreement":null},{"id":"W3162095963","doi":"10.2139/ssrn.3190874","title":"Exploiting Hidden Convexity in Queueing Networks: A Novel Approach to Optimal Control of Flows","year":2018,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Convexity; Queueing theory; Computer science; Layered queueing network; Mathematical optimization; Control (management); Computer network; Artificial intelligence; Mathematics; Economics","score_opus":0.011428711841285084,"score_gpt":0.22515416015042275,"score_spread":0.21372544830913767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162095963","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4118035,0.00017055347,0.5855909,0.00015045148,0.0000935826,0.00014633071,4.140209e-7,0.000034978853,0.0020092765],"genre_scores_gemma":[0.9949669,0.000022786733,0.002198795,0.00050057325,0.0021615191,0.0000125832785,0.0000028467061,0.000040769773,0.00009322386],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970091,0.00004153558,0.000568371,0.00030900873,0.00026978445,0.0018021874],"domain_scores_gemma":[0.998978,0.000071284376,0.00045248523,0.0002189385,0.00025249337,0.00002675125],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0034604904,0.00021975122,0.00042447582,0.00046363863,0.00022199209,0.00010884664,0.00046535593,0.00007856689,0.000036325764],"category_scores_gemma":[0.00034291024,0.00021070648,0.00015023716,0.0009032349,0.000076423385,0.00095264043,0.00011880067,0.0010320916,0.000025426907],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001084461,0.0004939122,0.0064077065,0.000066714085,0.0005669408,0.0000073153064,0.00055841095,0.2825568,0.00497586,0.6824056,0.000047350837,0.020828944],"study_design_scores_gemma":[0.0036094924,0.00013524893,0.00048112092,0.0001967327,0.00023700933,0.00007206096,0.007101191,0.8995013,0.000113676746,0.08711619,0.0007712157,0.00066474406],"about_ca_topic_score_codex":0.0002081089,"about_ca_topic_score_gemma":0.000648359,"teacher_disagreement_score":0.6169445,"about_ca_system_score_codex":0.0003517413,"about_ca_system_score_gemma":0.0001981959,"threshold_uncertainty_score":0.85923606},"labels":[],"label_agreement":null},{"id":"W3162903105","doi":"","title":"A simulation-based decomposition approach for two-stage staffing optimization in call centers under arrival rate uncertainty","year":2020,"lang":"en","type":"article","venue":"RePEc: Research Papers in Economics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Group for Research in Decision Analysis; Université de Montréal","funders":"","keywords":"Staffing; Computer science; Mathematical optimization; Decomposition; Service (business); Stochastic programming; Operations research; Mathematics; Economics","score_opus":0.03621887886984246,"score_gpt":0.3160174089841412,"score_spread":0.2797985301142988,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3162903105","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.56985164,0.000011922591,0.41881117,0.0016409139,0.00010360527,0.0019475542,0.000027997869,0.00016429684,0.0074408916],"genre_scores_gemma":[0.9932879,0.000007913566,0.0050876644,0.0009753114,0.00018662777,0.00008243873,0.000291943,0.000041365394,0.000038827096],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984628,0.000095428244,0.00040020762,0.0004988562,0.000120972305,0.00042174963],"domain_scores_gemma":[0.9986885,0.00079464895,0.00016372146,0.0002105365,0.000110174195,0.0000324135],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011857218,0.0001576778,0.0002464443,0.00042314702,0.00016921872,0.00018002106,0.0002309992,0.00006678247,0.0000414666],"category_scores_gemma":[0.00070114783,0.00018057927,0.00009275311,0.00042237173,0.00007360009,0.00057581905,0.00009304457,0.00024339445,0.0000030824556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00047414214,0.00007076075,0.0013447464,0.00009585117,0.000018966153,0.000002339756,0.000047943133,0.9941317,0.00017524588,0.0011143374,0.0000017788196,0.0025222255],"study_design_scores_gemma":[0.0015317055,0.000014557165,0.00007767719,0.000026389676,0.000009245618,2.7637098e-8,0.00058756693,0.9969006,0.000025392204,0.0003085955,0.00033543445,0.00018277019],"about_ca_topic_score_codex":0.00008590969,"about_ca_topic_score_gemma":0.00015897313,"teacher_disagreement_score":0.42343625,"about_ca_system_score_codex":0.00041584624,"about_ca_system_score_gemma":0.000056846227,"threshold_uncertainty_score":0.73638093},"labels":[],"label_agreement":null},{"id":"W3167453940","doi":"10.1007/s11134-021-09706-x","title":"The unobserved waiting customer approximation","year":2021,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada","keywords":"Polling; Polling system; Queue; Context (archaeology); Computer science; Queueing theory; Exponential function; Fork–join queue; Applied mathematics; Mathematical optimization; Mathematics; Queue management system; Computer network; Mathematical analysis","score_opus":0.0196602565006794,"score_gpt":0.22655221798353806,"score_spread":0.20689196148285866,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3167453940","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7587493,0.0038543427,0.02557986,0.0038005013,0.004974608,0.0008769607,0.0000029955354,0.0016166361,0.20054477],"genre_scores_gemma":[0.9944894,0.0000071531354,0.00008748577,0.0002755398,0.0013776963,0.000038030004,0.000022162623,0.00003335893,0.0036692163],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99874485,0.0000665155,0.00036638242,0.00026727864,0.00026384613,0.0002911211],"domain_scores_gemma":[0.99878246,0.00019424272,0.0003207391,0.00040748884,0.0002858324,0.000009220993],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009909815,0.00014434446,0.00019415446,0.00007859665,0.00070095307,0.00079246797,0.00022403173,0.00005253904,0.000029441411],"category_scores_gemma":[0.00052450993,0.00011056021,0.0001023212,0.0006892409,0.00003900508,0.00079658045,0.000119079545,0.00013455401,0.000489747],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000013817812,0.00002634251,0.0018755816,0.000323024,0.00011423764,0.0000367582,0.00008010842,0.01793875,0.0041412953,0.9686534,0.0013478989,0.005448828],"study_design_scores_gemma":[0.00044007425,0.0000025097831,0.00032104907,0.0003922224,0.00017174569,0.000016223943,0.004671504,0.56717014,0.00067732146,0.011183622,0.41441843,0.00053512986],"about_ca_topic_score_codex":0.00022978503,"about_ca_topic_score_gemma":0.000057851197,"teacher_disagreement_score":0.95746976,"about_ca_system_score_codex":0.000051901017,"about_ca_system_score_gemma":0.000018448725,"threshold_uncertainty_score":0.76417863},"labels":[],"label_agreement":null},{"id":"W3169082202","doi":"10.1111/poms.13486","title":"Designing a Sustainable Two‐Tier Service System with Customer's Asymmetric Preference for Servers","year":2021,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":16,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Service level objective; Service provider; Computer science; Service (business); Service design; Service system; Service guarantee; Quality of service; Differentiated service; Service quality; Customer Service Assurance; Workload; Bounded rationality; Stylized fact; Preference; Business; Computer network; Microeconomics; Marketing; Economics","score_opus":0.0180888732026224,"score_gpt":0.22695248081322456,"score_spread":0.20886360761060216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3169082202","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06407539,0.00060131645,0.86082566,0.009775098,0.0007931436,0.0040932223,0.000004373156,0.00091672584,0.058915094],"genre_scores_gemma":[0.97001374,0.000017876868,0.016650012,0.0007186568,0.00034524637,0.00039988852,0.000054981196,0.000027557868,0.011772052],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989012,0.000023317265,0.00019069298,0.0004797425,0.00016430112,0.00024077386],"domain_scores_gemma":[0.99882776,0.000013849747,0.00007816429,0.00028956335,0.0007758383,0.000014856025],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045494564,0.00015223365,0.00015470354,0.0003842299,0.0007309859,0.0004732822,0.00009667571,0.00002096753,0.000024954878],"category_scores_gemma":[0.00008908583,0.00013893591,0.000030235144,0.0018932279,0.000021462858,0.0013685318,0.0001306845,0.00006188148,0.00003495247],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008785047,0.00011106969,0.0004045109,0.0023146402,0.0002656572,0.000021195583,0.00014990997,0.30314985,0.0001492405,0.6884903,0.0007939832,0.0040618074],"study_design_scores_gemma":[0.006561968,0.000110221394,0.0017259124,0.001231266,0.004499806,0.0000750305,0.13025892,0.44954538,0.0056515117,0.0062825177,0.39111307,0.0029443821],"about_ca_topic_score_codex":0.00011557751,"about_ca_topic_score_gemma":0.00025537566,"teacher_disagreement_score":0.9059383,"about_ca_system_score_codex":0.00008888019,"about_ca_system_score_gemma":0.00001959759,"threshold_uncertainty_score":0.5665642},"labels":[],"label_agreement":null},{"id":"W3173659814","doi":"10.48550/arxiv.2101.04627","title":"Queue-Learning: A Reinforcement Learning Approach for Providing Quality of Service","year":2021,"lang":"en","type":"article","venue":"arXiv (Cornell University)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Queueing theory; Reinforcement learning; Quality of service; Probabilistic logic; Queue; Distributed computing; Service (business); Controller (irrigation); Computer network; Artificial intelligence","score_opus":0.08165250247729315,"score_gpt":0.209501500388735,"score_spread":0.12784899791144183,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3173659814","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.45609695,0.000020849948,0.5273733,0.00009158408,0.000048925078,0.00023358037,7.2024176e-7,0.00017117546,0.015962884],"genre_scores_gemma":[0.99454594,0.000006682677,0.00077427214,0.00027680697,0.00011976533,0.000002038487,0.000077307675,0.000023851244,0.0041733393],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988105,0.00007142728,0.00026743472,0.0004841964,0.000091024325,0.00027539808],"domain_scores_gemma":[0.9985036,0.00014669668,0.00047874497,0.00029559724,0.0005556295,0.000019701143],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007013477,0.00016950887,0.00031105816,0.00018004933,0.000308331,0.000057213376,0.0002653891,0.00007254865,0.000094693285],"category_scores_gemma":[0.0005400386,0.00020020951,0.00019386617,0.0013180665,0.000044471748,0.00081680616,0.00027207672,0.00019998675,0.000021377871],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013266449,0.000052006126,0.004841473,0.00041549734,0.00008448804,0.000006708382,0.00006157165,0.73875135,0.0013678671,0.25415584,0.000013823885,0.00011667382],"study_design_scores_gemma":[0.0010641383,0.000017647386,0.00020530316,0.00004808345,0.0002549796,6.041087e-7,0.0035503805,0.9788542,0.0007980125,0.009548991,0.0053032436,0.00035444248],"about_ca_topic_score_codex":0.00022068102,"about_ca_topic_score_gemma":0.00004715874,"teacher_disagreement_score":0.538449,"about_ca_system_score_codex":0.00006850815,"about_ca_system_score_gemma":0.00003871408,"threshold_uncertainty_score":0.81643075},"labels":[],"label_agreement":null},{"id":"W3175143564","doi":"10.3934/math.2021527","title":"Joining strategies under two kinds of games for a multiple vacations retrial queue with $ N $-policy and breakdowns","year":2021,"lang":"en","type":"article","venue":"AIMS Mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Retrial queue; Computer science; Operations research; Joins; Profit (economics); Queue; Planner; Service (business); Service system; Social planner; Queueing system; Control (management); Mathematical optimization; Computer network; Business; Microeconomics; Marketing; Mathematics; Economics","score_opus":0.024665520967216338,"score_gpt":0.2834725179013292,"score_spread":0.25880699693411285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175143564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5140159,0.000107900305,0.47246635,0.0013899098,0.00008324275,0.00045924488,0.000018953531,0.00015593189,0.011302535],"genre_scores_gemma":[0.96354127,0.000006501171,0.03538317,0.0003148707,0.00037680083,0.000029063487,0.000027907266,0.000031794585,0.00028861608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99922895,0.00000901293,0.00028216635,0.00017883378,0.00013507192,0.00016594419],"domain_scores_gemma":[0.99869156,0.00045938214,0.00030903646,0.00026283145,0.00026686638,0.000010313647],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002453159,0.00013371666,0.00028120223,0.00016758166,0.00012819968,0.00015552613,0.00009653392,0.000039137693,0.000028191054],"category_scores_gemma":[0.00071400206,0.000113339964,0.00006449766,0.00053424825,0.00007629969,0.00054381264,0.00007619542,0.00006369598,0.000003893147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003109901,0.00011436833,0.00031474937,0.00050999934,0.00015091387,0.0000020253678,0.00052835804,0.0057351124,0.0018234658,0.9899741,0.000107690714,0.00070814247],"study_design_scores_gemma":[0.0022116348,0.000028701184,0.00026432236,0.00033639694,0.0005168185,0.000012067049,0.011808669,0.07099041,0.0014790219,0.90987486,0.0021071623,0.00036994767],"about_ca_topic_score_codex":0.00006878445,"about_ca_topic_score_gemma":0.00026734127,"teacher_disagreement_score":0.44952536,"about_ca_system_score_codex":0.000016351267,"about_ca_system_score_gemma":0.000077844925,"threshold_uncertainty_score":0.46218696},"labels":[],"label_agreement":null},{"id":"W3175584692","doi":"10.1111/poms.13520","title":"Customer Acquisition and Retention: A Fluid Approach for Staffing","year":2021,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Staffing; Computer science; Queue; Throughput; Queueing theory; Service quality; Proxy (statistics); Service (business); Quality of service; Operations research; Computer network; Business; Marketing; Telecommunications; Economics; Mathematics","score_opus":0.018372376553008538,"score_gpt":0.2370610988109201,"score_spread":0.21868872225791158,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3175584692","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15336788,0.0014181958,0.78674954,0.014303078,0.001117039,0.0024663722,0.000007968388,0.0005384914,0.04003142],"genre_scores_gemma":[0.94985926,0.00022068595,0.038515028,0.0011272039,0.00094113994,0.00028364436,0.00024619914,0.00002385288,0.008782985],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99918675,0.000013392867,0.00016776532,0.00041037632,0.00010029969,0.000121432706],"domain_scores_gemma":[0.9995634,0.000005419298,0.000042547246,0.00018359986,0.0001956321,0.000009401004],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00033307335,0.00010335018,0.00010638325,0.00017716893,0.0005471785,0.00034385858,0.00003754352,0.00002315831,0.000063058615],"category_scores_gemma":[0.00006467136,0.00010528217,0.000034755478,0.00037256067,0.000036872745,0.00094829145,0.00010157395,0.000039569455,0.000012221057],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081488666,0.00029287455,0.000344931,0.0010532624,0.00026475362,0.000005124635,0.00016875999,0.052868903,0.004574082,0.8982371,0.0049844957,0.0371242],"study_design_scores_gemma":[0.0028558618,0.00004413478,0.0032083644,0.00024220797,0.0021972833,0.000054683147,0.011496274,0.5554027,0.002970026,0.028729545,0.3911198,0.0016791114],"about_ca_topic_score_codex":0.000004906379,"about_ca_topic_score_gemma":0.000011425663,"teacher_disagreement_score":0.86950755,"about_ca_system_score_codex":0.00001935294,"about_ca_system_score_gemma":0.0000036161534,"threshold_uncertainty_score":0.4293282},"labels":[],"label_agreement":null},{"id":"W3179697346","doi":"10.1016/j.orl.2021.06.014","title":"Busy periods of discrete-time queues using the Lagrange implicit function theorem","year":2021,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Queue; Bernoulli's principle; Mathematics; Discrete time and continuous time; Applied mathematics; Operator (biology); Notation; Bernoulli process; Generating function; Function (biology); Probability distribution; Discrete mathematics; Computer science; Statistics","score_opus":0.03858907018433338,"score_gpt":0.32903426024653976,"score_spread":0.29044519006220637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3179697346","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9679773,0.00010690241,0.01657501,0.012657041,0.000077810146,0.00022637293,0.000006331277,0.000045571855,0.0023277004],"genre_scores_gemma":[0.9963923,0.000008709174,0.00058419997,0.0017747242,0.0005863434,0.000030876978,0.00006286235,0.000027265154,0.00053268124],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99851906,0.00020658188,0.00023446657,0.00027311652,0.0004567474,0.0003100292],"domain_scores_gemma":[0.9987113,0.00015886538,0.00004418184,0.0005010582,0.00057235896,0.0000122650745],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012554894,0.0001160129,0.00016505898,0.00025767888,0.0009903954,0.00049189717,0.00028169865,0.000037345355,0.00072302064],"category_scores_gemma":[0.00048672775,0.00008494405,0.00010998926,0.0014283025,0.00030013674,0.0009750035,0.0002330501,0.00026127486,0.000106213345],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00004480496,0.0000466701,0.0004633232,0.00004063971,0.000108817665,0.000009932716,0.0001865966,0.0989301,0.8244039,0.073566325,0.0012166584,0.0009822664],"study_design_scores_gemma":[0.0011642867,0.00003946626,0.002589972,0.00027350624,0.0005086451,0.000014658973,0.011472807,0.9093456,0.022508655,0.011530827,0.0396074,0.00094414246],"about_ca_topic_score_codex":0.0007734538,"about_ca_topic_score_gemma":0.00040283898,"teacher_disagreement_score":0.8104155,"about_ca_system_score_codex":0.000057025092,"about_ca_system_score_gemma":0.000043373973,"threshold_uncertainty_score":0.7916569},"labels":[],"label_agreement":null},{"id":"W3188720331","doi":"10.11606/d.45.2006.tde-20210729-145400","title":"Tempo de espera em centrais de atendimento com classes de clientes","year":2006,"lang":"pt","type":"dissertation","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Centre de Santé et de Services Sociaux Cavendish","funders":"","keywords":"Humanities; Political science; Art","score_opus":0.009312896436662698,"score_gpt":0.25980157572301016,"score_spread":0.25048867928634744,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188720331","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89954495,0.0016897673,0.043594122,0.0010858241,0.0009394138,0.0009360784,0.000042902808,0.0009047415,0.051262215],"genre_scores_gemma":[0.88429326,0.00019846005,0.0020380414,0.0023932108,0.001031888,0.00008083105,0.003894463,0.00024169244,0.10582813],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9958462,0.0001413061,0.0009836834,0.0009593416,0.00053860765,0.0015308203],"domain_scores_gemma":[0.9975957,0.00028493593,0.0009974402,0.0006193158,0.00041437012,0.00008820745],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0010259667,0.00092286855,0.00087144825,0.0007815554,0.00076942577,0.0011665743,0.00079397653,0.0005421344,0.002688547],"category_scores_gemma":[0.00037020867,0.0009654341,0.0006187291,0.0010592889,0.000091508846,0.0012386697,0.00015775359,0.000609646,0.0006901811],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002228472,0.004348875,0.57200915,0.00838859,0.0047242064,0.000828488,0.00518517,0.06441902,0.026701936,0.19383709,0.08793798,0.029391041],"study_design_scores_gemma":[0.007689864,0.00019970836,0.078567125,0.005244843,0.016138924,0.000053429445,0.09534428,0.38214275,0.022733035,0.08903188,0.29147705,0.011377121],"about_ca_topic_score_codex":0.0037628936,"about_ca_topic_score_gemma":0.003306578,"teacher_disagreement_score":0.493442,"about_ca_system_score_codex":0.00063415256,"about_ca_system_score_gemma":0.00019007371,"threshold_uncertainty_score":0.9998703},"labels":[],"label_agreement":null},{"id":"W3188800301","doi":"10.1214/21-ejs1875","title":"Noncausal counting processes: A queuing perspective","year":2021,"lang":"en","type":"article","venue":"Electronic Journal of Statistics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Université Paris 13; Agence Nationale de la Recherche","keywords":"Mathematics; Counting process; Markov process; Simple (philosophy); Queueing theory; Stochastic process; Process (computing); Affine transformation; Interpretation (philosophy); Applied mathematics; Statistics; Computer science; Pure mathematics","score_opus":0.00782399592962981,"score_gpt":0.2496440788880564,"score_spread":0.24182008295842658,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3188800301","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.04830612,0.004569937,0.9362887,0.0012492314,0.0004326201,0.00010816595,0.00001225663,0.000067527384,0.008965432],"genre_scores_gemma":[0.9914538,0.00021295215,0.0058904747,0.00063035806,0.0014281427,0.0000014873144,0.000009806765,0.000040056817,0.00033291976],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9984641,0.000024184399,0.00045407526,0.00017915324,0.00038910803,0.00048940134],"domain_scores_gemma":[0.9960587,0.000231888,0.0008015049,0.0001302794,0.0027618236,0.000015811762],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00072771026,0.00015915249,0.00031658396,0.0002008929,0.0001735367,0.00020445535,0.00021512288,0.00004067423,0.00018782228],"category_scores_gemma":[0.0030785364,0.00015506287,0.00007667021,0.000840292,0.00005582636,0.00090557017,0.00006703846,0.0005150306,0.000035361638],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008612267,0.00011334801,0.0008740495,0.00017785613,0.00031718877,0.0003502908,0.00026142978,0.0024019347,0.0007714548,0.9913766,0.00097470003,0.0022950256],"study_design_scores_gemma":[0.0011272223,0.00007949678,0.00019724437,0.00024755608,0.0007618959,0.0003143809,0.006657689,0.0055826823,0.00059550547,0.95274276,0.031220559,0.00047300634],"about_ca_topic_score_codex":0.000031891588,"about_ca_topic_score_gemma":0.0002553067,"teacher_disagreement_score":0.94314766,"about_ca_system_score_codex":0.0003418831,"about_ca_system_score_gemma":0.00076839136,"threshold_uncertainty_score":0.63232803},"labels":[],"label_agreement":null},{"id":"W3191625415","doi":"10.1111/poms.13555","title":"Pricing in Service Systems with Rational Balking and Abandonment of Time‐Sensitive Customers","year":2021,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Abandonment (legal); Service (business); Service provider; Revenue; Queueing theory; Business; Dynamic pricing; Computer science; Marketing; Finance; Computer network","score_opus":0.006579050922133755,"score_gpt":0.20106498482838933,"score_spread":0.19448593390625557,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3191625415","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9797232,0.00022925137,0.007404491,0.003069768,0.00017369555,0.00066473964,0.0000013481739,0.000053867174,0.008679617],"genre_scores_gemma":[0.9974986,0.000095060415,0.0010664477,0.00028551856,0.000108747496,0.00003215393,0.000024933603,0.000008782609,0.0008798042],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992961,0.000021524509,0.00018460321,0.00027039484,0.0001392633,0.00008807555],"domain_scores_gemma":[0.9996554,0.000012867222,0.00006620982,0.00011684899,0.00014214522,0.0000065121876],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00029313104,0.00008878523,0.00012886501,0.00021381334,0.00015157188,0.000113283626,0.000025730089,0.000013747443,0.000019024033],"category_scores_gemma":[0.00003629745,0.000081832004,0.000010134224,0.00057275593,0.000029987525,0.0005956763,0.000071187664,0.000045165893,0.0000072124694],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009804587,0.00020003677,0.0040045115,0.0008053947,0.00024849287,0.000027933513,0.000872916,0.88831365,0.004007806,0.09575814,0.00007884681,0.0055842404],"study_design_scores_gemma":[0.003568948,0.00004887982,0.033754446,0.0016663631,0.0011559726,0.00008438916,0.027499901,0.90194684,0.0055300947,0.0012862347,0.022058727,0.0013992186],"about_ca_topic_score_codex":0.00010053342,"about_ca_topic_score_gemma":0.0002783213,"teacher_disagreement_score":0.09447191,"about_ca_system_score_codex":0.000027900376,"about_ca_system_score_gemma":0.000006914682,"threshold_uncertainty_score":0.33370125},"labels":[],"label_agreement":null},{"id":"W3192225829","doi":"10.1287/msom.2022.1130","title":"Privacy Management in Service Systems","year":2022,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":30,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Labex Ecodec; Agence Nationale de la Recherche","keywords":"Service provider; Stylized fact; Service level objective; Business; Service (business); Incentive; Personally identifiable information; Service guarantee; Control (management); Service design; Marketing; Computer science; Computer security; Economics; Microeconomics","score_opus":0.014654837281926056,"score_gpt":0.22702277235196405,"score_spread":0.21236793507003798,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3192225829","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8687505,0.00018074596,0.004371088,0.011363862,0.0016585072,0.0038393827,0.00001765546,0.0010183917,0.10879986],"genre_scores_gemma":[0.980469,0.000019605424,0.0013385435,0.011859538,0.0002878259,0.0015197779,0.00024827887,0.000092330505,0.004165113],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.99703044,0.000081752274,0.000688045,0.00084591046,0.00072070316,0.00063316687],"domain_scores_gemma":[0.9985699,0.000026068981,0.00018751353,0.0010976285,0.00009115376,0.000027699796],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0008730818,0.00041853733,0.00035849103,0.0012216725,0.0011669522,0.0006925192,0.0012586447,0.000038902876,0.0010245834],"category_scores_gemma":[0.000005425422,0.00047220895,0.000095126146,0.0019930333,0.000015251508,0.0013785942,0.0027473252,0.00034721202,0.00083148014],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000045222514,0.0002614525,0.0001226942,0.0007344756,0.00019403704,0.00015088453,0.00021143243,0.9289127,0.000020987807,0.066236235,0.0004969134,0.0026129365],"study_design_scores_gemma":[0.002730386,0.000019004177,0.0060297977,0.00017057642,0.00061160483,0.000012630833,0.014866477,0.32896218,0.00010592287,0.0064933565,0.63843536,0.0015626928],"about_ca_topic_score_codex":0.0021097872,"about_ca_topic_score_gemma":0.0011064447,"teacher_disagreement_score":0.63793844,"about_ca_system_score_codex":0.00044155982,"about_ca_system_score_gemma":0.000008923996,"threshold_uncertainty_score":0.9999465},"labels":[],"label_agreement":null},{"id":"W3193972510","doi":"10.3390/math9161957","title":"The Stability Analysis of a Double-X Queuing Network Occurring in the Banking Sector","year":2021,"lang":"en","type":"article","venue":"Mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Server; Stability (learning theory); Queueing theory; Queue; Computer science; Independent and identically distributed random variables; Computer network; Service (business); Limit (mathematics); Set (abstract data type); Mathematics; Business; Random variable; Statistics; Marketing","score_opus":0.035883189364255476,"score_gpt":0.2606780283930138,"score_spread":0.22479483902875833,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3193972510","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97143763,0.00028571434,0.014269739,0.00037147803,0.00012174419,0.00022094058,0.0000017220278,0.000057946647,0.013233072],"genre_scores_gemma":[0.9980795,0.0000053525464,0.0013474455,0.00030819073,0.00019752308,0.000017616301,0.0000074245404,0.000014484359,0.000022498505],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99859536,0.000059386122,0.00053534174,0.00020414854,0.00032278453,0.00028296924],"domain_scores_gemma":[0.99770564,0.0010159665,0.00039707916,0.00071641745,0.00015986885,0.0000050427957],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0027819972,0.00014016638,0.0003709454,0.00013191091,0.00028535386,0.00023629663,0.0004329431,0.00003824215,0.00019617379],"category_scores_gemma":[0.00049285515,0.00008783759,0.00024174427,0.0036170096,0.00007129854,0.00026232345,0.00020253283,0.00017475552,0.000008417969],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000049964197,0.00027807895,0.04722869,0.00056679937,0.0011934005,0.000026324928,0.003517321,0.17045356,0.00023120198,0.77522534,0.00012754029,0.001101785],"study_design_scores_gemma":[0.0005846444,0.000004147632,0.0036517428,0.00026138956,0.003252316,0.0000023168684,0.012854267,0.648408,0.00023617376,0.3260107,0.0043113525,0.00042297988],"about_ca_topic_score_codex":0.000056660538,"about_ca_topic_score_gemma":0.0014739281,"teacher_disagreement_score":0.47795442,"about_ca_system_score_codex":0.000034759483,"about_ca_system_score_gemma":0.000015705797,"threshold_uncertainty_score":0.35819128},"labels":[],"label_agreement":null},{"id":"W3198182256","doi":"10.2139/ssrn.3648442","title":"Optimal Capacity Planning for Cloud Service Providers with Periodic, Time-Varying Demand","year":2020,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Cloud computing; Service provider; Business; On demand; Service (business); Capacity planning; Computer science; Process management; Operations management; Marketing; Economics; Commerce","score_opus":0.013764281085123294,"score_gpt":0.2208925821933649,"score_spread":0.20712830110824162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3198182256","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.73661345,0.00044613093,0.25488257,0.006707802,0.000076857585,0.00034932632,0.0000018981107,0.00018087192,0.00074110355],"genre_scores_gemma":[0.9918582,0.000015241239,0.001914693,0.0037060895,0.0022637534,0.000015643922,0.000014529137,0.00006689075,0.0001449977],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9975417,0.000023923058,0.00028242293,0.00032599515,0.0002516567,0.001574253],"domain_scores_gemma":[0.999179,0.000060979895,0.0003752351,0.00012878627,0.00021705312,0.00003894664],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010144352,0.00024904028,0.00030768712,0.00012232871,0.00067930674,0.00034096048,0.0003523141,0.000060286722,0.00005281783],"category_scores_gemma":[0.00015913836,0.00021178207,0.00012681264,0.00049135805,0.000047187736,0.0013856392,0.00006882803,0.0010055695,0.000067069246],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.006235942,0.00018981248,0.0068837325,0.0008131379,0.0027510137,0.00007121279,0.0032793889,0.8392637,0.008250041,0.12417018,0.0013089016,0.0067829816],"study_design_scores_gemma":[0.009477339,0.0008233481,0.00013618973,0.000471581,0.0024318625,0.0004824386,0.015411802,0.7337691,0.000636899,0.18821682,0.04555386,0.0025887436],"about_ca_topic_score_codex":0.000037086636,"about_ca_topic_score_gemma":0.00006605819,"teacher_disagreement_score":0.25524473,"about_ca_system_score_codex":0.00021030927,"about_ca_system_score_gemma":0.00031849756,"threshold_uncertainty_score":0.8636222},"labels":[],"label_agreement":null},{"id":"W3201933521","doi":"10.2139/ssrn.3884601","title":"A Dynamic Model for Managing Volunteer Engagement","year":2021,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Volunteer; Business; Psychology","score_opus":0.01094071719296991,"score_gpt":0.24627972273790133,"score_spread":0.23533900554493142,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3201933521","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03376205,0.001237989,0.9593591,0.0025727658,0.00019567995,0.00013433506,0.0000012472909,0.000090264155,0.002646581],"genre_scores_gemma":[0.984293,0.00042355803,0.0023512798,0.0012577219,0.00047050611,0.00002110987,0.0000227417,0.000058374902,0.011101748],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9974784,0.000021788837,0.0002924597,0.00029058804,0.00022457294,0.0016921359],"domain_scores_gemma":[0.9992166,0.0000438907,0.00022773002,0.00023295301,0.00026501695,0.0000137808465],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0020249707,0.00018347078,0.00021569815,0.00022453736,0.0005046874,0.00022679126,0.00028058846,0.00004288953,0.000066125715],"category_scores_gemma":[0.00020166702,0.0001823354,0.00025011203,0.00036479923,0.000023283208,0.00082667987,0.00012613265,0.00090246246,0.00005419585],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063957494,0.000065022046,0.00010814972,0.000043387252,0.00032604733,0.000010806806,0.000049817536,0.07884183,0.0005804949,0.8995422,0.0001789313,0.020189356],"study_design_scores_gemma":[0.00033208093,0.0000049585797,0.000005013346,0.000014416571,0.0001366033,0.000018815368,0.00069617736,0.47181866,0.000005882349,0.5240962,0.0027424316,0.00012875651],"about_ca_topic_score_codex":0.00000987886,"about_ca_topic_score_gemma":0.00074351183,"teacher_disagreement_score":0.9570078,"about_ca_system_score_codex":0.0005860804,"about_ca_system_score_gemma":0.00042999198,"threshold_uncertainty_score":0.7435422},"labels":[],"label_agreement":null},{"id":"W3202062948","doi":"10.3934/jimo.2021168","title":"Explicit results for the distribution of the number of customers served during a busy period for $M^X/PH/1$ queue","year":2021,"lang":"en","type":"article","venue":"Journal of Industrial and Management Optimization","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Erlang (programming language); Erlang distribution; Mathematics; Queue; Poisson distribution; Exponential distribution; Discrete mathematics; Computation; Distribution (mathematics); Applied mathematics; Combinatorics; Computer science; Algorithm; Mathematical analysis; Statistics; Theoretical computer science","score_opus":0.02536153599640972,"score_gpt":0.24841290956322679,"score_spread":0.22305137356681706,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3202062948","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5944587,0.00016442705,0.39325786,0.007846825,0.0014309679,0.0018113733,0.000090451846,0.000022886023,0.0009165221],"genre_scores_gemma":[0.9971553,0.00014264365,0.0014615661,0.00007919303,0.00065846706,0.000022366292,0.000050317212,0.000014180669,0.00041593978],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.998968,0.000025811396,0.0005767727,0.000117754564,0.0001967634,0.000114915696],"domain_scores_gemma":[0.99808437,0.00010388836,0.0011127581,0.00015434822,0.0005364994,0.00000812926],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007351519,0.00009969918,0.00021929736,0.000069262605,0.00020644181,0.00006779992,0.00016795775,0.000057741396,0.000010149573],"category_scores_gemma":[0.000539869,0.00006433897,0.00018371259,0.00049359683,0.000038875565,0.00043334658,0.00011107585,0.00008389763,1.3605069e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022152197,0.0001359725,0.0011079633,0.000383059,0.00056739274,0.0000022348204,0.00010573686,0.95663273,0.00022390393,0.033009034,0.0014544098,0.004162347],"study_design_scores_gemma":[0.06888091,0.00027577017,0.008868863,0.0044730743,0.013624198,0.00006589061,0.02827259,0.7484843,0.015721345,0.017236272,0.092415206,0.0016815398],"about_ca_topic_score_codex":0.000012867944,"about_ca_topic_score_gemma":0.0000055803575,"teacher_disagreement_score":0.40269664,"about_ca_system_score_codex":0.000033001597,"about_ca_system_score_gemma":0.000018722352,"threshold_uncertainty_score":0.2623667},"labels":[],"label_agreement":null},{"id":"W3203248446","doi":"10.1016/j.cor.2021.105564","title":"A simple and efficient computing procedure of the stationary system-length distributions for <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e4202\" altimg=\"si7.svg\"><mml:mrow><mml:mi>G</mml:mi><mml:msup><mml:mrow><mml:mi>I</mml:mi></mml:mrow><mml:mrow><mml:mi>X</mml:mi></mml:mrow></mml:msup><mml:mo>/</mml:mo><mml:mi>D</mml:mi><mml:mo>/</mml:mo><mml:mi>c</mml:mi></mml:mrow></mml:math> and <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" display=\"inline\" id=\"d1e4223\" altimg=\"si625.svg\"><mml:mrow><mml:mi>B</mml:mi><mml:mi>M</mml:mi><mml:mi>A</mml:mi><mml:mi>P</mml:mi><mml:mo>/</mml:mo><mml:mi>D</mml:mi><mml:mo>/</mml:mo><mml:mi>c</mml:mi></mml:mrow></mml:math> queues","year":2021,"lang":"lv","type":"article","venue":"Computers & Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Scalable Vector Graphics; Simple (philosophy); Computer science; Algorithm; Mathematics; World Wide Web","score_opus":0.02077994021901275,"score_gpt":0.2674691868193529,"score_spread":0.24668924660034014,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203248446","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.64465976,0.006724262,0.009494582,0.0037523638,0.009988624,0.0004651451,0.0036862749,0.0016684267,0.31956056],"genre_scores_gemma":[0.9513751,0.004258762,0.007919914,0.004067911,0.008579839,0.0076133283,0.011401033,0.0040732925,0.00071076746],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.95873976,0.0030704883,0.008553393,0.0083935065,0.0108420355,0.010400804],"domain_scores_gemma":[0.96754766,0.009020455,0.008330818,0.00856864,0.0020189844,0.0045134216],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","open_science","research_integrity","insufficient_payload"],"category_scores_codex":[0.010423584,0.0042522326,0.001779238,0.0037139973,0.012091739,0.0101554375,0.010333565,0.008659852,0.3292705],"category_scores_gemma":[0.010852882,0.008308773,0.007510016,0.00808304,0.008958402,0.0074451137,0.012708852,0.00828602,0.0049125254],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0047222883,0.0016762827,0.00006235595,0.0060991724,0.00707349,0.0038489508,0.0045869537,0.023560377,0.0038380066,0.5535982,0.38681293,0.0041209804],"study_design_scores_gemma":[0.007895977,0.004754489,0.00018159326,0.0065176673,0.007756904,0.005866005,0.011614757,0.13393328,0.8005298,0.002353144,0.011088418,0.0075079678],"about_ca_topic_score_codex":0.008409946,"about_ca_topic_score_gemma":0.008187056,"teacher_disagreement_score":0.7966918,"about_ca_system_score_codex":0.00016419547,"about_ca_system_score_gemma":0.008462574,"threshold_uncertainty_score":0.99819314},"labels":[],"label_agreement":null},{"id":"W3203250920","doi":"10.18280/isi.260403","title":"Optimal Control Policy for a Two-Phase M/M/1 Unreliable Gated Queue under N-Policy with a Fuzzy Environment","year":2021,"lang":"en","type":"article","venue":"Ingénierie des systèmes d information","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Mathematical optimization; Probabilistic logic; Queue; Queueing theory; Interval (graph theory); Fuzzy number; Computer science; Fuzzy logic; Parametric statistics; Mathematics; Fuzzy set; Statistics","score_opus":0.009852947967120199,"score_gpt":0.24538789722367604,"score_spread":0.23553494925655585,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3203250920","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.10210713,0.00006331958,0.8839189,0.00101861,0.000094790725,0.0007779228,0.000052830583,0.00029747243,0.011669046],"genre_scores_gemma":[0.9883748,0.000008145849,0.0069270646,0.0030760465,0.00063995837,0.00017004811,0.0004623006,0.00003751805,0.0003041007],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984473,0.000026373666,0.0005586955,0.00021943997,0.0002684453,0.00047973596],"domain_scores_gemma":[0.9986317,0.00009454091,0.0005167912,0.00035640298,0.00036484626,0.0000356853],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040116583,0.00028087496,0.00034911957,0.00057262345,0.00043020974,0.0005173434,0.00018004735,0.00008249742,0.00009345676],"category_scores_gemma":[0.0005082121,0.00025970867,0.00012425901,0.000991964,0.00013424295,0.004701423,0.000067672016,0.00011305469,0.00019600906],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000745849,0.000120387675,0.0001011735,0.00046094062,0.00029854634,0.0000094044335,0.00042678317,0.6953948,0.0016245126,0.2872754,0.00028911798,0.013253056],"study_design_scores_gemma":[0.026019204,0.00029115024,0.00023334031,0.0006428371,0.0009551962,0.00008026165,0.0063430006,0.6343937,0.005266062,0.20782651,0.11598447,0.0019642538],"about_ca_topic_score_codex":0.0004111394,"about_ca_topic_score_gemma":0.000024154908,"teacher_disagreement_score":0.88626766,"about_ca_system_score_codex":0.0004565677,"about_ca_system_score_gemma":0.00019887985,"threshold_uncertainty_score":0.9999855},"labels":[],"label_agreement":null},{"id":"W3209973166","doi":"10.1080/00207543.2021.1992529","title":"Efficiency-quality trade-off in allocating resource to public healthcare systems","year":2021,"lang":"en","type":"article","venue":"International Journal of Production Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":21,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Central University of Finance and Economics; National Natural Science Foundation of China","keywords":"Queueing theory; Reimbursement; Robustness (evolution); Social Welfare; Resource allocation; Public hospital; Operations management; Business; Service quality; Quality (philosophy); Resource (disambiguation); Health care; Service (business); Operations research; Microeconomics; Computer science; Economics; Medicine; Nursing; Engineering; Marketing","score_opus":0.1286551049390674,"score_gpt":0.42506144117299033,"score_spread":0.29640633623392293,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3209973166","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80839014,0.0008074081,0.0016083512,0.18542778,0.0018437825,0.0002076995,0.0000017136466,0.000029527908,0.0016836108],"genre_scores_gemma":[0.99540216,0.000025623678,0.00021340356,0.00051953783,0.0033319164,0.0000059956346,0.000007683274,0.0000151425575,0.00047851942],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9965472,0.00036885808,0.0007620798,0.00031107714,0.0017050687,0.00030567255],"domain_scores_gemma":[0.9958826,0.00019509096,0.0003694854,0.00023547467,0.0032784627,0.000038934584],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.009107981,0.00009167716,0.00021190381,0.0014399021,0.00015794179,0.0004457,0.00060073816,0.000045446683,0.00006186708],"category_scores_gemma":[0.009271261,0.00008856442,0.00008484164,0.0018953743,0.0000607851,0.00096056063,0.00022446521,0.0005945025,0.000043115844],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019141914,0.0022919327,0.05839527,0.0008719514,0.00064918393,0.0012797506,0.0028246143,0.29688123,0.04964072,0.34881407,0.020177092,0.21626],"study_design_scores_gemma":[0.0021515125,0.00013124681,0.03205578,0.0019690515,0.00004226995,0.0006056083,0.040599287,0.01119522,0.004796152,0.024912806,0.8806715,0.0008695667],"about_ca_topic_score_codex":0.00014270238,"about_ca_topic_score_gemma":0.0001555462,"teacher_disagreement_score":0.86049443,"about_ca_system_score_codex":0.00038328464,"about_ca_system_score_gemma":0.00018246002,"threshold_uncertainty_score":0.99907404},"labels":[],"label_agreement":null},{"id":"W3211149318","doi":"","title":"Congestion-Based Leadtime Quotation and Pricing for Revenue Maximization with Heterogeneous Customers","year":2013,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Revenue management; Revenue; Incentive; Queueing theory; Business; Maximization; Resource (disambiguation); Regular polygon; Microeconomics; Computer science; Operations research; Industrial organization; Economics; Mathematics; Computer network; Finance","score_opus":0.00900424276740041,"score_gpt":0.2059209342990879,"score_spread":0.19691669153168748,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211149318","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.653604,0.000025816875,0.34321544,0.0011125467,0.000051574276,0.00074288505,0.0000017856623,0.00016913807,0.0010768558],"genre_scores_gemma":[0.9931755,8.3141623e-7,0.005161457,0.00093572633,0.00009341055,0.000069531554,0.000042450545,0.00001951077,0.0005015481],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99953467,0.000005917886,0.000108934226,0.00016435292,0.00007206777,0.000114046205],"domain_scores_gemma":[0.9995394,0.00006738633,0.00012296424,0.00009130366,0.00017189322,0.0000070969945],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000103896884,0.00008777034,0.00009713956,0.00013072728,0.00012927158,0.000117538424,0.000040892057,0.000025423118,0.00008073269],"category_scores_gemma":[0.000082882136,0.00007322139,0.000020832631,0.00019781009,0.000032667496,0.0006033419,0.000010295571,0.000026430593,0.000045743458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001819854,0.00006254249,0.011569894,0.00036686266,0.000096933996,0.000002747477,0.000062845735,0.93461317,0.0034158186,0.017050784,0.0008322047,0.031744216],"study_design_scores_gemma":[0.0010274332,0.000030676547,0.0015469465,0.00006979566,0.00018873566,0.0000018884248,0.00013930393,0.9858452,0.0006365743,0.0071907076,0.0029999597,0.00032279207],"about_ca_topic_score_codex":0.00014619998,"about_ca_topic_score_gemma":0.000071013885,"teacher_disagreement_score":0.3395716,"about_ca_system_score_codex":0.000016560527,"about_ca_system_score_gemma":0.0000053415433,"threshold_uncertainty_score":0.29858816},"labels":[],"label_agreement":null},{"id":"W3211421087","doi":"10.1111/poms.13605","title":"A <i>c</i> / <i>μ</i> ‐Rule for Job Assignment in Heterogeneous Group‐Server Queues","year":2021,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Basic and Applied Basic Research Foundation of Guangdong Province; Guangdong Province Key Laboratory of Computational Science; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Computer science; Queue; Server; Holding cost; Mathematical optimization; Polling system; Scheduling (production processes); Distributed computing; Computer network; Mathematics","score_opus":0.013648274898173652,"score_gpt":0.2355736320344594,"score_spread":0.22192535713628575,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3211421087","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84796816,0.002046109,0.0968101,0.029185137,0.0025724273,0.0037409272,0.000010587883,0.00059203623,0.017074514],"genre_scores_gemma":[0.9869132,0.00018688595,0.0040694843,0.0026940955,0.0005525441,0.00046281947,0.000065961474,0.000027129032,0.0050278506],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989309,0.000020945383,0.00025625151,0.0004702264,0.00013427193,0.00018745453],"domain_scores_gemma":[0.999547,0.0000098072305,0.00004791672,0.0002707894,0.00011380869,0.000010678736],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003751266,0.00013839928,0.00015341799,0.00019443165,0.00028273065,0.00027229005,0.00007809121,0.000026616945,0.0000873092],"category_scores_gemma":[0.00008352173,0.00014143731,0.00005578535,0.0004449282,0.000029459183,0.00073917204,0.00013403,0.00005584906,0.000030109803],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000150538,0.0010061857,0.0041612866,0.0009263087,0.0003552605,0.00006246726,0.00022971515,0.40351853,0.0044181542,0.53966177,0.004878213,0.040631596],"study_design_scores_gemma":[0.004404692,0.00007740717,0.0052107223,0.00047208235,0.0011192091,0.00004140638,0.0044835373,0.097452536,0.008119201,0.09097429,0.7853475,0.0022973628],"about_ca_topic_score_codex":0.00003684958,"about_ca_topic_score_gemma":0.0010735616,"teacher_disagreement_score":0.78046936,"about_ca_system_score_codex":0.000050726198,"about_ca_system_score_gemma":0.000005124236,"threshold_uncertainty_score":0.5767646},"labels":[],"label_agreement":null},{"id":"W3212072780","doi":"10.2139/ssrn.3946696","title":"Waiting-Time Prediction with Invisible Customers","year":2021,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Business; Marketing; Computer science; Advertising; Artificial intelligence; Psychology","score_opus":0.004559730559088874,"score_gpt":0.19432891248167536,"score_spread":0.1897691819225865,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212072780","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95129937,0.0011642214,0.011918239,0.0028777323,0.00025850968,0.00013250642,0.0000017772991,0.00031890298,0.03202876],"genre_scores_gemma":[0.99272376,0.0001962505,0.00008405313,0.00056799623,0.0012946699,0.0000035573278,0.000022519787,0.00004151962,0.005065699],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978691,0.000026797461,0.00023000983,0.00024057424,0.00029574605,0.0013377763],"domain_scores_gemma":[0.9992671,0.000027810209,0.00024914145,0.00018301207,0.00025615786,0.00001678415],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010468261,0.00015979835,0.00018942355,0.0002257764,0.00037264047,0.00021963168,0.00017770061,0.00004864293,0.00024554928],"category_scores_gemma":[0.00011961797,0.00013702622,0.00010398416,0.0008198089,0.000043129403,0.0013024358,0.0000584896,0.0009921464,0.00031703655],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00035473154,0.00024072772,0.008782896,0.000062422056,0.0012895315,0.00014628569,0.00006985056,0.03199773,0.006409336,0.91216785,0.0012050505,0.037273575],"study_design_scores_gemma":[0.0032083585,0.0001699823,0.00045061015,0.00023561988,0.0012190007,0.0014502138,0.0057759047,0.056697752,0.0008873757,0.8529836,0.07585422,0.001067344],"about_ca_topic_score_codex":0.000025461815,"about_ca_topic_score_gemma":0.00020286148,"teacher_disagreement_score":0.07464917,"about_ca_system_score_codex":0.0003540849,"about_ca_system_score_gemma":0.00045270554,"threshold_uncertainty_score":0.55877674},"labels":[],"label_agreement":null},{"id":"W3212830482","doi":"10.1287/stsy.2023.0110","title":"Jumping Fluid Models and Delay Stability of Max-Weight Dynamics Under Heavy-Tailed Traffic","year":2023,"lang":"en","type":"article","venue":"Stochastic Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Queue; Jumping; Queueing theory; Context (archaeology); Mathematics; Bounded function; Processor sharing; Control theory (sociology); Instability; Applied mathematics; Computer science; Statistical physics; Physics; Mathematical analysis; Statistics; Mechanics","score_opus":0.025712926119399196,"score_gpt":0.23603816368401204,"score_spread":0.21032523756461285,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3212830482","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6483481,0.00020586829,0.34976804,0.000106027146,0.0004370883,0.00037539555,0.000014223163,0.00028852624,0.0004567334],"genre_scores_gemma":[0.9993635,0.0000037530992,0.000045116914,0.00003939318,0.00028561338,0.00004128469,0.000050876188,0.000044898814,0.0001256112],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99831176,0.00003979235,0.0005377178,0.0004298693,0.0003200462,0.00036081296],"domain_scores_gemma":[0.99881566,0.00025892063,0.0002938964,0.00041464597,0.00019187646,0.000025002217],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00094359677,0.00023159078,0.00048950716,0.00038381302,0.00018374117,0.00010167164,0.00020413545,0.00009098525,0.00002244744],"category_scores_gemma":[0.00016073533,0.00021677288,0.00010349685,0.0009950112,0.0001277333,0.0006028523,0.00015677177,0.00011034947,0.000053708798],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006650404,0.000029176372,0.00014732675,0.00051313924,0.000095690455,0.0000047399085,0.00013518675,0.9204536,0.00019080163,0.07791122,0.00004728289,0.00040530847],"study_design_scores_gemma":[0.00034417285,0.000008689279,0.000056969744,0.0001736036,0.00013761467,0.0000033548602,0.0020305617,0.98396105,0.0000042125093,0.013035199,0.000020308937,0.00022427192],"about_ca_topic_score_codex":0.00019355542,"about_ca_topic_score_gemma":0.0001221764,"teacher_disagreement_score":0.35101536,"about_ca_system_score_codex":0.00009411973,"about_ca_system_score_gemma":0.000021882677,"threshold_uncertainty_score":0.88397413},"labels":[],"label_agreement":null},{"id":"W3217601300","doi":"10.1007/978-3-030-91825-5_24","title":"A Short Note on the System-Length Distribution in a Finite-Buffer $$GI^X/C$$-MSP/1/N Queue Using Roots","year":2021,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markovian arrival process; Computer science; Queue; Markov chain; Queueing theory; Markov process; Stationary distribution; Buffer (optical fiber); Distribution (mathematics); Queueing system; Exponential distribution; Mathematical optimization; Algorithm; Applied mathematics; Mathematics; Computer network; Statistics; Mathematical analysis; Telecommunications","score_opus":0.020293249713014192,"score_gpt":0.24510655534773584,"score_spread":0.22481330563472166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W3217601300","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008020912,0.00012508535,0.9873099,0.0005638171,0.0009620996,0.00044312136,0.000011962735,0.000112923655,0.002450201],"genre_scores_gemma":[0.9943829,0.0000058808855,0.002663171,0.0014926563,0.0012332245,0.000012568029,0.000061075305,0.00005052119,0.0000980094],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99683475,0.000047981182,0.0005734731,0.00116159,0.00080045185,0.00058174826],"domain_scores_gemma":[0.9975648,0.00083685736,0.00032415814,0.0009781563,0.00027172687,0.0000243328],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0015485594,0.00054361066,0.0006109047,0.0007137536,0.0004374154,0.00064230454,0.0011100924,0.00027716867,0.000040675677],"category_scores_gemma":[0.00059143064,0.0004205361,0.00019209724,0.0013603971,0.00039219687,0.0006197109,0.0007588162,0.00096880493,0.000046791214],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044562697,0.00004935327,0.00034001266,0.00022891602,0.000031538755,0.00029923813,0.00009213825,0.77763444,0.00017398677,0.15731007,0.000010951976,0.06378477],"study_design_scores_gemma":[0.00015623876,0.000012693061,0.0002083844,0.0021244804,0.000068487505,0.00001151929,0.0000031085617,0.9652104,0.0001414646,0.03000869,0.0014346632,0.0006199178],"about_ca_topic_score_codex":0.00013705366,"about_ca_topic_score_gemma":0.00045440512,"teacher_disagreement_score":0.986362,"about_ca_system_score_codex":0.00072046625,"about_ca_system_score_gemma":0.00013213287,"threshold_uncertainty_score":0.99982464},"labels":[],"label_agreement":null},{"id":"W4210247895","doi":"10.1007/s11134-021-09727-6","title":"The kernel method tail asymptotics analytic approach for stationary probabilities of two-dimensional queueing systems","year":2022,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Mathematics; Random walk; Kernel (algebra); Applied mathematics; Statistical physics; Layered queueing network; Discrete mathematics; Statistics; Physics","score_opus":0.021272547729382696,"score_gpt":0.2648443889072882,"score_spread":0.24357184117790548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210247895","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23609048,0.008963697,0.7256966,0.0009178731,0.005989207,0.008868503,0.00024028537,0.0011959168,0.012037437],"genre_scores_gemma":[0.99122393,0.0000014473377,0.004047418,0.00012028655,0.0007732295,0.0008244389,0.00014154536,0.00008400864,0.0027836903],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99674207,0.00036952773,0.0010344646,0.00055511825,0.0008141763,0.00048463358],"domain_scores_gemma":[0.99626964,0.0014395851,0.001129993,0.0006162566,0.00052209373,0.000022402046],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.005053149,0.00030888806,0.0006215208,0.00035185344,0.0014278191,0.00032355063,0.00059521105,0.00005530068,0.000014857616],"category_scores_gemma":[0.00046856332,0.000254878,0.00027143004,0.00086379313,0.00012394678,0.00061690836,0.00034553488,0.000253816,0.000005893739],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006457428,0.000053861004,0.00067142554,0.0007831167,0.00020360683,0.0000019623033,0.0001429049,0.67685795,0.00016574396,0.32044047,0.00041111832,0.00020328915],"study_design_scores_gemma":[0.0005147649,0.00002780723,0.000024171592,0.00009885394,0.0002632907,0.000013365009,0.010004954,0.96918845,0.000014494776,0.011833679,0.007695583,0.000320605],"about_ca_topic_score_codex":0.0018025836,"about_ca_topic_score_gemma":0.000026013815,"teacher_disagreement_score":0.75513345,"about_ca_system_score_codex":0.00021742402,"about_ca_system_score_gemma":0.00010178379,"threshold_uncertainty_score":0.99999034},"labels":[],"label_agreement":null},{"id":"W4210372782","doi":"10.1287/ijoc.2021.1141","title":"Algorithms for Queueing Systems with Reneging and Priorities Modeled as Quasi-Birth-Death Processes","year":2022,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta; Ontario Tech University","funders":"","keywords":"Queueing theory; Computer science; Upper and lower bounds; Range (aeronautics); Markov process; Markov decision process; Mathematical optimization; Process (computing); Algorithm; Birth–death process; Queueing system; Mathematics; Statistics; Population","score_opus":0.02012476685137463,"score_gpt":0.2515923239873354,"score_spread":0.23146755713596076,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210372782","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82147956,0.0005876992,0.1745941,0.00041395935,0.0005008353,0.00048805607,0.0000039979254,0.00025459763,0.0016772179],"genre_scores_gemma":[0.99520063,0.000016306161,0.0024451895,0.0008328735,0.0012108404,0.000023569733,0.0000063166376,0.000049600807,0.0002146898],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99833965,0.000017999433,0.0004966108,0.00024665412,0.00047665008,0.0004224052],"domain_scores_gemma":[0.9983818,0.00027590603,0.0008150335,0.00014409093,0.00035262696,0.00003055531],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0012562267,0.000248838,0.00037565414,0.0004702184,0.002056412,0.0009961656,0.0002829183,0.000030872,0.0000100002235],"category_scores_gemma":[0.00023901857,0.00019754168,0.00007750635,0.0005153793,0.000035444034,0.0015978054,0.00022264688,0.00042188505,0.0000029168018],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043053395,0.00005025714,0.003167416,0.00076660025,0.0001937129,0.000054087293,0.00071122765,0.93396986,0.000018635235,0.036090408,0.000071985014,0.024475278],"study_design_scores_gemma":[0.0011879599,0.0002691001,0.00005589112,0.0005879377,0.0001093165,0.00023393291,0.006766239,0.9586131,0.000018609764,0.011458915,0.020176196,0.00052281824],"about_ca_topic_score_codex":0.000076074786,"about_ca_topic_score_gemma":0.000003761601,"teacher_disagreement_score":0.17372109,"about_ca_system_score_codex":0.00012659428,"about_ca_system_score_gemma":0.00007686609,"threshold_uncertainty_score":0.9992428},"labels":[],"label_agreement":null},{"id":"W4210400653","doi":"10.1090/fic/028/01","title":"Predicting response times in processor-sharing queues","year":2000,"lang":"en","type":"other","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":17,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Queue; Computer science; Parallel computing; Computer network","score_opus":0.009403626398971923,"score_gpt":0.2378715168764652,"score_spread":0.22846789047749327,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210400653","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0037901157,0.00027617224,0.000071239716,0.00015563115,0.00008415544,0.00023519735,0.0000027734138,0.0010856516,0.99429905],"genre_scores_gemma":[0.025265565,0.000027641781,0.00025957488,0.0006391608,0.0012502348,0.000040849005,0.00004141251,0.00055108534,0.9719245],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9984962,0.000022749653,0.0003318082,0.0005729126,0.0002187366,0.00035759003],"domain_scores_gemma":[0.9991697,0.00007252366,0.0003129595,0.00041479818,0.00002045326,0.00000954328],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00053331326,0.00033922205,0.0004185235,0.0012802924,0.00006646694,0.00018603909,0.0004504394,0.00021388708,0.015455223],"category_scores_gemma":[0.0002480694,0.00031810268,0.000094016024,0.0008016844,0.000048411286,0.00050431886,0.00018624972,0.00026088153,0.0010285155],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004865723,0.0007731541,0.08674439,0.0046325265,0.0010728638,0.00066668366,0.0004902311,0.011451143,0.00040161939,0.04591863,0.8081961,0.034786932],"study_design_scores_gemma":[0.00048604043,0.000005337074,0.00019707807,0.001262143,0.00012952597,0.0000014617463,0.00017940995,0.011818519,0.000019695004,0.008826236,0.9763094,0.0007651419],"about_ca_topic_score_codex":0.0010346486,"about_ca_topic_score_gemma":0.0015984651,"teacher_disagreement_score":0.1681133,"about_ca_system_score_codex":0.000031776173,"about_ca_system_score_gemma":0.000017613813,"threshold_uncertainty_score":0.9999271},"labels":[],"label_agreement":null},{"id":"W4210744263","doi":"10.1145/384268.378788","title":"Controlling the robots of Web search engines","year":2001,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Robot; Queueing theory; Queue; Search engine indexing; Function (biology); Distributed computing; Mathematical optimization; Computer network; Artificial intelligence; Mathematics","score_opus":0.07701152118727869,"score_gpt":0.3322626155373008,"score_spread":0.25525109435002213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210744263","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7374016,0.22915545,0.0064709424,0.007748147,0.00070428586,0.003144798,0.0000025647912,0.00021463342,0.015157599],"genre_scores_gemma":[0.9338644,0.06312603,0.00037717939,0.0019795727,0.00040502782,0.00007652401,0.000025129139,0.000020818381,0.00012532086],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99791336,0.00008447963,0.00057910447,0.00023072073,0.0009482247,0.0002441149],"domain_scores_gemma":[0.9970995,0.0004908587,0.00045456257,0.00077814626,0.0011662912,0.000010644707],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0078570675,0.00016630084,0.00038743086,0.0005050345,0.00022124566,0.00006174348,0.000682898,0.000039451836,0.00079726585],"category_scores_gemma":[0.006579752,0.00011402851,0.00015181281,0.005100194,0.00005855433,0.0009517884,0.00017348911,0.0001672926,0.0002703387],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000044929515,0.00009267278,0.018791666,0.0029355835,0.00014123316,0.0000014708728,0.00002728513,0.18188803,0.00031290553,0.0056648594,0.0013300338,0.7887693],"study_design_scores_gemma":[0.00073814887,0.000017629796,0.0032702272,0.0013876574,0.0009318965,0.0000032149085,0.00004099873,0.9390947,0.0000803972,0.0012115677,0.052944552,0.00027899267],"about_ca_topic_score_codex":0.000011673236,"about_ca_topic_score_gemma":0.0000036774304,"teacher_disagreement_score":0.78849036,"about_ca_system_score_codex":0.00004780921,"about_ca_system_score_gemma":0.000049970655,"threshold_uncertainty_score":0.8729502},"labels":[],"label_agreement":null},{"id":"W4210880993","doi":"10.1287/stsy.2021.0090","title":"Delay-Join the Shortest Queue Routing for a Parallel Queueing System with Removable Servers","year":2022,"lang":"en","type":"article","venue":"Stochastic Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Server; Computer science; Queue; Routing (electronic design automation); Computer network; Queueing theory; Join (topology); Distributed computing; Mathematics","score_opus":0.014772123894292537,"score_gpt":0.2112885782950862,"score_spread":0.19651645440079368,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4210880993","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03229268,0.00036108156,0.9586339,0.00038021238,0.001194134,0.00235837,0.000022023762,0.0006160311,0.004141545],"genre_scores_gemma":[0.9964546,1.4029995e-7,0.0003095353,0.00023876615,0.0009798339,0.0011021495,0.00004172013,0.00008918395,0.00078406575],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99778783,0.00008167776,0.0005215035,0.0005237012,0.0005140799,0.0005711815],"domain_scores_gemma":[0.9981693,0.0004079924,0.0006127814,0.0005848443,0.0002033243,0.000021753047],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001986471,0.00030479088,0.00045703235,0.00020958479,0.0019852242,0.0003537839,0.0005802592,0.000042648546,0.00002374789],"category_scores_gemma":[0.00018838064,0.00022659075,0.00015328062,0.00089798926,0.00006788869,0.00047781284,0.0002694047,0.00024561211,0.000031849166],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015342855,0.00001877502,0.00018227796,0.0002471943,0.00014416708,0.000023620974,0.00015882814,0.81448287,0.000030481651,0.18415946,0.00029889142,0.00010000083],"study_design_scores_gemma":[0.0007989492,0.000041176674,0.000016037668,0.00031806025,0.00034275747,0.000093724346,0.026528817,0.9663145,6.3189754e-7,0.00060796697,0.004529591,0.00040781483],"about_ca_topic_score_codex":0.002766627,"about_ca_topic_score_gemma":0.00023402348,"teacher_disagreement_score":0.96416193,"about_ca_system_score_codex":0.00030815473,"about_ca_system_score_gemma":0.00005574227,"threshold_uncertainty_score":0.99931407},"labels":[],"label_agreement":null},{"id":"W4213252392","doi":"10.1287/opre.1120.1076","title":"Contributors","year":2012,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.07668920705705379,"score_gpt":0.37988433328914983,"score_spread":0.30319512623209605,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4213252392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.82231355,0.00036508107,0.008156616,0.0043200958,0.00039402558,0.00048090512,0.0000043679242,0.00022078698,0.16374457],"genre_scores_gemma":[0.99325556,0.0000038088378,0.00030324922,0.0003074211,0.0014422764,0.000046908863,0.000027480984,0.000012732437,0.004600544],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.999024,0.000041819527,0.00011281095,0.00011446968,0.00030242265,0.00040449025],"domain_scores_gemma":[0.99926263,0.000076367025,0.00000954859,0.00023738446,0.00039690937,0.000017131699],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0018359295,0.00005822465,0.000077367724,0.00032775235,0.00065797666,0.00026829136,0.00017435002,0.000031393913,0.0016178525],"category_scores_gemma":[0.0009370638,0.000051080377,0.00003411668,0.00095170306,0.00007999146,0.001733327,0.00013926363,0.00018121475,0.0046216724],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000113856695,0.000117303316,0.00630055,0.000011682795,0.000023092229,0.0000016219577,0.00006598695,0.004144823,0.0024682237,0.9779112,0.006327961,0.002616175],"study_design_scores_gemma":[0.00043883978,0.000008133053,0.0034586606,0.00001904855,0.00003553636,0.0000019369852,0.0009564443,0.04835457,0.001033895,0.008406066,0.93696946,0.0003174163],"about_ca_topic_score_codex":0.00024832692,"about_ca_topic_score_gemma":0.00010827711,"teacher_disagreement_score":0.96950513,"about_ca_system_score_codex":0.000043434582,"about_ca_system_score_gemma":0.000014378456,"threshold_uncertainty_score":0.9992948},"labels":[],"label_agreement":null},{"id":"W4220890986","doi":"10.1007/s11134-022-09773-8","title":"Statistical inference for mean-field queueing models","year":2022,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Queueing theory; Statistical inference; Field (mathematics); Inference; Computer science; Econometrics; Statistics; Mathematics; Artificial intelligence","score_opus":0.02795936803819536,"score_gpt":0.2711436432138503,"score_spread":0.24318427517565497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4220890986","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.03152108,0.00025501163,0.95121944,0.00036971815,0.001268405,0.0007352181,0.00002944038,0.000502865,0.0140988],"genre_scores_gemma":[0.99604064,0.0000016025255,0.0008892468,0.00088439457,0.0007930909,0.00040747743,0.00005589914,0.000056010253,0.00087163184],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981646,0.0000625398,0.00047623686,0.00045090087,0.00040897,0.0004367301],"domain_scores_gemma":[0.9984203,0.0007026352,0.00032407543,0.00038591263,0.000146151,0.0000209211],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0011499373,0.00021947702,0.00037307007,0.00028161562,0.0007770142,0.00031551413,0.00042683425,0.00005077436,0.00017783455],"category_scores_gemma":[0.00042971014,0.00023090796,0.00011371884,0.00046017327,0.000029686678,0.001032512,0.00031088904,0.0002491846,0.00004502349],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060249324,0.00003089118,0.00032061775,0.00021699283,0.000046232773,0.000012341051,0.000115051866,0.2306389,0.00018842012,0.7657389,0.0014283125,0.0012030682],"study_design_scores_gemma":[0.00038454647,0.00003302504,0.000010281104,0.00007057347,0.00010349551,0.0000042303536,0.0015225848,0.84772927,0.000023195204,0.11145327,0.03826957,0.00039596148],"about_ca_topic_score_codex":0.0019902193,"about_ca_topic_score_gemma":0.00007931476,"teacher_disagreement_score":0.96451956,"about_ca_system_score_codex":0.00012126824,"about_ca_system_score_gemma":0.000034494347,"threshold_uncertainty_score":0.9416153},"labels":[],"label_agreement":null},{"id":"W4225342150","doi":"10.1111/poms.13728","title":"Increasing social welfare with delays: Strategic customers in the M/G/1 orbit queue","year":2022,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Orbit (dynamics); Service (business); Queue; Unobservable; Queueing theory; Function (biology); Social Welfare; Queueing system; Operations research; Service system; Retrial queue; Business; Computer network; Economics; Marketing; Mathematics; Econometrics","score_opus":0.016636492022166213,"score_gpt":0.22973903817515956,"score_spread":0.21310254615299334,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4225342150","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93031794,0.00006666961,0.00032212827,0.03957607,0.00020250125,0.0008115745,0.0000018309224,0.000116041694,0.028585274],"genre_scores_gemma":[0.99750906,0.000007247265,0.00028062484,0.0011581955,0.0002467881,0.00024298366,0.000038403756,0.000012924317,0.0005037741],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99905586,0.00008425852,0.00016855361,0.0002981378,0.00024405855,0.00014911927],"domain_scores_gemma":[0.9997073,0.000006684579,0.00006352119,0.00017045929,0.000047499816,0.0000045768174],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00094243913,0.00011229636,0.000099971425,0.00030754396,0.0017187559,0.00026297776,0.00014999043,0.000011192348,0.00016920682],"category_scores_gemma":[0.00001926886,0.000086765336,0.000023807937,0.0010431017,0.000053670396,0.0006180266,0.0001320961,0.00016456028,0.0000090523445],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000096572025,0.00015638437,0.0007027773,0.00006094701,0.000060168848,0.00001758961,0.00054020085,0.18517579,0.000026243506,0.80981225,0.00027885262,0.0030722353],"study_design_scores_gemma":[0.002986558,0.00014568871,0.020567967,0.00007435833,0.0013737642,0.00014773676,0.39774576,0.08753972,0.000016474776,0.023355085,0.46407565,0.001971232],"about_ca_topic_score_codex":0.0002998353,"about_ca_topic_score_gemma":0.0006333244,"teacher_disagreement_score":0.7864572,"about_ca_system_score_codex":0.00006183752,"about_ca_system_score_gemma":0.0000064512806,"threshold_uncertainty_score":0.99958086},"labels":[],"label_agreement":null},{"id":"W4226199284","doi":"10.1287/mnsc.2022.4416","title":"Omnichannel Services: The False Premise and Operational Remedies","year":2022,"lang":"en","type":"article","venue":"Management Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":43,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Toronto","funders":"","keywords":"Omnichannel; Service (business); Revenue; Business; Order (exchange); Service provider; Social Welfare; Premise; Channel (broadcasting); Computer science; Marketing; Telecommunications; Finance","score_opus":0.011422828533771464,"score_gpt":0.22473673631098692,"score_spread":0.21331390777721546,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226199284","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80423677,0.0005884818,0.0040256046,0.017800521,0.001287416,0.0014610302,0.00000759198,0.0004798008,0.17011277],"genre_scores_gemma":[0.9904503,0.00001323973,0.00027278275,0.006395461,0.00015283578,0.00010188204,0.0000063610532,0.000008533948,0.002598608],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9985685,0.000014928892,0.00014621513,0.0003872951,0.0006381607,0.0002449435],"domain_scores_gemma":[0.9994637,0.000026955764,0.000103359096,0.00033964642,0.000055961184,0.000010393536],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001677734,0.00010543158,0.00008268848,0.0002445555,0.0022827873,0.00040850314,0.0008449345,0.0000060211355,0.00029233695],"category_scores_gemma":[0.000032177268,0.000079887854,0.000027364897,0.0013165597,0.0003032454,0.0012302494,0.002033241,0.00009055049,0.000044541062],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003888774,0.000077466975,0.004654155,0.00016654641,0.00004868889,0.000020280017,0.00048461076,0.039762914,0.00056377874,0.9452916,0.0017424128,0.0071486966],"study_design_scores_gemma":[0.00064990326,0.00001840434,0.010294221,0.000039086997,0.0002062575,0.0000061496903,0.015513662,0.26779062,0.000064193126,0.12826206,0.5765861,0.0005693302],"about_ca_topic_score_codex":0.000053715325,"about_ca_topic_score_gemma":0.000027863965,"teacher_disagreement_score":0.8170295,"about_ca_system_score_codex":0.000043129865,"about_ca_system_score_gemma":0.000006287355,"threshold_uncertainty_score":0.9990161},"labels":[],"label_agreement":null},{"id":"W4226216023","doi":"10.2139/ssrn.4082217","title":"Customer Scheduling in Large Service Systems Under Model Uncertainty","year":2022,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Scheduling (production processes); Computer science; Customer service; Business; Operations research; Operations management; Service (business); Marketing; Engineering","score_opus":0.011491318068379067,"score_gpt":0.23715241280386076,"score_spread":0.22566109473548168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226216023","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89942944,0.0022409703,0.09091084,0.0023678544,0.00048726928,0.00026682176,0.00000437292,0.00015686078,0.004135547],"genre_scores_gemma":[0.9967595,0.00007505781,0.000038496706,0.0017662502,0.00046234383,0.00002506431,0.000015266456,0.000044785105,0.0008132835],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.996894,0.00007047341,0.00038384658,0.00027254884,0.00042572297,0.0019533918],"domain_scores_gemma":[0.9992806,0.000033278615,0.00032802275,0.0002136357,0.00012920592,0.00001527156],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0038184503,0.00018942512,0.00026144087,0.0005217178,0.0006938514,0.00015025503,0.00049078587,0.000042682073,0.0001584505],"category_scores_gemma":[0.000044731598,0.00019102769,0.000112825954,0.0012834133,0.000013149618,0.0008504421,0.0002721836,0.0022206185,0.00009153251],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000043591477,0.000047442587,0.0003588975,0.000013500799,0.000051323786,0.00000399434,0.000027019416,0.62907887,0.000056001205,0.37012327,0.000011991001,0.00018411434],"study_design_scores_gemma":[0.00062312017,0.0000060774046,0.00001677844,0.000012189465,0.00005741768,0.000035871723,0.0076408377,0.71568125,5.5499714e-7,0.27385977,0.0018676568,0.00019847591],"about_ca_topic_score_codex":0.000419664,"about_ca_topic_score_gemma":0.0021210755,"teacher_disagreement_score":0.09732998,"about_ca_system_score_codex":0.0015367167,"about_ca_system_score_gemma":0.00047881212,"threshold_uncertainty_score":0.96476054},"labels":[],"label_agreement":null},{"id":"W4226364838","doi":"10.1287/moor.2023.0035","title":"Optimal Partition for a Multi-Type Queueing System","year":2025,"lang":"en","type":"preprint","venue":"Mathematics of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Queue; Partition (number theory); Computer science; Probabilistic logic; Queueing theory; Mathematical optimization; Decision maker; Operations research; Computer network; Mathematics; Combinatorics; Artificial intelligence","score_opus":0.17986786123719561,"score_gpt":0.4269801071810111,"score_spread":0.24711224594381548,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4226364838","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.11949578,0.00018664799,0.86738837,0.0006359362,0.00044790376,0.0034609367,0.000097466705,0.00026347698,0.008023468],"genre_scores_gemma":[0.7236526,0.000011970783,0.2707243,0.000027580072,0.00048697385,0.0008931015,0.00030490893,0.000050444643,0.0038481255],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982031,0.000053395615,0.00062949647,0.00036913698,0.00044331682,0.00030152596],"domain_scores_gemma":[0.9964028,0.00028464635,0.00014978227,0.000690431,0.0024600218,0.000012293003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0023805776,0.00019828607,0.00045785675,0.00090997096,0.00040809024,0.00043422377,0.0005520368,0.00017570535,0.00005288486],"category_scores_gemma":[0.0020227507,0.00018697481,0.0001730369,0.00071344257,0.00010642396,0.00033882802,0.0009239298,0.00039937388,0.000060946666],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000027972952,0.00032629704,0.000009140803,0.00960896,0.00014574108,0.0000016167273,0.00026227382,0.49849728,0.0012499808,0.48929054,0.00039402265,0.00018616792],"study_design_scores_gemma":[0.00021134454,0.000011297746,0.0000020293683,0.0012931667,0.0001309647,3.4612174e-7,0.0014681531,0.98671526,0.0009549174,0.008554891,0.000494616,0.0001630372],"about_ca_topic_score_codex":0.00019638897,"about_ca_topic_score_gemma":0.0001708685,"teacher_disagreement_score":0.6041568,"about_ca_system_score_codex":0.00014747331,"about_ca_system_score_gemma":0.00012891187,"threshold_uncertainty_score":0.7624611},"labels":[],"label_agreement":null},{"id":"W4229579902","doi":"10.1145/2637364.2592015","title":"Randomized routing schemes for large processor sharing systems with multiple service rates","year":2014,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Server; Routing (electronic design automation); Computer science; Distributed computing; Scheme (mathematics); Processor sharing; Exponential distribution; Homogeneous; Randomized algorithm; Computer network; Mathematics; Algorithm; Statistics; Queueing theory","score_opus":0.05504016125027736,"score_gpt":0.321331502369024,"score_spread":0.26629134111874664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229579902","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.48254287,0.109168634,0.3701079,0.0049825464,0.0012244987,0.025626883,0.0000140619295,0.001218951,0.0051136795],"genre_scores_gemma":[0.9900787,0.0022045386,0.0022604805,0.0028194454,0.0005488736,0.001724162,0.00020057915,0.000059327653,0.00010393435],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9974196,0.000099873294,0.0008082713,0.0005166449,0.0007458717,0.00040975248],"domain_scores_gemma":[0.99446315,0.0012395994,0.0012024449,0.0007273555,0.0023466905,0.000020758258],"candidate_categories":["metaresearch"],"consensus_categories":[],"category_scores_codex":[0.017186671,0.0003040996,0.00093224394,0.0004633857,0.0004632359,0.00028264223,0.000643968,0.000061760584,0.00006740124],"category_scores_gemma":[0.026774734,0.0002259836,0.00015032562,0.0034628792,0.000023838531,0.0018681259,0.00020896192,0.00014312715,0.0001253726],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.018931165,0.0007616116,0.11213791,0.2246306,0.0019773361,0.0000016143134,0.00034455443,0.13956785,0.00016360532,0.1668471,0.001758001,0.33287865],"study_design_scores_gemma":[0.026628781,0.0000115822,0.00007914327,0.003470694,0.0011444461,8.4461846e-7,0.000034143526,0.94552976,0.000029226565,0.00066165696,0.022070369,0.0003393462],"about_ca_topic_score_codex":0.00001821695,"about_ca_topic_score_gemma":0.000011187041,"teacher_disagreement_score":0.8059619,"about_ca_system_score_codex":0.0000715965,"about_ca_system_score_gemma":0.000039818562,"threshold_uncertainty_score":0.98142314},"labels":[],"label_agreement":null},{"id":"W4229905370","doi":"10.1017/s0021900200020957","title":"Some fluctuation identities for Lévy processes with jumps of the same sign","year":2004,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Concordia University","funders":"","keywords":"Mathematics; Laplace transform; Interval (graph theory); Sign (mathematics); Expression (computer science); Lévy process; Mathematical analysis; Distribution (mathematics); Process (computing); Combinatorics; Applied mathematics","score_opus":0.013946707377682792,"score_gpt":0.222269380582902,"score_spread":0.2083226732052192,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4229905370","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98435843,0.000078534365,0.013651917,0.00068813586,0.00010250133,0.000554072,0.0000022895556,0.00002118798,0.0005429112],"genre_scores_gemma":[0.9954139,0.000005830046,0.0037984212,0.00023538846,0.0004900837,0.0000196358,0.000001509613,0.000013468212,0.000021746691],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989484,0.0000073496285,0.00045991695,0.0001334123,0.00031870714,0.00013222966],"domain_scores_gemma":[0.9979356,0.00012040931,0.0010615526,0.00020461346,0.000669682,0.000008132558],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008862133,0.00011847028,0.00026863368,0.00010324866,0.00013538233,0.00006692648,0.0002969155,0.000037341106,0.000014488247],"category_scores_gemma":[0.000485747,0.000071595125,0.00011687952,0.00044544265,0.00016095697,0.000970343,0.00004928222,0.00011311238,0.0000021830333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0027613253,0.0006814491,0.0030859562,0.004921892,0.00039479166,0.0000017067714,0.0008931375,0.34325933,0.007848283,0.63262177,0.00018015069,0.0033501997],"study_design_scores_gemma":[0.00075140246,0.000030791824,0.0009339772,0.00009683847,0.00022415377,0.0000018823655,0.00030086495,0.000065387496,0.006555275,0.9906536,0.00028751622,0.000098328],"about_ca_topic_score_codex":0.000007971755,"about_ca_topic_score_gemma":0.00005177613,"teacher_disagreement_score":0.3580318,"about_ca_system_score_codex":0.000074188814,"about_ca_system_score_gemma":0.0001401555,"threshold_uncertainty_score":0.29195642},"labels":[],"label_agreement":null},{"id":"W4230425515","doi":"10.1007/978-3-642-11274-4_5065","title":"General Circulation Model","year":2011,"lang":"en","type":"book-chapter","venue":"Encyclopedia of Astrobiology","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Circulation (fluid dynamics); Computer science; Mechanics; Physics","score_opus":0.016841460901211972,"score_gpt":0.21292128448572972,"score_spread":0.19607982358451775,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4230425515","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0020176216,0.00009600349,0.011933283,0.00003775078,0.0003606741,0.0001562401,0.000015750386,0.00008667389,0.985296],"genre_scores_gemma":[0.08583887,0.00031735824,0.008059963,0.0007482739,0.0048824428,0.000026566098,0.0011116529,0.0002449033,0.89877],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987829,0.00000666516,0.00047611192,0.0004030944,0.000093287694,0.00023797435],"domain_scores_gemma":[0.99864936,0.000027465965,0.0007529159,0.00039754144,0.00016207909,0.000010662962],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00017032678,0.00032346073,0.0005367919,0.00037899808,0.00005558112,0.000008890282,0.00030379818,0.00033828057,0.0014660605],"category_scores_gemma":[0.00004086201,0.00032085396,0.00023918734,0.00004640157,0.00016369311,0.0002712709,0.00018828874,0.00024838178,0.00041134222],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042237032,0.000016245956,0.00026100717,0.000055141485,0.00012551558,0.00000412967,0.000017535694,0.012176438,0.00014589162,0.9814335,0.0012034787,0.004518873],"study_design_scores_gemma":[0.0002694365,0.000017189075,0.00012852332,0.000059878694,0.00044279813,0.000002380481,0.0000037713423,0.0069230245,0.0000060872644,0.74365455,0.24795541,0.00053692784],"about_ca_topic_score_codex":0.000028449851,"about_ca_topic_score_gemma":0.000022659939,"teacher_disagreement_score":0.24675192,"about_ca_system_score_codex":0.000027468517,"about_ca_system_score_gemma":0.000029598135,"threshold_uncertainty_score":0.99992436},"labels":[],"label_agreement":null},{"id":"W4231433840","doi":"10.1109/wsc.2004.1371431","title":"Optimal Lot-Sizing with Capacity-Constraints and Auto-Correlated Interarrival Times","year":2005,"lang":"en","type":"article","venue":"Proceedings of the 2004 Winter Simulation Conference, 2004.","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Sizing; Computer science; Capacity planning; Mathematical optimization; Reliability engineering; Parallel computing; Mathematics; Engineering","score_opus":0.014097863031707524,"score_gpt":0.22156162122728323,"score_spread":0.20746375819557572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4231433840","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9735908,0.00003437507,0.008679864,0.000794026,0.00010274659,0.00029570173,0.0000035005494,0.00016435761,0.016334664],"genre_scores_gemma":[0.9963659,8.417091e-7,0.0020706665,0.0003583903,0.00026877818,0.0000065859786,0.0000035512862,0.000029990508,0.00089531543],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99868494,0.00000539376,0.0004038873,0.00035686538,0.00027104915,0.00027788317],"domain_scores_gemma":[0.99868655,0.000052863958,0.000499877,0.00013598143,0.00060112285,0.000023626675],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002519615,0.00026792465,0.00030240553,0.00027194456,0.00019059952,0.00027373733,0.00035696372,0.00008785875,0.00044669403],"category_scores_gemma":[0.00017604361,0.00019689728,0.00009430973,0.00044572048,0.00036700707,0.0019412512,0.00017372657,0.0002540287,0.00004212234],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011367331,0.00037532204,0.071488164,0.000540842,0.0008178034,0.0000031563354,0.0037585695,0.77031624,0.0078679295,0.107213855,0.0011071601,0.035374224],"study_design_scores_gemma":[0.0014944277,0.000038300284,0.0023153864,0.0007191353,0.0003168306,0.00001183572,0.0007999413,0.9805484,0.0020921177,0.0069900528,0.0041407165,0.0005328541],"about_ca_topic_score_codex":0.00001897509,"about_ca_topic_score_gemma":0.000009251899,"teacher_disagreement_score":0.21023217,"about_ca_system_score_codex":0.000051754414,"about_ca_system_score_gemma":0.000021048976,"threshold_uncertainty_score":0.8029238},"labels":[],"label_agreement":null},{"id":"W4232148562","doi":"10.1017/s0001867800003001","title":"Stochastic and substochastic solutions for infinite-state Markov chains with applications to matrix-analytic methods","year":2008,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia, Okanagan Campus; University of British Columbia; University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Mathematics; Censoring (clinical trials); Stochastic matrix; Continuous-time Markov chain; Sequence (biology); Applied mathematics; Markov process; Finite set; Markov kernel; Markov property; Markov model; Variable-order Markov model; Statistics; Mathematical analysis","score_opus":0.029637624437833594,"score_gpt":0.31199205995410556,"score_spread":0.282354435516272,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4232148562","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.013762539,0.0002781294,0.98177016,0.0002387081,0.000032332584,0.0025656905,0.000013815036,0.00015587089,0.0011827747],"genre_scores_gemma":[0.7847901,0.000015790883,0.21150343,0.00030774606,0.00011745856,0.0031132572,0.000027498214,0.000040037907,0.00008466789],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9979819,0.000027764989,0.0004847651,0.0007576606,0.00018320055,0.00056468986],"domain_scores_gemma":[0.9982559,0.0007396807,0.0002469157,0.00055531814,0.00015599458,0.000046212186],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0011978955,0.00029718358,0.00047105656,0.00037663232,0.0005077062,0.00004937275,0.00027138318,0.000054093616,0.000018119455],"category_scores_gemma":[0.00039220904,0.0002729992,0.000068690424,0.001495214,0.0003640622,0.0005364519,0.00018757483,0.00018023547,0.000022021622],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00068948016,0.0002033933,0.0008052631,0.0004045852,0.000051995168,0.0000014261886,0.00016670606,0.6303481,0.00019691625,0.33261192,0.000009235669,0.03451101],"study_design_scores_gemma":[0.0015074257,0.00006586487,0.0011242635,0.00006008125,0.00029867672,0.000007544247,0.00025316808,0.11549829,0.000035104153,0.8697823,0.010437198,0.00093005976],"about_ca_topic_score_codex":0.000022972388,"about_ca_topic_score_gemma":0.00042848862,"teacher_disagreement_score":0.77102757,"about_ca_system_score_codex":0.00011336504,"about_ca_system_score_gemma":0.000036509267,"threshold_uncertainty_score":0.9999722},"labels":[],"label_agreement":null},{"id":"W4234468666","doi":"10.1145/345063.339418","title":"AMVA techniques for high service time variability","year":2000,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Queue; Range (aeronautics); Fork–join queue; Service (business); Queueing theory; Residual; Algorithm; Computer network; Queue management system; Engineering","score_opus":0.037267153118777804,"score_gpt":0.30898851996015453,"score_spread":0.2717213668413767,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4234468666","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.72905695,0.050142128,0.023517696,0.035095762,0.0013898162,0.030619621,0.00008269641,0.0043449984,0.12575035],"genre_scores_gemma":[0.8045761,0.049305502,0.050286904,0.08174176,0.003913241,0.0044253375,0.00210652,0.00027329903,0.003371329],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99783,0.00008433827,0.00065561343,0.00046802926,0.0006626641,0.00029938473],"domain_scores_gemma":[0.9966767,0.00044449884,0.00041221903,0.0010808368,0.0013685921,0.000017186221],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.009152749,0.00024900673,0.00047353757,0.0003681442,0.00027829089,0.00009986365,0.0006936861,0.000084700696,0.009142586],"category_scores_gemma":[0.005622659,0.00022644016,0.00013896963,0.004380971,0.000030646388,0.001723883,0.00012090976,0.00013661743,0.001958521],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000028011285,0.00007246547,0.00036483677,0.0028649678,0.00003508651,1.3539623e-7,0.000004495406,0.0007147581,0.00003941662,0.0015153913,0.0034332944,0.99092716],"study_design_scores_gemma":[0.00089921104,0.000060253915,0.0025865121,0.00232212,0.0023518933,0.0000023897164,0.000004996224,0.31008154,0.0003590017,0.045706872,0.634576,0.0010491792],"about_ca_topic_score_codex":0.000021090424,"about_ca_topic_score_gemma":0.0000020356533,"teacher_disagreement_score":0.98987794,"about_ca_system_score_codex":0.00013013212,"about_ca_system_score_gemma":0.000047870453,"threshold_uncertainty_score":0.9988186},"labels":[],"label_agreement":null},{"id":"W4235541773","doi":"10.1007/978-1-4757-5301-1_10","title":"Brownian Approximations","year":2001,"lang":"en","type":"book-chapter","venue":"Applications of mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Semimartingale; Limit (mathematics); Generalization; Heavy traffic approximation; Focus (optics); Brownian motion; Mathematics; Applied mathematics; Approximations of π; Queueing theory; Characterization (materials science); Calculus (dental); Mathematical economics; Computer science; Discrete mathematics; Mathematical analysis; Physics; Statistics","score_opus":0.019788220818088058,"score_gpt":0.23600143875028246,"score_spread":0.2162132179321944,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4235541773","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000012842773,0.00008644376,0.15443882,0.00019308348,0.00001770056,0.00052252755,0.00001544242,0.00014820589,0.8445649],"genre_scores_gemma":[0.006689077,0.00019819743,0.08339477,0.00066416373,0.0018918517,0.000639951,0.000718794,0.00038601193,0.9054172],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99873006,0.0000014219918,0.0005960867,0.00025853462,0.0002711575,0.0001427112],"domain_scores_gemma":[0.99757695,0.00011497831,0.0010144762,0.0009781456,0.00030414807,0.000011272778],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00021580976,0.00026151157,0.00042612606,0.00042612248,0.00013567948,0.000052644235,0.00050287746,0.00016993194,0.0010918654],"category_scores_gemma":[0.000055814467,0.00026902603,0.00020628124,0.00020803994,0.00014216697,0.00024303871,0.00015665799,0.00017713995,0.0015546496],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[8.2785607e-7,0.00007184599,0.0000021658664,0.0004248526,0.00007441229,4.603196e-7,0.000017122453,0.000100744925,0.000016008795,0.993486,0.0012911501,0.004514415],"study_design_scores_gemma":[0.000048712973,0.000001082373,4.1523012e-7,0.000079790596,0.00026938843,0.0000013834886,0.00003992383,0.0010343826,0.000005922115,0.61183214,0.38651994,0.00016692361],"about_ca_topic_score_codex":0.000008257716,"about_ca_topic_score_gemma":0.00001351997,"teacher_disagreement_score":0.38522878,"about_ca_system_score_codex":0.000030363595,"about_ca_system_score_gemma":0.00001646465,"threshold_uncertainty_score":0.9999762},"labels":[],"label_agreement":null},{"id":"W4236373590","doi":"10.1145/511399.511358","title":"Quality of service evaluations of multicast streaming protocols","year":2002,"lang":"en","type":"article","venue":"ACM SIGMETRICS Performance Evaluation Review","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Saskatchewan","funders":"","keywords":"Computer science; Scalability; Bandwidth (computing); Multicast; Computer network; Server; Quality of service; Queue; Service (business); Reliable multicast; Database; Xcast","score_opus":0.21170206156405671,"score_gpt":0.42092409667306574,"score_spread":0.20922203510900902,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236373590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8691019,0.039359134,0.0053164293,0.0045611397,0.00038797685,0.051477868,0.0000357573,0.0003144701,0.029445337],"genre_scores_gemma":[0.98895633,0.00287717,0.0035071305,0.0015166448,0.00015749961,0.0028202885,0.000068445224,0.000031014875,0.00006547236],"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99667776,0.00015925255,0.00129631,0.00029656108,0.0013682113,0.00020190203],"domain_scores_gemma":[0.99369985,0.00048757493,0.0017284761,0.0010573238,0.0030121037,0.000014661865],"candidate_categories":["metaresearch","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0077468376,0.00019271034,0.0006036465,0.00061245565,0.00012881879,0.0000278494,0.00059564476,0.00005587524,0.0024271903],"category_scores_gemma":[0.016081663,0.00017733256,0.0001596247,0.0058357627,0.00005329791,0.0012759106,0.00019730788,0.00012731459,0.00022918958],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025677187,0.0005166571,0.020844676,0.022755811,0.00012760425,1.8656701e-7,0.00009344024,0.012425021,0.0010149525,0.0039863526,0.00054684345,0.9376628],"study_design_scores_gemma":[0.0018719983,0.000058208887,0.03859407,0.0072640507,0.0013651225,9.963762e-7,0.000105748935,0.9381383,0.00067936006,0.0025371248,0.008747157,0.0006378472],"about_ca_topic_score_codex":0.000035417404,"about_ca_topic_score_gemma":0.0000117025465,"teacher_disagreement_score":0.93702495,"about_ca_system_score_codex":0.00006905381,"about_ca_system_score_gemma":0.000034153025,"threshold_uncertainty_score":0.99848473},"labels":[],"label_agreement":null},{"id":"W4236549871","doi":"10.1007/978-1-4612-1356-7_9","title":"Queueing Systems","year":2000,"lang":"en","type":"book-chapter","venue":"Birkhäuser Boston eBooks","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Sonnet; Queueing theory; Queueing system; Service (business); History; Operations research; Computer science; Art; Literature; Mathematics; Economics; Poetry; Computer network; Economy","score_opus":0.018672697822387795,"score_gpt":0.2093041480931838,"score_spread":0.190631450270796,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236549871","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00025773174,0.00060030766,0.0002067723,0.00006189906,0.0007483846,0.00048454924,0.000012349457,0.0008189768,0.996809],"genre_scores_gemma":[0.024219278,0.00003579654,0.00006575679,0.0014857494,0.0038151096,0.000041132767,0.00009027137,0.0004010184,0.9698459],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99730027,0.000012910016,0.0007390758,0.0008522839,0.00055551284,0.00053993094],"domain_scores_gemma":[0.99793214,0.000069978894,0.00073519023,0.0010448777,0.00018162388,0.00003620976],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00038726363,0.0007903906,0.0008662241,0.0008367983,0.00033916323,0.0004788585,0.0006533901,0.0005079976,0.0017086916],"category_scores_gemma":[0.000028575232,0.00079726824,0.00044618393,0.000058815946,0.00017022701,0.0004488671,0.00025770176,0.00059783756,0.005963164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006702999,0.000009641076,0.000009055482,0.00022541304,0.0002144405,0.00016945682,0.000028515344,0.0003593321,0.00003644039,0.98354644,0.0028283477,0.012505883],"study_design_scores_gemma":[0.0002338228,0.000006395945,0.0000024511178,0.0005324117,0.00041079632,0.000009283796,0.000018406487,0.00046625815,0.000008211195,0.14220192,0.85528594,0.0008241192],"about_ca_topic_score_codex":0.00032778483,"about_ca_topic_score_gemma":0.00009744722,"teacher_disagreement_score":0.8524576,"about_ca_system_score_codex":0.000122267,"about_ca_system_score_gemma":0.0000451332,"threshold_uncertainty_score":0.9994478},"labels":[],"label_agreement":null},{"id":"W4236695697","doi":"10.1017/s0021900200020313","title":"The classification of matrix GI/M/1-type Markov chains with a tree structure and its applications to queueing","year":2003,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Dalhousie University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Markov chain; Queueing theory; Jacobian matrix and determinant; Type (biology); Tree (set theory); Eigenvalues and eigenvectors; Matrix (chemical analysis); Markov process; Combinatorics; Applied mathematics; Discrete mathematics; Statistics","score_opus":0.013902111043890686,"score_gpt":0.2468646946742437,"score_spread":0.23296258363035302,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4236695697","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98559636,0.0001315963,0.009592165,0.000734584,0.000040382107,0.0006679629,0.0000017259887,0.00001875665,0.0032164431],"genre_scores_gemma":[0.99510574,0.000008722029,0.004613209,0.000082832295,0.00012353659,0.00001551336,0.000001184502,0.000012708922,0.00003654764],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99899554,0.000024928368,0.00043176327,0.000173659,0.00023096357,0.00014312088],"domain_scores_gemma":[0.99839514,0.0001487906,0.00070371997,0.0002738818,0.00045548307,0.000022951544],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010601167,0.00012304007,0.0002299996,0.00011410629,0.0002074672,0.00007131973,0.00020899162,0.000045651785,0.000017550674],"category_scores_gemma":[0.00025167575,0.00007800737,0.000045124732,0.0007078624,0.00007568998,0.0002502132,0.00003850366,0.00017471371,0.0000025925192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010679389,0.00012269655,0.0039754016,0.00030534723,0.00014807672,8.828426e-7,0.00017456678,0.0065075317,0.023834316,0.94135547,0.00007304238,0.022434736],"study_design_scores_gemma":[0.0020226124,0.00015961903,0.03335535,0.00014843741,0.00088376267,0.00003051813,0.0019204337,0.0053867437,0.00828004,0.89427954,0.052770514,0.00076245365],"about_ca_topic_score_codex":0.0000022092013,"about_ca_topic_score_gemma":0.000057155125,"teacher_disagreement_score":0.052697472,"about_ca_system_score_codex":0.000048647747,"about_ca_system_score_gemma":0.00004175104,"threshold_uncertainty_score":0.31810483},"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,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_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","score_opus":0.01663157399608042,"score_gpt":0.24972182023346584,"score_spread":0.23309024623738542,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4237799823","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.036695585,0.00016947949,0.011106516,0.00064798305,0.0017147287,0.0005915985,0.00008602188,0.00090756296,0.94808054],"genre_scores_gemma":[0.89916044,0.00017533539,0.00197538,0.0024689902,0.010229189,0.000047013367,0.0039727134,0.00016450146,0.081806436],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99719375,0.00002131538,0.00058651017,0.0008225527,0.0009618643,0.00041399754],"domain_scores_gemma":[0.99742573,0.00007179568,0.00070084765,0.0008668316,0.0009107583,0.000024028139],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001456758,0.00048144776,0.00073857524,0.0004491455,0.00026397806,0.0002270633,0.00039528578,0.0004833285,0.006791929],"category_scores_gemma":[0.0006044034,0.00045808102,0.0004424635,0.00055064575,0.000057851215,0.0016415972,0.0002569906,0.0006062458,0.0006874288],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014003835,0.00039670288,0.00060116523,0.002300339,0.00019271843,0.000020039306,0.00003858927,0.014936099,0.00017960802,0.007674682,0.96894157,0.0045784283],"study_design_scores_gemma":[0.0005459903,0.000014503376,0.0018001517,0.00025158015,0.001105532,0.000009392706,0.0001633174,0.15861961,0.000098892575,0.25576597,0.5799592,0.0016658537],"about_ca_topic_score_codex":0.0007272162,"about_ca_topic_score_gemma":0.0020800908,"teacher_disagreement_score":0.8662741,"about_ca_system_score_codex":0.0004348115,"about_ca_system_score_gemma":0.00017496114,"threshold_uncertainty_score":0.9997871},"labels":[],"label_agreement":null},{"id":"W4238258639","doi":"10.1017/s0001867800012775","title":"Algorithmic analysis of the BMAP/D/k system in discrete time","year":2003,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Mathematics; Interval (graph theory); Property (philosophy); Carry (investment); Joint probability distribution; Discrete time and continuous time; Server; Period length; Joint (building); Algorithm; Exploit; Computer science; Discrete mathematics; Computer network; Combinatorics; Statistics","score_opus":0.005978204717588328,"score_gpt":0.22010222241644498,"score_spread":0.21412401769885664,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238258639","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.84745616,0.0006082503,0.010177428,0.00010531788,0.0002563838,0.0019143801,0.000014886192,0.00019209583,0.13927507],"genre_scores_gemma":[0.997924,0.0000053827125,0.0017944992,0.0000692572,0.000031556192,0.000106856955,0.000008531125,0.000014463615,0.000045490342],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981963,0.000082318234,0.00064900157,0.000498162,0.00027124712,0.0003029928],"domain_scores_gemma":[0.9985863,0.00016902365,0.00041116853,0.0007709362,0.000053800293,0.000008756066],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015812118,0.00020592014,0.00058118446,0.00040336198,0.000076929515,0.00002722188,0.00043464842,0.00006665374,0.00008741972],"category_scores_gemma":[0.00026787302,0.00015561827,0.00019404011,0.0047514634,0.00020572885,0.00049660687,0.00013433314,0.0001933972,0.00002806234],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007859134,0.00014420623,0.07903812,0.00039374788,0.00012854175,0.0000017741662,0.00006320978,0.30894762,0.00036399244,0.60634655,0.0000024202259,0.004491235],"study_design_scores_gemma":[0.0019472517,0.000011398728,0.037506636,0.00026685494,0.001744966,9.955995e-7,0.0011265881,0.18705791,0.0013425669,0.7509293,0.016857453,0.0012080995],"about_ca_topic_score_codex":0.000069974456,"about_ca_topic_score_gemma":0.00059124344,"teacher_disagreement_score":0.15046778,"about_ca_system_score_codex":0.00017970128,"about_ca_system_score_gemma":0.000016846172,"threshold_uncertainty_score":0.6345929},"labels":[],"label_agreement":null},{"id":"W4238444251","doi":"10.22215/etd/2011-09388","title":"Tail asymptotics for a discrete- time priority preemptive queueing system","year":2011,"lang":"en","type":"dissertation","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University; Canadian Heritage; Library and Archives Canada","funders":"","keywords":"Queueing system; Queueing theory; Mathematics; Computer science; Statistics","score_opus":0.010853151916722929,"score_gpt":0.23821817442402143,"score_spread":0.2273650225072985,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238444251","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.122050665,0.00030143603,0.03787373,0.00006965288,0.0026277828,0.004224862,0.00006900863,0.0026264885,0.8301564],"genre_scores_gemma":[0.71990323,0.00000812144,0.005735171,0.0003009843,0.003850196,0.00049073313,0.004772704,0.00043702984,0.2645018],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99808574,0.000020410964,0.00054548273,0.00064504007,0.00027977876,0.000423547],"domain_scores_gemma":[0.9979429,0.0001237398,0.00088776427,0.00048311005,0.0005435256,0.000018914661],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00050951296,0.00049446465,0.0006895404,0.00039676344,0.00033419428,0.00025650716,0.00046775932,0.00033324715,0.00033776814],"category_scores_gemma":[0.00028494783,0.00045254055,0.0003644052,0.0003768775,0.00003222906,0.0010536767,0.000088942295,0.0002454132,0.0007705781],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013985346,0.00018490283,0.0007143991,0.009817487,0.0013976155,0.000022382206,0.0006964466,0.00048174552,0.0006357575,0.9759972,0.0026772425,0.005976291],"study_design_scores_gemma":[0.008552862,0.00036915782,0.003984384,0.01484494,0.029940212,0.000012799158,0.04928648,0.4062764,0.00653306,0.33150184,0.13152853,0.017169327],"about_ca_topic_score_codex":0.0003074194,"about_ca_topic_score_gemma":0.0005390627,"teacher_disagreement_score":0.64449537,"about_ca_system_score_codex":0.0001142522,"about_ca_system_score_gemma":0.00004598081,"threshold_uncertainty_score":0.99979264},"labels":[],"label_agreement":null},{"id":"W4238508931","doi":"10.2139/ssrn.3464764","title":"Multi-Class State-Dependent Service Systems with Returns","year":2019,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto; University of Waterloo","funders":"","keywords":"Class (philosophy); Business; Service (business); Computer science; Marketing; Artificial intelligence","score_opus":0.0066220342924679845,"score_gpt":0.20704696823112903,"score_spread":0.20042493393866104,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4238508931","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9788279,0.0009051057,0.015792979,0.00088806776,0.00049831584,0.00037439447,0.0000014559998,0.0001923456,0.0025194373],"genre_scores_gemma":[0.99160475,0.00012010277,0.000063459,0.0005706294,0.0005350803,0.0000068625295,0.0000075459293,0.00006592882,0.007025623],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99705,0.00004010902,0.0003331581,0.00032042462,0.00043908568,0.0018172131],"domain_scores_gemma":[0.99877244,0.000034637487,0.0004922845,0.0003370981,0.00033998757,0.000023522507],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0016752786,0.00025346168,0.0003126122,0.00025676284,0.0002197333,0.00034765014,0.00046526754,0.000060341576,0.00007486569],"category_scores_gemma":[0.00003153686,0.00019440266,0.00008921166,0.00057521026,0.00002107188,0.0013044444,0.00009018963,0.001379277,0.0008307765],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0018311527,0.00066646707,0.05115642,0.00073706475,0.00336264,0.00014998043,0.00046578742,0.49476904,0.009073438,0.4320274,0.00019297069,0.00556764],"study_design_scores_gemma":[0.02008173,0.0006844691,0.0022760236,0.0011820453,0.0020720935,0.0021331224,0.044308987,0.5299473,0.00036746584,0.3234444,0.06863471,0.004867689],"about_ca_topic_score_codex":0.00036746735,"about_ca_topic_score_gemma":0.004300786,"teacher_disagreement_score":0.10858298,"about_ca_system_score_codex":0.0005649181,"about_ca_system_score_gemma":0.00032412427,"threshold_uncertainty_score":0.9999472},"labels":[],"label_agreement":null},{"id":"W4239364270","doi":"10.1109/wsc.2005.1574247","title":"Modeling and Simulation of Call Centers","year":2006,"lang":"en","type":"article","venue":"Proceedings of the Winter Simulation Conference, 2005.","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":45,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science","score_opus":0.01708603758070115,"score_gpt":0.2392732540584384,"score_spread":0.22218721647773726,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4239364270","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96113366,0.000017378847,0.03178175,0.00022823304,0.00007291944,0.00017784833,0.0000019497606,0.000044879875,0.006541363],"genre_scores_gemma":[0.9992161,9.555473e-7,0.00022202014,0.00008712784,0.00016808428,0.0000022225154,0.000004002592,0.0000140783195,0.00028540727],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906754,0.000002864861,0.00038982715,0.00019135147,0.00020323049,0.00014515505],"domain_scores_gemma":[0.998941,0.00003963251,0.00038423017,0.00008690573,0.00054125115,0.000006952682],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00022674807,0.00013028349,0.00019751237,0.00019493517,0.00007973799,0.00007504698,0.00019414313,0.000049547576,0.000042101892],"category_scores_gemma":[0.000111147725,0.00010452683,0.00008466127,0.00021983363,0.00007549767,0.00090959267,0.00013323055,0.00007414127,0.0000032937257],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054571065,0.00002620532,0.011894468,0.00009002402,0.000017124234,2.8690529e-8,0.00003946178,0.97380364,0.0018155839,0.011875415,0.00002770488,0.00035578405],"study_design_scores_gemma":[0.00028027824,0.0000033875726,0.0010263443,0.000116616306,0.000073106305,1.1558207e-7,0.00008524825,0.97967994,0.00027632798,0.017966542,0.00038828695,0.00010381915],"about_ca_topic_score_codex":0.00008139219,"about_ca_topic_score_gemma":0.000019366222,"teacher_disagreement_score":0.038082425,"about_ca_system_score_codex":0.000017311037,"about_ca_system_score_gemma":0.0000057378056,"threshold_uncertainty_score":0.42624804},"labels":[],"label_agreement":null},{"id":"W4241586486","doi":"10.1023/a:1024028722553","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":55,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markov chain; Computer science; Queue; Discrete time and continuous time; Class (philosophy); Service (business); Product (mathematics); Representation (politics); Matrix (chemical analysis); Mathematical optimization; Operations research; Real-time computing; Mathematics; Computer network; Statistics; Artificial intelligence","score_opus":0.012633880782040982,"score_gpt":0.21998479401939708,"score_spread":0.2073509132373561,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241586486","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5649545,0.0008340568,0.087626465,0.0003297986,0.0010090341,0.00090985425,0.0000022291822,0.0007175365,0.3436165],"genre_scores_gemma":[0.9963384,0.0000018289743,0.00011853554,0.0001247678,0.0002452715,0.00003131869,0.000011304532,0.000028663248,0.0030998557],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99898773,0.000051266175,0.0003082361,0.00025389172,0.00016619943,0.00023269902],"domain_scores_gemma":[0.99942666,0.000045699424,0.00018742541,0.0002727919,0.00005926876,0.000008163518],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00079160015,0.0001351124,0.00021789473,0.00028460324,0.000091269074,0.00016884968,0.00014357985,0.000056501638,0.000055767938],"category_scores_gemma":[0.00013772219,0.00013063768,0.000054040087,0.0005743548,0.000017472492,0.0014046521,0.000028254868,0.00009292954,0.0005542071],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008397586,0.000020676665,0.0015482459,0.00010722758,0.000018368943,0.000008258176,0.00005771363,0.25866732,0.00072631415,0.7384265,0.0002232155,0.00018776502],"study_design_scores_gemma":[0.00042437343,0.0000037125212,0.00014403975,0.00027272484,0.000049338272,0.0000033844453,0.00036088092,0.8826293,0.000058864305,0.09497189,0.020658735,0.00042278296],"about_ca_topic_score_codex":0.0005492769,"about_ca_topic_score_gemma":0.000026368261,"teacher_disagreement_score":0.6434546,"about_ca_system_score_codex":0.00006567127,"about_ca_system_score_gemma":0.000009390238,"threshold_uncertainty_score":0.7123396},"labels":[],"label_agreement":null},{"id":"W4241718280","doi":"10.1017/s0001867800013380","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":12,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_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; Queue; Discrete time and continuous time; Infinity; Markov process; State (computer science); Applied mathematics; Discrete mathematics; Mathematical analysis; Statistics; Algorithm; Computer science","score_opus":0.011855285323393652,"score_gpt":0.24440230261748963,"score_spread":0.232547017294096,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241718280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9544421,0.0012915172,0.01220201,0.0027234268,0.00024075177,0.002143738,0.000008051971,0.00018469193,0.026763747],"genre_scores_gemma":[0.99501497,0.00020155219,0.0031900108,0.0011852931,0.0001251836,0.00018097123,0.000046385616,0.000026211628,0.000029408915],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9981377,0.00005199353,0.00046870575,0.00047820312,0.00042462404,0.00043878492],"domain_scores_gemma":[0.99839145,0.00056903186,0.00026931803,0.0006266269,0.0001332369,0.000010362604],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017737966,0.00025957183,0.0002529697,0.000093980445,0.00036008167,0.00020891243,0.0006063315,0.000054141205,0.00002504179],"category_scores_gemma":[0.00012677896,0.0001545981,0.00003782469,0.0013963622,0.0004895291,0.0011220322,0.00011150142,0.0003575053,0.000055676683],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004684665,0.00019324881,0.008546988,0.000112545764,0.000015625308,0.000007882688,0.00023577122,0.33737424,0.00001567454,0.64806473,0.00001614946,0.0049487054],"study_design_scores_gemma":[0.0008056418,0.000022909364,0.0048094774,0.000039546776,0.000030774187,0.0000015397887,0.0029663714,0.0014821186,0.000020473759,0.95337766,0.03616677,0.0002767146],"about_ca_topic_score_codex":0.00018145918,"about_ca_topic_score_gemma":0.006011673,"teacher_disagreement_score":0.3358921,"about_ca_system_score_codex":0.00023507352,"about_ca_system_score_gemma":0.000060968723,"threshold_uncertainty_score":0.6304328},"labels":[],"label_agreement":null},{"id":"W4241914554","doi":"10.1287/opre.1100.0884","title":"Contributors","year":2010,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.04175362454303325,"score_gpt":0.36313516985641486,"score_spread":0.3213815453133816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4241914554","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9126857,0.000013990109,0.0019239738,0.0042499257,0.00028528165,0.00025272358,0.0000027270821,0.00012932665,0.08045638],"genre_scores_gemma":[0.9930316,0.0000014446478,0.0005377335,0.00027029953,0.0010036837,0.000044885845,0.000027271644,0.000013027425,0.005070036],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99912083,0.000022153781,0.00011616778,0.00017821662,0.00029936002,0.00026329444],"domain_scores_gemma":[0.9989298,0.00008157121,0.0000097540815,0.00032330942,0.0006434786,0.000012108244],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0014220767,0.000059000547,0.0000765092,0.00035926662,0.0007523,0.00048659925,0.00025882278,0.000044746706,0.0025439353],"category_scores_gemma":[0.0015488416,0.000052119136,0.000034973975,0.00093067274,0.00013316322,0.0008725942,0.00013923476,0.00044135016,0.003069844],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000092898745,0.000055047494,0.00094595744,0.000006771172,0.000012976139,0.0000056597705,0.000019193207,0.002708882,0.035980064,0.9539605,0.0032586947,0.0030369905],"study_design_scores_gemma":[0.00047655863,0.000009039966,0.001307997,0.00001032282,0.000021855738,0.0000023384853,0.00034083612,0.14718556,0.002171919,0.034527507,0.8136603,0.0002857326],"about_ca_topic_score_codex":0.0004048665,"about_ca_topic_score_gemma":0.0019903409,"teacher_disagreement_score":0.91943294,"about_ca_system_score_codex":0.000014446324,"about_ca_system_score_gemma":0.000028366254,"threshold_uncertainty_score":0.99836785},"labels":[],"label_agreement":null},{"id":"W4243221288","doi":"10.1017/s0021900200113014","title":"Conditional Sojourn times and the volatility of payment schemes for bandwidth sharing in packet networks","year":2015,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Processor sharing; Payment; Volatility (finance); Predictability; Prepayment of loan; Revenue; Computer science; Network packet; Logarithm; Bandwidth (computing); Conditional expectation; Regret; Econometrics; Mathematics; Computer network; Queueing theory; Economics; Statistics; Finance","score_opus":0.02340897960375154,"score_gpt":0.24393572991853388,"score_spread":0.22052675031478233,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4243221288","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9715145,0.00020326169,0.02512186,0.00090520235,0.00008459643,0.0005725795,0.0000033188237,0.000011371069,0.0015832707],"genre_scores_gemma":[0.9973859,0.000004008165,0.0021350367,0.00015451285,0.00028160383,0.00001725567,0.0000054724164,0.000008057099,0.000008161794],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987612,0.00002358291,0.00066365796,0.0001612129,0.00023552205,0.00015485381],"domain_scores_gemma":[0.9983742,0.0002942259,0.0007879694,0.00018141416,0.0003413627,0.000020826994],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0052085733,0.000119456585,0.00040550716,0.000095284544,0.000071911505,0.000060251114,0.00021092477,0.000049629514,0.000040101528],"category_scores_gemma":[0.00045985682,0.00007731653,0.0001183471,0.00021611128,0.00024349832,0.00041676982,0.00012196368,0.00020315271,5.5908805e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.011452447,0.0005738044,0.16242802,0.00056570163,0.00039610517,0.0000028207148,0.0005664477,0.08784408,0.00008033667,0.7249766,0.0010748551,0.010038764],"study_design_scores_gemma":[0.0027557826,0.000014709106,0.0028173262,0.000033909906,0.00010514349,0.0000015346959,0.00027236305,0.085724734,0.000054821438,0.90700465,0.0011265667,0.00008844318],"about_ca_topic_score_codex":0.000006918204,"about_ca_topic_score_gemma":0.000018922694,"teacher_disagreement_score":0.18202806,"about_ca_system_score_codex":0.000060707527,"about_ca_system_score_gemma":0.000034708377,"threshold_uncertainty_score":0.31528768},"labels":[],"label_agreement":null},{"id":"W4244358890","doi":"10.1007/978-1-4614-7163-9_160-2","title":"Queueing Theory","year":2017,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Queueing theory; Computer science; Computer network","score_opus":0.0191962865989247,"score_gpt":0.23271874206646376,"score_spread":0.21352245546753906,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4244358890","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000061948017,0.00017406358,0.002889297,0.00019570703,0.00032925542,0.000116461255,0.0000015142926,0.00033219205,0.9959553],"genre_scores_gemma":[0.0051142825,0.000023147953,0.000163546,0.0017618878,0.0026629209,0.0000042604142,0.000037711532,0.000116811636,0.9901154],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99883157,0.000003653273,0.00026401703,0.00043909324,0.00022818815,0.00023348049],"domain_scores_gemma":[0.9981648,0.00007824235,0.0006254157,0.0009900454,0.00013158596,0.00000991376],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005571029,0.00037483903,0.00042926345,0.00033511053,0.00040193842,0.00038644203,0.0006430911,0.00022521557,0.010369546],"category_scores_gemma":[0.00017258519,0.00033302145,0.00029944102,0.000014059784,0.0001510767,0.000906584,0.0004019108,0.0003165049,0.0064484505],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017742033,0.0000034403045,0.0000051645584,0.0000561418,0.00011322375,0.000033944503,0.0000033100266,0.0000265297,0.000005181674,0.97877544,0.0026606454,0.018299218],"study_design_scores_gemma":[0.000052378888,7.4294786e-7,0.0000015916511,0.000084932864,0.00016542048,5.8011466e-7,0.0000044808576,0.000100986246,0.0000017804124,0.5216332,0.47770905,0.00024483594],"about_ca_topic_score_codex":0.000042203847,"about_ca_topic_score_gemma":0.00008488463,"teacher_disagreement_score":0.47504842,"about_ca_system_score_codex":0.000033094882,"about_ca_system_score_gemma":0.000013845062,"threshold_uncertainty_score":0.9999122},"labels":[],"label_agreement":null},{"id":"W4246215311","doi":"10.1017/s002190020001545x","title":"A note on bias optimality in controlled queueing systems","year":2000,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":9,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Queue; Joins; Limit (mathematics); Queueing theory; Mathematics; Discounting; Optimal control; Conjecture; Markov decision process; Control (management); Mathematical optimization; Mathematical economics; Markov process; Computer science; Economics; Combinatorics; Statistics; Computer network","score_opus":0.02207779768593145,"score_gpt":0.24723907060491346,"score_spread":0.225161272918982,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4246215311","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95906144,0.00004027241,0.000456727,0.00032040247,0.00013256019,0.00055292255,7.105504e-7,0.000040095263,0.03939488],"genre_scores_gemma":[0.99821794,0.000005208257,0.00077424187,0.0003652912,0.00054801174,0.000022003791,0.0000011268107,0.000017599936,0.000048604525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9978335,0.000071217735,0.0011338603,0.0002681001,0.00041362742,0.00027969966],"domain_scores_gemma":[0.9982621,0.00032519083,0.0008679887,0.00033992453,0.00018111055,0.000023675326],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0046169353,0.00021322684,0.00082384644,0.00028405632,0.000095656214,0.00016458372,0.00031399002,0.00009170997,0.00030056873],"category_scores_gemma":[0.00041434183,0.00016484444,0.00024703433,0.00058062596,0.00007351147,0.0005691006,0.000037626753,0.00042776883,0.00009342493],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013913563,0.0008049929,0.0036388831,0.00032521196,0.00014054599,0.000044326403,0.0001589665,0.8739331,0.0005530474,0.0908473,0.0000913835,0.015548697],"study_design_scores_gemma":[0.031256724,0.00017546542,0.010929668,0.00092663284,0.0008197126,0.000027653867,0.00062536815,0.19119965,0.00038171207,0.73648584,0.025538059,0.0016335542],"about_ca_topic_score_codex":0.00007842995,"about_ca_topic_score_gemma":0.000033769873,"teacher_disagreement_score":0.6827335,"about_ca_system_score_codex":0.00019511535,"about_ca_system_score_gemma":0.00003910234,"threshold_uncertainty_score":0.6722162},"labels":[],"label_agreement":null},{"id":"W4247037558","doi":"10.1017/s002190020002088x","title":"Pair formation in a Markovian arrival process with two event labels","year":2004,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Markovian arrival process; Point process; Mathematics; Markov process; Cox process; Event (particle physics); Process (computing); Stochastic process; Poisson distribution; Markov chain; Markov renewal process; Compound Poisson process; Rare events; Poisson point process; Security token; Statistical physics; Time reversibility; Applied mathematics; Poisson process; Statistics; Computer science; Markov property; Markov model","score_opus":0.009928139260193062,"score_gpt":0.2365557139333344,"score_spread":0.22662757467314135,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4247037558","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9892301,0.000009188637,0.007723963,0.00074116606,0.00004492808,0.00031789803,4.1173374e-7,0.000028921637,0.0019034449],"genre_scores_gemma":[0.996518,7.32155e-7,0.002905726,0.00031910583,0.000220116,0.00001666052,0.0000023386583,0.000013202645,0.000004129354],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9986819,0.000012960537,0.0005821185,0.00016442504,0.0003485335,0.0002100587],"domain_scores_gemma":[0.9987752,0.000028343336,0.0007502553,0.00018570156,0.0002418811,0.00001864396],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013588704,0.00014934891,0.0002956784,0.00022807778,0.00007516155,0.000071851915,0.00022342743,0.000038155602,0.000033206867],"category_scores_gemma":[0.00009067001,0.00011131737,0.00007601533,0.00066242326,0.00006122182,0.0013503619,0.000040265983,0.00026298832,0.000012177611],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.003788281,0.0012747492,0.01657553,0.0011219308,0.00011811884,0.00007012935,0.0012879578,0.8822112,0.0011719139,0.07851092,0.000031944903,0.013837319],"study_design_scores_gemma":[0.0034545877,0.00005180411,0.003452314,0.00020345778,0.000111209476,0.00002224862,0.00064777123,0.0016929838,0.001743242,0.9878405,0.0005092685,0.00027064246],"about_ca_topic_score_codex":0.000014128318,"about_ca_topic_score_gemma":0.00017421295,"teacher_disagreement_score":0.90932953,"about_ca_system_score_codex":0.00021121251,"about_ca_system_score_gemma":0.000048232137,"threshold_uncertainty_score":0.45393905},"labels":[],"label_agreement":null},{"id":"W4248047448","doi":"10.1017/s002190020002091x","title":"M/GI/1 queues with services of both positive and negative customers","year":2004,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Government of Jiangsu Province; Western Washington University","keywords":"Joins; Queue; Mathematics; Laplace transform; Generalization; Sign (mathematics); Service (business); Computer science; Computer network; Mathematical analysis; Business; Marketing","score_opus":0.005779977264398198,"score_gpt":0.2065923286343744,"score_spread":0.20081235136997622,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248047448","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9919007,0.000038421746,0.00047654813,0.00025878588,0.000022242439,0.00018542689,0.0000017286536,0.000015677557,0.007100504],"genre_scores_gemma":[0.99545044,0.0000062242884,0.004138914,0.00025840144,0.00012603837,0.0000028371958,0.0000011586676,0.000011931897,0.000004051486],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990379,0.000012333601,0.0003872372,0.00016973195,0.00025258487,0.00014017003],"domain_scores_gemma":[0.99850327,0.00008157428,0.00091147004,0.0001444211,0.00034028818,0.000019002902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00065722637,0.00014624675,0.000371537,0.00015522259,0.00008260692,0.00004916753,0.0001591694,0.00004186789,0.000019867894],"category_scores_gemma":[0.00003515965,0.00010428464,0.00006877282,0.00038990573,0.00023078325,0.00074987795,0.000066046494,0.00017198731,0.000002782449],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.01333029,0.0016405924,0.032562494,0.0034598154,0.0018952144,0.00006586417,0.0073400033,0.25533664,0.011998671,0.651525,0.00003137712,0.020814033],"study_design_scores_gemma":[0.002942472,0.00017176433,0.01585921,0.0004041686,0.0006582528,0.000015514916,0.003606315,0.00040262475,0.007320125,0.9677601,0.00045424842,0.00040520428],"about_ca_topic_score_codex":0.00014798362,"about_ca_topic_score_gemma":0.00014432221,"teacher_disagreement_score":0.3162351,"about_ca_system_score_codex":0.00006289855,"about_ca_system_score_gemma":0.000036789956,"threshold_uncertainty_score":0.42526042},"labels":[],"label_agreement":null},{"id":"W4248383067","doi":"10.1287/opre.1110.0955","title":"Contributors","year":2011,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Computer science","score_opus":0.12887956103084125,"score_gpt":0.3576260127367004,"score_spread":0.22874645170585917,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248383067","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4953853,0.00008218071,0.009583797,0.0013238747,0.00020461217,0.0004745504,0.0000038570693,0.00024287032,0.49269897],"genre_scores_gemma":[0.9939477,0.000003568095,0.00069414533,0.00023537278,0.00036167607,0.000047719557,0.000016262582,0.000012882275,0.0046807122],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99915504,0.000034945224,0.00012275668,0.00017241754,0.00025283708,0.000261989],"domain_scores_gemma":[0.9991172,0.000038633396,0.000010380834,0.00027273005,0.0005504694,0.000010609353],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001124257,0.000058874422,0.00007870575,0.00036855807,0.0005794767,0.00019444583,0.00024292585,0.000031270694,0.003464772],"category_scores_gemma":[0.0006549736,0.00005203291,0.000035370173,0.0009344266,0.00010869526,0.000924967,0.00014133363,0.00017452441,0.0035340276],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000023959312,0.00009450916,0.0014571551,0.0000094033885,0.000024642433,0.000012063378,0.00012235649,0.0010465673,0.0012055307,0.99114823,0.0024907032,0.0023648508],"study_design_scores_gemma":[0.0016678381,0.00006921789,0.008726587,0.000077395,0.00011532309,0.0000056306612,0.0038383915,0.20745479,0.006279219,0.20172067,0.5689761,0.0010688407],"about_ca_topic_score_codex":0.00090573204,"about_ca_topic_score_gemma":0.00048580652,"teacher_disagreement_score":0.7894276,"about_ca_system_score_codex":0.000028120814,"about_ca_system_score_gemma":0.000020805806,"threshold_uncertainty_score":0.9974462},"labels":[],"label_agreement":null},{"id":"W4248810892","doi":"10.1017/9781108377423.001","title":"Preface","year":2018,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Finite state; Bayes' theorem; Markov chain; Mathematics; Computer science; Discrete time and continuous time; Simple (philosophy); Markov kernel; Applied mathematics; Markov process; State (computer science); Discrete mathematics; Calculus (dental); Pure mathematics; Variable-order Markov model; Markov model; Algorithm; Bayesian probability; Artificial intelligence; Statistics; Philosophy","score_opus":0.019177782621303135,"score_gpt":0.19113849886331738,"score_spread":0.17196071624201426,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4248810892","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00022654721,0.00004486816,0.00087354035,0.000019338262,0.00026935132,0.00025087871,0.00003422387,0.00038085354,0.9979004],"genre_scores_gemma":[0.0010485596,0.000012860048,0.00008800143,0.00033665606,0.001294587,4.6942287e-7,0.00006943569,0.000083429615,0.997066],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986206,0.000008918364,0.00018858493,0.00060619693,0.0002697511,0.00030591217],"domain_scores_gemma":[0.9984523,0.00003936153,0.00044200738,0.0007350743,0.0003024865,0.000028790995],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0001477284,0.00042548898,0.00042583936,0.0003666297,0.00029700575,0.00012260562,0.0007145657,0.000295226,0.00013634622],"category_scores_gemma":[0.000025958467,0.00050419196,0.00029180068,0.00002018882,0.00032859578,0.0004587325,0.0007777713,0.00034826327,0.0006778662],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008458584,0.000005691324,0.0000012683417,0.00009981533,0.00016545002,0.000116199066,0.000006946937,0.00001408687,0.000019062465,0.9252208,0.07372703,0.00053907814],"study_design_scores_gemma":[0.00029043082,0.000007133758,0.0000022005563,0.00014181221,0.00060817745,0.0000021281435,0.000023376708,0.00029333355,0.00004222517,0.000615209,0.997431,0.00054296985],"about_ca_topic_score_codex":0.000095093,"about_ca_topic_score_gemma":0.000005558013,"teacher_disagreement_score":0.9246056,"about_ca_system_score_codex":0.00012621825,"about_ca_system_score_gemma":0.000026993694,"threshold_uncertainty_score":0.99974096},"labels":[],"label_agreement":null},{"id":"W4249450230","doi":"10.1109/ictrc.2015.7156403","title":"Table of contents","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Mehran University of Engineering and Technology; Al-Ahliyya Amman University; Assiut University; United Arab Emirates University; Tallinna Tehnikaülikool; Ajman University; British University in Dubai; American University of Sharjah; King Abdulaziz City for Science and Technology; Sultan Qaboos University; University of Engineering and Technology, Lahore; Kocaeli Üniversitesi; Zayed University; Khalifa University of Science, Technology and Research; University of Isfahan; King Abdulaziz University; Jordan University of Science and Technology; Aristotle University of Thessaloniki; Cairo University; Edith Cowan University; King Saud University; University of Liverpool; Università degli Studi di Milano; South China University of Technology; University of Essex; Scuola Superiore Sant'Anna; Institute of Physics Belgrade; Umm Al-Qura University; University of Adelaide; École de technologie supérieure; Sheffield Hallam University; University of Canterbury; Universidade de Aveiro; Qatar University; American Association for the Surgery of Trauma","keywords":"Computer science; Table (database); Queueing theory; Algorithm; Theoretical computer science; Data mining; Computer network","score_opus":0.038245331690615225,"score_gpt":0.24612865907754342,"score_spread":0.2078833273869282,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249450230","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.28776196,0.00006631757,0.014611841,0.0004971718,0.00024336259,0.000098513105,7.215765e-7,0.0001734228,0.6965467],"genre_scores_gemma":[0.9938901,3.289948e-7,0.0004256536,0.0006242833,0.00012613875,0.0000015118203,0.0000036528377,0.0000062482018,0.0049220533],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99962926,0.0000024467656,0.00010683541,0.000075671705,0.000102592065,0.00008318093],"domain_scores_gemma":[0.9996046,0.000010154092,0.000083586434,0.00012632873,0.00016984726,0.0000055104724],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001799622,0.000045671753,0.0000999457,0.00007311742,0.000017107812,0.000019265564,0.000101185164,0.000013863492,0.00030083448],"category_scores_gemma":[0.00017857594,0.000037428123,0.000026504307,0.00026816555,0.000022965327,0.0005384399,0.000064311396,0.000021283982,0.00029887693],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010368142,0.00013743459,0.034609083,0.00006424875,0.0000861309,0.0000063728876,0.00003542247,0.0040115295,0.002677789,0.9222909,0.032798,0.0031794116],"study_design_scores_gemma":[0.0023053498,0.000020110547,0.0012075658,0.000051399147,0.00022800216,0.0000012445213,0.0021839163,0.040157292,0.0047739465,0.3667777,0.58177096,0.0005225184],"about_ca_topic_score_codex":0.00025991115,"about_ca_topic_score_gemma":0.000026236628,"teacher_disagreement_score":0.7061282,"about_ca_system_score_codex":0.0000046918926,"about_ca_system_score_gemma":0.0000034368973,"threshold_uncertainty_score":0.38415578},"labels":[],"label_agreement":null},{"id":"W4249477401","doi":"10.1017/s0021900200021756","title":"Discrete time analysis of a repairable machine","year":2002,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Mathematics; Mean time between failures; Computer science; Algorithm; Reliability engineering; Failure rate; Statistics; Engineering","score_opus":0.012900068427511928,"score_gpt":0.21332435608959796,"score_spread":0.20042428766208603,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4249477401","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9453519,0.00016650552,0.002622028,0.00053715723,0.0000676518,0.0002489185,0.000007958843,0.0000686208,0.050929286],"genre_scores_gemma":[0.9964171,0.000006088832,0.003005534,0.0001918461,0.00017233606,0.0000029653736,0.0000055210203,0.000013966016,0.00018463218],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982977,0.000022747463,0.0008824984,0.0002186663,0.0003836053,0.00019481572],"domain_scores_gemma":[0.99776614,0.00011511279,0.0013550746,0.00045068443,0.00029158557,0.00002142322],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.001710006,0.0001616364,0.0007292143,0.00058215746,0.000082348946,0.000047259506,0.0003383682,0.000057043297,0.0024285724],"category_scores_gemma":[0.0002661769,0.00012760887,0.00053185865,0.0020691226,0.000113594804,0.00053750805,0.0001032784,0.00020926529,0.00005967656],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0038896129,0.0034365845,0.056663055,0.0012988406,0.016619716,0.00006466467,0.00094695605,0.711619,0.017711485,0.14888355,0.004996128,0.033870373],"study_design_scores_gemma":[0.0016086543,0.00008014249,0.0053978255,0.000069143,0.012340524,0.0000054863244,0.00013156088,0.6202035,0.0008335059,0.34375045,0.014892409,0.0006867907],"about_ca_topic_score_codex":0.000018568227,"about_ca_topic_score_gemma":0.000015887072,"teacher_disagreement_score":0.1948669,"about_ca_system_score_codex":0.00005781042,"about_ca_system_score_gemma":0.0000074892646,"threshold_uncertainty_score":0.99848336},"labels":[],"label_agreement":null},{"id":"W4250482034","doi":"10.1017/s0001867800011599","title":"A fluid model with data message discarding","year":2002,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Buffer overflow; Computer science; Goodput; Message passing; Mathematics; Computer network; Distributed computing; Telecommunications; Wireless","score_opus":0.03395054577369346,"score_gpt":0.2490012089841477,"score_spread":0.21505066321045424,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4250482034","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1413659,0.0021151719,0.26626447,0.0010356157,0.00019427166,0.0022717197,0.0000403445,0.0010288416,0.58568364],"genre_scores_gemma":[0.9807396,0.00005668329,0.018432666,0.00033511885,0.0001535282,0.00011006715,0.000046471105,0.000033985463,0.000091874426],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99801874,0.000015570202,0.0003644083,0.0008945556,0.0003039722,0.0004027519],"domain_scores_gemma":[0.99812335,0.00009181589,0.00019550424,0.001526404,0.000047100573,0.000015835292],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080419326,0.0002633238,0.00037342554,0.00013581548,0.00016048792,0.000108709086,0.0008511078,0.000053587402,0.0001439003],"category_scores_gemma":[0.00016034779,0.0002170447,0.000042558622,0.00088030664,0.00021154323,0.0029699455,0.0005787002,0.00022093786,0.00008407053],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002352068,0.0003340882,0.0080070915,0.0004078203,0.000040408246,0.000009935269,0.00009584464,0.6530244,0.00024616273,0.28394014,0.00016518382,0.053493716],"study_design_scores_gemma":[0.0005094729,0.0000035747737,0.00005424308,0.000037222802,0.00006111722,7.091179e-7,0.00008256854,0.64987093,0.000032465618,0.33501342,0.013974473,0.00035978662],"about_ca_topic_score_codex":0.000011951236,"about_ca_topic_score_gemma":0.00018465822,"teacher_disagreement_score":0.8393737,"about_ca_system_score_codex":0.00007161141,"about_ca_system_score_gemma":0.00000660939,"threshold_uncertainty_score":0.88508254},"labels":[],"label_agreement":null},{"id":"W4251081093","doi":"10.1017/s0021900200018349","title":"Cell loss probability for M/G/1 and time-slotted queues","year":2000,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Mathematics; Queue; Asymptotically optimal algorithm; Block (permutation group theory); Queueing theory; Buffer overflow; Combinatorics; Discrete mathematics; Applied mathematics; Statistics; Mathematical optimization; Computer science; Computer network","score_opus":0.01018014832300451,"score_gpt":0.21349116938101992,"score_spread":0.2033110210580154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251081093","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9860534,0.00006747825,0.0013263101,0.0005397788,0.00005254562,0.00072774873,0.0000043982723,0.00006748763,0.011160831],"genre_scores_gemma":[0.98184866,0.000009570861,0.016688379,0.0004649736,0.0006672195,0.00003285763,0.000006678959,0.000031264175,0.00025041535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9983484,0.000024783407,0.0007377657,0.00034254213,0.00025621368,0.0002902956],"domain_scores_gemma":[0.9984746,0.00020927655,0.00058863126,0.0003344194,0.00035762155,0.000035476613],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0022230872,0.00022745806,0.00050529995,0.0001182115,0.00018526809,0.00013336062,0.00028600244,0.00009761337,0.00060659496],"category_scores_gemma":[0.00018587052,0.00018753058,0.00019933107,0.00033989674,0.00021805127,0.00071917457,0.000064371896,0.00022722961,0.000057353947],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.03778949,0.008759532,0.03326039,0.011550138,0.001397292,0.000058224843,0.0017382397,0.10220829,0.022949263,0.40096566,0.015873851,0.36344963],"study_design_scores_gemma":[0.0011907561,0.000048220834,0.0007605134,0.00002758058,0.00023600274,0.000004653325,0.00003310544,0.003113085,0.0007750514,0.9694697,0.024062566,0.0002787438],"about_ca_topic_score_codex":0.000007164053,"about_ca_topic_score_gemma":0.000004136101,"teacher_disagreement_score":0.56850404,"about_ca_system_score_codex":0.00007687587,"about_ca_system_score_gemma":0.00003717633,"threshold_uncertainty_score":0.76472753},"labels":[],"label_agreement":null},{"id":"W4251269565","doi":"10.1090/fic/028/10","title":"On ‘catastrophic’ behavior of queueing networks","year":2000,"lang":"en","type":"other","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Queueing theory; Computer science; Layered queueing network; G-network; Computer network","score_opus":0.007584465438811554,"score_gpt":0.22125188104779994,"score_spread":0.2136674156089884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251269565","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00030152666,0.000117031355,0.0030735245,0.000026243719,0.00019360411,0.00019921495,0.0000063988537,0.00034668768,0.99573576],"genre_scores_gemma":[0.057434004,0.000053398166,0.00069038686,0.00112046,0.0029841852,0.00004211039,0.00029373865,0.0008669677,0.93651474],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990026,0.000009143659,0.00025047967,0.00032365904,0.00018617378,0.00022796403],"domain_scores_gemma":[0.9990724,0.00002804063,0.00038872164,0.00048501402,0.000017928654,0.000007899336],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000090043235,0.0002788627,0.00040169057,0.0005479859,0.00003996552,0.000045068206,0.00031029887,0.00018622197,0.024226736],"category_scores_gemma":[0.000017071703,0.0002485766,0.00016288122,0.00037285069,0.00006347838,0.00013459679,0.00007675817,0.00019823897,0.00051974744],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000112597714,0.00033215486,0.00038771186,0.00025295367,0.00027628132,0.000067240675,0.0000035169858,0.021514697,0.00003024396,0.16208446,0.7810205,0.033917606],"study_design_scores_gemma":[0.0004602958,0.000016732129,0.00006383337,0.00070582336,0.00084584055,9.581036e-7,0.000020392567,0.005173723,0.000012635838,0.0033070622,0.98858,0.00081269525],"about_ca_topic_score_codex":0.0005018145,"about_ca_topic_score_gemma":0.00016892009,"teacher_disagreement_score":0.20755947,"about_ca_system_score_codex":0.000009992024,"about_ca_system_score_gemma":0.0000050764247,"threshold_uncertainty_score":0.99999666},"labels":[],"label_agreement":null},{"id":"W4251950770","doi":"10.1007/978-1-4419-7314-6_2","title":"Markov Processes","year":2010,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Markov chain; Markov process; Computer science; Markov property; Markov renewal process; Markov model; Class (philosophy); Mathematics; Artificial intelligence; Machine learning; Statistics","score_opus":0.011457928089812153,"score_gpt":0.21095014969853088,"score_spread":0.1994922216087187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4251950770","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000019018033,0.00009834304,0.0008685497,0.00032037694,0.00024697446,0.00012802998,0.0000022446627,0.00036547933,0.997951],"genre_scores_gemma":[0.0017029239,0.000028787548,0.0009300404,0.0022100378,0.0025922726,0.000007800662,0.00007909986,0.000108351036,0.9923407],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99892944,8.501325e-7,0.0002490827,0.00039418216,0.00023067028,0.00019574755],"domain_scores_gemma":[0.99886256,0.000055320215,0.0003319427,0.00043482566,0.0003062687,0.000009088008],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.000165665,0.0003346622,0.0003349264,0.0003272038,0.000141987,0.00018396034,0.0003602477,0.0002815388,0.017894408],"category_scores_gemma":[0.0001720097,0.00029019424,0.00014017944,0.00008643664,0.000098707285,0.00061132415,0.00021512361,0.00042444761,0.0043429285],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017492102,0.0000099826075,0.000012454186,0.00041859926,0.00008196823,0.000019972194,0.000002506895,0.000007327811,0.000044889322,0.9880209,0.0041324105,0.0072314963],"study_design_scores_gemma":[0.000049784507,0.0000010054731,9.4972944e-7,0.00005210122,0.0001470874,8.648467e-7,0.0000030922383,0.000026558513,0.000017789354,0.3347964,0.6646266,0.00027776582],"about_ca_topic_score_codex":0.000019249319,"about_ca_topic_score_gemma":0.00028359398,"teacher_disagreement_score":0.6604942,"about_ca_system_score_codex":0.000013650965,"about_ca_system_score_gemma":0.000026075913,"threshold_uncertainty_score":0.999955},"labels":[],"label_agreement":null},{"id":"W4252399846","doi":"10.1017/s0021900200113002","title":"Tollbooth tandem queues with infinite homogeneous servers","year":2015,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Army Research Laboratory; Army Research Office; Division of Civil, Mechanical and Manufacturing Innovation; National Science Foundation","keywords":"Poisson distribution; Queue; Server; Mathematics; Queueing theory; Service (business); Tandem; Markovian arrival process; Homogeneous; Applied mathematics; Computer science; Mathematical optimization; Computer network; Statistics; Combinatorics","score_opus":0.023854799030926434,"score_gpt":0.22232846609351806,"score_spread":0.19847366706259162,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252399846","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9753371,0.000051675917,0.0010217008,0.0003396212,0.0001080176,0.00019688858,7.050344e-7,0.00006210499,0.02288221],"genre_scores_gemma":[0.9950933,0.0000019072478,0.0036822825,0.000572106,0.0005766057,0.0000055945166,0.000001868482,0.000022465512,0.000043901844],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985775,0.000019277688,0.0005054259,0.00020624677,0.00046121594,0.0002303434],"domain_scores_gemma":[0.9981571,0.00006532373,0.0008154425,0.0003058547,0.0006083582,0.00004795875],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0016483244,0.0001913442,0.00040735418,0.000180863,0.00009330526,0.00012622155,0.00032314152,0.00006412877,0.00006186643],"category_scores_gemma":[0.00019951783,0.00013824864,0.000116572606,0.0005641422,0.00012865897,0.00052015285,0.00009295512,0.00025179845,0.00004129584],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0089392755,0.0013259083,0.091030136,0.00064643956,0.0010563389,0.000304172,0.0013177677,0.6817942,0.0012009431,0.18458082,0.0038791625,0.023924816],"study_design_scores_gemma":[0.0037849504,0.00020816953,0.0016121787,0.00012004917,0.00073966174,0.00006959865,0.0015645296,0.003269943,0.0009753534,0.92651236,0.060328946,0.00081425847],"about_ca_topic_score_codex":0.000020530306,"about_ca_topic_score_gemma":0.00009080675,"teacher_disagreement_score":0.74193156,"about_ca_system_score_codex":0.00013407905,"about_ca_system_score_gemma":0.00010261153,"threshold_uncertainty_score":0.5637616},"labels":[],"label_agreement":null},{"id":"W4252520253","doi":"10.1007/978-1-4939-3420-1_1","title":"Introduction","year":2015,"lang":"en","type":"book-chapter","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Service (business); Router; Intersection (aeronautics); Queueing theory; Network packet; Component (thermodynamics); Computer network; Operations research; Transport engineering; Engineering; Business","score_opus":0.022981173813019787,"score_gpt":0.2258303838059818,"score_spread":0.20284920999296202,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4252520253","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000029926966,0.000109803244,0.0012272117,0.0015798667,0.0005378457,0.000077547054,7.5291314e-7,0.00028987744,0.9961741],"genre_scores_gemma":[0.00035293508,0.0000065454656,0.00018627683,0.00068952324,0.016539138,0.000002292637,0.00011743177,0.00006045109,0.9820454],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99913406,0.0000012543159,0.00019476263,0.00032426746,0.00022216534,0.0001234953],"domain_scores_gemma":[0.99910945,0.000008960877,0.00023555425,0.0003792647,0.00025948667,0.000007274663],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0002685753,0.00021798564,0.00024956398,0.0002989516,0.0000593504,0.00008828387,0.00016256885,0.00013488461,0.016342364],"category_scores_gemma":[0.00007402368,0.00019826398,0.00011248942,0.000052401592,0.000047528047,0.0005693607,0.00013445376,0.00018214797,0.0122957835],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000088819515,0.0000026015607,5.765736e-7,0.00001809407,0.000035523815,0.0000031938519,7.7282596e-7,0.00017691684,0.0000032092014,0.77754384,0.21790774,0.0042986637],"study_design_scores_gemma":[0.000040227547,0.0000010792639,1.5550361e-7,0.000007632119,0.0001045677,6.273291e-7,0.0000036532288,0.00016647376,7.5912294e-7,0.39933515,0.6001919,0.00014781606],"about_ca_topic_score_codex":0.000015571974,"about_ca_topic_score_gemma":0.000024748175,"teacher_disagreement_score":0.38228413,"about_ca_system_score_codex":0.00005468979,"about_ca_system_score_gemma":0.00000941624,"threshold_uncertainty_score":0.98847324},"labels":[],"label_agreement":null},{"id":"W4254380685","doi":"10.1023/a:1011032718715","title":"Perturbation Theory for the Asymptotic Decay Rates in the Queues with Markovian Arrival Process and/or Markovian Service Process","year":2000,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":26,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba; University of Windsor","funders":"","keywords":"Markovian arrival process; Markov process; Generality; Statistical physics; Applied mathematics; Queue; Mathematics; Sensitivity (control systems); Exponential function; Process (computing); Queueing theory; Computer science; Physics; Mathematical analysis; Statistics; Engineering","score_opus":0.010983940516318168,"score_gpt":0.2500382330015101,"score_spread":0.23905429248519194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254380685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9762255,0.0010470061,0.0032497172,0.0041481913,0.00022383156,0.003237167,0.0000066971006,0.00031289586,0.011548979],"genre_scores_gemma":[0.9954437,0.000013043764,0.00002218552,0.001519085,0.0006575105,0.00056392216,0.000018426439,0.00005678991,0.0017053523],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983189,0.00015280941,0.00038979066,0.00042662662,0.00032511284,0.000386721],"domain_scores_gemma":[0.9981417,0.00094149075,0.00028192508,0.00038827368,0.00023161434,0.0000150055785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0021127542,0.00030282984,0.00031814832,0.00016438539,0.0005879584,0.0006848109,0.00056828605,0.00007927287,0.00007196237],"category_scores_gemma":[0.00018113699,0.00015140684,0.000052053052,0.0010149278,0.00009651595,0.0011639661,0.000025359524,0.00018444192,0.00002243099],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012053881,0.00070961687,0.03445306,0.019960886,0.0012601262,0.00012952572,0.029398533,0.43397355,0.00019026869,0.40493315,0.000670847,0.06226654],"study_design_scores_gemma":[0.0033494125,0.00013371417,0.003537256,0.003235812,0.0011243131,0.00011493557,0.07578182,0.82764447,0.00011727158,0.06857372,0.014648962,0.0017383073],"about_ca_topic_score_codex":0.0003214767,"about_ca_topic_score_gemma":0.0008028689,"teacher_disagreement_score":0.39367092,"about_ca_system_score_codex":0.00003631989,"about_ca_system_score_gemma":0.000043717697,"threshold_uncertainty_score":0.66036475},"labels":[],"label_agreement":null},{"id":"W4254572246","doi":"10.1109/wsc.1994.717195","title":"Application of RPA and the harmonic gradient estimators to a priority queueing system","year":2005,"lang":"en","type":"article","venue":"Proceedings of Winter Simulation Conference","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Estimator; Queueing theory; Applied mathematics; Computer science; Imaging phantom; Fourier series; Mathematical optimization; Layered queueing network; Algorithm; Mathematics; Control theory (sociology); Statistics; Mathematical analysis; Control (management); Physics; Artificial intelligence","score_opus":0.013141470977851004,"score_gpt":0.24786628093457502,"score_spread":0.234724809956724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254572246","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8950258,0.000019495123,0.102154136,0.00063039624,0.0000262998,0.00039229,6.7742417e-7,0.00006593043,0.0016849648],"genre_scores_gemma":[0.9984345,7.4470654e-7,0.0012918847,0.000103748185,0.00011654266,0.0000227439,0.0000010433267,0.000009054831,0.000019782105],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991692,0.0000031348588,0.00035529071,0.00020457247,0.00016279529,0.00010506145],"domain_scores_gemma":[0.9988142,0.00007605549,0.0004343673,0.00008902669,0.00057496666,0.000011373162],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004866168,0.000106559695,0.00021930644,0.0001591662,0.00007451307,0.000081929116,0.00018863173,0.000028014138,0.0000068152704],"category_scores_gemma":[0.00021460999,0.00008305827,0.00004808549,0.00030525678,0.000087933964,0.00071360986,0.00012153611,0.000060377133,0.000008905574],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00039486223,0.00005043364,0.027233817,0.0008397659,0.000065718916,8.232413e-8,0.0014923697,0.04474087,0.004563478,0.89351887,0.00001988597,0.027079858],"study_design_scores_gemma":[0.00045947038,0.000006683184,0.0031083315,0.00017418321,0.00008417257,4.1920435e-7,0.00052123156,0.9901528,0.0010689258,0.003706659,0.0006141671,0.00010299362],"about_ca_topic_score_codex":0.00006123633,"about_ca_topic_score_gemma":0.0000075489916,"teacher_disagreement_score":0.9454119,"about_ca_system_score_codex":0.000029795436,"about_ca_system_score_gemma":0.0000055770065,"threshold_uncertainty_score":0.3387018},"labels":[],"label_agreement":null},{"id":"W4254625135","doi":"10.1109/perser.2004.1356797","title":"Internet performance modeling using mixture dynamical system models","year":2004,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Moncton","funders":"Atlantic Canada Opportunities Agency","keywords":"Marginal distribution; Log-normal distribution; Gaussian; Autocorrelation; Computer science; Applied mathematics; Internet traffic; Connection (principal bundle); Dynamical system (definition); Dynamical systems theory; Mathematics; Mathematical optimization; Algorithm; Random variable; Statistics; The Internet","score_opus":0.02530204963400252,"score_gpt":0.22107891039784183,"score_spread":0.19577686076383932,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254625135","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.494951,0.00001692088,0.49743345,0.000044774526,0.00008949465,0.00005913584,2.435862e-7,0.00023642821,0.007168532],"genre_scores_gemma":[0.99264586,0.0000012952577,0.00635218,0.00037830666,0.00039217327,0.0000045274114,0.000010578251,0.000035673223,0.00017940655],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988993,0.00000582299,0.000284746,0.0003125622,0.00020533829,0.0002922691],"domain_scores_gemma":[0.99949324,0.000007869653,0.00010821383,0.00026100862,0.00011637776,0.000013317073],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00023455049,0.00019473501,0.00022673632,0.00020973383,0.00014177374,0.00015633031,0.00026648073,0.00007870211,0.000040636754],"category_scores_gemma":[0.000015601468,0.00016896534,0.00010306284,0.0003818744,0.000028724913,0.0020087617,0.00017346095,0.00015984022,0.00013958647],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00001833997,0.000014341117,0.000059215887,0.000105663305,0.000020297879,0.0000049516325,0.000017928189,0.8034437,0.00014360876,0.19597779,0.000003356224,0.00019083047],"study_design_scores_gemma":[0.00026389016,0.0000023609025,0.0000018339821,0.00017149623,0.000077636636,0.000007323071,0.00023308599,0.98288906,0.000049337083,0.016048543,0.00003230459,0.00022315909],"about_ca_topic_score_codex":0.00041228157,"about_ca_topic_score_gemma":0.00003538984,"teacher_disagreement_score":0.49769485,"about_ca_system_score_codex":0.00018522775,"about_ca_system_score_gemma":0.000012362218,"threshold_uncertainty_score":0.6890207},"labels":[],"label_agreement":null},{"id":"W4254841181","doi":"10.1007/978-1-4757-5301-1_5","title":"Technical Desiderata","year":2001,"lang":"en","type":"book-chapter","venue":"Applications of mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of British Columbia","funders":"","keywords":"Mathematics; Law of the iterated logarithm; Iterated logarithm; Central limit theorem; Queueing theory; Convergence of random variables; Weak convergence; Brownian motion; Moment (physics); Limit (mathematics); Random variable; Law of large numbers; Scaling limit; Applied mathematics; Convergence (economics); Logarithm; Queue; Scaling; Mathematical analysis; Computer science","score_opus":0.024493632426304247,"score_gpt":0.2544411413917395,"score_spread":0.22994750896543525,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254841181","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000049541277,0.000115474024,0.201686,0.00016781762,0.00001140014,0.00041620233,0.000007614776,0.00015400026,0.79743654],"genre_scores_gemma":[0.012662384,0.000412902,0.21470518,0.0012535274,0.002683606,0.00068896177,0.0005587254,0.00055828143,0.76647645],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99880785,0.0000012443206,0.0005547336,0.00025831632,0.00024763469,0.00013021003],"domain_scores_gemma":[0.9977944,0.00016073164,0.0007878281,0.0010143787,0.0002332564,0.000009412965],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0002577063,0.00023968017,0.0004315238,0.00029480903,0.00009746766,0.00004488835,0.0005122516,0.0001964439,0.000905848],"category_scores_gemma":[0.000087055,0.00023813,0.00017949614,0.00014666934,0.00014506772,0.000173974,0.00021847631,0.0001958996,0.0010798421],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000012307567,0.000057209836,0.0000016230413,0.00027650048,0.000035361045,0.0000011691376,0.0000029661169,0.000041633564,0.00004855693,0.9941371,0.0023214368,0.0030752234],"study_design_scores_gemma":[0.00004246284,0.0000013475013,3.955953e-7,0.00008658748,0.00025923146,0.000003438273,0.000012616678,0.00029683125,0.000011688878,0.6777249,0.32139817,0.00016233185],"about_ca_topic_score_codex":0.000005571467,"about_ca_topic_score_gemma":0.000014361848,"teacher_disagreement_score":0.31907675,"about_ca_system_score_codex":0.000028598315,"about_ca_system_score_gemma":0.000015001153,"threshold_uncertainty_score":0.9996979},"labels":[],"label_agreement":null},{"id":"W4254914540","doi":"10.1109/wescan.1995.493945","title":"A task-oriented priority queue for telephone switch design .II. with modified FCFS and forking","year":2002,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Preemption; Priority queue; Task (project management); Queue; Queueing theory; Service (business); Computer network; Distributed computing; Fork–join queue; Real-time computing; Queue management system; Operating system; Engineering","score_opus":0.0259311143519079,"score_gpt":0.21938357613142317,"score_spread":0.19345246177951528,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4254914540","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1637133,0.00010203849,0.8292666,0.000535761,0.00007065615,0.0006818488,0.0000014256518,0.00032487937,0.0053034676],"genre_scores_gemma":[0.97594804,0.000010430262,0.020679394,0.0007888479,0.00031299327,0.000075348464,0.000008708117,0.000040176015,0.0021360836],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988405,0.000012020508,0.00022478067,0.00040322565,0.00017155756,0.0003479122],"domain_scores_gemma":[0.9992724,0.00010282376,0.00017978309,0.00026168488,0.00016386526,0.000019461833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00040536237,0.00021953494,0.00027544203,0.00019639092,0.00047708035,0.00013322625,0.00013596143,0.00006304055,0.00011302335],"category_scores_gemma":[0.00015573777,0.00017382113,0.000058827598,0.0005791997,0.00006140571,0.0008866109,0.00010994579,0.00009942197,0.000019397537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0037725866,0.0017290255,0.009657656,0.0016946371,0.0015247385,0.00010058766,0.0019077449,0.051931176,0.016229242,0.7371822,0.012726065,0.16154432],"study_design_scores_gemma":[0.0041795736,0.0001349294,0.0003980242,0.00015628753,0.0005853872,0.00000975623,0.000675886,0.9016442,0.0010592538,0.043156628,0.046891876,0.001108231],"about_ca_topic_score_codex":0.00015133468,"about_ca_topic_score_gemma":0.00010554682,"teacher_disagreement_score":0.84971297,"about_ca_system_score_codex":0.000028740373,"about_ca_system_score_gemma":0.000005363878,"threshold_uncertainty_score":0.708822},"labels":[],"label_agreement":null},{"id":"W4256055537","doi":"10.1017/s0021900200020489","title":"Space filling and depletion","year":2004,"lang":"en","type":"article","venue":"Journal of Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Bell (Canada)","funders":"","keywords":"Mathematics; Interval (graph theory); Discretization; Queue; Space (punctuation); State space; Focus (optics); Clearance; Combinatorics; State (computer science); Discrete mathematics; Applied mathematics; Algorithm; Mathematical analysis; Statistics; Computer science; Physics","score_opus":0.012407596195656404,"score_gpt":0.21737992603208042,"score_spread":0.20497232983642402,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256055537","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9806339,0.00004597592,0.01426846,0.000941981,0.00009843233,0.000112181915,2.1806603e-7,0.00002807683,0.0038707394],"genre_scores_gemma":[0.9888479,0.000006112142,0.010285035,0.0002877036,0.00055743457,0.0000011721951,7.260623e-7,0.000009100381,0.0000047788412],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9992548,0.0000050311237,0.0003079194,0.00013235718,0.0001776009,0.00012225282],"domain_scores_gemma":[0.9992424,0.00003816629,0.0004304504,0.00012976173,0.0001454745,0.000013745785],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009953086,0.00009494044,0.00019916538,0.000112154354,0.00009892156,0.00007551058,0.000105682855,0.000041344338,0.000034142686],"category_scores_gemma":[0.00015999893,0.00007883053,0.000068315225,0.00024087564,0.00006773353,0.00050616736,0.00005486572,0.0001720787,0.000014192656],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007760131,0.00028683778,0.0047775633,0.0004181326,0.000118609045,0.000012028456,0.00030021704,0.14693943,0.008034361,0.826886,0.00012607098,0.011324758],"study_design_scores_gemma":[0.000609226,0.000010916734,0.0014248547,0.00003285476,0.000091303096,0.0000069124003,0.00014353241,0.0003573991,0.000592017,0.99264294,0.003969717,0.00011834772],"about_ca_topic_score_codex":0.000009445465,"about_ca_topic_score_gemma":0.000011648243,"teacher_disagreement_score":0.16575694,"about_ca_system_score_codex":0.000061358114,"about_ca_system_score_gemma":0.000016253822,"threshold_uncertainty_score":0.3214616},"labels":[],"label_agreement":null},{"id":"W4256166859","doi":"10.1090/fic/028/08","title":"Extremal traffic and worst-case performance for queues with shaped arrivals","year":2000,"lang":"en","type":"other","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":15,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Ottawa","funders":"","keywords":"Queue; Queueing theory; Computer science; Geology; Environmental science; Computer network","score_opus":0.01321829325823597,"score_gpt":0.2199411266139533,"score_spread":0.2067228333557173,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256166859","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.06805799,0.00072881975,0.0026615474,0.00018235129,0.0001299756,0.0012232187,0.000020785945,0.001339089,0.9256562],"genre_scores_gemma":[0.18564266,0.00013555105,0.003080559,0.0008950248,0.002209166,0.0001277985,0.00010389505,0.0007702128,0.80703515],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886847,0.00000709099,0.00020513029,0.00048147253,0.00013149089,0.0003063414],"domain_scores_gemma":[0.99935746,0.000048835143,0.00024853696,0.00030001925,0.00002882852,0.000016289516],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00014431894,0.00037989995,0.0004448694,0.00044510802,0.00015011553,0.0001720344,0.00015515168,0.00014546461,0.004669533],"category_scores_gemma":[0.000015827516,0.0002869236,0.00008252476,0.00027109624,0.000106220396,0.00040415113,0.00004140175,0.00011144229,0.00009728565],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0033540814,0.0006767191,0.0016003571,0.009836635,0.002967536,0.0015582889,0.00027176298,0.013347103,0.0000869227,0.02661025,0.51385266,0.42583767],"study_design_scores_gemma":[0.0011745304,0.000037178048,0.000012254086,0.00053901685,0.0007368189,0.000084869076,0.00017499985,0.06670867,0.0000049188097,0.0003788421,0.9291356,0.001012307],"about_ca_topic_score_codex":0.000069602545,"about_ca_topic_score_gemma":0.00088162045,"teacher_disagreement_score":0.42482537,"about_ca_system_score_codex":0.00000881691,"about_ca_system_score_gemma":0.000009845587,"threshold_uncertainty_score":0.9999583},"labels":[],"label_agreement":null},{"id":"W4256432392","doi":"10.1017/s0001867800003232","title":"Approximate probabilities for runs and patterns in i.i.d. and Markov-dependent multistate trials","year":2009,"lang":"en","type":"article","venue":"Advances in Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Mathematics; Markov chain; Poisson distribution; Independent and identically distributed random variables; Sequence (biology); Applied mathematics; Combinatorics; Simple (philosophy); Matrix (chemical analysis); Approximations of π; Continuous-time Markov chain; Discrete mathematics; Markov model; Statistics; Markov property; Random variable","score_opus":0.022798879358826796,"score_gpt":0.2823665508565741,"score_spread":0.2595676714977473,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4256432392","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9770933,0.0009000014,0.014107276,0.0005237406,0.000101435944,0.0041036406,0.00003339042,0.00016182837,0.0029753866],"genre_scores_gemma":[0.98998564,0.00019139943,0.008792742,0.0003095891,0.000114837334,0.00053784356,0.000024619803,0.000019348176,0.000023954386],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977245,0.0000650323,0.0008447541,0.0007718714,0.00016451174,0.00042933837],"domain_scores_gemma":[0.99866664,0.0005709263,0.00035303374,0.00033839056,0.000050851642,0.000020141326],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0036954815,0.00029823242,0.0007438409,0.0002240209,0.00010759358,0.00012601647,0.00017920125,0.000083868516,0.000017266331],"category_scores_gemma":[0.0008233611,0.00026856846,0.00006442009,0.00029513778,0.0001704684,0.0009648404,0.00011783787,0.0001732272,0.0000015582333],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0023353093,0.0006039895,0.07016145,0.002878721,0.000030851377,0.0000069120365,0.0006297654,0.006581418,0.00065358315,0.43277717,0.0000070579104,0.4833338],"study_design_scores_gemma":[0.0020777187,0.00002469007,0.0076112617,0.000079237136,0.000034744888,7.9841766e-7,0.00044934885,0.0071664886,0.00014989215,0.98046124,0.0015648053,0.00037976008],"about_ca_topic_score_codex":0.000051035142,"about_ca_topic_score_gemma":0.000996244,"teacher_disagreement_score":0.5476841,"about_ca_system_score_codex":0.00008424896,"about_ca_system_score_gemma":0.000010397195,"threshold_uncertainty_score":0.99997663},"labels":[],"label_agreement":null},{"id":"W4281298271","doi":"10.1007/s00291-022-00684-x","title":"Synchronous resource allocation: modeling, capacity, and optimization","year":2022,"lang":"en","type":"article","venue":"OR Spectrum","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation","keywords":"Computer science; Resource allocation; Resource (disambiguation); Mathematical optimization; Operations research; Mathematics; Computer network","score_opus":0.01579009083569939,"score_gpt":0.21495144112349152,"score_spread":0.19916135028779214,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281298271","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.286672,0.00029775588,0.6561515,0.013442741,0.000411637,0.00053547573,0.000007163431,0.00080593926,0.04167585],"genre_scores_gemma":[0.9956117,0.000006894757,0.0018350558,0.0010863559,0.00040250173,0.000024059962,0.000032171014,0.000026412905,0.0009747916],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992644,0.000016778962,0.00014290241,0.00023869885,0.00017323293,0.00016394095],"domain_scores_gemma":[0.99964416,0.000016804313,0.00010358552,0.00020628296,0.00002064899,0.000008546754],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00026650517,0.00010037217,0.000114362934,0.00016507372,0.00052434055,0.00010904304,0.00015458318,0.000018089782,0.0016075507],"category_scores_gemma":[0.00005123846,0.00009970521,0.000030867082,0.00043309186,0.00002843338,0.0004065153,0.00024957937,0.00011993837,0.000023379838],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000042179327,0.000024729667,0.00010433531,0.00001528407,0.00001592621,0.000005806562,0.000042262556,0.9635364,0.000016736354,0.035467163,0.00026239158,0.00046680484],"study_design_scores_gemma":[0.00018803966,0.000011628422,0.000007125754,0.000004768339,0.0000499966,0.0000089622445,0.00029328643,0.9682871,0.000008121997,0.011554171,0.019440418,0.00014635977],"about_ca_topic_score_codex":0.00013467697,"about_ca_topic_score_gemma":0.00006468347,"teacher_disagreement_score":0.7089398,"about_ca_system_score_codex":0.000067340145,"about_ca_system_score_gemma":0.000009560924,"threshold_uncertainty_score":0.9993051},"labels":[],"label_agreement":null},{"id":"W4281858785","doi":"10.4230/lipics.aofa.2022.13","title":"Mean Field Analysis of an Incentive Algorithm for a Closed Stochastic Network","year":2022,"lang":"en","type":"preprint","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Field (mathematics); Incentive; Algorithm; Mathematics; Economics","score_opus":0.01503601822912607,"score_gpt":0.2701443491793923,"score_spread":0.2551083309502662,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4281858785","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.07100648,0.00007657806,0.9196736,0.00011892002,0.0017409628,0.0032063632,0.0026326643,0.00030010464,0.0012443204],"genre_scores_gemma":[0.87994075,0.000026290143,0.07326869,0.004422771,0.0030276508,0.0021818222,0.036324162,0.00033338263,0.00047448525],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9953646,0.000052215088,0.0021428782,0.0006917932,0.0007699215,0.0009785902],"domain_scores_gemma":[0.9939804,0.0005641174,0.003040024,0.001489575,0.00085631973,0.0000695772],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001742447,0.00081961293,0.0018594352,0.0016568346,0.00066577585,0.00047513517,0.0016917851,0.00043776515,0.00041882036],"category_scores_gemma":[0.0003454744,0.00084904634,0.0016578992,0.001810134,0.00014154853,0.0016915698,0.0021625038,0.0009450592,0.000014168823],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012279436,0.0009801412,0.0009608259,0.00313585,0.015116875,0.000007810251,0.004472312,0.8827945,0.0000060193793,0.02787538,0.001900817,0.0615215],"study_design_scores_gemma":[0.0017021308,0.00011831421,0.00011269322,0.00019062453,0.0070865927,7.544639e-7,0.0027740563,0.9591404,0.00001597662,0.017250448,0.010676379,0.00093160244],"about_ca_topic_score_codex":0.00021092551,"about_ca_topic_score_gemma":0.0002527927,"teacher_disagreement_score":0.8464049,"about_ca_system_score_codex":0.00023341311,"about_ca_system_score_gemma":0.00008463495,"threshold_uncertainty_score":0.999396},"labels":[],"label_agreement":null},{"id":"W4283522975","doi":"10.1111/poms.13779","title":"Join, balk, or jettison? The effect of flexibility and ranking knowledge in systems with batch arrivals","year":2022,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Ranking (information retrieval); Flexibility (engineering); Computer science; Set (abstract data type); Queue; Join (topology); Order (exchange); Node (physics); Operations research; Artificial intelligence; Mathematics; Economics; Statistics; Engineering","score_opus":0.013821549083760978,"score_gpt":0.25237934559327097,"score_spread":0.23855779650950998,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4283522975","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9920105,0.00066641835,0.0017298093,0.0015384111,0.0003120947,0.0015265599,0.0000015246537,0.000060579023,0.0021541456],"genre_scores_gemma":[0.9978249,0.000031054504,0.000115990726,0.00006626682,0.00012317277,0.0003336975,0.000007453014,0.000010971763,0.0014864913],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99902445,0.00013999638,0.00023591917,0.00032990478,0.000155127,0.00011462324],"domain_scores_gemma":[0.99954224,0.000043764885,0.00008390998,0.0002740592,0.000050256505,0.000005749192],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017856704,0.00011627862,0.00018456113,0.00023271157,0.00057386636,0.0001308809,0.000100078636,0.0000103040475,0.00006603346],"category_scores_gemma":[0.000083618565,0.00007312417,0.00001958185,0.0007599329,0.00007305105,0.00041056974,0.00023143127,0.00010267193,0.0000027498454],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011848956,0.00034356653,0.041578338,0.0026121775,0.00039337398,0.000013969752,0.0011655869,0.82293344,0.00037077817,0.09458576,0.0010931134,0.033725016],"study_design_scores_gemma":[0.009809867,0.0011039104,0.0514294,0.0010901614,0.003133466,0.00010032799,0.0448648,0.7032307,0.0011011558,0.0047236364,0.1770192,0.0023933868],"about_ca_topic_score_codex":0.0001205922,"about_ca_topic_score_gemma":0.00032971092,"teacher_disagreement_score":0.17592607,"about_ca_system_score_codex":0.000039641633,"about_ca_system_score_gemma":0.0000048814672,"threshold_uncertainty_score":0.4413774},"labels":[],"label_agreement":null},{"id":"W4286008162","doi":"10.1155/2022/6533567","title":"A PH<a:math xmlns:a=\"http://www.w3.org/1998/Math/MathML\" id=\"M1\"> <a:mfenced open=\"(\" close=\")\" separators=\"|\"> <a:mrow> <a:mi>i</a:mi> </a:mrow> </a:mfenced> </a:math>/PH<f:math xmlns:f=\"http://www.w3.org/1998/Math/MathML\" id=\"M2\"> <f:mfenced open=\"(\" close=\")\" separators=\"|\"> <f:mrow> <f:mi>i</f:mi> <f:mo>,</f:mo> <f:mi>n</f:mi> </f:mrow> </f:mfenced> <f:mo>/</f:mo> <f:mrow> <f:mrow> <f:mi>C</f:mi> <f:mo>/</f:mo> <f:mi>C</f:mi> </f:mrow> </f:mrow> </f:math> Queuing Model in Randomly Changing Environments for Traffic Circulation Systems","year":2022,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"Department of Science and Technology of Sichuan Province; National Natural Science Foundation of China; Xihua University; National Taiwan University; National University of Singapore","keywords":"Mathematics; Discrete mathematics; Combinatorics; Library science; Computer science","score_opus":0.018452432700569812,"score_gpt":0.2595482555864878,"score_spread":0.241095822885918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4286008162","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94132024,0.0052783643,0.029312974,0.0014762717,0.006753575,0.008260782,0.0018963772,0.0021151372,0.003586256],"genre_scores_gemma":[0.96106344,0.0027244242,0.010436006,0.0038755124,0.0049537695,0.008302045,0.003788749,0.0028044288,0.002051594],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.95285946,0.0022486765,0.01488668,0.009537247,0.010332852,0.010135104],"domain_scores_gemma":[0.968005,0.0033443142,0.018367542,0.005423987,0.0023356196,0.002523522],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"category_scores_codex":[0.017305443,0.007797687,0.008606955,0.007106,0.008409385,0.005675037,0.012116195,0.0039797463,0.00076157774],"category_scores_gemma":[0.0027252117,0.009059489,0.0059085153,0.010764885,0.0024526995,0.02368879,0.00326274,0.008291578,0.0014589536],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.012537678,0.0044704233,0.0010990613,0.0041237893,0.0036792352,0.0017305077,0.008491687,0.5467747,0.035224725,0.37199235,0.002900356,0.006975494],"study_design_scores_gemma":[0.03609815,0.0027218906,0.0026454278,0.0064996094,0.007169763,0.0015479119,0.019612383,0.85954595,0.0073579354,0.008336118,0.03637684,0.012088018],"about_ca_topic_score_codex":0.0014140378,"about_ca_topic_score_gemma":0.0010116217,"teacher_disagreement_score":0.36365622,"about_ca_system_score_codex":0.0032145418,"about_ca_system_score_gemma":0.0029960966,"threshold_uncertainty_score":0.99931854},"labels":[],"label_agreement":null},{"id":"W4290720352","doi":"10.3390/math10152799","title":"Tail Asymptotics for a Retrial Queue with Bernoulli Schedule","year":2022,"lang":"en","type":"article","venue":"Mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Anhui Jianzhu University; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Retrial queue; Bernoulli's principle; Queue; Mathematics; Schedule; Applied mathematics; Harmonic number; Computer science; Physics; Mathematical analysis; Queueing system; Riemann hypothesis; Computer network","score_opus":0.018327203491485623,"score_gpt":0.22967832902323207,"score_spread":0.21135112553174645,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4290720352","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.59108144,0.00008730893,0.38380292,0.0022259194,0.0007509229,0.0018410863,0.000049907987,0.0007694787,0.019391024],"genre_scores_gemma":[0.90218616,0.0000014176256,0.08985804,0.001481818,0.0014843952,0.0003656198,0.00010721009,0.0001586566,0.004356713],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9989038,0.000010705382,0.00027379981,0.00022213646,0.00033124597,0.00025832237],"domain_scores_gemma":[0.9990166,0.00016729323,0.00032411577,0.0003632493,0.000118527656,0.000010254172],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000671746,0.00016343476,0.00027184363,0.0001703926,0.00047659484,0.00012577706,0.000310593,0.000030551724,0.00044135764],"category_scores_gemma":[0.0003653539,0.0001450919,0.000098306125,0.0005740344,0.000045503017,0.00029621113,0.00022930597,0.00015127244,0.00006347159],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002681881,0.0005072806,0.0004824065,0.00061756076,0.00022530119,0.000015956484,0.00036656385,0.030131381,0.00029507454,0.9624899,0.0037766586,0.0008237352],"study_design_scores_gemma":[0.0032439593,0.00015502598,0.000013354916,0.00009035974,0.0009272911,0.000017921857,0.0043180627,0.28912914,0.00035036114,0.52515596,0.17565393,0.000944635],"about_ca_topic_score_codex":0.000006747795,"about_ca_topic_score_gemma":0.000014538162,"teacher_disagreement_score":0.43733394,"about_ca_system_score_codex":0.00006300913,"about_ca_system_score_gemma":0.000022155156,"threshold_uncertainty_score":0.5916676},"labels":[],"label_agreement":null},{"id":"W4293576925","doi":"10.2139/ssrn.4197121","title":"The Effects of Information Granularity on Abandonment and Congestion in Non-Stationary Priority Queues","year":2022,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Canada Research Chairs; Western University; University of Toronto","funders":"","keywords":"Abandonment (legal); Granularity; Queue; Priority queue; Computer science; Business; Queueing theory; Computer network; Political science; Operating system","score_opus":0.0021812464816104607,"score_gpt":0.1973537762807317,"score_spread":0.19517252979912122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4293576925","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9974556,0.00036563995,0.0012591704,0.0004627531,0.00011697672,0.0001675641,5.0841476e-7,0.000009563066,0.0001622396],"genre_scores_gemma":[0.9992676,0.00045508295,0.0000072729163,0.00015083788,0.0000607617,0.000015719941,0.0000078776575,0.0000044655185,0.000030425426],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9990553,0.000046768644,0.00021365784,0.0000667494,0.00023507254,0.00038241275],"domain_scores_gemma":[0.99940735,0.00019277788,0.00027733267,0.0000751353,0.000042748714,0.0000046641267],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019540784,0.00007161411,0.00009775823,0.00017009469,0.00044309543,0.00005029457,0.00011211241,0.000015368276,0.0000040219957],"category_scores_gemma":[0.00024801164,0.000057474354,0.000036433816,0.00022703025,0.00003260861,0.0007072441,0.00006504488,0.00067129533,0.0000019954005],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000678425,0.00013690519,0.025942326,0.00010712928,0.00010992805,0.00000391235,0.0003983922,0.011432566,0.00032193147,0.8803618,0.00003721328,0.08046947],"study_design_scores_gemma":[0.0017115632,0.0001884459,0.07118174,0.000041669206,0.000077931516,0.000018829962,0.0018652575,0.0076341983,0.000058352234,0.91485405,0.0021969755,0.00017096632],"about_ca_topic_score_codex":0.00013437805,"about_ca_topic_score_gemma":0.00042189163,"teacher_disagreement_score":0.080298506,"about_ca_system_score_codex":0.00031826788,"about_ca_system_score_gemma":0.00007601865,"threshold_uncertainty_score":0.34079766},"labels":[],"label_agreement":null},{"id":"W4294176588","doi":"10.3390/math10173142","title":"The Geo/Ga,Y/1/N Queue Revisited","year":2022,"lang":"en","type":"article","venue":"Mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Queue; Bulk queue; Computer science; Queueing system; Queueing theory; Burke's theorem; State space; State (computer science); Process (computing); Relation (database); Applied mathematics; Distribution (mathematics); Mathematics; Mathematical optimization; Algorithm; Discrete mathematics; Queue management system; Fork–join queue; Statistics; Mathematical analysis; Computer network","score_opus":0.01344373677549977,"score_gpt":0.2272084016607849,"score_spread":0.21376466488528514,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294176588","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.44843325,0.0019485821,0.06202733,0.019584619,0.0020276331,0.0024662793,0.000031646094,0.00266646,0.46081418],"genre_scores_gemma":[0.9769532,0.000018633942,0.0031119648,0.004445899,0.0010039398,0.00018530765,0.000042842636,0.00010530898,0.014132898],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990542,0.000020602127,0.00026081604,0.00014913824,0.0002994951,0.00021574015],"domain_scores_gemma":[0.99899447,0.00020165512,0.0002528409,0.00048262652,0.000062297455,0.0000061198034],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010038536,0.000115214454,0.00015693478,0.000091513946,0.0010915782,0.00018842108,0.00046776832,0.000014930794,0.00076969276],"category_scores_gemma":[0.0003701586,0.000085212865,0.0000965589,0.0006279259,0.000043463428,0.00021752587,0.0004701189,0.00016894212,0.0003913313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011956352,0.000083549596,0.000109837405,0.000111348374,0.00005644871,0.00001144667,0.00015351038,0.002441867,0.00015486835,0.98206884,0.012102544,0.0026937595],"study_design_scores_gemma":[0.00014018561,0.000004396453,0.000027406439,0.000015150893,0.000101275364,0.0000049292753,0.0014791216,0.04985568,0.000016627184,0.4213868,0.52678126,0.00018715656],"about_ca_topic_score_codex":0.000012448203,"about_ca_topic_score_gemma":0.000007028993,"teacher_disagreement_score":0.56068206,"about_ca_system_score_codex":0.00004088008,"about_ca_system_score_gemma":0.000006454965,"threshold_uncertainty_score":0.8427596},"labels":[],"label_agreement":null},{"id":"W4294653099","doi":"10.1214/10505167000000212","title":"A Markov chain model of a polling system with parameter regeneration","year":2007,"lang":"en","type":"article","venue":"HAL (Le Centre pour la Communication Scientifique Directe)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Polling; Polling system; Markov chain; Regeneration (biology); Computer science; Cell biology; Computer network; Biology; Machine learning","score_opus":0.011784382130390684,"score_gpt":0.20365420776100457,"score_spread":0.1918698256306139,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4294653099","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23504665,0.00006535562,0.7424302,0.0007498405,0.00002264608,0.0001351867,0.0000021137641,0.00012522923,0.021422766],"genre_scores_gemma":[0.9440584,0.000005853297,0.054139502,0.000105618965,0.000033994453,0.000010500251,0.000044615474,0.00002702928,0.0015744538],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853796,0.0002751446,0.0003676196,0.00031056986,0.00027675505,0.00023197355],"domain_scores_gemma":[0.9971501,0.00044808583,0.00047052687,0.0007424169,0.0011662837,0.00002254861],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.005365207,0.00015268661,0.00021337975,0.00027009557,0.00022918732,0.00013372251,0.00034207085,0.000062958374,0.000020085805],"category_scores_gemma":[0.00055954384,0.00014087532,0.000085144995,0.0006701772,0.00010144419,0.00045782173,0.00012955663,0.00011533278,0.000012714283],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008687423,0.00017774748,0.0017851873,0.00022221799,0.00006736477,0.0000038737553,0.0009352643,0.012469009,0.018767066,0.9489718,0.00005049402,0.016463088],"study_design_scores_gemma":[0.00045108225,1.885888e-7,0.00020463803,0.00067534053,0.00007783347,0.0000028178429,0.00035834822,0.95511746,0.03912776,0.003275075,0.00046772402,0.00024174506],"about_ca_topic_score_codex":0.0004165019,"about_ca_topic_score_gemma":0.001216434,"teacher_disagreement_score":0.9456967,"about_ca_system_score_codex":0.00005507835,"about_ca_system_score_gemma":0.000026283857,"threshold_uncertainty_score":0.57447284},"labels":[],"label_agreement":null},{"id":"W4296993750","doi":"10.3390/math10193445","title":"Analytic and Computational Analysis of GI/Ma,b/c Queueing System","year":2022,"lang":"en","type":"article","venue":"Mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Queueing theory; Computer science; Epoch (astronomy); Layered queueing network; Server; Markov chain; G-network; Queue; Bulk queue; Exponential distribution; Service (business); Computer network; Distributed computing; Real-time computing; Mathematics; Statistics","score_opus":0.013482012612987019,"score_gpt":0.22956240313855886,"score_spread":0.21608039052557185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4296993750","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9042075,0.000081133694,0.08810905,0.0001316205,0.0000645211,0.00015797137,0.000015104385,0.00015329296,0.0070797554],"genre_scores_gemma":[0.9954065,3.936407e-7,0.0042446093,0.00010909014,0.000041025785,0.000011368244,0.00003409315,0.000015399393,0.00013753395],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99900013,0.000018206774,0.00037103245,0.0001698756,0.0003198992,0.00012087138],"domain_scores_gemma":[0.9991025,0.00017236198,0.00042046385,0.00021064436,0.000086286855,0.000007774742],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00062708324,0.00010618783,0.00038803878,0.00073338376,0.00023149962,0.00005423862,0.00016298497,0.000015516584,0.0002260715],"category_scores_gemma":[0.00007760258,0.00010668187,0.00013652771,0.0018809893,0.00004247398,0.00019484328,0.00024536546,0.000076828415,0.000009876255],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000070337446,0.00007099912,0.0028527386,0.00048048596,0.0008600911,0.000006957288,0.00026078586,0.5378823,0.000044810604,0.45726895,0.000057133046,0.00020768169],"study_design_scores_gemma":[0.00011803476,0.0000036269564,0.00055384706,0.000019895679,0.0021383956,0.000002255824,0.002701299,0.969083,0.0000032182706,0.024992364,0.0002684859,0.00011557219],"about_ca_topic_score_codex":0.000043968714,"about_ca_topic_score_gemma":0.00001090219,"teacher_disagreement_score":0.43227658,"about_ca_system_score_codex":0.000049204613,"about_ca_system_score_gemma":0.0000073938986,"threshold_uncertainty_score":0.43503606},"labels":[],"label_agreement":null},{"id":"W4299643812","doi":"10.1007/978-3-031-79260-1_3","title":"Loss Models for Networks","year":2013,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on learning, networks, and algorithms","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science","score_opus":0.013123845225510522,"score_gpt":0.2100216079721029,"score_spread":0.19689776274659238,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4299643812","genre_codex":"methods","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000056537327,0.008546278,0.6751125,0.000651285,0.0013377526,0.0017106072,0.000016079755,0.0009943404,0.3115746],"genre_scores_gemma":[0.13069694,0.0073976764,0.0037886514,0.007602882,0.04149494,0.00093465473,0.0007381582,0.0017720989,0.805574],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9967944,0.000045040797,0.0006366112,0.0012436432,0.000400996,0.0008792944],"domain_scores_gemma":[0.996758,0.0013184254,0.0009982714,0.0005891618,0.000266297,0.00006983389],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.000732902,0.0010662314,0.00125178,0.00049400574,0.00086099806,0.00062527735,0.00051414734,0.000859961,0.0010756936],"category_scores_gemma":[0.0003163073,0.00095122744,0.00059233804,0.00013860661,0.00028504283,0.0005735962,0.00021799264,0.0012997091,0.00013943504],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010926163,0.000019467232,0.0000050120284,0.00010372031,0.00036317142,0.000012200815,0.0000120148825,0.7178171,3.2540066e-7,0.10268252,0.006619358,0.17225578],"study_design_scores_gemma":[0.00019791369,0.00003147199,0.000002765972,0.0003685057,0.00048108274,0.000003286143,0.000010735511,0.5931778,0.0000011552862,0.09153854,0.31339133,0.0007954346],"about_ca_topic_score_codex":0.00004711847,"about_ca_topic_score_gemma":0.000023962157,"teacher_disagreement_score":0.67132384,"about_ca_system_score_codex":0.00006982662,"about_ca_system_score_gemma":0.000018114104,"threshold_uncertainty_score":0.99983746},"labels":[],"label_agreement":null},{"id":"W4300044312","doi":"","title":"Real-Time Scheduling Policies for Multiclass Call Centers with Impatient Customers","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Computer science; Scheduling (production processes); Operations research; Business; Real-time computing; Operations management; Economics; Mathematics","score_opus":0.010200764649993742,"score_gpt":0.25049284874975897,"score_spread":0.2402920840997652,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300044312","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94650996,0.000005134434,0.026811482,0.00037273805,0.000090057816,0.00037097806,0.0000021402059,0.00032633124,0.02551121],"genre_scores_gemma":[0.987893,0.0000020249497,0.009211987,0.0009622016,0.0003421842,0.000013089466,0.000028056103,0.00004487114,0.0015026168],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988235,0.0000044138633,0.0002539525,0.00026401322,0.00018414584,0.00046996414],"domain_scores_gemma":[0.9992654,0.00012170166,0.0001869534,0.00021630053,0.00018568401,0.000024010471],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000468058,0.00018577249,0.00020674094,0.00031303734,0.00019707273,0.00009421739,0.00016576002,0.000042234868,0.000040723327],"category_scores_gemma":[0.00009742389,0.00014383049,0.00010073626,0.0004319054,0.00007837437,0.0005984441,0.00007006262,0.00006414234,0.000089939895],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0057630674,0.0011628247,0.048581313,0.0010516142,0.0015639573,0.00008221231,0.0016732535,0.48562536,0.11033417,0.31181762,0.00493406,0.027410565],"study_design_scores_gemma":[0.007820122,0.00021564604,0.0042090532,0.00035920797,0.001226771,0.0000071144955,0.00922234,0.8908062,0.009875023,0.0041824304,0.06930059,0.002775491],"about_ca_topic_score_codex":0.0008710765,"about_ca_topic_score_gemma":0.00030897142,"teacher_disagreement_score":0.40518087,"about_ca_system_score_codex":0.0000779839,"about_ca_system_score_gemma":0.000008589159,"threshold_uncertainty_score":0.5865237},"labels":[],"label_agreement":null},{"id":"W4300541186","doi":"10.1007/978-3-031-79260-1_4","title":"Stochastic Networks and Insensitivity","year":2013,"lang":"en","type":"book-chapter","venue":"Synthesis lectures on learning, networks, and algorithms","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Statistical physics; Physics","score_opus":0.008628905973120387,"score_gpt":0.1939300392007738,"score_spread":0.18530113322765343,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300541186","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0036659776,0.028005656,0.503456,0.0017857032,0.003209082,0.0031557386,0.000024810164,0.0027802954,0.45391676],"genre_scores_gemma":[0.8139178,0.00275121,0.00045038617,0.0036857112,0.015348897,0.000114509436,0.0001709147,0.00071602414,0.16284452],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99716455,0.0000844554,0.0004940857,0.0011615881,0.0003904705,0.0007048705],"domain_scores_gemma":[0.997052,0.0014239169,0.0008128425,0.00047165682,0.00015853783,0.000081054146],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007157368,0.0009881078,0.0011688196,0.0004925767,0.00080547144,0.0006137649,0.00025116783,0.00070385175,0.0007842806],"category_scores_gemma":[0.0005515871,0.0008886054,0.00026665733,0.00014636522,0.00043147532,0.000391028,0.0003069281,0.0016898777,0.00014499722],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011385578,0.000029169461,0.000026038857,0.00009638826,0.0004687778,0.00006482351,0.000026252752,0.63428885,0.0000019972908,0.026159205,0.0025694673,0.33615515],"study_design_scores_gemma":[0.00035164453,0.000067400586,0.00017803948,0.0010309271,0.0010318687,0.000030485766,0.000036813413,0.82477665,0.0000016181169,0.024500482,0.14624824,0.001745829],"about_ca_topic_score_codex":0.00009487247,"about_ca_topic_score_gemma":0.000051599873,"teacher_disagreement_score":0.81025183,"about_ca_system_score_codex":0.000052622716,"about_ca_system_score_gemma":0.000014427858,"threshold_uncertainty_score":0.99935645},"labels":[],"label_agreement":null},{"id":"W4300577545","doi":"10.48550/arxiv.1112.0348","title":"Explicit Characterization of Stability Region for Stationary Multi-Queue\\n Multi-Server Systems","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Queue; Hyperplane; Stability (learning theory); Linear inequality; Polytope; Queueing theory; Mathematics; Finite set; Applied mathematics; Mathematical optimization; Computer science; Discrete mathematics; Combinatorics; Mathematical analysis; Inequality","score_opus":0.16568631502799627,"score_gpt":0.20610198797068105,"score_spread":0.04041567294268478,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4300577545","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5711015,0.000012004386,0.42765552,0.000009624584,0.00028525156,0.00068066176,0.000039588776,0.000115233044,0.00010064227],"genre_scores_gemma":[0.9976229,0.000033866872,0.00048382411,0.000049693645,0.00019202006,0.000013198168,0.0006660892,0.000049982016,0.0008884398],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99830246,0.000068850124,0.00043042225,0.0008581873,0.000082302344,0.00025780633],"domain_scores_gemma":[0.9970527,0.000083420855,0.0012366248,0.00083708414,0.0007662862,0.000023827648],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00043591013,0.0003344645,0.0005106177,0.00042974376,0.00015541555,0.0000596278,0.0005440636,0.00026183898,0.000052883755],"category_scores_gemma":[0.0001459656,0.0003918659,0.00029750366,0.00047294042,0.00009366822,0.0011778562,0.0005435668,0.00021907585,0.000027230159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00153734,0.0016005908,0.082710996,0.006636549,0.0009128418,0.000075593234,0.0005441462,0.3306638,0.0061749183,0.5687161,0.00006363688,0.00036348848],"study_design_scores_gemma":[0.0015597277,0.000018824077,0.01032457,0.00036937822,0.00076048943,5.066349e-7,0.0007841822,0.9685597,0.0003955658,0.015892101,0.00053256314,0.00080239784],"about_ca_topic_score_codex":0.0006898029,"about_ca_topic_score_gemma":0.00008938136,"teacher_disagreement_score":0.6378959,"about_ca_system_score_codex":0.00014911713,"about_ca_system_score_gemma":0.000043806325,"threshold_uncertainty_score":0.9998533},"labels":[],"label_agreement":null},{"id":"W4301235919","doi":"10.48550/arxiv.cs/0507004","title":"An End-to-End Probabilistic Network Calculus with Moment Generating\\n Functions","year":2005,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Network calculus; Computer science; Server; Probabilistic logic; Statistical time division multiplexing; Multiplexing; Queueing theory; Moment (physics); Theoretical computer science; Scalability; Algorithm; Calculus (dental); Computer network; Artificial intelligence; Quality of service; Telecommunications","score_opus":0.03614360997639721,"score_gpt":0.18190710759234605,"score_spread":0.14576349761594884,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4301235919","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5714217,0.000032973683,0.42122686,0.00018120224,0.000401447,0.00062826107,0.000014685336,0.0004655895,0.005627305],"genre_scores_gemma":[0.99172795,0.000008631942,0.0015721335,0.0006795009,0.002331946,0.000010128001,0.00019648048,0.000070035756,0.0034031963],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9976533,0.00006372926,0.00027819513,0.0012878109,0.000153985,0.00056295027],"domain_scores_gemma":[0.9979834,0.00005241974,0.00040068297,0.0011699602,0.00030888224,0.00008464985],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00040121644,0.000494331,0.00046226743,0.00041774492,0.000534232,0.00028147476,0.00071397953,0.0001865122,0.0006528121],"category_scores_gemma":[0.000041929085,0.000511707,0.00018784046,0.0012841189,0.00014139006,0.00076233497,0.0007829455,0.0005226644,0.0003251944],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0001239431,0.0001340101,0.0016590622,0.000057240988,0.00018123176,0.000092626266,0.000028999832,0.91151553,0.000022544038,0.08472363,0.000413459,0.0010477488],"study_design_scores_gemma":[0.0005557605,0.000056859993,0.0004936128,0.00019444083,0.0013897322,0.000002165083,0.0002650891,0.9605036,0.0000067254696,0.015769482,0.019630767,0.0011318137],"about_ca_topic_score_codex":0.00036930913,"about_ca_topic_score_gemma":0.0015277357,"teacher_disagreement_score":0.42030627,"about_ca_system_score_codex":0.0003409527,"about_ca_system_score_gemma":0.000081490274,"threshold_uncertainty_score":0.99973345},"labels":[],"label_agreement":null},{"id":"W4317207528","doi":"10.1007/s10479-023-05171-2","title":"Continuous review (s, Q) inventory system at a service facility with positive order lead times","year":2023,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Wilfrid Laurier University","funders":"National Board for Higher Mathematics","keywords":"Lead time; Operations research; Poisson distribution; Computer science; Random variable; Markov chain; Queueing theory; Joint probability distribution; Service (business); Exponential distribution; Queue; Stockout; Mathematical optimization; Operations management; Statistics; Mathematics; Business; Economics; Computer network; Marketing","score_opus":0.1318013077925689,"score_gpt":0.391614083969483,"score_spread":0.2598127761769141,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317207528","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.89753705,0.0057398314,0.00059160945,0.04729348,0.00009103663,0.0027781026,0.00015737326,0.0005899729,0.045221556],"genre_scores_gemma":[0.9829358,0.0008183292,0.00011311401,0.002714632,0.00017226374,0.00023602248,0.00054069696,0.000033940116,0.012435201],"study_design_codex":"not_applicable","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99823946,0.00017388912,0.0003121018,0.00031444774,0.0006058295,0.00035429164],"domain_scores_gemma":[0.99570906,0.00012326363,0.000063976404,0.0004555099,0.0036275925,0.000020569261],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0026254924,0.00012707054,0.00031260474,0.00040943502,0.0005274466,0.00010867856,0.00030438026,0.000041007894,0.00034547594],"category_scores_gemma":[0.0006212195,0.00010268001,0.00006221119,0.003608102,0.00014090478,0.00075523654,0.00031455187,0.00017984898,0.002324591],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0017525823,0.0012962903,0.013885715,0.052401707,0.002847137,0.0005163605,0.0024284357,0.12623586,0.010725878,0.29455635,0.47456577,0.018787943],"study_design_scores_gemma":[0.003945598,0.0006009163,0.008655052,0.03190393,0.0010455798,0.0000502561,0.022503205,0.5305516,0.0103583615,0.003945069,0.3828216,0.0036188406],"about_ca_topic_score_codex":0.0010661402,"about_ca_topic_score_gemma":0.001073387,"teacher_disagreement_score":0.40431577,"about_ca_system_score_codex":0.000038307702,"about_ca_system_score_gemma":0.00006772562,"threshold_uncertainty_score":0.9984522},"labels":[],"label_agreement":null},{"id":"W4317792384","doi":"10.1109/wsc57314.2022.10015281","title":"A Logistic Regression and Linear Programming Approach for Multi-Skill Staffing Optimization in Call Centers","year":2022,"lang":"en","type":"article","venue":"2022 Winter Simulation Conference (WSC)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Staffing; Logistic regression; Computer science; Quality of service; Key (lock); Mathematical optimization; Quality (philosophy); Linear programming; Service (business); Operations research; Machine learning; Computer network; Mathematics; Algorithm; Operating system","score_opus":0.07365406406088998,"score_gpt":0.31503708605791164,"score_spread":0.24138302199702166,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4317792384","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.024433656,0.00002947181,0.97435236,0.00013771685,0.00013337059,0.00065686874,0.000008432831,0.00010552796,0.00014261417],"genre_scores_gemma":[0.96415377,0.0000021044468,0.03465472,0.00025050977,0.00011043633,0.00015746694,0.00035814772,0.00002973816,0.00028308897],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99869657,0.00005540256,0.0003458065,0.00045061155,0.00020047418,0.00025111594],"domain_scores_gemma":[0.9992522,0.00011130613,0.00028559318,0.00018346969,0.00015231583,0.000015092154],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050489424,0.00018119837,0.00022582858,0.00037083798,0.00031813237,0.00015048056,0.00018278636,0.000042977656,0.00015087416],"category_scores_gemma":[0.00035920338,0.00018292236,0.00006522149,0.00044140778,0.000044781948,0.00066771655,0.00029981163,0.00019342231,0.0000018174381],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015594964,0.000118374584,0.0032425188,0.00008333669,0.000015745534,0.0000025391714,0.00031745926,0.98842466,0.000043926942,0.0010193327,0.000016943017,0.006559231],"study_design_scores_gemma":[0.0009779214,0.000020878408,0.00017561842,0.00004385649,0.000041545594,5.1949155e-7,0.0011180942,0.9954116,0.00000390884,0.00026021895,0.0017385355,0.0002073297],"about_ca_topic_score_codex":0.000058142054,"about_ca_topic_score_gemma":0.00003595641,"teacher_disagreement_score":0.93972015,"about_ca_system_score_codex":0.00009864284,"about_ca_system_score_gemma":0.000016709984,"threshold_uncertainty_score":0.74593574},"labels":[],"label_agreement":null},{"id":"W4322502100","doi":"10.3390/math11051142","title":"A Novel Computational Procedure for the Waiting-Time Distribution (In the Queue) for Bulk-Service Finite-Buffer Queues with Poisson Input","year":2023,"lang":"en","type":"article","venue":"Mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":11,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Bulk queue; Computer science; Fork–join queue; Mathematics; Mathematical optimization; Queue; Applied mathematics; Queue management system; Computer network","score_opus":0.026357429163726014,"score_gpt":0.25522712789069685,"score_spread":0.22886969872697083,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4322502100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.21945184,0.000027613587,0.75018257,0.026428776,0.00007957084,0.0029566595,0.00015131588,0.000397471,0.0003241941],"genre_scores_gemma":[0.98776984,0.0000014831113,0.006201919,0.0028186815,0.0006084985,0.00089970336,0.0011551888,0.000071807845,0.00047285037],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990037,0.000008455909,0.00027935626,0.00019885121,0.00024827552,0.0002613328],"domain_scores_gemma":[0.9971462,0.002085029,0.00025792536,0.00022135608,0.00028365286,0.0000058369233],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0010495881,0.00017168201,0.00019915758,0.0000844112,0.00036514152,0.0002138938,0.00034457448,0.000048000085,0.00001325781],"category_scores_gemma":[0.0008747973,0.00009780995,0.00008159179,0.0009532989,0.000041297455,0.00025635262,0.00006254509,0.000093583694,0.00006941487],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021080529,0.00039081392,0.00013034651,0.0025364559,0.0001885853,0.0000025566237,0.002618048,0.56113225,0.0002516245,0.4254882,0.006313773,0.00073653035],"study_design_scores_gemma":[0.00048334105,0.000011417184,0.00014022141,0.00013085763,0.00014762447,0.0000019026531,0.0013034175,0.87926865,0.000015712838,0.115470715,0.0028854518,0.0001407054],"about_ca_topic_score_codex":0.000027432452,"about_ca_topic_score_gemma":0.00009765558,"teacher_disagreement_score":0.768318,"about_ca_system_score_codex":0.000028153663,"about_ca_system_score_gemma":0.00002100134,"threshold_uncertainty_score":0.39885738},"labels":[],"label_agreement":null},{"id":"W4361219517","doi":"10.1007/s11134-023-09874-y","title":"Refined tail asymptotic properties for the $$M^X/G/1$$ retrial queue","year":2023,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Anhui Provincial Department of Education; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Retrial queue; Queue; Equivalence (formal languages); Mathematics; Queueing system; Discrete mathematics; Applied mathematics; Combinatorics; Computer science; Computer network","score_opus":0.04293434448452829,"score_gpt":0.2437705120846356,"score_spread":0.2008361676001073,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4361219517","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.78915906,0.0060354257,0.07969261,0.02880626,0.034858633,0.013378683,0.00005116261,0.01399227,0.03402592],"genre_scores_gemma":[0.9853569,0.000007856419,0.000029141436,0.00040193507,0.004618846,0.00037786757,0.00002642786,0.0000767295,0.00910425],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982829,0.000048884736,0.0004787411,0.00038780278,0.0003311867,0.00047047815],"domain_scores_gemma":[0.9984206,0.00044542048,0.00033706412,0.0005570793,0.00022695072,0.000012859663],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019885667,0.00023623131,0.00035829237,0.00031060172,0.0006995021,0.0005655197,0.0004943645,0.000094128896,0.00002124184],"category_scores_gemma":[0.0015395405,0.00015570651,0.00020087467,0.0012679771,0.00008290258,0.0006855508,0.0001529351,0.00014454924,0.0006979555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0009225306,0.000089007335,0.0019672127,0.0030412225,0.00096216216,0.000046071193,0.00060095853,0.20755737,0.012953567,0.68946975,0.0725332,0.0098569365],"study_design_scores_gemma":[0.0012272941,0.000027174914,0.00022503805,0.0005285931,0.00038086844,0.000004278285,0.0023257209,0.5656057,0.00021780966,0.0066539426,0.4221788,0.00062475004],"about_ca_topic_score_codex":0.0007664122,"about_ca_topic_score_gemma":0.00007423301,"teacher_disagreement_score":0.68281585,"about_ca_system_score_codex":0.00006554628,"about_ca_system_score_gemma":0.000027203056,"threshold_uncertainty_score":0.89710385},"labels":[],"label_agreement":null},{"id":"W4366810031","doi":"10.5220/0006235500001482","title":"Optimization and Scheduling of Queueing Systems for Communication Systems: OR Needs and Challenges","year":2017,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Queueing theory; Scheduling (production processes); Distributed computing; Layered queueing network; Computer network; Mathematical optimization; Mathematics","score_opus":0.05889017913487303,"score_gpt":0.2739644162138512,"score_spread":0.21507423707897816,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4366810031","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.27169263,0.03586239,0.67242384,0.0034907998,0.00043883987,0.0017754405,0.0000046381037,0.00031572787,0.013995708],"genre_scores_gemma":[0.99320036,0.0019145694,0.004540323,0.000020631793,0.0001235042,0.000028387305,0.0000059635504,0.000014920614,0.00015133625],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99950886,0.000013996283,0.00020620192,0.00011965097,0.0000633274,0.00008798705],"domain_scores_gemma":[0.9988778,0.00012651237,0.00044642275,0.0003731533,0.0001697277,0.0000063522225],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006227001,0.00008557096,0.00020278005,0.00015537787,0.00042384016,0.0003559175,0.0001628932,0.00004572336,0.0000029486096],"category_scores_gemma":[0.0003342266,0.00006959861,0.000018485778,0.000055562214,0.000067482375,0.0012261881,0.00014403035,0.000031208572,5.854523e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00007011562,0.000018384895,0.0013975989,0.0022071924,0.000082689054,2.778691e-7,0.00014650071,0.29651374,0.000051784154,0.6974772,0.000010609466,0.0020238685],"study_design_scores_gemma":[0.00034988404,0.0000066729453,0.00008333011,0.0003176015,0.00009886984,0.0000010280612,0.00449263,0.9921189,0.000007174105,0.0013953499,0.001020154,0.000108432665],"about_ca_topic_score_codex":0.00032079566,"about_ca_topic_score_gemma":0.000052454816,"teacher_disagreement_score":0.7215077,"about_ca_system_score_codex":0.000007565749,"about_ca_system_score_gemma":0.0000033079225,"threshold_uncertainty_score":0.34321207},"labels":[],"label_agreement":null},{"id":"W4367323522","doi":"10.1287/opre.2023.2452","title":"Preface to the Special Issue on Behavioral Queueing Science: The Need for a Multidisciplinary Approach","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Multidisciplinary approach; Queueing theory; Computer science; Management science; Service (business); Work (physics); Operations research; Strengths and weaknesses; Behavioral modeling; Behavioural sciences; Field (mathematics); Queue; Engineering ethics; Risk analysis (engineering); Psychology; Artificial intelligence; Sociology; Social science; Engineering; Mathematics; Psychotherapist; Medicine; Social psychology","score_opus":0.12114341980471321,"score_gpt":0.43202313807992077,"score_spread":0.31087971827520755,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4367323522","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.88771987,0.000011980589,0.003986389,0.06195984,0.0006248287,0.004519681,0.000019410048,0.00024490885,0.040913112],"genre_scores_gemma":[0.9663111,0.0000025544714,0.0011306329,0.0004183746,0.010306143,0.0012279691,0.000052457974,0.000037095717,0.020513697],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981824,0.00006250318,0.00015957867,0.00037718256,0.0007279733,0.0004903314],"domain_scores_gemma":[0.9986846,0.0001986571,0.000017527687,0.00055649853,0.0005230382,0.000019687584],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.004567243,0.000100393416,0.00009523574,0.00062164175,0.0050442927,0.0011064532,0.0009357405,0.0000293254,0.00013200915],"category_scores_gemma":[0.00089493964,0.000058384045,0.00005832009,0.004956004,0.0003365958,0.0006903468,0.00067656743,0.00027777167,0.0012549268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00016256448,0.0002876077,0.00014376892,0.00003256941,0.000020499516,0.0000034539407,0.0035343885,0.77096826,0.0046836273,0.14997913,0.055216383,0.01496775],"study_design_scores_gemma":[0.00031263588,0.000067925284,0.0008072273,0.000026785741,0.000029332721,5.7014233e-7,0.017665252,0.7749594,0.00044693882,0.0022966934,0.20317301,0.00021427199],"about_ca_topic_score_codex":0.00033209656,"about_ca_topic_score_gemma":0.0005517699,"teacher_disagreement_score":0.14795662,"about_ca_system_score_codex":0.00008164277,"about_ca_system_score_gemma":0.0000847191,"threshold_uncertainty_score":0.9999305},"labels":[],"label_agreement":null},{"id":"W4376473269","doi":"10.2139/ssrn.4430477","title":"Some Properties of the Erlang-B and Erlang-C Formulae (Technical Supplement to 'Behavior-Aware Queueing: The Finite-Buffer Setting with Many Strategic Servers')","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Erlang (programming language); Queueing theory; Server; Computer science; Erlang distribution; Buffer (optical fiber); Queueing system; Computer network; Theoretical computer science; Mathematics; Exponential distribution; Statistics; Telecommunications","score_opus":0.01566217919117822,"score_gpt":0.22835004774754006,"score_spread":0.21268786855636185,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376473269","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9926866,0.00030537735,0.0005939247,0.0057437783,0.000074145406,0.00042769706,0.0000030209235,0.00009071584,0.000074696545],"genre_scores_gemma":[0.99840486,0.00008816755,0.000023278688,0.00044889443,0.00040425482,0.000039506012,0.0000061602245,0.00003893561,0.0005459641],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9977379,0.000053054224,0.00034150318,0.00023958621,0.0004140614,0.0012139239],"domain_scores_gemma":[0.99918324,0.000058709404,0.00029087855,0.0003184455,0.0001284205,0.000020279027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017212336,0.00022059552,0.00023089253,0.00019993808,0.0005710074,0.00019059874,0.0005354738,0.000053701977,0.00002319934],"category_scores_gemma":[0.0000698187,0.00011443023,0.000122028134,0.00075410516,0.000092643444,0.0005621897,0.00029819764,0.00091439957,0.000016885406],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008615017,0.00025738834,0.053009067,0.0004160434,0.0009000522,0.000057393616,0.00089151144,0.02480143,0.01675762,0.89547306,0.0007345014,0.0058404584],"study_design_scores_gemma":[0.0050399974,0.00082867144,0.025202688,0.0015015473,0.0028648209,0.00047540086,0.0712832,0.025196029,0.0025861664,0.85580397,0.006878364,0.002339148],"about_ca_topic_score_codex":0.00016680591,"about_ca_topic_score_gemma":0.0019181243,"teacher_disagreement_score":0.07039169,"about_ca_system_score_codex":0.00019136367,"about_ca_system_score_gemma":0.00021710232,"threshold_uncertainty_score":0.46663293},"labels":[],"label_agreement":null},{"id":"W4376873776","doi":"10.1287/opre.2023.2472","title":"The Generalized <i>c</i>/<i>μ</i> Rule for Queues with Heterogeneous Server Pools","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":2,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Queue; Computer science; Routing (electronic design automation); Computer network; Queueing theory; Priority queue; Mathematical optimization; Zhàng; Service (business); Distributed computing; Mathematics; Economics","score_opus":0.062394265294795824,"score_gpt":0.35386273909425237,"score_spread":0.29146847379945656,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4376873776","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9792194,0.0001642578,0.0027477706,0.011767116,0.00014436372,0.0013711756,0.000016498236,0.00039244996,0.0041770046],"genre_scores_gemma":[0.9636763,0.00009472024,0.001086623,0.0009413861,0.0011452954,0.0013987683,0.00023043375,0.00008521506,0.031341266],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985224,0.00006773344,0.00017654402,0.0002782551,0.0004227946,0.0005322458],"domain_scores_gemma":[0.9984858,0.00028569315,0.00002262487,0.00045605653,0.00073430256,0.000015522097],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0019230628,0.00010960417,0.000120973644,0.00024807814,0.002628778,0.0010324795,0.00039693568,0.000036076857,0.00008830942],"category_scores_gemma":[0.0004311934,0.000069724374,0.00006880358,0.0015744541,0.00015023764,0.0005859259,0.00020435566,0.00014611644,0.0007215109],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025877715,0.000060099937,0.00027013,0.000063167696,0.0001648874,0.000018301756,0.0000856116,0.7202559,0.004041465,0.25035545,0.020857347,0.003568843],"study_design_scores_gemma":[0.0010271855,0.000043874996,0.00009155049,0.00003701158,0.000058216618,0.0000034049874,0.00066350715,0.5529384,0.002308194,0.027806919,0.4146689,0.00035286002],"about_ca_topic_score_codex":0.00031581413,"about_ca_topic_score_gemma":0.0024436086,"teacher_disagreement_score":0.39381155,"about_ca_system_score_codex":0.0000344572,"about_ca_system_score_gemma":0.0000456782,"threshold_uncertainty_score":0.9986697},"labels":[],"label_agreement":null},{"id":"W4384156529","doi":"10.1287/serv.2022.0045","title":"Can Customer Arrival Rates Be Modelled by Sine Waves?","year":2023,"lang":"en","type":"article","venue":"Service Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"Tokyo Biochemical Research Foundation","keywords":"Computer science; Service (business); Sine wave; Queueing theory; Process (computing); Staffing; Operations research; Mathematics; Business; Computer network; Physics","score_opus":0.019158651760972423,"score_gpt":0.26121923807917685,"score_spread":0.24206058631820443,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384156529","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9620977,0.000021053665,0.00031206902,0.018538384,0.00034613238,0.00016003862,0.000009087656,0.0005640129,0.017951507],"genre_scores_gemma":[0.9889017,0.0000052401138,0.00015005293,0.00853222,0.00022104254,0.000009721485,0.00003797259,0.00002142638,0.0021206664],"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982729,0.000009122394,0.00018845248,0.00048825395,0.0005181384,0.0005231304],"domain_scores_gemma":[0.99907243,0.000045009823,0.00013220913,0.00041408784,0.00030492037,0.00003133741],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0009207813,0.00016512645,0.00017181097,0.0004291855,0.00058026385,0.0003065146,0.0008437813,0.000031710846,0.00022891015],"category_scores_gemma":[0.00016493762,0.00014820775,0.00004670082,0.0070793196,0.00021107943,0.0017102872,0.0004362803,0.000107124244,0.001473199],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013251032,0.00021472479,0.0032734268,0.00049247814,0.000096068674,0.00006647256,0.0014251333,0.32835016,0.45077607,0.18008846,0.029016647,0.0060678422],"study_design_scores_gemma":[0.0003814051,0.0000045000907,0.0003940738,0.000035734316,0.000063459185,0.0000010247431,0.0010597662,0.9238692,0.0034552,0.033916745,0.036322143,0.0004967758],"about_ca_topic_score_codex":0.00059788727,"about_ca_topic_score_gemma":0.00024761577,"teacher_disagreement_score":0.595519,"about_ca_system_score_codex":0.000040744344,"about_ca_system_score_gemma":0.000043253858,"threshold_uncertainty_score":0.9993043},"labels":[],"label_agreement":null},{"id":"W4384161718","doi":"10.1287/opre.2023.2487","title":"Behavior-Aware Queueing: The Finite-Buffer Setting with Many Strategic Servers","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Server; Queueing theory; Computer science; Workload; Operations research; Computer network; Operating system; Mathematics","score_opus":0.10267565543611647,"score_gpt":0.36112304210838303,"score_spread":0.2584473866722666,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4384161718","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98099256,0.000017203423,0.00088565284,0.0058677136,0.000064503736,0.0005728857,0.000006334211,0.0002880223,0.011305151],"genre_scores_gemma":[0.9912817,0.000008174489,0.00010348612,0.00024904512,0.00037262856,0.00026584652,0.00011991642,0.000039181174,0.0075600375],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99825025,0.00011118772,0.0001918843,0.00033627995,0.00062036276,0.0004900268],"domain_scores_gemma":[0.99861944,0.00027185748,0.000029003008,0.00051258894,0.00054904184,0.000018060875],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0019010825,0.00013752753,0.0001205663,0.0005114781,0.0019027075,0.0010539651,0.00047329374,0.000051307834,0.0006198672],"category_scores_gemma":[0.00023090543,0.00009226076,0.00005346675,0.003239163,0.00017779914,0.0009811075,0.00027578004,0.00047545182,0.0013878007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000081479564,0.00015550706,0.014179606,0.00013445005,0.00013729381,0.0002515531,0.00055471796,0.7469436,0.0020315014,0.22912943,0.003972066,0.0024288208],"study_design_scores_gemma":[0.00063183816,0.00004382883,0.0053402414,0.00012380606,0.00013278481,0.0000047163153,0.019611033,0.95228595,0.00018040501,0.0070711975,0.014054316,0.00051986834],"about_ca_topic_score_codex":0.00070767885,"about_ca_topic_score_gemma":0.0017527983,"teacher_disagreement_score":0.22205824,"about_ca_system_score_codex":0.000052349304,"about_ca_system_score_gemma":0.00007603225,"threshold_uncertainty_score":0.999983},"labels":[],"label_agreement":null},{"id":"W4385764876","doi":"10.1080/16843703.2023.2243199","title":"The effect of information on the strategic behavior in a Markovian queue with catastrophes and working vacations","year":2023,"lang":"en","type":"article","venue":"Quality Technology & Quantitative Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":13,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Computer science; Service (business); Service system; Queueing theory; Queue; Process (computing); Operations research; Perspective (graphical); Nash equilibrium; Mathematical optimization; Business; Computer network; Marketing; Mathematics","score_opus":0.030830115328165805,"score_gpt":0.3016104067633212,"score_spread":0.27078029143515536,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4385764876","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.99164486,0.000029686244,0.00075785967,0.0039908583,0.000031925916,0.00072738266,0.0000030044425,0.00016152456,0.0026528812],"genre_scores_gemma":[0.9991325,0.000023386012,0.00025814853,0.00010170638,0.000007963633,0.000403437,0.000022426226,0.000009518088,0.000040879655],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"observational","domain_scores_codex":[0.99893224,0.00011084073,0.00034613628,0.00018919267,0.00019722906,0.00022436296],"domain_scores_gemma":[0.99858,0.00061913155,0.0003539189,0.00038761809,0.000054908447,0.0000044348003],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0019196942,0.00015505575,0.00019912804,0.00072122447,0.00034203645,0.00010233751,0.00032319655,0.000046645968,0.000006194361],"category_scores_gemma":[0.00018018612,0.000089258494,0.00003601839,0.0022488497,0.0003852653,0.0003202973,0.00020331232,0.0001923727,0.000048294816],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00014647713,0.000017051725,0.019139595,0.00008650121,0.00007821251,0.0000043382156,0.00006845786,0.0005684232,0.000024005554,0.9707937,0.000030782252,0.009042418],"study_design_scores_gemma":[0.003632952,0.0011170334,0.41866308,0.00093893654,0.001099069,0.0000025429,0.1518407,0.014235385,0.00073227216,0.39798132,0.008551716,0.0012049996],"about_ca_topic_score_codex":0.00011656672,"about_ca_topic_score_gemma":0.0004325299,"teacher_disagreement_score":0.57281244,"about_ca_system_score_codex":0.00003388897,"about_ca_system_score_gemma":0.000004144586,"threshold_uncertainty_score":0.36398557},"labels":[],"label_agreement":null},{"id":"W4386410772","doi":"10.1080/15326349.2023.2250418","title":"Mean-field fluctuations at diffusion scale in threshold-based randomized routing for processor sharing systems and applications","year":2023,"lang":"en","type":"article","venue":"Stochastic Models","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Orange","keywords":"Server; Mathematics; Processor sharing; Exponential distribution; Statistics; Computer science; Queueing theory; Computer network","score_opus":0.023396724508861273,"score_gpt":0.2611845628650985,"score_spread":0.23778783835623724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386410772","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.079110466,0.000067066685,0.9179658,0.0002948178,0.000054955777,0.0017359918,0.000005024746,0.00020943515,0.0005564375],"genre_scores_gemma":[0.9966164,0.0000020147,0.00036334677,0.00014524677,0.00022525334,0.0022536132,0.00007782287,0.00003184171,0.00028443482],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987596,0.000009007841,0.00038696683,0.00039567344,0.00017420169,0.00027449382],"domain_scores_gemma":[0.9988676,0.00055504334,0.00020549462,0.00023667564,0.00011934865,0.000015873522],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009587084,0.0001582002,0.00037747764,0.00039311725,0.00038492517,0.00013262601,0.00016623278,0.000061118175,0.000007671415],"category_scores_gemma":[0.00031818845,0.0001459331,0.00008512514,0.00066578377,0.000046788584,0.00045057974,0.00016698403,0.0000796916,0.000018196477],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0008986798,0.000018911427,0.00004218248,0.00019948422,0.000014757603,2.6398877e-7,0.00011528592,0.82532054,0.00038058718,0.17266555,0.000010677058,0.00033309378],"study_design_scores_gemma":[0.008250727,0.0000022662914,0.000005169545,0.00012031463,0.00009651183,2.1415416e-7,0.0001520392,0.8367147,0.000008737983,0.15449692,0.000014272653,0.00013812749],"about_ca_topic_score_codex":0.00009687287,"about_ca_topic_score_gemma":0.00014466014,"teacher_disagreement_score":0.9176025,"about_ca_system_score_codex":0.00004573547,"about_ca_system_score_gemma":0.000011982837,"threshold_uncertainty_score":0.5950979},"labels":[],"label_agreement":null},{"id":"W4386829927","doi":"10.5220/0012033500003620","title":"Option Pricing and Risk Hedging by Black-Scholes Model and Cox-Ross-Rubinstein Model for Unilever PLC","year":2022,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; Wilfrid Laurier University; University of Ottawa","funders":"","keywords":"Black–Scholes model; Economics; Financial economics; Valuation of options; Actuarial science; Computer science; Mathematical economics; Econometrics","score_opus":0.01422374919872599,"score_gpt":0.23017538115835082,"score_spread":0.21595163195962483,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4386829927","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5697191,0.000108093576,0.42914948,0.00013499748,0.000018623707,0.0001894741,0.000014136647,0.00009373414,0.0005723815],"genre_scores_gemma":[0.9910964,0.00004244812,0.0055519124,0.0006186856,0.00007417828,0.00005054984,0.000049051985,0.000038647766,0.0024781714],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989391,0.000015718717,0.00022572232,0.00039892626,0.00017342326,0.0002471244],"domain_scores_gemma":[0.9994708,0.0000648414,0.00020096429,0.00018081914,0.00006635698,0.000016221764],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006577905,0.00017717984,0.00021025668,0.0001849786,0.0008342409,0.00021114926,0.00012758527,0.000034592766,0.000022646671],"category_scores_gemma":[0.00008128944,0.00017767597,0.000054215307,0.00023584634,0.00007240156,0.0012483571,0.00036883418,0.00015999965,0.0000026023677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000063820364,0.000029472612,0.00069410866,0.000051761726,0.00004335861,6.04376e-7,0.00013322801,0.9439609,0.0020073997,0.049305774,0.00049270806,0.0032168657],"study_design_scores_gemma":[0.0006230028,0.000005612193,0.000021637874,0.000009802036,0.00016652333,6.0180224e-7,0.00054153777,0.93178946,0.000049180555,0.06548526,0.0010806345,0.00022673112],"about_ca_topic_score_codex":0.00006967904,"about_ca_topic_score_gemma":0.000024939862,"teacher_disagreement_score":0.42359754,"about_ca_system_score_codex":0.00004672231,"about_ca_system_score_gemma":0.000008471506,"threshold_uncertainty_score":0.72454154},"labels":[],"label_agreement":null},{"id":"W4387407470","doi":"10.1287/opre.2021.0597","title":"A Doubly Stochastic Simulator with Applications in Arrivals Modeling and Simulation","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Monte Carlo method; Randomness; Stochastic simulation; Artificial neural network; Domain (mathematical analysis); Poisson distribution; Stochastic modelling; Simulation; Probability distribution; Mathematical optimization; Artificial intelligence; Statistics; Mathematics","score_opus":0.07964050041132835,"score_gpt":0.38404957933413486,"score_spread":0.3044090789228065,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387407470","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7646714,0.000019047251,0.23354729,0.0005953119,0.000007786777,0.00060065003,0.0000020047837,0.000111864174,0.00044464302],"genre_scores_gemma":[0.9987788,0.0000027287115,0.0003397928,0.0000372224,0.00014137145,0.00023799021,0.00005919347,0.000021213422,0.00038166132],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989688,0.000029624434,0.00016847684,0.00027669503,0.00030318275,0.00025324695],"domain_scores_gemma":[0.9991159,0.00021738197,0.000014093836,0.00023769983,0.00040008323,0.000014828289],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009004612,0.00008379153,0.00011015264,0.00091636245,0.0005525525,0.00031645034,0.00012331294,0.00003498024,0.000038027956],"category_scores_gemma":[0.00035228743,0.0000727455,0.000013571099,0.0029812069,0.00006516276,0.00082809373,0.00011711069,0.00017757788,0.00017998872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017007806,0.000019458108,0.00026476337,0.000016788905,0.0000068666504,0.0000013348888,0.000075773525,0.9776573,0.00016969703,0.021403257,0.0000051759475,0.00036258643],"study_design_scores_gemma":[0.00023605286,0.000003914763,0.00013032061,0.000023141783,0.000008873817,1.2600182e-7,0.0005494205,0.9931273,0.0000032405258,0.005567134,0.00026190374,0.000088584486],"about_ca_topic_score_codex":0.00023033663,"about_ca_topic_score_gemma":0.0008049682,"teacher_disagreement_score":0.23410742,"about_ca_system_score_codex":0.000036938305,"about_ca_system_score_gemma":0.00003182372,"threshold_uncertainty_score":0.4249843},"labels":[],"label_agreement":null},{"id":"W4387455050","doi":"10.1287/opre.2022.0144","title":"Customer Scheduling in Large Service Systems Under Model Uncertainty","year":2023,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Exploit; Scheduling (production processes); Adversary; Operations research; Service quality; Realm; Quality of service; Distributed computing; Industrial engineering; Service (business); Mathematical optimization; Computer security; Computer network; Engineering","score_opus":0.10526151367641799,"score_gpt":0.3837351266633641,"score_spread":0.2784736129869461,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387455050","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9621984,0.00007104651,0.012980102,0.005043718,0.00013958086,0.00058004854,0.000010879457,0.00029874535,0.018677488],"genre_scores_gemma":[0.99452406,0.000014721434,0.00018925974,0.00043009667,0.0002655266,0.00015296902,0.00011348267,0.000029205634,0.004280704],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9983498,0.00007828094,0.00024027088,0.00031487813,0.00048946874,0.0005272916],"domain_scores_gemma":[0.99886113,0.00010355932,0.000018076857,0.0003575998,0.00064335036,0.000016285225],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0028735574,0.00010301526,0.00015012696,0.0011792653,0.0006456459,0.00050341996,0.00031725803,0.000067231456,0.00019096448],"category_scores_gemma":[0.00033459044,0.00009814604,0.000034450448,0.0053045475,0.00003598461,0.0010636721,0.00032006268,0.000365718,0.004337652],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000007871605,0.000031159805,0.00018847159,0.000052109153,0.000009933008,0.0000049696337,0.00007068853,0.8334261,0.0005907008,0.16528557,0.0002678142,0.00006461882],"study_design_scores_gemma":[0.00023399583,0.0000010648263,0.00011556008,0.000038491995,0.0000063109337,2.1663787e-7,0.0025539654,0.99153984,0.000007767855,0.0032910022,0.0020975901,0.00011418338],"about_ca_topic_score_codex":0.0019164343,"about_ca_topic_score_gemma":0.005353702,"teacher_disagreement_score":0.16199458,"about_ca_system_score_codex":0.000117635034,"about_ca_system_score_gemma":0.00007330552,"threshold_uncertainty_score":0.9964376},"labels":[],"label_agreement":null},{"id":"W4387478842","doi":"10.2139/ssrn.4586771","title":"Incentivizing Resource Pooling","year":2023,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Quest University Canada","funders":"","keywords":"Server; Pooling; Computer science; Distributed computing; Queueing theory; Queue; Security token; Resource allocation; Resource (disambiguation); Computer network; Artificial intelligence","score_opus":0.00959066066771592,"score_gpt":0.22930965955618215,"score_spread":0.21971899888846624,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387478842","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9600295,0.0008782852,0.018716538,0.0029483985,0.0003929782,0.00012735125,4.916084e-7,0.0007855862,0.016120875],"genre_scores_gemma":[0.9944548,0.00024097168,0.000033350967,0.00056733005,0.0020093995,0.000002936144,0.000010107326,0.000045984114,0.002635138],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99707603,0.000025270987,0.000266075,0.00021965249,0.00028698414,0.0021259543],"domain_scores_gemma":[0.9994115,0.000060121452,0.00025172494,0.00018343744,0.00007968329,0.000013486163],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0030633204,0.00015486647,0.00017852757,0.00054565055,0.00056198385,0.00022558257,0.00036803295,0.00004787067,0.000052523566],"category_scores_gemma":[0.0002684166,0.00014691836,0.00015500023,0.0013991249,0.000035372006,0.0009696375,0.00015697877,0.0011844133,0.00094335823],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00008654373,0.000036269037,0.005082218,0.000027497537,0.0002739235,0.0000436838,0.000071182156,0.00948069,0.0011758963,0.9219518,0.0010384276,0.060731903],"study_design_scores_gemma":[0.00043272003,0.00001099545,0.00030625856,0.00004817832,0.000111850335,0.00004781167,0.0032777502,0.008495198,0.00003284769,0.9063065,0.080630824,0.00029906924],"about_ca_topic_score_codex":0.000036747748,"about_ca_topic_score_gemma":0.00014535822,"teacher_disagreement_score":0.0795924,"about_ca_system_score_codex":0.00031548858,"about_ca_system_score_gemma":0.00014212886,"threshold_uncertainty_score":0.99983454},"labels":[],"label_agreement":null},{"id":"W4387500327","doi":"10.1111/poms.14072","title":"Economic production with Poisson demand, lost sales, fixed‐rate discrete replenishment, and a constant setup time","year":2023,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Trinity Western University; Western University","funders":"","keywords":"Poisson distribution; Idle; Constant (computer programming); Holding cost; Fixed cost; Bounded function; Mathematical optimization; Lead time; Production (economics); Matrix (chemical analysis); Mathematics; Computer science; Statistics; Economics; Operations management","score_opus":0.008514793707223512,"score_gpt":0.22090333364092807,"score_spread":0.21238853993370455,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387500327","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9622088,0.00017199588,0.001733589,0.026658826,0.0006500279,0.0019074058,0.000015043292,0.0006760342,0.005978289],"genre_scores_gemma":[0.9722199,0.00051021617,0.0009451311,0.00040123635,0.0007236819,0.0001528033,0.0002811413,0.00004377537,0.024722109],"study_design_codex":"simulation_or_modeling","study_design_gemma":"not_applicable","domain_scores_codex":[0.9986582,0.00003316929,0.00026506305,0.0006984594,0.00012023357,0.0002248958],"domain_scores_gemma":[0.9994327,0.000010525895,0.00011296071,0.00035117028,0.00007171842,0.000020927362],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007444608,0.00020464382,0.00018785396,0.00040254684,0.0006608177,0.00039821432,0.00007566758,0.000027672271,0.000117282034],"category_scores_gemma":[0.0000670264,0.0001788316,0.000027313432,0.0005194949,0.00013259807,0.0013804879,0.00016082129,0.000080865386,0.00065948674],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012764061,0.000437508,0.014568241,0.002041448,0.0020189781,0.00009963381,0.0013491869,0.44754604,0.009789234,0.40697306,0.08718235,0.026717898],"study_design_scores_gemma":[0.005508684,0.00036500362,0.029245539,0.0013468895,0.00441936,0.00017998715,0.012951287,0.3596846,0.0040891157,0.033805773,0.5432987,0.0051050675],"about_ca_topic_score_codex":0.000041380412,"about_ca_topic_score_gemma":0.000293491,"teacher_disagreement_score":0.45611635,"about_ca_system_score_codex":0.000054523607,"about_ca_system_score_gemma":0.000008588722,"threshold_uncertainty_score":0.84765875},"labels":[],"label_agreement":null},{"id":"W4387972607","doi":"10.37394/23203.2023.18.35","title":"Reducing the Size of a Waiting Line Optimally","year":2023,"lang":"en","type":"article","venue":"WSEAS TRANSACTIONS ON SYSTEMS AND CONTROL","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Computer science; Queueing theory; Instant; Mathematical optimization; Server; Limit (mathematics); Service (business); Distributed computing; Line (geometry); Optimal control; Operations research; Real-time computing; Computer network; Mathematics","score_opus":0.012743131686124946,"score_gpt":0.223679967978883,"score_spread":0.21093683629275806,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4387972607","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6355895,0.00071147125,0.34992486,0.005017133,0.00089035195,0.0012463597,0.000041420375,0.000732638,0.0058462676],"genre_scores_gemma":[0.99864525,0.0000127068315,0.000021161808,0.00019722148,0.00029055774,0.000060406113,0.0000015436193,0.000018726298,0.0007524072],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991565,0.000030877847,0.00028181402,0.00018631307,0.00016702889,0.00017749908],"domain_scores_gemma":[0.9991437,0.0003565403,0.00017236728,0.0002131709,0.000103334576,0.000010852083],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006099129,0.000115746094,0.00023477669,0.00014256142,0.0003268465,0.00011030357,0.00011422469,0.000037014495,0.000035077093],"category_scores_gemma":[0.000076173244,0.00008245732,0.0001072484,0.00054672547,0.000052061474,0.0002538299,0.0000041601747,0.00011487519,0.00003683007],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00034063827,0.00009679371,0.0001546369,0.00045830893,0.0005201906,0.000015201695,0.00022459793,0.9201168,0.009062198,0.04060221,0.0001050667,0.028303355],"study_design_scores_gemma":[0.0012834466,0.000027930511,0.00036182895,0.00026115496,0.00040838178,0.0000047328786,0.0021913317,0.9896986,0.00009647559,0.00089563156,0.0045547355,0.0002157445],"about_ca_topic_score_codex":0.00028574193,"about_ca_topic_score_gemma":0.000014658673,"teacher_disagreement_score":0.36305577,"about_ca_system_score_codex":0.000010142298,"about_ca_system_score_gemma":0.000009161237,"threshold_uncertainty_score":0.3362512},"labels":[],"label_agreement":null},{"id":"W4388191564","doi":"10.3390/math11214444","title":"Analysis of Vacation Fluid M/M/1 Queue in Multi-Phase Random Environment","year":2023,"lang":"en","type":"article","venue":"Mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Queue; Context (archaeology); Laplace transform; Computer science; Function (biology); Point (geometry); Applied mathematics; Mathematical optimization; Mathematics; Mathematical analysis; Computer network; Geology","score_opus":0.03153985232085754,"score_gpt":0.28648299917859726,"score_spread":0.2549431468577397,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388191564","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9190619,0.000022944001,0.0796076,0.00014929651,0.00003722771,0.00024599847,0.0000069813536,0.000120513454,0.0007475249],"genre_scores_gemma":[0.9960743,0.000021449678,0.0030971963,0.000079349375,0.000040218085,0.000032852273,0.00015411542,0.000021732669,0.0004787754],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990076,0.000014602159,0.00045305002,0.00017053248,0.00019678977,0.00015743289],"domain_scores_gemma":[0.9991909,0.00014526148,0.0002845274,0.00034106086,0.000031416585,0.000006802313],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000805314,0.000116545685,0.0003892799,0.0010460231,0.000043218748,0.000027332973,0.00016642248,0.000041110787,0.00033171268],"category_scores_gemma":[0.00025417484,0.00010930493,0.0001390014,0.002099369,0.00003375093,0.00024881505,0.00009423615,0.000053194,0.00036542537],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00025976685,0.0048855487,0.016131338,0.0016578737,0.0030062997,0.00005599135,0.0031629123,0.8415735,0.015500455,0.10062879,0.00073218165,0.012405389],"study_design_scores_gemma":[0.0016186485,0.0000032141934,0.001013169,0.000026765867,0.0009562476,7.960643e-8,0.00042604326,0.9848099,0.000160592,0.010180437,0.00067055685,0.00013437321],"about_ca_topic_score_codex":0.000044852186,"about_ca_topic_score_gemma":0.000044194898,"teacher_disagreement_score":0.14323641,"about_ca_system_score_codex":0.000031350923,"about_ca_system_score_gemma":0.0000030375552,"threshold_uncertainty_score":0.46969256},"labels":[],"label_agreement":null},{"id":"W4388196715","doi":"10.1007/978-3-031-40534-1","title":"Efficient Control and Spontaneous Transitions","year":2023,"lang":"en","type":"book","venue":"Springer theses","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Division of Undergraduate Education","keywords":"Non-equilibrium thermodynamics; Statistical physics; Path (computing); Information theory; Physics; Theoretical physics; Mathematics; Computer science; Thermodynamics; Statistics","score_opus":0.012282197136733779,"score_gpt":0.2132130390474548,"score_spread":0.20093084191072103,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4388196715","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0119782565,0.0010416122,0.0023092008,0.0013876949,0.00088667846,0.00085821655,0.00008678353,0.0016707203,0.97978085],"genre_scores_gemma":[0.38217157,0.00003548834,0.00006869744,0.0011005033,0.0024517525,0.000050694653,0.00006221249,0.00022949663,0.6138296],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99872565,0.000011837528,0.00025142817,0.00042504785,0.00024009032,0.00034593933],"domain_scores_gemma":[0.9991225,0.00024059675,0.00018975188,0.00034322854,0.000084691186,0.000019205532],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00036480118,0.00031597546,0.00045512881,0.00042813295,0.00022712274,0.000179301,0.00020898292,0.000138873,0.00021616754],"category_scores_gemma":[0.00016906706,0.00029726158,0.00019433434,0.00014160186,0.00013653266,0.00009475515,0.000100169236,0.00025331875,0.0011567206],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005107113,0.0002188582,0.000081390936,0.0020398577,0.0019335255,0.006674658,0.0004586869,0.06061959,0.0005025803,0.9021429,0.0075570676,0.01726017],"study_design_scores_gemma":[0.0011949595,0.000024072913,0.00029746612,0.0012380262,0.002958117,0.00011355374,0.00016964787,0.031385276,0.0000068890586,0.30134004,0.65940434,0.0018676294],"about_ca_topic_score_codex":0.000024414052,"about_ca_topic_score_gemma":0.00005414949,"teacher_disagreement_score":0.65184724,"about_ca_system_score_codex":0.00006915399,"about_ca_system_score_gemma":0.00003014765,"threshold_uncertainty_score":0.99994797},"labels":[],"label_agreement":null},{"id":"W4389234783","doi":"10.1007/s40819-023-01645-w","title":"Sojourn-Time Distribution for $$Geo/G^{a,b}/1$$ Queue with Batch Service","year":2023,"lang":"en","type":"article","venue":"International Journal of Applied and Computational Mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Queue; Mathematics; Distribution (mathematics); Applied mathematics; Function (biology); Probability distribution; Probability mass function; Service (business); Computer science; Probability density function; Mathematical optimization; Statistics; Mathematical analysis","score_opus":0.010097688995305438,"score_gpt":0.23897211080097874,"score_spread":0.2288744218056733,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4389234783","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5453887,0.000015584808,0.4460202,0.006009815,0.0002639084,0.00028975593,0.000049674807,0.00011456454,0.001847804],"genre_scores_gemma":[0.97328305,0.0000062184076,0.024184326,0.0010388109,0.0010719328,0.000015388612,0.00028221175,0.000031059957,0.00008702632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99889517,0.0000032654657,0.00040357423,0.000112875896,0.00046339695,0.0001217166],"domain_scores_gemma":[0.99797857,0.00032676285,0.0005899666,0.00005665066,0.0010307764,0.00001726902],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00046766177,0.00012459405,0.00020898243,0.00022632795,0.00010427537,0.0001841752,0.00024721696,0.000034087818,0.000030982366],"category_scores_gemma":[0.00007642779,0.00010062702,0.00006621534,0.00034213296,0.000035096877,0.0003991744,0.000068634654,0.000089734815,0.00007221199],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00043914255,0.00017028932,0.000060538798,0.00019271423,0.0005182327,0.000022339751,0.00029660712,0.28492403,0.00045980976,0.70533556,0.0021840911,0.005396636],"study_design_scores_gemma":[0.0008972249,0.000015542006,0.00025563402,0.0000994146,0.0001027749,0.000039117138,0.0004323815,0.33792475,0.00004012778,0.65639293,0.0036626798,0.00013742004],"about_ca_topic_score_codex":0.0000019975348,"about_ca_topic_score_gemma":0.0000017853262,"teacher_disagreement_score":0.42789432,"about_ca_system_score_codex":0.000035612557,"about_ca_system_score_gemma":0.000031897416,"threshold_uncertainty_score":0.41034508},"labels":[],"label_agreement":null},{"id":"W4390050685","doi":"10.1287/ijoc.2022.0263","title":"Supervised ML for Solving the <i>GI</i>/<i>GI</i>/1 Queue","year":2023,"lang":"en","type":"article","venue":"INFORMS journal on computing","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":10,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Queue; Queueing theory; Computer science; Range (aeronautics); Stationary distribution; Artificial neural network; Distribution (mathematics); Service (business); Sample (material); Operations research; Artificial intelligence; Algorithm; Mathematics; Machine learning; Engineering; Computer network","score_opus":0.024105996355344658,"score_gpt":0.2610686845859325,"score_spread":0.23696268823058786,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4390050685","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9071622,0.00009585111,0.06631586,0.010586204,0.003120688,0.0007182262,0.0000044251947,0.0010374207,0.010959111],"genre_scores_gemma":[0.9788183,0.000015417536,0.00083625957,0.014955921,0.0049558873,0.000009396969,0.00001873438,0.000070251604,0.00031982947],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99790543,0.000014124341,0.00069764233,0.00023663964,0.0004487964,0.0006973793],"domain_scores_gemma":[0.99792445,0.0007507549,0.00062655366,0.00033233306,0.00033261217,0.00003330535],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0028396524,0.0002783207,0.00032571238,0.00051111233,0.0017765542,0.0010278405,0.00074619247,0.00007379857,0.00004600534],"category_scores_gemma":[0.00097550533,0.00018300989,0.00036933852,0.0012457175,0.0000654898,0.0014528311,0.00029853708,0.0005477923,0.0004178593],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00041642893,0.000099398545,0.003768513,0.00033689223,0.00049971044,0.000119500895,0.0011580627,0.55895233,0.0012947067,0.09392389,0.044666145,0.29476443],"study_design_scores_gemma":[0.0014505137,0.000049063812,0.00092948455,0.0003654865,0.00013395167,0.000045183002,0.0016986699,0.7264843,0.00019194245,0.04402312,0.22403395,0.0005943047],"about_ca_topic_score_codex":0.000016188915,"about_ca_topic_score_gemma":0.000008996242,"teacher_disagreement_score":0.29417014,"about_ca_system_score_codex":0.00007218559,"about_ca_system_score_gemma":0.00002977548,"threshold_uncertainty_score":0.999523},"labels":[],"label_agreement":null},{"id":"W4392381669","doi":"10.1287/msom.2022.0590","title":"Frontiers in Operations: Waiting Experience in Open-Shop Service Networks: Improvements via Flow Analytics and Automation","year":2024,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Stylized fact; Pooling; Analytics; Service (business); Routing (electronic design automation); Service level; Queueing theory; Operations research; Process management; Queue; Process (computing); Operations management; Business; Computer network; Marketing; Data science","score_opus":0.015569953206926137,"score_gpt":0.2551758824914357,"score_spread":0.23960592928450955,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4392381669","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80267954,0.00030661272,0.18706049,0.0043840865,0.00082204875,0.002055909,0.0000047544186,0.00038625603,0.0023003106],"genre_scores_gemma":[0.9803242,0.0000830309,0.0143522015,0.0040267487,0.00022545493,0.00038103672,0.0001922989,0.00006094248,0.0003541066],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997636,0.00005730247,0.0007228855,0.0008330188,0.00028173547,0.00046902787],"domain_scores_gemma":[0.99926245,0.00003971803,0.0000728319,0.0005005294,0.000095522744,0.000028974413],"candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009185772,0.0003651484,0.0003382787,0.0010287875,0.00041031724,0.0026398234,0.00066157035,0.00008042946,0.00012462879],"category_scores_gemma":[0.000024392837,0.00038352713,0.00004305648,0.0018975455,0.000024768147,0.004849338,0.0010356354,0.00026095795,0.00007588118],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022076318,0.00008113179,0.0007479075,0.0004897278,0.00008131703,0.000035195146,0.00063327904,0.97374433,0.000050718147,0.0036737958,0.000065891036,0.020374643],"study_design_scores_gemma":[0.0005643434,0.0000050791414,0.0031959692,0.00041281906,0.000104432416,0.0000013118678,0.0037539594,0.9882153,0.00008024599,0.0013886337,0.0018545095,0.00042334714],"about_ca_topic_score_codex":0.0026871823,"about_ca_topic_score_gemma":0.013553012,"teacher_disagreement_score":0.17764464,"about_ca_system_score_codex":0.00026708463,"about_ca_system_score_gemma":0.000016003467,"threshold_uncertainty_score":0.99986166},"labels":[],"label_agreement":null},{"id":"W4393261338","doi":"10.18280/mmep.110301","title":"Unreliable Multi Server Retrial Queueing System with Reneging and Diverse Outgoing Services","year":2024,"lang":"en","type":"article","venue":"Mathematical Modelling and Engineering Problems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Queueing theory; Computer science; Queueing system; Computer network; Real-time computing; Distributed computing","score_opus":0.016743173830999606,"score_gpt":0.19470891958823253,"score_spread":0.17796574575723292,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393261338","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.18228686,0.0006889008,0.8153958,0.000058196343,0.00013759904,0.0001750196,8.636864e-7,0.00081984967,0.000436929],"genre_scores_gemma":[0.97945195,0.000020508616,0.020032283,0.000021115893,0.0002612042,0.000018115374,0.0000038038854,0.0000642019,0.00012680891],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99885345,0.0000057931297,0.00027310007,0.00038154228,0.00018081881,0.00030532145],"domain_scores_gemma":[0.99957097,0.000129743,0.00005805343,0.00016762821,0.000042358344,0.0000312759],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00054608984,0.0002460414,0.0003063286,0.00022926694,0.00016995914,0.0006328717,0.0000968456,0.000073455114,0.000006587031],"category_scores_gemma":[0.000021841406,0.00019557064,0.00004553782,0.00034102402,0.000028137807,0.00083948515,0.000120561235,0.00019999144,0.000025071395],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000011127577,0.00000956057,0.00004309143,0.010012021,0.00006892579,0.000020333588,0.0003130204,0.9132079,0.00011087658,0.076026134,0.0000022719971,0.00017476002],"study_design_scores_gemma":[0.0002392434,0.00000657012,0.0000015910464,0.0047916467,0.00016118823,0.00001334416,0.00030998746,0.98975784,0.0000136559465,0.004104269,0.0003333248,0.0002673596],"about_ca_topic_score_codex":0.00011604046,"about_ca_topic_score_gemma":0.0000056982794,"teacher_disagreement_score":0.7971651,"about_ca_system_score_codex":0.00003065315,"about_ca_system_score_gemma":0.0000044273993,"threshold_uncertainty_score":0.7975139},"labels":[],"label_agreement":null},{"id":"W4393372583","doi":"10.1007/978-3-031-47686-0_24","title":"A Continuous Time Physical Graph Based Formulation to Scheduled Service Network Design","year":2024,"lang":"en","type":"book-chapter","venue":"AIRO Springer series/AIRO Springer Series","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Network planning and design; Graph; Computer network; Theoretical computer science","score_opus":0.013612478013130118,"score_gpt":0.21244340084731012,"score_spread":0.19883092283418,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4393372583","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.040481802,0.004573207,0.12508278,0.031008737,0.012988942,0.016813975,0.0003046467,0.023069989,0.7456759],"genre_scores_gemma":[0.15823565,0.0001242852,0.05177167,0.015664373,0.026469579,0.0011774048,0.0009343209,0.0035894655,0.74203324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99417114,0.000043841155,0.0012401505,0.0020514138,0.0010609282,0.0014325356],"domain_scores_gemma":[0.99605185,0.00023253364,0.00092743355,0.0018667061,0.0007597456,0.00016171974],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["metaepi_narrow","insufficient_payload"],"category_scores_codex":[0.000893577,0.0018888459,0.0020590024,0.0011448567,0.00074466685,0.0011634803,0.0011862142,0.0006683752,0.0011115037],"category_scores_gemma":[0.00015527941,0.0019846177,0.0009258338,0.0011523515,0.00023384135,0.0032529486,0.0013228538,0.0011379854,0.006901383],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0024881102,0.0001697628,0.0001100143,0.0019348109,0.0015786367,0.00035060497,0.00038494574,0.099107265,0.002468367,0.8848171,0.003797431,0.002792899],"study_design_scores_gemma":[0.0009500225,0.0002315925,0.00019314437,0.0024065953,0.0026926184,0.000018371695,0.00009028533,0.01751513,0.0009023428,0.28459677,0.68622255,0.004180587],"about_ca_topic_score_codex":0.00010482075,"about_ca_topic_score_gemma":0.00030036632,"teacher_disagreement_score":0.6824251,"about_ca_system_score_codex":0.00027551496,"about_ca_system_score_gemma":0.0001237862,"threshold_uncertainty_score":0.9998734},"labels":[],"label_agreement":null},{"id":"W4394182900","doi":"10.6084/m9.figshare.19514451","title":"Managing retrial queueing systems with boundedly rational customers","year":2023,"lang":"en","type":"dataset","venue":"Figshare","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Queueing theory; Computer science; Queueing system; Computer network; Operations research; Mathematics","score_opus":0.028944692537319825,"score_gpt":0.2520232796955903,"score_spread":0.22307858715827047,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4394182900","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0000010508339,0.000095046074,0.0000068689583,0.000082165396,0.0005793748,0.00039386944,0.99719954,0.00038050732,0.0012615834],"genre_scores_gemma":[0.000050962477,0.000004982512,0.000006711973,0.00036356365,0.005146631,0.00025709026,0.9932205,0.00009648231,0.0008530562],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9977478,0.000030889965,0.0004122078,0.0006508978,0.0007054149,0.00045281058],"domain_scores_gemma":[0.99805844,0.0002271243,0.0007822473,0.0006289526,0.00028067324,0.0000225614],"candidate_categories":["metaepi_narrow","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00024817488,0.00045353337,0.0005134132,0.00084305316,0.00041325137,0.0011188342,0.0006816951,0.00023690323,0.018369779],"category_scores_gemma":[0.0012381304,0.00041955258,0.00015965605,0.0013745233,0.00001855329,0.0010963521,0.00039884186,0.0005178896,0.04183889],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000054950386,0.000010702877,6.7325516e-7,0.001494694,0.00016800362,0.00017797748,0.0000017458044,0.010805645,2.406334e-7,0.00018715956,0.9870257,0.000072552495],"study_design_scores_gemma":[0.00031734342,0.000005758625,0.0000037454945,0.003962166,0.00021276811,0.0000039957035,0.00006877884,0.0040481933,2.3031428e-7,0.00021135168,0.99061114,0.00055450446],"about_ca_topic_score_codex":0.00046213393,"about_ca_topic_score_gemma":0.0004729049,"teacher_disagreement_score":0.023469113,"about_ca_system_score_codex":0.00014246357,"about_ca_system_score_gemma":0.000082196035,"threshold_uncertainty_score":0.9999181},"labels":[],"label_agreement":null},{"id":"W4395450178","doi":"10.1016/j.orl.2024.107116","title":"Some asymptotic properties of the Erlang-C formula in many-server limiting regimes","year":2024,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"Social Sciences and Humanities Research Council of Canada","keywords":"Limiting; Erlang (programming language); Asymptotic distribution; Staffing; Computer science; Mathematics; Applied mathematics; Statistics; Theoretical computer science; Engineering; Economics; Estimator","score_opus":0.04782271483692816,"score_gpt":0.2966113428409581,"score_spread":0.24878862800402993,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4395450178","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9764391,0.00042823912,0.0001228217,0.021701992,0.00010947994,0.00029688957,9.305977e-7,0.000050219955,0.0008503355],"genre_scores_gemma":[0.9969508,0.000013561768,0.00007548636,0.0010508108,0.0004476557,0.000063534884,0.000004833671,0.000023134975,0.0013701555],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99872935,0.00008575095,0.00023880054,0.00022883955,0.00041670137,0.00030053285],"domain_scores_gemma":[0.99943227,0.00008072269,0.0000197408,0.00033902217,0.00012115158,0.0000070989354],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012049972,0.000095352196,0.00012052576,0.00054059236,0.0003178105,0.00046451855,0.00037289815,0.00003045863,0.00005641396],"category_scores_gemma":[0.0005190051,0.000063640786,0.00008377403,0.0012785285,0.00017952929,0.0017229638,0.00026382913,0.00033319084,0.00013187101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035495734,0.00009493601,0.0027350048,0.0008670211,0.00012370232,0.000043614727,0.000757952,0.20587422,0.18313216,0.60002416,0.0041518025,0.0021599568],"study_design_scores_gemma":[0.0006141979,0.000018899329,0.0034829772,0.0026857455,0.000100891375,0.000005725466,0.0023299127,0.94012934,0.018557468,0.011873375,0.019583426,0.00061802665],"about_ca_topic_score_codex":0.00049981853,"about_ca_topic_score_gemma":0.00034670567,"teacher_disagreement_score":0.73425514,"about_ca_system_score_codex":0.000079082536,"about_ca_system_score_gemma":0.000036750687,"threshold_uncertainty_score":0.44793633},"labels":[],"label_agreement":null},{"id":"W4396579551","doi":"10.1287/stsy.2023.0011","title":"The BAR Approach for Multiclass Queueing Networks with SBP Service Policies","year":2024,"lang":"en","type":"article","venue":"Stochastic Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Queueing theory; Bar (unit); Service (business); Computer science; Computer network; Business; Geology; Oceanography; Marketing","score_opus":0.014438272758587589,"score_gpt":0.23103489224444415,"score_spread":0.21659661948585657,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4396579551","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0025124678,0.001448358,0.9915705,0.00046587375,0.00073059334,0.00076993136,0.0000032621465,0.000381543,0.0021174832],"genre_scores_gemma":[0.99529326,0.0000015075061,0.000389335,0.00027637833,0.0028050335,0.00036304785,0.000022461401,0.00007197902,0.00077700615],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987149,0.000020175044,0.0002778701,0.0003452295,0.00021885414,0.00042292295],"domain_scores_gemma":[0.9987577,0.00055590173,0.00013366828,0.00033977325,0.00019697771,0.000015931459],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007228771,0.00022437186,0.00024485117,0.000125915,0.0005560775,0.0009638226,0.00031853322,0.000060017628,0.0000020660057],"category_scores_gemma":[0.00012153727,0.0001379898,0.000083998886,0.00071942614,0.000071700524,0.00044697247,0.00008683073,0.00013924067,0.000033797067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000050509407,0.0000090861595,0.000015809206,0.00048643406,0.0001534025,0.000002023774,0.00011131031,0.8263529,0.00002078065,0.1719704,0.0003740174,0.00045331923],"study_design_scores_gemma":[0.00019206312,0.0000077981385,0.0000079359015,0.0002832805,0.00021432558,0.000006887004,0.002162277,0.9875221,7.3127114e-7,0.0008877473,0.008508022,0.00020680924],"about_ca_topic_score_codex":0.00067234033,"about_ca_topic_score_gemma":0.000118221775,"teacher_disagreement_score":0.9927808,"about_ca_system_score_codex":0.000053185035,"about_ca_system_score_gemma":0.000019720332,"threshold_uncertainty_score":0.92941636},"labels":[],"label_agreement":null},{"id":"W4397030266","doi":"10.1007/s11134-024-09909-y","title":"A diffusion model of dynamic participant inflow management","year":2024,"lang":"en","type":"article","venue":"Queueing Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Inflow; Diffusion; Mathematics; Computer science; Mechanics; Physics","score_opus":0.023289687945908494,"score_gpt":0.25355943247937573,"score_spread":0.23026974453346724,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4397030266","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8590531,0.001816278,0.1171039,0.00025137374,0.001220018,0.00060129154,0.00000656676,0.0008342478,0.019113233],"genre_scores_gemma":[0.9966854,0.00001964986,0.00028833316,0.000075452575,0.00019384957,0.000056711095,0.0000111903755,0.000044785196,0.002624615],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985992,0.000018881641,0.00046934764,0.0003380544,0.0002937869,0.00028076628],"domain_scores_gemma":[0.9993497,0.000044836026,0.00016008104,0.00037217527,0.000060622115,0.000012593984],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005891871,0.00018301132,0.00030553926,0.00042564273,0.000095240255,0.00022901794,0.00022401534,0.000053408,0.000024033545],"category_scores_gemma":[0.00003187535,0.00015893656,0.00013400901,0.00059264514,0.000040433206,0.0006485658,0.00017631096,0.0001052375,0.00018832803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000029872139,0.00006266411,0.00020453989,0.0041004964,0.0002885554,0.000059895523,0.00023654578,0.42208412,0.007911487,0.55894816,0.0003003657,0.005773322],"study_design_scores_gemma":[0.000117423224,0.000003588822,0.000036269306,0.0009278809,0.00025808366,0.0000011268338,0.00036452163,0.98436224,0.00002243226,0.010209132,0.0035147953,0.00018247344],"about_ca_topic_score_codex":0.00019675265,"about_ca_topic_score_gemma":0.00002456328,"teacher_disagreement_score":0.56227815,"about_ca_system_score_codex":0.000057635523,"about_ca_system_score_gemma":0.000009453753,"threshold_uncertainty_score":0.64812446},"labels":[],"label_agreement":null},{"id":"W4399126368","doi":"10.3390/g15030019","title":"A Controlled Discrete-Time Queueing System as a Model for the Orders of Two Competing Companies","year":2024,"lang":"en","type":"article","venue":"Games","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Layered queueing network; Mathematical economics; Discrete time and continuous time; Computer science; Economics; Econometrics; Operations research; Mathematics; Statistics; Computer network","score_opus":0.01170931742728587,"score_gpt":0.2588644206419595,"score_spread":0.24715510321467365,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399126368","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.34302205,0.0062863147,0.62510824,0.002952909,0.0007013679,0.0023081955,0.000023718932,0.0013932344,0.018204005],"genre_scores_gemma":[0.9978797,0.0000027066167,0.00074873306,0.00017919969,0.00038630154,0.00008827046,0.000008396126,0.000034702018,0.0006719804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990563,0.00002111968,0.00032793262,0.00019505783,0.00016238572,0.00023719526],"domain_scores_gemma":[0.9987109,0.00078229787,0.00019246018,0.00020591206,0.000101228325,0.000007252729],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00080267095,0.0001601065,0.0004179036,0.00014988943,0.00019346981,0.0002147704,0.00022363952,0.000024727027,0.000038444698],"category_scores_gemma":[0.0002179336,0.000104244085,0.000262239,0.0003091615,0.00008190721,0.00045943508,0.00009979854,0.000081435544,0.00006511863],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0002724987,0.000016737602,0.00008688426,0.0009268815,0.00052774505,0.0000024642923,0.00055191806,0.35279256,0.0012041809,0.64184874,0.00016155855,0.0016078177],"study_design_scores_gemma":[0.0008066123,0.0000030975903,0.0000037413456,0.00031752308,0.0005772918,0.0000011091214,0.0021453032,0.9863221,0.000026712505,0.008447905,0.0012202591,0.00012836423],"about_ca_topic_score_codex":0.00017346785,"about_ca_topic_score_gemma":0.000027737531,"teacher_disagreement_score":0.6548577,"about_ca_system_score_codex":0.000026063255,"about_ca_system_score_gemma":0.000016135395,"threshold_uncertainty_score":0.42509505},"labels":[],"label_agreement":null},{"id":"W4399174802","doi":"10.5539/ijsp.v13n2p55","title":"A Queueing Model With Servers Disguised as Customers","year":2024,"lang":"en","type":"article","venue":"International Journal of Statistics and Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Queueing theory; Server; Queue; Computer science; Service (business); Layered queueing network; Bulk queue; Mathematical optimization; Mathematics; Computer network; Marketing","score_opus":0.011734976053640723,"score_gpt":0.26314880037493704,"score_spread":0.25141382432129633,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399174802","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.47992465,0.00025782516,0.5069436,0.0033547415,0.00078213465,0.00016491515,0.000071763025,0.00006699972,0.0084333755],"genre_scores_gemma":[0.98595184,0.000024353336,0.013318139,0.00029627982,0.00025907578,0.0000015468876,0.0000074242166,0.000011710997,0.00012965236],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99913883,0.000009360382,0.00028183832,0.00013397004,0.00034662106,0.00008939102],"domain_scores_gemma":[0.9990792,0.00011558347,0.00019343411,0.00006407407,0.0005307636,0.000016915601],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050447375,0.000094280986,0.0001318623,0.00017497338,0.000045290468,0.00030001096,0.0001648736,0.000020794978,0.00006854761],"category_scores_gemma":[0.0002464605,0.00007003281,0.000045362332,0.00012936254,0.00008587129,0.00069824106,0.000055480603,0.00014629438,0.000008971171],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004030469,0.00006142467,0.002588729,0.00019932457,0.00038163303,0.00023892397,0.00017756433,0.07215803,0.00009481375,0.90112484,0.0005773417,0.021994306],"study_design_scores_gemma":[0.00028146754,0.000021998894,0.0003325641,0.00015850338,0.00012834913,0.00003156393,0.00007697647,0.3139319,0.000010653102,0.67961156,0.005295743,0.000118717915],"about_ca_topic_score_codex":0.000085407344,"about_ca_topic_score_gemma":0.000050402767,"teacher_disagreement_score":0.50602716,"about_ca_system_score_codex":0.000063023654,"about_ca_system_score_gemma":0.00006111602,"threshold_uncertainty_score":0.28930128},"labels":[],"label_agreement":null},{"id":"W4399382035","doi":"10.37394/232026.2024.6.7","title":"A First-Passage-Time Problem for a Discrete-Time Markov Process","year":2024,"lang":"en","type":"article","venue":"International Journal of Applied Mathematics Computational Science and Systems Engineering","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Discrete time and continuous time; Markov chain; Markov renewal process; Process (computing); Computer science; Markov process; First-hitting-time model; Markov property; Markov model; Mathematics; Mathematical optimization; Statistics; Machine learning; Programming language","score_opus":0.006945173154122735,"score_gpt":0.2377650966141802,"score_spread":0.23081992346005745,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4399382035","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.051114045,0.00018981464,0.94155616,0.0010156089,0.00082568865,0.0006236779,0.000014553927,0.00017235217,0.0044880924],"genre_scores_gemma":[0.9554313,0.000002119682,0.043511,0.000056193927,0.0008573994,0.000035002,0.000006735584,0.00002712709,0.00007315565],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99832153,0.0000011893394,0.00048403567,0.00017885052,0.00085258804,0.0001617873],"domain_scores_gemma":[0.9984963,0.00030461888,0.00027194482,0.00005526084,0.0008463603,0.000025528165],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0015094564,0.00013474301,0.00022065022,0.00061843137,0.00010954236,0.00086037436,0.0004090597,0.000027246999,0.000013132158],"category_scores_gemma":[0.00019781993,0.00011096483,0.00006752285,0.00045759967,0.00006559535,0.0010250561,0.000073823554,0.00009060627,0.000023593442],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000015958325,0.000021647573,0.0000014942281,0.00051337323,0.00010262677,0.000008521128,0.00020975445,0.75253433,0.0014677885,0.24446355,0.00014653929,0.00051444495],"study_design_scores_gemma":[0.00016126064,0.0000069099865,0.000004850126,0.00045543487,0.000042758224,0.000050214043,0.000103189996,0.9216545,0.000026354017,0.075891525,0.0014828334,0.00012012184],"about_ca_topic_score_codex":0.0000011713252,"about_ca_topic_score_gemma":1.2430978e-7,"teacher_disagreement_score":0.9043172,"about_ca_system_score_codex":0.00010012788,"about_ca_system_score_gemma":0.00007438905,"threshold_uncertainty_score":0.82966095},"labels":[],"label_agreement":null},{"id":"W4400036881","doi":"10.2139/ssrn.4869846","title":"Multi-Listing for Horizontally Differentiated Services","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Listing (finance); Business; Differentiated services; Telecommunications; Computer science; Finance; Quality of service","score_opus":0.013562722721870748,"score_gpt":0.25727614078098937,"score_spread":0.24371341805911861,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4400036881","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8219667,0.013195712,0.15407494,0.001969522,0.004850485,0.0012863992,0.00004265398,0.0011515286,0.0014620507],"genre_scores_gemma":[0.9907641,0.00039057288,0.00095216767,0.00025412967,0.0049174037,0.000061584404,0.00021985595,0.00018316292,0.0022570535],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99588823,0.000028873379,0.000657515,0.0006799667,0.0003313064,0.0024140887],"domain_scores_gemma":[0.99829596,0.00006720428,0.000870832,0.0003745207,0.00036801051,0.000023488652],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0020471294,0.0005485682,0.00059172563,0.0006191299,0.0004581963,0.0011423916,0.0009434195,0.00027960073,0.000043374785],"category_scores_gemma":[0.00013578043,0.000495085,0.0006551476,0.00035289695,0.00004002912,0.00043426678,0.0011912931,0.0044184094,0.00013708694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00065679086,0.0004705334,0.0013731876,0.006590148,0.0073233144,0.00006385577,0.00027870949,0.015991649,0.0040359534,0.90021664,0.00026881197,0.062730394],"study_design_scores_gemma":[0.0006113574,0.000023078595,0.00006360662,0.00054413936,0.0013267412,0.000024753357,0.0008367385,0.08146727,0.00001622177,0.91272557,0.0017719475,0.0005885506],"about_ca_topic_score_codex":0.0003420248,"about_ca_topic_score_gemma":0.004338621,"teacher_disagreement_score":0.16879736,"about_ca_system_score_codex":0.0008092822,"about_ca_system_score_gemma":0.0005523123,"threshold_uncertainty_score":0.9998945},"labels":[],"label_agreement":null},{"id":"W4401075344","doi":"10.5206/mase/17434","title":"Markovian phase-type single working vacation queue with breakdown and standby server","year":2024,"lang":"en","type":"article","venue":"Mathematics in Applied Sciences and Engineering","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Erlang (programming language); Phase-type distribution; Computer science; Poisson distribution; Queueing theory; Queue; Markovian arrival process; Markov process; Real-time computing; Computer network; Markov chain; Mathematics; Statistics; Theoretical computer science","score_opus":0.017630906180938807,"score_gpt":0.22758435831098273,"score_spread":0.2099534521300439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401075344","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9386737,0.0004782712,0.049356595,0.00015723337,0.000109594985,0.00018643947,4.237615e-7,0.00021215656,0.010825585],"genre_scores_gemma":[0.98992854,0.000012052115,0.009886377,0.000033517663,0.000084813204,0.000007734989,0.0000015003021,0.000014930784,0.000030532134],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993314,0.0000013450197,0.00014372371,0.00021776796,0.00013786725,0.0001678664],"domain_scores_gemma":[0.9997856,0.00007458088,0.00003756615,0.00008137504,0.000010634105,0.0000102402255],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00052394945,0.00011524331,0.00013139438,0.00024352575,0.00009303297,0.00044102984,0.00008516696,0.000026956584,0.000014997831],"category_scores_gemma":[0.000021550406,0.000091485665,0.0000099651215,0.0008366843,0.000058170834,0.00031410693,0.00005798173,0.00008342592,0.0000038098312],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021189635,0.00008313001,0.0004184431,0.0015260528,0.00003928331,0.000015358542,0.00097098155,0.06484459,0.010618172,0.8994225,0.000021236618,0.022019045],"study_design_scores_gemma":[0.00025144542,0.00001696336,0.0000650416,0.0005696982,0.00004622039,0.0000070240667,0.0007787528,0.9660353,0.00020129418,0.029392274,0.0023548976,0.00028107138],"about_ca_topic_score_codex":0.000007674106,"about_ca_topic_score_gemma":0.000022848004,"teacher_disagreement_score":0.9011907,"about_ca_system_score_codex":0.000020773796,"about_ca_system_score_gemma":0.0000052886076,"threshold_uncertainty_score":0.42528608},"labels":[],"label_agreement":null},{"id":"W4401116280","doi":"10.1016/j.ejor.2024.07.032","title":"The impact of the correlation coefficient of interarrival and service times on queueing performance: The M/M/1 case","year":2024,"lang":"lv","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Queueing theory; Correlation coefficient; Mathematics; Computer science; Discrete mathematics; Statistics","score_opus":0.03912774083259004,"score_gpt":0.34208057404994663,"score_spread":0.3029528332173566,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401116280","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98732215,0.0016566768,0.00029808542,0.0052564424,0.000338382,0.00020370996,0.000007267007,0.0000038554804,0.004913442],"genre_scores_gemma":[0.99817383,0.00017170943,0.000015526586,0.00009204471,0.0006437986,7.831059e-7,0.0000020691027,0.00002617454,0.0008740446],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99702346,0.0010505896,0.00068383396,0.00015369212,0.0008702863,0.0002181074],"domain_scores_gemma":[0.9961269,0.0015383551,0.00037058612,0.00027893676,0.0016613993,0.00002384011],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.011052588,0.0001448094,0.00017674989,0.00029491546,0.0010587604,0.00068322604,0.0005911054,0.000020841082,0.00018067185],"category_scores_gemma":[0.001273591,0.00006371651,0.00019350629,0.0011157553,0.0003812971,0.0006739387,0.0004007442,0.00090975116,0.00005132208],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013029957,0.00018841978,0.0018230744,0.00046505386,0.0008634524,0.0005004931,0.0038096542,0.8986513,0.0023114022,0.05260751,0.0058325706,0.031644087],"study_design_scores_gemma":[0.0004723375,0.00036328434,0.010429393,0.0020699373,0.0001529584,0.00047452262,0.002681735,0.97792685,0.00025921874,0.0007443924,0.004290892,0.00013450602],"about_ca_topic_score_codex":0.000064062944,"about_ca_topic_score_gemma":0.000011683121,"teacher_disagreement_score":0.07927554,"about_ca_system_score_codex":0.000094186464,"about_ca_system_score_gemma":0.00021974882,"threshold_uncertainty_score":0.81432366},"labels":[],"label_agreement":null},{"id":"W4401369571","doi":"10.1287/opre.2022.0066","title":"Dynamic Control of Service Systems with Returns: Application to Design of Postdischarge Hospital Readmission Prevention Programs","year":2024,"lang":"en","type":"article","venue":"Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":6,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Psychological intervention; Queueing theory; Computer science; Control (management); Service (business); Operations management; Phone; Business; Operations research; Medicine; Economics; Computer network; Engineering; Nursing; Marketing","score_opus":0.02800667053225977,"score_gpt":0.3353523130211625,"score_spread":0.3073456424889027,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401369571","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15285704,0.00028993198,0.84068865,0.0025185652,0.00005883894,0.0030714131,0.0000096025815,0.000101251586,0.00040470334],"genre_scores_gemma":[0.99657536,0.0000060066855,0.0021073096,0.000019911797,0.0000706222,0.00047478697,0.000102881786,0.000024765977,0.00061837974],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99870014,0.00009349103,0.00028451378,0.00028037836,0.00045737767,0.00018408087],"domain_scores_gemma":[0.9984218,0.000069456386,0.00004721775,0.0003227458,0.0011200936,0.00001871874],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0014559927,0.000093297975,0.00016479373,0.0004585975,0.00016135442,0.00023544942,0.00021270124,0.000047011545,0.000030237454],"category_scores_gemma":[0.0001429569,0.00007239453,0.000033607805,0.0020206156,0.00004203371,0.00075832003,0.00006152195,0.00013846571,0.00008708523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00051089644,0.000715952,0.00041358607,0.0023844936,0.00029217338,0.0000073570773,0.0007455765,0.6984659,0.16225415,0.11803613,0.0002042892,0.015969498],"study_design_scores_gemma":[0.00020507367,0.00015203007,0.000064373926,0.00058435294,0.00005987278,8.684689e-7,0.000747229,0.9961469,0.0004082511,0.0008718675,0.0006555443,0.00010360666],"about_ca_topic_score_codex":0.000472525,"about_ca_topic_score_gemma":0.00019773805,"teacher_disagreement_score":0.8437183,"about_ca_system_score_codex":0.000056879722,"about_ca_system_score_gemma":0.00007781216,"threshold_uncertainty_score":0.29521632},"labels":[],"label_agreement":null},{"id":"W4401545477","doi":"10.1007/s41096-024-00204-w","title":"A Uniform Approach for Analyzing Queues with Correlated Interarrival and Service Times","year":2024,"lang":"en","type":"article","venue":"Journal of the Indian Society for Probability and Statistics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Bivariate analysis; Queueing theory; Queue; Bulk queue; Computer science; Markov chain; Layered queueing network; Fork–join queue; Mathematics; Applied mathematics; Markov process; Mathematical optimization; Statistics; Queue management system; Computer network","score_opus":0.012718242403854375,"score_gpt":0.2317405693868343,"score_spread":0.2190223269829799,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401545477","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.17864823,0.00048111985,0.8174965,0.0022596705,0.00018205639,0.0006707353,0.00015948674,0.0000364055,0.000065788496],"genre_scores_gemma":[0.6208303,0.00003740814,0.3773625,0.0009962268,0.0004666899,0.000020380692,0.000040053583,0.000041300333,0.000205158],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9992817,0.000011352579,0.000294148,0.00014953298,0.00011644629,0.00014683878],"domain_scores_gemma":[0.99897903,0.00031562193,0.00026869826,0.00010078162,0.0003181837,0.000017695611],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008949217,0.00012462029,0.0002253308,0.000046173125,0.0002954616,0.00028960814,0.00014019394,0.00005578718,0.0000042205975],"category_scores_gemma":[0.00020551102,0.00007604914,0.00016485013,0.00029142093,0.00014692168,0.00049371296,0.00006301455,0.00020272177,2.011223e-7],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022319898,0.00045882512,0.01069426,0.02831635,0.0061297882,0.000017675813,0.020321297,0.034129772,0.00016717502,0.81487566,0.014376193,0.06828101],"study_design_scores_gemma":[0.0007076295,0.000087808025,0.00018737782,0.00033190998,0.0011032623,0.000037976097,0.002245681,0.5322686,0.000010997855,0.45839357,0.0044118436,0.00021336526],"about_ca_topic_score_codex":0.000014122451,"about_ca_topic_score_gemma":0.00003484378,"teacher_disagreement_score":0.49813882,"about_ca_system_score_codex":0.000046984427,"about_ca_system_score_gemma":0.00005016245,"threshold_uncertainty_score":0.3101194},"labels":[],"label_agreement":null},{"id":"W4401804317","doi":"10.3390/math12172609","title":"Relations among the Queue-Length Probabilities in the Pre-Arrival, Random, and Post-Departure Epochs in the GI/Ma,b/c Queue","year":2024,"lang":"en","type":"article","venue":"Mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Queue; Computer science; Statistics; Mathematics; Computer network","score_opus":0.009874157605601628,"score_gpt":0.23269379324107284,"score_spread":0.22281963563547122,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401804317","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97494996,0.00075753406,0.0015829175,0.011628672,0.000106281164,0.0013066867,0.000005761137,0.00013151854,0.009530691],"genre_scores_gemma":[0.99771065,0.000022428942,0.00030170454,0.00086289796,0.00018965683,0.00020791317,0.000011085852,0.000029506697,0.0006641792],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99863565,0.0001505025,0.000433944,0.00023474879,0.00030237748,0.00024275981],"domain_scores_gemma":[0.99727285,0.0019893565,0.0001369094,0.0005378384,0.000057008627,0.0000060327484],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0028234813,0.0002074276,0.00024017884,0.00017303857,0.00028034745,0.0006617935,0.0004978114,0.00007666868,0.00005969978],"category_scores_gemma":[0.001328646,0.00009785527,0.00010534047,0.00083345117,0.00022671474,0.0007013164,0.00011867596,0.00045268348,0.000042200467],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003914791,0.00017766398,0.0025677509,0.0009699152,0.00008705174,0.000034162294,0.03770111,0.0035382004,0.000035843124,0.95204055,0.0021321692,0.0006764426],"study_design_scores_gemma":[0.0004950856,0.00001234187,0.0048936866,0.00047163808,0.0003112974,0.000018742392,0.028761217,0.09935382,0.000004987291,0.8566284,0.008761266,0.0002875163],"about_ca_topic_score_codex":0.0001710078,"about_ca_topic_score_gemma":0.0014484071,"teacher_disagreement_score":0.09581562,"about_ca_system_score_codex":0.00002935288,"about_ca_system_score_gemma":0.000018828341,"threshold_uncertainty_score":0.638169},"labels":[],"label_agreement":null},{"id":"W4401963879","doi":"10.1002/nav.22224","title":"Double‐sided queues and their applications to vaccine inventory management","year":2024,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Queue; Computer science; Stationary distribution; Markov process; Queueing theory; Abandonment (legal); Mathematical optimization; Markovian arrival process; Operations research; Markov chain; Mathematics; Statistics; Computer network","score_opus":0.10390181316815085,"score_gpt":0.38600428031670203,"score_spread":0.2821024671485512,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4401963879","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05990595,0.008428059,0.5255712,0.020033443,0.0011119202,0.0067988434,0.00007299755,0.002697734,0.37537986],"genre_scores_gemma":[0.99161905,0.00018463434,0.0007436304,0.00052441907,0.0011376739,0.0003954294,0.000054189753,0.000058265472,0.0052827094],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.997994,0.000043899145,0.0002924878,0.0006080414,0.0005085999,0.0005529665],"domain_scores_gemma":[0.9986039,0.00039467754,0.00004430476,0.00053834665,0.00035484278,0.000063970074],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0021724359,0.00020863504,0.0002254971,0.0010035646,0.00039590872,0.00068549137,0.00048311177,0.00007199435,0.0001515619],"category_scores_gemma":[0.00045653043,0.00017328895,0.0000719604,0.001818138,0.00014836802,0.00038312346,0.0008977833,0.00042236087,0.0010217235],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00013319246,0.00007189558,0.00016566845,0.0005937495,0.000147,0.00006114166,0.000084440326,0.0009014231,0.0006196684,0.9547579,0.011335716,0.031128166],"study_design_scores_gemma":[0.00038856856,0.00002751298,0.00016566455,0.00020121118,0.00008754723,0.000002097745,0.00071018015,0.02023897,0.00020996755,0.43257698,0.5450723,0.00031896494],"about_ca_topic_score_codex":0.00024945705,"about_ca_topic_score_gemma":0.00019862337,"teacher_disagreement_score":0.9317131,"about_ca_system_score_codex":0.00013900563,"about_ca_system_score_gemma":0.000028882112,"threshold_uncertainty_score":0.9997561},"labels":[],"label_agreement":null},{"id":"W4402124033","doi":"10.3390/axioms13090594","title":"Optimal Service Time Distribution for an M/G/1 Waiting Queue","year":2024,"lang":"en","type":"article","venue":"Axioms","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queue; Service (business); Computer science; Distribution (mathematics); Computer network; Operations research; Business; Mathematics","score_opus":0.015278585128614953,"score_gpt":0.25504850900035414,"score_spread":0.23976992387173918,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402124033","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6857233,0.00016273624,0.3060662,0.0025653015,0.00043792807,0.00036069265,0.000053553245,0.0011904024,0.0034398772],"genre_scores_gemma":[0.99591666,8.0076506e-7,0.00032670525,0.00072993804,0.0015280518,0.000034241613,0.0008320224,0.0000366171,0.0005949337],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991777,0.000007966463,0.00016956452,0.00029743745,0.00010745644,0.00023986243],"domain_scores_gemma":[0.99954516,0.00007733675,0.000060487248,0.00018580153,0.00011977752,0.000011438733],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00040273528,0.00013006755,0.0001306315,0.000092176524,0.00018493661,0.00035165742,0.00017055472,0.0000500072,0.00018041854],"category_scores_gemma":[0.00009493988,0.0001244464,0.000085402324,0.00058749923,0.000020600264,0.0015462963,0.00007169545,0.000078398254,0.00088625774],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00011112101,0.00008537594,0.000023402808,0.0006775787,0.0001633902,0.00002142926,0.00016353924,0.0239175,0.009374857,0.92477477,0.0035053026,0.03718173],"study_design_scores_gemma":[0.000116535215,0.000009261901,0.00002370264,0.00006309596,0.00012934185,0.0000017849861,0.0001363448,0.93296915,0.00023379101,0.008892189,0.057230555,0.0001942395],"about_ca_topic_score_codex":0.00012558547,"about_ca_topic_score_gemma":0.000026415186,"teacher_disagreement_score":0.9158826,"about_ca_system_score_codex":0.00003687286,"about_ca_system_score_gemma":0.000009722325,"threshold_uncertainty_score":0.99989164},"labels":[],"label_agreement":null},{"id":"W4402454641","doi":"10.5206/mase/18954","title":"Time-dependent behaviour of an M/M/3 heterogeneous server queueing system with multiple vacations subject to system disaster","year":2024,"lang":"en","type":"article","venue":"Mathematics in Applied Sciences and Engineering","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subject (documents); Queueing system; Computer science; Queueing theory; Real-time computing; Distributed computing; Environmental science; Computer network; World Wide Web","score_opus":0.00945319574813253,"score_gpt":0.21022003501602468,"score_spread":0.20076683926789216,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402454641","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94647837,0.00003020396,0.0522284,0.000008987282,0.000051208048,0.00020702042,0.0000017221961,0.0001808645,0.0008132128],"genre_scores_gemma":[0.991502,2.5392174e-7,0.00835431,0.0000062022623,0.00005563766,0.000040515875,0.000001560093,0.000022386066,0.000017176626],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99910635,0.0000032969526,0.000248953,0.0002503184,0.00020776551,0.00018331174],"domain_scores_gemma":[0.99967265,0.000068003974,0.000057124547,0.00016604064,0.00001837094,0.000017832439],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006094981,0.00013392,0.00020514008,0.00032893266,0.00008256929,0.00021814725,0.00018210127,0.000027337006,0.0000043264026],"category_scores_gemma":[0.000012124921,0.000106140025,0.000023180337,0.00062275055,0.00003259663,0.0002743317,0.000086442065,0.00006179897,0.00001759821],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004299515,0.000022532156,0.00019462514,0.0018442856,0.000016282005,0.000011531196,0.00064477685,0.92510575,0.0028651974,0.069147296,5.1508664e-7,0.00014292914],"study_design_scores_gemma":[0.0000728629,0.000008740468,0.00004267898,0.0006554422,0.000040857158,0.0000118496055,0.002736422,0.9957454,0.00039534303,0.00012949778,0.000008147108,0.00015275509],"about_ca_topic_score_codex":0.000044052438,"about_ca_topic_score_gemma":0.000061266444,"teacher_disagreement_score":0.07063968,"about_ca_system_score_codex":0.000048042468,"about_ca_system_score_gemma":0.000006164796,"threshold_uncertainty_score":0.43282646},"labels":[],"label_agreement":null},{"id":"W4402537714","doi":"10.2139/ssrn.4955803","title":"Early Birds versus Last-Minute Arrivals: Empirical Evidence and Theoretical Analysis of Arrival Time Queueing Game","year":2024,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Queueing theory; Computer science; Econometrics; Economics; Computer network","score_opus":0.025574087492450295,"score_gpt":0.2962825515939473,"score_spread":0.270708464101497,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4402537714","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9799496,0.0103389565,0.0064122225,0.0011844452,0.0006083304,0.00020735188,0.000008353341,0.00018045785,0.0011102754],"genre_scores_gemma":[0.99609244,0.0013604943,0.00015369552,0.00009570747,0.0019116149,0.000011492514,0.000016725711,0.000103313534,0.00025449903],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9948816,0.0001978157,0.001012983,0.0008257218,0.00084873673,0.002233186],"domain_scores_gemma":[0.9973416,0.0006832357,0.0009351012,0.0006367052,0.00032832037,0.00007506134],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0054500257,0.00062131346,0.0012989689,0.001991227,0.0001842187,0.0005804375,0.0008689079,0.00037125478,0.00033588053],"category_scores_gemma":[0.0012143917,0.00055072195,0.001031305,0.002043948,0.0004780443,0.0007197935,0.0016939789,0.004896294,0.00016036957],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011127384,0.0001396065,0.006966123,0.00037994876,0.016584,0.00005190238,0.00040210056,0.009958583,0.0004945986,0.9553893,0.00005468942,0.008466368],"study_design_scores_gemma":[0.00046938774,0.00009280978,0.0011357759,0.00062406214,0.02080002,0.0000267081,0.0005570566,0.047878053,0.00002725737,0.92739904,0.00023474856,0.000755054],"about_ca_topic_score_codex":0.00011660531,"about_ca_topic_score_gemma":0.00021730273,"teacher_disagreement_score":0.037919473,"about_ca_system_score_codex":0.0007076545,"about_ca_system_score_gemma":0.00073043996,"threshold_uncertainty_score":0.9996944},"labels":[],"label_agreement":null},{"id":"W4403898174","doi":"10.1016/j.cor.2024.106867","title":"Re-direction in queueing networks with two customer types: The inter-departure analysis","year":2024,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"RES’EAU-WaterNET; Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Computer science; Layered queueing network; Network analysis; Mean value analysis; G-network; Queueing system; Operations research; Computer network; Mathematics","score_opus":0.03002399265608352,"score_gpt":0.3429309350908098,"score_spread":0.3129069424347263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403898174","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.09790939,0.0012938788,0.87210786,0.011052727,0.00074009557,0.00087855686,0.0000023761045,0.0005715579,0.015443573],"genre_scores_gemma":[0.99713284,0.000021456946,0.000623393,0.00036601105,0.0007875039,0.00006485007,0.000044303684,0.000025512445,0.00093411567],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99858004,0.00015779286,0.00022001196,0.0004001283,0.0003181297,0.0003239204],"domain_scores_gemma":[0.9990017,0.0002920366,0.000018891475,0.00039513822,0.00027819345,0.000014029387],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0016107449,0.00013334889,0.00018195972,0.0014301987,0.00052041485,0.001337925,0.00034679807,0.000045486144,0.00016566754],"category_scores_gemma":[0.000082081104,0.000088868466,0.00009447673,0.0078087635,0.00013083513,0.00093348656,0.0002090652,0.0006187422,0.0001891254],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002250858,0.000023241566,0.0010882663,0.000017871367,0.00027483242,0.000029654357,0.00020549937,0.97541565,0.000016326454,0.013068911,0.0019971698,0.00784008],"study_design_scores_gemma":[0.00009819484,0.0000068348713,0.0003438402,0.00009470571,0.00014055002,0.0000010593105,0.00041212732,0.97894865,0.0000040437985,0.00027346908,0.019559978,0.00011654577],"about_ca_topic_score_codex":0.0016923877,"about_ca_topic_score_gemma":0.02491873,"teacher_disagreement_score":0.89922345,"about_ca_system_score_codex":0.00012319139,"about_ca_system_score_gemma":0.000034858283,"threshold_uncertainty_score":0.99969876},"labels":[],"label_agreement":null},{"id":"W4403920083","doi":"10.1109/sm63044.2024.10733469","title":"Performance Assessment of Vehicular Cloud Systems: An Analytical Approach Using M/G/m Queueing Model","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Queueing theory; Computer science; Cloud computing; Layered queueing network; Computer network; Operating system","score_opus":0.040774429043278174,"score_gpt":0.3012021272936195,"score_spread":0.26042769825034134,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403920083","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.5599771,0.0000793478,0.41799694,0.000020368694,0.00014098649,0.000119923505,9.048354e-7,0.00020499802,0.021459388],"genre_scores_gemma":[0.98946846,0.0000044675717,0.009456362,0.00008445002,0.0005823686,0.000008507674,0.000018784527,0.000040924704,0.00033567744],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984781,0.00002976019,0.00043017126,0.00041529073,0.00037123656,0.00027543245],"domain_scores_gemma":[0.9992997,0.000036490226,0.00012125084,0.00038463043,0.00013922306,0.000018694582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012120634,0.00020247347,0.0003430445,0.00039499928,0.00013367968,0.00030497325,0.00025180972,0.00007442285,0.000041097304],"category_scores_gemma":[0.000027686043,0.00016988041,0.00013153866,0.00082093047,0.00006688661,0.0019810516,0.00014148389,0.00018372164,0.000013490458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000004914175,0.000045527315,0.0009977742,0.0006788614,0.00007505939,0.000004259295,0.000014372859,0.7238563,0.00048317076,0.2735369,0.000020480335,0.00028243795],"study_design_scores_gemma":[0.00008019036,0.000005600289,0.000054364096,0.00014018355,0.0003447789,0.0000031380594,0.0003159244,0.9974073,0.00001894413,0.0011759134,0.00023366298,0.00021997301],"about_ca_topic_score_codex":0.00015373892,"about_ca_topic_score_gemma":0.0000023182104,"teacher_disagreement_score":0.4294913,"about_ca_system_score_codex":0.00009016525,"about_ca_system_score_gemma":0.000048720583,"threshold_uncertainty_score":0.69275224},"labels":[],"label_agreement":null},{"id":"W4403922183","doi":"10.1080/02331934.2024.2422040","title":"Optimal control of a queueing system","year":2024,"lang":"en","type":"article","venue":"Optimization","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":5,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Queueing theory; Mathematics; Layered queueing network; Queueing system; Mathematical optimization; Control (management); Applied mathematics; Computer science; Statistics; Artificial intelligence","score_opus":0.005509324901175521,"score_gpt":0.20698902113128992,"score_spread":0.20147969623011439,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4403922183","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.004355941,0.00018460111,0.985108,0.00013843128,0.00020128196,0.00009886368,0.0000015683179,0.00029707496,0.009614214],"genre_scores_gemma":[0.9925168,0.0000026115042,0.006871969,0.000068832,0.0003270802,0.000008816274,0.000018037335,0.00002137202,0.00016445474],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99944353,0.000009234835,0.00019029388,0.00015063566,0.000109311884,0.000096968455],"domain_scores_gemma":[0.99965304,0.00003800113,0.00009408517,0.00011610568,0.00009474381,0.000004024908],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002433121,0.00007908256,0.00013197096,0.00021794697,0.00005401339,0.00012145345,0.00007898733,0.00003342532,0.0001211526],"category_scores_gemma":[0.000056659628,0.00007410731,0.00006410378,0.00050928333,0.000019997824,0.00079098175,0.0000248181,0.000044486544,0.00006038877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014789566,0.000006073706,0.000052596224,0.0002450169,0.000032732514,0.0000049644927,0.000013892979,0.8797413,0.00015770305,0.11903875,0.00004843685,0.00064370816],"study_design_scores_gemma":[0.00013311933,0.0000024540454,0.0000049157807,0.0001601374,0.0001237551,0.0000010441015,0.00011035457,0.99775887,0.000049846967,0.00017699569,0.0014019217,0.00007658377],"about_ca_topic_score_codex":0.00002994239,"about_ca_topic_score_gemma":0.0000012542674,"teacher_disagreement_score":0.9881609,"about_ca_system_score_codex":0.000029421222,"about_ca_system_score_gemma":0.000008169522,"threshold_uncertainty_score":0.30220082},"labels":[],"label_agreement":null},{"id":"W4404171920","doi":"10.1145/3694860.3694874","title":"Optimality Analysis of a Two-Server Queuing System with the RID Discipline","year":2024,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Queueing theory; Computer network; Queue management system; Distributed computing","score_opus":0.011450471515136255,"score_gpt":0.25493014332729025,"score_spread":0.243479671812154,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404171920","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.80480814,0.00024345273,0.15656641,0.0019357511,0.0001255706,0.00024087421,0.000007878348,0.0006278031,0.03544411],"genre_scores_gemma":[0.99831295,8.35966e-7,0.00041206123,0.0001668135,0.00024256913,0.000014914536,0.000019248808,0.000021836331,0.0008087975],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9988517,0.000026358046,0.00029630942,0.00033283466,0.00029524913,0.00019750596],"domain_scores_gemma":[0.99905586,0.00014336454,0.00015988041,0.0004962359,0.00013620398,0.0000084692065],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001004337,0.00016985998,0.0003658967,0.0004670763,0.00015101126,0.0002603593,0.00029734918,0.000024675528,0.00030282437],"category_scores_gemma":[0.0000259023,0.00008949151,0.00027244832,0.0040096757,0.000096097014,0.00078366883,0.00018839813,0.00011321352,0.000055867367],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000055456807,0.000032036092,0.0044608978,0.00046525878,0.003174372,0.000024616109,0.00010082898,0.3826133,0.00015023163,0.6080784,0.0001397081,0.00070488936],"study_design_scores_gemma":[0.00015452727,0.000004994224,0.0017659755,0.00013463819,0.006292929,0.0000011414941,0.0015419308,0.98801166,0.00006192983,0.00084669306,0.0009693053,0.00021429594],"about_ca_topic_score_codex":0.0008645503,"about_ca_topic_score_gemma":0.0014869414,"teacher_disagreement_score":0.60723174,"about_ca_system_score_codex":0.000043121116,"about_ca_system_score_gemma":0.0000109892835,"threshold_uncertainty_score":0.36493576},"labels":[],"label_agreement":null},{"id":"W4404504296","doi":"10.1016/j.ejor.2024.11.017","title":"Optimal capacity planning for cloud service providers with periodic, time-varying demand","year":2024,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ontario Council of University Libraries","funders":"Schulich School of Business, York University","keywords":"Cloud computing; Service provider; Computer science; Capacity planning; Service (business); On demand; Capacity management; Operations research; Business; Computer network; Marketing; Mathematics","score_opus":0.06802386906212089,"score_gpt":0.32605111162478256,"score_spread":0.2580272425626617,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404504296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8995839,0.0006120389,0.07716297,0.008081474,0.000253793,0.00041746118,0.000007844383,0.00007071315,0.013809795],"genre_scores_gemma":[0.986129,0.000003773818,0.009008837,0.00059791893,0.0033075407,0.000005911211,0.000017929835,0.00006246141,0.000866614],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99820393,0.00018082636,0.00036041494,0.00022568776,0.00073424866,0.00029488408],"domain_scores_gemma":[0.997964,0.00036620654,0.00011285952,0.0001184263,0.0014032787,0.00003520468],"candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0059309434,0.00013153868,0.0001762165,0.0004996324,0.00058530836,0.0013233076,0.00035113207,0.000017473067,0.00024281844],"category_scores_gemma":[0.000611706,0.00009826414,0.000085675194,0.00065248035,0.00010386198,0.0019032847,0.00010883716,0.00049320096,0.0002330742],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021418282,0.00013223545,0.00054850936,0.0008872179,0.0006802257,0.0012994955,0.0021398664,0.9241026,0.018100826,0.024532076,0.02212416,0.0033109765],"study_design_scores_gemma":[0.0023541711,0.0004735351,0.0007154578,0.0021629583,0.00026790844,0.00033508783,0.0017189526,0.6752111,0.0007625969,0.002517388,0.3127924,0.00068850705],"about_ca_topic_score_codex":0.0000066639045,"about_ca_topic_score_gemma":0.0000018282748,"teacher_disagreement_score":0.29066822,"about_ca_system_score_codex":0.00006622066,"about_ca_system_score_gemma":0.00015106426,"threshold_uncertainty_score":0.9997134},"labels":[],"label_agreement":null},{"id":"W4404989381","doi":"10.1017/9781009562942.006","title":"Waiting Time Distributions","year":2024,"lang":"en","type":"book-chapter","venue":"Cambridge University Press eBooks","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Lockheed Martin (Canada)","funders":"","keywords":"Computer science","score_opus":0.01401408067612702,"score_gpt":0.18613862600780626,"score_spread":0.17212454533167923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4404989381","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00010796466,0.000096141324,0.00044790836,0.000062335064,0.00020945497,0.00019495026,0.00022917366,0.00061763916,0.9980344],"genre_scores_gemma":[0.002804488,0.000008626049,0.000019898698,0.0001095751,0.00092044123,6.707918e-7,0.000401492,0.00007965338,0.9956552],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99869287,0.000005944515,0.00020605238,0.0005665323,0.00022508742,0.00030352036],"domain_scores_gemma":[0.9989753,0.000059185117,0.00026755637,0.00048587398,0.00018374491,0.000028352233],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00013615385,0.00039441002,0.0003921128,0.00037318803,0.00035468437,0.00021018398,0.00048406186,0.00023880137,0.000067154026],"category_scores_gemma":[0.000024805484,0.00046845755,0.0003782318,0.00003319671,0.0001995405,0.00035631083,0.0007911745,0.0005032913,0.0013748148],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000021960603,0.000004390964,2.0695556e-7,0.0001414215,0.000210889,0.00031157094,0.000002966222,0.000034635075,0.000039017355,0.9682115,0.030477514,0.0005439781],"study_design_scores_gemma":[0.00014172871,0.000002914351,3.833647e-7,0.00029159515,0.0011394684,0.000004062873,0.000015791862,0.0047338447,0.00002089366,0.0019116838,0.9912421,0.00049551413],"about_ca_topic_score_codex":0.000079880825,"about_ca_topic_score_gemma":0.000001699533,"teacher_disagreement_score":0.9662998,"about_ca_system_score_codex":0.00019188605,"about_ca_system_score_gemma":0.000025324154,"threshold_uncertainty_score":0.9997767},"labels":[],"label_agreement":null},{"id":"W4405628331","doi":"10.1177/10591478241309662","title":"Translating Empirical State-Dependent Service Times Into Queueing Models","year":2024,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"Natural Sciences and Engineering Research Council of Canada; University of Alberta","keywords":"Computer science; Queueing theory; Service (business); Queue; Service level objective; Operations research; Workload; Layered queueing network; Service delivery framework; Service design; Computer network; Mathematics; Economics","score_opus":0.023119600412482743,"score_gpt":0.2757200167978022,"score_spread":0.2526004163853195,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405628331","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24488275,0.0026409607,0.5612458,0.119589,0.0027152365,0.0022629902,0.0000040397335,0.0029916812,0.063667566],"genre_scores_gemma":[0.9887882,0.00006803744,0.004295316,0.0013554636,0.00051269605,0.00008000425,0.00002398789,0.00003281046,0.004843513],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99882275,0.000020726357,0.00026652892,0.0005126568,0.00020437781,0.00017298119],"domain_scores_gemma":[0.999632,0.000010281901,0.000027710828,0.00021445708,0.00010176403,0.000013804511],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00049950933,0.00016253545,0.00012930928,0.0003685694,0.00045829578,0.0007431516,0.000100255915,0.000025246225,0.000118444324],"category_scores_gemma":[0.000020190326,0.00015058233,0.00004170562,0.00075178663,0.000027972019,0.002265278,0.00011731343,0.00012161253,0.000157851],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000210379,0.00006585425,0.00006208881,0.00064965925,0.00017346798,0.000011789995,0.0015505907,0.6883432,0.0002665387,0.22120373,0.0004600286,0.08719199],"study_design_scores_gemma":[0.00012054946,0.000005894798,0.000029676828,0.00015182322,0.00021231387,0.0000036247336,0.0014624228,0.90918034,0.00008030203,0.06596268,0.022497144,0.0002931973],"about_ca_topic_score_codex":0.00013757653,"about_ca_topic_score_gemma":0.00062439224,"teacher_disagreement_score":0.7439054,"about_ca_system_score_codex":0.00004909949,"about_ca_system_score_gemma":0.00000902012,"threshold_uncertainty_score":0.71662277},"labels":[],"label_agreement":null},{"id":"W4405861097","doi":"10.1016/j.ejor.2024.12.030","title":"Approximating <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si6.svg\" display=\"inline\" id=\"d1e1380\"> <mml:mrow> <mml:mi>G</mml:mi> <mml:mrow> <mml:mo>(</mml:mo> <mml:mi>t</mml:mi> <mml:mo>)</mml:mo> </mml:mrow> <mml:mo>/</mml:mo> <mml:mi>G</mml:mi> <mml:mi>I</mml:mi> <mml:mo>/</mml:mo> <mml:mn>1</mml:mn> </mml:mrow> </mml:math> queues with deep learning","year":2024,"lang":"lv","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":7,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"Natural Sciences and Engineering Research Council of Canada; University of Toronto","keywords":"Computer science; Scalable Vector Graphics; Algorithm; World Wide Web","score_opus":0.026562535343178536,"score_gpt":0.2735914420981636,"score_spread":0.24702890675498507,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405861097","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.62724483,0.006402697,0.0074156285,0.0034882056,0.0050868155,0.0002663665,0.0006807121,0.00092977355,0.34848496],"genre_scores_gemma":[0.96749836,0.0032096263,0.0075811883,0.0030620254,0.010360467,0.0014138467,0.002769547,0.002822479,0.0012824567],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","domain_scores_codex":[0.9701066,0.0029220907,0.006106931,0.004836544,0.009623777,0.0064040734],"domain_scores_gemma":[0.9806803,0.0055314954,0.0058202716,0.0036759626,0.0017843194,0.0025076652],"candidate_categories":["metaresearch","metaepi_narrow","sts","scholarly_communication","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","sts","research_integrity","insufficient_payload"],"category_scores_codex":[0.014574654,0.0026585297,0.0012371257,0.0030162332,0.007280865,0.0096259415,0.0068730125,0.0032878234,0.14299852],"category_scores_gemma":[0.01019278,0.0045036385,0.0044213994,0.005232201,0.004629627,0.007694095,0.006449306,0.00833665,0.007877664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004863631,0.0010138178,0.000054823897,0.003429932,0.0058344505,0.007202011,0.0035954297,0.029373469,0.006264704,0.7297781,0.20004098,0.008548633],"study_design_scores_gemma":[0.006822487,0.005449404,0.00016091764,0.00879369,0.006137729,0.0070600505,0.011731921,0.2066529,0.70470566,0.0045056157,0.031282693,0.0066969437],"about_ca_topic_score_codex":0.0022123386,"about_ca_topic_score_gemma":0.0016312847,"teacher_disagreement_score":0.7252725,"about_ca_system_score_codex":0.00013354624,"about_ca_system_score_gemma":0.0040083057,"threshold_uncertainty_score":0.9986149},"labels":[],"label_agreement":null},{"id":"W4405913108","doi":"10.1080/16843703.2024.2440250","title":"Joining behavior and vacation strategy in the queue with heterogeneous customers","year":2024,"lang":"en","type":"article","venue":"Quality Technology & Quantitative Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Social Science Fund of China","keywords":"Queue; Business; Computer science; Advertising; Computer network","score_opus":0.0394289230187911,"score_gpt":0.33483408327760494,"score_spread":0.29540516025881386,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4405913108","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.97634536,0.0008680417,0.0090539465,0.0043027448,0.0000762403,0.00077377976,0.0000031683012,0.0005479765,0.008028755],"genre_scores_gemma":[0.9977854,0.00004150651,0.0010046033,0.0006976105,0.000028190074,0.00027273592,0.000017160319,0.000025398816,0.00012737728],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9985434,0.000076690136,0.00034625127,0.00051395426,0.00023331202,0.00028643862],"domain_scores_gemma":[0.9993036,0.00012602807,0.00014736403,0.00035703735,0.000059813618,0.0000061656756],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001241968,0.00022006646,0.00023768879,0.001017029,0.00017606518,0.0002448697,0.00031291507,0.00007975171,0.000025714695],"category_scores_gemma":[0.000048728158,0.00016048629,0.000046519814,0.0018263861,0.00028560054,0.00054844964,0.0001602865,0.00028314305,0.000078963865],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000035450896,0.00007274042,0.002934233,0.00022652844,0.00012682583,0.000190864,0.00020227412,0.0013839144,0.00008653806,0.97214615,0.00006027142,0.022534227],"study_design_scores_gemma":[0.0031489884,0.00064761605,0.051330313,0.0014084425,0.0031564354,0.00009602777,0.17038709,0.050042804,0.0004433094,0.6363532,0.0797985,0.0031872701],"about_ca_topic_score_codex":0.00012803148,"about_ca_topic_score_gemma":0.00037800986,"teacher_disagreement_score":0.33579293,"about_ca_system_score_codex":0.000055722787,"about_ca_system_score_gemma":0.000006929243,"threshold_uncertainty_score":0.65444416},"labels":[],"label_agreement":null},{"id":"W4406552378","doi":"10.1016/s1553-3212(06)71651-x","title":"10.1016/s1553-3212(06)71651-x","year":2000,"lang":"en","type":"article","venue":"Time to knit","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Subclinical infection; Cognitive decline; Cognition; Psychology; Medicine; Virology; Neuroscience; Dementia; Internal medicine; Disease","score_opus":0.005459131999974177,"score_gpt":0.17175287946774104,"score_spread":0.16629374746776687,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406552378","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0014294375,0.000032080316,0.000018939367,0.00046881897,0.0000019271524,0.00013744552,0.0000021121343,0.00035733712,0.9975519],"genre_scores_gemma":[0.0012678248,1.2499977e-7,0.00013618771,0.00045841452,0.00081377075,0.000017549446,0.000036856007,0.000045957837,0.9972233],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.99886405,0.00001426281,0.00023000929,0.00033269025,0.0002115847,0.00034737872],"domain_scores_gemma":[0.9993439,0.00004393825,0.0000807951,0.00042420535,0.00008030329,0.00002686421],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00027477907,0.00020252103,0.00023624675,0.00021972564,0.00018067812,0.0001636533,0.00035800785,0.000055408473,0.99737805],"category_scores_gemma":[0.000105033054,0.00020105817,0.000115396935,0.00071140105,0.000040636718,0.0006939229,0.000107509186,0.00011440483,0.99810094],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00018632636,0.00008699796,8.825948e-7,0.00002889046,0.00006573725,0.000018023833,0.0000098189785,0.0049479287,0.0000640656,0.000108114655,0.39405352,0.6004297],"study_design_scores_gemma":[0.00018643803,0.0000084134235,0.000012832665,0.00002047797,0.00008129142,0.0000011935223,0.000002850462,0.0025766264,0.000019026762,0.0006556114,0.9961612,0.00027402464],"about_ca_topic_score_codex":0.000035857112,"about_ca_topic_score_gemma":5.523613e-7,"teacher_disagreement_score":0.6021077,"about_ca_system_score_codex":0.00003086949,"about_ca_system_score_gemma":0.000008340326,"threshold_uncertainty_score":0.81989145},"labels":[],"label_agreement":null},{"id":"W4406665983","doi":"10.36227/techrxiv.173747579.95902813/v1","title":"CVaR-Based Variational Quantum Optimization for User Association in Handoff-Aware Vehicular Networks","year":2025,"lang":"en","type":"preprint","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University; York University","funders":"","keywords":"CVAR; Handover; Association (psychology); Computer science; Quantum; Computer network; Mathematical optimization; Mathematics; Physics; Business; Quantum mechanics; Psychology","score_opus":0.011549716513575625,"score_gpt":0.241277271140952,"score_spread":0.22972755462737637,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406665983","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"methods","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0007643997,0.000046730136,0.99498457,0.0014640524,0.00077612425,0.0008065359,0.000025418576,0.00021116367,0.00092102546],"genre_scores_gemma":[0.8532985,0.000077824196,0.088179916,0.0145545965,0.0066449028,0.0024286013,0.023306124,0.00024509517,0.011264436],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9981901,0.00005186681,0.00056357216,0.0005755799,0.00030540046,0.00031349252],"domain_scores_gemma":[0.99779963,0.00044204274,0.00076834694,0.0003389591,0.00064233097,0.000008694965],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0012557186,0.0003077666,0.0004577172,0.00061149633,0.00016784933,0.00025861742,0.00027791085,0.00048399655,0.00035302914],"category_scores_gemma":[0.0008093649,0.00032930612,0.00026823726,0.0006368302,0.000011805522,0.0004733186,0.00028187066,0.00036544737,0.000010390394],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000814411,0.000073385614,0.0039895684,0.00023609308,0.00011491039,9.31225e-7,0.000003872039,0.9571868,8.513328e-7,0.036315527,0.001823333,0.00017328608],"study_design_scores_gemma":[0.00088785804,0.0000022547752,0.0004597204,0.00020415462,0.00029408687,1.4509268e-8,0.0000141859555,0.97071,0.0000036738445,0.023985771,0.0031067317,0.00033157246],"about_ca_topic_score_codex":0.00024537713,"about_ca_topic_score_gemma":0.00022793017,"teacher_disagreement_score":0.9068046,"about_ca_system_score_codex":0.0004301171,"about_ca_system_score_gemma":0.00010569484,"threshold_uncertainty_score":0.9999159},"labels":[],"label_agreement":null},{"id":"W4406702100","doi":"10.3390/math13030346","title":"Machine Learning Tool for Analyzing Finite Buffer Queueing Systems","year":2025,"lang":"en","type":"article","venue":"Mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Buffer (optical fiber); Computer science; Queueing theory; Distributed computing; Computer network; Telecommunications","score_opus":0.014270225748836664,"score_gpt":0.24916225542423834,"score_spread":0.23489202967540168,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406702100","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034039095,0.0004240513,0.9523013,0.00027645318,0.00031760143,0.00046798418,0.0000029925388,0.0004019797,0.011768521],"genre_scores_gemma":[0.9785544,0.000013793649,0.010106061,0.00044339406,0.0004773785,0.00009948342,0.000042075706,0.00006038493,0.010202995],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9989535,0.000012942119,0.0004162527,0.00022508069,0.0001304157,0.0002617702],"domain_scores_gemma":[0.9987913,0.00049334974,0.00028173,0.00028025336,0.00014726828,0.000006114961],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008362171,0.00018572841,0.00035178626,0.000346617,0.0003262978,0.0003362528,0.00022384129,0.00005967482,0.000043750006],"category_scores_gemma":[0.0014058981,0.00017003652,0.0001460162,0.00059670483,0.000024105717,0.0004237198,0.00013575962,0.00014514683,0.00007591754],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00002534858,0.0000851029,0.0033462346,0.0030809923,0.00024682196,0.0000046827045,0.00013925805,0.12456595,0.0005338216,0.8651782,0.0004638049,0.0023297712],"study_design_scores_gemma":[0.00028397737,0.000003362578,0.000013624293,0.00035027735,0.00029023725,4.3858407e-7,0.0002465619,0.8923858,0.000040111638,0.07312166,0.033050302,0.00021365764],"about_ca_topic_score_codex":0.00003253669,"about_ca_topic_score_gemma":0.000008740378,"teacher_disagreement_score":0.94451535,"about_ca_system_score_codex":0.000040227686,"about_ca_system_score_gemma":0.000009043761,"threshold_uncertainty_score":0.6933888},"labels":[],"label_agreement":null},{"id":"W4406904152","doi":"10.2139/ssrn.5075233","title":"Self-Service or Staffed Checkout? Service Channel Strategies in Supermarkets","year":2025,"lang":"en","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McGill University","funders":"","keywords":"Business; Service (business); Channel (broadcasting); Advertising; Marketing; Telecommunications; Computer science","score_opus":0.012367518544564339,"score_gpt":0.2524964551972146,"score_spread":0.24012893665265025,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4406904152","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8749601,0.009053308,0.021714767,0.027019467,0.0040633185,0.0028734135,0.000056574943,0.0018532748,0.05840577],"genre_scores_gemma":[0.98363256,0.0043781833,0.00040671186,0.004821603,0.003092128,0.00010551133,0.00017853465,0.00015462711,0.0032301324],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.994508,0.00014464646,0.000933429,0.0007997028,0.00053576514,0.0030784346],"domain_scores_gemma":[0.99760956,0.00013621378,0.0008377974,0.0006902448,0.000693349,0.00003281996],"candidate_categories":["metaepi_narrow","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0036443637,0.00074882153,0.00091665034,0.001231639,0.00035687184,0.00089426065,0.0017024637,0.0004498697,0.00018911222],"category_scores_gemma":[0.00017038974,0.0006765684,0.000293808,0.0020281093,0.000030743988,0.0017806415,0.0012787299,0.006049192,0.0001088966],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.004679029,0.0018009067,0.0018157955,0.01188622,0.0064363824,0.00037339982,0.0027472908,0.20726448,0.00018707194,0.75124323,0.0006187104,0.010947487],"study_design_scores_gemma":[0.00171021,0.00002737172,0.00020569858,0.000902471,0.0007797606,0.000051196883,0.01487696,0.056425825,0.000009724098,0.91593724,0.00790592,0.0011676451],"about_ca_topic_score_codex":0.0015528715,"about_ca_topic_score_gemma":0.06250605,"teacher_disagreement_score":0.164694,"about_ca_system_score_codex":0.001591378,"about_ca_system_score_gemma":0.004723915,"threshold_uncertainty_score":0.9995685},"labels":[],"label_agreement":null},{"id":"W4407356695","doi":"10.3390/axioms14020130","title":"Optimal Control Problems for Erlang Loss Systems","year":2025,"lang":"en","type":"article","venue":"Axioms","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Erlang (programming language); Erlang distribution; Computer science; Mathematics; Statistics; Programming language; Gamma distribution; Functional programming","score_opus":0.008572182346576097,"score_gpt":0.23263882027218033,"score_spread":0.22406663792560425,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4407356695","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.05308967,0.0005529028,0.9318593,0.0013698322,0.0009025755,0.0009977629,0.000009567463,0.0003600196,0.010858356],"genre_scores_gemma":[0.9944462,0.0000017871253,0.00012955777,0.0008996226,0.0005672021,0.00018356244,0.000024173789,0.000020038116,0.0037278594],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9991494,0.000008993268,0.00023350985,0.0002467329,0.000098942895,0.00026242307],"domain_scores_gemma":[0.9993546,0.000112609625,0.00013950186,0.00024161753,0.00014487345,0.0000068228833],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039681376,0.00013607429,0.00024125705,0.0002115051,0.00017632233,0.00019211823,0.00022367467,0.000054667005,0.000028685987],"category_scores_gemma":[0.00014485398,0.00012258862,0.00011444909,0.0004193597,0.00004532334,0.00046467932,0.000054595195,0.000064633685,0.00011452128],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010975255,0.000054583354,0.00069519,0.00054381386,0.00022935335,0.0000059612066,0.000023375178,0.11829262,0.0005829211,0.8756024,0.002026192,0.0018338239],"study_design_scores_gemma":[0.003042304,0.000018762626,0.00030004157,0.00029797055,0.0005965626,0.000001880424,0.00045120888,0.7183355,0.00008021707,0.022564797,0.25379756,0.00051314814],"about_ca_topic_score_codex":0.00012939319,"about_ca_topic_score_gemma":0.000013786077,"teacher_disagreement_score":0.94135654,"about_ca_system_score_codex":0.000028527616,"about_ca_system_score_gemma":0.0000102873055,"threshold_uncertainty_score":0.4999019},"labels":[],"label_agreement":null},{"id":"W4408030425","doi":"10.2139/ssrn.5135291","title":"&lt;div&gt; Leveraging Data Contributors to Enhance&amp;nbsp;&lt;span&gt;Social Welfare Through Crowdsensing&lt;/span&gt;&lt;/div&gt;","year":2025,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo; York University","funders":"","keywords":"Span (engineering); Welfare; Psychology; Economics; Engineering; Structural engineering","score_opus":0.015316361306704331,"score_gpt":0.28110754481869116,"score_spread":0.26579118351198683,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408030425","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4580146,0.011608039,0.43441504,0.061280314,0.005392988,0.0020850943,0.00017489599,0.0016201115,0.025408905],"genre_scores_gemma":[0.9829843,0.000746143,0.00089674356,0.0034715012,0.0046327105,0.000025009973,0.00038198967,0.0002077672,0.0066538067],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9894471,0.00029324577,0.0016413125,0.0017557796,0.001355402,0.0055071535],"domain_scores_gemma":[0.9954505,0.00027326512,0.0013578205,0.0017179502,0.001076613,0.00012383558],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0050954535,0.0011458533,0.0015139101,0.001083205,0.003520455,0.0014213072,0.0027865863,0.0004255822,0.0005725258],"category_scores_gemma":[0.0018963614,0.0011755491,0.0006391844,0.0032241137,0.0002908021,0.0039135553,0.0017554251,0.002995506,0.0004857708],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0013772105,0.00063413254,0.0012460537,0.00031329892,0.004281543,0.00016478996,0.0008224853,0.0049275034,0.019309347,0.86081034,0.03530819,0.07080508],"study_design_scores_gemma":[0.0021252122,0.00006980631,0.00056155166,0.00035019335,0.0015310101,0.00009004749,0.0012210098,0.0021664961,0.00048116752,0.17063794,0.8190762,0.0016893634],"about_ca_topic_score_codex":0.00022377844,"about_ca_topic_score_gemma":0.0052834996,"teacher_disagreement_score":0.783768,"about_ca_system_score_codex":0.002340055,"about_ca_system_score_gemma":0.0012283174,"threshold_uncertainty_score":0.9996153},"labels":[],"label_agreement":null},{"id":"W4408472310","doi":"10.5206/mase/21096","title":"Single server Markovian queueing system with working vacation, impatient customers and disasters","year":2025,"lang":"en","type":"article","venue":"Mathematics in Applied Sciences and Engineering","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Queueing theory; Queueing system; Computer science; Markov process; Computer network; Markovian arrival process; Layered queueing network; Real-time computing; Mathematics; Statistics","score_opus":0.008578412117676845,"score_gpt":0.19279489745642855,"score_spread":0.1842164853387517,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408472310","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9544928,0.00007128182,0.027991457,0.000068187146,0.00006804771,0.00017670741,1.2100347e-7,0.000097897246,0.017033515],"genre_scores_gemma":[0.9947395,0.0000019258284,0.0051363744,0.000045813318,0.000026754595,0.000017684612,5.726675e-7,0.000009252788,0.000022173632],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99928725,0.0000020076386,0.00018928596,0.00020934531,0.0001241962,0.00018794187],"domain_scores_gemma":[0.99972785,0.0000682335,0.0000810689,0.00010079479,0.000012232378,0.000009842309],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00045416094,0.00012250135,0.00016350161,0.00032558685,0.00014953241,0.000235682,0.00011102392,0.000024614108,0.0000013727954],"category_scores_gemma":[0.000020363184,0.00010068409,0.000011916961,0.0008112638,0.0000679992,0.00021329774,0.000097922544,0.00006542256,0.0000011488079],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008048806,0.000026970321,0.0026393363,0.0013282482,0.00002262677,0.0000021511805,0.00064169685,0.26269677,0.0007390686,0.7288438,0.0000035985786,0.0030476677],"study_design_scores_gemma":[0.00027375403,0.0000057732304,0.00042309726,0.0010653944,0.000046297893,0.0000019918975,0.0078099403,0.98649085,0.000083950705,0.003179826,0.00035381646,0.00026531852],"about_ca_topic_score_codex":0.000017684131,"about_ca_topic_score_gemma":0.000030122757,"teacher_disagreement_score":0.725664,"about_ca_system_score_codex":0.00004410299,"about_ca_system_score_gemma":0.0000045858014,"threshold_uncertainty_score":0.4105778},"labels":[],"label_agreement":null},{"id":"W4408959698","doi":"10.5206/mase/21838","title":"ANFIS computing for $MAP/PH/1$ queueing system with server deterioration and recovery under vacation and backup server","year":2025,"lang":"en","type":"article","venue":"Mathematics in Applied Sciences and Engineering","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":true,"route_about_ca":false,"ca_institutions":"","funders":"","keywords":"Backup; Computer science; Adaptive neuro fuzzy inference system; Construct (python library); Service (business); Sensitivity (control systems); Queueing theory; Backup software; Real-time computing; Fuzzy logic; Operating system; Computer network; Fuzzy control system; Artificial intelligence; Engineering","score_opus":0.010744974830517553,"score_gpt":0.21379293723174042,"score_spread":0.20304796240122286,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4408959698","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7096784,0.00006022947,0.2895355,0.000059986356,0.000037861108,0.00017886663,2.1585015e-7,0.00004631134,0.00040262396],"genre_scores_gemma":[0.9711984,0.0000034365928,0.028662145,0.000056967685,0.000038733586,0.000015808253,0.0000015447649,0.000008793556,0.000014210926],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9993746,0.0000023109214,0.00018593196,0.00021352172,0.00008130635,0.00014228863],"domain_scores_gemma":[0.9996856,0.00012043291,0.000087845685,0.00007644809,0.000022380606,0.000007314856],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006792794,0.00011144781,0.0001653624,0.00020885674,0.0001841893,0.00029549628,0.00006440431,0.00003345547,7.5905353e-7],"category_scores_gemma":[0.000021622318,0.00009567976,0.000010770081,0.0003676875,0.000040457053,0.00036208116,0.00007495358,0.000048229347,4.4252334e-7],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000014009523,0.000013102012,0.0017376122,0.0036279347,0.000025213207,5.366414e-7,0.00025419833,0.19622612,0.002071366,0.7939294,0.0000035709372,0.0020969112],"study_design_scores_gemma":[0.00025407344,0.0000061411915,0.0011979623,0.0005172628,0.00003571288,0.0000012634197,0.0016752342,0.9805527,0.00006525742,0.015507732,0.000035524507,0.00015117473],"about_ca_topic_score_codex":0.00001574784,"about_ca_topic_score_gemma":0.000044513035,"teacher_disagreement_score":0.78432655,"about_ca_system_score_codex":0.00002636624,"about_ca_system_score_gemma":0.0000053987565,"threshold_uncertainty_score":0.39017075},"labels":[],"label_agreement":null},{"id":"W4409480004","doi":"10.1007/s41096-025-00232-0","title":"On the Heuristic Computational Procedures of the Virtual Waiting-Time Distribution in a Non-renewal Input Finite-Buffer Bulk-Service Queues: $$MAP/R^{(a,b)}/1/N$$","year":2025,"lang":"en","type":"article","venue":"Journal of the Indian Society for Probability and Statistics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Queue; Buffer (optical fiber); Computer science; Heuristic; Service (business); Mathematical optimization; Distributed computing; Algorithm; Mathematics; Computer network; Telecommunications","score_opus":0.008487481076767117,"score_gpt":0.2290189271330301,"score_spread":0.220531446056263,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4409480004","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9399069,0.0000352523,0.04729226,0.011359679,0.00025397158,0.00072961184,0.00037768806,0.000008973101,0.000035658297],"genre_scores_gemma":[0.99649495,0.0000028942509,0.0014458672,0.0018237603,0.00011654957,0.000012378476,0.000029384943,0.0000087880335,0.00006544464],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9987285,0.00006698424,0.00058375084,0.00014911006,0.000298647,0.00017299452],"domain_scores_gemma":[0.9964391,0.0020729145,0.00074298267,0.00019513674,0.00053856167,0.000011305827],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0013835939,0.00015007472,0.0002678435,0.000039892828,0.00045341076,0.00009620994,0.00042178857,0.0000762598,0.000010810955],"category_scores_gemma":[0.0037322582,0.00008354132,0.00025978222,0.0005554555,0.00029491883,0.00015296905,0.00015554388,0.00033496288,0.0000012296313],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0007156791,0.0006384968,0.007018088,0.002622947,0.00056079385,0.0000020374594,0.0028262835,0.33008522,0.000102810445,0.63887423,0.014479113,0.0020742887],"study_design_scores_gemma":[0.0006160545,0.000037327398,0.004387816,0.00047123103,0.00019825558,0.0000014949151,0.0005586172,0.16628662,0.000025433194,0.8270445,0.0002649966,0.00010768896],"about_ca_topic_score_codex":0.00004231027,"about_ca_topic_score_gemma":0.0001275398,"teacher_disagreement_score":0.18817021,"about_ca_system_score_codex":0.00011373071,"about_ca_system_score_gemma":0.00018489252,"threshold_uncertainty_score":0.44681314},"labels":[],"label_agreement":null},{"id":"W4410194343","doi":"10.1016/j.ejor.2025.04.040","title":"Computing the steady-state probabilities of the number of customers in the system of a tandem queueing system, a Machine Learning approach","year":2025,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Computer science; Queueing theory; Tandem; Queueing system; State (computer science); Steady state (chemistry); Artificial intelligence; Operations research; Mathematical optimization; Computer network; Mathematics; Algorithm","score_opus":0.03541767423282903,"score_gpt":0.3070689699914559,"score_spread":0.27165129575862684,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410194343","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9286865,0.00023192796,0.0032729125,0.00062436826,0.00008364442,0.0003898857,0.0000021642911,0.000007819022,0.066700764],"genre_scores_gemma":[0.99925077,0.0000041856943,0.00025417705,0.000035023197,0.00012704906,0.0000021902822,0.0000014221005,0.000013651321,0.0003115206],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.995428,0.002332073,0.00092420186,0.00012810282,0.0009973878,0.00019022387],"domain_scores_gemma":[0.9970674,0.00085127674,0.00066381326,0.0002359749,0.001174355,0.0000071944605],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.019780135,0.000103378756,0.00029198817,0.00031516267,0.0004025158,0.00012004736,0.00090771366,0.000014315999,0.000008318717],"category_scores_gemma":[0.0013558485,0.000051652645,0.00014721097,0.0013743188,0.00030718403,0.0002946796,0.00031295963,0.0006776699,0.000003237992],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022546001,0.00013175342,0.040364478,0.0019442354,0.00022940757,0.000018920593,0.0036078487,0.5941385,0.0010890005,0.35717502,0.000100191675,0.00097521185],"study_design_scores_gemma":[0.002763057,0.00010354144,0.034314223,0.008528129,0.00026903782,0.00012996359,0.12716737,0.82107514,0.00044591245,0.0020207819,0.0028324109,0.00035040654],"about_ca_topic_score_codex":0.000121956706,"about_ca_topic_score_gemma":0.000010881502,"teacher_disagreement_score":0.35515422,"about_ca_system_score_codex":0.00008811613,"about_ca_system_score_gemma":0.00012422926,"threshold_uncertainty_score":0.68554395},"labels":[],"label_agreement":null},{"id":"W4410316069","doi":"10.1287/msom.2021.0106","title":"Capacity Rationing in Multiserver, Nonpreemptive Priority Queues","year":2025,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Rationing; Queue; Computer science; Operations management; Priority queue; Business; Operations research; Economics; Computer network; Mathematics","score_opus":0.012449034263954445,"score_gpt":0.24042657909765167,"score_spread":0.22797754483369723,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410316069","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9471374,0.00003952091,0.013288748,0.0035934004,0.00038837423,0.0009248654,0.0000031299937,0.0003304819,0.034294043],"genre_scores_gemma":[0.98912674,0.0000139308,0.0041290415,0.0043874364,0.0001547983,0.0001864278,0.0000632057,0.000024724663,0.0019136671],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9982827,0.00003916152,0.00048463434,0.00058121484,0.00024122858,0.00037108405],"domain_scores_gemma":[0.99911207,0.000045882276,0.000107832144,0.00057613774,0.00014410936,0.000013998403],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00055046385,0.00029693192,0.00028651484,0.00079962576,0.00058509636,0.00056342466,0.0004755985,0.00006998541,0.0001890903],"category_scores_gemma":[0.00004650894,0.00031769156,0.000085011874,0.0010087591,0.00003505586,0.0019042675,0.0005422379,0.00024260535,0.00025530253],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00006538956,0.00035045532,0.005408728,0.00085449737,0.00025217616,0.000030062094,0.00041192715,0.7938666,0.0002484625,0.18762402,0.00024390341,0.010643814],"study_design_scores_gemma":[0.004772923,0.00001752398,0.2681211,0.0013005174,0.0008631606,0.0000015030369,0.0052026235,0.59579164,0.008119167,0.050972044,0.06267708,0.0021607245],"about_ca_topic_score_codex":0.004178996,"about_ca_topic_score_gemma":0.021761257,"teacher_disagreement_score":0.26271236,"about_ca_system_score_codex":0.00023690639,"about_ca_system_score_gemma":0.000013912355,"threshold_uncertainty_score":0.9999275},"labels":[],"label_agreement":null},{"id":"W4410835667","doi":"10.1108/case.kellogg.2025.000006","title":"CaLNG : Peak Shaving to Alleviate a Supply-Demand Bottleneck","year":2021,"lang":"en","type":"article","venue":"Kellogg School of Management Cases","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Kellogg's (Canada)","funders":"","keywords":"Bottleneck; Demand management; Business; Operations management; Industrial organization; On demand; Computer science; Marketing; Economics; Commerce","score_opus":0.014610711326666167,"score_gpt":0.24360717776570495,"score_spread":0.2289964664390388,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4410835667","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8958,0.0014468398,0.007946593,0.0028033904,0.00069079635,0.0008640022,0.000018777666,0.00046487746,0.089964755],"genre_scores_gemma":[0.98495084,0.000093581184,0.0028234606,0.0031140326,0.0004782349,0.00004927522,0.00005870497,0.000058456204,0.008373418],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99779737,0.000045588222,0.00056472205,0.0006522496,0.00044904987,0.00049100514],"domain_scores_gemma":[0.9985127,0.00012745234,0.00028750495,0.0007701078,0.0002432658,0.000058986476],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0005808119,0.00032162963,0.00047936884,0.0005174508,0.00022199149,0.00024143662,0.0004544809,0.000060332266,0.0028024726],"category_scores_gemma":[0.0006202854,0.00033441777,0.00024442165,0.0011043801,0.000053684304,0.0009011553,0.00092071673,0.00014945913,0.0011435398],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.001352595,0.0020316585,0.19901483,0.0082848985,0.0045555406,0.019291945,0.00037174538,0.14192444,0.015831703,0.32932776,0.21505317,0.06295972],"study_design_scores_gemma":[0.0055275885,0.00017090327,0.117185585,0.0030091114,0.0049371743,0.000110740184,0.0076338914,0.009741224,0.005704631,0.058777142,0.78292584,0.00427614],"about_ca_topic_score_codex":0.00014451775,"about_ca_topic_score_gemma":0.00021654894,"teacher_disagreement_score":0.5678727,"about_ca_system_score_codex":0.00006316616,"about_ca_system_score_gemma":0.00001726139,"threshold_uncertainty_score":0.9999108},"labels":[],"label_agreement":null},{"id":"W4411163553","doi":"10.1007/s40305-025-00603-1","title":"Customer Strategic Behavior in an N-Policy Vacation Queue with Variable Arrival and Service Rates","year":2025,"lang":"en","type":"article","venue":"Journal of the Operations Research Society of China","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"National Natural Science Foundation of China","keywords":"Queue; Variable (mathematics); Service (business); Business; Operations research; Computer science; Operations management; Marketing; Economics; Mathematics; Computer network","score_opus":0.03511535359564896,"score_gpt":0.3654889654685687,"score_spread":0.3303736118729197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4411163553","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9890732,0.000056641038,0.0010386573,0.008767994,0.000024997606,0.00018971942,0.0000013673547,0.000004686819,0.0008427111],"genre_scores_gemma":[0.9966124,0.000038329486,0.0023752986,0.00039507242,0.00017254827,0.0000101560845,0.0000033265067,0.000008086525,0.00038476317],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99901986,0.00010859229,0.0002824385,0.000106524676,0.0003284263,0.00015417741],"domain_scores_gemma":[0.99872684,0.000059398422,0.00011554019,0.0002017046,0.00088329427,0.0000132175],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017753615,0.00007916649,0.00016265469,0.0002926295,0.00038572738,0.0002407626,0.0003454557,0.000045044173,0.000027527463],"category_scores_gemma":[0.00013663752,0.00005136552,0.000057990022,0.0021333566,0.00013173337,0.0013596449,0.000113837516,0.00041461916,0.0000014541803],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00033724157,0.0009250031,0.031557336,0.00053401315,0.00027520795,0.0000035135986,0.001969195,0.5610871,0.056526974,0.3447192,0.00086514046,0.0012000753],"study_design_scores_gemma":[0.004379996,0.00021798722,0.17790148,0.0011048259,0.0005509721,0.000023903413,0.018710598,0.57100385,0.003086296,0.21949734,0.002973328,0.0005494229],"about_ca_topic_score_codex":0.001150933,"about_ca_topic_score_gemma":0.0006260805,"teacher_disagreement_score":0.14634414,"about_ca_system_score_codex":0.00008106564,"about_ca_system_score_gemma":0.00029710142,"threshold_uncertainty_score":0.29667422},"labels":[],"label_agreement":null},{"id":"W4412021126","doi":"10.1287/msom.2022.0098","title":"Waiting Time Prediction with Invisible Customers","year":2025,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Computer science; Business; Operations management; Marketing; Operations research; Economics; Mathematics","score_opus":0.005605925034478605,"score_gpt":0.20252293007023422,"score_spread":0.19691700503575563,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412021126","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6838122,0.00003712511,0.01230312,0.007792768,0.00035761052,0.0012548881,0.000006774496,0.0012142089,0.29322132],"genre_scores_gemma":[0.9787326,0.000007684952,0.0016586583,0.0075328643,0.00025851172,0.00016003141,0.00016467362,0.000043847067,0.011441169],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99853045,0.00001844681,0.00033312448,0.00050303456,0.0002689128,0.00034600816],"domain_scores_gemma":[0.99920154,0.00002399812,0.00009579511,0.0005339288,0.00012960135,0.000015111567],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00032096342,0.00027223155,0.00021554242,0.00073382276,0.0007654959,0.00062420976,0.00036966568,0.000047733884,0.0003556316],"category_scores_gemma":[0.000010619839,0.00024951206,0.000059638463,0.0010299458,0.00003083031,0.0016112996,0.00035605885,0.0001566572,0.00087376556],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000060207843,0.00011507884,0.0002764828,0.00053004664,0.00039681356,0.000018367311,0.0000635007,0.9353087,0.00022340835,0.05250275,0.0014501377,0.009054504],"study_design_scores_gemma":[0.0019848784,0.000021709779,0.0042795944,0.00069413387,0.0014087702,0.0000028242848,0.0022298435,0.76081693,0.0029713656,0.0046358965,0.21997818,0.000975897],"about_ca_topic_score_codex":0.00031314263,"about_ca_topic_score_gemma":0.00034628078,"teacher_disagreement_score":0.29492038,"about_ca_system_score_codex":0.00012229964,"about_ca_system_score_gemma":0.00001144141,"threshold_uncertainty_score":0.9999957},"labels":[],"label_agreement":null},{"id":"W4412044797","doi":"10.1002/nav.70000","title":"Mass and Niche Service Competition With Heterogeneous Customers and Waiting Line","year":2025,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Competition (biology); Niche; Business; Service (business); Marketing; Line (geometry); Advertising; Ecology; Biology","score_opus":0.054101143671753255,"score_gpt":0.33596552572956406,"score_spread":0.28186438205781084,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412044797","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8731648,0.0010872713,0.053091608,0.0072445404,0.00019510045,0.0009049352,0.000024429482,0.00036714214,0.063920215],"genre_scores_gemma":[0.9975365,0.00008209522,0.0008179745,0.000778091,0.00022015515,0.000016007076,0.000031952968,0.000021691616,0.0004955631],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9984904,0.00006847334,0.00020129059,0.00039557615,0.00041739093,0.00042688183],"domain_scores_gemma":[0.99843127,0.00053516135,0.00008369639,0.00024947943,0.00067005353,0.00003035274],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001318502,0.00015825375,0.00021765404,0.00043435732,0.00046881477,0.0003218335,0.00019961255,0.00007850299,0.00003047172],"category_scores_gemma":[0.0011458808,0.00013717843,0.000022872006,0.001068736,0.00033425848,0.0002487928,0.00035153577,0.00041785432,0.000035394325],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0012571905,0.00019397555,0.016738841,0.0026671505,0.0004058207,0.00038372754,0.00011602224,0.041015435,0.0091470005,0.90088004,0.00043622378,0.026758565],"study_design_scores_gemma":[0.0023508605,0.0001506165,0.001275362,0.0007685001,0.00039814095,0.000019295512,0.0017296068,0.74646306,0.0012264984,0.21191126,0.032911737,0.00079503894],"about_ca_topic_score_codex":0.00032530047,"about_ca_topic_score_gemma":0.000373599,"teacher_disagreement_score":0.7054476,"about_ca_system_score_codex":0.00005941208,"about_ca_system_score_gemma":0.00003568002,"threshold_uncertainty_score":0.5593974},"labels":[],"label_agreement":null},{"id":"W4412152873","doi":"10.1007/s13226-025-00814-5","title":"Computational Procedure for System Length and Waiting-time Distribution in an $$M^{X}/D/c/N$$ Queue","year":2025,"lang":"en","type":"article","venue":"Indian Journal of Pure and Applied Mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Queue; Computer science; Distribution (mathematics); Algorithm; Mathematics; Real-time computing; Computer network; Mathematical analysis","score_opus":0.007499026580425048,"score_gpt":0.23149784758598044,"score_spread":0.22399882100555538,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412152873","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.95644176,0.00007240332,0.04238178,0.00031457178,0.000033569133,0.0002761049,0.000009379646,0.000022211012,0.00044822675],"genre_scores_gemma":[0.9946472,0.0000016888032,0.0050121616,0.000105127794,0.0001759787,0.000009002506,0.000023251858,0.0000097759,0.000015836313],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99926937,0.0000049585815,0.0003904246,0.00010955589,0.00010371826,0.00012194791],"domain_scores_gemma":[0.9992876,0.00011577957,0.0003948753,0.00005884377,0.00012763425,0.000015236619],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005578045,0.000109872024,0.00027360342,0.00019702483,0.00011552874,0.00013498853,0.00009451436,0.000057060315,0.000002648603],"category_scores_gemma":[0.00008118262,0.000095083626,0.000034721543,0.00022648474,0.000038779788,0.000329125,0.000029034292,0.00011117771,0.0000015016253],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000092462564,0.00014880975,0.0004660081,0.0030071,0.00008536449,0.000016870526,0.0005684813,0.007959046,0.0003259268,0.9812779,0.0002903099,0.0057617277],"study_design_scores_gemma":[0.0023402474,0.000049586168,0.00045486254,0.0016261028,0.00040664276,0.00008546659,0.009873222,0.30073386,0.00019389634,0.68318284,0.0006605409,0.00039271388],"about_ca_topic_score_codex":5.0819517e-7,"about_ca_topic_score_gemma":0.0000046397236,"teacher_disagreement_score":0.29809502,"about_ca_system_score_codex":0.000030505078,"about_ca_system_score_gemma":0.000026832335,"threshold_uncertainty_score":0.38773978},"labels":[],"label_agreement":null},{"id":"W4412701717","doi":"10.1016/j.spa.2025.104743","title":"Multidimensional sticky Brownian motions: Heavy traffic limit and rough tail asymptotics","year":2025,"lang":"en","type":"article","venue":"Stochastic Processes and their Applications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Carleton University","funders":"Natural Sciences and Engineering Research Council of Canada; Natural Science Foundation of Shandong Province","keywords":"Mathematics; Brownian motion; Limit (mathematics); Statistical physics; Heavy-tailed distribution; Fractional Brownian motion; Mathematical analysis; Statistics; Distribution (mathematics); Physics","score_opus":0.009465917260292491,"score_gpt":0.22795974225143187,"score_spread":0.21849382499113937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412701717","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.022176923,0.0012545276,0.9731822,0.0016819247,0.000041577812,0.00049632805,0.000015855436,0.00019535796,0.0009553072],"genre_scores_gemma":[0.9969863,0.00002186515,0.0015223174,0.00068023684,0.00017544146,0.00026190974,0.00004537589,0.00001871879,0.00028777844],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99908185,0.0000058097758,0.00023428102,0.00038302454,0.00008701461,0.00020800138],"domain_scores_gemma":[0.9991473,0.0002264526,0.0001206123,0.0002300718,0.00025247413,0.000023122719],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00013269151,0.00020091559,0.0002094544,0.00020392089,0.00059474347,0.000136181,0.00013654467,0.00005896768,0.000018630852],"category_scores_gemma":[0.00023836417,0.00017302744,0.00003553246,0.00082236395,0.00018676942,0.00035681325,0.00014230947,0.00012001955,0.000023710394],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000048256858,0.00033433278,0.000055478933,0.0008736601,0.0001764474,5.590178e-7,0.00019861168,0.020439014,0.0002524894,0.93282527,0.00017725272,0.044618607],"study_design_scores_gemma":[0.0013309964,0.00003020771,0.0005310198,0.00047287197,0.00073072384,0.000009702465,0.0023512326,0.29546878,0.00007216932,0.67919475,0.018926319,0.0008812436],"about_ca_topic_score_codex":0.000014179793,"about_ca_topic_score_gemma":0.000039506886,"teacher_disagreement_score":0.9748094,"about_ca_system_score_codex":0.00001609981,"about_ca_system_score_gemma":0.000049104554,"threshold_uncertainty_score":0.7055854},"labels":[],"label_agreement":null},{"id":"W4412844959","doi":"10.37256/cm.6420255958","title":"On the Queueing Time Analysis for State-Dependent Fixed-Cycle Traffic Light Queues","year":2025,"lang":"en","type":"article","venue":"Contemporary Mathematics","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"Natural Sciences and Engineering Research Council of Canada; Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Queueing theory; Mathematics; Queue; State dependent; Layered queueing network; Mean value analysis; State (computer science); Computer network; Statistics; Computer science; Algorithm; Mathematical economics","score_opus":0.017488072285591832,"score_gpt":0.24420918005708153,"score_spread":0.2267211077714897,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4412844959","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6792209,0.00085628044,0.15234451,0.01369732,0.00051219406,0.0030011563,0.00004920495,0.001388423,0.14892997],"genre_scores_gemma":[0.9857787,0.0000031959112,0.0004585577,0.0018410808,0.00013062876,0.00011333494,0.00003815689,0.000043548527,0.011592819],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99843675,0.000040178365,0.000600932,0.00037830533,0.00026150592,0.00028230768],"domain_scores_gemma":[0.9975037,0.0011293982,0.00045423437,0.00072061154,0.00017762423,0.000014434505],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0012206021,0.00029327782,0.0005717577,0.0005863453,0.00039891456,0.00033391887,0.000537242,0.00006953713,0.00017365495],"category_scores_gemma":[0.00074810296,0.00020972513,0.0004063703,0.0013101777,0.0000619273,0.00054089737,0.00014444088,0.00015676391,0.00024189803],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00030004722,0.0009126829,0.00034688765,0.0011751786,0.0052768476,0.00002954653,0.0010072087,0.13405034,0.0008235026,0.8098608,0.043713104,0.0025038093],"study_design_scores_gemma":[0.00059064943,0.000018910423,0.000022687682,0.00026870758,0.0013213457,3.110863e-7,0.000941951,0.62380385,0.0006220746,0.35623494,0.015702281,0.000472319],"about_ca_topic_score_codex":0.00001855368,"about_ca_topic_score_gemma":0.000036202746,"teacher_disagreement_score":0.48975348,"about_ca_system_score_codex":0.00004966815,"about_ca_system_score_gemma":0.00003923452,"threshold_uncertainty_score":0.8552342},"labels":[],"label_agreement":null},{"id":"W4413215598","doi":"10.1007/s10479-025-06765-8","title":"A simple derivation of the waiting-time distribution (in the queue) for the bulk-service $$M/G^{(a,b)}/1$$ queueing system","year":2025,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"","keywords":"Simple (philosophy); Theory of computation; Queueing theory; Queueing system; Queue; Computer science; Service (business); Bulk queue; Distribution (mathematics); Mathematical optimization; Mathematics; Discrete mathematics; Applied mathematics; Computer network; Algorithm; Mathematical analysis; Business","score_opus":0.09808665355295156,"score_gpt":0.3930079840448452,"score_spread":0.2949213304918937,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413215598","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.926663,0.00024240604,0.014224377,0.05448891,0.00007574547,0.0019984897,0.000042337222,0.000035306777,0.0022294712],"genre_scores_gemma":[0.9986864,0.000009086888,0.000022914277,0.0006444259,0.00012404953,0.00021611576,0.0000715385,0.000008280819,0.00021723458],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9985855,0.00020120278,0.00040486472,0.0001725392,0.00039228456,0.0002435702],"domain_scores_gemma":[0.99671113,0.001076289,0.00010027401,0.0005247617,0.0015835162,0.000004004338],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004691442,0.00008712805,0.00015392624,0.00018915893,0.00094085914,0.00019561914,0.0007455701,0.000044771707,0.000019415324],"category_scores_gemma":[0.0021579918,0.000048665275,0.00010362504,0.002622853,0.0001215136,0.0004341027,0.00020173809,0.00018442463,0.000010670517],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0000828427,0.0001079387,0.00067227025,0.000516721,0.00008629849,3.6461054e-7,0.00033336875,0.15413633,0.005540307,0.8329669,0.0038110414,0.0017455952],"study_design_scores_gemma":[0.0002637016,0.0000114141485,0.0039757434,0.00032287062,0.00005576534,3.3938818e-7,0.004653301,0.96646285,0.0044896286,0.0099763945,0.009696759,0.00009123968],"about_ca_topic_score_codex":0.002740461,"about_ca_topic_score_gemma":0.001320097,"teacher_disagreement_score":0.82299054,"about_ca_system_score_codex":0.00003227543,"about_ca_system_score_gemma":0.00007612196,"threshold_uncertainty_score":0.7236423},"labels":[],"label_agreement":null},{"id":"W4413359437","doi":"10.1109/ton.2025.3598595","title":"On Optimal Server Allocation for a Loss System With Moldable Jobs","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Computer network","score_opus":0.011240384405235103,"score_gpt":0.22570254753453708,"score_spread":0.21446216312930197,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413359437","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.034476433,0.000022659095,0.961657,0.00023862485,0.00069123704,0.0003725961,0.0000017355208,0.00028476925,0.0022549755],"genre_scores_gemma":[0.9966917,0.000003272388,0.00092210126,0.00069759734,0.00039196457,0.00017390463,0.000007299434,0.000034773442,0.0010773821],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9990035,0.000014872267,0.00021572705,0.00033559155,0.00015314504,0.00027713113],"domain_scores_gemma":[0.99929017,0.00016420822,0.00012705353,0.0002929512,0.00011579945,0.000009819234],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00028136082,0.00019011648,0.00020777057,0.00029885798,0.00051249133,0.00015068651,0.00015876669,0.0000680772,0.000020387033],"category_scores_gemma":[0.000003674552,0.00017319448,0.000117029536,0.0008189544,0.00003093526,0.0004349926,0.0000017667662,0.00015441785,0.000034864035],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00045069962,0.000064626576,0.000029768018,0.00017429671,0.00014060634,0.000004056063,0.000013646955,0.9632309,0.000025601745,0.029616399,0.00014860916,0.006100796],"study_design_scores_gemma":[0.0013650876,0.000051387633,0.00002414242,0.0013960942,0.0005582553,0.000002581462,0.00026509113,0.98419666,0.0006485488,0.002093056,0.009001385,0.00039772308],"about_ca_topic_score_codex":0.000060818755,"about_ca_topic_score_gemma":0.00014127034,"teacher_disagreement_score":0.96221524,"about_ca_system_score_codex":0.0001270429,"about_ca_system_score_gemma":0.00001696803,"threshold_uncertainty_score":0.7062666},"labels":[],"label_agreement":null},{"id":"W4413958062","doi":"10.1177/10591478251378840","title":"On Value-at-Risk Based Queueing Systems","year":2025,"lang":"en","type":"article","venue":"Production and Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"National Natural Science Foundation of China","keywords":"Queueing theory; Value (mathematics); Computer science; Queueing system; Operations management; Risk analysis (engineering); Business; Operations research; Economics; Computer network; Mathematics","score_opus":0.00750099866782703,"score_gpt":0.22801684821384136,"score_spread":0.22051584954601433,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4413958062","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.4511049,0.00092773687,0.2581114,0.02382258,0.0059671444,0.0036586947,0.0000068205254,0.0014038376,0.25499687],"genre_scores_gemma":[0.978485,0.00004362813,0.0007274822,0.0016792212,0.0002778515,0.00013317037,0.000022209877,0.000013422262,0.01861804],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99906707,0.000032950218,0.00021265782,0.000406482,0.00014240401,0.0001384668],"domain_scores_gemma":[0.99948275,0.000019816636,0.00006868236,0.00033610154,0.00008518785,0.0000074657714],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00050251826,0.00013482214,0.00012388972,0.00051327003,0.00083141384,0.00030492313,0.000092587085,0.000024834859,0.000064165186],"category_scores_gemma":[0.00017929878,0.0001260078,0.000038925904,0.00062060787,0.00003717581,0.0004397899,0.00010965083,0.00007933219,0.00013176768],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000025120016,0.000051574767,0.00040679422,0.000119616736,0.000055017757,0.0000010927835,0.000007996465,0.4655346,0.00003594552,0.5289311,0.0025513922,0.002279748],"study_design_scores_gemma":[0.0007878601,0.00001637707,0.0022740008,0.00035567547,0.0006731152,7.409739e-7,0.00066259515,0.7809059,0.00025554304,0.015060316,0.19851506,0.00049280474],"about_ca_topic_score_codex":0.00012550682,"about_ca_topic_score_gemma":0.00008556451,"teacher_disagreement_score":0.52738005,"about_ca_system_score_codex":0.00008091699,"about_ca_system_score_gemma":0.0000048292454,"threshold_uncertainty_score":0.63946474},"labels":[],"label_agreement":null},{"id":"W4414404930","doi":"10.1109/ton.2025.3605104","title":"Learning to Balance Utility and Delay in Bipartite Queueing Networks With Sample Path Constraints","year":2025,"lang":"en","type":"article","venue":"IEEE Transactions on Networking","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Queueing theory; Layered queueing network; Routing (electronic design automation); Bipartite graph; Regret; Quality of service; Path (computing); Constraint (computer-aided design); Range (aeronautics)","score_opus":0.009794529342139794,"score_gpt":0.2280464038434332,"score_spread":0.2182518745012934,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4414404930","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.15049423,0.000066649045,0.8473862,0.00016048054,0.00026155208,0.00019557535,9.3245524e-7,0.00014853559,0.001285835],"genre_scores_gemma":[0.9973908,0.000031866006,0.0012780699,0.0010172271,0.00016742952,0.0000383842,0.0000028848876,0.000022340057,0.00005100428],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9987349,0.00004639369,0.00027483844,0.00042789374,0.00012048279,0.00039547574],"domain_scores_gemma":[0.9992887,0.00033799108,0.00009862062,0.0002006636,0.000051991035,0.000022080027],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005189681,0.00020613626,0.00026813458,0.00033662442,0.00039942993,0.00015809646,0.00011947768,0.000070297065,0.000053115404],"category_scores_gemma":[0.000021827524,0.00020448709,0.000050648287,0.0014584933,0.00010018275,0.00038345947,0.0000065283484,0.00043897727,0.000006436523],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017944316,0.000038115544,0.02029241,0.00003230699,0.000047162415,0.000011969915,0.00008119812,0.8757799,0.000030105966,0.0005134328,0.00001596905,0.102977976],"study_design_scores_gemma":[0.00063099514,0.000021988504,0.0013449036,0.000896856,0.00010878847,0.0000020696373,0.0003892775,0.9895434,0.000052648655,0.0010223164,0.00564259,0.00034418408],"about_ca_topic_score_codex":0.00024931759,"about_ca_topic_score_gemma":0.001358701,"teacher_disagreement_score":0.8468966,"about_ca_system_score_codex":0.00005030633,"about_ca_system_score_gemma":0.000014538065,"threshold_uncertainty_score":0.83387417},"labels":[],"label_agreement":null},{"id":"W4415220068","doi":"10.1287/msom.2024.1515","title":"Queueing Causal Models: Comparative Analytics in Queueing Systems","year":2025,"lang":"en","type":"article","venue":"Manufacturing & Service Operations Management","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University; University of Toronto","funders":"","keywords":"Queueing theory; Layered queueing network; Analytics; Process (computing); Mean value analysis; Service (business); G-network","score_opus":0.029905006430627813,"score_gpt":0.2654199904302128,"score_spread":0.23551498399958498,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415220068","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6715669,0.00033291258,0.14369325,0.0031616862,0.0009710625,0.0019303027,0.0000056827307,0.0006788031,0.17765936],"genre_scores_gemma":[0.9930449,0.000021253687,0.0010491336,0.002606939,0.00018568801,0.00017947279,0.000065912835,0.000032991014,0.0028137106],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997781,0.000057818743,0.0007017518,0.0006547734,0.000315204,0.00048946054],"domain_scores_gemma":[0.9989413,0.000060604743,0.00014988446,0.00066642225,0.00016220186,0.000019602743],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005993828,0.0003865418,0.0004791603,0.0013390447,0.00053698046,0.0009628877,0.0005765564,0.00007803824,0.000059115224],"category_scores_gemma":[0.0000122289675,0.00040334865,0.00009032767,0.0014550871,0.000033288863,0.0020933768,0.00059401704,0.00027770165,0.0001685414],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000019235616,0.00007834731,0.00017951691,0.00041157007,0.00015848316,0.000023545428,0.00019549971,0.7804316,0.000020673442,0.21793795,0.00014361407,0.00039994053],"study_design_scores_gemma":[0.0006346298,0.0000032940407,0.0011237722,0.00046085613,0.00027564718,5.996461e-7,0.004439617,0.9741198,0.00017107418,0.009833093,0.008485292,0.00045231608],"about_ca_topic_score_codex":0.005492118,"about_ca_topic_score_gemma":0.009638325,"teacher_disagreement_score":0.32147798,"about_ca_system_score_codex":0.00030981432,"about_ca_system_score_gemma":0.00002047596,"threshold_uncertainty_score":0.9998418},"labels":[],"label_agreement":null},{"id":"W4415594107","doi":"10.1109/tsmc.2025.3621549","title":"Congestion-Based Repair Policy for a Failure-Prone Service System With Strategic Customers","year":2025,"lang":"","type":"article","venue":"IEEE Transactions on Systems Man and Cybernetics Systems","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"China Scholarship Council; Natural Sciences and Engineering Research Council of Canada; National Natural Science Foundation of China","keywords":"Unobservable; Stackelberg competition; Service provider; Profit (economics); Service (business); Complete information","score_opus":0.013912227050435117,"score_gpt":0.23286536373413436,"score_spread":0.21895313668369923,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415594107","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.037738264,0.004080505,0.9141324,0.002769055,0.0069550904,0.012228848,0.0004941374,0.0022847748,0.019316915],"genre_scores_gemma":[0.988103,0.000035098226,0.00012888011,0.00042482087,0.0007884119,0.0013797515,0.000036528116,0.00017719694,0.008926368],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9946354,0.0003242757,0.0017358612,0.00151688,0.0007539193,0.0010336858],"domain_scores_gemma":[0.9953168,0.00055442227,0.0012145386,0.0012856267,0.0014733538,0.00015527454],"candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0013947107,0.0011420739,0.0016689753,0.0020263584,0.0013276485,0.0015481878,0.0005241694,0.000506322,0.000011662869],"category_scores_gemma":[0.00002016599,0.001075383,0.00043840602,0.0031865544,0.00029140853,0.00062808377,0.000008609765,0.00057445874,0.00011369596],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010466361,0.0003601863,0.000057356727,0.030299107,0.0018805512,0.000031577893,0.00013060555,0.8102341,0.00015244837,0.15522064,0.00025126935,0.0003354909],"study_design_scores_gemma":[0.0048798043,0.00029388888,0.00001867974,0.011698026,0.0036029436,0.00004456699,0.020971535,0.9431632,0.00006852516,0.00011241878,0.013726295,0.0014201005],"about_ca_topic_score_codex":0.0076806545,"about_ca_topic_score_gemma":0.0017301564,"teacher_disagreement_score":0.9503647,"about_ca_system_score_codex":0.000730649,"about_ca_system_score_gemma":0.00056200003,"threshold_uncertainty_score":0.99997246},"labels":[],"label_agreement":null},{"id":"W4415974330","doi":"10.1016/j.procs.2025.10.037","title":"Proof and Application of Little’s Formula in Optimizing Bulk-service Multi-server Queue Systems","year":2025,"lang":"en","type":"article","venue":"Procedia Computer Science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Royal Military College of Canada","funders":"Canadian Defence Academy","keywords":"Queue; Queueing theory; Bulk queue; Function (biology); Queueing system; Server; Service (business)","score_opus":0.010898476986794558,"score_gpt":0.24509230139954669,"score_spread":0.23419382441275213,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4415974330","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.24014302,0.00017342666,0.7582787,0.00032069185,0.000201049,0.00046361948,3.41053e-7,0.000069099646,0.00035000418],"genre_scores_gemma":[0.9823163,0.0000027780195,0.017135771,0.00036997374,0.00009887381,0.000048629292,0.0000018285084,0.000006162466,0.000019688325],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99890596,0.00000625785,0.0002829252,0.00040356375,0.00018892533,0.00021239668],"domain_scores_gemma":[0.9991583,0.000046052093,0.0001898151,0.00025045042,0.0003441821,0.000011197708],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00082630425,0.000112980226,0.00018850403,0.0004873752,0.00012459885,0.00017868758,0.0004693174,0.00003311174,7.109563e-7],"category_scores_gemma":[0.000084789885,0.00010630932,0.000020254201,0.0024449083,0.00011839158,0.0014018657,0.00043484668,0.00007664565,0.0000047424805],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000073614116,0.0003998902,0.06250055,0.0054457486,0.0000400114,0.0000052067653,0.0012458628,0.51191354,0.011283302,0.3418389,0.000041532483,0.06521187],"study_design_scores_gemma":[0.00025562578,0.0000029669754,0.0032712887,0.00016856982,0.000012890233,7.886215e-7,0.000054040764,0.9931544,0.00047251655,0.0022452266,0.000251146,0.00011055922],"about_ca_topic_score_codex":0.00032228834,"about_ca_topic_score_gemma":0.00010160351,"teacher_disagreement_score":0.74217325,"about_ca_system_score_codex":0.000039645132,"about_ca_system_score_gemma":0.000046405064,"threshold_uncertainty_score":0.43351683},"labels":[],"label_agreement":null},{"id":"W4416785951","doi":"10.3390/axioms14120868","title":"On a Queuing Model with Customers Arriving According to a Diffusion Process","year":2025,"lang":"en","type":"article","venue":"Axioms","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Polytechnique Montréal","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Diffusion process; Queueing theory; Diffusion; Function (biology); Queue management system; Process (computing); Homing (biology); Arrival time; Heavy traffic approximation","score_opus":0.007133639583557045,"score_gpt":0.24953522896931957,"score_spread":0.24240158938576253,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416785951","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.7886174,0.0000081093585,0.19101648,0.0006420309,0.00007858336,0.00020432066,3.93602e-7,0.00023146792,0.019201241],"genre_scores_gemma":[0.9948592,7.4033784e-7,0.00025356901,0.0037429566,0.00011570302,0.00005076342,0.0000039735596,0.000032541695,0.00094052724],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99883604,0.000007320411,0.00018577334,0.00041499725,0.00023169347,0.00032414752],"domain_scores_gemma":[0.9993824,0.000068640045,0.000118328346,0.00030114915,0.00011237258,0.000017113276],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002448963,0.00020733837,0.00023067604,0.0006826368,0.00031195584,0.00018254264,0.00028586615,0.000044192213,0.000018505309],"category_scores_gemma":[0.00024345126,0.00017217573,0.000061012597,0.0016068248,0.000030515484,0.0007041239,0.00015967272,0.00014988525,0.00009867344],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00032935798,0.00008772975,0.00131903,0.00020558469,0.000076280456,0.000014676754,0.0002990112,0.7359551,0.0026746676,0.24348754,0.00010845202,0.015442552],"study_design_scores_gemma":[0.0006618864,0.000020798572,0.00021458945,0.0010923153,0.00018426402,7.779382e-7,0.0026971342,0.9607482,0.0004565801,0.032825068,0.00056068867,0.0005377206],"about_ca_topic_score_codex":0.00007741542,"about_ca_topic_score_gemma":0.0000558456,"teacher_disagreement_score":0.22479305,"about_ca_system_score_codex":0.000067211135,"about_ca_system_score_gemma":0.00002167694,"threshold_uncertainty_score":0.70211226},"labels":[],"label_agreement":null},{"id":"W4416817025","doi":"10.2139/ssrn.5805802","title":"When Strategic Customers Meet Strategic Servers: Individual and Social Optimization in Many-Server Queueing Systems","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Queueing theory; Strategic planning; Government (linguistics); Process (computing); Key (lock)","score_opus":0.02155865138246879,"score_gpt":0.24827417572292731,"score_spread":0.22671552434045852,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4416817025","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.903296,0.035066523,0.027448073,0.0039383895,0.004297067,0.0033955884,0.00008284045,0.0004486085,0.022026906],"genre_scores_gemma":[0.9890976,0.0063871313,0.00015718017,0.0002610653,0.0019001839,0.00004801454,0.00021796249,0.00012046166,0.0018104056],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99009913,0.0006692286,0.0021996638,0.0014585722,0.0011534775,0.0044199238],"domain_scores_gemma":[0.9956778,0.00014177946,0.0029727241,0.0005088031,0.00062978483,0.00006906932],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":["metaepi_narrow"],"category_scores_codex":[0.009627775,0.0012781195,0.0017139701,0.0024702807,0.001306908,0.0033564493,0.001516035,0.0010276989,0.00017064948],"category_scores_gemma":[0.00008103128,0.001408534,0.00056101795,0.0014882605,0.00024159503,0.0032477085,0.0011667395,0.0073885783,0.000023170502],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00022912714,0.00012707284,0.0007904889,0.00092709175,0.0015103832,0.000032194774,0.0003751867,0.4711305,0.0000053570516,0.5242636,0.000012322234,0.000596666],"study_design_scores_gemma":[0.0029303622,0.000076368044,0.00009141348,0.0013884531,0.0025545037,0.000068441885,0.060207095,0.25876445,8.666865e-7,0.6720446,0.00025121743,0.0016222388],"about_ca_topic_score_codex":0.0023841371,"about_ca_topic_score_gemma":0.005795644,"teacher_disagreement_score":0.21236606,"about_ca_system_score_codex":0.003132601,"about_ca_system_score_gemma":0.0038828496,"threshold_uncertainty_score":0.9999971},"labels":[],"label_agreement":null},{"id":"W4417518279","doi":"10.2139/ssrn.5942316","title":"From Frustration to Engagement: Ancillary Services in Queues","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University; University of Toronto","funders":"","keywords":"Queue; Service (business); Queueing theory; Profit (economics); Service provider; Value (mathematics); Social Welfare; Service level","score_opus":0.009734260260650645,"score_gpt":0.2550020032379071,"score_spread":0.24526774297725648,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W4417518279","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.93549067,0.015251546,0.02666177,0.009228785,0.0029427817,0.0015697964,0.00005176763,0.00022660432,0.008576256],"genre_scores_gemma":[0.9775892,0.009517895,0.00047445964,0.0022380177,0.0055514155,0.000064465516,0.0002656782,0.00008696103,0.0042119124],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99155736,0.00034099835,0.0017826344,0.0013885082,0.00085243396,0.0040780487],"domain_scores_gemma":[0.99667954,0.00021940868,0.0015425824,0.00091490784,0.0005770935,0.000066472174],"candidate_categories":["metaepi_narrow","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0078032473,0.0009948845,0.0011664749,0.002088314,0.0007854285,0.0012976619,0.0019279849,0.00053940766,0.0004676816],"category_scores_gemma":[0.00035129258,0.0011012033,0.0005354386,0.0019005768,0.000056466877,0.002246836,0.0015767121,0.008665226,0.00038648664],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0022820372,0.0011594665,0.018059133,0.0019706152,0.0057766926,0.00015315294,0.0039360514,0.22813745,0.0010200554,0.51412433,0.0004415847,0.2229394],"study_design_scores_gemma":[0.0010621118,0.000049792092,0.00068780384,0.0021329655,0.00096435816,0.000006195881,0.014306249,0.009418271,0.00006087195,0.945619,0.024595363,0.0010970482],"about_ca_topic_score_codex":0.005681845,"about_ca_topic_score_gemma":0.041594036,"teacher_disagreement_score":0.4314946,"about_ca_system_score_codex":0.0033946158,"about_ca_system_score_gemma":0.0023667358,"threshold_uncertainty_score":0.9997391},"labels":[],"label_agreement":null},{"id":"W68254656","doi":"10.1007/978-3-319-04645-7_3","title":"Service Response Time of Elastic Data Traffic","year":2014,"lang":"en","type":"book-chapter","venue":"SpringerBriefs in computer science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Service (business); Business","score_opus":0.023610613952855863,"score_gpt":0.23847538616223157,"score_spread":0.21486477220937572,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68254656","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.13344707,0.0004873477,0.698687,0.0030116886,0.0051609464,0.0019278396,0.00007731001,0.0013911194,0.15580966],"genre_scores_gemma":[0.89413196,0.000036790174,0.04924883,0.008709638,0.0068827933,0.00001624955,0.00019170751,0.00047558275,0.04030648],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9970559,0.000020524834,0.0006113485,0.0011767619,0.00072088954,0.0004146096],"domain_scores_gemma":[0.99636346,0.00036845947,0.000649274,0.0022689225,0.00032225024,0.000027658964],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0037268214,0.0003704651,0.00059456815,0.001156098,0.00015012108,0.0002232258,0.0037494176,0.00012942466,0.00024340123],"category_scores_gemma":[0.0003131455,0.0003850769,0.00008071363,0.00080917863,0.0005699808,0.0011173732,0.0032824879,0.0003428973,0.0007693688],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0010086626,0.00016904615,0.00009565867,0.001531915,0.00016870891,0.00020559302,0.00030770956,0.40278426,0.0016842365,0.38988703,0.0012443406,0.20091283],"study_design_scores_gemma":[0.0002984351,0.000020468038,0.00018341346,0.00076602655,0.00009464794,0.0000048423353,0.0000023340542,0.92132074,0.000018342489,0.0093221925,0.06732614,0.0006424356],"about_ca_topic_score_codex":0.000029388439,"about_ca_topic_score_gemma":0.00006387799,"teacher_disagreement_score":0.76068485,"about_ca_system_score_codex":0.000086131105,"about_ca_system_score_gemma":0.00013790165,"threshold_uncertainty_score":0.9998601},"labels":[],"label_agreement":null},{"id":"W68883291","doi":"10.1007/978-1-4615-0373-6_3","title":"The Evolution of Manufacturing System Models: A Personal View","year":2003,"lang":"en","type":"book-chapter","venue":"International series in management science/operations research/International series in operations research & management science","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":4,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"York University","funders":"","keywords":"Perspective (graphical); Wright; Randomness; Focus (optics); Management science; Computer science; Engineering; Systems engineering; Artificial intelligence; Mathematics","score_opus":0.05132690055526137,"score_gpt":0.35169300953328514,"score_spread":0.30036610897802374,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W68883291","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0032812173,0.0003161763,0.00284807,0.00896069,0.0025461554,0.0032927066,0.00006233935,0.00012876355,0.9785639],"genre_scores_gemma":[0.67352766,0.0036379367,0.004441363,0.0001972823,0.0006305346,0.0015210982,0.0001650937,0.0001263151,0.31575269],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.98344696,0.00023574177,0.001884645,0.002247289,0.010447538,0.0017378344],"domain_scores_gemma":[0.993719,0.00024641346,0.00025044565,0.001574803,0.0040903217,0.0001190363],"candidate_categories":["metaepi_narrow","bibliometrics","sts","scholarly_communication","open_science"],"consensus_categories":["sts"],"category_scores_codex":[0.023721358,0.0006583795,0.0005598087,0.012232448,0.005186838,0.0049352385,0.008164429,0.00017635067,0.00072107324],"category_scores_gemma":[0.0009996061,0.0005968048,0.00022403452,0.005068893,0.0096243555,0.013043712,0.0054383567,0.0015442164,0.00032911476],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00015642859,0.00012538434,0.000034800294,0.00017690202,0.00012298154,0.00008545218,0.0001879974,0.18707609,0.00009498323,0.80939656,0.00040914834,0.0021332426],"study_design_scores_gemma":[0.0013768045,0.000101171274,0.00066645845,0.0024929119,0.00007470297,0.000041772466,0.025003267,0.46588546,0.00027192134,0.20597324,0.29671326,0.0013990456],"about_ca_topic_score_codex":0.0014415336,"about_ca_topic_score_gemma":0.0073082554,"teacher_disagreement_score":0.6702465,"about_ca_system_score_codex":0.008499569,"about_ca_system_score_gemma":0.0005257209,"threshold_uncertainty_score":0.99964833},"labels":[],"label_agreement":null},{"id":"W6888938431","doi":"10.25316/ir-18794","title":"The Flagstone V.14:No.2 [February 2009]","year":2009,"lang":"en","type":"other","venue":"VIURRSpace (Vancouver Island University)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Miller; The arts; Performance art; Table (database); Style (visual arts)","score_opus":0.005736019625303345,"score_gpt":0.1864205068747637,"score_spread":0.18068448724946035,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6888938431","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000004452429,0.0006957743,0.0011604932,0.00037921514,0.0016528767,0.00029578008,0.00002308713,0.00060556445,0.99518275],"genre_scores_gemma":[0.00023900117,0.00065046694,0.00015277337,0.0006174033,0.002287482,0.0000010816029,0.00000701952,0.00028169336,0.99576306],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99814355,0.00004647037,0.00017556972,0.00063513126,0.00040498198,0.00059428316],"domain_scores_gemma":[0.9982381,0.00009147891,0.0005677471,0.00087528455,0.00019198866,0.000035443325],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00022571864,0.0005474287,0.0005131184,0.0010140724,0.000563241,0.00018676434,0.0009365634,0.00034528013,0.0016018688],"category_scores_gemma":[0.00011209971,0.0004556049,0.0003033169,0.0012963908,0.000217279,0.0005695536,0.00030120814,0.00047229775,0.002260008],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00009585652,0.000042919317,0.000005748094,0.00004929662,0.00018035171,0.00014754798,0.000009699923,0.00013907385,0.000006430808,0.008332687,0.9882483,0.002742108],"study_design_scores_gemma":[0.00067750516,0.000013281262,0.0000059881263,0.00015351624,0.00037322214,7.9808524e-7,0.00022568203,0.00023941268,0.0000019739168,0.0013415237,0.9963671,0.0006000278],"about_ca_topic_score_codex":0.0010251994,"about_ca_topic_score_gemma":0.0047036945,"teacher_disagreement_score":0.00811879,"about_ca_system_score_codex":0.00011948725,"about_ca_system_score_gemma":0.00005024146,"threshold_uncertainty_score":0.9997896},"labels":[],"label_agreement":null},{"id":"W6889669060","doi":"10.26021/2023","title":"MODELLING OF SELF-SIMILAR TELETRAFFIC FOR SIMULATION","year":2002,"lang":"en","type":"dissertation","venue":"University of Canterbury Research Repository (University of Canterbury)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Konyang University; Chungnam National University; McMaster University; West Virginia University; University of Canterbury","keywords":"Nucleofection; Filter (signal processing); Noise (video); Term (time); Frame (networking); Gestational period","score_opus":0.0398046456592544,"score_gpt":0.25414175256043176,"score_spread":0.21433710690117735,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6889669060","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.94857985,0.00049460254,0.029542543,0.00007604442,0.0004092013,0.0011141679,0.00008294889,0.00016285575,0.019537792],"genre_scores_gemma":[0.98091286,0.00022210968,0.0017687663,0.000005360032,0.00015739338,2.557303e-7,0.00019913338,0.00005519058,0.016678935],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.997198,0.00013017618,0.00043549496,0.00068251946,0.0010470873,0.0005067469],"domain_scores_gemma":[0.9949025,0.00038771346,0.0012750874,0.0006630757,0.0027130286,0.00005858388],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007911779,0.00035174077,0.00094440754,0.001777251,0.0007301743,0.00003622112,0.0012274197,0.0004228846,0.00016546925],"category_scores_gemma":[0.000082024286,0.00050345476,0.000680016,0.0010614494,0.00040404746,0.0011505304,0.00021588989,0.0005164131,0.000008431188],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.009298318,0.0012131638,0.0007683534,0.013823108,0.0027247984,0.00047357526,0.007747464,0.9374877,0.0102758845,0.006258056,0.005858518,0.004071051],"study_design_scores_gemma":[0.0016334924,0.00019269332,0.00010339563,0.0014151913,0.0011082031,0.0000020223742,0.020272532,0.9522068,0.0008167292,0.0005346552,0.021114148,0.00060014555],"about_ca_topic_score_codex":0.0036718678,"about_ca_topic_score_gemma":0.0006157528,"teacher_disagreement_score":0.032333013,"about_ca_system_score_codex":0.00027724402,"about_ca_system_score_gemma":0.0002147136,"threshold_uncertainty_score":0.99974173},"labels":[],"label_agreement":null},{"id":"W6893271243","doi":"10.5281/zenodo.15485008","title":"Inducción de Neuropatía Diabética con baja mortalidad en ratas mediante un nuevo protocolo de administración de estreptozotocina","year":2019,"lang":"es","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Context (archaeology); Work (physics); Set (abstract data type)","score_opus":0.01556650136638614,"score_gpt":0.2565190911939055,"score_spread":0.24095258982751933,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6893271243","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.932548,0.00007801878,0.003020598,0.00273017,0.00019197525,0.0063999584,0.00019554785,0.0014160837,0.05341968],"genre_scores_gemma":[0.99440503,0.00006584311,0.00034913106,0.00079795456,0.0006956701,0.0000032769483,0.00083491,0.0019376683,0.0009105137],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9960664,0.00082204654,0.000580753,0.0008610207,0.0005709092,0.0010988927],"domain_scores_gemma":[0.9975526,0.0001410245,0.00050891814,0.00096476986,0.0006352831,0.00019744509],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.002299153,0.0004346869,0.0004384284,0.0005160963,0.00162234,0.0025459456,0.0018164035,0.00021986187,0.02385478],"category_scores_gemma":[0.0034890657,0.0004934502,0.00017515352,0.0012830015,0.0002702895,0.0011265895,0.0017959831,0.0008300222,0.017061498],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0045928024,0.005306228,0.03845607,0.009518224,0.0028445309,0.0036270963,0.008440832,0.008600304,0.18846565,0.29132336,0.13122691,0.307598],"study_design_scores_gemma":[0.0016526924,0.00033677864,0.009566112,0.00042938977,0.00034947938,0.00016229141,0.0011683878,0.009552688,0.003084306,0.0028828168,0.9699461,0.0008689991],"about_ca_topic_score_codex":0.00006373993,"about_ca_topic_score_gemma":9.704356e-7,"teacher_disagreement_score":0.8387191,"about_ca_system_score_codex":0.0003982489,"about_ca_system_score_gemma":0.000034230674,"threshold_uncertainty_score":0.9997517},"labels":[],"label_agreement":null},{"id":"W6904829522","doi":"10.14288/1.0170964","title":"British Columbia Record","year":2016,"lang":"en","type":"article","venue":"Open Collections","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Historical record; Publishing; Columbia university; Archaeological record","score_opus":0.013825055190685866,"score_gpt":0.22934862753630672,"score_spread":0.21552357234562086,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6904829522","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0070101623,0.0000065300615,0.0045049596,0.00064211193,0.00044792346,0.00033918783,0.000007911371,0.00018551863,0.9868557],"genre_scores_gemma":[0.04541391,0.000009971064,0.00067270803,0.0007557958,0.000456072,0.00011273928,0.0000040843224,0.000024175695,0.95255053],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.99934244,0.000011452323,0.00015266729,0.00024041638,0.00008064375,0.0001723733],"domain_scores_gemma":[0.99948406,0.000059585484,0.00009883766,0.00022261209,0.00012478422,0.000010115054],"candidate_categories":["sts","scholarly_communication","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00019588794,0.000057778914,0.00013260893,0.000040467992,0.0017185111,0.0057061426,0.00033923553,0.00003197229,0.040998783],"category_scores_gemma":[0.00025599377,0.00007144229,0.00006043849,0.0012578946,0.00004400843,0.001483993,0.00026681137,0.00004508194,0.0002947202],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000008976793,0.000043340344,0.0011921475,0.000003370615,0.000029502839,0.0000064627056,0.0000010833256,0.000007595286,0.00006132571,0.00041106794,0.97560686,0.02262826],"study_design_scores_gemma":[0.0004083737,0.000005389755,0.00048800348,0.000048349844,0.000046447647,0.000004955693,0.000036295656,0.00011105088,0.000004544071,0.08294869,0.91573876,0.00015911034],"about_ca_topic_score_codex":0.21454588,"about_ca_topic_score_gemma":0.525797,"teacher_disagreement_score":0.3112511,"about_ca_system_score_codex":0.000050916868,"about_ca_system_score_gemma":0.000018831917,"threshold_uncertainty_score":0.9995811},"labels":[],"label_agreement":null},{"id":"W6921631563","doi":"10.6084/m9.figshare.c.7061071.v1","title":"The effectiveness of short mobile phone text message reminders compared to usual care on medication adherence in patients with hypertension: a systematic review protocol","year":2024,"lang":"en","type":"other","venue":"Figshare","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Protocol (science); Short Message Service; Mobile phone; Systematic review; Text message; Telemedicine; Phone; MEDLINE; Intervention (counseling); Randomized controlled trial","score_opus":0.017061640584816157,"score_gpt":0.27545232989154517,"score_spread":0.25839068930672904,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6921631563","genre_codex":"protocol","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"protocol","genre_consensus":"protocol","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013065185,0.007345305,0.000014887363,0.00005479438,0.00034396834,0.7833683,0.018200876,0.00076623115,0.18977502],"genre_scores_gemma":[0.0579161,0.0000079733,0.000023122531,0.00056380336,0.00024622263,0.8994669,0.033223175,0.00073381065,0.007818895],"study_design_codex":"systematic_review","study_design_gemma":"systematic_review","domain_scores_codex":[0.9983335,0.00013201429,0.00040454557,0.00043114676,0.00052305235,0.00017573721],"domain_scores_gemma":[0.99842125,0.00024016117,0.00042857893,0.0006440161,0.0002507825,0.000015232043],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00033164097,0.0003063575,0.00079633034,0.0002519565,0.000046042765,0.000054212127,0.00041986164,0.000100961115,0.0064387405],"category_scores_gemma":[0.0010762304,0.00018432623,0.00009095111,0.00079086795,0.000016274356,0.00009481763,0.00014545229,0.00019579902,0.0012887572],"study_design_candidate":"systematic_review","study_design_consensus":"systematic_review","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00017417241,0.0000784821,0.00004028149,0.79322827,0.00014263236,0.000011607549,0.000030472793,0.000082750186,9.4875855e-7,0.000020458214,0.20588869,0.000301261],"study_design_scores_gemma":[0.00043564613,0.000050350864,0.00021990034,0.96532226,0.0003151269,2.9210497e-7,0.00013694349,0.000049525268,0.000007244971,0.000020206307,0.033128973,0.00031352747],"about_ca_topic_score_codex":0.000024406916,"about_ca_topic_score_gemma":0.00010249132,"teacher_disagreement_score":0.18195613,"about_ca_system_score_codex":0.00009133021,"about_ca_system_score_gemma":0.000029188754,"threshold_uncertainty_score":0.99948883},"labels":[],"label_agreement":null},{"id":"W6921967523","doi":"10.1051/ro/2021054/pdf","title":"Complete analysis of a discrete-time batch service queue with batch-size-dependent service time under correlated arrival process: D-MAP/","year":2021,"lang":"en","type":"article","venue":"Springer Link (Chiba Institute of Technology)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Markovian arrival process; Bulk queue; Queueing theory; Queue; Markov process; Layered queueing network; Generating function; Service (business); Function (biology)","score_opus":0.00871515645908894,"score_gpt":0.22141267794091246,"score_spread":0.21269752148182353,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6921967523","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9775375,0.00017139771,0.0069659096,0.010359662,0.00024063457,0.00048076702,0.000055140972,0.00090303546,0.0032859636],"genre_scores_gemma":[0.99017537,0.000012260453,0.0074557126,0.0012284695,0.00017027627,0.000043005082,0.00027699408,0.00009479854,0.0005430969],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9968086,0.000029008042,0.0009944034,0.0009768101,0.00061304227,0.0005781446],"domain_scores_gemma":[0.9956759,0.00008380826,0.0011703771,0.0014202831,0.0016084155,0.000041220213],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004387423,0.00055888837,0.0013993863,0.0014463098,0.00024420852,0.00008987725,0.0011461476,0.00042437948,0.00066328014],"category_scores_gemma":[0.00030580274,0.00052152685,0.00029917268,0.01034046,0.0003730169,0.00117591,0.00081027736,0.0006421464,0.00031909675],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0011959439,0.0014096906,0.031509906,0.0035447287,0.024180142,0.00041775746,0.00046647774,0.67259246,0.1702187,0.09111518,0.00011000873,0.0032390112],"study_design_scores_gemma":[0.011941935,0.00030557936,0.014213215,0.004712022,0.050287627,0.00008688575,0.0036965306,0.73715776,0.047714014,0.07307504,0.05002958,0.0067797992],"about_ca_topic_score_codex":0.00045022296,"about_ca_topic_score_gemma":0.001719048,"teacher_disagreement_score":0.12250469,"about_ca_system_score_codex":0.0000901395,"about_ca_system_score_gemma":0.00016882691,"threshold_uncertainty_score":0.9997236},"labels":[],"label_agreement":null},{"id":"W6923413576","doi":"10.14288/1.0177055","title":"The Cumberland News","year":2012,"lang":"en","type":"article","venue":"Open Collections","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"News bureau; News media; Postal service; Newspaper","score_opus":0.019221226674417564,"score_gpt":0.26188914006329567,"score_spread":0.2426679133888781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6923413576","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0009916722,0.000059312522,0.0012614733,0.0008727554,0.0005545634,0.0002315864,8.5512085e-7,0.000060583105,0.9959672],"genre_scores_gemma":[0.21299557,0.000021668342,0.00035815174,0.0015461203,0.0022636375,0.00017858481,0.000008179977,0.000029073486,0.78259903],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9994929,0.000013504349,0.00010997052,0.000094471994,0.00007516896,0.00021401809],"domain_scores_gemma":[0.9995242,0.000096976575,0.00007978553,0.0002329772,0.000055975677,0.000010116913],"candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00034227292,0.00006903975,0.00007908058,0.00003646332,0.004702392,0.0021699083,0.00031523578,0.00002000029,0.00084320805],"category_scores_gemma":[0.00017010068,0.00004863681,0.00004631573,0.0011540032,0.000035791338,0.0013672722,0.00023811097,0.00007420628,0.00032719516],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00003151536,0.000070206836,0.0022564782,0.0000033594176,0.000060707367,4.554676e-7,0.000023244022,0.00026692136,0.000016006508,0.045685187,0.9484175,0.003168445],"study_design_scores_gemma":[0.00012772663,0.0000013410175,0.00016123317,0.000003034966,0.00004885072,0.0000014639627,0.00028348286,0.00051718584,0.000007925901,0.022413593,0.976353,0.00008119156],"about_ca_topic_score_codex":0.0054042167,"about_ca_topic_score_gemma":0.0053176787,"teacher_disagreement_score":0.21336819,"about_ca_system_score_codex":0.000025228515,"about_ca_system_score_gemma":0.00000959402,"threshold_uncertainty_score":0.99886596},"labels":[],"label_agreement":null},{"id":"W6924842656","doi":"10.17026/ar/0kuwuj","title":"Rapportage archeologisch onderzoek Asten-Nederweert crashes Halifax NA197 en NA260 in 1945","year":2022,"lang":"nl","type":"dataset","venue":"DANS Data Station Archaeology","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":1,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Crash; Vulture; Homecoming","score_opus":0.036318977321955985,"score_gpt":0.2927818635637082,"score_spread":0.25646288624175223,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6924842656","genre_codex":"dataset","genre_gemma":"dataset","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":"dataset","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.008612605,0.0005440987,0.026846455,0.0051944726,0.0018254502,0.0016293118,0.9543226,0.0002924712,0.00073255267],"genre_scores_gemma":[0.01054085,0.0009439232,0.0021010307,0.0035124943,0.0006538221,0.00030368826,0.97966796,0.0001577809,0.0021184522],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9901049,0.0017385244,0.0022825503,0.0031261262,0.0010981684,0.0016496977],"domain_scores_gemma":[0.990525,0.0023717699,0.0021590441,0.004604138,0.00024077298,0.000099268094],"candidate_categories":["metaepi_narrow","open_science","research_integrity","insufficient_payload"],"consensus_categories":["metaepi_narrow","open_science","insufficient_payload"],"category_scores_codex":[0.0053658453,0.001282894,0.001842947,0.0029033974,0.00069220725,0.00020185893,0.0060945014,0.0006580128,0.06744752],"category_scores_gemma":[0.0043556695,0.001451074,0.00025879857,0.0022942584,0.0018060028,0.002859768,0.011343981,0.0026113691,0.0019239956],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00090593717,0.000971952,0.011612135,0.0016070207,0.0010391983,0.0026696252,0.002302313,0.010137611,0.00008157065,0.016002065,0.9481787,0.004491866],"study_design_scores_gemma":[0.0016148926,0.00010039227,0.0021824676,0.000106606705,0.00072990794,0.000044712804,0.0067228135,0.011809443,0.000003495025,0.0198563,0.9554408,0.0013881708],"about_ca_topic_score_codex":0.015311747,"about_ca_topic_score_gemma":0.052909084,"teacher_disagreement_score":0.06552352,"about_ca_system_score_codex":0.00038574106,"about_ca_system_score_gemma":0.00037672522,"threshold_uncertainty_score":0.9999923},"labels":[],"label_agreement":null},{"id":"W6926666547","doi":"10.25316/ir-15182","title":"Is Ontario ready for the silver tsunami?","year":2017,"lang":"en","type":"article","venue":"VIURRSpace (Vancouver Island University)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Dependency (UML); Government (linguistics); Plan (archaeology); Aging in place; Local government","score_opus":0.02219252024325261,"score_gpt":0.22783472652072448,"score_spread":0.20564220627747187,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6926666547","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.012245479,0.000047246307,0.023702316,0.005304696,0.00230925,0.00084597187,0.000040348954,0.00024563842,0.955259],"genre_scores_gemma":[0.53445923,0.000016319333,0.00026130228,0.0011966579,0.0006847808,0.0000029051248,0.0000019244487,0.00003489697,0.46334198],"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","domain_scores_codex":[0.9990339,0.00000813423,0.00009508538,0.00035905465,0.00018043032,0.00032337368],"domain_scores_gemma":[0.9984341,0.00011869276,0.00033484117,0.0009042442,0.00019102011,0.000017089711],"candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.00021837748,0.00020683515,0.00021989035,0.00020095523,0.0018297636,0.00031081375,0.0008793437,0.00008138924,0.0004052321],"category_scores_gemma":[0.00010377342,0.00016436903,0.0001946823,0.0001856344,0.00016041196,0.0016546289,0.0003187036,0.00016858523,0.000126285],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000668038,0.00011676151,0.0039853817,0.00008767844,0.000550113,0.00008127654,0.00072093983,0.0018820754,0.00011128167,0.10070173,0.88733566,0.0037590535],"study_design_scores_gemma":[0.0009540393,0.000009381526,0.00063831406,0.000021422606,0.00036854926,2.9960032e-7,0.0007208422,0.002564778,0.000023870982,0.0038700656,0.9905686,0.000259864],"about_ca_topic_score_codex":0.013654529,"about_ca_topic_score_gemma":0.11683001,"teacher_disagreement_score":0.52221376,"about_ca_system_score_codex":0.00014134315,"about_ca_system_score_gemma":0.000045348017,"threshold_uncertainty_score":0.9994697},"labels":[],"label_agreement":null},{"id":"W6927010540","doi":"10.25384/sage.c.6722307","title":"Cardiometabolic risk factors, peripheral arterial tonometry and metformin in adults with type 1 diabetes participating in the REducing with MetfOrmin Vascular Adverse Lesions trial","year":2023,"lang":"en","type":"other","venue":"Sage Journals Data","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Metformin; Hyperaemia; Blood pressure; Waist; Diabetes mellitus; Placebo; Type 2 diabetes; Vascular disease","score_opus":0.03470366449444795,"score_gpt":0.2794166277510149,"score_spread":0.24471296325656694,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6927010540","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.98958105,0.006388451,0.00024669492,0.00003903227,0.00043620868,0.0011106257,0.00035798273,0.00015450461,0.001685453],"genre_scores_gemma":[0.95916253,0.019303858,0.0037195694,0.00027868035,0.010452226,0.000591799,0.0015051663,0.0022861292,0.0027000534],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.9975414,0.00020404866,0.0005861241,0.00063466124,0.00049114064,0.0005425921],"domain_scores_gemma":[0.99765426,0.00025276368,0.0009065448,0.0011128827,0.000041534942,0.000032027605],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.003011297,0.00044231562,0.00092228455,0.0012671938,0.00019625846,0.00030032176,0.00078124995,0.00014994456,0.00082882703],"category_scores_gemma":[0.0010677706,0.00026914812,0.000095503994,0.002339364,0.000102613296,0.0014890474,0.00039538837,0.00064974744,0.000011301881],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.021689747,0.0015101639,0.28174156,0.002179505,0.011679207,0.0016616352,0.0075066453,0.023040574,0.00011726918,0.00018551544,0.014191014,0.63449717],"study_design_scores_gemma":[0.20951426,0.001350302,0.11143086,0.07713057,0.028146066,0.000066149594,0.09021291,0.053309433,0.000051902964,0.0028798296,0.41292244,0.012985258],"about_ca_topic_score_codex":0.0029294102,"about_ca_topic_score_gemma":0.007295823,"teacher_disagreement_score":0.6215119,"about_ca_system_score_codex":0.000048404396,"about_ca_system_score_gemma":0.000049544225,"threshold_uncertainty_score":0.9999761},"labels":[],"label_agreement":null},{"id":"W6930633861","doi":"10.5281/zenodo.15296722","title":"Dichoglena nigrina","year":2025,"lang":"en","type":"article","venue":"Zenodo (CERN European Organization for Nuclear Research)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"Royal British Columbia Museum","funders":"","keywords":"Boreal; Taiga; Vegetation (pathology); South carolina","score_opus":0.019189701879498047,"score_gpt":0.23488302651150395,"score_spread":0.2156933246320059,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6930633861","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.023380734,0.00009142108,0.021421697,0.002430094,0.00018951244,0.00029154864,0.000014974627,0.0018457319,0.9503343],"genre_scores_gemma":[0.9916931,0.000019660858,0.00014735106,0.0014889836,0.00037032404,3.696784e-8,0.0004962529,0.000718129,0.005066208],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9989635,0.00005446309,0.00018892594,0.00032449322,0.00019780383,0.0002708682],"domain_scores_gemma":[0.99904907,0.000019230387,0.000094373994,0.0004099828,0.00040928027,0.000018057573],"candidate_categories":["sts","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.00057258765,0.0001166958,0.00012727117,0.0004957605,0.0019417522,0.00093309337,0.0008317206,0.000039316754,0.008974738],"category_scores_gemma":[0.0008693328,0.00012250846,0.00006115158,0.0013323369,0.00010689677,0.000663203,0.0012160622,0.0001767816,0.012154899],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00010741197,0.00016498276,0.000035983492,0.00019472983,0.000113075665,0.00001711277,0.00010422903,0.0006824834,0.0026943667,0.48897728,0.29898363,0.20792472],"study_design_scores_gemma":[0.00025925893,0.000008608986,0.000329397,0.000032423835,0.000034736542,0.000003126488,0.0001423435,0.001403446,0.00008110615,0.011230289,0.9863499,0.00012540705],"about_ca_topic_score_codex":0.00001798699,"about_ca_topic_score_gemma":4.4678947e-7,"teacher_disagreement_score":0.9683123,"about_ca_system_score_codex":0.00007029803,"about_ca_system_score_gemma":0.0000012286068,"threshold_uncertainty_score":0.9993576},"labels":[],"label_agreement":null},{"id":"W6977350420","doi":"10.6084/m9.figshare.28874149.v1","title":"Additional file 1 of Comparative efficacy and acceptability of interventions for universal, selective and indicated prevention of eating disorders: study protocol for a systematic review and network meta-analysis","year":2025,"lang":"en","type":"article","venue":"Figshare","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Ottawa Hospital; University of Ottawa","funders":"","keywords":"Protocol (science); Psychological intervention; Intervention (counseling); Behaviour change; MEDLINE; Systematic review","score_opus":0.10464302916721942,"score_gpt":0.3886269584663071,"score_spread":0.2839839292990877,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6977350420","genre_codex":"dataset","genre_gemma":"protocol","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"dataset","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.000081882856,0.0005792298,0.0007238198,0.000017994465,0.0000014971754,0.19470578,0.8036576,0.000024775412,0.000207433],"genre_scores_gemma":[0.07472723,0.0000010080693,0.002121853,0.000031154,0.000016360065,0.7365998,0.18627205,0.000014017257,0.00021649816],"study_design_codex":"systematic_review","study_design_gemma":"meta_analysis","domain_scores_codex":[0.999056,0.0000917982,0.0005121418,0.00020262295,0.00006956768,0.000067915214],"domain_scores_gemma":[0.9963255,0.002048547,0.0011164445,0.00012438576,0.00037987478,0.000005269073],"candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00023992453,0.00010719822,0.0010524394,0.0001881453,0.000091348134,0.000017395785,0.000078031204,0.000023546261,0.1784741],"category_scores_gemma":[0.0029095097,0.00008862012,0.00036094294,0.0009016738,0.000025715986,0.00025276843,0.00010423762,0.00003541191,4.077385e-7],"study_design_candidate":"systematic_review","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00019237367,0.00089568115,0.00021926782,0.7493321,0.06305283,5.5361653e-8,0.00018524079,0.0006589757,5.864443e-7,0.00035090823,0.18493441,0.00017759869],"study_design_scores_gemma":[0.0060926913,0.00095989887,0.028824702,0.28216666,0.6191762,3.283343e-7,0.005760192,0.032186672,0.000014959581,0.017161733,0.006732943,0.0009230092],"about_ca_topic_score_codex":0.0000048688853,"about_ca_topic_score_gemma":0.00010435419,"teacher_disagreement_score":0.6173855,"about_ca_system_score_codex":0.0000090126305,"about_ca_system_score_gemma":0.000013848378,"threshold_uncertainty_score":0.8222769},"labels":[],"label_agreement":null},{"id":"W6980117293","doi":"","title":"Automation of analysis of airborne radionuclides observed in Canadian CTBT radiological monitoring networks using LINSSI","year":2014,"lang":"en","type":"other","venue":"STM:n Hallinnonalan avoin julkaisuarkisto (Julkari)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Automation; Radiological weapon; Radionuclide; Radiation monitoring; Automated method; Instrumentation (computer programming)","score_opus":0.02946698200507511,"score_gpt":0.26151495931832164,"score_spread":0.23204797731324653,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6980117293","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.6096976,0.015452976,0.09248593,0.0007271758,0.006808236,0.0052286377,0.0005680544,0.002372406,0.266659],"genre_scores_gemma":[0.98530006,0.00016695668,0.0033682191,0.00017852995,0.002028256,0.000033882658,0.00093710696,0.00048422383,0.007502774],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9950773,0.00026316018,0.0018662374,0.0010892908,0.0006670377,0.0010369896],"domain_scores_gemma":[0.99548775,0.00037031146,0.0025742056,0.0011184221,0.00032734062,0.00012196362],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0022192567,0.00088011887,0.0026026466,0.0056752875,0.00016089359,0.00011140532,0.0010437852,0.00095998775,0.0014300414],"category_scores_gemma":[0.00056561595,0.00090167427,0.000827042,0.005720335,0.0003727106,0.00035929852,0.00020265378,0.00076988887,0.0000535686],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00028765536,0.0003664375,0.34356204,0.0011954928,0.005060058,0.00013719327,0.00014871471,0.6251161,0.0003249038,0.013680477,0.0060845665,0.0040363357],"study_design_scores_gemma":[0.0018083,0.000064822176,0.12031609,0.0029075197,0.007980224,0.00000479054,0.00018928689,0.7776117,0.00003633479,0.0019791087,0.084424175,0.0026776977],"about_ca_topic_score_codex":0.11249052,"about_ca_topic_score_gemma":0.09615108,"teacher_disagreement_score":0.37560245,"about_ca_system_score_codex":0.00051265425,"about_ca_system_score_gemma":0.00017608148,"threshold_uncertainty_score":0.9994828},"labels":[],"label_agreement":null},{"id":"W6990185684","doi":"","title":"On Customer (Dis)honesty in Priority Queues: The Role of Lying Aversion","year":2024,"lang":"en","type":"article","venue":"UCL Discovery (University College London)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":3,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Nucleofection; Hyporeflexia; Gestational period; TSG101; Articular cartilage damage; Proteogenomics","score_opus":0.005081945165511713,"score_gpt":0.1906604528630649,"score_spread":0.18557850769755319,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W6990185684","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9769287,0.0001674029,0.0004788587,0.00057430624,0.00026613183,0.00025727446,0.00004919156,0.0001142784,0.021163862],"genre_scores_gemma":[0.99509746,0.000027001879,0.000029530538,0.00019506071,0.00012170851,9.27588e-7,0.000017349648,0.000020097048,0.0044908924],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99883676,0.00004749137,0.00016869734,0.00038247646,0.0003030391,0.00026153759],"domain_scores_gemma":[0.99919707,0.00024842063,0.00012308119,0.00035963557,0.00005857552,0.000013225938],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00039806767,0.00019199912,0.00026222595,0.0006708512,0.00029383422,0.00009343106,0.0004324495,0.00008141665,0.00018549227],"category_scores_gemma":[0.00007558276,0.00016769547,0.00021058347,0.001993105,0.00013394683,0.0029760476,0.00033159333,0.0002851197,0.00031752928],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0004963823,0.0001534211,0.0039269715,0.00018302907,0.00009567947,0.00021930701,0.00033528736,0.005660117,0.0008500242,0.9851146,0.0011168978,0.0018483279],"study_design_scores_gemma":[0.0039266814,0.0000978635,0.01805148,0.0019848784,0.0012428527,0.000013043623,0.04979741,0.31333208,0.0008158688,0.18286605,0.42574596,0.00212582],"about_ca_topic_score_codex":0.0008237786,"about_ca_topic_score_gemma":0.0005639013,"teacher_disagreement_score":0.8022485,"about_ca_system_score_codex":0.00019376921,"about_ca_system_score_gemma":0.00004923762,"threshold_uncertainty_score":0.6838423},"labels":[],"label_agreement":null},{"id":"W7042857999","doi":"","title":"Public Restrooms and Queueing","year":2021,"lang":"en","type":"article","venue":"Scholarship at UWindsor (University of Windsor)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Nucleofection; Gestational period; TSG101; Diafiltration; Dysgeusia; Triacetin; Demotion; Emperipolesis; Proteogenomics","score_opus":0.03162125087624795,"score_gpt":0.20679856190842336,"score_spread":0.1751773110321754,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7042857999","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.982141,0.00025163987,0.00041037705,0.002587674,0.00009791545,0.000072521165,0.000004523301,0.00011758742,0.014316774],"genre_scores_gemma":[0.99445325,0.000024149862,0.0010725898,0.00045822974,0.00016525717,2.0283267e-7,0.000035864225,0.000024536772,0.003765947],"study_design_codex":"observational","study_design_gemma":"observational","domain_scores_codex":[0.998606,0.000064606604,0.00016728602,0.00048452843,0.00032426353,0.00035326372],"domain_scores_gemma":[0.9988024,0.00008876083,0.00026270267,0.00045883152,0.00033878715,0.00004848703],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00061973446,0.00018916339,0.0003186906,0.000373089,0.00064606505,0.0001555054,0.0003801588,0.00013705585,0.0011554403],"category_scores_gemma":[0.00044881922,0.00024595775,0.00016054802,0.0009927722,0.00022271874,0.003071074,0.00076176564,0.00030650367,0.0002958181],"study_design_candidate":"observational","study_design_consensus":"observational","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00036804043,0.00029678812,0.7839823,0.00048647544,0.00049923465,0.00075872487,0.00048927043,0.00036998326,0.038517408,0.16239777,0.0009452176,0.010888786],"study_design_scores_gemma":[0.0057923426,0.00005627524,0.64283997,0.0005070868,0.0012012032,0.000096182535,0.01107613,0.003278399,0.003423716,0.11515538,0.21431015,0.002263156],"about_ca_topic_score_codex":0.00008931012,"about_ca_topic_score_gemma":0.00043761652,"teacher_disagreement_score":0.21336493,"about_ca_system_score_codex":0.000060743114,"about_ca_system_score_gemma":0.000042430194,"threshold_uncertainty_score":0.9999993},"labels":[],"label_agreement":null},{"id":"W7043348986","doi":"","title":"A study into the efficiency of traffic : flows induced by selfish agents","year":2005,"lang":"en","type":"dissertation","venue":"eScholarship@McGill (McGill)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Product (mathematics); Limiting","score_opus":0.01579236353444144,"score_gpt":0.2520471673850193,"score_spread":0.23625480385057787,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7043348986","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9755994,0.00016226922,1.8049948e-7,0.000026859854,0.00079245877,0.0013257711,0.00006183561,0.0003172358,0.021713972],"genre_scores_gemma":[0.9960579,0.000025493513,0.000059385096,0.00042026464,0.00021427126,0.00019011814,0.00056066667,0.0002322345,0.0022396417],"study_design_codex":"design_other","study_design_gemma":"not_applicable","domain_scores_codex":[0.995011,0.00025820034,0.0014026909,0.0012741361,0.0013248795,0.00072910567],"domain_scores_gemma":[0.99614024,0.0002465582,0.0016384998,0.0012775981,0.00063790445,0.000059196747],"candidate_categories":["metaepi_narrow","sts"],"consensus_categories":[],"category_scores_codex":[0.0020819523,0.00095772016,0.0010769464,0.0008063119,0.0016614746,0.00022686215,0.0018444784,0.0004946877,0.0004249937],"category_scores_gemma":[0.0011927381,0.00082629226,0.0005556545,0.0022917795,0.00006396824,0.0016865926,0.0003042111,0.001429649,0.00039739744],"study_design_candidate":"design_other","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0019313345,0.013502219,0.00044445667,0.0026978694,0.0054654256,0.00023538912,0.0012694022,0.017364819,0.08118205,0.057486154,0.0002090846,0.8182118],"study_design_scores_gemma":[0.02979773,0.0021807493,0.012050484,0.006429535,0.034940902,0.00003445294,0.15465494,0.017663239,0.06348102,0.07619963,0.5750966,0.027470721],"about_ca_topic_score_codex":0.00041257037,"about_ca_topic_score_gemma":0.0056422423,"teacher_disagreement_score":0.7907411,"about_ca_system_score_codex":0.00034163365,"about_ca_system_score_gemma":0.000031371783,"threshold_uncertainty_score":0.9996382},"labels":[],"label_agreement":null},{"id":"W7043456769","doi":"","title":"Simulation-based optimization of agent scheduling in multiskill call centers","year":2007,"lang":"en","type":"article","venue":"IRIS eCampus Telematic University (Università degli Studi eCampus)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Università della Calabria","keywords":"Nucleofection; Gestational period; Diafiltration; Dysgeusia; TSG101; Fusible alloy; Hyporeflexia; Liquation; Proteogenomics","score_opus":0.01280098072270022,"score_gpt":0.2261318703571053,"score_spread":0.21333088963440508,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7043456769","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.51299757,0.000020345522,0.48435473,0.00012293817,0.00012535581,0.00037478757,0.0000048546935,0.0001228739,0.0018765134],"genre_scores_gemma":[0.9771981,0.000007525832,0.0222231,0.00017997267,0.00007141117,3.447254e-7,0.000048526734,0.000031788957,0.00023920767],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979605,0.0000644809,0.00047488644,0.00052919035,0.0004529002,0.0005180061],"domain_scores_gemma":[0.9974723,0.00082565285,0.0007693284,0.00043782577,0.0004441792,0.000050727453],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008518317,0.00033342233,0.00056811736,0.0018056035,0.000410761,0.000037957376,0.00055218465,0.00016285747,0.00017528883],"category_scores_gemma":[0.0004235634,0.00041869076,0.0002498631,0.0022934326,0.00020748269,0.0013859228,0.00029675305,0.0002467249,0.000048457714],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.00021354461,0.00027509432,0.02662217,0.0001822274,0.00013442646,0.00016629099,0.0004340492,0.9696698,0.00006440961,0.0014698418,0.000028022554,0.0007400942],"study_design_scores_gemma":[0.002752672,0.000022441192,0.0039010027,0.00022290031,0.00035469586,5.515378e-7,0.0075100027,0.9837845,0.000021954449,0.00026156977,0.0007085658,0.00045916854],"about_ca_topic_score_codex":0.00045784004,"about_ca_topic_score_gemma":0.00061319326,"teacher_disagreement_score":0.46420053,"about_ca_system_score_codex":0.00049802987,"about_ca_system_score_gemma":0.00004666351,"threshold_uncertainty_score":0.9998265},"labels":[],"label_agreement":null},{"id":"W7069358106","doi":"","title":"","year":2021,"lang":"en","type":"other","venue":"Directory of Open access Books (OAPEN Foundation)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Autoethnography; Identity (music); Key (lock); Variety (cybernetics)","score_opus":0.07292811962538152,"score_gpt":0.37787447177813244,"score_spread":0.3049463521527509,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7069358106","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.001337806,0.00036352294,0.0014731325,0.00037843565,0.0013095264,0.0019958087,0.000003503417,0.00054811663,0.9925901],"genre_scores_gemma":[0.02268886,0.00019229749,0.0018481417,0.0041304477,0.0033006773,0.00065551593,0.003961634,0.0020926138,0.9611298],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99446946,0.00017912539,0.0015488239,0.001936602,0.0011020283,0.0007639549],"domain_scores_gemma":[0.9917909,0.0002907099,0.0047569387,0.0023233707,0.00077798177,0.000060099705],"candidate_categories":["metaepi_narrow","scholarly_communication","open_science","insufficient_payload"],"consensus_categories":["open_science","insufficient_payload"],"category_scores_codex":[0.0014120948,0.0011845772,0.0023692264,0.002351288,0.0005439767,0.00901683,0.009397656,0.00027027607,0.10698712],"category_scores_gemma":[0.00094556727,0.0012916678,0.0005827632,0.002083163,0.00051748834,0.012264586,0.008864287,0.0005358326,0.0008616457],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006636834,0.0011742847,0.024109999,0.004797115,0.004459528,0.00022926391,0.00007278278,0.0010382661,0.001577728,0.6617975,0.08051993,0.21955988],"study_design_scores_gemma":[0.0012144457,0.000006157706,0.0025520665,0.0016247561,0.00065596984,0.0000022275096,0.00010348755,0.00026286684,0.00024153474,0.014420269,0.9774216,0.001494631],"about_ca_topic_score_codex":0.015947754,"about_ca_topic_score_gemma":0.011716965,"teacher_disagreement_score":0.89690167,"about_ca_system_score_codex":0.00018910608,"about_ca_system_score_gemma":0.00030917654,"threshold_uncertainty_score":0.9999163},"labels":[],"label_agreement":null},{"id":"W7084035889","doi":"10.6084/m9.figshare.30146386","title":"Integrating robotic-assisted gait training into an inpatient physiotherapy program for children with subacute acquired brain injury: a feasibility study and characterization of session ingredients","year":2025,"lang":"en","type":"article","venue":"Figshare","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Gait training; Gait; Ambulatory; Goal Attainment Scaling; Gross motor skill; Acquired brain injury; Intervention (counseling)","score_opus":0.02967008984905493,"score_gpt":0.3256690281065069,"score_spread":0.29599893825745194,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7084035889","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9959477,0.0000047120816,0.000419555,0.000056645073,0.000025580543,0.0023011162,0.0010641302,0.00015695555,0.000023584334],"genre_scores_gemma":[0.9715578,1.6024124e-7,0.000837855,0.00023102875,0.00008477519,0.00049811834,0.026744617,0.00002886329,0.000016765112],"study_design_codex":"design_other","study_design_gemma":"observational","domain_scores_codex":[0.9988135,0.000048851198,0.0003333833,0.00044499472,0.00016709811,0.00019218145],"domain_scores_gemma":[0.9988853,0.00005219768,0.00046212476,0.0002696845,0.0003147953,0.000015898582],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001953348,0.0002167397,0.00034994227,0.00024381188,0.0002476402,0.00017813111,0.00018872217,0.000055712273,0.00031885007],"category_scores_gemma":[0.0004634904,0.0001784457,0.000053638913,0.00077114574,0.000019818877,0.0010589988,0.00011829585,0.0000694139,0.0000013500502],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0021314928,0.0037353649,0.15160106,0.0016953142,0.0006850155,0.0000019410777,0.005847105,0.00037628127,0.036427155,0.00022512102,0.00053349824,0.79674065],"study_design_scores_gemma":[0.0037533657,0.0011413082,0.9381136,0.0049210596,0.00025097356,4.831035e-7,0.0025839556,0.046318293,0.0011389534,0.00081284763,0.00031987825,0.0006453248],"about_ca_topic_score_codex":0.000029151113,"about_ca_topic_score_gemma":0.00008322694,"teacher_disagreement_score":0.7960953,"about_ca_system_score_codex":0.000044851004,"about_ca_system_score_gemma":0.000029109544,"threshold_uncertainty_score":0.72768044},"labels":[],"label_agreement":null},{"id":"W7091436942","doi":"10.4000/14yxl","title":"Le musulman et le citoyen","year":2025,"lang":"fr","type":"article","venue":"Mondes & Migrations","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"World Federation of Science Journalists","funders":"","keywords":"","score_opus":0.009713479085010258,"score_gpt":0.24890694992495663,"score_spread":0.23919347083994638,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7091436942","genre_codex":"commentary","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.053047594,0.047537733,0.14828841,0.38284543,0.002677374,0.00084288715,0.000054351058,0.0007641647,0.36394206],"genre_scores_gemma":[0.86467576,0.000102953534,0.0012947796,0.0043565365,0.00035977663,0.00004995384,0.00012831052,0.000029709146,0.1290022],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.998709,0.00006337119,0.00036706484,0.00038477668,0.0001422205,0.00033355728],"domain_scores_gemma":[0.9989555,0.00014084273,0.00017235207,0.00048783323,0.00022616945,0.000017309634],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003659683,0.00023409582,0.00026211687,0.00045053722,0.0007932638,0.00047396703,0.00031139018,0.000119579316,0.00029496217],"category_scores_gemma":[0.0003307746,0.00028229153,0.00021871708,0.0014709772,0.00017635254,0.0019303994,0.0002097019,0.00023768033,0.00046009943],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000009262266,0.0002467042,0.0009597179,0.00011595112,0.00014869623,0.000006393758,0.000115068535,0.010901634,0.0005272938,0.9078653,0.073538356,0.0055656475],"study_design_scores_gemma":[0.00035844854,0.0000040725404,0.0013161192,0.00017797385,0.0003101625,5.5165754e-7,0.001207222,0.013291725,0.0001858768,0.16942918,0.8134534,0.0002652664],"about_ca_topic_score_codex":0.0033145417,"about_ca_topic_score_gemma":0.00983074,"teacher_disagreement_score":0.81162816,"about_ca_system_score_codex":0.000044452107,"about_ca_system_score_gemma":0.00018147554,"threshold_uncertainty_score":0.9999629},"labels":[],"label_agreement":null},{"id":"W7098087296","doi":"","title":"Les Cahiers du GERAD ISSN: 0711–2440 Inter-dependent, heterogeneous, and time-varying service-time distributions in call centers","year":2015,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Context (archaeology); Center (category theory); Watson","score_opus":0.015029170102356855,"score_gpt":0.23127976261015662,"score_spread":0.21625059250779977,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7098087296","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9672081,0.00013878808,0.012108598,0.0034356213,0.00015651088,0.00030447633,0.000023919765,0.00038871873,0.016235271],"genre_scores_gemma":[0.99602604,0.000008307787,0.00040688078,0.0016243778,0.00020857817,0.000013394429,0.00015774046,0.000035505047,0.001519182],"study_design_codex":"observational","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9986628,0.00004010101,0.00033408703,0.0004074396,0.00018504547,0.00037049278],"domain_scores_gemma":[0.9993132,0.00005801944,0.00015160424,0.00027934762,0.000147409,0.000050471514],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00041713467,0.0002523841,0.0003024519,0.00027716218,0.00019638178,0.00022808954,0.00026608174,0.000096045966,0.00035764437],"category_scores_gemma":[0.00013339552,0.00024154523,0.00007566138,0.0004884392,0.00008531121,0.00094335835,0.00028004206,0.00018363608,0.00050735695],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0044879275,0.004649248,0.38545212,0.0024633633,0.004604328,0.003068764,0.009147747,0.14074145,0.059685253,0.23505954,0.06293918,0.087701075],"study_design_scores_gemma":[0.0119013805,0.00012965377,0.0030036487,0.0008645879,0.0014178423,0.00021576475,0.0035087706,0.7533315,0.0027121392,0.080923945,0.13668622,0.0053045633],"about_ca_topic_score_codex":0.0025970004,"about_ca_topic_score_gemma":0.0009869179,"teacher_disagreement_score":0.61259,"about_ca_system_score_codex":0.0001786656,"about_ca_system_score_gemma":0.000011793017,"threshold_uncertainty_score":0.98499286},"labels":[],"label_agreement":null},{"id":"W7100326238","doi":"","title":"CanQueue 2011: 13th Annual Conference for Canadian Queueing Theorists and Practitioners","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Queueing theory; Phone; Telephone line; Server; Layered queueing network; Erlang (programming language); Markov process; Markov chain; Service (business)","score_opus":0.009800814853487532,"score_gpt":0.22891827315458713,"score_spread":0.2191174583010996,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7100326238","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.23109896,0.000087037246,0.34023166,0.021478802,0.00087539107,0.0012130477,0.000056070297,0.0006362974,0.40432274],"genre_scores_gemma":[0.9923581,0.000003083831,0.0014922174,0.0033365896,0.00046699407,0.000025685502,0.000040508326,0.000020471081,0.0022563818],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.9992008,0.000015592872,0.00014753151,0.0002621353,0.00008465937,0.0002892856],"domain_scores_gemma":[0.99926597,0.00012743266,0.00012111517,0.00017563572,0.0002706384,0.00003918513],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00055938115,0.00013556903,0.00015840156,0.00017564902,0.00032739592,0.00020487339,0.00012917693,0.00005329345,0.00044225188],"category_scores_gemma":[0.00038760665,0.0001248188,0.00003805417,0.00012466982,0.00007088318,0.0012242985,0.000040653264,0.000075800715,0.0001017377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000022666669,0.000008129398,0.0013203826,0.00004525335,0.000029327788,0.0000017157024,0.00010075048,0.00024320622,0.00005494031,0.9861136,0.0056182253,0.006441786],"study_design_scores_gemma":[0.0006325389,0.000017340382,0.0014456656,0.0000382635,0.00014923821,0.0000035882922,0.0021542876,0.06031511,0.0000714017,0.25477144,0.6798252,0.00057593547],"about_ca_topic_score_codex":0.1432963,"about_ca_topic_score_gemma":0.2626012,"teacher_disagreement_score":0.7612591,"about_ca_system_score_codex":0.000043586853,"about_ca_system_score_gemma":0.00005023679,"threshold_uncertainty_score":0.8624086},"labels":[],"label_agreement":null},{"id":"W7110344590","doi":"10.21683/1729-2646-2025-25-4-3-16","title":"Accuracy and precision requirements in probability models","year":2025,"lang":"","type":"article","venue":"Dependability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Western University","funders":"","keywords":"Laplace transform; Inverse Laplace transform; Laplace transform applied to differential equations; Two-sided Laplace transform; Laplace–Stieltjes transform; Queueing theory; Inverse; Laplace's method","score_opus":0.03278004889157011,"score_gpt":0.29576267420793684,"score_spread":0.26298262531636674,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7110344590","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.96642905,0.0013936035,0.01285752,0.0015626181,0.0005435263,0.0020459876,0.000014183206,0.00013432628,0.015019171],"genre_scores_gemma":[0.9978137,0.00014391431,0.0008947869,0.00055210764,0.000101530066,0.00007926042,0.000020774063,0.000026360032,0.00036755187],"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9952877,0.0003100652,0.0014650507,0.0017411608,0.00047969163,0.00071629474],"domain_scores_gemma":[0.9965105,0.0009004283,0.0005220279,0.0015903104,0.00043668583,0.000040071114],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.005499881,0.000548776,0.0008581626,0.0006143802,0.00040539377,0.00047472242,0.0006475336,0.00029178683,0.00042104645],"category_scores_gemma":[0.004452198,0.00056118175,0.00021815281,0.0020672465,0.00040929476,0.005111261,0.0015774985,0.0005793646,0.000053862594],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.002469586,0.0030056892,0.36384583,0.0058040186,0.00029423978,0.000028368804,0.00055313425,0.028737603,0.00051680795,0.12871483,0.00027583033,0.46575406],"study_design_scores_gemma":[0.0011462277,0.000012234622,0.024784941,0.00045012854,0.0002072726,3.6325503e-7,0.00019684476,0.15154973,0.0001068597,0.8181034,0.00299905,0.0004429756],"about_ca_topic_score_codex":0.0009975185,"about_ca_topic_score_gemma":0.0016134146,"teacher_disagreement_score":0.6893885,"about_ca_system_score_codex":0.00044689266,"about_ca_system_score_gemma":0.00012318236,"threshold_uncertainty_score":0.999684},"labels":[],"label_agreement":null},{"id":"W7115059627","doi":"10.1002/nav.70038","title":"Strategic Joining and Optimal Pricing in a Single‐Server Batch Arrival Queue With Different Information of Batch Size","year":2025,"lang":"en","type":"article","venue":"Naval Research Logistics (NRL)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Simon Fraser University","funders":"Natural Sciences and Engineering Research Council of Canada; Central University of Finance and Economics; National Natural Science Foundation of China","keywords":"Unobservable; Key (lock); Queue; Nash equilibrium; Bridge (graph theory); Variance (accounting); Batch production; Queueing theory","score_opus":0.05762231900422283,"score_gpt":0.3178885239063977,"score_spread":0.2602662049021749,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115059627","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9732152,0.000048239912,0.011383486,0.0003340979,0.000053080214,0.00030712504,0.000003400298,0.00004583162,0.014609491],"genre_scores_gemma":[0.99859774,0.000017876926,0.00095893425,0.00010422694,0.00008604754,0.000019049614,0.00001839077,0.000014832839,0.00018292904],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9979299,0.000090781985,0.00049737457,0.0002845316,0.00069089205,0.00050653017],"domain_scores_gemma":[0.9978985,0.0009610535,0.00020433278,0.0003029805,0.0006069778,0.000026139644],"candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0017742001,0.00019975322,0.00036843252,0.00072848564,0.00019275965,0.0003292995,0.00029593124,0.000104503444,0.000048958547],"category_scores_gemma":[0.0031574725,0.00016445889,0.00004454201,0.0014443684,0.00031500577,0.000924929,0.00039772352,0.0005670651,0.0000088000015],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0030116842,0.0007370612,0.10344951,0.0037435929,0.00033231173,0.00012415575,0.0009749014,0.10899515,0.009881041,0.7568035,0.0002963891,0.011650689],"study_design_scores_gemma":[0.008244766,0.00078642514,0.09270231,0.0038143762,0.0004483568,0.000008475259,0.019944338,0.523603,0.005068023,0.34163776,0.0020582592,0.0016838924],"about_ca_topic_score_codex":0.0008363749,"about_ca_topic_score_gemma":0.0004678605,"teacher_disagreement_score":0.41516575,"about_ca_system_score_codex":0.00015997289,"about_ca_system_score_gemma":0.000095045405,"threshold_uncertainty_score":0.6706439},"labels":[],"label_agreement":null},{"id":"W7115224751","doi":"","title":"Network Potentials","year":2007,"lang":"en","type":"article","venue":"Research Portal (Queen's University Belfast)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Queen's University","funders":"","keywords":"Artificial neural network; Set (abstract data type); Work (physics); Feature (linguistics); Identification (biology)","score_opus":0.020789639666822932,"score_gpt":0.2716759354698464,"score_spread":0.25088629580302346,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7115224751","genre_codex":"other","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.43829152,0.000055873006,0.030317266,0.00783804,0.00061819714,0.0010361087,0.000013813696,0.0009857806,0.5208434],"genre_scores_gemma":[0.9807455,0.000019362033,0.0004811218,0.00039398027,0.0014785104,5.4266064e-7,0.000053831634,0.00003595987,0.016791213],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","domain_scores_codex":[0.99711555,0.000082391394,0.00024981433,0.00050321367,0.0008997659,0.0011492601],"domain_scores_gemma":[0.9984213,0.00023354548,0.00017502774,0.00049142353,0.00059934845,0.000079365294],"candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0035622423,0.00020334263,0.00027880078,0.00090997916,0.0010452663,0.00014873095,0.0006817834,0.00013536596,0.0015585998],"category_scores_gemma":[0.00029617228,0.00022612023,0.00018089949,0.0026310235,0.0003143416,0.0015051096,0.00075141987,0.0005674567,0.0008979153],"study_design_candidate":"not_applicable","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0006522717,0.00026373198,0.01458039,0.0001242922,0.00026765213,0.0041160034,0.00005489214,0.0041306796,0.00035985722,0.8940767,0.07673752,0.00463598],"study_design_scores_gemma":[0.0012573428,0.00005391096,0.0150475055,0.00013029718,0.00019987214,0.0000061551646,0.0039172526,0.00057519594,0.000179614,0.057534724,0.9202381,0.00086005585],"about_ca_topic_score_codex":0.0015911425,"about_ca_topic_score_gemma":0.00017976013,"teacher_disagreement_score":0.84350055,"about_ca_system_score_codex":0.00011496403,"about_ca_system_score_gemma":0.00005375569,"threshold_uncertainty_score":0.99988},"labels":[],"label_agreement":null},{"id":"W7116901470","doi":"10.2139/ssrn.5947657","title":"Optimal Duration-Based Pricing Under Congestion","year":2025,"lang":"","type":"preprint","venue":"SSRN Electronic Journal","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Pricing schedule; Valuation (finance); Revenue; Schedule; Customer base; Value of time; Service provider; Service (business)","score_opus":0.009129333375287329,"score_gpt":0.24680532971707123,"score_spread":0.2376759963417839,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7116901470","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.0672713,0.0043579172,0.91356176,0.0075766803,0.0021882039,0.00076905807,0.0000072528355,0.00023886745,0.0040289327],"genre_scores_gemma":[0.9825477,0.0024687813,0.0010428898,0.0015035663,0.0034408064,0.00004081616,0.00016153297,0.000106507745,0.008687381],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9914067,0.0002667725,0.0018245885,0.0011796758,0.0009098312,0.0044124452],"domain_scores_gemma":[0.9944523,0.00037694763,0.002953393,0.00082936184,0.0013313753,0.000056648205],"candidate_categories":["metaepi_narrow","sts","scholarly_communication","research_integrity"],"consensus_categories":[],"category_scores_codex":[0.0071778786,0.001045739,0.0010823567,0.0017229402,0.0017366504,0.0013959984,0.0012982714,0.00062886055,0.00052630284],"category_scores_gemma":[0.00093251286,0.0011117172,0.00093047565,0.0015003162,0.00020191401,0.0016986197,0.0006023489,0.009277303,0.00024578586],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":true,"about_ca_system_consensus":true,"study_design_scores_codex":[0.00033638946,0.00015192555,0.00047782893,0.00023427918,0.0010883737,0.000008409023,0.000027481885,0.6729916,0.00009229043,0.31634343,0.000044916833,0.00820309],"study_design_scores_gemma":[0.002053107,0.000082916864,0.00023033959,0.0014505716,0.0032791356,0.000050048555,0.0027905533,0.30263823,0.00008228896,0.6817342,0.00410135,0.0015072371],"about_ca_topic_score_codex":0.00022328748,"about_ca_topic_score_gemma":0.0008336497,"teacher_disagreement_score":0.9152764,"about_ca_system_score_codex":0.0046690553,"about_ca_system_score_gemma":0.007157457,"threshold_uncertainty_score":0.99964064},"labels":[],"label_agreement":null},{"id":"W7117326042","doi":"10.1007/s11009-025-10238-7","title":"Correction to: Redundancy in Two-series-parallel and Two-parallel-series Systems with Independent Components Randomly Chosen from Two Batches","year":2025,"lang":"en","type":"article","venue":"Methodology And Computing In Applied Probability","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"McMaster University","funders":"","keywords":"Redundancy (engineering); Variance components; Pattern recognition (psychology); Calculus (dental)","score_opus":0.034570114263978165,"score_gpt":0.29421467770135623,"score_spread":0.2596445634373781,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117326042","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8342767,0.00020886399,0.16148831,0.00034573613,0.00057725486,0.0009834983,0.0000012649541,0.00012107715,0.0019973104],"genre_scores_gemma":[0.9409988,0.0000075039966,0.058343876,0.00024826734,0.00016141906,0.000101390666,0.00002132405,0.000018107765,0.000099337965],"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.9971964,0.0006353879,0.0006857973,0.00092650903,0.00015198727,0.00040392988],"domain_scores_gemma":[0.9976943,0.0015308294,0.00029935155,0.0003773862,0.00007186081,0.000026272437],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.004432893,0.0003441171,0.0009191086,0.00035331925,0.00027923228,0.00015468062,0.00023637863,0.0000957734,0.000008236938],"category_scores_gemma":[0.0005012731,0.000317124,0.000044617198,0.000765445,0.00028974257,0.00029839258,0.00043826847,0.00048600504,0.000004260205],"study_design_candidate":"observational","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.010650363,0.00017538543,0.42209485,0.00036479265,0.00017567871,0.00001578891,0.00086019025,0.4793891,0.0012252642,0.07221907,0.000025315223,0.012804197],"study_design_scores_gemma":[0.016923115,0.00007095414,0.3408577,0.0008203128,0.00028451034,0.000021082427,0.002247857,0.123349,0.00019926282,0.51315016,0.00094525807,0.0011307716],"about_ca_topic_score_codex":0.004627961,"about_ca_topic_score_gemma":0.0052906666,"teacher_disagreement_score":0.4409311,"about_ca_system_score_codex":0.00009806331,"about_ca_system_score_gemma":0.000028610399,"threshold_uncertainty_score":0.99992806},"labels":[],"label_agreement":null},{"id":"W7117644685","doi":"10.1109/wincom65874.2025.11313354","title":"A Robust Optimal Patient Distribution Enforced by Blockchain","year":2025,"lang":"","type":"article","venue":"","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université de Sherbrooke","funders":"","keywords":"Imperfect; Payment; Service (business); Health care; Distribution (mathematics); Patient care; Blockchain; Matching (statistics)","score_opus":0.0075257449848668894,"score_gpt":0.20904474310183754,"score_spread":0.20151899811697066,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7117644685","genre_codex":"methods","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":null,"domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.1631782,0.0013314867,0.77515376,0.0034199925,0.0011413333,0.00093839667,0.00010549348,0.00049129914,0.054240055],"genre_scores_gemma":[0.97275454,0.00003199543,0.00040259163,0.0024324611,0.00024791533,0.000045563815,0.0005858014,0.0000336369,0.023465473],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9971315,0.000052721807,0.0008775544,0.00081750966,0.00037538182,0.0007453058],"domain_scores_gemma":[0.9983161,0.00012987411,0.00048100762,0.00063821155,0.0004019611,0.000032816908],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00055115984,0.00052560464,0.0005378258,0.00032156357,0.0007279367,0.00055967167,0.0004458666,0.00021881284,0.0030560421],"category_scores_gemma":[0.00051942095,0.00053132884,0.0003468974,0.0021916917,0.00017726317,0.0007208205,0.00065354496,0.0003304379,0.00041572057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005371141,0.0006515081,0.0005304449,0.0004977425,0.0007748953,0.000020804333,0.00007607457,0.36827713,0.0009951536,0.43888044,0.14962766,0.039131016],"study_design_scores_gemma":[0.0011596625,0.00003604261,0.000028982342,0.00030935078,0.0009860247,6.862113e-7,0.0015830284,0.6889778,0.0016283272,0.0058077886,0.29861334,0.0008689798],"about_ca_topic_score_codex":0.00028298434,"about_ca_topic_score_gemma":0.000025281533,"teacher_disagreement_score":0.80957633,"about_ca_system_score_codex":0.00025462225,"about_ca_system_score_gemma":0.000046662462,"threshold_uncertainty_score":0.99971384},"labels":[],"label_agreement":null},{"id":"W7132939944","doi":"","title":"A process control simulation of the USD wire payment system at a major Canadian bank","year":2006,"lang":"","type":"dissertation","venue":"TSpace","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":true,"ca_institutions":"","funders":"","keywords":"Overdraft; Payment; Process (computing); Control (management); Cash; Queue; Scale (ratio)","score_opus":0.007001902621231411,"score_gpt":0.2609768644119048,"score_spread":0.2539749617906734,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7132939944","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.9695512,0.00085962494,0.0013807681,0.0010278124,0.0012004209,0.0030354692,0.00005832896,0.00013473186,0.022751627],"genre_scores_gemma":[0.9797392,0.000002261883,0.000008878723,0.00024126533,0.00053228426,0.000114069546,0.00045872002,0.000112895745,0.018790461],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.9966977,0.0001157679,0.0009518299,0.00074229995,0.0007965619,0.00069584243],"domain_scores_gemma":[0.995433,0.00016782137,0.0024407965,0.0008365289,0.0010639614,0.000057933812],"candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006162215,0.0006905115,0.0009164762,0.0006069823,0.0010840256,0.00019210756,0.00069494284,0.0003923167,0.00045822363],"category_scores_gemma":[0.0002723192,0.00058045797,0.00047683952,0.0014992671,0.00010448486,0.0005325672,0.00006987631,0.00033826526,0.00013891194],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.0005586482,0.000092276256,0.008668517,0.0066302214,0.0005701684,0.000019408513,0.001724111,0.97656906,0.00047513377,0.0038556356,0.00028381043,0.00055298454],"study_design_scores_gemma":[0.0029953686,0.000027156408,0.010447015,0.004654406,0.0060988897,0.0000026455145,0.020901777,0.9439437,0.00076042756,0.00078365154,0.007780893,0.0016041048],"about_ca_topic_score_codex":0.15041876,"about_ca_topic_score_gemma":0.4149045,"teacher_disagreement_score":0.26448575,"about_ca_system_score_codex":0.0010624472,"about_ca_system_score_gemma":0.0003130827,"threshold_uncertainty_score":0.99966466},"labels":[],"label_agreement":null},{"id":"W7139828160","doi":"","title":"Impact of the Frequency of Control for the Multiclass Queue Scheduling Problem","year":2025,"lang":"","type":"dissertation","venue":"TSpace (University of Toronto)","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":true,"route_ca_aff":false,"route_ca_fund":true,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"","funders":"Alliance de recherche numérique du Canada","keywords":"Parameterized complexity; Queue; Queueing theory; Scheduling (production processes); Admission control; Discrete time and continuous time; Bulk queue; Queue management system","score_opus":0.010623081117036658,"score_gpt":0.2550686523088187,"score_spread":0.24444557119178204,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7139828160","genre_codex":"empirical","genre_gemma":"empirical","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"empirical","genre_consensus":"empirical","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.8811976,0.0057603847,0.07956673,0.0018533493,0.0010082514,0.005589711,0.0002985174,0.00007773164,0.02464776],"genre_scores_gemma":[0.9939272,0.00017271085,0.0018888088,0.000018286339,0.000083781764,0.0000029465439,0.000051313087,0.00002807065,0.0038269067],"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","domain_scores_codex":[0.99822,0.00010225541,0.0004625108,0.00044924932,0.00039803702,0.00036790222],"domain_scores_gemma":[0.9938271,0.00073435286,0.0029601434,0.0008482589,0.0016096993,0.00002045779],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.00077768107,0.00042726294,0.0009981386,0.00015605331,0.0006925977,0.000034026856,0.0014822653,0.00029604882,0.0025313275],"category_scores_gemma":[0.00051471335,0.00034472387,0.0015834011,0.00045983098,0.0003212199,0.0011966394,0.00020322559,0.00027048544,0.0000024924725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","about_ca_topic_candidate":true,"about_ca_topic_consensus":true,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.013158341,0.0024302166,0.06560975,0.025611574,0.031695914,0.000008835417,0.040827487,0.44928756,0.06904965,0.18887396,0.00047006446,0.112976626],"study_design_scores_gemma":[0.01128822,0.0003173323,0.37322673,0.0058253477,0.024497895,6.150423e-7,0.16123317,0.41438478,0.00053477235,0.0067117326,0.0003326323,0.0016467687],"about_ca_topic_score_codex":0.23532544,"about_ca_topic_score_gemma":0.10478762,"teacher_disagreement_score":0.30761698,"about_ca_system_score_codex":0.0003785422,"about_ca_system_score_gemma":0.0003279709,"threshold_uncertainty_score":0.99990046},"labels":[],"label_agreement":null},{"id":"W7148482919","doi":"10.1007/978-3-032-07031-9_3","title":"Power Savings, Mobility, and Data Queues","year":2025,"lang":"en","type":"book-chapter","venue":"Static & dynamic game theory: foundations & applications","topic":"Advanced Queuing Theory Analysis","field":"Business, Management and Accounting","cited_by":0,"is_retracted":false,"has_abstract":false,"route_ca_aff":true,"route_ca_fund":false,"route_ca_venue":false,"route_about_ca":false,"ca_institutions":"Université du Québec à Trois-Rivières; Innovation and Economic Development Trois Rivières","funders":"","keywords":"Cognitive radio; Power control; Key (lock); Queue; Game theory; Power (physics); Wireless; Wireless network; Interference (communication); Radio resource management","score_opus":0.015844954131966342,"score_gpt":0.2917052053602488,"score_spread":0.27586025122828245,"validation_status":"score_only:v0-immature-baseline","prediction":{"id":"W7148482919","genre_codex":"other","genre_gemma":"other","domain_codex":null,"domain_gemma":null,"model_version":"codex-gemma-dda1882f352a","genre_candidate":"other","genre_consensus":"other","domain_candidate":null,"domain_consensus":null,"prediction_status":"machine_predicted_unvalidated","genre_scores_codex":[0.00013301981,0.00062302704,0.39378425,0.002003083,0.00017669889,0.0022455393,0.000938357,0.00065063837,0.5994454],"genre_scores_gemma":[0.15116994,0.00067930866,0.010189695,0.0032938714,0.0005914744,0.0014351007,0.022670867,0.0004387942,0.8095309],"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","domain_scores_codex":[0.99711615,0.000038755843,0.00080863136,0.0013119883,0.00035010587,0.00037438472],"domain_scores_gemma":[0.9947879,0.00083102,0.00078464265,0.0031373356,0.00042083542,0.000038275193],"candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0011844506,0.0006016057,0.00065929553,0.0007682748,0.00063290895,0.00053600885,0.0014053142,0.00021843902,0.0017362457],"category_scores_gemma":[0.00040675348,0.00064502,0.00014435762,0.0004121455,0.00078565185,0.0010694729,0.0013709033,0.0005007131,0.00083944894],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_system_candidate":false,"about_ca_system_consensus":false,"study_design_scores_codex":[0.000017836799,0.00006642598,0.0000068975837,0.00018110027,0.000322874,0.000001179888,0.000045650213,0.000099679964,0.000009473413,0.9767236,0.00089048577,0.02163481],"study_design_scores_gemma":[0.00013861683,0.000004096144,0.000024465375,0.00010356673,0.0008090425,0.000001660838,0.00012699226,0.0090462435,1.2432297e-7,0.64569557,0.3436663,0.00038333947],"about_ca_topic_score_codex":0.00007441038,"about_ca_topic_score_gemma":0.00038456297,"teacher_disagreement_score":0.38359454,"about_ca_system_score_codex":0.00019205725,"about_ca_system_score_gemma":0.00016362059,"threshold_uncertainty_score":0.9999385},"labels":[],"label_agreement":null}]}